diff --git "a/cpp_dataset/train/train.jsonl" "b/cpp_dataset/train/train.jsonl"
new file mode 100644--- /dev/null
+++ "b/cpp_dataset/train/train.jsonl"
@@ -0,0 +1,3000 @@
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double PI = acos(-1.0);\n const double EPS = 1e-7;\n const long long BIG_PRIME7 = 1000000007;\n const long long BIG_PRIME9 = 1000000009;\n int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }\n char ch = 'a';\n int j, n, m, L, i;\n int N, C;\n int x, y, z, k;\n string f, s;\n int a[101], b[101];\n int main() {\n   cin >> x;\n   for (i = 0; i < x; i++) {\n     cin >> k;\n     if (k & 1) z++;\n   }\n   if (!(z & 1))\n     cout << (x - z);\n   else\n     cout << z;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 111111;\n int last[3 * N], pre[3 * N], v[3 * N], cnt[3 * N], cur = 0;\n inline void add(int a, int b) {\n   pre[cur] = last[a];\n   v[cur] = b;\n   last[a] = cur;\n   cur++;\n }\n set<int>* who[N];\n inline set<int>* merge(set<int>*& a, set<int>*& b) {\n   if (a->size() < b->size()) {\n     return merge(b, a);\n   } else {\n     for (set<int>::iterator it = b->begin(); it != b->end(); it++) {\n       if (a->find(-*it) != a->end()) {\n         a->erase(-*it);\n       } else {\n         a->insert(*it);\n       }\n     }\n     b->clear();\n     return a;\n   }\n }\n int used[N];\n void dfs(int u) {\n   used[u] = true;\n   for (int i = last[u]; i >= 0; i = pre[i])\n     if (!used[v[i]]) {\n       dfs(v[i]);\n       cnt[i ^ 1] = cnt[i] = who[v[i]]->size();\n       who[u] = merge(who[u], who[v[i]]);\n     }\n }\n set<int>* mem[N];\n int main() {\n   memset(last, -1, sizeof(last));\n   int n;\n   scanf('%d', &n);\n   for (int i = (0); i <= ((n - 1) - 1); i++) {\n     int u, v;\n     scanf('%d%d', &u, &v);\n     u--;\n     v--;\n     add(u, v);\n     add(v, u);\n   }\n   for (int i = (0); i <= ((n)-1); i++) mem[i] = who[i] = new set<int>();\n   int k;\n   scanf('%d', &k);\n   for (int i = (1); i <= ((k)); i++) {\n     int u, v;\n     scanf('%d%d', &u, &v);\n     u--;\n     v--;\n     if (u != v) {\n       who[u]->insert(i);\n       who[v]->insert(-i);\n     }\n   }\n   dfs(0);\n   for (int i = 0; i < cur; i += 2) {\n     if (i) printf(' ');\n     printf('%d', cnt[i]);\n   }\n   puts('');\n   for (int i = (0); i <= ((n)-1); i++) delete (mem[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MOD = 1e9 + 7;\n const int INF = 1e9 + 7;\n const int base = 1e9;\n const int MAX = 1e5;\n const double EPS = 1e-9;\n const double PI = acos(-1.);\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n, *a, *res, j = 0;\n   cin >> n;\n   a = new int[n];\n   res = new int[n];\n   set<int> cnt;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   for (int i = n - 1; i >= 0; i--) {\n     if (!cnt.count(a[i])) {\n       cnt.insert(a[i]);\n       res[j] = a[i];\n       j++;\n     }\n   }\n   cout << j << endl;\n   for (int i = j - 1; i >= 0; i--) {\n     cout << res[i] << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s;\n int n, m;\n int f[150][150][250][2];\n int main() {\n   cin >> s;\n   n = s.size();\n   scanf('%d', &m);\n   f[0][m][n][1] = true;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j <= m; j++)\n       for (int k = 0; k <= n * 2; k++)\n         for (int l = 0; l < 2; l++)\n           if (f[i][j][k][l])\n             if (s[i] == 'T') {\n               f[i + 1][j][k][1 - l] = true;\n               if (j != 0 && k - 1 + 2 * l >= 0)\n                 f[i + 1][j - 1][k - 1 + 2 * l][l] = true;\n             } else {\n               if (k - 1 + 2 * l >= 0) f[i + 1][j][k - 1 + 2 * l][l] = true;\n               if (j != 0) f[i + 1][j - 1][k][1 - l] = true;\n             }\n   int i = 0;\n   for (int j = 0; j <= m; j++)\n     if (j % 2 == 0)\n       for (int k = 0; k <= n * 2; k++)\n         for (int l = 0; l < 2; l++)\n           if (f[n][j][k][l]) {\n             if (k - n < 0 && n - k > i) i = n - k;\n             if (k - n > 0 && k - n > i) i = k - n;\n           }\n   printf('%d\n', i);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct cell {\n   bool up, down, right, left;\n   int degree;\n   cell() { up = down = left = right = degree = 0; }\n   void reset() { up = down = left = right = degree = 0; }\n };\n struct qcell {\n   int x, y, degree;\n   qcell() {\n     x = y = -1;\n     degree = 0;\n   }\n   qcell(int xx, int yy, int deg) {\n     x = xx;\n     y = yy;\n     degree = deg;\n   }\n };\n char pitch[2001][2001];\n cell info[2001][2001];\n int n, m;\n int empty_cells = 0;\n bool update(int x, int y) {\n   int degree = 0;\n   if (x >= 0 && x < n && y >= 0 && y < m) {\n     degree = info[x][y].degree;\n     if (pitch[x][y] != '.')\n       info[x][y].reset();\n     else {\n       info[x][y].up = (x - 1 >= 0 && pitch[x - 1][y] == '.');\n       info[x][y].down = (x + 1 < n && pitch[x + 1][y] == '.');\n       info[x][y].left = (y - 1 >= 0 && pitch[x][y - 1] == '.');\n       info[x][y].right = (y + 1 < m && pitch[x][y + 1] == '.');\n       info[x][y].degree = (info[x][y].up + info[x][y].down + info[x][y].left +\n                            info[x][y].right);\n     }\n   }\n   return degree != info[x][y].degree;\n }\n void do_push(int x, int y, queue<qcell> &q) {\n   if (x >= 0 && x < n && y >= 0 && y < m)\n     if (pitch[x][y] == '.')\n       if (info[x][y].degree == 1) q.push(qcell(x, y, 1));\n }\n void occupy(int x, int y, queue<qcell> &q) {\n   int xx = x, yy = y;\n   char dir = 'U';\n   if (info[x][y].down) dir = 'D';\n   if (info[x][y].left) dir = 'L';\n   if (info[x][y].right) dir = 'R';\n   if (dir == 'U') {\n     pitch[x][y] = 'v';\n     pitch[x - 1][y] = '^';\n     xx = x - 1;\n   } else if (dir == 'D') {\n     pitch[x][y] = '^';\n     pitch[x + 1][y] = 'v';\n     xx = x + 1;\n   } else if (dir == 'L') {\n     pitch[x][y] = '>';\n     pitch[x][y - 1] = '<';\n     yy = y - 1;\n   } else {\n     pitch[x][y] = '<';\n     pitch[x][y + 1] = '>';\n     yy = y + 1;\n   }\n   update(x, y);\n   update(xx, yy);\n   if (do_push) {\n     if (update(x - 1, y)) do_push(x - 1, y, q);\n     if (update(x + 1, y)) do_push(x + 1, y, q);\n     if (update(x, y - 1)) do_push(x, y - 1, q);\n     if (update(x, y + 1)) do_push(x, y + 1, q);\n     if (update(xx - 1, yy)) do_push(xx - 1, yy, q);\n     if (update(xx + 1, yy)) do_push(xx + 1, yy, q);\n     if (update(xx, yy - 1)) do_push(xx, yy - 1, q);\n     if (update(xx, yy + 1)) do_push(xx, yy + 1, q);\n   }\n   empty_cells -= 2;\n }\n int main() {\n   cin >> n >> m;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++) {\n       cin >> pitch[i][j];\n       if (pitch[i][j] == '.') empty_cells++;\n     }\n   queue<qcell> q;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++) {\n       update(i, j);\n       if (info[i][j].degree == 1) q.push(qcell(i, j, info[i][j].degree));\n     }\n   bool unique_sol = 1;\n   while (1) {\n     if (q.empty()) break;\n     qcell f = q.front();\n     q.pop();\n     if (info[f.x][f.y].degree == 0) {\n       if (pitch[f.x][f.y] == '.') {\n         unique_sol = false;\n         break;\n       }\n     } else\n       occupy(f.x, f.y, q);\n   }\n   if (unique_sol)\n     if (empty_cells != 0) unique_sol = 0;\n   if (!unique_sol)\n     cout << 'Not unique' << endl;\n   else\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < m; j++) cout << pitch[i][j];\n       cout << endl;\n     }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n int main() {\n   ios::sync_with_stdio(false);\n   int t;\n   cin >> t;\n   while (t--) {\n     string s, t;\n     cin >> s >> t;\n     vector<int> each[26];\n     int n, m;\n     n = s.length();\n     m = t.length();\n     for (int i = 0; i < n; ++i) {\n       each[s[i] - 'a'].push_back(i);\n     }\n     int las = INF, res = 0;\n     for (int i = 0; i < m; ++i) {\n       if (upper_bound(each[t[i] - 'a'].begin(), each[t[i] - 'a'].end(), las) !=\n           each[t[i] - 'a'].end()) {\n         las =\n             *upper_bound(each[t[i] - 'a'].begin(), each[t[i] - 'a'].end(), las);\n       } else {\n         if (each[t[i] - 'a'].empty()) {\n           res = -1;\n           break;\n         } else {\n           res++;\n           las = each[t[i] - 'a'][0];\n         }\n       }\n     }\n     cout << res << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, h, a, road_width = 0;\n   cin >> n >> h;\n   for (int i = 0; i < n; i++) {\n     cin >> a;\n     if (a > h)\n       road_width += 2;\n     else\n       road_width++;\n   }\n   cout << road_width << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int abs(int a, int b) {\n   if (a > b)\n     return a - b;\n   else\n     return b - a;\n }\n int main() {\n   int n, c, i, b, count = 0, index1 = 1, index2 = 1, flag = 0;\n   cin >> n >> c;\n   char *s;\n   s = new char[n + 2];\n   for (i = 1; i <= n; i++) {\n     cin >> s[i];\n   }\n   int *d = new int[n + 1];\n   for (i = 1; i <= n / 2; i++) {\n     b = abs((int)s[i], (int)s[n - i + 1]);\n     if (b < 13)\n       d[i] = d[n - i + 1] = b;\n     else\n       d[i] = d[n - i + 1] = 26 - b;\n   }\n   if (c > n / 2) c = 1 + n - c;\n   for (i = 1; i <= n / 2; i++) {\n     if (d[i] > 0) {\n       index1 = i;\n       break;\n     }\n   }\n   for (i = n / 2; i >= 1; i--) {\n     if (d[i] > 0) {\n       index2 = i;\n       flag = 1;\n       break;\n     }\n   }\n   if (c <= index1) {\n     count = index2 - c;\n   } else if (c <= index2) {\n     if (c - index1 > index2 - c)\n       count = 2 * (index2 - c) + c - index1;\n     else\n       count = 2 * (c - index1) + index2 - c;\n   } else\n     count = c - index1;\n   for (i = index1; i <= index2; i++) {\n     count += d[i];\n   }\n   if (flag == 1)\n     cout << count;\n   else\n     cout << 0;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int any_table[11][11];\n struct DammedPascalNUmber {\n   int tb[13][13];\n   DammedPascalNUmber() {\n     int i, j;\n     for (i = 0; i <= 12; i++)\n       for (j = 0; j <= i; j++) {\n         int &r = tb[i][j];\n         if (j == 0 || i == 0)\n           r = 1;\n         else\n           r = tb[i - 1][j - 1] + tb[i - 1][j];\n       }\n   }\n   int count(int n, int m) { return tb[n][m]; }\n } pas;\n int any(int dig, int amo) {\n   if (dig < amo) return 0;\n   if (amo < 0) return 0;\n   if (dig == 0) return 1;\n   int &r = any_table[dig][amo];\n   int i;\n   if (r >= 0) return r;\n   r = 1;\n   for (i = 0; i < amo; i++) r *= 2;\n   for (; i < dig; i++) r *= 8;\n   r *= pas.count(dig, amo);\n   return r;\n }\n int check(int m, int n) {\n   int i, j, t, r = 0;\n   for (i = 1; i <= m; i++) {\n     char str[15];\n     t = 0;\n     sprintf(str, '%d', i);\n     for (j = 0; str[j]; j++)\n       if (str[j] == '4' || str[j] == '7') t++;\n     if (t == n) r++;\n   }\n   return r;\n }\n int a[13];\n int dfs(int party, int quta) {\n   int r = 0, i;\n   if (party == 6) {\n     return 1;\n   }\n   for (i = quta; i >= 0; i--)\n     if (a[i] > 0) {\n       int t = a[i];\n       a[i]--;\n       r = (1LL * r + 1LL * t * 1LL * dfs(party + 1, quta - i) +\n            1LL * 1000000007) %\n           1000000007;\n       a[i]++;\n     }\n   return r;\n }\n void test(int n, int m) { printf('any(%d,%d)=%d\n', n, m, any(n, m)); }\n void test2(int m, int n) {\n   printf('(%d,%d)=%d a[%d]=%d\n', m, n, check(m, n), n, a[n]);\n }\n int main() {\n   memset(any_table, -1, sizeof(any_table));\n   int m, s, i, j, k, sn, lucked;\n   while (~scanf('%d', &m)) {\n     memset(a, 0, sizeof(a));\n     char str[15];\n     sprintf(str, '%d', m);\n     for (sn = 0; str[sn]; sn++)\n       ;\n     for (j = sn; j > 0; j--) {\n       a[j] = 0;\n       lucked = 0;\n       for (i = 0; i < sn; i++) {\n         int p = 0, q = 0;\n         k = str[i] - '0' - 1;\n         for (; k >= 0; k--)\n           if (k == 4 || k == 7)\n             q++;\n           else\n             p++;\n         if (p) a[j] += p * any(sn - i - 1, j - lucked);\n         if (q) a[j] += q * any(sn - i - 1, j - lucked - 1);\n         if (str[i] == '4' || str[i] == '7') {\n           lucked++;\n         }\n         if (i == sn - 1 && lucked == j) a[j]++;\n       }\n     }\n     a[0] = m;\n     for (i = 1; i <= sn; i++) a[0] -= a[i];\n     int ans = 0;\n     for (i = 1; i <= sn; i++)\n       if (a[i]) {\n         ans = (1LL * ans + 1LL * a[i] * dfs(0, i - 1) + 1LL * 1000000007) %\n               1000000007;\n       }\n     printf('%d\n', ans);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 10;\n const double pi = acos(-1);\n const int inf = 1 << 30;\n const int mod = 1e9 + 9;\n struct point {\n   int x, flag;\n   bool operator<(const point &a) const { return flag > a.flag; }\n } s, q;\n bool check(long long a[], int n, long long h, int x) {\n   priority_queue<int, vector<int>, less<int> > qwe;\n   for (int i = 1; i <= min(n, x); i++) qwe.push(a[i]);\n   int f = 1, pos;\n   while (!qwe.empty()) {\n     pos = qwe.top();\n     qwe.pop();\n     if (f) h -= pos;\n     f ^= 1;\n   }\n   if (h >= 0ll)\n     return true;\n   else\n     return false;\n }\n int main() {\n   int n;\n   long long h, a[maxn];\n   scanf('%d %lld', &n, &h);\n   for (int i = 1; i <= n; i++) scanf('%lld', &a[i]);\n   int l = 0, r = n, ans = 0;\n   while (l <= r) {\n     int mid = (l + r) >> 1;\n     if (check(a, n, h, mid))\n       l = mid + 1, ans = mid;\n     else\n       r = mid - 1;\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int64_t mod = 998244353;\n int gcd(int64_t a, int64_t b) {\n   while (a != 0 && b != 0) {\n     if (a >= b)\n       a = a % b;\n     else\n       b = b % a;\n   }\n   return a + b;\n }\n struct Fraction {\n   int64_t numerator;\n   int64_t devider;\n   Fraction(int64_t n = 0, int64_t d = 1) : numerator(n), devider(d){};\n   const Fraction& operator+(const Fraction& rv) {\n     if (rv.devider == devider) {\n       numerator += rv.numerator;\n       numerator %= mod;\n       return *this;\n     } else {\n       numerator *= rv.devider;\n       numerator %= mod;\n       numerator += rv.numerator * devider;\n       numerator %= mod;\n       devider *= rv.devider;\n       devider %= mod;\n       return *this;\n     }\n   }\n   const Fraction& operator*(const Fraction& rv) {\n     numerator *= rv.numerator;\n     devider *= rv.devider;\n     numerator %= mod;\n     devider %= mod;\n     return *this;\n   }\n };\n struct Item {\n   Item(Fraction f, int64_t s, int64_t v) : possibility(f), sum(s), val(v){};\n   Fraction possibility;\n   int64_t sum;\n   int64_t val;\n };\n void extended_euclid(int64_t a, int64_t b, int64_t& x, int64_t& y, int64_t& d) {\n   int64_t q, r, x1, x2, y1, y2;\n   if (b == 0) {\n     d = a, x = 1, y = 0;\n     return;\n   }\n   x2 = 1, x1 = 0, y2 = 0, y1 = 1;\n   while (b > 0) {\n     q = a / b, r = a - q * b;\n     x = x2 - q * x1, y = y2 - q * y1;\n     a = b, b = r;\n     x2 = x1, x1 = x, y2 = y1, y1 = y;\n   }\n   d = a, x = x2, y = y2;\n }\n int main() {\n   int64_t n, m;\n   std::cin >> n >> m;\n   std::vector<std::pair<int64_t, bool>> data;\n   int64_t posWeight = 0, negWeight = 0;\n   for (int64_t i = 0; i < n; ++i) {\n     int64_t a;\n     std::cin >> a;\n     if (a == 0)\n       data.push_back(std::make_pair(-1, false));\n     else\n       data.push_back(std::make_pair(-1, true));\n   }\n   for (auto& i : data) {\n     int64_t w;\n     std::cin >> w;\n     i.first = w;\n     if (i.second)\n       posWeight += w;\n     else\n       negWeight += w;\n   }\n   std::vector<Item> posVec{\n       Item(Fraction(1, 1), posWeight + negWeight, posWeight)},\n       negVec{Item(Fraction(1, 1), posWeight + negWeight, negWeight)};\n   for (int64_t i = 0; i < m; ++i) {\n     std::vector<Item> newPos, newNeg;\n     for (auto j : posVec) {\n       if (!newPos.size()) {\n         Fraction f(j.val, j.sum);\n         f = f * j.possibility;\n         newPos.push_back(Item(f, j.sum + 1, j.val + 1));\n       } else {\n         Fraction f(j.val, j.sum);\n         f = f * j.possibility;\n         newPos.rbegin()->possibility = newPos.rbegin()->possibility + f;\n       }\n       if (j.sum > j.val) {\n         Fraction f(j.sum - j.val, j.sum);\n         f = f * j.possibility;\n         newPos.push_back(Item(f, j.sum - 1, j.val));\n       }\n     }\n     for (auto j : negVec) {\n       if (!newNeg.size() && j.val > 1) {\n         Fraction f(j.val, j.sum);\n         f = f * j.possibility;\n         newNeg.push_back(Item(f, j.sum - 1, j.val - 1));\n       } else if (j.val > 1) {\n         Fraction f(j.val, j.sum);\n         f = f * j.possibility;\n         newNeg.rbegin()->possibility = newNeg.rbegin()->possibility + f;\n       }\n       Fraction f(j.sum - j.val, j.sum);\n       f = f * j.possibility;\n       newNeg.push_back(Item(f, j.sum + 1, j.val));\n     }\n     posVec = newPos;\n     negVec = newNeg;\n   }\n   Fraction pos, neg;\n   for (auto i : posVec) pos = pos + Fraction(i.val, 1) * i.possibility;\n   for (auto i : negVec) neg = neg + Fraction(i.val, 1) * i.possibility;\n   for (auto i : data) {\n     Fraction res;\n     if (i.second)\n       res = Fraction(i.first, posWeight) * pos;\n     else\n       res = Fraction(i.first, negWeight) * neg;\n     int64_t g = gcd(res.numerator, res.devider);\n     res.numerator /= g;\n     res.devider /= g;\n     int64_t d, x, y;\n     extended_euclid(res.devider, mod, x, y, d);\n     std::cout << (((x % mod + mod) % mod) * res.numerator) % mod << std::endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100005;\n int n, m, x, y, f[N], fa[N], ch[N][2];\n char op[5];\n long long a[N], siz[N], ssiz[N], ans[N], sans[N], sqsiz[N], all[N];\n bool isroot(int u) { return ch[fa[u]][0] != u && ch[fa[u]][1] != u; }\n int which(int u) { return u == ch[fa[u]][1]; }\n void pushup(int o) {\n   int lc = ch[o][0], rc = ch[o][1];\n   siz[o] = siz[lc] + siz[rc] + ssiz[o];\n   all[o] = all[lc] + all[rc] + a[o] * ssiz[o];\n   ans[o] = ans[lc] + ans[rc] + sans[o];\n   ans[o] += (ssiz[o] * ssiz[o] - sqsiz[o]) * a[o];\n   ans[o] += 2 * siz[rc] * ssiz[o] * a[o];\n   ans[o] += 2 * all[lc] * (siz[o] - siz[lc]);\n }\n void rotate(int x) {\n   int y = fa[x], z = fa[y], md = which(x);\n   if (!isroot(y)) {\n     ch[z][which(y)] = x;\n   }\n   fa[x] = z;\n   ch[y][md] = ch[x][!md];\n   fa[ch[y][md]] = y;\n   ch[x][!md] = y;\n   fa[y] = x;\n   pushup(y);\n   pushup(x);\n }\n void splay(int u) {\n   while (!isroot(u)) {\n     if (!isroot(fa[u])) {\n       rotate(which(u) == which(fa[u]) ? fa[u] : u);\n     }\n     rotate(u);\n   }\n }\n void access(int u) {\n   for (int v = 0; u; v = u, u = fa[u]) {\n     splay(u);\n     int rc = ch[u][1];\n     ssiz[u] += siz[rc];\n     sans[u] += ans[rc];\n     sqsiz[u] += siz[rc] * siz[rc];\n     ch[u][1] = v;\n     ssiz[u] -= siz[v];\n     sans[u] -= ans[v];\n     sqsiz[u] -= siz[v] * siz[v];\n     pushup(u);\n   }\n }\n void link(int u, int v) {\n   access(v);\n   splay(v);\n   access(u);\n   splay(u);\n   fa[u] = v;\n   ssiz[v] += siz[u];\n   sans[v] += ans[u];\n   sqsiz[v] += siz[u] * siz[u];\n   pushup(v);\n }\n void cut(int u, int v) {\n   access(u);\n   access(v);\n   splay(v);\n   splay(u);\n   fa[u] = 0;\n   ssiz[v] -= siz[u];\n   sans[v] -= ans[u];\n   sqsiz[v] -= siz[u] * siz[u];\n   pushup(v);\n }\n bool check(int u, int v) {\n   access(v);\n   splay(v);\n   splay(u);\n   if (isroot(v)) {\n     return false;\n   }\n   return true;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 2; i <= n; i++) {\n     scanf('%d', &f[i]);\n   }\n   for (int i = 1; i <= n; i++) {\n     scanf('%lld', &a[i]);\n     ans[i] = all[i] = a[i];\n   }\n   for (int i = 1; i <= n; i++) {\n     siz[i] = 1;\n     ssiz[i] = 1;\n   }\n   for (int i = 2; i <= n; i++) {\n     link(i, f[i]);\n   }\n   access(1);\n   splay(1);\n   printf('%.10lf\n', 1.0 * ans[1] / n / n);\n   scanf('%d', &m);\n   while (m--) {\n     scanf('%s%d%d', op, &x, &y);\n     if (op[0] == 'P') {\n       if (check(x, y)) {\n         swap(x, y);\n       }\n       cut(x, f[x]);\n       f[x] = y;\n       link(x, f[x]);\n       access(1);\n       splay(1);\n       printf('%.10lf\n', 1.0 * ans[1] / n / n);\n     } else {\n       access(x);\n       splay(x);\n       a[x] = y;\n       pushup(x);\n       printf('%.10lf\n', 1.0 * ans[x] / n / n);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long x, y, n, m, t, q, a, b, count = 0;\n   cin >> n >> m;\n   long long arr[n];\n   for (x = 0; x < n; x++) cin >> arr[x];\n   a = 0;\n   for (x = 0; x < n; x++) {\n     a = a + arr[x];\n     cout << a / m << ' ';\n     a = a % m;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int qread() {\n   char c;\n   int s = 0, f = 1;\n   while ((c = getchar()) < '0' || c > '9') (c == '-') && (f = -1);\n   do s = s * 10 + c - '0';\n   while ((c = getchar()) >= '0' && c <= '9');\n   return s * f;\n }\n int n, m;\n const int mod = 1e9 + 7;\n int a[100011], pos[100011], bin[100011], inv[100011], sum[100011],\n     lp = 0, val[100011], vv[100011], svv[100011];\n struct Ques {\n   int l, r, id;\n   bool operator<(const Ques &b) const { return r < b.r; }\n } q[100011];\n int ans[100011];\n int WWW(long long v) { return v > 2000000001 ? 2000000001 : v; }\n int main() {\n   n = qread();\n   m = qread();\n   bin[0] = inv[0] = 1;\n   for (int i = 1; i <= n; i++)\n     a[i] = qread(), bin[i] = (bin[i - 1] << 1) % mod,\n     inv[i] = 1ll * inv[i - 1] * ((mod + 1) >> 1) % mod,\n     sum[i] = ((sum[i - 1] + 1ll * a[i] * bin[i]) % mod + mod) % mod;\n   for (int i = 1; i <= m; i++) {\n     q[i].l = qread();\n     q[q[i].id = i].r = qread();\n   }\n   sort(q + 1, q + 1 + m);\n   pos[lp = 1] = 1;\n   int j = 1;\n   val[1] = a[1] * 2;\n   vv[1] = svv[1] = ((a[1] * 2) % mod + mod) % mod;\n   while (j <= m && q[j].r == 1) ans[q[j].id] = (a[1] + mod) % mod, j++;\n   for (int i = 2; i <= n; i++) {\n     if (a[i] <= 0)\n       pos[++lp] = i, val[lp] = 2 * a[i],\n       vv[lp] = (a[i] * 2ll % mod + mod) % mod,\n       svv[lp] = (svv[lp - 1] + vv[lp]) % mod;\n     else {\n       int cur =\n           WWW(0ll + val[lp] + bin[pos[lp] - pos[lp - 1] + 1] * 1ll * a[i]);\n       int cvv = (vv[lp] + bin[pos[lp] - pos[lp - 1] + 1] * 1ll * a[i]) % mod;\n       lp--;\n       while (lp && cur > 0) {\n         cur = WWW(0ll + val[lp] +\n                   (pos[lp] - pos[lp - 1] > 31 ? 2000000001\n                                               : bin[pos[lp] - pos[lp - 1]]) *\n                       1ll * cur);\n         cvv = (vv[lp] + bin[pos[lp] - pos[lp - 1]] * 1ll * cvv) % mod;\n         lp--;\n       }\n       val[++lp] = cur;\n       pos[lp] = i;\n       vv[lp] = cvv;\n       svv[lp] = (svv[lp - 1] + vv[lp]) % mod;\n     }\n     while (j <= m && q[j].r == i) {\n       if (q[j].l == q[j].r) {\n         ans[q[j].id] = (a[i] + mod) % mod;\n         j++;\n         continue;\n       }\n       int l = q[j].l + 1, Ans = (a[q[j].l] + mod) % mod;\n       int L = 1, R = lp;\n       while (L < R) {\n         int mid = (L + R) >> 1;\n         if (pos[mid] >= l)\n           R = mid;\n         else\n           L = mid + 1;\n       }\n       Ans = (Ans + svv[lp] - svv[L]) % mod;\n       Ans = (Ans + mod) % mod;\n       Ans = (Ans + (sum[pos[L]] - sum[l - 1] + mod) * 1ll * inv[l - 1]) % mod;\n       ans[q[j].id] = Ans;\n       j++;\n     }\n   }\n   for (int i = 1; i <= m; i++) printf('%d\n', ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1000000007;\n const long long inf = 1000000000000000000;\n int main() {\n   long long t;\n   cin >> t;\n   while (t--) {\n     long long n;\n     cin >> n;\n     vector<pair<long long, long long> > p(n);\n     for (auto& x : p) cin >> x.first >> x.second;\n     sort(p.begin(), p.end());\n     pair<long long, long long> now = {0, 0};\n     bool f = 1;\n     string ans = '';\n     for (int i = 0; i < n; i++) {\n       if (p[i].first >= now.first && p[i].second >= now.second) {\n         long long r = p[i].first - now.first, u = p[i].second - now.second;\n         while (r--) ans += 'R';\n         while (u--) ans += 'U';\n         now = p[i];\n       } else {\n         f = 0;\n         break;\n       }\n     }\n     if (f)\n       cout << 'YES\n' << ans << endl;\n     else\n       cout << 'NO\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   scanf('%d %d', &n, &m);\n   for (int i = 0; i < n; i++) {\n     if (i % 2 == 0) {\n       for (int j = 1; j <= m; j++) {\n         printf('#');\n       }\n     } else if (i % 4 == 1) {\n       for (int j = 1; j < m; j++) {\n         printf('.');\n       }\n       printf('#');\n     } else if (i % 4 == 3) {\n       printf('#');\n       for (int j = 1; j < m; j++) {\n         printf('.');\n       }\n     }\n     printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 65, mod = 1e9 + 7;\n vector<int> g[N];\n int w[N];\n int col[N], pr[N];\n int sz[N][2];\n long long ans = 0;\n void dfs(int v, int par = -1, int c = 0) {\n   pr[v] = par;\n   ++sz[v][c];\n   col[v] = c;\n   for (int u : g[v])\n     if (u != par) {\n       dfs(u, v, c ^ 1);\n       sz[v][0] += sz[u][0];\n       sz[v][1] += sz[u][1];\n     }\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 0; i < n; ++i) scanf('%d', w + i);\n   for (int i = 1; i < n; ++i) {\n     int u, v;\n     scanf('%d %d', &u, &v);\n     --u, --v;\n     g[u].push_back(v);\n     g[v].push_back(u);\n   }\n   ans = 0;\n   dfs(0);\n   for (int v = 0; v < n; ++v) {\n     vector<pair<int, int> > vs;\n     for (int u : g[v])\n       if (u != pr[v]) vs.emplace_back(sz[u][0], sz[u][1]);\n     if (pr[v] != -1) vs.emplace_back(sz[0][0] - sz[v][0], sz[0][1] - sz[v][1]);\n     long long cnt = n;\n     if (col[v]) {\n       for (pair<int, int> e : vs) {\n         cnt = (cnt + 1LL * e.second * (n - e.first - e.second)) % mod;\n         cnt = (cnt - 1LL * e.first * (n - e.first - e.second)) % mod;\n       }\n     } else {\n       for (pair<int, int> e : vs) {\n         cnt = (cnt - 1LL * e.second * (n - e.first - e.second)) % mod;\n         cnt = (cnt + 1LL * e.first * (n - e.first - e.second)) % mod;\n       }\n     }\n     cnt %= mod;\n     if (cnt < 0) cnt += mod;\n     ans = (ans + cnt * w[v]) % mod;\n   }\n   ans %= mod;\n   if (ans < 0) ans += mod;\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 1 << 28;\n const double INF = 1e12, EPS = 1e-9;\n int n, m, k;\n bool star[600][600];\n int sum[600][600];\n char in[600][600];\n void run() {\n   cin >> n >> m >> k;\n   for (int i = 0; i < n; i++) cin >> in[i];\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++) {\n       if (in[i][j] == '1' && in[i + 1][j] == '1' && in[i + 2][j] == '1' && j &&\n           in[i + 1][j - 1] == '1' && in[i + 1][j + 1] == '1')\n         star[i][j] = 1;\n     }\n   long long ans = 0;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++)\n       sum[i + 1][j + 1] =\n           star[i][j] + sum[i][j + 1] + sum[i + 1][j] - sum[i][j];\n   for (int a = 0; a < n; a++)\n     for (int b = a + 3; b <= n; b++) {\n       int l = 0, r = 2, cnt = 0;\n       for (; l < m; l++) {\n         while (r <= m && cnt < k) {\n           r++;\n           cnt += sum[b - 2][r - 1] - sum[a][r - 1] -\n                  (sum[b - 2][r - 2] - sum[a][r - 2]);\n         }\n         if (cnt < k || r > m) break;\n         ans += m - r + 1;\n         cnt -= sum[b - 2][l + 2] - sum[a][l + 2] -\n                (sum[b - 2][l + 1] - sum[a][l + 1]);\n       }\n     }\n   cout << ans << endl;\n }\n int main() { run(); }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void readi(int &x) {\n   int v = 0, f = 1;\n   char c = getchar();\n   while (!isdigit(c) && c != '-') c = getchar();\n   if (c == '-')\n     f = -1;\n   else\n     v = v * 10 + c - '0';\n   while (isdigit(c = getchar())) v = v * 10 + c - '0';\n   x = v * f;\n }\n void readll(long long &x) {\n   long long v = 0ll, f = 1ll;\n   char c = getchar();\n   while (!isdigit(c) && c != '-') c = getchar();\n   if (c == '-')\n     f = -1;\n   else\n     v = v * 10 + c - '0';\n   while (isdigit(c = getchar())) v = v * 10 + c - '0';\n   x = v * f;\n }\n void readc(char &x) {\n   char c;\n   while ((c = getchar()) == ' ')\n     ;\n   x = c;\n }\n void writes(string s) { puts(s.c_str()); }\n void writeln() { writes(''); }\n void writei(int x) {\n   if (!x) putchar('0');\n   char a[25];\n   int top = 0;\n   while (x) {\n     a[++top] = (x % 10) + '0';\n     x /= 10;\n   }\n   while (top) {\n     putchar(a[top]);\n     top--;\n   }\n }\n void writell(long long x) {\n   if (!x) putchar('0');\n   char a[25];\n   int top = 0;\n   while (x) {\n     a[++top] = (x % 10) + '0';\n     x /= 10;\n   }\n   while (top) {\n     putchar(a[top]);\n     top--;\n   }\n }\n inline long long inc(int &x) { return ++x; }\n inline long long inc(long long &x) { return ++x; }\n inline long long inc(int &x, long long y) { return x += y; }\n inline long long inc(long long &x, long long y) { return x += y; }\n inline double inc(double &x, double y) { return x += y; }\n inline long long dec(int &x) { return --x; }\n inline long long dec(long long &x) { return --x; }\n inline long long dec(int &x, long long y) { return x -= y; }\n inline long long dec(long long &x, long long y) { return x -= y; }\n inline double dec(double &x, double y) { return x -= y; }\n inline long long mul(int &x) { return x = ((long long)x) * x; }\n inline long long mul(long long &x) { return x = x * x; }\n inline long long mul(int &x, long long y) { return x *= y; }\n inline long long mul(long long &x, long long y) { return x *= y; }\n inline double mul(double &x, double y) { return x *= y; }\n inline long long divi(const int &x) {\n   long long ans, l, r, mid;\n   ans = 0;\n   l = 0;\n   r = 0x3fffffff;\n   while (l < r) {\n     mid = (l + r) / 2;\n     if (mid * mid <= x) {\n       ans = mid;\n       l = mid + 1;\n     } else\n       r = mid;\n   }\n   return ans;\n }\n inline long long divi(const long long &x) {\n   long long ans, l, r, mid;\n   ans = 0;\n   l = 0;\n   r = 0x3fffffff;\n   while (l < r) {\n     mid = (l + r) / 2;\n     if (mid * mid <= x) {\n       ans = mid;\n       l = mid + 1;\n     } else\n       r = mid;\n   }\n   return ans;\n }\n inline long long divi(int &x, long long y) { return x /= y; }\n inline long long divi(long long &x, long long y) { return x /= y; }\n inline double divi(double &x, double y) { return x /= y; }\n inline long long mod(int &x, long long y) { return x %= y; }\n inline long long mod(long long &x, long long y) { return x %= y; }\n int n, m, i, j, ct[100005], x, y, vis[100005];\n vector<int> e[100005];\n struct vt {\n   int id, deg;\n } a[100005];\n bool cmp(vt x, vt y) { return x.deg > y.deg; }\n bool dfs(int x) {\n   if (vis[x] == 1) return 1;\n   if (vis[x] == 2) return 0;\n   vis[x] = 1;\n   for (__typeof((e[x]).begin()) it = (e[x]).begin(); it != (e[x]).end(); it++)\n     if (dfs(*it)) return 1;\n   vis[x] = 2;\n   return 0;\n }\n bool check(int x) {\n   memset(vis, 0, sizeof(vis));\n   vis[x] = 2;\n   int i;\n   for (i = 1; i <= n; i++) {\n     if (!vis[i] && dfs(i)) {\n       for (i = 1; i <= n; i++)\n         if (vis[i] != 1) ct[i] = 1;\n       return 0;\n     }\n   }\n   return 1;\n }\n int main() {\n   double st = clock();\n   ios_base::sync_with_stdio(false);\n   ;\n   cin >> n >> m;\n   if ((1) <= ((m)))\n     for (((i)) = (1); ((i)) <= ((m)); ((i))++) {\n       cin >> x >> y;\n       e[x].push_back(y);\n     }\n   if ((1) <= ((n)))\n     for (((i)) = (1); ((i)) <= ((n)); ((i))++) {\n       a[i].id = i;\n       a[i].deg = e[i].size();\n     }\n   stable_sort(a + 1, a + n + 1, cmp);\n   if ((1) <= ((n)))\n     for (((i)) = (1); ((i)) <= ((n)); ((i))++) {\n       if ((clock() - st) / CLOCKS_PER_SEC > 0.9) break;\n       x = a[i].id;\n       if (ct[x] || !check(x)) continue;\n       cout << x;\n       return 0;\n     }\n   cout << '-1';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mxn = 1003, inf = 1e18 + 18;\n int n, m, lcp[mxn][mxn], rk[mxn][mxn], ri[mxn], tot;\n long long k, f[mxn];\n string s;\n struct S {\n   int l, r;\n } a[mxn * mxn];\n inline bool cmp(S a, S b) {\n   int p = a.l + lcp[a.l][b.l], q = b.l + lcp[a.l][b.l];\n   if (p > a.r or q > b.r) return a.r - a.l < b.r - b.l;\n   return s[p] < s[q];\n }\n inline long long add(long long a, long long b) {\n   return a + b > inf ? inf : a + b;\n }\n inline long long calc(int md) {\n   for (int i = 1; i <= n; ++i) {\n     ri[i] = i;\n     for (; ri[i] <= n and rk[i][ri[i]] < md;) ++ri[i];\n   }\n   memset(f, 0, sizeof(f)), f[n + 1] = 1;\n   for (int i = 1; i <= m; ++i) {\n     for (int j = n; j; --j) f[j] = add(f[j], f[j + 1]);\n     for (int j = 1; j <= n; ++j) f[j] = ri[j] <= n ? f[ri[j] + 1] : 0;\n     f[n + 1] = 0;\n   }\n   return f[1];\n }\n int main() {\n   cin >> n >> m >> k >> s, s = ' ' + s;\n   for (int i = n; i; --i)\n     for (int j = n; j; --j)\n       if (s[i] == s[j]) lcp[i][j] = lcp[i + 1][j + 1] + 1;\n   for (int i = 1; i <= n; ++i)\n     for (int j = i; j <= n; ++j) a[++tot] = (S){i, j};\n   sort(a + 1, a + tot + 1, cmp);\n   for (int i = 1; i <= tot; ++i) rk[a[i].l][a[i].r] = i;\n   int l = 1, r = tot, md;\n   for (; l <= r;) {\n     md = l + r >> 1;\n     if (calc(md) >= k)\n       l = md + 1;\n     else\n       r = md - 1;\n   }\n   for (int i = a[r].l; i <= a[r].r; ++i) putchar(s[i]);\n }\n "}
+{"func_code_string": "#include <algorithm>\n #include <cmath>\n #include <cstdio>\n #include <cstring>\n #include <iostream>\n #include <map>\n #include <set>\n #include <unordered_map>\n \n using namespace std;\n typedef long long LL;\n const int N = 3e5 + 10, mod = 998244353;\n string g[N];\n int dp[N];\n \n int fastPow(int a, int k) {\n     int res = 1;\n     while (k) {\n         if (k & 1) res = (LL)res * a % mod;\n         k >>= 1;\n         a = (LL)a * a % mod;\n     }\n     return res;\n }\n \n int main() {\n     ios::sync_with_stdio(false);\n     int n, m, sum = 0, res = 0;\n     n = 300000;\n     for (int i = 2; i <= n; i++) {\n         if (i & 1) sum = (sum + 1) % mod;\n         dp[i] = ((LL)dp[i - 1] * 2 % mod + sum + !(i & 1)) % mod;\n         sum = (sum << 1) % mod;\n     }\n     sum = 0;\n     cin >> n >> m;\n     for (int i = 0; i < n; i++) {\n         cin >> g[i];\n         for (auto c : g[i])\n             if (c == 'o') sum++;\n     }\n     for (int i = 0; i < n; i++) {\n         int cnt = 0, len = 0;\n         while (cnt <= m) {\n             if (cnt == m || g[i][cnt] == '*') {\n                 if (len) {\n                     res = (res + (LL)dp[len] *\n                                      fastPow(2, sum - len) % mod) %\n                           mod;\n                     len = 0;\n                 }\n             } else {\n                 len++;\n             }\n             cnt++;\n         }\n     }\n     for (int i = 0; i < m; i++) {\n         int cnt = 0, len = 0;\n         while (cnt <= n) {\n             if (cnt == n || g[cnt][i] == '*') {\n                 if (len) {\n                     res = (res + (LL)dp[len] *\n                                      fastPow(2, sum - len) % mod) %\n                           mod;\n                     len = 0;\n                 }\n             } else {\n                 len++;\n             }\n             cnt++;\n         }\n     }\n     cout << res << endl;\n     return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 100 + 10;\n char s[maxn];\n int f(char ch) {\n   if (ch == 'A') return 1;\n   if (ch == 'B') return 2;\n   if (ch == 'C') return 4;\n   return 0;\n }\n int main() {\n   scanf('%s', s + 1);\n   int l = strlen(s + 1);\n   for (int i = 1; i <= l - 2; ++i) {\n     int t = f(s[i]) | f(s[i + 1]) | f(s[i + 2]);\n     if (t == 7) {\n       cout << 'Yes' << endl;\n       return 0;\n     }\n   }\n   cout << 'No';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> tree[500001];\n bool intree[500001];\n vector<int> tmp(0);\n bool isleaf(int node) {\n   if (tree[node].size() == 1 && intree[(tree[node])[0]]) return true;\n   return false;\n }\n void DFS(int lvl, int node) {\n   intree[node] = true;\n   if (isleaf(node)) {\n     tmp.push_back(lvl);\n   }\n   for (int i = 0; i < tree[node].size(); i++) {\n     if (!intree[(tree[node])[i]]) {\n       DFS(lvl + 1, (tree[node])[i]);\n     }\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   int N;\n   cin >> N;\n   for (int i = 1; i <= N; i++) intree[i] = false;\n   int x, y;\n   for (int i = 0; i < N - 1; i++) {\n     cin >> x >> y;\n     tree[x].push_back(y);\n     tree[y].push_back(x);\n   }\n   intree[1] = true;\n   int ans = 0, c;\n   for (int i = 0; i < (tree[1]).size(); i++) {\n     tmp.clear();\n     DFS(0, (tree[1])[i]);\n     sort(tmp.begin(), tmp.end());\n     c = tmp.size();\n     for (int j = 0; j < c; j++) {\n       ans = max(ans, tmp[j] + c - j);\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   int n;\n   cin >> n;\n   vector<string> v(n);\n   for (int i = 0; i < n; i++) cin >> v[i];\n   for (int i = 1; i < n - 1; i++) {\n     for (int j = 1; j < n - 1; j++) {\n       if (v[i][j] == '#' and v[i + 1][j] == '#' and v[i][j + 1] == '#' and\n           v[i][j - 1] == '#' and v[i - 1][j] == '#') {\n         v[i][j] = 'a';\n         v[i + 1][j] = 'a';\n         v[i][j + 1] = 'a';\n         v[i][j - 1] = 'a';\n         v[i - 1][j] = 'a';\n       }\n     }\n   }\n   int c = 0;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < n; j++)\n       if (v[i][j] == '#') {\n         c = 1;\n         break;\n       }\n   if (c)\n     cout << 'NO' << endl;\n   else\n     cout << 'YES' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 1e5 + 5;\n int32_t main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   long long n;\n   cin >> n;\n   long long con = -1;\n   long long a[n + 5];\n   for (long long i = 1; i <= n; i++) {\n     cin >> a[i];\n   }\n   long long i = 1;\n   for (i = 1; i < n; i++) {\n     if (a[i + 1] == a[i]) {\n       con = i;\n       break;\n     }\n   }\n   if (con == -1) {\n     for (con = 1; con < n; con++) {\n       if (a[con] > a[con + 1]) {\n         break;\n       }\n     }\n   }\n   for (i = 1; i < con; i++) {\n     if (a[i + 1] < a[i]) {\n       cout << 'NO'\n            << '\n';\n       return 0;\n     }\n   }\n   while (a[con] == a[con + 1]) {\n     con++;\n   }\n   for (i = con; i < n; i++) {\n     if (a[i + 1] >= a[i]) {\n       cout << 'NO'\n            << '\n';\n       return 0;\n     }\n   }\n   cout << 'YES'\n        << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using ll = long long;\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   int N, K;\n   cin >> N >> K;\n   ll total = N + 1;\n   total += N;\n   total += min(2 * (K - 1) + (N - K), 2 * (N - K) + K - 1);\n   cout << total << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int k, n[20], a[20][5010], g[32768], f[32768], hsh[301781], ps[301781],\n     ans1[20], ans2[20], vis[20], TMS;\n pair<int, int> md[32768];\n long long sm[20];\n int get(int x) {\n   int y = (x + 1000000001) % 301781;\n   while (hsh[y] && hsh[y] ^ x + 1000000001) y = (y + 1) % 301781;\n   return y;\n }\n void dg(int x, int s1, int s2) {\n   if (x == k) {\n     f[s2 + s1] |= f[s1] * g[s2];\n     return;\n   }\n   dg(x + 1, s1, s2);\n   dg(x + 1, s1, s2 + (1 << x));\n   dg(x + 1, s1 + (1 << x), s2);\n }\n int main() {\n   scanf('%d', &k);\n   long long S = 0;\n   for (int i = 0; i < k; ++i) {\n     scanf('%d', n + i);\n     for (int j = 0; j < n[i]; ++j) {\n       int x;\n       scanf('%d', &x);\n       a[i][j] = x;\n       sm[i] += x;\n       S += x;\n       int w = get(x);\n       ps[w] = i;\n       hsh[w] = x + 1000000001;\n     }\n   }\n   if (S % k != 0) {\n     printf('No');\n     return 0;\n   }\n   S /= k;\n   for (int i = 0; i < k; ++i)\n     for (int j = 0; j < n[i]; ++j) {\n       int st = 1 << i, nw = i;\n       long long c = S - (sm[i] - a[i][j]);\n       int P = 1;\n       ++TMS;\n       for (;;) {\n         vis[nw] = TMS;\n         if (abs(c) > 1000000000) {\n           P = 0;\n           break;\n         }\n         int w = get(c);\n         if (!hsh[w]) {\n           P = 0;\n           break;\n         }\n         st |= 1 << ps[w];\n         if (ps[w] == i) {\n           P = c == a[i][j];\n           break;\n         }\n         c = S - (sm[ps[w]] - c);\n         nw = ps[w];\n         if (vis[nw] == TMS) {\n           P = 0;\n           break;\n         }\n       }\n       if (P) {\n         md[st] = make_pair(i, j);\n         g[st] = 1;\n       }\n     }\n   f[0] = 1;\n   dg(0, 0, 0);\n   if (f[(1 << k) - 1]) {\n     printf('Yes\n');\n     int ST = (1 << k) - 1;\n     while (ST) {\n       for (int _ = ST; _; _ = (_ - 1) & ST)\n         if (g[_] * f[ST - _]) {\n           int i = md[_].first, j = md[_].second, nw = i;\n           long long c = S - (sm[i] - a[i][j]), ls = a[i][j];\n           for (;;) {\n             int w = get(c);\n             ans1[ps[w]] = c;\n             ans2[ps[w]] = nw;\n             if (ps[w] == i) break;\n             ls = c;\n             nw = ps[w];\n             c = S - (sm[ps[w]] - c);\n           }\n           ST -= _;\n           break;\n         }\n     }\n     for (int i = 0; i < k; ++i) printf('%d %d\n', ans1[i], ans2[i] + 1);\n   } else {\n     printf('No');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long int test = 1;\n   for (; test > 0; --test) {\n     long long int n, a, b, c, d, c1 = 1, c2, c3, c4;\n     cin >> n >> a >> b >> c >> d;\n     c2 = c1 + b - c;\n     c3 = c2 + a - d;\n     c4 = c3 + c - b;\n     long long int m = 1 - min(min(c1, c2), min(c3, c4)),\n                   m1 = max(max(c1, c2), max(c3, c4));\n     if (m1 + abs(m) > n)\n       cout << 0 << endl;\n     else\n       cout << (n - (m1 + abs(m)) + 1) * n << endl;\n   }\n   return (0);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long int MAX = 1000000007;\n const long long int MAXN = 100010;\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, k;\n     cin >> n >> k;\n     if (n % 2 == 0 && k % 2 == 1)\n       cout << 'NO' << endl;\n     else if (n % 2 == 1 && k % 2 == 0)\n       cout << 'NO' << endl;\n     else {\n       if (k * k <= n)\n         cout << 'YES' << endl;\n       else\n         cout << 'NO' << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int d[250003];\n int main() {\n   int i, j, k, n, m, t, a[501][501], b[501][501];\n   cin >> t;\n   while (t--) {\n     cin >> n >> m;\n     for (i = 0; i < n; i++)\n       for (j = 0; j < m; j++) cin >> a[i][j], d[a[i][j]] = i;\n     for (i = 0; i < m; i++)\n       for (j = 0; j < n; j++) cin >> b[i][j];\n     for (i = 0; i < n; i++) {\n       for (j = 0; j < m; j++) {\n         cout << a[d[b[0][i]]][j] << ' ';\n       }\n       cout << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<pair<long long int, pair<long long int, long long int> > > P;\n int level[1007];\n double ans = 0;\n bool contains(pair<long long int, pair<long long int, long long int> > A,\n               pair<long long int, pair<long long int, long long int> > B) {\n   return (A.second.first - B.second.first) * (A.second.first - B.second.first) +\n              (A.second.second - B.second.second) *\n                  (A.second.second - B.second.second) <\n          (A.first) * (A.first);\n }\n int main() {\n   long long int i, j, k, l, m, n, x, y, z, a, b, r;\n   scanf('%lld', &n);\n   for (i = 0; i < n; i++) {\n     scanf('%lld', &x);\n     scanf('%lld', &y);\n     scanf('%lld', &r);\n     P.push_back(make_pair(r, make_pair(x, y)));\n   }\n   sort(P.begin(), P.end());\n   for (i = n - 1; i >= 0; i--) {\n     for (j = n - 1; j > i; j--) {\n       if (contains(P[j], P[i])) {\n         level[i] = max(level[i], level[j] + 1);\n       }\n     }\n     if (level[i] == 0) level[i] = 1;\n   }\n   for (i = 0; i < n; i++) {\n     if (level[i] <= 2)\n       ans += (P[i].first * P[i].first);\n     else {\n       if (level[i] % 2 == 1)\n         ans -= (P[i].first * P[i].first);\n       else\n         ans += (P[i].first * P[i].first);\n     }\n   }\n   printf('%.10lf\n', ans * 3.14159265358979);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long power(long long a, long long b) {\n   long long x = 1;\n   a = a % 1000000007ULL;\n   while (b) {\n     if (b & 1) x = (x * a) % 1000000007ULL;\n     a = (a * a) % 1000000007ULL;\n     b >>= 1;\n   }\n   return x;\n }\n inline long long inv(long long a) { return power(a, 1000000007ULL - 2); }\n long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; }\n const int N = 2e5 + 5;\n vector<int> adj[N];\n int n, dis[N];\n bool vis[N];\n int cnt[N], p[N];\n int tdis[N];\n vector<int> d[N];\n void dfs(int u, int dd, int par) {\n   vis[u] = true;\n   if (dd < 3)\n     tdis[u] = dd;\n   else\n     tdis[u] = N;\n   dis[u] = dd;\n   d[dd].push_back(u);\n   p[u] = par;\n   for (auto v : adj[u]) {\n     if (!vis[v]) dfs(v, dd + 1, u);\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin >> n;\n   int u, v;\n   for (int i = 1; i < n; i++) {\n     cin >> u >> v;\n     adj[u].push_back(v);\n     adj[v].push_back(u);\n   }\n   dfs(1, 0, 0);\n   int maxx = 0;\n   for (int i = 0; i < n; i++) {\n     if (d[i].size() == 0) break;\n     maxx = i;\n   }\n   int ans = 0;\n   for (int i = maxx; i > 1; i--) {\n     for (auto v : d[i]) {\n       if (dis[v] < 2 || tdis[v] == 2) continue;\n       ans++;\n       tdis[p[v]] = 2;\n       for (auto j : adj[p[v]]) tdis[j] = 2;\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int mod = 998244353;\n long long a[300001];\n long long n, m, k;\n int b[300001];\n void solve() {\n   cin >> n;\n   for (int i = 0; i < n; ++i) {\n     int x;\n     cin >> x;\n     a[x]++;\n     b[a[x]] += a[x];\n     k = (b[a[x]] >= i && b[a[x]] != n) ? b[a[x]] : k;\n   }\n   cout << k + 1;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   char str[2020];\n   long l;\n   cin >> l;\n   cin >> str;\n   int i, j, hs = 0, ts = 0;\n   for (i = 0; i < l; i++) {\n     if (str[i] == 'H')\n       hs++;\n     else\n       ts++;\n     str[l + i] = str[i];\n   }\n   int res = 1000000000;\n   int t;\n   for (i = 0; i < l; i++) {\n     t = 0;\n     for (j = 0; j < hs; j++) {\n       if (str[i + j] == 'T') t++;\n     }\n     if (t < res) res = t;\n     t = 0;\n     for (j = 0; j < ts; j++) {\n       if (str[i + j] == 'H') t++;\n     }\n     if (t < res) res = t;\n   }\n   cout << res;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[1000000 + 100], f2, x1, x2, b[1000000 + 100], razl, sol, pok1, pok2;\n double f1;\n int main() {\n   for (int i = 1; i <= 4; i++) cin >> a[i];\n   f1 = sqrt(1 + 8 * a[1]) * 1.0;\n   f2 = sqrt(1 + 8 * a[1]);\n   if (f1 != f2) {\n     printf('Impossible\n');\n     return 0;\n   }\n   f1 = sqrt(1 + 8 * a[4]) * 1.0;\n   f2 = sqrt(1 + 8 * a[4]);\n   if (f1 != f2) {\n     printf('Impossible\n');\n     return 0;\n   }\n   x1 = 1 + sqrt(1 + 8 * a[1]);\n   x1 /= 2;\n   x2 = 1 + sqrt(1 + 8 * a[4]);\n   x2 /= 2;\n   if (a[1] == 0 && a[2] == 0 && a[3] == 0) x1 = 0;\n   if (a[4] == 0 && a[2] == 0 && a[3] == 0) x2 = 0;\n   if (a[2] + a[3] != x1 * x2) {\n     printf('Impossible\n');\n     return 0;\n   }\n   for (int i = 1; i <= x1; i++) b[i] = 0;\n   for (int i = x1 + 1; i <= x1 + x2; i++) b[i] = 1;\n   sol = x1 * x2;\n   pok1 = x1;\n   pok2 = x1 + x2;\n   while (sol != a[2]) {\n     if (sol - x2 > a[2])\n       swap(b[pok1], b[pok2]), pok1--, pok2--, sol -= x2;\n     else {\n       swap(b[pok1], b[pok1 + sol - a[2]]);\n       break;\n     }\n   }\n   if (x1 + x2 == 0) printf('0');\n   for (int i = 1; i <= x1 + x2; i++) cout << b[i];\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void mohammed() {\n   ios::sync_with_stdio(0);\n   ios_base::sync_with_stdio(0);\n   cin.tie(0), cout.tie(0);\n }\n int main() {\n   mohammed();\n   int n, x, y;\n   cin >> n;\n   map<int, int> mp;\n   map<int, int>::iterator it;\n   for (int i = 0; i < n; i++) {\n     cin >> x >> y;\n     mp[x]++;\n     mp[y + 1]--;\n   }\n   x = 0;\n   for (it = mp.begin(); it != mp.end(); it++) {\n     it->second += x;\n     if (it->second > 2) {\n       cout << 'NO';\n       return 0;\n     }\n     x = it->second;\n   }\n   cout << 'YES';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double pi = acos(-1.0);\n template <typename T, typename U>\n inline void amin(T &x, U y) {\n   if (y < x) x = y;\n }\n template <typename T, typename U>\n inline void amax(T &x, U y) {\n   if (x < y) x = y;\n }\n template <class L, class R>\n ostream &operator<<(ostream &os, pair<L, R> P) {\n   return os << '(' << P.first << ',' << P.second << ')\n';\n }\n template <class T>\n ostream &operator<<(ostream &os, set<T> V) {\n   os << '[';\n   for (auto vv : V) os << vv << ', ';\n   return os << '\b\b]\n';\n }\n template <class T>\n ostream &operator<<(ostream &os, vector<T> V) {\n   os << '[';\n   for (auto vv : V) os << vv << ', ';\n   return os << '\b\b]\n';\n }\n template <class K, class X>\n ostream &operator<<(ostream &os, map<K, X> V) {\n   os << '[';\n   for (auto vv : V) os << vv << ', ';\n   return os << '\b\b]\n';\n }\n long int ceildiv(long int n, long int f) {\n   if (n % f) {\n     return n / f + 1;\n   } else\n     return n / f;\n }\n string checkTicket(vector<long> first, vector<long> second) {\n   int n = first.size();\n   if (first[0] < second[0]) {\n     for (int i = 0; i < n; i += 1) {\n       if (first[i] >= second[i]) {\n         return 'NO\n';\n       }\n     }\n   } else if (first[0] > second[0]) {\n     for (int i = 0; i < n; i += 1) {\n       if (first[i] <= second[i]) {\n         return 'NO\n';\n       }\n     }\n   } else {\n     return 'NO\n';\n   }\n   return 'YES\n';\n }\n int main() {\n   long int n;\n   cin >> n;\n   string s;\n   cin >> s;\n   vector<long> first, second;\n   for (int i = 0; i < n; i++) {\n     first.push_back(s[i] - '0');\n   }\n   for (int i = n; i < 2 * n; i++) {\n     second.push_back(s[i] - '0');\n   }\n   sort(first.begin(), first.end());\n   sort(second.begin(), second.end());\n   cerr << first << second;\n   cout << checkTicket(first, second);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 200005;\n int t[N];\n int p[N];\n int p2[N];\n int main() {\n   std::ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   long long sum = 0;\n   cin >> n;\n   for (int i = 0; i <= n; i++) {\n     cin >> t[i];\n     sum += t[i];\n   }\n   bool amb = 0;\n   for (int i = 1; i <= n; i++) {\n     if (t[i] > 1 && t[i - 1] > 1) amb = 1;\n   }\n   if (!amb) {\n     cout << 'perfect';\n     return 0;\n   }\n   cout << 'ambiguous' << '\n';\n   long long par = 1, k = 2;\n   p[1] = 0;\n   p2[1] = 0;\n   for (int i = 1; i <= n; i++) {\n     long long temp = k;\n     for (int j = 0; j < t[i]; j++) {\n       p[k] = par;\n       p2[k] = par;\n       k++;\n     }\n     par = temp;\n   }\n   k = 2;\n   for (int i = 1; i <= n; i++) {\n     if (t[i] > 1 && t[i - 1] > 1) {\n       p2[k]++;\n       break;\n     } else\n       k += t[i];\n   }\n   for (int i = 1; i <= sum; i++) cout << p[i] << ' ';\n   cout << '\n';\n   for (int i = 1; i <= sum; i++) cout << p2[i] << ' ';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   long long sum1 = 0, sum2 = 0;\n   long temp;\n   for (int i = 0; i < n; i++) {\n     cin >> temp;\n     sum1 += temp;\n   }\n   for (int i = 0; i < n - 1; i++) {\n     cin >> temp;\n     sum2 += temp;\n   }\n   cout << sum1 - sum2 << '\n';\n   for (int i = 0; i < n - 2; i++) {\n     cin >> temp;\n     sum2 -= temp;\n   }\n   cout << sum2;\n   return (0);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = (1 << 20) + 15;\n long long dp[N];\n pair<int, int> id[100];\n int bit[100], c[100], st[N];\n int main() {\n   int u, a, mi, n, m, i, j, b, x, p = 0, idd;\n   long long k, temp;\n   long long ret = 4e18;\n   scanf('%d%d%d', &n, &m, &b);\n   for (i = 0; i < n; ++i) {\n     scanf('%d%d%d', &c[i], &id[i].first, &mi);\n     a = 0;\n     for (j = 0; j < mi; ++j) scanf('%d', &u), a |= 1 << (u - 1);\n     bit[i] = a;\n     id[i].second = i;\n   }\n   memset(dp, -1, sizeof(dp));\n   sort(id, id + n);\n   dp[0] = 0;\n   ++p;\n   for (i = 0; i < n; ++i) {\n     k = id[i].first, idd = id[i].second;\n     if (dp[bit[idd]] != -1 && dp[bit[idd]] <= c[idd]) continue;\n     x = p;\n     for (j = 0; j < p; ++j) {\n       u = st[j] | bit[idd];\n       if (dp[u] == -1 && u != (1 << m) - 1) st[x++] = u;\n       if (dp[u] == -1 || dp[u] > dp[st[j]] + c[idd]) dp[u] = dp[st[j]] + c[idd];\n     }\n     if (dp[(1 << m) - 1] != -1) ret = min(ret, k * b + dp[(1 << m) - 1]);\n     p = x;\n   }\n   if (ret == 4e18) ret = -1;\n   cout << ret << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int cnt[1000100], a[1000100];\n int main() {\n   int n, k, ans;\n   scanf('%d', &n);\n   scanf('%d', &k);\n   for (long long i = 0; i < n; i++) scanf('%d', &a[i]);\n   int l = 0, r = 0, al, ar;\n   set<int> x;\n   cnt[a[0]]++;\n   x.insert(a[0]);\n   ans = 1;\n   al = 0, ar = 0;\n   while (l < n && r < n) {\n     r++;\n     x.insert(a[r]);\n     cnt[a[r]]++;\n     while ((long long)x.size() > k && l <= r) {\n       cnt[a[l]]--;\n       if (cnt[a[l]] == 0) x.erase(a[l]);\n       l++;\n     }\n     r = max(l, r);\n     if (r >= n) break;\n     if (r - l + 1 > ans) {\n       al = l;\n       ar = r;\n       ans = r - l + 1;\n     }\n   }\n   printf('%d %d\n', al + 1, ar + 1);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int M = 105;\n int l[M], r[M], t[M], c[M], res[M], p[M];\n int main() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < m; ++i) {\n     cin >> l[i] >> r[i] >> t[i] >> c[i];\n   }\n   for (int i = 1; i <= n; ++i) p[i] = INT_MAX;\n   for (int i = 0; i < m; ++i)\n     for (int j = l[i]; j <= r[i]; ++j)\n       if (t[i] < p[j]) p[j] = t[i], res[j] = i;\n   int sum = 0;\n   for (int i = 1; i <= n; ++i)\n     if (p[i] != INT_MAX) sum += c[res[i]];\n   cout << sum << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long double EPS = 1e-9, pi = acos(-1);\n const long long N = 1e5 + 5;\n long long r[N], h[N], n, F[N], dp[N];\n bool cmp(pair<long long, long long> a, pair<long long, long long> b) {\n   if (a.first == b.first) {\n     return a.second < b.second;\n   } else\n     return a.first < b.first;\n }\n void add(long long d, long long id) {\n   while (id <= n) {\n     F[id] = max(F[id], d);\n     id += (id & -id);\n   }\n }\n long long get(long long i) {\n   long long res = 0;\n   while (i) {\n     res = max(res, F[i]);\n     i -= (i & -i);\n   }\n   return res;\n }\n signed main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n;\n   for (long long i = 1; i <= n; ++i) cin >> r[i] >> h[i];\n   vector<pair<long long, long long> > A;\n   A.clear();\n   for (long long i = 1; i <= n; ++i) {\n     A.push_back({r[i] * r[i] * h[i], i});\n   }\n   sort(A.begin(), A.end(), cmp);\n   long long res = 0, id = 0, prev = A[0].first;\n   for (long long i = 0; i < n; ++i) {\n     if (prev != A[i].first) {\n       while (id < i) {\n         add(dp[id], A[id].second);\n         id++;\n       }\n     }\n     dp[i] = get(A[i].second) + A[i].first;\n     res = max(res, dp[i]);\n     prev = A[i].first;\n   }\n   cout << fixed << setprecision(9) << pi * res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   string str;\n   for (int i = 0; i < t; i++) {\n     cin >> str;\n     long long int res = 0;\n     long long int arr[str.size()];\n     if (str[0] == '+') {\n       arr[0] = 1;\n     } else {\n       arr[0] = -1;\n     }\n     for (int j = 1; j < str.size(); j++) {\n       if (str[j] == '+') {\n         arr[j] = arr[j - 1] + 1;\n       } else {\n         arr[j] = arr[j - 1] - 1;\n       }\n     }\n     int x = -1;\n     for (int j = 0; j < str.size(); j++) {\n       if (arr[j] == x) {\n         res = res + j + 1;\n         x--;\n       }\n     }\n     res = res + str.size();\n     cout << res << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n template <typename T>\n void MACRO_VAR_Scan(T& t) {\n   std::cin >> t;\n }\n template <typename First, typename... Rest>\n void MACRO_VAR_Scan(First& first, Rest&... rest) {\n   std::cin >> first;\n   MACRO_VAR_Scan(rest...);\n }\n template <typename T>\n void MACRO_VEC_ROW_Init(int n, T& t) {\n   t.resize(n);\n }\n template <typename First, typename... Rest>\n void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {\n   first.resize(n);\n   MACRO_VEC_ROW_Init(n, rest...);\n }\n template <typename T>\n void MACRO_VEC_ROW_Scan(int p, T& t) {\n   std::cin >> t[p];\n }\n template <typename First, typename... Rest>\n void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {\n   std::cin >> first[p];\n   MACRO_VEC_ROW_Scan(p, rest...);\n }\n template <typename T>\n inline T CHMAX(T& a, const T b) {\n   return a = (a < b) ? b : a;\n }\n template <typename T>\n inline T CHMIN(T& a, const T b) {\n   return a = (a > b) ? b : a;\n }\n void CHECKTIME(std::function<void()> f) {\n   auto start = std::chrono::system_clock::now();\n   f();\n   auto end = std::chrono::system_clock::now();\n   auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start))\n                  .count();\n   std::cerr << '[Time:' << res << 'ns  (' << res / (1.0e9) << 's)]\n';\n }\n template <class T>\n std::vector<std::vector<T>> VV(int n, int m, T init = T()) {\n   return std::vector<std::vector<T>>(n, std::vector<T>(m, init));\n }\n template <typename S, typename T>\n std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {\n   os << '(' << p.first << ', ' << p.second << ')';\n   return os;\n }\n using ll = long long;\n using ull = unsigned long long;\n using ld = long double;\n using PAIR = std::pair<ll, ll>;\n using PAIRLL = std::pair<ll, ll>;\n constexpr ll INFINT = 1 << 30;\n constexpr ll INFINT_LIM = (1LL << 31) - 1;\n constexpr ll INFLL = 1LL << 60;\n constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);\n constexpr double EPS = 1e-9;\n constexpr ll MOD = 1000000007;\n constexpr double PI = 3.141592653589793238462643383279;\n template <class T, size_t N>\n void FILL(T (&a)[N], const T& val) {\n   for (auto& x : a) x = val;\n }\n template <class ARY, size_t N, size_t M, class T>\n void FILL(ARY (&a)[N][M], const T& val) {\n   for (auto& b : a) FILL(b, val);\n }\n template <class T>\n void FILL(std::vector<T>& a, const T& val) {\n   for (auto& x : a) x = val;\n }\n template <class ARY, class T>\n void FILL(std::vector<std::vector<ARY>>& a, const T& val) {\n   for (auto& b : a) FILL(b, val);\n }\n namespace FFT {\n const double pi = std::acos(-1);\n std::vector<std::complex<double>> tmp;\n size_t sz = 1;\n std::vector<std::complex<double>> fft(std::vector<std::complex<double>> a,\n                                       bool inv = false) {\n   size_t mask = sz - 1;\n   size_t p = 0;\n   for (size_t i = sz >> 1; i >= 1; i >>= 1) {\n     auto& cur = (p & 1) ? tmp : a;\n     auto& nex = (p & 1) ? a : tmp;\n     std::complex<double> e = std::polar(1., 2 * pi * i * (inv ? -1 : 1) / sz);\n     std::complex<double> w = 1;\n     for (size_t j = 0; j < sz; j += i) {\n       for (size_t k = 0; k < i; ++k) {\n         nex[j + k] =\n             cur[((j << 1) & mask) + k] + w * cur[(((j << 1) + i) & mask) + k];\n       }\n       w *= e;\n     }\n     ++p;\n   }\n   if (p & 1) std::swap(a, tmp);\n   if (inv)\n     for (size_t i = 0; i < sz; ++i) a[i] /= sz;\n   return a;\n }\n std::vector<ll> mul(std::vector<ll> a, std::vector<ll> b) {\n   size_t m = a.size() + b.size() - 1;\n   sz = 1;\n   while (m > sz) sz <<= 1;\n   tmp.resize(sz);\n   std::vector<std::complex<double>> A(sz), B(sz);\n   for (size_t i = 0; i < a.size(); ++i) A[i].real(a[i]);\n   for (size_t i = 0; i < b.size(); ++i) B[i].real(b[i]);\n   A = fft(A);\n   B = fft(B);\n   for (size_t i = 0; i < sz; ++i) A[i] *= B[i];\n   A = fft(A, true);\n   a.resize(m);\n   for (size_t i = 0; i < m; ++i) a[i] = std::round(A[i].real());\n   return a;\n }\n };  // namespace FFT\n signed main() {\n   std::ios::sync_with_stdio(false);\n   std::cin.tie(0);\n   ;\n   ll n, x;\n   MACRO_VAR_Scan(n, x);\n   ;\n   std::vector<ll> a(n);\n   for (auto& i : a) std::cin >> i;\n   ;\n   for (ll i = 0; i < ll(n); ++i) a[i] = a[i] < x;\n   std::vector<ll> b;\n   {\n     ll cnt = 0;\n     for (ll i = 0; i < ll(n + 1); ++i) {\n       if (i == n || a[i]) {\n         b.emplace_back(cnt);\n         cnt = 0;\n       } else {\n         ++cnt;\n       }\n     }\n   }\n   ll m = b.size();\n   {\n     ll ans = 0;\n     for (ll i = 0; i < ll(m); ++i) {\n       ans += (ll)b[i] * (b[i] + 1) / 2;\n     }\n     std::cout << (ans);\n     ;\n   }\n   {\n     for (ll i = 0; i < ll(m); ++i) ++b[i];\n     auto bb(b);\n     std::reverse((bb).begin(), (bb).end());\n     auto c = FFT::mul(b, bb);\n     std::vector<ll> ans(n, 0);\n     ll p = 0;\n     for (ll i = ll(m - 1) - 1; i >= 0; --i) {\n       ans[p++] = c[i];\n     }\n     for (ll i = 0; i < ll(n); ++i) {\n       std::cout << ' ';\n       std::cout << (ans[i]);\n       ;\n     }\n     std::cout << '\n';\n     ;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, k;\n   cin >> n >> k;\n   for (int i = 0; i < k; i++) {\n     if (n % 10 != 0) {\n       n = n - 1;\n     } else if (n % 10 == 0) {\n       n = n / 10;\n     }\n   }\n   cout << n;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 5e5 + 100;\n template <class nmsl>\n inline void read(nmsl &x) {\n   x = 0;\n   char ch = getchar(), w = 0;\n   while (!isdigit(ch)) w = (ch == '-'), ch = getchar();\n   while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();\n   x = w ? -x : x;\n }\n long long n, f[N], size[N], root[N], hd[N], bianshu, ans;\n struct abc {\n   int nxt, to;\n } qwq[N * 2];\n inline void addedg(int lai, int qu) {\n   qwq[++bianshu].nxt = hd[lai];\n   qwq[bianshu].to = qu;\n   hd[lai] = bianshu;\n }\n inline void first_dp(int u, int father) {\n   size[u] = 1;\n   for (register int i = hd[u]; i; i = qwq[i].nxt) {\n     int v = qwq[i].to;\n     if (v == father) continue;\n     first_dp(v, u);\n     size[u] += size[v];\n     f[u] += f[v];\n   }\n   f[u] += size[u];\n   return;\n }\n inline void dp(int u, int father) {\n   f[u] = 0;\n   for (register int i = hd[u]; i; i = qwq[i].nxt) {\n     int v = qwq[i].to;\n     f[u] += f[v];\n   }\n   long long tot = f[u] + n;\n   ans = max(ans, tot);\n   for (register int i = hd[u]; i; i = qwq[i].nxt) {\n     int v = qwq[i].to;\n     if (v == father) continue;\n     size[u] = n - size[v];\n     f[u] = tot - f[v] - size[v];\n     dp(v, u);\n   }\n }\n int main() {\n   read(n);\n   for (register int i = 1, qa, qb; i < n; i++)\n     read(qa), read(qb), addedg(qa, qb), addedg(qb, qa);\n   first_dp(1, 0);\n   ans = f[1];\n   dp(1, 0);\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int M = 3000;\n int n, m;\n pair<pair<int, int>, int> v[M];\n map<pair<pair<int, int>, int>, vector<pair<pair<int, int>, int> > > Q;\n int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }\n pair<pair<int, int>, int> get(int x1, int y1, int x2, int y2) {\n   int x = x2 - x1, y = y2 - y1;\n   if (x == 0)\n     y = 1;\n   else if (y == 0)\n     x = 1;\n   else {\n     int d = gcd(x, y);\n     x /= d, y /= d;\n   }\n   if (x < 0) x = -x, y = -y;\n   return make_pair(make_pair(x, y), y1 * x - x1 * y);\n }\n int sign(double x) {\n   if (fabs(x) < 1E-6) return 0;\n   return (x > 0) ? 1 : -1;\n }\n double dist(int x1, int y1, int x2, int y2) {\n   return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n }\n bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {\n   if (a.first != b.first) return a.first < b.first;\n   return a.second > b.second;\n }\n int main() {\n   Q.clear();\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < (n); i++) {\n     int x1, y1, x2, y2;\n     scanf('%d%d%d%d', &x1, &y1, &x2, &y2);\n     x1 *= 2, y1 *= 2, x2 *= 2, y2 *= 2;\n     if (make_pair(x1, y1) > make_pair(x2, y2)) {\n       swap(x1, x2);\n       swap(y1, y2);\n     }\n     pair<pair<int, int>, int> tmp = get(x1, y1, x2, y2);\n     Q[tmp].push_back(make_pair(make_pair(x1, y1), 1));\n     Q[tmp].push_back(make_pair(make_pair(x2, y2), -1));\n   }\n   for (int i = 0; i < (m); i++) {\n     scanf('%d%d%d', &v[i].first.first, &v[i].first.second, &v[i].second);\n     for (int j = 0; j < (i); j++) {\n       if (v[i].second != v[j].second) continue;\n       int x1 = v[i].first.first, y1 = v[i].first.second, r = v[i].second;\n       int x2 = v[j].first.first, y2 = v[j].first.second;\n       if (sign(2 * r - dist(x1, y1, x2, y2)) >= 0) continue;\n       int x0 = x1 + x2, y0 = y1 + y2;\n       int x = x2 * 2 - x0, y = y2 * 2 - y0;\n       pair<pair<int, int>, int> tmp = get(x0, y0, x0 - y, y0 + x);\n       if (Q.find(tmp) == Q.end()) continue;\n       Q[tmp].push_back(make_pair(make_pair(x0, y0), 0));\n     }\n   }\n   int ret = 0;\n   for (__typeof(Q.begin()) it = Q.begin(); it != Q.end(); it++) {\n     sort(it->second.begin(), it->second.end(), cmp);\n     int now = 0;\n     for (__typeof(it->second.begin()) t = it->second.begin();\n          t != it->second.end(); t++) {\n       if (t->second == 0) ret += now;\n       now += t->second;\n     }\n   }\n   printf('%d\n', ret);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int mpow(int base, int exp);\n void solve() {\n   long double n;\n   cin >> n;\n   long double sum = 0;\n   while (n) {\n     long double d;\n     d = (1) * 1.0 / n;\n     sum += d;\n     n--;\n   }\n   cout << sum << '\n';\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   solve();\n   return 0;\n }\n int mpow(int base, int exp) {\n   base %= 1000000007;\n   int result = 1;\n   while (exp > 0) {\n     if (exp & 1) result = ((long long int)result * base) % 1000000007;\n     base = ((long long int)base * base) % 1000000007;\n     exp >>= 1;\n   }\n   return result;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<long long int> &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<long long int> &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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<vector<int>> v;\n     for (int i = 0; i < k; i++) {\n       int c;\n       cin >> c;\n       vector<int> 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<int> 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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<ld> cd;\n  \n typedef pair<int, int> pi;\n typedef pair<ll,ll> pl;\n typedef pair<ld,ld> pd;\n  \n typedef vector<int> vi;\n typedef vector<ld> vd;\n typedef vector<ll> vl;\n typedef vector<pi> vpi;\n typedef vector<pl> vpl;\n typedef vector<cd> vcd;\n \n template<class T> using pq = priority_queue<T>;\n template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\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<int>(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<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }\n template<class T> 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<typename T, typename V>\n void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ', '; __print(x.second); cerr << '}';}\n template<typename T>\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 <typename T, typename... V>\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<pi> rem;\n pqg<pi> 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 <bits/stdc++.h>\n using namespace std;\n long long k, b, n, t;\n int main() {\n   ios_base ::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> k >> b >> n >> t;\n   long long num = 1;\n   long long step = n;\n   while (t >= num) {\n     num = num * k + b;\n     step--;\n   }\n   if (step < 0) {\n     cout << 0;\n     return 0;\n   }\n   cout << step + 1;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long double pi = 3.14159265359;\n const long long N = 1e9 + 7;\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, m, arr[200005];\n   cin >> n >> m;\n   long long cntne = 0, cntpo = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> arr[i];\n     if (arr[i] == -1)\n       cntne++;\n     else\n       cntpo++;\n   }\n   vector<long long> v;\n   for (int i = 0; i < m; i++) {\n     long long l, r;\n     cin >> l >> r;\n     r++;\n     long long ans = abs(l - r);\n     if ((ans % 2 == 0) && (cntne >= ans / 2) && (cntpo >= ans / 2))\n       v.push_back(1);\n     else\n       v.push_back(0);\n   }\n   for (int i = 0; i < ((long long)((v).size())); i++) cout << v[i] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <iostream>\n #include <vector>\n #include <algorithm>\n #include <string>\n \n #define ll long long\n \n using namespace std;\n \n int main() {\n     ll qua;\n     cin >> qua;\n     for (int i = 0; i < qua; ++i) {\n         ll n;\n         cin >> n;\n         vector<int> vec(n);\n         for (int j = 0; j < n; ++j) {\n             cin >> vec[j];\n         }\n         cout << 0 << ' ';\n         for (int j = 1; j < n; ++j) {\n             ll r = (vec[j] | vec[j - 1]) - vec[j];\n             cout << r << ' ';\n             vec[j] += r;\n         }\n         cout << '\n';\n     }\n     return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MaxN = 100005;\n const int MaxM = MaxN * 2;\n const int oo = 0x3F3F3F3F;\n int ax[MaxM], K;\n int ret[MaxN];\n set<pair<int, int> > tr[MaxM];\n struct event {\n   int l, r, v, tp;\n   event() {}\n   event(int l, int r, int v, int tp) : l(l), r(r), v(v), tp(tp) {}\n   bool operator<(const event& e) const {\n     if (r != e.r)\n       return r > e.r;\n     else\n       return tp < e.tp;\n   }\n } e[MaxM];\n int getId(int v) { return lower_bound(ax, ax + K, v) - ax + 1; }\n void add(int k, pair<int, int> v) {\n   while (k <= K) {\n     tr[k].insert(v);\n     k += k & -k;\n   }\n }\n int read(int k, int v) {\n   pair<int, int> ret = make_pair(oo, -1);\n   while (k) {\n     set<pair<int, int> >::iterator it = tr[k].lower_bound(make_pair(v, 0));\n     if (it != tr[k].end()) ret = min(ret, *it);\n     k -= k & -k;\n   }\n   return ret.second;\n }\n int main() {\n   int N, M, en;\n   int l, r, t;\n   scanf('%d%d', &N, &M);\n   K = en = 0;\n   for (int i = 0; i < N; i++) {\n     scanf('%d%d%d', &l, &r, &t);\n     e[en++] = event(l, r, t, -i - 1);\n     ax[K++] = l;\n   }\n   for (int i = 0; i < M; i++) {\n     scanf('%d%d%d', &l, &r, &t);\n     e[en++] = event(l, r, t, i);\n     ax[K++] = l;\n   }\n   sort(ax, ax + K);\n   K = unique(ax, ax + K) - ax;\n   sort(e, e + en);\n   for (int i = 0; i < en; i++) {\n     if (e[i].tp < 0) {\n       add(getId(e[i].l), make_pair(e[i].v, -e[i].tp));\n     } else {\n       ret[e[i].tp] = read(getId(e[i].l), e[i].v);\n     }\n   }\n   for (int i = 0; i < M; i++) {\n     printf('%d ', ret[i]);\n   }\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T, typename U>\n std::istream& operator>>(std::istream& i, pair<T, U>& p) {\n   i >> p.first >> p.second;\n   return i;\n }\n template <typename T>\n std::istream& operator>>(std::istream& i, vector<T>& t) {\n   for (auto& v : t) {\n     i >> v;\n   }\n   return i;\n }\n template <typename T, typename U>\n std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) {\n   o << p.first << ' ' << p.second;\n   return o;\n }\n template <typename T>\n std::ostream& operator<<(std::ostream& o, const vector<T>& t) {\n   if (t.empty()) o << '\n';\n   for (size_t i = 0; i < t.size(); ++i) {\n     o << t[i] << ' \n'[i == t.size() - 1];\n   }\n   return o;\n }\n template <typename T>\n using minheap = priority_queue<T, vector<T>, greater<T>>;\n template <typename T>\n using maxheap = priority_queue<T, vector<T>, less<T>>;\n unsigned int logceil(long long first) {\n   return first ? 8 * sizeof(long long) - __builtin_clzll(first) : 0;\n }\n namespace std {\n template <typename T, typename U>\n struct hash<pair<T, U>> {\n   hash<T> t;\n   hash<U> u;\n   size_t operator()(const pair<T, U>& p) const {\n     return t(p.first) ^ (u(p.second) << 7);\n   }\n };\n }  // namespace std\n template <typename T, typename F>\n T bsh(T l, T h, const F& f) {\n   T r = -1, m;\n   while (l <= h) {\n     m = (l + h) / 2;\n     if (f(m)) {\n       l = m + 1;\n       r = m;\n     } else {\n       h = m - 1;\n     }\n   }\n   return r;\n }\n template <typename F>\n double bshd(double l, double h, const F& f, double p = 1e-9) {\n   unsigned int r = 3 + (unsigned int)log2((h - l) / p);\n   while (r--) {\n     double m = (l + h) / 2;\n     if (f(m)) {\n       l = m;\n     } else {\n       h = m;\n     }\n   }\n   return (l + h) / 2;\n }\n template <typename T, typename F>\n T bsl(T l, T h, const F& f) {\n   T r = -1, m;\n   while (l <= h) {\n     m = (l + h) / 2;\n     if (f(m)) {\n       h = m - 1;\n       r = m;\n     } else {\n       l = m + 1;\n     }\n   }\n   return r;\n }\n template <typename F>\n double bsld(double l, double h, const F& f) {\n   unsigned int r = 200;\n   while (r--) {\n     double m = (l + h) / 2;\n     if (f(m)) {\n       h = m;\n     } else {\n       l = m;\n     }\n   }\n   return (l + h) / 2;\n }\n template <typename T>\n T gcd(T a, T b) {\n   if (a < b) swap(a, b);\n   return b ? gcd(b, a % b) : a;\n }\n template <typename T>\n class vector2 : public vector<vector<T>> {\n  public:\n   vector2() {}\n   vector2(size_t a, size_t b, T t = T())\n       : vector<vector<T>>(a, vector<T>(b, t)) {}\n };\n template <typename T>\n class vector3 : public vector<vector2<T>> {\n  public:\n   vector3() {}\n   vector3(size_t a, size_t b, size_t c, T t = T())\n       : vector<vector2<T>>(a, vector2<T>(b, c, t)) {}\n };\n template <typename T>\n class vector4 : public vector<vector3<T>> {\n  public:\n   vector4() {}\n   vector4(size_t a, size_t b, size_t c, size_t d, T t = T())\n       : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {}\n };\n template <typename T>\n class vector5 : public vector<vector4<T>> {\n  public:\n   vector5() {}\n   vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T())\n       : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {}\n };\n class GOmkarAndPies {\n  public:\n   vector<std::pair<int, int>> D;\n   int N, M, K;\n   void fix(int p) {\n     for (int i = 0; i < K; ++i) {\n       int s = p ^ 1 << i;\n       if (D[s].first > D[p].first + 1) {\n         D[s] = {D[p].first + 1, D[p].second};\n         fix(s);\n       }\n     }\n   };\n   void solve(istream& cin, ostream& cout) {\n     cin >> N >> M >> K;\n     string S, T;\n     cin >> S >> T;\n     vector<std::pair<int, int>> P(N);\n     cin >> P;\n     for (std::pair<int, int>& p : P) {\n       p.first--;\n       p.second--;\n     }\n     vector<int> X(K);\n     iota(X.begin(), X.end(), 0);\n     vector<vector<int>> W{X};\n     for (int i = 0; i < N; ++i) {\n       swap(X[P[i].first], X[P[i].second]);\n       vector<int> I(K);\n       for (int j = 0; j < K; ++j) I[X[j]] = j;\n       W.push_back(X);\n     }\n     auto apply = [&](int first, string S) {\n       int p = 0;\n       for (int i = 0; i < K; ++i) {\n         p |= (S[i] - '0') << W[first][i];\n       }\n       return p;\n     };\n     D.assign(1 << K, {K + 1, -1});\n     pair<int, std::pair<int, int>> ans{K + 1, {-1, -1}};\n     for (int i = N - M; i >= 0; --i) {\n       int TX = apply(i + M, T);\n       D[TX] = {0, i + M};\n       fix(TX);\n       int SX = apply(i, S);\n       ans = min(ans, {D[SX].first, {i + 1, D[SX].second}});\n     }\n     cout << K - ans.first << '\n' << ans.second << '\n';\n   }\n };\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   GOmkarAndPies solver;\n   std::istream& in(std::cin);\n   std::ostream& out(std::cout);\n   solver.solve(in, out);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s;\n   cin >> s;\n   cout << (regex_match(s, regex('(1|14|144)*')) ? 'YES' : 'NO');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 3e3 + 5;\n int dw[N], up[N], E[N][2], Mn;\n vector<pair<int, int> > g[N];\n void dfs_down(int v, int p) {\n   dw[v] = 0;\n   for (pair<int, int> u : g[v])\n     if (u.first != p) dfs_down(u.first, v), dw[v] += dw[u.first] + u.second;\n }\n void dfs_up(int v, int p, int f = -1) {\n   if (f != -1) {\n     up[v] = up[p] + dw[p] - dw[v] + f - (f == 0);\n   } else\n     up[v] = 0;\n   Mn = min(Mn, dw[v] + up[v]);\n   for (pair<int, int> u : g[v])\n     if (u.first != p) dfs_up(u.first, v, u.second ^ 1);\n }\n int main() {\n   ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n   int n;\n   cin >> n;\n   if (n == 1) return cout << '0\n', 0;\n   for (int i = 0; i < n - 1; i++) {\n     cin >> E[i][0] >> E[i][1];\n     g[E[i][0]].push_back({E[i][1], 0});\n     g[E[i][1]].push_back({E[i][0], 1});\n   }\n   int ans = n;\n   for (int i = 0; i < n - 1; i++) {\n     Mn = n, dfs_down(E[i][0], E[i][1]), dfs_up(E[i][0], E[i][1]);\n     int cur = Mn;\n     Mn = n, dfs_down(E[i][1], E[i][0]), dfs_up(E[i][1], E[i][0]);\n     cur += Mn;\n     ans = min(ans, cur);\n   }\n   cout << ans << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   cout << ceil(n / 2.0) - 1;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 10;\n int y[N], pos[N];\n int main() {\n   int n, m, t = 0, ans = 0, cnt = 0;\n   scanf('%d %d', &n, &m);\n   for (int i = 1; i <= n; i++) scanf('%d', &y[i]);\n   for (int i = 1; i <= m; i++) {\n     int y1, y2, x;\n     scanf('%d %d %d', &y1, &y2, &x);\n     if (y1 == 1) {\n       pos[++t] = y2;\n     }\n     if (y2 == 1e9) {\n       ans++;\n     }\n   }\n   sort(y + 1, y + 1 + n);\n   sort(pos + 1, pos + 1 + t);\n   int i = 1, j = 1;\n   cnt = t, ans += n;\n   while (i <= n) {\n     while (j <= t) {\n       if (pos[j] < y[i]) {\n         j++, cnt--;\n       } else\n         break;\n     }\n     ans = min(ans, cnt + i - 1);\n     i++;\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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'), c = getchar();\n   return x * f;\n }\n const int N = 505, mod = 1e9 + 7;\n inline int inc(int x, int y) {\n   x += y - mod;\n   return x + (x >> 31 & mod);\n }\n inline int mul(int x, int y) { return 1ll * x * y % mod; }\n inline void Inc(int &x, int y) { x = inc(x, y); }\n int n, a[N], f[N][N];\n int main() {\n   n = read();\n   for (int i = 1; i <= n; i++) a[i] = read(), f[i][i] = 1;\n   for (int i = 1; i <= n + 1; i++) f[i][i - 1] = 1;\n   for (int len = 2; len < n; len++)\n     for (int l = 1; l <= n - len + 1; l++) {\n       int r = l + len - 1;\n       f[l][r] = f[l + 1][r];\n       for (int k = l + 1; k <= r; k++)\n         if (a[k] > a[l]) Inc(f[l][r], mul(f[l + 1][k - 1], f[k][r]));\n     }\n   printf('%d\n', f[2][n]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 2001;\n char a[MAXN][MAXN];\n int n, v[MAXN], r[MAXN], c[MAXN];\n int gao() {\n   int ret = 0;\n   memset(r, 0, sizeof(int) * n);\n   memset(c, 0, sizeof(int) * n);\n   for (int i = 0; i < n - 1; ++i) {\n     for (int j = n - 1; j > i; --j) {\n       if (a[i][j] ^ r[i] ^ c[j]) {\n         ++ret;\n         r[i] ^= 1;\n         c[j] ^= 1;\n       }\n     }\n   }\n   for (int i = 0; i < n; ++i) v[i] ^= (r[i] ^ c[i]);\n   memset(r, 0, sizeof(int) * n);\n   memset(c, 0, sizeof(int) * n);\n   for (int i = n - 1; i > 0; --i) {\n     for (int j = 0; j < i; ++j) {\n       if (a[i][j] ^ r[i] ^ c[j]) {\n         ++ret;\n         r[i] ^= 1;\n         c[j] ^= 1;\n       }\n     }\n   }\n   for (int i = 0; i < n; ++i) v[i] ^= (r[i] ^ c[i]);\n   for (int i = 0; i < n; ++i) ret += v[i];\n   return ret;\n }\n int main() {\n   while (scanf('%d', &n) != EOF) {\n     memset(v, 0, sizeof(int) * n);\n     for (int i = 0; i < n; ++i) {\n       scanf('%s', a[i]);\n       for (int j = 0; j < n; ++j) a[i][j] -= '0';\n       v[i] ^= (int)a[i][i];\n     }\n     printf('%d\n', gao());\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n using namespace std;\n typedef double db;\n typedef uint32_t u32;\n typedef uint64_t u64;\n typedef pair<int, int> pii;\n typedef pair<int, int> point;\n #define fi first\n #define se second\n #define pb(x) push_back(x)\n #define SZ(x) ((int) (x).size())\n #define all(x) (x).begin(), (x).end()\n #define rep(i, l, r) for(int i = l; i < r; i++)\n typedef long long ll;\n const int mod = 998244353;\n \n \n \n int main() {\n #ifdef local\n 	freopen('in.txt', 'r', stdin);\n #endif\n 	ios::sync_with_stdio(false);\n 	cin.tie(0), cout.tie(0);\n 	const int mod = 1e9 + 7;\n 	int n;\n 	cin >> n;\n 	vector<int> a(n);\n 	ll tot = 0;\n 	for(auto &e : a) {\n 		cin >> e;\n 		tot += e;\n 	}\n 	if(tot % n) {\n 		cout << '0\n';\n 		return 0;\n 	}\n 	vector<int> fac(n + 1, 1);\n 	vector<int> ifac(n + 1, 1);\n 	for(int i = 2; i <= n; i++) {\n 		fac[i] = (ll) fac[i - 1] * i % mod;\n 		ifac[i] = (ll) ifac[mod % i] * (mod - mod / i) % mod;\n 	}\n 	for(int i = 2; i <= n; i++) {\n 		ifac[i] = (ll) ifac[i] * ifac[i - 1] % mod;\n 	}\n 	auto C = [&](int n, int m) {\n 		if(n < m || m < 0) return 0ll;\n 		return (ll) fac[n] * ifac[m] % mod * ifac[n - m] % mod;\n 	};\n 	ll avg = tot / n;\n 	vector<int> l, r;\n 	int eq = 0;\n 	for(auto &e : a) {\n 		if(e > avg) {\n 			r.push_back(e);\n 		} else if(e < avg) {\n 			l.push_back(e);\n 		} else {\n 			eq++;\n 		}\n 	}\n 	int ans = 1;\n 	if(l.size() > 1 && r.size() > 1) {\n 		ans = 2;\n 	}\n 	if(l.size() == 1) {\n 		r.push_back(l[0]);\n 		l.clear();\n 	}\n 	if(r.size() == 1) {\n 		l.push_back(r[0]);\n 		r.clear();\n 	}\n 	sort(all(l));\n 	sort(all(r));\n 	int a1 = fac[l.size()];\n 	int a2 = fac[r.size()];\n 	for(int i = 0, j = 0; i < (int) l.size(); i = j) {\n 		while(j < (int) l.size() && l[j] == l[i]) {\n 			j++;\n 		}\n 		a1 = (ll) a1 * ifac[j - i] % mod;\n 	}\n 	for(int i = 0, j = 0; i < (int) r.size(); i = j) {\n 		while(j < (int) r.size() && r[j] == r[i]) {\n 			j++;\n 		}\n 		a2 = (ll) a2 * ifac[j - i] % mod;\n 	}\n 	int a3 = C(n, eq);\n 	ans = (ll) ans * a1 % mod;\n 	ans = (ll) ans * a2 % mod;\n 	ans = (ll) ans * a3 % mod;\n 	cout << ans << '\n';\n 	return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main(void) {\n   int n;\n   cin >> n;\n   set<int> a, b;\n   vector<pair<int, int> > ans(n);\n   for (int i = 0; i < n; ++i) {\n     cin >> ans[i].first >> ans[i].second;\n     --ans[i].first;\n     --ans[i].second;\n     if (ans[i].first == -1) a.insert(i);\n     if (ans[i].second == -1) b.insert(i);\n   }\n   while (a.size() > 1) {\n     int node = *a.begin();\n     a.erase(a.begin());\n     int last = node;\n     while (ans[last].second != -1) last = ans[last].second;\n     auto nxt = b.begin();\n     if (*nxt == last) ++nxt;\n     ans[*nxt].second = node;\n     ans[node].first = *nxt;\n     b.erase(nxt);\n   }\n   for (int i = 0; i < n; ++i)\n     cout << ans[i].first + 1 << ' ' << ans[i].second + 1 << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int a[n], sm = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n     sm += a[i];\n   }\n   vector<int> ind, r;\n   int need = sm / 2;\n   if (a[0] > need) {\n     cout << 1 << endl;\n     cout << 1;\n     return 0;\n   }\n   for (int i = 1; i < n; i++) {\n     if ((2 * a[i]) <= a[0]) {\n       ind.push_back(i + 1);\n       r.push_back(a[i]);\n     }\n   }\n   bool ok;\n   int u = a[0];\n   for (auto x : r) {\n     u += x;\n   }\n   if (u > need) {\n     ok = true;\n   } else {\n     ok = false;\n   }\n   if (ok) {\n     cout << ind.size() + 1 << endl;\n     cout << 1 << ' ';\n     for (auto x : ind) {\n       cout << x << ' ';\n     }\n   } else {\n     cout << 0;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int nbVoyages, coutSimple, coutLiaison, maxCartes, coutCarte;\n map<pair<string, string>, int> routes;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin >> nbVoyages >> coutSimple >> coutLiaison >> maxCartes >> coutCarte;\n   long long total = 0;\n   string derFin = '';\n   for (int iVoyage = 0; iVoyage < nbVoyages; iVoyage++) {\n     string a, b;\n     cin >> a >> b;\n     string der = b, pre = a;\n     if (b < a) swap(a, b);\n     if (routes.find({a, b}) == routes.end()) routes[{a, b}] = 0;\n     if (derFin == pre) {\n       routes[{a, b}] += coutLiaison;\n       total += coutLiaison;\n     } else {\n       routes[{a, b}] += coutSimple;\n       total += coutSimple;\n     }\n     derFin = der;\n   }\n   vector<int> couts;\n   for (pair<pair<string, string>, int> route : routes) {\n     couts.push_back(route.second);\n   }\n   sort(couts.begin(), couts.end());\n   for (int iFois = 0; iFois < maxCartes; iFois++) {\n     if (!couts.empty() && couts.back() > coutCarte) {\n       total += coutCarte - couts.back();\n       couts.pop_back();\n     }\n   }\n   cout << total << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 0x3f3f3f3f;\n const double eps = 1e-6;\n const int mod = 1000000007;\n int modpow(int x, int y, int md) {\n   if (y == 0) return 1;\n   int ret = modpow(x, y >> 1, md);\n   ret = (long long)ret * ret % md;\n   if (y & 1) ret = (long long)ret * x % md;\n   return ret;\n }\n int n;\n int sum[5555];\n vector<int> g[5555];\n set<pair<int, int> > ans;\n void dfs(int x, int par = 0) {\n   sum[x] = 1;\n   for (auto to : g[x])\n     if (to != par) dfs(to, x);\n   for (auto to : g[x])\n     if (to != par) sum[x] += sum[to];\n   vector<bool> ok(5555, false);\n   ok[0] = true;\n   for (auto to : g[x])\n     if (to != par) {\n       for (int i = 5005; i >= 0; i--)\n         if (ok[i] && i + sum[to] <= 5005) ok[i + sum[to]] = true;\n     }\n   for (int i = 1; i <= 5005; i++)\n     if (ok[i] && n - i - 1 >= 1)\n       ans.insert(make_pair(i, n - i - 1)), ans.insert(make_pair(n - i - 1, i));\n }\n int main() {\n   cin >> n;\n   for (int i = 1; i < n; i++) {\n     int a, b;\n     cin >> a >> b;\n     g[a].push_back(b);\n     g[b].push_back(a);\n   }\n   dfs(1);\n   cout << ans.size() << endl;\n   for (auto p : ans) cout << p.first << ' ' << p.second << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s[3];\n int N, M, p[3][1000005], a[3][1000005], b[1000005];\n void genPrefix(int pat) {\n   int i, k;\n   p[pat][0] = 0;\n   k = 0;\n   i = 1;\n   while (i < M) {\n     if (s[pat][i] == s[pat][k]) {\n       k++;\n       p[pat][i] = k;\n       i++;\n     } else {\n       if (k != 0)\n         k = p[pat][k - 1];\n       else {\n         p[pat][i] = 0;\n         i++;\n       }\n     }\n   }\n }\n void KMPSearch(int txt, int pat) {\n   int i, k;\n   genPrefix(pat);\n   i = k = 0;\n   while (i < N) {\n     if (s[txt][i] == s[pat][k]) {\n       i++;\n       k++;\n       a[txt][i - k] = i - 1;\n     }\n     if (k == M) {\n       k = p[pat][k - 1];\n     } else if (i < N && s[txt][i] != s[pat][k]) {\n       if (k != 0) {\n         if (s[txt][i - 1] == s[pat][k])\n           a[txt][i - k] = max(i - 1, a[txt][k - 1]);\n         k = p[pat][k - 1];\n         if (k > 0 && s[txt][i - 1] == s[pat][k])\n           a[txt][i - k] = max(i - 1, a[txt][k - 1]);\n       } else\n         i++;\n     }\n   }\n }\n int bs(int low, int high, int v) {\n   int mid, x = -1;\n   while (low <= high) {\n     mid = (low + high) >> 1;\n     if (b[mid] >= v) {\n       x = mid;\n       high = mid - 1;\n     } else\n       low = mid + 1;\n   }\n   return x;\n }\n pair<int, int> solve() {\n   s[2] = s[0];\n   reverse(s[2].begin(), s[2].end());\n   memset(a, -1, sizeof(a));\n   KMPSearch(1, 2);\n   KMPSearch(0, 1);\n   b[0] = a[1][0];\n   int i, j = N, len, k, x;\n   int ansx = -1, ansy = -1;\n   for (i = 1; i <= N - 1; i++) b[i] = max(b[i - 1], a[1][i]);\n   for (i = 0; i <= N - 2; i++) {\n     j--;\n     if (s[0][i] != s[1][j]) break;\n     if (b[0] >= j - 1) {\n       ansx = i;\n       ansy = i + 1;\n     }\n     if (a[0][i + 1] <= 0 || i + 1 == N - 1) continue;\n     len = min(N - 2, a[0][i + 1]) - i;\n     k = bs(0, len, j - 1);\n     if (k >= 0 && ansx < i) {\n       ansx = i;\n       ansy = i + 1 + k;\n     }\n   }\n   return make_pair(ansx, ansy);\n }\n int main() {\n   std::ios_base::sync_with_stdio(0);\n   int cases, caseno = 0, n, i, j, k, cnt, m;\n   getline(cin, s[0]);\n   getline(cin, s[1]);\n   N = s[0].size();\n   M = s[1].size();\n   if (N != M) {\n     cout << '-1 -1' << '\n';\n     return 0;\n   }\n   pair<int, int> ans = solve();\n   cout << ans.first << ' ' << ans.second << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, x;\n   scanf('%d%d', &n, &x);\n   if (n == 1) {\n     printf('YES\n');\n     printf('%d\n', x);\n   } else if (n == 2) {\n     if (x == 0)\n       printf('NO\n');\n     else {\n       printf('YES\n');\n       printf('0 %d\n', x);\n     }\n   } else {\n     printf('YES\n');\n     int tmp = 0;\n     int a = (1 << 17);\n     int b = (1 << 18);\n     for (int i = 0; i < n - 3; i++) {\n       printf('%d ', i);\n       tmp ^= i;\n     }\n     printf('%d %d %d\n', a, b, a ^ b ^ tmp ^ x);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool psort(std::vector<long long int> p1, std::vector<long long int> p2) {\n   return p1[0] < p2[0];\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long int n, m;\n   cin >> n;\n   std::vector<vector<long long int> > v(n, vector<long long int>(3));\n   for (int i = 0; i < n; ++i) {\n     cin >> v[i][0];\n   }\n   for (int i = 0; i < n; ++i) {\n     cin >> v[i][1];\n   }\n   for (int i = 0; i < n; ++i) {\n     cin >> v[i][2];\n   }\n   sort(v.begin(), v.end(), psort);\n   cin >> m;\n   long long int start[4] = {0};\n   for (int i = 0; i < m; ++i) {\n     long long int k, t, flag = 0;\n     cin >> t;\n     while (start[t] < n) {\n       if (v[start[t]][0] != -1) {\n         if (v[start[t]][1] == t || v[start[t]][2] == t) {\n           cout << v[start[t]][0] << ' ';\n           v[start[t]][0] = -1;\n           start[t]++;\n           flag = 1;\n           break;\n         }\n       }\n       start[t]++;\n     }\n     if (flag == 0) cout << -1 << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   string fld;\n   cin >> fld;\n   int l = 1, r = 2 * n;\n   int ans = -1;\n   while (l <= r) {\n     int mid = (l + r) >> 1;\n     int posbl = 1;\n     int back = -1, flag = 0;\n     for (int i = 0; i < n; i++) {\n       if (fld[i] == '*')\n         if (i > back && flag == 0) back = i, flag = 1;\n       if (fld[i] == 'P') {\n         if (back == -1) {\n           back = i + mid;\n         } else {\n           if (i <= back) {\n             back = max(back, i + mid);\n           } else {\n             if (flag == 1) {\n               if (i - back > mid) {\n                 posbl = 0;\n                 break;\n               } else if (i - back <= mid && mid <= (2 * (i - back)))\n                 back = max(i, (mid - (i - back)) / 2 + i);\n               else {\n                 back =\n                     max(mid - (2 * (i - back)) + i, (mid - (i - back)) / 2 + i);\n               }\n             } else {\n               back = i + mid;\n             }\n           }\n         }\n         flag = 0;\n       }\n     }\n     if (flag == 1) posbl = 0;\n     if (posbl == 1) {\n       r = mid - 1;\n       ans = mid;\n     } else\n       l = mid + 1;\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 10;\n char s[N];\n char t1[7] = 'twone';\n char t2[4] = 'one';\n char t3[4] = 'two';\n int main() {\n   int T;\n   scanf('%d', &T);\n   while (T--) {\n     scanf('%s', s);\n     int ans = 0;\n     int len = strlen(s);\n     for (int i = 0; i < len; i++) {\n       if (s[i] == 't') {\n         int f = 0;\n         for (int j = i; j <= i + 4; j++) {\n           if (s[j] != t1[j - i]) {\n             f = 1;\n             break;\n           }\n         }\n         if (f == 0) {\n           s[i + 2] = '-';\n           ans++;\n         }\n       }\n     }\n     for (int i = 0; i < len; i++) {\n       if (s[i] == 't') {\n         int f = 0;\n         for (int j = i; j <= i + 2; j++) {\n           if (s[j] != t3[j - i]) {\n             f = 1;\n             break;\n           }\n         }\n         if (f == 0) {\n           s[i + 1] = '-';\n           ans++;\n         }\n       }\n     }\n     for (int i = 0; i < len; i++) {\n       if (s[i] == 'o') {\n         int f = 0;\n         for (int j = i; j <= i + 2; j++) {\n           if (s[j] != t2[j - i]) {\n             f = 1;\n             break;\n           }\n         }\n         if (f == 0) {\n           s[i + 1] = '-';\n           ans++;\n         }\n       }\n     }\n     printf('%d\n', ans);\n     for (int i = 0; i < len; i++)\n       if (s[i] == '-') printf('%d ', i + 1);\n     printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   long long int n, m = 0, p = 0, cnt = 0, f = 0;\n   cin >> n;\n   long long int a[n];\n   for (long long int i = 0; i < n; i++) {\n     cin >> a[i];\n     if (a[i] < 0) {\n       m++;\n     }\n     if (a[i] > 0) p++;\n     if (a[i] < 0) {\n       cnt = cnt - a[i] - 1;\n     }\n     if (a[i] > 0) {\n       cnt = cnt + a[i] - 1;\n     }\n     if (a[i] == 0) {\n       cnt = cnt + 1;\n       f++;\n     }\n   }\n   if (f and m % 2 == 0) cout << cnt << endl;\n   if (f and m % 2 != 0) cout << cnt << endl;\n   if (!f and m % 2 == 0) cout << cnt << endl;\n   if (!f and m % 2 != 0) cout << cnt + 2 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n int A[600006];\n vector<int> G[600006];\n int dfn[600006], bc[600006], clo;\n int g[600006][20], dep[600006];\n void dfs(int u) {\n   dfn[u] = ++clo, bc[clo] = u;\n   if (u == 1) dep[u] = 1;\n   for (int v : G[u]) {\n     g[v][0] = u;\n     dep[v] = dep[u] + 1;\n     for (int k = (1), kend = (18); k <= kend; ++k)\n       if (g[g[v][k - 1]][k - 1])\n         g[v][k] = g[g[v][k - 1]][k - 1];\n       else\n         break;\n     dfs(v);\n   }\n }\n int lca(int u, int v) {\n   if (dep[u] < dep[v]) swap(u, v);\n   if (dep[u] != dep[v])\n     for (int k = (18), kend = (0); k >= kend; --k)\n       if (dep[g[u][k]] >= dep[v]) u = g[u][k];\n   if (u == v) return u;\n   for (int k = (18), kend = (0); k >= kend; --k)\n     if (g[u][k] != g[v][k]) u = g[u][k], v = g[v][k];\n   return g[u][0];\n }\n int dis(int u, int v) { return dep[u] + dep[v] - 2 * dep[lca(u, v)]; }\n set<int> S;\n void solve() {\n   cin >> n;\n   ++n;\n   for (int i = (2), iend = (n); i <= iend; ++i) {\n     int p;\n     scanf('%d', &p);\n     G[p].push_back(i);\n   }\n   dfs(1);\n   int s = 1, t = 1, lt = 0;\n   auto wkr = [&](int x) { return max(dis(x, s), dis(x, t)); };\n   S.insert(1);\n   for (int i = (2), iend = (n); i <= iend; ++i) {\n     int is = dis(i, s), it = dis(i, t), flg = 0;\n     if (is >= lt && is >= it)\n       t = i, lt = is, flg = 1;\n     else if (it >= lt && it >= is)\n       s = i, lt = it, flg = 1;\n     if (!flg) {\n       printf('%d\n', (int)S.size());\n       continue;\n     }\n     auto tr = S.lower_bound(dfn[i]), st = tr;\n     while (tr != S.end()) {\n       if (wkr(bc[*tr]) < lt)\n         ++tr;\n       else\n         break;\n     }\n     if (tr == S.end()) {\n       auto sr = S.begin();\n       while (sr != st) {\n         if (wkr(bc[*sr]) < lt)\n           ++sr;\n         else\n           break;\n       }\n       S.erase(S.begin(), sr);\n     }\n     S.erase(st, tr);\n     tr = S.lower_bound(dfn[i]), st = tr;\n     while (tr != S.begin()) {\n       --tr;\n       if (wkr(bc[*tr]) >= lt) {\n         ++tr;\n         break;\n       }\n     }\n     if (tr == S.begin()) {\n       auto sr = S.end();\n       while (sr != st) {\n         --sr;\n         if (wkr(bc[*sr]) >= lt) {\n           ++sr;\n           break;\n         }\n       }\n       S.erase(sr, S.end());\n     }\n     S.erase(tr, st);\n     S.insert(dfn[i]);\n     printf('%d\n', (int)S.size());\n   }\n }\n signed main() { solve(); }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct fenwick {\n   long long n, fen[100005];\n   void resize(int _n) {\n     n = _n + 1;\n     memset(fen, 0, sizeof fen);\n   }\n   int query(int ind) {\n     ind++;\n     int ans = 0;\n     while (ind >= 1) {\n       ans += fen[ind];\n       ind -= ind & -ind;\n     }\n     return ans;\n   }\n   void update(int ind, int val) {\n     ind++;\n     while (ind <= n) {\n       fen[ind] += val;\n       ind += ind & -ind;\n     }\n   }\n   int query(int l, int r) { return query(r) - query(l - 1); }\n };\n const int maxn = 100001;\n int n, l, w, x, y, sz[maxn];\n long long res;\n bool blocked[maxn];\n vector<pair<int, int> > c, v[maxn];\n fenwick tree;\n void dfs(int node, int pnode, int curw, int curl) {\n   c.push_back(make_pair(curw, curl));\n   for (auto &i : v[node])\n     if (i.first != pnode && !blocked[i.first])\n       dfs(i.first, node, curw + i.second, curl + 1);\n }\n long long solve(int node, int curw, int curl) {\n   long long ret = 0;\n   c.clear();\n   dfs(node, 0, curw, curl);\n   sort(c.begin(), c.end());\n   for (auto &i : c) tree.update(i.second, 1);\n   for (int i = 0, j = c.size() - 1; i < c.size(); i++) {\n     while (i <= j && c[i].first + c[j].first > w)\n       tree.update(c[j--].second, -1);\n     if (j < i) break;\n     tree.update(c[i].second, -1);\n     ret += tree.query(l - c[i].second);\n   }\n   return ret;\n }\n int dfsz(int node, int pnode) {\n   sz[node] = 1;\n   for (auto &i : v[node])\n     if (i.first != pnode && !blocked[i.first]) sz[node] += dfsz(i.first, node);\n   return sz[node];\n }\n int find(int node, int pnode, int n) {\n   for (auto &i : v[node])\n     if (i.first != pnode && !blocked[i.first] && 2 * sz[i.first] > n)\n       return find(i.first, node, n);\n   return node;\n }\n void decompose(int node) {\n   int centroid = find(node, 0, dfsz(node, 0));\n   blocked[centroid] = 1;\n   res += solve(centroid, 0, 0);\n   for (auto &i : v[centroid])\n     if (!blocked[i.first]) res -= solve(i.first, i.second, 1);\n   for (auto &i : v[centroid])\n     if (!blocked[i.first]) decompose(i.first);\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   cin >> n >> l >> w;\n   tree.resize(n + 1);\n   for (int i = 2; i <= n && cin >> x >> y; i++) {\n     v[i].push_back(make_pair(x, y));\n     v[x].push_back(make_pair(i, y));\n   }\n   decompose(1);\n   cout << res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int maxn = 1e5 + 10;\n const int N = 5e2 + 10;\n using namespace std;\n long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); }\n long long qpow(long long p, long long q) {\n   long long f = 1;\n   while (q) {\n     if (q & 1) f = f * p % 1000000007;\n     p = p * p % 1000000007;\n     q >>= 1;\n   }\n   return f;\n }\n int n, m, k, t;\n vector<int> d[4][11][10];\n char a[maxn], b[maxn];\n int gao(char p) {\n   if (p == 'A')\n     return 0;\n   else if (p == 'T')\n     return 1;\n   else if (p == 'G')\n     return 2;\n   else\n     return 3;\n }\n void add(vector<int>& d, int x, int y) {\n   while (x < d.size()) d[x] += y, x += x & (-x);\n }\n int get(vector<int>& d, int x) {\n   int ret = 0;\n   while (x) ret += d[x], x -= x & (-x);\n   return ret;\n }\n int main() {\n   int i, j;\n   scanf('%s', a + 1);\n   n = strlen(a + 1);\n   for (i = 0; i <= (int)3; i++)\n     for (j = 1; j <= (int)10; j++)\n       for (k = 0; k <= (int)j - 1; k++) d[i][j][k].resize((n + j - 1) / j + 1);\n   for (i = 1; i <= n; i++) {\n     for (j = 1; j <= 10; j++) {\n       add(d[gao(a[i])][j][(i - 1) % j], (i - 1) / j + 1, 1);\n     }\n   }\n   int q;\n   scanf('%d', &q);\n   while (q--) {\n     int op, x, y;\n     scanf('%d%d', &op, &x);\n     if (op == 1) {\n       scanf('%s', b);\n       for (i = 1; i <= (int)10; i++)\n         add(d[gao(a[x])][i][(x - 1) % i], (x - 1) / i + 1, -1);\n       for (i = 1; i <= (int)10; i++)\n         add(d[gao(b[0])][i][(x - 1) % i], (x - 1) / i + 1, 1);\n       a[x] = b[0];\n     } else {\n       scanf('%d%s', &y, b);\n       int len = strlen(b), ret = 0;\n       for (i = 0; i < len && i < y - x + 1; i++) {\n         int mo = (i + x - 1) % len;\n         ret += get(d[gao(b[i])][len][mo], (y - 1 - mo) / len + 1) -\n                get(d[gao(b[i])][len][mo], (x - 1 + len - 1 - mo) / len);\n       }\n       printf('%d\n', ret);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int i, j, t;\n   cin >> t;\n   for (long long int aa = 0; aa < t; aa++) {\n     long long int n, k, d;\n     cin >> n >> k >> d;\n     long long int mini = k;\n     vector<long long int> v(n);\n     map<long long int, long long int> m;\n     for (i = 0; i < n; i++) {\n       cin >> v[i];\n       if (i < d) {\n         long long int ss = m.size();\n         m[v[i]]++;\n         if (ss < m.size()) m[v[i]] = 1;\n       }\n     }\n     m.size() < mini ? mini = m.size() : mini = mini;\n     for (i = 1; i < n - d + 1; i++) {\n       m[v[i - 1]]--;\n       if (m[v[i - 1]] == 0) m.erase(v[i - 1]);\n       long long int ss = m.size();\n       m[v[i + d - 1]]++;\n       if (ss < m.size()) m[v[i + d - 1]] = 1;\n       m.size() < mini ? mini = m.size() : mini = mini;\n     }\n     m.size() < mini ? mini = m.size() : mini = mini;\n     cout << mini << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int *p = new int[n + 1], c = 0;\n   int *m = new int[n + 1];\n   for (int i = 0; i <= n; i++) {\n     p[i] = m[i] = 0;\n     c ^= i;\n     m[i] = c;\n   }\n   int f = 0;\n   for (int i = 1; i <= n; i++) {\n     cin >> p[i];\n     f ^= p[i];\n   }\n   int r = 0;\n   for (int i = 2; i <= n; i++) {\n     int grps = (n / i);\n     int rem = n % i;\n     if (grps & 1) r ^= m[i - 1];\n     r ^= m[rem];\n   }\n   cout << (r ^ f);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 5;\n long long a[maxn], b[maxn], dp[maxn];\n int q[maxn];\n int head = 0, tail = 0;\n double A(int i, int j) { return dp[i] - dp[j]; }\n double B(int i, int j) { return b[i] - b[j]; }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> a[i];\n   for (int i = 1; i <= n; i++) cin >> b[i];\n   dp[1] = 0;\n   int head = 1, tail = 1;\n   q[tail] = 1;\n   for (int i = 2; i <= n; i++) {\n     while (head < tail &&\n            A(q[head + 1], q[head]) / B(q[head + 1], q[head]) >= -a[i])\n       head++;\n     dp[i] = dp[q[head]] + b[q[head]] * a[i];\n     while (head < tail && A(i, q[tail]) / B(i, q[tail]) >=\n                               A(q[tail], q[tail - 1]) / B(q[tail], q[tail - 1]))\n       tail--;\n     q[++tail] = i;\n   }\n   cout << dp[n] << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX_INT = numeric_limits<int>::max();\n const int MAX_UINT = numeric_limits<unsigned int>::max();\n void get_acum(const vector<int>& v, vector<int>& acum) {\n   int sum = 0;\n   for (unsigned int i = 0; i < v.size(); ++i) {\n     acum.push_back(sum);\n     sum += v[i];\n   }\n   acum.push_back(sum);\n }\n int solve(vector<int>& A, vector<int>& B, vector<int>& X, unsigned int k) {\n   if (A.size() + X.size() < k || B.size() + X.size() < k) {\n     return -1;\n   } else {\n     sort(A.begin(), A.end());\n     sort(B.begin(), B.end());\n     sort(X.begin(), X.end());\n     vector<int> A_acum, B_acum, X_acum;\n     get_acum(A, A_acum);\n     get_acum(B, B_acum);\n     get_acum(X, X_acum);\n     int res = MAX_INT;\n     unsigned int max_i = min((unsigned int)X.size(), k);\n     for (unsigned int i = 0; i < max_i + 1; ++i) {\n       if (k - i < A_acum.size() && k - i < B_acum.size()) {\n         int total = A_acum[k - i] + B_acum[k - i] + X_acum[i];\n         if (total < res) res = total;\n       }\n     }\n     return res;\n   }\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   unsigned int n, k;\n   cin >> n >> k;\n   vector<int> A;\n   vector<int> B;\n   vector<int> X;\n   for (unsigned int i = 0; i < n; ++i) {\n     unsigned int ti;\n     bool ai, bi;\n     cin >> ti >> ai >> bi;\n     if (ai && bi)\n       X.push_back(ti);\n     else if (ai)\n       A.push_back(ti);\n     else if (bi)\n       B.push_back(ti);\n   }\n   cout << solve(A, B, X, k);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n set<long long int> adj[3005];\n map<long long int, long long int> mq;\n long long int done[3005][3005];\n int main() {\n   ios_base::sync_with_stdio(false);\n   long long int n, m, i, ans = 0;\n   cin >> n >> m;\n   for (i = 0; i < m; i++) {\n     long long int x, y;\n     cin >> x >> y;\n     adj[x].insert(y);\n   }\n   for (i = 1; i <= n; i++) {\n     for (auto it : adj[i]) {\n       for (auto it2 : adj[it]) {\n         if (mq.find(it2) != mq.end() && it2 != i) {\n           ans += mq[it2];\n         }\n         mq[it2]++;\n       }\n     }\n     mq.clear();\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }\n int main() {\n   int a, b, h;\n   cin >> a >> b >> h;\n   int c = 0;\n   while (h != 0) {\n     if (c % 2 == 0) {\n       h = h - gcd(a, h);\n     } else {\n       h = h - gcd(b, h);\n     }\n     c++;\n   }\n   if (c % 2 == 0) {\n     cout << 1 << endl;\n   } else\n     cout << 0 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 100000 + 5;\n const double EPS = 1e-3;\n int n;\n int t[MAXN];\n int g(double q) {\n   bool ok = true;\n   for (int i = 1; i < n; i++)\n     if (fabs(double(t[i] - t[i - 1] * q)) > EPS) ok = false;\n   if (ok) return 0;\n   ok = true;\n   for (int i = 2; i < n; i++)\n     if (fabs(double(t[i] - t[i - 1] * q)) > EPS) ok = false;\n   if (ok) return 1;\n   ok = true;\n   int prev = t[0];\n   for (int i = 1; i < n; i++)\n     if (fabs(double(t[i] - prev * q)) > EPS) {\n       if (!ok) return 2;\n       ok = false;\n     } else\n       prev = t[i];\n   return 1;\n }\n int f() {\n   if (n == 1) return 0;\n   double q1 = 0, q2 = 0;\n   if (t[0] != 0) q1 = double(t[1]) / t[0];\n   if (t[n - 2] != 0) q2 = double(t[n - 1]) / t[n - 2];\n   return min(g(q1), g(q2));\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) scanf('%d', &t[i]);\n   printf('%d\n', f());\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 1e6 + 5;\n int a[MAX], run[MAX], ans[MAX];\n char s[MAX];\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int n;\n   scanf('%d', &n);\n   scanf('%s', s);\n   for (int i = 0; i < n; ++i) {\n     if (s[i] == '0')\n       a[i] = 0;\n     else if (s[i] == '1')\n       a[i] = 1;\n     else\n       a[i] = -1;\n   }\n   vector<pair<int, int>> blocks;\n   int it1 = 0, it2 = 0;\n   while (it1 != n) {\n     while (it2 < n - 1 && a[it1] == a[it2 + 1]) ++it2;\n     blocks.emplace_back(it2 - it1 + 1, a[it1]);\n     ++it2;\n     it1 = it2;\n   }\n   for (int i = 0; i < (int)blocks.size(); ++i) {\n     if (blocks[i].second != -1) continue;\n     if (i == 0)\n       blocks[i].second = blocks[i + 1].second;\n     else if (i == (int)blocks.size() - 1)\n       blocks[i].second = blocks[i - 1].second;\n     else if (blocks[i - 1].second == blocks[i + 1].second)\n       blocks[i].second = blocks[i - 1].second;\n   }\n   vector<pair<int, int>> compress;\n   it1 = 0;\n   it2 = 0;\n   while (it1 != (int)blocks.size()) {\n     int len = blocks[it1].first;\n     while (it2 < (int)blocks.size() - 1 &&\n            blocks[it1].second == blocks[it2 + 1].second)\n       it2++, len += blocks[it2].first;\n     compress.emplace_back(len, blocks[it1].second);\n     ++it2;\n     it1 = it2;\n   }\n   for (auto block : compress) {\n     if (block.second == -1) continue;\n     for (int len = 1; len <= block.first; len++) ans[len] += block.first / len;\n   }\n   int max_size = -1, bef = -2;\n   int size = compress.size();\n   for (int i = 0; i < size; i++) {\n     int len = compress[i].first;\n     int type = compress[i].second;\n     if (bef != -1 && type != -1) {\n       max_size = len;\n       if (i != size - 1) max_size += compress[i + 1].first;\n       for (int l = 1; l <= max_size; l++) run[l] = len % l;\n     } else if (type == -1) {\n       for (int l = 1; l <= max_size; l++) {\n         if (run[l] + len >= l)\n           run[l] += len, ans[l] += run[l] / l, run[l] %= l;\n         else\n           run[l] = len;\n       }\n       int add = 0;\n       if (i != (int)size - 1) add += compress[i + 1].first;\n       if (i != (int)size - 2) add += compress[i + 2].first;\n       for (int l = max_size + 1; l <= len + add; ++l) run[l] = (len % l);\n       max_size = len + add;\n     } else {\n       for (int l = 1; l <= max_size; ++l) {\n         if (run[l] + (len % l) >= l)\n           run[l] += ((len % l) - l), ans[l]++;\n         else\n           run[l] += (len % l);\n       }\n     }\n     bef = type;\n   }\n   for (int i = 1; i <= n; ++i) printf('%d ', ans[i]);\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int read() {\n   int f = 1, x = 0;\n   char ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') {\n       f = -1;\n     }\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') {\n     x = x * 10 + ch - '0';\n     ch = getchar();\n   }\n   return x * f;\n }\n const int N = 55;\n struct W {\n   int x, y, tx, ty, id;\n } up[N], down[N];\n bool cmp_down(W a, W b) { return a.tx == b.tx ? a.ty < b.ty : a.tx > b.tx; }\n bool cmp_up(W a, W b) { return a.x == b.x ? a.y < b.y : a.x < b.x; }\n vector<pair<int, int> > ans_fr, ans_to;\n bool has[N][N];\n void move_up(int& x, int y) {\n   int dx = x;\n   has[x][y] = 0;\n   has[x - 1][y] = 1;\n   ans_fr.push_back(make_pair(dx, y));\n   ans_to.push_back(make_pair(dx - 1, y));\n   --x;\n }\n void move_down(int& x, int y) {\n   int dx = x;\n   has[x][y] = 0;\n   has[x + 1][y] = 1;\n   ans_fr.push_back(make_pair(dx, y));\n   ans_to.push_back(make_pair(dx + 1, y));\n   ++x;\n }\n void move_left(int x, int& y) {\n   int dy = y;\n   has[x][y] = 0;\n   has[x][y - 1] = 1;\n   ans_fr.push_back(make_pair(x, dy));\n   ans_to.push_back(make_pair(x, dy - 1));\n   --y;\n }\n void move_right(int x, int& y) {\n   int dy = y;\n   has[x][y] = 0;\n   has[x][y + 1] = 1;\n   ans_fr.push_back(make_pair(x, dy));\n   ans_to.push_back(make_pair(x, dy + 1));\n   ++y;\n }\n void move_row(int& x, int& y, int tx, int ty) {\n   while (y < ty && has[x][y + 1] == 0) {\n     move_right(x, y);\n   }\n   while (y > ty && has[x][y - 1] == 0) {\n     move_left(x, y);\n   }\n }\n void move(int& x, int& y, int tx, int ty) {\n   while (x < tx) {\n     move_down(x, y);\n   }\n   while (x > tx) {\n     move_up(x, y);\n   }\n   while (y < ty) {\n     move_right(x, y);\n   }\n   while (y > ty) {\n     move_left(x, y);\n   }\n }\n int check(W a) {\n   if (a.x == a.tx) {\n     return a.y == a.ty ? 0 : 1;\n   } else {\n     return a.y == a.ty ? 2 : 3;\n   }\n }\n int nx[N], ny[N];\n char mp[N][N];\n int vis[N];\n void write(int n) {\n   for (int i = 1; i <= n; i++) {\n     cout << mp[i] + 1 << endl;\n   }\n   puts('----------------------');\n }\n void deal(int n, int m) {\n   if (n == 1) {\n     puts('0');\n   } else {\n     if (m == 1) {\n       move(up[1].x, up[1].y, up[1].tx, up[1].ty);\n     } else {\n       if (cmp_up(up[1], up[2]) == 0) {\n         swap(up[1], up[2]);\n       }\n       if (up[1].x == 2) {\n         move_up(up[1].x, up[1].y);\n         move_up(up[2].x, up[2].y);\n       } else if (up[2].x == 2) {\n         move_up(up[2].x, up[2].y);\n       }\n       switch (check(up[1])) {\n         case 0:\n           break;\n         case 1:\n           move(up[2].x, up[2].y, 2, 1);\n           move_right(up[1].x, up[1].y);\n           break;\n         case 2:\n           move(up[1].x, up[1].y, up[1].tx, up[1].ty);\n           break;\n         case 3:\n           move(up[1].x, up[1].y, up[1].tx, up[1].ty);\n           move_left(up[2].x, up[2].y);\n           break;\n       }\n       move(up[2].x, up[2].y, up[2].tx, up[2].ty);\n     }\n     cout << ans_fr.size() << endl;\n     for (int i = 0; i < ans_fr.size(); i++) {\n       int xx1 = ans_fr[i].first, xx2 = ans_to[i].first;\n       int yy1 = ans_fr[i].second, yy2 = ans_to[i].second;\n       printf('%d %d %d %d\n', xx1, yy1, xx2, yy2);\n     }\n   }\n }\n int main() {\n   int n = read(), m = read();\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= n; j++) {\n       mp[i][j] = '.';\n     }\n   }\n   for (int i = 1; i <= m; i++) {\n     up[i].id = i;\n     nx[i] = up[i].x = read();\n     ny[i] = up[i].y = read();\n     has[nx[i]][ny[i]] = 1;\n     mp[nx[i]][ny[i]] = i + '0';\n   }\n   for (int i = 1; i <= m; i++) {\n     up[i].tx = read();\n     up[i].ty = read();\n   }\n   if (n <= 2) {\n     deal(n, m);\n     return 0;\n   }\n   copy(up + 1, up + 1 + m, down + 1);\n   sort(up + 1, up + 1 + m, cmp_up);\n   int cnt = m;\n   while (cnt) {\n     for (int i = 1; i <= m; i++) {\n       if (vis[i] == 0) {\n         int id = up[i].id;\n         move_row(nx[id], ny[id], 1, i);\n         if (ny[id] == i) {\n           vis[i] = 1;\n           cnt--;\n         }\n       }\n     }\n   }\n   for (int i = 1; i <= m; i++) {\n     int id = up[i].id;\n     while (nx[id] > 1) {\n       move_up(nx[id], ny[id]);\n     }\n   }\n   for (int i = 1; i <= m; i++) {\n     move_down(nx[i], ny[i]);\n     move_down(nx[i], ny[i]);\n   }\n   sort(down + 1, down + 1 + m, cmp_down);\n   for (int i = 1; i <= m; i++) {\n     int id = down[i].id;\n     move_up(nx[id], ny[id]);\n     move_row(nx[id], ny[id], 1, i);\n     move_up(nx[id], ny[id]);\n   }\n   for (int i = 1; i <= m; i++) {\n     int id = down[i].id;\n     while (nx[id] < down[i].tx) {\n       move_down(nx[id], ny[id]);\n     }\n   }\n   cnt = m;\n   while (cnt) {\n     for (int i = 1; i <= m; i++) {\n       if (vis[i] == 1) {\n         int id = down[i].id;\n         move_row(nx[id], ny[id], nx[id], down[i].ty);\n         if (ny[id] == down[i].ty) {\n           vis[i] = 2;\n           cnt--;\n         }\n       }\n     }\n   }\n   assert(ans_fr.size() == ans_to.size());\n   assert(ans_fr.size() <= 10800);\n   cout << ans_fr.size() << endl;\n   for (int i = 0; i < ans_fr.size(); i++) {\n     int xx1 = ans_fr[i].first, xx2 = ans_to[i].first;\n     int yy1 = ans_fr[i].second, yy2 = ans_to[i].second;\n     printf('%d %d %d %d\n', xx1, yy1, xx2, yy2);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   int a[m], b[m];\n   int ndup = n;\n   for (int i = 0; i < m; i++) {\n     cin >> a[i];\n     b[i] = a[i];\n   }\n   sort(a, a + m);\n   sort(b, b + m, greater<int>());\n   int mn = 0, mx = 0;\n   for (int i = 0; i < m; i++) {\n     while (a[i] > 0 && n > 0) {\n       mn += a[i];\n       a[i]--;\n       n--;\n     }\n   }\n   while (ndup > 0) {\n     mx += b[0];\n     b[0]--;\n     ndup--;\n     sort(b, b + m, greater<int>());\n   }\n   cout << mx << ' ' << mn;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long a, b, c, d, e, f, g, h, i, j, k, l, m, n, t;\n   cin >> t;\n   while (t--) {\n     cin >> n;\n     cout << (n + 1) / 2 << endl;\n   }\n }\n "}
+{"func_code_string": "//...START BY DOING WHAT IS NECESSARY, THEN WHAT IS POSSIBLE AND SUDDENLY YOU ARE DOING THE IMPOSSIBLE... \n #include <bits/stdc++.h>\n using namespace std;\n #define FAST_FURIER ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);\n #define pb push_back\n #define mk make_pair\n #define rep(i,a,N) for(ll i=a;i<N;i++)\n #define rrep(i,a,N) for(ll i=a;i>N;i--)\n typedef long long ll;\n #define M 1000000007\n bool comp(int x,int y)\n {\n     return x > y;\n }\n  \n  \n /*..............................code starts here........................*/\n // C is first won in M\n  \n  \n int main() {\n     FAST_FURIER;\n     int tt=1;\n     cin >> tt;\n     ll m,d,k;\n    //ll a,b,c;\n     while(tt--)\n     {\n         cin >> d >> k;\n         ll x = 0,y = 0;\n         int f = 0;\n         while(true){\n             ll d1 = pow(x+k,2)+pow(y,2), d2 = pow(x,2)+pow(y+k,2);\n             f = abs(f-1);\n             if(d1 < d2 and d1 <= d*d){\n                 x += k;\n             }\n             else if(d2 <= d1 and d2 <= d*d) y += k;\n             else break;\n         }\n         if(f) cout << 'Utkarsh';\n         else cout << 'Ashish';\n         cout << endl;\n \n     }\n }\n  \n  \n  \n // Author : shivam_123\n  \n // g++ -std=c++17"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a, b, c, e[200000], mix, l, r, o, d[200000];\n vector<long long> v[100000], v1;\n set<long long> st;\n map<long long, long long> mp, mp1;\n string s;\n pair<int, int> p[100000], p1[100000];\n char ch[10];\n deque<char> dq;\n int main() {\n   cin >> a;\n   for (int i = 0; i < a / 4; i++)\n     if ((a - 2 * (i + 1)) % 2 == 0) c++;\n   if (a % 4 == 0) {\n     cout << c - 1;\n   } else\n     cout << c;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s[5000005];\n int len[1000005];\n int idx[1000005];\n int sum[1000005];\n int sz = 0;\n int dp[1000005][20];\n int p[1000005];\n int main() {\n   int n, r, c;\n   scanf('%d%d%d', &n, &r, &c);\n   gets(s);\n   gets(s);\n   int cnt = 0, slen = 0;\n   for (int i = 0; s[i]; i++, slen++) {\n     if (s[i] == ' ' && cnt != 0) {\n       len[sz] = cnt;\n       idx[sz++] = i - cnt;\n       cnt = 0;\n     } else\n       cnt++;\n   }\n   if (cnt > 0) {\n     len[sz] = cnt;\n     idx[sz++] = slen - cnt;\n     cnt = 0;\n   }\n   sum[0] = len[0];\n   for (int i = 1; i < n; i++) sum[i] = sum[i - 1] + 1 + len[i];\n   for (int i = n - 1; i >= 0; i--) {\n     int id = upper_bound(sum, sum + n, (i > 0 ? sum[i - 1] + 1 : 0) + c) - sum;\n     if (id > n) id = n;\n     dp[i][0] = id - i;\n   }\n   for (int j = 2, t = 1; j <= r; j *= 2, t++) {\n     for (int i = n - 1; i >= 0; i--)\n       dp[i][t] = dp[i][t - 1] + dp[i + dp[i][t - 1]][t - 1];\n   }\n   int maid = -1, ma = 0;\n   for (int i = 0; i < n; i++) {\n     int idx = i, rr = r, cur = 0;\n     for (int j = 20; j >= 0; j--) {\n       if (rr >= (1 << j)) {\n         rr -= (1 << j);\n         cur += dp[idx][j];\n         idx += dp[idx][j];\n       }\n     }\n     if (cur > ma) maid = i, ma = cur;\n   }\n   int cn = 1, cs = dp[maid][0];\n   for (int i = maid; i < maid + ma; i++) {\n     s[idx[i] + len[i]] = 0;\n     if (cn < cs) {\n       printf('%s ', s + idx[i]);\n       cn++;\n     } else {\n       printf('%s\n', s + idx[i]);\n       cs = dp[i + 1][0];\n       cn = 1;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char change(char curranswer) {\n   if (curranswer == 'z')\n     curranswer = 'A';\n   else if (curranswer == 'Z')\n     curranswer = '0';\n   else if (curranswer == '9')\n     ;\n   else\n     curranswer++;\n   return curranswer;\n }\n int main() {\n   long long i, j, t;\n   cin >> t;\n   while (t--) {\n     long long r, c, k;\n     long long rice = 0;\n     char a[100][100];\n     cin >> r >> c >> k;\n     for (i = 0; i < r; i++) {\n       for (j = 0; j < c; j++) {\n         cin >> a[i][j];\n         if (a[i][j] == 'R') rice++;\n       }\n     }\n     long long ans = rice / k;\n     long long maxx = rice - k * ans;\n     long long minn = k - maxx;\n     char curranswer = 'a';\n     long long currcount = 0;\n     bool flag = true;\n     for (i = 0; i < r; i++) {\n       for (flag ? (j = 0) : (j = c - 1); flag ? (j < c) : j >= 0;\n            flag ? j++ : j--) {\n         bool local = false;\n         if (a[i][j] == 'R') local = true;\n         a[i][j] = curranswer;\n         if (local) {\n           currcount++;\n           if (maxx > 0) {\n             if (currcount == ans + 1) {\n               maxx--;\n               currcount = 0;\n               curranswer = change(curranswer);\n             }\n           } else if (minn > 0) {\n             if (currcount == ans) {\n               minn--;\n               currcount = 0;\n               if (minn) curranswer = change(curranswer);\n             }\n           }\n         }\n       }\n       flag = !flag;\n     }\n     for (i = 0; i < r; i++) {\n       for (j = 0; j < c; j++) cout << a[i][j];\n       cout << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long gcd(long long x, long long y) {\n   if (y == 0)\n     return x;\n   else\n     return gcd(y, x % y);\n }\n long long expo(long long n, long long m) {\n   long long r = 1;\n   while (m > 0) {\n     if (m % 2) r = (r * n) % 1000000009;\n     n = (n * n) % 1000000009;\n     m = m / 2;\n   }\n   return r % 1000000009;\n }\n long long lx = 0, ly = 0;\n bool check(long long x, long long y) {}\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   long long a, b;\n   cin >> a >> b;\n   string s;\n   cin >> s;\n   long long p = 0, q = 0;\n   if (a == 0 && b == 0) {\n     cout << 'Yes';\n     return 0;\n   }\n   for (long long i = 0; i < s.size(); i++) {\n     if (s[i] == 'U') {\n       ly++;\n     } else if (s[i] == 'D')\n       ly--;\n     else if (s[i] == 'L')\n       lx--;\n     else\n       lx++;\n     if (lx == a && ly == b) {\n       cout << 'Yes';\n       return 0;\n     }\n   }\n   if (lx == 0 && ly == 0) {\n     cout << 'No';\n     return 0;\n   }\n   for (long long i = 0; i < s.size(); i++) {\n     if (s[i] == 'U') {\n       q++;\n     } else if (s[i] == 'D')\n       q--;\n     else if (s[i] == 'L')\n       p--;\n     else\n       p++;\n     long long x = a - p, y = b - q, X = lx, Y = ly;\n     if (lx == 0) {\n       if (ly > 0 && y > 0 && x == 0 && y % ly == 0) {\n         cout << 'Yes';\n         return 0;\n       } else if (ly < 0 && y < 0 && x == 0) {\n         ly = -1 * ly, y = -1 * y;\n         if (y % ly == 0) {\n           cout << 'Yes';\n           return 0;\n         }\n       }\n     } else if (ly == 0) {\n       if (lx > 0 && x > 0 && y == 0 && x % lx == 0) {\n         cout << 'Yes';\n         return 0;\n       } else if (lx < 0 && x < 0 && y == 0) {\n         lx = -1 * lx, x = -1 * x;\n         if (x % lx == 0) {\n           cout << 'Yes';\n           return 0;\n         }\n       }\n     } else {\n       if (lx > 0 && x > 0) {\n         if (ly > 0 && y > 0) {\n           if (x / lx == y / ly && x % lx == 0 && y % ly == 0) {\n             cout << 'Yes';\n             return 0;\n           }\n         } else if (ly < 0 && y < 0) {\n           ly = -1 * ly, y = -1 * y;\n           if (x / lx == y / ly && x % lx == 0 && y % ly == 0) {\n             cout << 'Yes';\n             return 0;\n           }\n         }\n       } else if (lx < 0 && x < 0) {\n         lx = -1 * lx, x = -1 * x;\n         if (ly > 0 && y > 0) {\n           if (x / lx == y / ly && x % lx == 0 && y % ly == 0) {\n             cout << 'Yes';\n             return 0;\n           }\n         } else if (ly < 0 && y < 0) {\n           ly = -1 * ly, y = -1 * y;\n           if (x / lx == y / ly && x % lx == 0 && y % ly == 0) {\n             cout << 'Yes';\n             return 0;\n           }\n         }\n       }\n     }\n     lx = X, ly = Y;\n   }\n   cout << 'No';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = int(3e5), mod = int(1e9) + 7;\n int n;\n int a[N], c[N];\n long long t[N];\n long long x[N], pref[N];\n long double p[N];\n long long suf[N];\n void upd(int v, int val) {\n   v += n - 1;\n   t[v] += val;\n   c[v]++;\n   while (v > 1) {\n     v >>= 1;\n     t[v] = t[v + v] + t[v + v + 1];\n     c[v] = c[v + v] + c[v + v + 1];\n   }\n }\n long long get(int l, int r) {\n   l += n - 1;\n   r += n - 1;\n   long long res = 0;\n   while (l <= r) {\n     if (l & 1) res += t[l];\n     if (!(r & 1)) res += t[r];\n     l = (l + 1) >> 1;\n     r = (r - 1) >> 1;\n   }\n   return res;\n }\n int cnt(int l, int r) {\n   l += n - 1;\n   r += n - 1;\n   int res = 0;\n   while (l <= r) {\n     if (l & 1) res += c[l];\n     if (!(r & 1)) res += c[r];\n     l = (l + 1) >> 1;\n     r = (r - 1) >> 1;\n   }\n   return res;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n   }\n   long long all = 1ll * n * (n + 1) / 2;\n   long double res = 0;\n   for (int i = 1; i <= n; i++) {\n     long long cur = get(1, a[i] - 1);\n     long double p = (cur + 0.0) * (n - i + 1) / all;\n     res += p * 0.5;\n     cur = get(a[i] + 1, n);\n     p = (cur + 0.0) * (n - i + 1) / all;\n     res += cnt(a[i] + 1, n);\n     res -= p * 0.5;\n     upd(a[i], i);\n   }\n   printf('%.12lf', double(res));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long a, b;\n   cin >> a >> b;\n   long long ans = 0;\n   while (true) {\n     long long x = max(a, b);\n     long long y = min(a, b);\n     if (x == 0 || y == 0) break;\n     long long n = x / y;\n     ans += n;\n     x -= n * y;\n     a = x;\n     b = y;\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int x, test;\n   cin >> test;\n   while (test--) {\n     int n, c0, c1, h;\n     string s;\n     cin >> n >> c0 >> c1 >> h >> s;\n     int cnt0 = 0, cnt1 = 0;\n     for (auto &z : s) {\n       cnt0 += z == '0';\n       cnt1 += z == '1';\n     }\n     int cost = (cnt0 * c0) + (cnt1 * c1);\n     int cost0 = (c0 * n) + (cnt1 * h);\n     int cost1 = (c1 * n) + (cnt0 * h);\n     cout << min({cost, cost0, cost1}) << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = int(1e9) + 123;\n int main() {\n   int n, v;\n   cin >> n >> v;\n   vector<int> a;\n   for (int i = 1; i <= n; i++) {\n     int x;\n     cin >> x;\n     a.push_back(x);\n   }\n   sort(a.begin(), a.end());\n   int sum = 0;\n   for (int i = 0; i < a.size() - 1; i++) {\n     sum += a[i];\n   }\n   if (sum <= v) {\n     cout << 'YES';\n   } else {\n     cout << 'NO';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string vow = 'aeiou';\n long long month[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n const long long dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2};\n const long long dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1};\n const long long dx4[] = {-1, 0, 1, 0};\n const long long dy4[] = {0, 1, 0, -1};\n const long long dx8[] = {-1, -1, -1, 0, 0, 1, 1, 1};\n const long long dy8[] = {-1, 0, 1, -1, 1, -1, 0, 1};\n const long double pie = 3.1415926535897932384626;\n const long long special_prime = 982451653l;\n const long long mod = 1e9 + 7;\n const long long inf = 2e18;\n template <class T>\n istream &operator>>(istream &in, vector<T> &a) {\n   for (auto &i : a) cin >> i;\n   return in;\n }\n template <class T>\n ostream &operator<<(ostream &out, const vector<T> &a) {\n   for (auto &i : a) cout << i << ' ';\n   return out;\n }\n template <class T, class U>\n ostream &operator<<(ostream &out, const map<T, U> &a) {\n   for (auto &i : a) cout << '(' << i.first << ', ' << i.second << ')\n';\n   return out;\n }\n template <class T, class U>\n ostream &operator<<(ostream &out, const unordered_map<T, U> &a) {\n   for (auto &i : a) cout << '(' << i.first << ', ' << i.second << ')\n';\n   return out;\n }\n long long GCD(long long a, long long b) {\n   if (!b) return a;\n   return GCD(b, a % b);\n }\n long long LCM(long long a, long long b) { return (a * b) / GCD(a, b); }\n bool comp(long long a, long long b) { return a > b; }\n void sieve(vector<long long> &prime) {\n   prime[0] = false;\n   prime[1] = false;\n   for (long long p = 2; p * p <= 99999; p++) {\n     if (prime[p] == true) {\n       for (long long i = p * p; i <= 99999; i += p) prime[i] = false;\n     }\n   }\n }\n void solve() {\n   long long n, g, b;\n   cin >> n >> g >> b;\n   long long d = n / 2 + n % 2;\n   if (d % g)\n     cout << max(n, (d / g) * (g + b) + d % g) << '\n';\n   else\n     cout << max((d / g) * (g + b) - b, n) << '\n';\n }\n int32_t 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   cout << setprecision(15) << fixed;\n   for (long long i = 1; i <= t; i++) solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = (int)1e9 + 7;\n const int N = (int)1e6 + 6;\n int f[30][N];\n int pref[30][N];\n int lp[N];\n void precalc() {\n   pref[0][0] = f[0][0] = 1;\n   for (int i = 1; i < 30; i++) {\n     f[i][0] = 2;\n     pref[i][0] = f[i][0] + pref[i - 1][0];\n     pref[i][0] -= pref[i][0] >= mod ? mod : 0;\n   }\n   for (int level = 1; level < N; level++) {\n     pref[0][level] = f[0][level] = 1;\n     for (int pw = 1; pw < 30; pw++) {\n       f[pw][level] = pref[pw][level - 1];\n       pref[pw][level] = f[pw][level] + pref[pw - 1][level];\n       pref[pw][level] -= pref[pw][level] >= mod ? mod : 0;\n     }\n   }\n   for (int i = 2; i < N; i++) {\n     if (lp[i]) continue;\n     for (int j = i; j < N; j += i) {\n       lp[j] = lp[j] ? lp[j] : i;\n     }\n   }\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   precalc();\n   int T;\n   scanf('%d', &T);\n   while (T--) {\n     int r, n;\n     scanf('%d%d', &r, &n);\n     if (n == 1) {\n       printf('1\n');\n       continue;\n     }\n     long long ans = 1;\n     while (n > 1) {\n       int p = lp[n];\n       int pw = 0;\n       while (lp[n] == p) {\n         n /= p;\n         ++pw;\n       }\n       ans = ans * f[pw][r] % mod;\n     }\n     printf('%lld\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); }\n const int MAXN = 3e5 + 10;\n const int INF = 0x3f3f3f3f;\n const int MOD = 1e7 + 9;\n int a[MAXN];\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = (1); i < (n + 1); ++i) {\n     scanf('%d', &a[i]);\n   }\n   int ans1 = 0;\n   int t1 = 1;\n   for (int i = (n); i > (0); --i) {\n     if (a[t1] != a[i]) {\n       ans1 = i - t1;\n       break;\n     } else {\n       t1++;\n       i++;\n     }\n   }\n   int ans2 = 0;\n   int t2 = n;\n   for (int i = (1); i < (n + 1); ++i) {\n     if (a[t2] != a[i]) {\n       ans2 = t2 - i;\n       break;\n     } else {\n       t2--;\n       i--;\n     }\n   }\n   printf('%d\n', max(ans1, ans2));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n, sum = 1;\n   cin >> n;\n   sum += 6 * ((n * (n + 1)) / 2);\n   cout << sum << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 500005;\n const int M = 998244353;\n int n, a[N], i, s;\n long long f[N], c[N], x, y, z, ans[N], tp;\n long long qpow(long long a, long long b) {\n   long long s = a, ans = 1;\n   while (b) {\n     if (b & 1) ans = ans * s % M;\n     s = s * s % M;\n     b >>= 1;\n   }\n   return ans;\n }\n int main() {\n   scanf('%d', &n);\n   for (i = 1; i <= n; ++i) {\n     scanf('%d', &a[i]);\n     s += a[i];\n   }\n   long long is = qpow(s, M - 2), in = qpow(n - 1, M - 2);\n   c[1] = 1 - n;\n   f[0] = f[1] = 1;\n   for (i = 1; i < s; ++i) {\n     x = i * is % M, y = (s - i) * is % M * in % M;\n     z = qpow(y, M - 2);\n     f[i + 1] = (f[i] * (x + y) - f[i - 1] * x) % M * z % M;\n     c[i + 1] = (c[i] * (x + y) - 1 - c[i - 1] * x) % M * z % M;\n   }\n   ans[0] = -c[s] * qpow(f[s], M - 2) % M;\n   for (i = 1; i < s; ++i) ans[i] = (f[i] * ans[0] + c[i]) % M;\n   for (i = 1; i <= n; ++i) tp += ans[a[i]];\n   tp -= ans[0] * (n - 1);\n   cout << (tp % M * qpow(n, M - 2) % M + M) % M;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long w[2], b[2], q[2], mod = 998244353, fac[100001];\n long long modpow(long long b, long long p) {\n   long long ret = 1;\n   while (p > 0) {\n     if (p & 1) ret = ret * b % mod;\n     b = b * b % mod;\n     p >>= 1;\n   }\n   return ret;\n }\n long long choose(long long n, long long m) {\n   long long denom = modpow(fac[m], mod - 2) * modpow(fac[n - m], mod - 2) % mod;\n   return (fac[n] * denom % mod);\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   long long n, qq = 0;\n   bool bw = true, wb = true, both = true;\n   string s;\n   fac[0] = 1;\n   for (int i = 1; i < 100001; i++) fac[i] = fac[i - 1] * i % mod;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> s;\n     for (int j = 0; j < 2; j++) {\n       if (s[j] == 'W') w[j]++;\n       if (s[j] == 'B') b[j]++;\n       if (s[j] == '?') q[j]++;\n     }\n     if (s == '??') qq++;\n     if (s == 'WW' || s == 'BB') bw = wb = both = false;\n     if (s == 'W?' || s == '?B' || s == 'WB') bw = false;\n     if (s == 'B?' || s == '?W' || s == 'BW') wb = false;\n   }\n   if (n == 1) {\n     if (s == 'WW' | s == 'BB')\n       cout << 0;\n     else if (s == '??')\n       cout << 2;\n     else\n       cout << 1;\n     return 0;\n   }\n   long long ans = 0;\n   for (int i = 0; i < q[0] + 1; i++) {\n     if (w[0] + i < b[1] || w[0] + i > b[1] + q[1]) continue;\n     ans = (ans + choose(q[0], i) * choose(q[1], w[0] + i - b[1])) % mod;\n   }\n   if (both) {\n     ans -= modpow(2, qq);\n     if (bw) ans++;\n     if (wb) ans++;\n   }\n   ans = ((ans % mod) + mod) % mod;\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using std::abs;\n using std::bitset;\n using std::cerr;\n using std::cin;\n using std::copy;\n using std::cout;\n using std::endl;\n using std::fill;\n using std::fixed;\n using std::greater;\n using std::lower_bound;\n using std::map;\n using std::max;\n using std::min;\n using std::next_permutation;\n using std::pair;\n using std::priority_queue;\n using std::queue;\n using std::reverse;\n using std::rotate;\n using std::set;\n using std::sort;\n using std::string;\n using std::swap;\n using std::unique;\n using std::unordered_map;\n using std::unordered_set;\n using std::upper_bound;\n using std::vector;\n int const INF = (int)1e9;\n long long const INFL = (long long)1e18;\n long double const PI = 3.1415926535897932384626433832795028;\n bool isPrime(int x) {\n   for (int a = 2; a * a <= x; ++a) {\n     if (x % a == 0) {\n       return false;\n     }\n   }\n   return true;\n }\n int const N = 100100;\n int len[N];\n int g[N], next[N];\n int find(int v) {\n   if (next[v] != v) {\n     int root = find(next[v]);\n     len[v] += len[next[v]];\n     next[v] = root;\n   }\n   return next[v];\n }\n int v[N], res[N];\n bool did[N];\n int calc(int a, int b) {\n   int ret = 0;\n   find(a);\n   b -= len[a];\n   a = next[a];\n   while (b > 0 && !did[a]) {\n     ++ret;\n     did[a] = true;\n     next[a] = find(g[a]);\n     len[a] = 1 + len[g[a]];\n     b -= len[a];\n     a = find(g[a]);\n   }\n   return ret;\n }\n void solve() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < n; ++i) {\n     next[i] = i;\n     len[i] = 0;\n     cin >> g[i];\n     --g[i];\n   }\n   for (int i = 1; i <= m; ++i) {\n     cin >> v[i];\n   }\n   for (int i = 1; i <= m; ++i) {\n     int b;\n     cin >> b;\n     int a = (v[i] + res[i - 1] - 1) % n;\n     res[i] = calc(a, b);\n   }\n   for (int i = 1; i <= m; ++i) {\n     cout << res[i] << '\n';\n   }\n }\n int main() { solve(); }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n vector<int> 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 <bits/stdc++.h>\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<long long> p[111], q[111], r, v;\n char w;\n map<long long, long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 1e5 + 10;\n long long h[N], e[2 * N], ne[2 * N], idx;\n void add(long long a, long long b) { e[idx] = b, ne[idx] = h[a], h[a] = idx++; }\n struct node {\n   long long sum, add;\n };\n node tr[N << 2];\n long long arr[N];\n long long f[N][20];\n long long dep[N], fa[N], son[N], sz[N];\n long long n, q;\n void dfs1(long long u, long long fz) {\n   fa[u] = fz;\n   dep[u] = dep[fz] + 1;\n   sz[u] = 1;\n   f[u][0] = fz;\n   for (long long i = 1; i < 20; ++i) f[u][i] = f[f[u][i - 1]][i - 1];\n   for (long long i = h[u]; i != -1; i = ne[i]) {\n     long long j = e[i];\n     if (j == fz) continue;\n     dfs1(j, u);\n     sz[u] += sz[j];\n     if (sz[j] > sz[son[u]]) {\n       son[u] = j;\n     }\n   }\n }\n long long id[N], top[N], uid[N], tot;\n void dfs2(long long u, long long topx) {\n   top[u] = topx;\n   id[u] = ++tot;\n   uid[tot] = u;\n   if (!son[u]) return;\n   dfs2(son[u], topx);\n   for (long long i = h[u]; i != -1; i = ne[i]) {\n     long long j = e[i];\n     if (j == fa[u] || j == son[u]) continue;\n     dfs2(j, j);\n   }\n }\n long long get_lca(long long a, long long b) {\n   while (top[a] != top[b]) {\n     if (dep[top[a]] > dep[top[b]])\n       a = fa[top[a]];\n     else\n       b = fa[top[b]];\n   }\n   return dep[a] > dep[b] ? b : a;\n }\n long long topC(long long x, long long c) {\n   for (long long i = 19; i >= 0; i--) {\n     if ((1 << i) <= c) {\n       x = f[x][i];\n       c -= (1 << i);\n     }\n   }\n   return x;\n }\n long long root;\n void pushup(long long u) { tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum; }\n void pushdown(long long l, long long r, long long u) {\n   if (tr[u].add) {\n     long long mid = l + r >> 1;\n     tr[u << 1].sum += (mid - l + 1) * tr[u].add;\n     tr[u << 1 | 1].sum += (r - mid) * tr[u].add;\n     tr[u << 1].add += tr[u].add;\n     tr[u << 1 | 1].add += tr[u].add;\n     tr[u].add = 0;\n   }\n }\n long long query(long long l, long long r, long long a, long long b,\n                 long long u) {\n   if (l <= a && b <= r) {\n     return tr[u].sum;\n   }\n   pushdown(a, b, u);\n   long long mid = a + b >> 1;\n   long long ans = 0;\n   if (l <= mid) ans += query(l, r, a, mid, u << 1);\n   if (r > mid) ans += query(l, r, mid + 1, b, u << 1 | 1);\n   return ans;\n }\n void ud(long long l, long long r, long long a, long long b, long long d,\n         long long u) {\n   if (l <= a && b <= r) {\n     tr[u].add += d;\n     tr[u].sum += (b - a + 1) * d;\n     return;\n   }\n   pushdown(a, b, u);\n   long long mid = a + b >> 1;\n   if (l <= mid) ud(l, r, a, mid, d, u << 1);\n   if (r > mid) ud(l, r, mid + 1, b, d, u << 1 | 1);\n   pushup(u);\n }\n void update(long long u, long long x) {\n   ud(id[u], id[u] + sz[u] - 1, 1, n, x, 1);\n }\n long long qry(long long u) { return query(id[u], id[u] + sz[u] - 1, 1, n, 1); }\n void build(long long l, long long r, long long u) {\n   tr[u].add = 0;\n   if (l == r) {\n     tr[u].sum = arr[uid[l]];\n     return;\n   }\n   long long mid = l + r >> 1;\n   build(l, mid, u << 1);\n   build(mid + 1, r, u << 1 | 1);\n   pushup(u);\n }\n int main() {\n   ios::sync_with_stdio(false);\n   std::cin.tie(0);\n   memset(h, -1, sizeof h);\n   cin >> n >> q;\n   for (long long i = 1; i <= n; ++i) cin >> arr[i];\n   for (long long i = 1; i < n; ++i) {\n     long long a, b;\n     cin >> a >> b;\n     add(a, b);\n     add(b, a);\n   }\n   dfs1(1, 1);\n   dfs2(1, 1);\n   build(1, n, 1);\n   root = 1;\n   while (q--) {\n     long long t;\n     cin >> t;\n     long long v, u, x;\n     if (t == 1) {\n       cin >> v;\n       root = v;\n     } else if (t == 2) {\n       cin >> u >> v >> x;\n       long long t1 = get_lca(u, root);\n       long long t2 = get_lca(v, root);\n       long long t3 = get_lca(u, v);\n       long long ans = t1;\n       if (dep[ans] < dep[t2]) ans = t2;\n       if (dep[ans] < dep[t3]) ans = t3;\n       long long lca = get_lca(root, ans);\n       if (ans == root) {\n         update(1, x);\n       } else if (lca != ans) {\n         update(ans, x);\n       } else {\n         update(1, x);\n         long long s = topC(root, dep[root] - dep[ans] - 1);\n         update(s, -x);\n       }\n     } else {\n       cin >> v;\n       long long ans = v;\n       long long lca = get_lca(root, ans);\n       if (ans == root) {\n         cout << qry(1) << endl;\n       } else if (lca != ans) {\n         cout << qry(ans) << endl;\n       } else {\n         long long s = topC(root, dep[root] - dep[ans] - 1);\n         cout << (qry(1) - qry(s)) << endl;\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n const double EPS = 1e-9;\n const int INF = 1 << 29;\n int const NN = 5e3 + 3;\n int const MX = 1e9 + 9;\n int a[505][505];\n int mx[505][505];\n int main() {\n   int n, m, K, q;\n   cin >> n >> m >> K >> q;\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= m; ++j) a[i][j] = MX;\n   }\n   while (q--) {\n     int x, y, t;\n     cin >> x >> y >> t;\n     a[x][y] = t;\n   }\n   int ans = MX;\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= m; ++j) {\n       mx[i][j] = a[i][j];\n       for (int k = 2; i + k - 1 <= n && k <= K; ++k) {\n         mx[i][j] = max(mx[i][j], a[i + k - 1][j]);\n       }\n     }\n   }\n   for (int i = 1; i + K - 1 <= n; ++i) {\n     for (int j = 1; j + K - 1 <= m; ++j) {\n       int mxx = -1;\n       for (int jj = j; jj <= j + K - 1; ++jj) {\n         mxx = max(mxx, mx[i][jj]);\n       }\n       ans = min(ans, mxx);\n     }\n   }\n   if (ans < MX) {\n     printf('%d', ans);\n     ;\n     putchar('\n');\n   } else\n     puts('-1');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n \n void solve() {\n     int n, k;\n     cin >> n >> k;\n     if(2 * k + 1 > n) {\n         cout << '-1\n';\n         return;\n     }\n     vector<int> v(n);\n     int p = n;\n     for(int i = 1; i < 1 + 2 * k; i += 2)\n         v[i] = p--;\n     p = 1;\n     for(int i = 0; i < n; i++) {\n         if(v[i])\n             continue;\n         v[i] = p++;\n     }\n     for(auto &x : v)\n         cout << x << ' ';\n     cout << '\n';\n }\n \n int main() {\n     ios_base::sync_with_stdio(false);\n     cin.tie(0);\n \n     int t;\n     cin >> t;\n     while(t--)\n         solve();    \n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 100005;\n char S[maxn][10];\n int ju(char a[], char b[]) {\n   int n = strlen(a), m = strlen(b);\n   int x = 0, y = 0;\n   for (int i = 0; i < n; i++) x = x * 10 + a[i] - '0';\n   for (int j = 0; j < m; j++) y = y * 10 + (b[j] == '?' ? 9 : b[j] - '0');\n   return x < y;\n }\n int f(int ind) {\n   int m = strlen(S[ind - 1]), n = strlen(S[ind]);\n   if (m < n) {\n     for (int i = 0; i < n; i++)\n       if (S[ind][i] == '?') {\n         if (i == 0)\n           S[ind][i] = '1';\n         else\n           S[ind][i] = '0';\n       }\n   } else if (m > n) {\n     return 1;\n   } else {\n     for (int i = 0; i < n; i++) {\n       if (S[ind][i] == '?')\n         for (int j = 0; j <= 9; j++) {\n           S[ind][i] = '0' + j;\n           if (ju(S[ind - 1], S[ind])) break;\n         }\n     }\n     if (!ju(S[ind - 1], S[ind])) return 1;\n   }\n   return 0;\n }\n int main() {\n   int n;\n   while (scanf('%d', &n) > 0) {\n     int si = 1;\n     S[0][0] = '0';\n     S[0][1] = '\0';\n     for (int i = 1; i <= n; i++) {\n       scanf('%s', S[i]);\n       if (si && f(i)) si = 0;\n     }\n     if (si) {\n       printf('YES\n');\n       for (int i = 1; i <= n; i++) printf('%s\n', S[i]);\n     } else {\n       printf('NO\n');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Friend {\n   string name;\n   int x, y, z;\n } f[123];\n bool Isde(char *a) {\n   if (a[0] <= a[1]) return false;\n   if (a[1] <= a[3]) return false;\n   if (a[3] <= a[4]) return false;\n   if (a[4] <= a[6]) return false;\n   if (a[6] <= a[7]) return false;\n   return true;\n }\n bool Isiden(char *a) {\n   if (a[0] != a[1]) return false;\n   if (a[1] != a[3]) return false;\n   if (a[3] != a[4]) return false;\n   if (a[4] != a[6]) return false;\n   if (a[6] != a[7]) return false;\n   return true;\n }\n int main() {\n   int n;\n   while (cin >> n) {\n     int mx = 0, my = 0, mz = 0;\n     for (int i = 0; i < n; ++i) {\n       int m;\n       cin >> m >> f[i].name;\n       f[i].x = f[i].y = f[i].z;\n       char str[100];\n       for (int j = 0; j < m; ++j) {\n         cin >> str;\n         if (Isiden(str))\n           f[i].x++;\n         else if (Isde(str))\n           f[i].y++;\n         else\n           f[i].z++;\n       }\n       mx = max(f[i].x, mx);\n       my = max(f[i].y, my);\n       mz = max(f[i].z, mz);\n     }\n     bool flag = false;\n     cout << 'If you want to call a taxi, you should call: ';\n     for (int i = 0; i < n; ++i) {\n       if (f[i].x == mx) {\n         if (flag) cout << ', ';\n         cout << f[i].name;\n         flag = true;\n       }\n     }\n     cout << '.' << endl;\n     flag = false;\n     cout << 'If you want to order a pizza, you should call: ';\n     for (int i = 0; i < n; ++i) {\n       if (f[i].y == my) {\n         if (flag) cout << ', ';\n         cout << f[i].name;\n         flag = true;\n       }\n     }\n     cout << '.' << endl;\n     flag = false;\n     cout << 'If you want to go to a cafe with a wonderful girl, you should '\n             'call: ';\n     for (int i = 0; i < n; ++i) {\n       if (f[i].z == mz) {\n         if (flag) cout << ', ';\n         cout << f[i].name;\n         flag = true;\n       }\n     }\n     cout << '.' << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int L = 0, R = 10000;\n int n, vote, tot;\n vector<int> p[110000];\n pair<int, int> x[110000];\n long long sum[110000];\n long long he[4 * 110000];\n int num[4 * 110000];\n long long ask(int root, int l, int r, int k) {\n   if (k <= 0)\n     return 0;\n   else if (num[root] == k)\n     return he[root];\n   else if (l == r)\n     return (long long)k * l;\n   else {\n     int mid = (l + r) >> 1;\n     if (num[2 * root] < k) {\n       return ask(2 * root, l, mid, num[2 * root]) +\n              ask(2 * root + 1, mid + 1, r, k - num[2 * root]);\n     } else {\n       return ask(2 * root, l, mid, k);\n     }\n   }\n }\n void add(int root, int l, int r, int k) {\n   if (l > r || k < l || k > r)\n     return;\n   else if (l == r) {\n     num[root]++;\n     he[root] += k;\n   } else {\n     num[root]++;\n     he[root] += k;\n     int mid = (l + r) >> 1;\n     add(2 * root, l, mid, k);\n     add(2 * root + 1, mid + 1, r, k);\n   }\n }\n int main() {\n   cin >> n;\n   int mx = 0;\n   for (int i = 0, a, b; i < n; i++) {\n     scanf('%d%d', &a, &b);\n     if (a != 0)\n       p[a].push_back(b);\n     else\n       vote++;\n   }\n   for (int i = 1; i < 110000; i++) {\n     sort(p[i].begin(), p[i].end());\n     reverse(p[i].begin(), p[i].end());\n     mx = max(mx, (int)p[i].size());\n   }\n   for (int i = 1; i < 110000; i++) {\n     int m = (int)p[i].size();\n     for (int j = 0; j < m; j++) {\n       x[tot++] = pair<int, int>(j + 1, p[i][j]);\n     }\n   }\n   sort(x, x + tot);\n   for (int i = 0; i < tot; i++) {\n     if (i == 0)\n       sum[i] = x[i].second;\n     else\n       sum[i] = sum[i - 1] + x[i].second;\n   }\n   long long ans = 1e10;\n   int pre = 0;\n   for (int i = 0; i <= mx + 1; i++) {\n     int indx = upper_bound(x, x + tot, pair<int, int>(i, 1e9)) - x;\n     long long cans = sum[tot - 1] - sum[indx] + x[indx].second;\n     if (indx == tot) cans = 0;\n     while (pre < indx) {\n       add(1, L, R, x[pre].second);\n       pre++;\n     }\n     indx = tot - indx + vote;\n     if (i >= indx) {\n       indx = i - indx + 1;\n       cans += ask(1, L, R, indx);\n     }\n     ans = min(ans, cans);\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 998244353;\n long long inv(long long a) {\n   long long u = 0, v = 1, b = mod;\n   while (a) {\n     long long t = b / a;\n     b -= t * a, u -= t * v;\n     swap(a, b);\n     swap(u, v);\n   }\n   u %= mod;\n   if (u < 0) u += mod;\n   return u;\n }\n struct mint {\n   int x;\n   mint() : x(0) {}\n   mint(int x) : x(x) {}\n   mint(long long x) : x() {\n     if (x >= mod || x < -mod) x %= mod;\n     if (x < 0) x += mod;\n     this->x = x;\n   }\n   mint &operator-=(const mint &rhs) {\n     x -= rhs.x;\n     if (x < 0) x += mod;\n     return *this;\n   }\n   mint &operator+=(const mint &rhs) {\n     x += rhs.x;\n     if (x >= mod) x -= mod;\n     return *this;\n   }\n   mint &operator*=(const mint &rhs) {\n     x = (long long)x * rhs.x % mod;\n     return *this;\n   }\n   mint &operator/=(const mint &rhs) {\n     x = (long long)x * inv(rhs.x) % mod;\n     return *this;\n   }\n   bool operator<(const mint &rhs) { return x < rhs.x; }\n   bool operator==(const mint &rhs) { return x == rhs.x; }\n   bool operator!=(const mint &rhs) { return x != rhs.x; }\n   friend mint operator+(const mint &lhs, const mint &rhs) {\n     mint ret(lhs);\n     return ret += rhs;\n   }\n   friend mint operator-(const mint &lhs, const mint &rhs) {\n     mint ret(lhs);\n     return ret -= rhs;\n   }\n   friend mint operator*(const mint &lhs, const mint &rhs) {\n     mint ret(lhs);\n     return ret *= rhs;\n   }\n   friend mint operator/(const mint &lhs, const mint &rhs) {\n     mint ret(lhs);\n     return ret /= rhs;\n   }\n   friend ostream &operator<<(ostream &os, const mint &rhs) {\n     os << rhs.x;\n     return os;\n   }\n   friend istream &operator>>(istream &is, mint &rhs) {\n     long long a;\n     is >> a;\n     rhs = a;\n     return is;\n   }\n };\n mint fpow(mint a, long long b) {\n   mint r = 1;\n   for (; b; b >>= 1) {\n     if (b & 1) r = r * a;\n     a = a * a;\n   }\n   return r;\n }\n const int N = 1e6 + 5;\n mint pw[N];\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n, m, k;\n   cin >> n >> m >> k;\n   pw[0] = 1;\n   for (int i = 1; i <= max(n, m); ++i) pw[i] = pw[i - 1] * 2;\n   int f0 = 1, f1 = 1, cntx = n, cnty = m, fx = 0, fy = 0;\n   vector<int> cnt(2);\n   vector<vector<int>> cntr(n, vector<int>(2, 0)), cntc(m, vector<int>(2, 0));\n   map<pair<int, int>, int> mp;\n   auto Erase = [&](int x, int y) {\n     if (!mp.count({x, y})) return;\n     int p = mp[{x, y}];\n     mp.erase({x, y});\n     if (--cntr[x][p ^ y & 1] == 0) {\n       if (cntr[x][p ^ y & 1 ^ 1])\n         fx--;\n       else\n         cntx += 1;\n     }\n     if (--cntc[y][p ^ x & 1] == 0) {\n       if (cntc[y][p ^ x & 1 ^ 1])\n         fy--;\n       else\n         cnty += 1;\n     }\n     --cnt[x & 1 ^ y & 1 ^ p];\n   };\n   auto Insert = [&](int x, int y, int p) {\n     mp[{x, y}] = p;\n     if (cntr[x][p ^ y & 1]++ == 0) {\n       if (cntr[x][p ^ y & 1 ^ 1])\n         fx++;\n       else\n         cntx -= 1;\n     }\n     if (cntc[y][p ^ x & 1]++ == 0) {\n       if (cntc[y][p ^ x & 1 ^ 1])\n         fy++;\n       else\n         cnty -= 1;\n     }\n     ++cnt[x & 1 ^ y & 1 ^ p];\n   };\n   while (k--) {\n     int x, y, op;\n     cin >> x >> y >> op;\n     --x, --y;\n     Erase(x, y);\n     if (op != -1) Insert(x, y, op);\n     mint ans = -(cnt[0] == 0) - (cnt[1] == 0);\n     if (fx == 0) ans += pw[cntx];\n     if (fy == 0) ans += pw[cnty];\n     cout << ans << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int i, a, p, b, p1, p2;\n   cin >> a;\n   b = a;\n   p = 0;\n   p1 = p2 = 1;\n   for (i = 2; i <= sqrt(b); i++) {\n     if (b % i == 0) {\n       b = b / i;\n       p++;\n       if (p == 1) p1 = i;\n       if (p == 2) p2 = i;\n       i--;\n     }\n   }\n   if (p == 0) cout << 1 << endl << 0 << endl;\n   if (p == 1) cout << 2 << endl;\n   if (p >= 2) cout << 1 << endl << p1 * p2 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class P, class Q>\n ostream& operator<<(ostream& stream, pair<P, Q> v) {\n   stream << '(' << v.first << ',' << v.second << ')';\n   return stream;\n }\n template <class T>\n ostream& operator<<(ostream& stream, const vector<T> v) {\n   stream << '[ ';\n   for (int i = 0; i < (int)v.size(); i++) stream << v[i] << ' ';\n   stream << ']';\n   return stream;\n }\n template <class T>\n T smin(T& a, T b) {\n   if (a > b) a = b;\n   return a;\n }\n template <class T>\n T smax(T& a, T b) {\n   if (a < b) a = b;\n   return a;\n }\n const long long M = 10004205361450474;\n int ask(vector<long long> s) {\n   int sz = s.size();\n   cout << sz << ' ';\n   for (int i = 0; i < sz; ++i) cout << s[i] << ' \n'[i == sz - 1];\n   fflush(stdout);\n   int v = 0;\n   cin >> v;\n   if (v == -1) {\n     exit(0);\n   }\n   return v;\n }\n const int N = 1e4 + 5;\n long long dp[N][6];\n long long f(int A, int B) {\n   if (!B) return 0;\n   if (dp[A][B] != -1) return dp[A][B];\n   long long& ans = dp[A][B];\n   ans = 0;\n   const int W = A;\n   for (int i = 0; i < W; ++i) {\n     ans += f(A, B - 1) + 1;\n     A = min(10000ll, A + f(A, B - 1) + 1);\n   }\n   ans += f(A, B - 1);\n   return ans;\n }\n long long g(long long a, int b) { return f(min(10000ll, a), b); }\n int main(void) {\n   memset(dp, -1, sizeof(dp));\n   const long long c1 = M - f(10000, 4);\n   const long long c2 = 2046;\n   const long long c3 = 6;\n   long long l, r;\n   int used = 5;\n   --used;\n   if (ask(vector<long long>{c1}) > 0) {\n     l = c1 + 1;\n     r = M;\n     goto shit;\n   }\n   --used;\n   if (ask(vector<long long>{c2}) > 0) {\n     l = c2 + 1;\n     r = c1 - 1;\n     goto shit;\n   }\n   --used;\n   if (ask(vector<long long>{c3}) > 0) {\n     l = c3 + 1;\n     r = c2 - 1;\n   } else {\n     l = 1;\n     r = c3 - 1;\n   }\n shit:\n   for (int cs = used - 1; cs >= 0; --cs) {\n     vector<long long> s;\n     for (long long i = l; i + g(i, cs) <= r && s.size() < min(10000ll, l);\n          i += g(i, cs) + 1)\n       s.push_back(i + g(i, cs));\n     int v = ask(s);\n     if (!v) {\n       smin(r, s[0] - 1);\n     } else if (v == s.size()) {\n       smax(l, s.back() + 1);\n     } else {\n       smin(r, s[v] - 1);\n       smax(l, s[v - 1] + 1);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n T inverse(T a, T m) {\n   T u = 0, v = 1;\n   while (a != 0) {\n     T t = m / a;\n     m -= t * a;\n     swap(a, m);\n     u -= t * v;\n     swap(u, v);\n   }\n   assert(m == 1);\n   return u;\n }\n template <typename T>\n class Modular {\n  public:\n   using Type = typename decay<decltype(T::value)>::type;\n   constexpr Modular() : value() {}\n   template <typename U>\n   Modular(const U& x) {\n     value = normalize(x);\n   }\n   template <typename U>\n   static Type normalize(const U& x) {\n     Type v;\n     if (-mod() <= x && x < mod())\n       v = static_cast<Type>(x);\n     else\n       v = static_cast<Type>(x % mod());\n     if (v < 0) v += mod();\n     return v;\n   }\n   const Type& operator()() const { return value; }\n   template <typename U>\n   explicit operator U() const {\n     return static_cast<U>(value);\n   }\n   constexpr static Type mod() { return T::value; }\n   Modular& operator+=(const Modular& other) {\n     if ((value += other.value) >= mod()) value -= mod();\n     return *this;\n   }\n   Modular& operator-=(const Modular& other) {\n     if ((value -= other.value) < 0) value += mod();\n     return *this;\n   }\n   template <typename U>\n   Modular& operator+=(const U& other) {\n     return *this += Modular(other);\n   }\n   template <typename U>\n   Modular& operator-=(const U& other) {\n     return *this -= Modular(other);\n   }\n   Modular& operator++() { return *this += 1; }\n   Modular& operator--() { return *this -= 1; }\n   Modular operator++(int) {\n     Modular result(*this);\n     *this += 1;\n     return result;\n   }\n   Modular operator--(int) {\n     Modular result(*this);\n     *this -= 1;\n     return result;\n   }\n   Modular operator-() const { return Modular(-value); }\n   template <typename U = T>\n   typename enable_if<is_same<typename Modular<U>::Type, int>::value,\n                      Modular>::type&\n   operator*=(const Modular& rhs) {\n     value = normalize(static_cast<int64_t>(value) *\n                       static_cast<int64_t>(rhs.value));\n     return *this;\n   }\n   template <typename U = T>\n   typename enable_if<is_same<typename Modular<U>::Type, long long>::value,\n                      Modular>::type&\n   operator*=(const Modular& rhs) {\n     long long q = static_cast<long long>(static_cast<long double>(value) *\n                                          rhs.value / mod());\n     value = normalize(value * rhs.value - q * mod());\n     return *this;\n   }\n   template <typename U = T>\n   typename enable_if<!is_integral<typename Modular<U>::Type>::value,\n                      Modular>::type&\n   operator*=(const Modular& rhs) {\n     value = normalize(value * rhs.value);\n     return *this;\n   }\n   Modular& operator/=(const Modular& other) {\n     return *this *= Modular(inverse(other.value, mod()));\n   }\n   friend const Type& abs(const Modular& x) { return x.value; }\n   template <typename U>\n   friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);\n   template <typename U>\n   friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);\n   template <typename V, typename U>\n   friend V& operator>>(V& stream, Modular<U>& number);\n \n  private:\n   Type value;\n };\n template <typename T>\n bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) {\n   return lhs.value == rhs.value;\n }\n template <typename T, typename U>\n bool operator==(const Modular<T>& lhs, U rhs) {\n   return lhs == Modular<T>(rhs);\n }\n template <typename T, typename U>\n bool operator==(U lhs, const Modular<T>& rhs) {\n   return Modular<T>(lhs) == rhs;\n }\n template <typename T>\n bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) {\n   return !(lhs == rhs);\n }\n template <typename T, typename U>\n bool operator!=(const Modular<T>& lhs, U rhs) {\n   return !(lhs == rhs);\n }\n template <typename T, typename U>\n bool operator!=(U lhs, const Modular<T>& rhs) {\n   return !(lhs == rhs);\n }\n template <typename T>\n bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) {\n   return lhs.value < rhs.value;\n }\n template <typename T>\n Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) {\n   return Modular<T>(lhs) += rhs;\n }\n template <typename T, typename U>\n Modular<T> operator+(const Modular<T>& lhs, U rhs) {\n   return Modular<T>(lhs) += rhs;\n }\n template <typename T, typename U>\n Modular<T> operator+(U lhs, const Modular<T>& rhs) {\n   return Modular<T>(lhs) += rhs;\n }\n template <typename T>\n Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) {\n   return Modular<T>(lhs) -= rhs;\n }\n template <typename T, typename U>\n Modular<T> operator-(const Modular<T>& lhs, U rhs) {\n   return Modular<T>(lhs) -= rhs;\n }\n template <typename T, typename U>\n Modular<T> operator-(U lhs, const Modular<T>& rhs) {\n   return Modular<T>(lhs) -= rhs;\n }\n template <typename T>\n Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) {\n   return Modular<T>(lhs) *= rhs;\n }\n template <typename T, typename U>\n Modular<T> operator*(const Modular<T>& lhs, U rhs) {\n   return Modular<T>(lhs) *= rhs;\n }\n template <typename T, typename U>\n Modular<T> operator*(U lhs, const Modular<T>& rhs) {\n   return Modular<T>(lhs) *= rhs;\n }\n template <typename T>\n Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) {\n   return Modular<T>(lhs) /= rhs;\n }\n template <typename T, typename U>\n Modular<T> operator/(const Modular<T>& lhs, U rhs) {\n   return Modular<T>(lhs) /= rhs;\n }\n template <typename T, typename U>\n Modular<T> operator/(U lhs, const Modular<T>& rhs) {\n   return Modular<T>(lhs) /= rhs;\n }\n template <typename T, typename U>\n Modular<T> power(const Modular<T>& a, const U& b) {\n   assert(b >= 0);\n   Modular<T> x = a, res = 1;\n   U p = b;\n   while (p > 0) {\n     if (p & 1) res *= x;\n     x *= x;\n     p >>= 1;\n   }\n   return res;\n }\n template <typename T>\n bool IsZero(const Modular<T>& number) {\n   return number() == 0;\n }\n template <typename T>\n string to_string(const Modular<T>& number) {\n   return to_string(number());\n }\n template <typename U, typename T>\n U& operator<<(U& stream, const Modular<T>& number) {\n   return stream << number();\n }\n template <typename U, typename T>\n U& operator>>(U& stream, Modular<T>& number) {\n   typename common_type<typename Modular<T>::Type, long long>::type x;\n   stream >> x;\n   number.value = Modular<T>::normalize(x);\n   return stream;\n }\n constexpr int md = 998244353;\n using Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;\n vector<Mint> fact(1, 1);\n vector<Mint> inv_fact(1, 1);\n Mint C(int n, int k) {\n   if (k < 0 || k > n) {\n     return 0;\n   }\n   while ((int)fact.size() < n + 1) {\n     fact.push_back(fact.back() * (int)fact.size());\n     inv_fact.push_back(1 / fact.back());\n   }\n   return fact[n] * inv_fact[k] * inv_fact[n - k];\n }\n template <typename T>\n class NTT {\n  public:\n   using Type = typename decay<decltype(T::value)>::type;\n   static Type md;\n   static Modular<T> root;\n   static int base;\n   static int max_base;\n   static vector<Modular<T>> roots;\n   static vector<int> rev;\n   static void clear() {\n     root = 0;\n     base = 0;\n     max_base = 0;\n     roots.clear();\n     rev.clear();\n   }\n   static void init() {\n     md = T::value;\n     assert(md >= 3 && md % 2 == 1);\n     auto tmp = md - 1;\n     max_base = 0;\n     while (tmp % 2 == 0) {\n       tmp /= 2;\n       max_base++;\n     }\n     root = 2;\n     while (power(root, (md - 1) >> 1) == 1) {\n       root++;\n     }\n     assert(power(root, md - 1) == 1);\n     root = power(root, (md - 1) >> max_base);\n     base = 1;\n     rev = {0, 1};\n     roots = {0, 1};\n   }\n   static void ensure_base(int nbase) {\n     if (md != T::value) {\n       clear();\n     }\n     if (roots.empty()) {\n       init();\n     }\n     if (nbase <= base) {\n       return;\n     }\n     assert(nbase <= max_base);\n     rev.resize(1 << nbase);\n     for (int i = 0; i < (1 << nbase); i++) {\n       rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));\n     }\n     roots.resize(1 << nbase);\n     while (base < nbase) {\n       Modular<T> z = power(root, 1 << (max_base - 1 - base));\n       for (int i = 1 << (base - 1); i < (1 << base); i++) {\n         roots[i << 1] = roots[i];\n         roots[(i << 1) + 1] = roots[i] * z;\n       }\n       base++;\n     }\n   }\n   static void fft(vector<Modular<T>>& a) {\n     int n = (int)a.size();\n     assert((n & (n - 1)) == 0);\n     int zeros = __builtin_ctz(n);\n     ensure_base(zeros);\n     int shift = base - zeros;\n     for (int i = 0; i < n; i++) {\n       if (i < (rev[i] >> shift)) {\n         swap(a[i], a[rev[i] >> shift]);\n       }\n     }\n     for (int k = 1; k < n; k <<= 1) {\n       for (int i = 0; i < n; i += 2 * k) {\n         for (int j = 0; j < k; j++) {\n           Modular<T> x = a[i + j];\n           Modular<T> y = a[i + j + k] * roots[j + k];\n           a[i + j] = x + y;\n           a[i + j + k] = x - y;\n         }\n       }\n     }\n   }\n   static vector<Modular<T>> multiply(vector<Modular<T>> a,\n                                      vector<Modular<T>> b) {\n     if (a.empty() || b.empty()) {\n       return {};\n     }\n     int eq = (a == b);\n     int need = (int)a.size() + (int)b.size() - 1;\n     int nbase = 0;\n     while ((1 << nbase) < need) nbase++;\n     ensure_base(nbase);\n     int sz = 1 << nbase;\n     a.resize(sz);\n     b.resize(sz);\n     fft(a);\n     if (eq)\n       b = a;\n     else\n       fft(b);\n     Modular<T> inv_sz = 1 / static_cast<Modular<T>>(sz);\n     for (int i = 0; i < sz; i++) {\n       a[i] *= b[i] * inv_sz;\n     }\n     reverse(a.begin() + 1, a.end());\n     fft(a);\n     a.resize(need);\n     return a;\n   }\n };\n template <typename T>\n typename NTT<T>::Type NTT<T>::md;\n template <typename T>\n Modular<T> NTT<T>::root;\n template <typename T>\n int NTT<T>::base;\n template <typename T>\n int NTT<T>::max_base;\n template <typename T>\n vector<Modular<T>> NTT<T>::roots;\n template <typename T>\n vector<int> NTT<T>::rev;\n template <typename T>\n vector<Modular<T>> inverse(const vector<Modular<T>>& a) {\n   assert(!a.empty());\n   int n = (int)a.size();\n   vector<Modular<T>> b = {1 / a[0]};\n   while ((int)b.size() < n) {\n     vector<Modular<T>> x(a.begin(), a.begin() + min(a.size(), b.size() << 1));\n     x.resize(b.size() << 1);\n     b.resize(b.size() << 1);\n     vector<Modular<T>> c = b;\n     NTT<T>::fft(c);\n     NTT<T>::fft(x);\n     Modular<T> inv = 1 / static_cast<Modular<T>>((int)x.size());\n     for (int i = 0; i < (int)x.size(); i++) {\n       x[i] *= c[i] * inv;\n     }\n     reverse(x.begin() + 1, x.end());\n     NTT<T>::fft(x);\n     rotate(x.begin(), x.begin() + (x.size() >> 1), x.end());\n     fill(x.begin() + (x.size() >> 1), x.end(), 0);\n     NTT<T>::fft(x);\n     for (int i = 0; i < (int)x.size(); i++) {\n       x[i] *= c[i] * inv;\n     }\n     reverse(x.begin() + 1, x.end());\n     NTT<T>::fft(x);\n     for (int i = 0; i < ((int)x.size() >> 1); i++) {\n       b[i + ((int)x.size() >> 1)] = -x[i];\n     }\n   }\n   b.resize(n);\n   return b;\n }\n template <typename T>\n vector<Modular<T>> inverse_old(vector<Modular<T>> a) {\n   assert(!a.empty());\n   int n = (int)a.size();\n   if (n == 1) {\n     return {1 / a[0]};\n   }\n   int m = (n + 1) >> 1;\n   vector<Modular<T>> b = inverse(vector<Modular<T>>(a.begin(), a.begin() + m));\n   int need = n << 1;\n   int nbase = 0;\n   while ((1 << nbase) < need) {\n     ++nbase;\n   }\n   NTT<T>::ensure_base(nbase);\n   int size = 1 << nbase;\n   a.resize(size);\n   b.resize(size);\n   NTT<T>::fft(a);\n   NTT<T>::fft(b);\n   Modular<T> inv = 1 / static_cast<Modular<T>>(size);\n   for (int i = 0; i < size; ++i) {\n     a[i] = (2 - a[i] * b[i]) * b[i] * inv;\n   }\n   reverse(a.begin() + 1, a.end());\n   NTT<T>::fft(a);\n   a.resize(n);\n   return a;\n }\n template <typename T>\n vector<Modular<T>> operator*(const vector<Modular<T>>& a,\n                              const vector<Modular<T>>& b) {\n   if (a.empty() || b.empty()) {\n     return {};\n   }\n   if (min(a.size(), b.size()) < 150) {\n     vector<Modular<T>> c(a.size() + b.size() - 1, 0);\n     for (int i = 0; i < (int)a.size(); i++) {\n       for (int j = 0; j < (int)b.size(); j++) {\n         c[i + j] += a[i] * b[j];\n       }\n     }\n     return c;\n   }\n   return NTT<T>::multiply(a, b);\n }\n template <typename T>\n vector<Modular<T>>& operator*=(vector<Modular<T>>& a,\n                                const vector<Modular<T>>& b) {\n   return a = a * b;\n }\n class graph {\n  public:\n   int n;\n   vector<vector<int>> adj;\n   vector<int> degree;\n   vector<pair<int, int>> edge;\n   vector<int> depth;\n   vector<bool> covered;\n   graph(int N)\n       : n(N),\n         adj(vector<vector<int>>(n)),\n         degree(vector<int>(n)),\n         depth(vector<int>(n)),\n         covered(vector<bool>(n, false)) {}\n   void add(int X, int Y) {\n     degree[X]++, degree[Y]++;\n     edge.emplace_back(X, Y);\n     adj[X].push_back(Y);\n     adj[Y].push_back(X);\n   }\n   void dfs(int N) {\n     if (covered[N] == true) return;\n     covered[N] = true;\n     for (int i : adj[N]) {\n       if (covered[i] == false) {\n         depth[i] = depth[N] + 1;\n         dfs(i);\n       }\n     }\n   }\n };\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   string s, t;\n   cin >> s >> t;\n   int n = s.size(), m = t.size();\n   while (t.size() < s.size()) t += 'z';\n   assert(t.size() == s.size());\n   vector<graph> gr(n - m + 1, graph(6));\n   for (int i = 0; i < 6; i++) {\n     for (int j = 0; j < 6; j++) {\n       vector<Mint> a(n), b(n);\n       for (int k = 0; k < n; k++) {\n         if (int(s[k] - 'a') == i) a[k] = 1;\n         if (int(t[k] - 'a') == j) b[k] = 1;\n       }\n       reverse(a.begin(), a.end());\n       for (int k = 0; k < n; k++) a.push_back(0), b.push_back(b[k]);\n       a *= b;\n       for (int k = 2 * n - 1, cnt = 0; cnt < n - m + 1; k--, cnt++) {\n         if (a[k]()) {\n           gr[cnt].add(i, j);\n         }\n       }\n     }\n   }\n   for (int i = 0; i < n - m + 1; i++) {\n     int ans = 0;\n     for (int j = 0; j < 6; j++) {\n       if (gr[i].covered[j] == false) {\n         gr[i].dfs(j);\n         ans += 1;\n       }\n     }\n     cout << 6 - ans << ' ';\n   }\n   cout << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long f[60][110][2];\n long long bin[60], num[60], s, tt;\n inline long long rd() {\n   long long x = 0;\n   char ch = getchar();\n   for (; ch < '0' || ch > '9'; ch = getchar())\n     ;\n   for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';\n   return x;\n }\n int main() {\n   s = rd();\n   bin[0] = 1;\n   for (int i = 1; i <= 51; i++) bin[i] = bin[i - 1] * 2;\n   long long ans = 0;\n   for (int h = 1; bin[h] - 1 <= s; h++) {\n     long long hh = s % (bin[h] - 1);\n     for (int j = h - 1; j; j--)\n       if (bin[j] - 1 <= hh) hh -= bin[j] - 1;\n     ans += (!hh);\n   }\n   for (int h0 = 1; h0 <= 50; h0++)\n     for (int h1 = 1; h1 <= 50; h1++)\n       if (bin[h0 + 1] + bin[h1 + 1] - 3 <= s - bin[h1] + 1) {\n         long long hh = (s - bin[h1] + 1) % (bin[h0 + 1] + bin[h1 + 1] - 3);\n         for (int n = 0; n <= h0 + h1 - 2 && n <= hh; n++) {\n           tt = 0;\n           long long now = hh + n;\n           if (now & 1) continue;\n           memset(num, 0, sizeof(num));\n           for (now >>= 1; now; now >>= 1) num[++tt] = now & 1;\n           memset(f, 0, sizeof(f));\n           f[0][0][0] = 1;\n           for (int i = 1; i <= tt; i++)\n             for (int j = 0; j <= n; j++)\n               for (int k = 0; k < 2; k++)\n                 if (f[i - 1][j][k]) {\n                   for (int l1 = 0; l1 < 2; l1++)\n                     for (int l2 = 0; l2 < 2; l2++) {\n                       if ((i >= h0 && l1) || (i >= h1 && l2)) continue;\n                       int hh = l1 + l2 + k, now = j + l1 + l2;\n                       if ((hh & 1) == num[i])\n                         f[i][now][hh >> 1] += f[i - 1][j][k];\n                     }\n                 }\n           ans += f[tt][n][0];\n         }\n       }\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int shortestPaths[100][100];\n int graph[100][100];\n void bfs(int start, int n) {\n   queue<int> q;\n   q.push(start);\n   int visited[n];\n   for (int i = 0; i < n; i++) {\n     visited[i] = 0;\n   }\n   visited[start] = 1;\n   int dist = 1;\n   while (true) {\n     int sz = q.size();\n     if (sz == 0) {\n       break;\n     }\n     for (int i = 0; i < sz; i++) {\n       int cur = q.front();\n       q.pop();\n       for (int j = 0; j < 100; j++) {\n         if (graph[cur][j] == 1 && visited[j] == 0) {\n           visited[j] = 1;\n           shortestPaths[start][j] = dist;\n           q.push(j);\n         }\n       }\n     }\n     dist++;\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   int n;\n   cin >> n;\n   for (int i = 0; i < 100; i++) {\n     for (int j = 0; j < 100; j++) {\n       shortestPaths[i][j] = 0;\n       graph[i][j] = 0;\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     string s;\n     cin >> s;\n     for (int j = 0; j < n; j++) {\n       graph[i][j] = (int)(s[j] - '0');\n     }\n   }\n   int m;\n   cin >> m;\n   vector<int> vertices;\n   for (int i = 0; i < m; i++) {\n     int a;\n     cin >> a;\n     a--;\n     vertices.push_back(a);\n   }\n   for (int i = 0; i < n; i++) {\n     bfs(i, n);\n   }\n   vector<int> result;\n   result.push_back(vertices[0]);\n   int last = vertices[0];\n   int ind = 0;\n   for (int i = 1; i < m; i++) {\n     if (i != 1) {\n       if (shortestPaths[last][vertices[i]] < i - ind) {\n         result.push_back(vertices[i - 1]);\n         ind = i - 1;\n         last = vertices[i - 1];\n       }\n     }\n   }\n   result.push_back(vertices[vertices.size() - 1]);\n   cout << result.size() << endl;\n   for (int i = 0; i < result.size(); i++) {\n     cout << result[i] + 1 << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 111111;\n long long tree[maxn * 4];\n void Insert(int o, int l, int r, int k, int v) {\n   if (l == r) {\n     tree[o] = v;\n     return;\n   }\n   int mid = (l + r) >> 1;\n   if (k <= mid)\n     Insert(o * 2, l, mid, k, v);\n   else\n     Insert(o * 2 + 1, mid + 1, r, k, v);\n   tree[o] = tree[o * 2] + tree[o * 2 + 1];\n }\n long long Query(int o, int l, int r, int L, int R) {\n   if (L <= l && r <= R) return tree[o];\n   int mid = (l + r) >> 1;\n   long double ans = 0;\n   if (L <= mid) ans += Query(o * 2, l, mid, L, R);\n   if (R > mid) ans += Query(o * 2 + 1, mid + 1, r, L, R);\n   return ans;\n }\n int n, x, a[maxn], f[maxn];\n int main() {\n   cin >> n;\n   long double ans = 0;\n   for (int i = 1; i <= n; i++) cin >> a[i], f[a[i]] = i;\n   for (int i = 1; i <= n; i++) {\n     ans += Query(1, 1, n, a[i], n);\n     Insert(1, 1, n, a[i], 1);\n   }\n   ans *= ((long long)n * (n + 1));\n   memset(tree, 0, sizeof(tree));\n   long long last = 0;\n   for (int i = 1; i <= n; i++) {\n     ans -= (last + Query(1, 1, n, a[i], n));\n     last = last + Query(1, 1, n, a[i], n);\n     Insert(1, 1, n, a[i], f[a[i]] * 2);\n   }\n   for (int i = 1; i <= n; i++)\n     ans += ((long long)(n - i + 1) * i * (i - 1) / 2);\n   ans /= ((long long)n * (n + 1));\n   cout << setprecision(15) << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[200001][22];\n int p[200001];\n int d[200001];\n int lca(int u, int v) {\n   if (d[u] < d[v]) swap(u, v);\n   int k = d[u] - d[v];\n   while (k > 0) {\n     int t = log2(k);\n     k -= (1 << t);\n     u = a[u][t];\n   }\n   if (u == v) return v;\n   for (int i = 20; i >= 0; i--) {\n     if (a[u][i] != a[v][i]) u = a[u][i], v = a[v][i];\n   }\n   return p[v];\n }\n int orobitiasvla(int x, int v) {\n   while (x > 0) {\n     int t = log2(x);\n     v = a[v][t];\n     x -= (1 << t);\n   }\n   return v;\n }\n int main() {\n   int n;\n   cin >> n;\n   int cnt = 2;\n   for (int i = 1; i <= n; i++) {\n     for (int j = 0; j <= 20; j++) a[i][j] = -1;\n   }\n   d[1] = 0;\n   int d1 = 1, d2 = 1;\n   int mx = 0;\n   n--;\n   while (n--) {\n     int k;\n     cin >> k;\n     a[cnt][0] = k;\n     p[cnt] = k;\n     d[cnt] = d[k] + 1;\n     for (int i = 1; i <= 20; i++)\n       if (d[cnt] >= (1 << i)) a[cnt][i] = orobitiasvla((1 << i) - 1, k);\n     int y = lca(cnt, d1);\n     int cost = d[cnt] - d[y] + d[d1] - d[y];\n     y = lca(cnt, d2);\n     int cost1 = d[cnt] - d[y] + d[d2] - d[y];\n     if (cost1 > mx || cost > mx) {\n       if (cost > cost1)\n         d2 = cnt;\n       else\n         d1 = cnt;\n       mx = max(cost, cost1);\n     }\n     cout << mx << ' ';\n     cnt++;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 6e5 + 7;\n int a, b, n, ans;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0), cout.tie(0);\n   cin >> a >> b, n = a + b;\n   for (int l = 1, r, s; l <= n; l = r + 1) {\n     s = n / l, r = n / s;\n     int al = (a + s) / (s + 1), ar = a / s, bl = (b + s) / (s + 1), br = b / s;\n     if (al <= ar && bl <= br) ans += min(ar + br, r) - max(al + bl, l) + 1;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, a, b, c, d, s, len;\n vector<long long> z, t, v[2];\n map<long long, int> ma;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin >> n >> a >> b >> c >> d >> s >> len;\n   t.assign(n + 1, -1);\n   v[0].assign(n + 1, s);\n   v[1].assign(n + 1, s);\n   for (int i = 0; i < n; ++i) {\n     int q;\n     cin >> t[i + 1] >> q;\n     v[0][i + 1] = v[0][i] + (q ? a : -b);\n     v[1][i + 1] = v[1][i] + (q ? c : -d);\n   }\n   int lim = 0;\n   ++ma[v[1][0]];\n   for (int i = 0; i < n + 1; ++i) {\n     if (v[0][i] < 0) break;\n     if (!(--ma[v[1][i]])) ma.erase(v[1][i]);\n     int be = t[i] + 1;\n     while (lim < n + 1 && t[lim] < be + len) {\n       ++ma[v[1][lim]];\n       ++lim;\n     }\n     if (i + 1 == lim || v[0][i] - v[1][i] + ma.begin()->first >= 0) {\n       cout << be << endl;\n       return 0;\n     }\n   }\n   cout << -1 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int A[100], L[100], n, m;\n   cin >> n >> m;\n   for (int i = 0; i < n; ++i) cin >> A[i], A[i]--;\n   for (int i = 0; i < m; ++i) cin >> L[i];\n   for (int i = 0; i < n; ++i) {\n     for (int j = i + 1; j <= n; ++j) {\n       vector<int> cnt(m + 1, 0);\n       for (int k = i; k < j; ++k) cnt[A[k]]++;\n       bool fl = true;\n       for (int k = 0; k < m; ++k) fl &= (L[k] == cnt[k]);\n       if (fl) {\n         cout << 'YES\n';\n         return 0;\n       }\n     }\n   }\n   cout << 'NO\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, b[1000010];\n int main() {\n   scanf('%d%d', &n, &k);\n   int i;\n   if (k * 3 > n || k == 1)\n     puts('-1');\n   else {\n     for (i = 1; i <= (int)(k); ++i) b[i] = b[i + 2 * k] = i, b[i + k] = i - 1;\n     b[k + 1] = k;\n     for (i = 3 * k + 1; i <= n; ++i) b[i] = 1;\n     for (i = 1; i <= (int)(n); ++i) printf('%d ', b[i]);\n     puts('');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[9][5], b[8];\n long long dis(int i, int j) {\n   long long x = a[i][0] - a[j][0], y = a[i][1] - a[j][1], z = a[i][2] - a[j][2];\n   return x * x + y * y + z * z;\n }\n bool check() {\n   for (int i = 0; i < 8; i++) {\n     for (int j = 0; j < 8; j++) {\n       if (i == j) continue;\n       if (j < i)\n         b[j] = dis(i, j);\n       else\n         b[j - 1] = dis(i, j);\n     }\n     sort(b, b + 7);\n     long long t1 = b[0], t2 = 2 * b[0], t3 = 3 * b[0];\n     if (t1 == 0 || t1 != b[1] || t1 != b[2] || t2 != b[3] || t2 != b[4] ||\n         t2 != b[5] || t3 != b[6])\n       return false;\n   }\n   return true;\n }\n bool is_ok(int cur) {\n   if (cur == 8) {\n     return check();\n   }\n   sort(a[cur], a[cur] + 3);\n   do {\n     if (is_ok(cur + 1)) return true;\n   } while (next_permutation(a[cur], a[cur] + 3));\n   return false;\n }\n int main() {\n   for (int i = 0; i < 8; i++) cin >> a[i][0] >> a[i][1] >> a[i][2];\n   if (!is_ok(0))\n     puts('NO');\n   else {\n     puts('YES');\n     for (int i = 0; i < 8; i++)\n       for (int j = 0; j < 3; j++) {\n         cout << a[i][j] << ' ';\n         if (j == 2) cout << endl;\n       }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int constexpr nax = 3e5 + 5;\n using ll = int64_t;\n const int INF = 1e9;\n template <typename T>\n struct fenwick {\n   T bit[nax];\n   fenwick() { memset(bit, 0, sizeof(bit)); }\n   void update(int x, T val) {\n     for (; x < nax; x += x & -x) bit[x] += val;\n   }\n   T get(int x) {\n     int res = 0;\n     for (; x > 0; x -= x & -x) res += bit[x];\n     return res;\n   }\n   T get(int l, int r) { return get(r) - get(l - 1); }\n };\n struct segtree {\n   static constexpr int Mx = 4 * nax;\n   ll sg[Mx] = {}, tag[Mx] = {};\n   inline void pull(int v) { sg[v] = min(sg[v * 2], sg[v * 2 + 1]); }\n   segtree() {\n     fill(sg, sg + Mx, INF);\n     fill(tag, tag + Mx, 0);\n   }\n   inline void push(int v) {\n     if (v * 2 + 1 < Mx && tag[v]) {\n       sg[v * 2] += tag[v];\n       sg[v * 2 + 1] += tag[v];\n       tag[v * 2] += tag[v];\n       tag[v * 2 + 1] += tag[v];\n     }\n     tag[v] = 0;\n   }\n   inline void update(int v, int x, int y, int l, int r, ll val) {\n     push(v);\n     if (l > r) return;\n     if (l == x && r == y) {\n       sg[v] += val;\n       tag[v] += val;\n       return push(v);\n     }\n     int mid = x + y >> 1;\n     update(v * 2, x, mid, l, min(r, mid), val);\n     update(v * 2 + 1, mid + 1, y, max(l, mid + 1), r, val);\n     pull(v);\n   }\n   int find_first_neg(int v, int x, int y) {\n     push(v);\n     if (x == y) {\n       assert(sg[v] <= 0);\n       return x;\n     } else {\n       int mid = x + y >> 1;\n       if (sg[v * 2] <= 0)\n         return find_first_neg(v * 2, x, mid);\n       else\n         return find_first_neg(v * 2 + 1, mid + 1, y);\n     }\n   }\n };\n segtree sg;\n fenwick<int> sum;\n int n, nq;\n int ans[nax];\n int b[nax];\n vector<pair<int, int>> q[nax];\n int main() {\n   cin.tie(0)->sync_with_stdio(false);\n   cin >> n >> nq;\n   for (int i = 1; i <= n; ++i) {\n     cin >> b[i];\n     b[i] = i < b[i] ? INF : i - b[i];\n   }\n   for (int i = 1; i <= nq; ++i) {\n     int x, y;\n     cin >> x >> y;\n     q[x + 1].emplace_back(n - y, i);\n   }\n   for (int i = n; i >= 1; --i) {\n     sg.update(1, 1, n, i, i, (ll)b[i] - INF);\n     while (sg.sg[1] <= 0) {\n       int v = sg.find_first_neg(1, 1, n);\n       sum.update(v, 1);\n       sg.update(1, 1, n, v, v, INF);\n       sg.update(1, 1, n, v, n, -1);\n     }\n     for (const auto &[r, id] : q[i]) ans[id] = sum.get(i, r);\n   }\n   for (int i = 1; i <= nq; ++i) {\n     cout << ans[i] << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 1e9 + 239;\n int n, m, k;\n vector<set<int>> row;\n vector<set<int>> column;\n vector<set<int>> row_free;\n vector<set<int>> column_free;\n int get_row_left(int i, int to, int from) {\n   auto it = row[i].lower_bound(from);\n   if (it == row[i].begin()) {\n     return to;\n   }\n   it--;\n   if (to <= *(it) && *(it) <= from) {\n     return *(it) + 1;\n   } else {\n     return to;\n   }\n }\n int get_row_right(int i, int to, int from) {\n   auto it = row[i].lower_bound(from);\n   if (it == row[i].end()) {\n     return to;\n   }\n   if ((*it) <= to) {\n     return (*it) - 1;\n   } else {\n     return to;\n   }\n }\n int get_column_up(int j, int to, int from) {\n   auto it = column[j].lower_bound(from);\n   if (it == column[j].begin()) {\n     return to;\n   }\n   it--;\n   if (to <= *(it) && *(it) <= from) {\n     return *(it) + 1;\n   } else {\n     return to;\n   }\n }\n int get_column_down(int j, int to, int from) {\n   auto it = column[j].lower_bound(from);\n   if (it == column[j].end()) {\n     return to;\n   }\n   if ((*it) <= to) {\n     return (*it) - 1;\n   } else {\n     return to;\n   }\n }\n vector<pair<int, int>> all_next(int i, int j) {\n   int ff = get_row_left(i, max(0, j - k), j);\n   int ss = get_row_right(i, min(m - 1, j + k), j);\n   int tt = get_column_up(j, max(0, i - k), i);\n   int th = get_column_down(j, min(n - 1, i + k), i);\n   vector<pair<int, int>> ans;\n   if (j > 0) {\n     auto it = row_free[i].lower_bound(ff);\n     while (true) {\n       if (it == row_free[i].end()) {\n         break;\n       }\n       if (*(it) >= j) {\n         break;\n       }\n       ans.push_back({i, *(it)});\n       it++;\n     }\n   }\n   if (j + 1 < m) {\n     auto it = row_free[i].upper_bound(j);\n     while (true) {\n       if (it == row_free[i].end()) {\n         break;\n       }\n       if (*(it) > ss) {\n         break;\n       }\n       ans.push_back({i, *(it)});\n       it++;\n     }\n   }\n   if (i > 0) {\n     auto it = column_free[j].lower_bound(tt);\n     while (true) {\n       if (it == column_free[j].end()) {\n         break;\n       }\n       if (*(it) >= i) {\n         break;\n       }\n       ans.push_back({*(it), j});\n       it++;\n     }\n   }\n   if (i + 1 < n) {\n     auto it = column_free[j].upper_bound(i);\n     while (true) {\n       if (it == column_free[j].end()) {\n         break;\n       }\n       if (*(it) > th) {\n         break;\n       }\n       ans.push_back({*(it), j});\n       it++;\n     }\n   }\n   return ans;\n }\n void bfs(int si, int sj, int ei, int ej) {\n   vector<vector<int>> d(n, vector<int>(m, inf));\n   d[si][sj] = 0;\n   queue<pair<int, int>> q;\n   q.push({si, sj});\n   row_free[si].erase(sj);\n   column_free[sj].erase(si);\n   while (!q.empty()) {\n     auto tmp = q.front();\n     q.pop();\n     int ci = tmp.first;\n     int cj = tmp.second;\n     auto next = all_next(ci, cj);\n     for (auto [ni, nj] : next) {\n       if (d[ni][nj] > d[ci][cj] + 1) {\n         d[ni][nj] = d[ci][cj] + 1;\n         row_free[ni].erase(nj);\n         column_free[nj].erase(ni);\n         q.push({ni, nj});\n       }\n     }\n   }\n   int res = d[ei][ej];\n   if (res == inf) {\n     cout << -1;\n   } else {\n     cout << res;\n   }\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n >> m >> k;\n   row.resize(n);\n   column.resize(m);\n   row_free.resize(n);\n   column_free.resize(m);\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       char c;\n       cin >> c;\n       if (c == '#') {\n         row[i].insert(j);\n         column[j].insert(i);\n       } else {\n         row_free[i].insert(j);\n         column_free[j].insert(i);\n       }\n     }\n   }\n   int si, sj, ei, ej;\n   cin >> si >> sj >> ei >> ej;\n   si--;\n   sj--;\n   ei--;\n   ej--;\n   bfs(si, sj, ei, ej);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s, t;\n int dp[5005][5005];\n int get(int i, int j) {\n   if (dp[i][j] != -1) return dp[i][j];\n   if (i >= s.size() or j >= t.size()) return 0;\n   int ret = get(i, j + 1);\n   if (s[i] == t[j]) ret = (ret + 1 + get(i + 1, j + 1)) % 1000000007;\n   return dp[i][j] = ret;\n   ;\n }\n int main() {\n   for (int i = 0; i < 5005; ++i)\n     for (int j = 0; j < 5005; ++j) dp[i][j] = -1;\n   cin >> s >> t;\n   long long ret = 0;\n   for (int i = 0; i < s.size(); ++i) ret = (ret + get(i, 0)) % 1000000007;\n   cout << ret << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long t, n, k;\n long long f(long long x) {\n   if (x == 0) return k * (k + 1) / 2;\n   long long t = x % k, val = f(x / k), ofs = 0;\n   if (val < k * t + 2) {\n     ofs = k;\n   } else if ((t + 1) * k < val) {\n     ofs = 0;\n   } else {\n     ofs = (t + 1) * k - val + 1;\n   }\n   return k * (k + 1) / 2 - t + ofs;\n }\n long long rjesi(long long x) {\n   long long buk = (x - 1) / (k * k + 1);\n   long long pos = (k * k + 1) * buk + f(buk);\n   if (x != pos) {\n     long long lef = buk + (pos < x);\n     return (x - 1 - lef) / k - lef + x;\n   } else {\n     long long t = buk % k, val = f(buk / k);\n     if ((t + 1) * k < val) {\n       return rjesi(buk / k * (k * k + 1) + (t + 1) * k) + 1;\n     } else {\n       return rjesi(buk / k * (k * k + 1) + (t + 1) * k + 1) + 1;\n     }\n   }\n }\n int main() {\n   cin >> t;\n   while (t--) {\n     cin >> n >> k;\n     cout << rjesi(n) << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 305;\n long long dp[maxn][maxn][6];\n int n, x[maxn], y[maxn];\n vector<pair<double, pair<int, int>>> seg;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> x[i] >> y[i];\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       for (int k = 0; k < 6; k++) dp[i][j][k] = 0;\n       if (i == j) dp[i][j][0] = 1;\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       if (i != j) {\n         int xx = x[j] - x[i], yy = y[j] - y[i];\n         seg.push_back({atan2(xx, yy), {i, j}});\n       }\n     }\n   }\n   sort(seg.begin(), seg.end());\n   int m = seg.size();\n   for (int cc = 0; cc < m; cc++) {\n     int i = seg[cc].second.first, j = seg[cc].second.second;\n     for (int k = 0; k < n; k++)\n       for (int f = 0; f < 5; f++) dp[k][i][f + 1] += dp[k][j][f];\n   }\n   long long ret = 0;\n   for (int i = 0; i < n; i++) ret += dp[i][i][5];\n   cout << ret << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   if ((n & (n - 1)) == 0) {\n     cout << 0 << '\n';\n   } else {\n     int k = 0;\n     while ((1 << k + 1) <= n) {\n       k++;\n     }\n     n ^= 1 << k;\n     int ans = 0;\n     for (int i = 0; i < k; ++i) {\n       int j = i + 1;\n       if (j >= k) {\n         j -= k;\n       }\n       if (n & (1 << j)) {\n         ans |= 1 << i;\n       }\n     }\n     cout << ans << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool isprime(int n) {\n   if (n == 2) return 1;\n   for (int i = 2; i < n; i++) {\n     if (n % i == 0) return 0;\n   }\n   return 1;\n }\n int main() {\n   int n, m;\n   cin >> n >> m;\n   int flag = 1;\n   if (isprime(n) && isprime(m)) {\n     for (int i = n + 1; i < m; i++) {\n       if (isprime(i)) {\n         cout << 'NO' << endl;\n         flag = 0;\n         break;\n       }\n     }\n     if (flag) cout << 'YES' << endl;\n   } else {\n     cout << 'NO' << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = 200000 + 10;\n int a[N], n, K;\n int main() {\n   scanf('%d%d', &n, &K);\n   for (int i = 0; i < n; ++i) scanf('%d', &a[i]);\n   long long pre = 0;\n   int tot = n - 1, id = 0;\n   for (int i = 0; i < n; ++i) {\n     long long d = pre - (long long)a[i] * (tot - id) * id;\n     if (d < K) {\n       printf('%d\n', i + 1);\n       --tot;\n     } else {\n       pre = pre + (long long)a[i] * id;\n       ++id;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[105][105], t, m, n, ret, cnt, mn;\n int main(void) {\n   cin >> t;\n   for (int i = 0; i < t; i++) {\n     ret = 0, cnt = 0, mn = 101;\n     cin >> n >> m;\n     for (int j = 0; j < n; j++) {\n       for (int k = 0; k < m; k++) {\n         cin >> a[j][k];\n         if (a[j][k] <= 0) cnt++;\n         if (abs(a[j][k]) < mn) mn = abs(a[j][k]);\n       }\n     }\n     for (int j = 0; j < n; j++) {\n       for (int k = 0; k < m; k++) {\n         ret += abs(a[j][k]);\n       }\n     }\n     if (cnt % 2 == 1) ret -= 2 * mn;\n     cout << ret << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 510;\n int n, m;\n double xa, ya, x2, y2;\n double v, vx1, vx2, vy1, vy2, t;\n int check(double k) {\n   double x, y;\n   x = xa + vx1 * min(k, t) + vx2 * max(0.0, k - t);\n   y = ya + vy1 * min(k, t) + vy2 * max(0.0, k - t);\n   double dist = sqrt((x - x2) * (x - x2) + (y - y2) * (y - y2));\n   if (v * k >= dist) return 1;\n   return 0;\n }\n int main() {\n   int i, j, k;\n   while (~scanf('%lf%lf%lf%lf', &xa, &ya, &x2, &y2)) {\n     scanf('%lf%lf', &v, &t);\n     scanf('%lf%lf', &vx1, &vy1);\n     scanf('%lf%lf', &vx2, &vy2);\n     double l = 0.0, r = 1e9;\n     while ((r - l) > 1e-6) {\n       double mid = (l + r) / 2;\n       if (check(mid))\n         r = mid;\n       else\n         l = mid;\n     }\n     printf('%.10lf\n', l);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, x, sum = 0, q;\n   vector<int> v;\n   vector<int>::iterator it;\n   scanf('%d', &n);\n   while (n--) {\n     scanf('%d', &x);\n     sum += x;\n     v.push_back(sum);\n   }\n   int sz = v.size();\n   scanf('%d', &q);\n   while (q--) {\n     scanf('%d', &x);\n     it = lower_bound(v.begin(), v.end(), x);\n     printf('%d\n', (it - v.begin()) + 1);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[3005];\n int main() {\n   int n;\n   int cnt = 0;\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &a[i]);\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = i + 1; j < n; j++) {\n       if (a[i] > a[j]) cnt++;\n     }\n   }\n   if (cnt % 2 == 0)\n     printf('%.6f', cnt * 2.0);\n   else\n     printf('%.6f', cnt * 2.0 - 1);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n;\n   cin >> n;\n   long long r = n % 3;\n   if (r != 2)\n     cout << 1ll << ' ' << 1ll << ' ' << n - 2 << endl;\n   else\n     cout << 1ll << ' ' << 2ll << ' ' << n - 3 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast,unroll-loops')\n #pragma GCC target('avx,avx2,fma')\n using namespace std;\n template <typename T>\n using vc = vector<T>;\n template <typename T>\n using uset = unordered_set<T>;\n template <typename A, typename B>\n using umap = unordered_map<A, B>;\n template <typename T, typename Comp = less<T>>\n using pq = priority_queue<T, vc<T>, Comp>;\n template <typename T>\n using minpq = pq<T, greater<T>>;\n using ld = long double;\n using ll = long long;\n using ull = unsigned long long;\n using pii = pair<int, int>;\n using ppi = pair<pii, int>;\n using pip = pair<int, pii>;\n using vi = vc<int>;\n using vii = vc<pii>;\n constexpr char el = '\n';\n constexpr char sp = ' ';\n constexpr int INF = 0x3f3f3f3f;\n constexpr ll LLINF = 0x3f3f3f3f3f3f3f3fLL;\n char g[8][8];\n int dr[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};\n int dc[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};\n vi a[8][8];\n bool good(int r, int c) { return 0 <= r && r < 8 && 0 <= c && c < 8; }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout << fixed;\n   for (auto& x : g)\n     for (auto& y : x) cin >> y;\n   for (int i = 0; i < 8; ++i)\n     for (int j = 0; j < 8; ++j)\n       if (g[i][j] == 'S')\n         for (int k = i; k < 8; ++k) a[k][j].push_back(k - i);\n   for (auto& x : a)\n     for (auto& y : x) sort(y.begin(), y.end());\n   queue<tuple<int, int, int>> q;\n   q.emplace(7, 0, 0);\n   while (!q.empty()) {\n     auto [r, c, d] = q.front();\n     q.pop();\n     for (int i = 0; i < 9; ++i) {\n       int r1 = r + dr[i];\n       int c1 = c + dc[i];\n       if (r1 == 0 && c1 == 7) {\n         cout << 'WIN';\n         exit(0);\n       }\n       if (!good(r1, c1) || binary_search(begin(a[r1][c1]), end(a[r1][c1]), d) ||\n           binary_search(begin(a[r1][c1]), end(a[r1][c1]), d + 1))\n         continue;\n       q.emplace(r1, c1, d + 1);\n     }\n   }\n   cout << 'LOSE';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n  \n using namespace std;\n  \n #define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)\n #define fileio freopen('in.in', 'r', stdin),freopen('out.out', 'w', stdout);\n #define ll long long\n #define int long long\n #define FF first\n #define SS second\n #define mp make_pair\n #define pb push_back\n #define pii pair<ll,ll>\n #define pll pair<long long,long long>\n #define sd(x) scanf('%d',&x)\n #define slld(x) scanf('%lld',&x)\n #define pd(x) prllf('%d\n',x)\n #define plld(x) prllf('%lld\n',x)\n #define pss prllf\n #define MOD 1000000007\n #define eps 0.00001\n #define endl '\n'\n #define debug(n1) cout<<n1<<endl\n ll n,k,s[1005],e[1005],c[1005];\n bool y[1005];\n const ll INF = 1e17+5;\n int mm[100005];\n vector<int>temp[100005];\n \n struct MinimumCostMaximumFlow {\n   typedef ll Index; typedef ll Flow; typedef ll Cost;\n   static const Flow InfCapacity = INF;\n   struct Edge {\n     Index to; Index rev;\n     Flow capacity; Cost cost;\n   };\n   vector<vector<Edge> > g;\n   void init(Index n) { g.assign(n, vector<Edge>()); }\n   void addEdge(bool inv,Index i, Index j, Flow capacity = InfCapacity, Cost cost = Cost() ) {\n     Edge e, f; e.to = j, f.to = i; e.capacity = capacity, f.capacity = 0; e.cost = cost, f.cost = -cost;\n     if(inv)\n     {\n         temp[i].push_back(mm[i]);\n     }\n     mm[i]++;\n     mm[j]++;\n \n     g[i].push_back(e); g[j].push_back(f);\n     g[i].back().rev = (Index)g[j].size() - 1; g[j].back().rev = (Index)g[i].size() - 1;\n   }\n   void addB(Index i, Index j, Flow capacity = InfCapacity, Cost cost = Cost()) {\n     addEdge(0,i, j, capacity, cost);\n     addEdge(0,j, i, capacity, cost);\n   }\n \n   pair<Cost, Flow> minimumCostMaximumFlow(Index s, Index t, Flow f = InfCapacity, bool useSPFA = false) {\n     ll n = g.size();\n     vector<Cost> dist(n); vector<Index> prev(n); vector<Index> prevEdge(n);\n     pair<Cost, Flow> total = make_pair(0, 0);\n     vector<Cost> potential(n);\n     while(f > 0) {\n       fill(dist.begin(), dist.end(), INF);\n       if(useSPFA || total.second == 0) {\n         deque<Index> q;\n         q.push_back(s); dist[s] = 0; vector<bool> inqueue(n);\n         while(!q.empty()) {\n           Index i = q.front(); q.pop_front(); inqueue[i] = false;\n           for(Index ei = 0; ei < (Index)g[i].size(); ei ++) {\n             const Edge &e = g[i][ei]; Index j = e.to; Cost d = dist[i] + e.cost;\n             if(e.capacity > 0 && d < dist[j]) {\n               if(!inqueue[j]) {\n                 inqueue[j] = true;\n                 q.push_back(j);\n               }\n               dist[j] = d; prev[j] = i; prevEdge[j] = ei;\n             }\n           }\n         }\n       } else {\n         vector<bool> vis(n);\n         priority_queue<pair<Cost, Index> > q;\n         q.push(make_pair(-0, s)); dist[s] = 0;\n         while(!q.empty()) {\n           Index i = q.top().second; q.pop();\n           if(vis[i]) continue;\n           vis[i] = true;\n           for(Index ei = 0; ei < (Index)g[i].size(); ei ++) {\n             const Edge &e = g[i][ei];\n             if(e.capacity <= 0) continue;\n             Index j = e.to; Cost d = dist[i] + e.cost + potential[i] - potential[j];\n             if(dist[j] > d) {\n               dist[j] = d; prev[j] = i; prevEdge[j] = ei;\n               q.push(make_pair(-d, j));\n             }\n           }\n         }\n       }\n       if(dist[t] == INF) break;\n       if(!useSPFA) for(Index i = 0; i < n; i ++) potential[i] += dist[i];\n  \n       Flow d = f; Cost distt = 0;\n       for(Index v = t; v != s; ) {\n         Index u = prev[v]; const Edge &e = g[u][prevEdge[v]];\n         d = min(d, e.capacity); distt += e.cost; v = u;\n       }\n       f -= d; total.first += d * distt; total.second += d;\n       for(Index v = t; v != s; v = prev[v]) {\n         Edge &e = g[prev[v]][prevEdge[v]];\n         e.capacity -= d; g[e.to][e.rev].capacity += d;\n       }\n     }\n     return total;\n   }\n };\n  \n \n int find_num(string ss)\n {\n     int ans=0;\n     int tt=1;\n     reverse(ss.begin(),ss.end());\n \n     for(auto i:ss)\n     {\n         ans+=(i-'0')*tt;\n         tt*=2;\n     }\n     return ans;\n }\n \n \n \n vector<vector<int> >adj;\n int sz[1000005];\n int vis[1000005];\n int a[100005];\n vector<string>fi;\n int d;\n \n void print(int yy)\n {\n     for(int i=0;i<10;i++)\n     {\n         if(((1<<i)&yy))\n         {\n             fi.push_back(to_string(d-i-1));\n         }\n     }\n }\n \n void dfs(int ver,int x)\n {\n     vis[ver]=1;\n     print(a[ver]^x);\n     int cnt=0;\n \n \n     for(auto i:adj[ver])\n     {\n         if(vis[i]==0)\n         {\n             if(cnt)\n             {\n                 fi.push_back('R');\n                 print(a[ver]);\n                 dfs(i,a[ver]);\n             }\n             else\n             {\n                 dfs(i,a[ver]);\n             }\n             cnt++;\n         }\n     }\n }\n \n signed main()\n {\n  \n ios_base::sync_with_stdio(false); \n cin.tie(NULL);  \n cout.tie(0);   \n  \n #ifndef ONLINE_JUDGE\n     if(fopen('INPUT.txt','r'))\n     {\n         freopen('INPUT.txt','r',stdin);\n         freopen('OUTPUT.txt','w',stdout);\n     }\n \n #endif          \n \n     int n;\n     cin>>d>>n;\n     string se[n];\n     for(int i=0;i<n;i++)\n     {\n         cin>>se[i];\n         a[i+1]=find_num(se[i]);\n     }\n \n     adj.resize(n+1);\n \n     MinimumCostMaximumFlow kad;\n     int source=0;\n     int sink=2*n+5;\n \n     kad.init(2*n+10);\n \n     for(int i=1;i<=n;i++)\n     {\n         for(int j=1;j<=n;j++)\n         {\n             if(i!=j)\n             {\n                 if((a[i]&a[j])==a[j])\n                 {\n                     kad.addEdge(1,n+j,i,1,-(__builtin_popcount(a[j])+1));\n                 }\n             }\n         }\n \n         kad.addEdge(0,i,n+i,1,0);\n         kad.addEdge(0,source,i,1,0);\n         kad.addEdge(0,n+i,sink,1,-(__builtin_popcount(a[i])+1));\n     }\n \n     kad.addEdge(0,source,sink,n,0);\n \n     pair<int,int> ans=kad.minimumCostMaximumFlow(source,sink,n,0);\n \n     for(int i=n+1;i<=2*n;i++)\n     {\n         for(auto j:temp[i])\n         {\n             if(kad.g[i][j].capacity==0)\n             {\n                 adj[i-n].push_back(kad.g[i][j].to);\n             }\n         }\n     }\n \n     set<pair<int,int> >ss;\n     int cc=0;\n     for(int i=1;i<=n;i++)\n     {\n         ss.insert({a[i],i});\n     }\n \n     while(!ss.empty())\n     {\n         auto j=ss.begin();\n         if(vis[j->second])\n         {\n             ss.erase(j);\n             continue;\n         }\n         if(cc)\n             fi.push_back('R');\n         cc++;\n         dfs(j->second,0);\n     }\n \n     cout<<fi.size()<<'\n';\n     for(auto i:fi)\n         cout<<i<<' ';\n \n \n \n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n namespace INIT {\n char buf[1 << 15], *fs, *ft;\n inline char getc() {\n   return (fs == ft &&\n           (ft = (fs = buf) + fread(buf, 1, 1 << 15, stdin), fs == ft))\n              ? 0\n              : *fs++;\n }\n inline int read() {\n   int x = 0, f = 1;\n   char ch = getc();\n   while (!isdigit(ch)) {\n     if (ch == '-') f = -1;\n     ch = getc();\n   }\n   while (isdigit(ch)) {\n     x = x * 10 + ch - '0';\n     ch = getc();\n   }\n   return x * f;\n }\n }  // namespace INIT\n using namespace INIT;\n int n, p[1000010], vis[1000010], ans[1000010];\n vector<int> a[1000010], b[1000010];\n int main() {\n   n = read();\n   for (int i = 1; i <= n; ++i) p[i] = read();\n   for (int i = 1; i <= n; ++i) {\n     int num = 0;\n     for (int j = i; !vis[j]; j = p[j]) vis[j] = 1, ++num, a[i].push_back(j);\n     b[num].push_back(i);\n   }\n   for (int i = 1; i <= n; ++i)\n     if (i % 2 == 0 && (b[i].size() & 1)) {\n       puts('-1');\n       return 0;\n     }\n   memset(vis, 0, sizeof(vis));\n   for (int i = 0; i <= (int)b[1].size() - 1; ++i) ans[b[1][i]] = b[1][i];\n   for (int i = 2; i <= n; ++i)\n     for (int j = 0; j <= (int)b[i].size() - 1; ++j) {\n       if (i & 1) {\n         int x = a[b[i][j]][0], y = a[b[i][j]][i / 2 + 1];\n         while (!vis[x]) {\n           vis[x] = vis[y] = 1;\n           ans[x] = y;\n           x = p[x];\n           ans[y] = x;\n           y = p[y];\n         }\n       } else {\n         int x = a[b[i][j]][0], y = a[b[i][j + 1]][0];\n         while (!vis[x] && !vis[y]) {\n           vis[x] = vis[y] = 1;\n           ans[x] = y;\n           x = p[x];\n           ans[y] = x;\n           y = p[y];\n         }\n         j++;\n       }\n     }\n   for (int i = 1; i <= n; ++i) printf('%d ', ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = (int)2e9;\n const long long INFL = (long long)9e18;\n const int MAXINT = ((~0) ^ (1 << 31));\n const long long MAXLL = ((~0) ^ ((long long)1 << 63));\n template <class T>\n inline T pow2(T a) {\n   return a * a;\n }\n template <class T>\n inline bool mineq(T& a, T b) {\n   return (a > b) ? (a = b, true) : false;\n }\n template <class T>\n inline bool maxeq(T& a, T b) {\n   return (a < b) ? (a = b, true) : false;\n }\n const int maxn = 2e5;\n long long n, k, x, cnt;\n pair<long long, long long> p[maxn];\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n >> k;\n   for (int i = 1; i <= n; i++) p[i] = {1e10, 0};\n   for (int i = 1; i <= k; i++) {\n     cin >> x;\n     p[x].first = min(p[x].first, (long long)i);\n     p[x].second = max(p[x].second, (long long)i);\n   }\n   if (p[1].first > p[2].second && n != 1) {\n     cnt++;\n   }\n   if (p[n].first > p[n - 1].second && n != 1) {\n     cnt++;\n   }\n   if (p[1].second == 0) cnt++;\n   if (p[n].second == 0 && n != 1) cnt++;\n   for (int i = 2; i <= n - 1; i++) {\n     if (p[i].second == 0) cnt++;\n     if (p[i].first > p[i + 1].second) {\n       cnt++;\n     }\n     if (p[i].first > p[i - 1].second) {\n       cnt++;\n     }\n   }\n   cout << cnt;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, ti[2005], co[2005], dp[2005][2005], i, j;\n int main() {\n   cin >> n;\n   for (i = 1; i <= n; i++) {\n     cin >> ti[i] >> co[i];\n     ti[i]++;\n   }\n   for (i = 0; i <= n; i++) {\n     for (j = 1; j <= n; j++) dp[i][j] = 1e16;\n   }\n   for (i = 1; i <= n; i++) {\n     for (j = 1; j <= n; j++) {\n       dp[i][j] = min(dp[i - 1][j], dp[i - 1][max(0ll, j - ti[i])] + co[i]);\n     }\n   }\n   cout << dp[n][n];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<pen> marker;\n   vector<pen> 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<pen> tempM = singleMatch[i].marker;\n     vector<pen> 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<pen> tempM = doubleMatch[i][j].marker;\n       vector<pen> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n template <typename T>\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<node> 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 <bits/stdc++.h>\n using namespace std;\n long long MOD = 1e9 + 7;\n std::vector<long long> 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<long long> 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<long long> 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<long long> dp2(n + 1, 1);\n   vector<long long> 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<long long> 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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 105;\n const int M = 505;\n const int MOD = int(1e9) + 7;\n const int INF = 0x3f3f3f3f;\n const double EPS = 1e-9;\n const double PI = acos(-1.0);\n const int dx[] = {-1, 1, 0, 0};\n const int dy[] = {0, 0, -1, 1};\n template <class T>\n inline T Min(T a, T b) {\n   return a < b ? a : b;\n }\n template <class T>\n inline T Max(T a, T b) {\n   return a > b ? a : b;\n }\n template <class T>\n inline T Min(T a, T b, T c) {\n   return min(min(a, b), c);\n }\n template <class T>\n inline T Max(T a, T b, T c) {\n   return max(max(a, b), c);\n }\n template <class T>\n inline T sqr(T a) {\n   return a * a;\n }\n template <class T>\n inline T cub(T a) {\n   return a * a * a;\n }\n template <class T>\n inline T gcd(T a, T b) {\n   return b == 0 ? a : gcd(b, a % b);\n }\n template <class T>\n inline T lcm(T a, T b) {\n   return a * b / gcd(a, b);\n }\n int main() {\n   int a, b;\n   while (scanf('%d%d', &a, &b) != EOF) {\n     int i, tot = (a * (a - 1)) / 2;\n     if (tot <= b) {\n       printf('no solution\n');\n     } else {\n       for (i = 0; i < a; i++) {\n         printf('%d %d\n', 0, i);\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, q;\n int A[600006];\n int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }\n map<pair<int, int>, int> M;\n int L[600006], R[600006], lst[600006], cn;\n struct que {\n   int l, r, idx;\n } Q[600006];\n vector<int> bc[600006];\n int T[600006];\n void ad(int x, int c) {\n   while (x <= cn) T[x] += c, x += (x & -x);\n }\n int sum(int x) {\n   int ret = 0;\n   while (x > 0) ret += T[x], x -= (x & -x);\n   return ret;\n }\n int ans[600006];\n void solve() {\n   cin >> n;\n   for (int i = (1), iend = (n); i <= iend; ++i) {\n     int k;\n     scanf('%d', &k);\n     L[i] = cn + 1;\n     int px, py, tx, ty, x, y, sx, sy;\n     scanf('%d%d', &px, &py);\n     sx = px, sy = py;\n     for (int j = (1), jend = (k); j <= jend; ++j) {\n       if (j != k)\n         scanf('%d%d', &x, &y);\n       else\n         x = sx, y = sy;\n       tx = x, ty = y;\n       x -= px, y -= py;\n       int g = gcd(abs(x), abs(y));\n       x /= g, y /= g;\n       ++cn;\n       lst[cn] = M[make_pair(x, y)];\n       bc[lst[cn]].push_back(cn);\n       M[make_pair(x, y)] = cn;\n       px = tx, py = ty;\n     }\n     R[i] = cn;\n   }\n   cin >> q;\n   for (int i = (1), iend = (q); i <= iend; ++i) {\n     int l, r;\n     scanf('%d%d', &l, &r);\n     l = L[l], r = R[r];\n     Q[i] = (que){l, r, i};\n   }\n   sort(Q + 1, Q + 1 + q, [](que a, que b) { return a.l < b.l; });\n   int cur = 1;\n   for (int i = (0), iend = (cn); i <= iend; ++i) {\n     while (cur <= q && Q[cur].l == i) {\n       ans[Q[cur].idx] = sum(Q[cur].r) - sum(Q[cur].l - 1);\n       ++cur;\n     }\n     for (int x : bc[i]) ad(x, 1);\n   }\n   for (int i = (1), iend = (q); i <= iend; ++i) printf('%d\n', ans[i]);\n }\n signed main() { solve(); }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long remi = 1000000007;\n const long long remi2 = 998244353;\n const long long inf = 1e18 + 1e17 + 1e16 + 1e15 + 1e14;\n long long Pow(long long x, long long y, long long m) {\n   if (y == 0) return 1;\n   long long p = Pow(x, y / 2, m) % m;\n   p = (p * p) % m;\n   return (y % 2 == 0) ? p : (x * p) % m;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long i, j, k;\n   long long n, m;\n   cin >> n >> m;\n   vector<long long> v(m);\n   for (i = 0; i < m; i++) {\n     cin >> v[i];\n   }\n   sort(v.begin(), v.end());\n   bool ans = true;\n   if (m == 0) {\n     cout << 'YES';\n     exit(0);\n   }\n   if (v[0] == 1 or v[m - 1] == n) ans = false;\n   for (i = 2; i < m; i++) {\n     long long s0 = v[i - 2];\n     long long s1 = v[i - 1];\n     long long s2 = v[i];\n     if ((s0 == s2 - 2) and (s1 == s2 - 1)) ans = false;\n   }\n   if (ans)\n     cout << 'YES';\n   else\n     cout << 'NO';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n \n int main()\n {\n 	ios_base::sync_with_stdio(false), cin.tie(0);\n 	int t;\n 	cin >> t;\n 	while (t--) {\n 		map<int, int>L, R;\n 		int bal = 0;\n 		string s;\n 		cin >> s;\n 		for (char &c : s) {\n 			if (c == '1') {\n 				R[bal]++;\n 				bal++;\n 			} else {\n 				L[bal]++;\n 				bal--;\n 			}\n 		}\n \n 		int cur = 0;\n 		while (L[cur] > 0 || R[cur] > 0) {\n 			if (L[cur] > 0 && R[cur - 1] > 0 || (!R[cur] && !L[cur + 1])) {\n 				L[cur]--;\n 				cur--;\n 				cout << 0;\n 			} else {\n 				R[cur]--;\n 				cur++;\n 				cout << 1;\n 			}\n 		}\n 		cout << '\n';\n 	}\n 	return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int tree[100010 << 2];\n bool flag;\n struct node {\n   int row, col, pos;\n   friend bool operator<(node a, node b) {\n     if (a.row == b.row) return a.col < b.col;\n     return a.row < b.row;\n   }\n };\n node p[100010];\n inline void pushUp(int rt) { tree[rt] = min(tree[rt << 1], tree[rt << 1 | 1]); }\n void update(int x, int y, int val, int L, int R, int rt) {\n   if (flag) return;\n   if (L == R) {\n     if (tree[rt] == 0) {\n       flag = true;\n       tree[rt] = val;\n     }\n     return;\n   } else if (x <= L && R <= y) {\n     int mid = (L + R) >> 1;\n     if (tree[rt << 1] == 0)\n       update(x, y, val, L, mid, rt << 1);\n     else if (tree[rt << 1 | 1] == 0)\n       update(x, y, val, mid + 1, R, rt << 1 | 1);\n   } else {\n     int mid = (L + R) >> 1;\n     if (x <= mid) update(x, y, val, L, mid, rt << 1);\n     if (y > mid) update(x, y, val, mid + 1, R, rt << 1 | 1);\n   }\n   pushUp(rt);\n }\n void out(int L, int R, int rt) {\n   if (L == R) {\n     if (tree[rt]) printf('%d ', tree[rt]);\n   } else {\n     int mid = (L + R) >> 1;\n     out(L, mid, rt << 1);\n     out(mid + 1, R, rt << 1 | 1);\n   }\n }\n int main() {\n   int i;\n   int n, m, cnt;\n   while (~scanf('%d%d', &n, &m)) {\n     memset(tree, 0, sizeof(tree));\n     for (i = 0; i < m; i++) {\n       scanf('%d%d', &p[i].row, &p[i].col);\n       p[i].pos = i + 1;\n     }\n     sort(p, p + m);\n     for (cnt = i = 0; i < m; i++) {\n       flag = false;\n       update(n - p[i].col + 1, p[i].row, p[i].pos, 1, n, 1);\n       if (flag) cnt++;\n     }\n     printf('%d\n', cnt);\n     out(1, n, 1);\n     putchar('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MOD = 1e9 + 7;\n int n, t, sz[200010], cen;\n vector<int> g[200010], v;\n bool mark[200010];\n int dfs(int pos, int par) {\n   sz[pos] = (int)mark[pos];\n   bool ok = true;\n   for (int i = 0; i < g[pos].size(); i++)\n     if (g[pos][i] != par) {\n       sz[pos] += dfs(g[pos][i], pos);\n       if (sz[g[pos][i]] > t) ok = false;\n     }\n   if (ok && sz[pos] >= t) cen = pos;\n   return sz[pos];\n }\n void dfs2(int pos, int par) {\n   if (mark[pos]) v.push_back(pos);\n   for (int i = 0; i < g[pos].size(); i++)\n     if (g[pos][i] != par) dfs2(g[pos][i], pos);\n }\n int main() {\n   cin >> n >> t;\n   int x, y;\n   for (int i = 0; i < n - 1; i++) {\n     scanf('%d%d', &x, &y);\n     g[x].push_back(y);\n     g[y].push_back(x);\n   }\n   for (int i = 0; i < t + t; i++) {\n     scanf('%d', &x);\n     mark[x] = true;\n   }\n   dfs(1, 0);\n   for (int i = 0; i < g[cen].size(); i++) dfs2(g[cen][i], cen);\n   if (mark[cen]) v.push_back(cen);\n   cout << 1 << endl << cen << endl;\n   for (int i = 0; i < t; i++) printf('%d %d %d\n', v[i], v[i + t], cen);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline int countbit(T n) {\n   return (n == 0) ? 0 : (1 + countbit(n & (n - 1)));\n }\n template <class T>\n inline T gcd(T a, T b) {\n   return b ? gcd(b, a % b) : a;\n }\n const double EPS = 1e-9;\n const double PI = acos(-1.0);\n int n, k, h;\n int ind[100005];\n int vel[100005];\n int mass[100005];\n int ret[100005];\n bool can(double mid) {\n   int cnt = 0;\n   double step = k;\n   for (int j = n - 1; j >= 0 && cnt <= k; j--) {\n     double tempo = step * h / ((double)vel[ind[j]]);\n     if (tempo < mid - EPS || fabs(tempo - mid) < EPS) cnt++, step--;\n   }\n   return cnt >= k;\n }\n bool cmp(int i, int j) {\n   if (mass[i] != mass[j]) return mass[i] < mass[j];\n   return vel[i] < vel[j];\n }\n int main(void) {\n   scanf('%d %d %d', &n, &k, &h);\n   for (int i = (0); i < int(n); i++) scanf('%d', &mass[i]);\n   for (int i = (0); i < int(n); i++) scanf('%d', &vel[i]);\n   for (int i = (0); i < int(n); i++) ind[i] = i;\n   sort(ind, ind + n, cmp);\n   double l = 0, r = 10E9 + 100;\n   for (int i = (0); i < int(100); i++) {\n     double mid = (l + r) / 2;\n     if (can(mid))\n       r = mid;\n     else\n       l = mid;\n   }\n   double mid = r, step = k;\n   int p = k - 1;\n   for (int j = n - 1; j >= 0 && p >= 0; j--) {\n     double tempo = step * h / ((double)vel[ind[j]]);\n     if (tempo < mid - EPS || fabs(tempo - mid) < EPS) {\n       step--;\n       ret[p--] = ind[j] + 1;\n     }\n   }\n   for (int i = (0); i < int(k); i++) {\n     if (i) printf(' ');\n     printf('%d', ret[i]);\n   }\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n map<int, int> mym;\n void kaisa() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   cin >> n >> m;\n   queue<int> q;\n   for (int i = 1; i <= n; i++) {\n     int x;\n     cin >> x;\n     mym[x] = 0;\n     q.push(x);\n   }\n   long long res = 0;\n   vector<int> ans;\n   while (!q.empty()) {\n     int x = q.front();\n     q.pop();\n     if (mym[x] != 0) {\n       res += mym[x];\n       ans.push_back(x);\n       if (ans.size() == m) break;\n     }\n     if (!mym.count(x + 1)) {\n       mym[x + 1] = mym[x] + 1;\n       q.push(x + 1);\n     }\n     if (!mym.count(x - 1)) {\n       mym[x - 1] = mym[x] + 1;\n       q.push(x - 1);\n     }\n   }\n   cout << res << '\n';\n   for (int i : ans) {\n     cout << i << ' ';\n   }\n   cout << '\n';\n }\n int main() {\n   kaisa();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long q, x, y;\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> q;\n   while (q--) {\n     cin >> x >> y;\n     if (x - y > 1)\n       cout << 'YES'\n            << '\n';\n     else\n       cout << 'NO'\n            << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t, a, b, x;\n   cin >> t;\n   while (t--) {\n     cin >> a >> b;\n     if (a < b) {\n       x = b - a;\n       x % 2 == 0 ? cout << 2 : cout << 1;\n     } else if (a > b) {\n       x = a - b;\n       x % 2 == 0 ? cout << 1 : cout << 2;\n     } else\n       cout << 0;\n     cout << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd_(int a, int b) {\n   if (b == 0)\n     return a;\n   else\n     return gcd_(b, a % b);\n }\n int main() {\n   int n, i, x;\n   vector<int> v;\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> x;\n     v.push_back(x);\n   }\n   int max1 = v[0];\n   x = v[0];\n   for (i = 1; i < n; i++) {\n     x = gcd_(v[i], x);\n     if (v[i] > max1) max1 = v[i];\n   }\n   int moves = ((max1 / x) - n);\n   if (moves % 2 != 0)\n     cout << 'Alice' << endl;\n   else\n     cout << 'Bob' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n std::vector<int> ReadVector(size_t size) {\n   std::vector<int> vector(size);\n   for (auto& element : vector) {\n     std::cin >> element;\n   }\n   return vector;\n }\n bool is_pal(const std::string& a) {\n   for (size_t i = 0; i < a.size() / 2; ++i) {\n     if (a[i] != a[a.size() - i - 1]) {\n       return false;\n     }\n   }\n   return true;\n }\n class Solver {\n  public:\n   std::vector<std::vector<int>> g;\n   Solver() {}\n   void read() {}\n   void solve() {\n     size_t n;\n     std::cin >> n;\n     g.resize(n);\n     for (size_t i = 0; i < n - 1; ++i) {\n       int a, b;\n       std::cin >> a >> b;\n       a--;\n       b--;\n       g[a].push_back(b);\n       g[b].push_back(a);\n     }\n     int root = -1;\n     int begin = -1;\n     int end = -1;\n     for (int v = 0; v < n; ++v) {\n       if (g[v].size() > 2) {\n         if (root != -1) {\n           std::cout << 'No' << std::endl;\n           return;\n         } else {\n           root = v;\n         }\n       }\n       if (g[v].size() == 1) {\n         if (begin == -1) {\n           begin = v;\n         } else {\n           end = v;\n         }\n       }\n     }\n     std::cout << 'Yes\n';\n     if (root == -1) {\n       std::cout << 1 << std::endl;\n       std::cout << begin + 1 << ' ' << end + 1 << std::endl;\n       return;\n     }\n     std::cout << g[root].size() << std::endl;\n     for (auto ch : g[root]) {\n       std::cout << root + 1 << ' ';\n       int tmp = ch;\n       int parent = root;\n       while (g[tmp].size() == 2) {\n         if (g[tmp][0] == parent) {\n           parent = tmp;\n           tmp = g[tmp][1];\n         } else {\n           parent = tmp;\n           tmp = g[tmp][0];\n         }\n       }\n       std::cout << tmp + 1 << std::endl;\n     }\n   }\n };\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   std::cin.tie(nullptr);\n   Solver solver;\n   solver.solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long INF = 1e9;\n const int maxn = 1e6 + 5;\n int a[maxn];\n int tpr = 0;\n vector<int> adj[maxn];\n void dfs(int root) {\n   if (adj[root].size() > 0) {\n     if (adj[root][0] == (root + 1)) {\n       dfs(root + 1);\n       tpr++;\n     } else\n       return;\n   }\n }\n int main() {\n   int n, m, t, i, j, k;\n   int flag = 0, flag2;\n   int ans = 0;\n   cin >> n >> k;\n   for (int i = 0; i < k; i++) {\n     cin >> m;\n     ans += m - 1;\n     int y;\n     int prev = -1;\n     for (int j = 0; j < m; j++) {\n       cin >> y;\n       if (y == 1) {\n         flag2 = m - 1;\n       }\n       if ((j == 0) && (y == 1)) {\n         flag = 1;\n       }\n       if (prev != -1) adj[prev].push_back(y);\n       prev = y;\n     }\n   }\n   if (flag == 0) {\n     ans += n - 1;\n     cout << ans << endl;\n     return 0;\n   }\n   dfs(1);\n   ans -= tpr;\n   ans += (n - tpr - 1);\n   cout << ans << endl;\n   return 0;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n #pragma GCC target('sse4')\n using namespace std;\n using ii = pair<int, int>;\n using ll = long long;\n const int N = 3000 + 5;\n const int mod = 1e9 + 7;\n string source[N], target[N];\n int n;\n ii ranges[N];\n vector<int> FAIL(string pat) {\n   int m = pat.size();\n   vector<int> F(m + 1);\n   int i = 0, j = -1;\n   F[0] = -1;\n   while (i < m) {\n     while (j >= 0 && pat[i] != pat[j]) j = F[j];\n     i++, j++;\n     F[i] = j;\n   }\n   return F;\n }\n bool check(string a, string b, string s, string t) {\n   vector<int> F = FAIL(s);\n   int i = 0, j = 0;\n   int n = a.size();\n   int m = s.size();\n   while (i < n) {\n     while (j >= 0 && a[i] != s[j]) j = F[j];\n     i++, j++;\n     if (j == m) {\n       int idx = i - j;\n       for (int k = 0; k < m; k++) {\n         a[k + idx] = t[k];\n       }\n       break;\n     }\n   }\n   return a == b;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> source[i];\n   for (int i = 0; i < n; i++) cin >> target[i];\n   string s, t;\n   string prefix, suffix;\n   for (int i = 0; i < n; i++) {\n     if (source[i] != target[i]) {\n       int l = -1, r = -1;\n       for (int j = 0; j < source[i].size(); j++) {\n         if (source[i][j] != target[i][j]) r = j;\n         if (source[i][j] != target[i][j] && l == -1) l = j;\n       }\n       ranges[i] = {l, r};\n       if (s.empty()) {\n         s = source[i].substr(l, r - l + 1);\n         t = target[i].substr(l, r - l + 1);\n         prefix = source[i].substr(0, l);\n         suffix = source[i].substr(r + 1);\n         reverse(prefix.begin(), prefix.end());\n       } else {\n         if (s != source[i].substr(l, r - l + 1) ||\n             t != target[i].substr(l, r - l + 1)) {\n           cout << 'NO\n';\n           return 0;\n         }\n         string cprefix = source[i].substr(0, l);\n         string csuffix = source[i].substr(r + 1);\n         reverse(cprefix.begin(), cprefix.end());\n         string p, ss;\n         for (int j = 0;\n              j < min(cprefix.size(), prefix.size()) && cprefix[j] == prefix[j];\n              j++) {\n           p.push_back(prefix[j]);\n         }\n         for (int j = 0;\n              j < min(csuffix.size(), suffix.size()) && csuffix[j] == suffix[j];\n              j++) {\n           ss.push_back(suffix[j]);\n         }\n         prefix = p;\n         suffix = ss;\n       }\n     }\n   }\n   reverse(prefix.begin(), prefix.end());\n   s = prefix + s + suffix;\n   t = prefix + t + suffix;\n   for (int i = 0; i < n; i++) {\n     if (!check(source[i], target[i], s, t)) {\n       cout << 'NO\n';\n       return 0;\n     }\n   }\n   cout << 'YES\n';\n   cout << s << '\n';\n   cout << t << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline bool inrange(T a, T l, T r) {\n   if (l > r) swap(l, r);\n   return (a >= l and a <= r);\n }\n template <typename T, typename U>\n inline bool exist(T val, U &any) {\n   return (any.find(val) != any.end());\n }\n template <typename T>\n inline void inp(T &any) {\n   cin >> any;\n }\n template <typename T, typename... U>\n inline void inp(T &a, U &...b) {\n   cin >> a;\n   inp(b...);\n }\n template <typename T>\n inline istream &operator>>(istream &in, vector<T> &a) {\n   for (auto &x : a) in >> x;\n   return in;\n }\n template <typename T, typename U>\n inline istream &operator>>(istream &in, pair<T, U> &a) {\n   in >> a.first >> a.second;\n   return in;\n }\n void solve(long long int &T) {\n   long long int n;\n   std::cin >> n;\n   vector<long long int> a(n), b(n);\n   std::cin >> a >> b;\n   vector<long long int> sol(n);\n   for (long long int i = (0); i < (n); i++) sol[a[i] - 1] = b[i];\n   for (auto &X : sol) std::cout << X << ' ';\n   std::cout << '\n';\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   int t = 1;\n   for (long long int i = (1); i < (t + 1); i++) {\n     cerr << 'Case #' << i << '\n';\n     solve(i);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   vector<vector<int>> v;\n   for (int i = 0; i < (n); ++i) {\n     int l;\n     cin >> l;\n     vector<int> temp;\n     for (int j = 0; j < (l); ++j) {\n       int ele;\n       cin >> ele;\n       temp.push_back(ele);\n     }\n     v.push_back(temp);\n   }\n   vector<int> maxi;\n   int cnt_no_ascent = 0;\n   bool ascent[n];\n   int mini_arr[n];\n   int maxi_arr[n];\n   for (int i = 0; i < (n); ++i) ascent[i] = false;\n   for (int i = 0; i < (n); ++i) {\n     int flag = 0;\n     int maxi_el = INT_MIN;\n     int mini_el = INT_MAX;\n     for (int j = 0; j < (v[i].size()); ++j) {\n       if (v[i][j] > maxi_el) {\n         maxi_el = v[i][j];\n       }\n       if (v[i][j] < mini_el) {\n         mini_el = v[i][j];\n       }\n       if (j != 0 && v[i][j - 1] < v[i][j]) {\n         ++cnt_no_ascent;\n         flag = 1;\n         ascent[i] = true;\n         break;\n       }\n     }\n     if (flag == 0) {\n       mini_arr[i] = mini_el;\n       maxi.push_back(maxi_el);\n       maxi_arr[i] = maxi_el;\n     }\n   }\n   long long ans = ((long long)cnt_no_ascent * (long long)n);\n   sort(maxi.begin(), maxi.end());\n   for (int i = 0; i < (n); ++i) {\n     if (ascent[i] == true) continue;\n     auto it = upper_bound(maxi.begin(), maxi.end(), mini_arr[i]);\n     ans = ans + (long long)(maxi.end() - it);\n     ans = ans + cnt_no_ascent;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 1e6 + 6;\n int main() {\n   int n;\n   cin >> n;\n   string str = '';\n   while (n) {\n     str += ((n % 2) + '0');\n     n /= 2;\n   }\n   reverse(str.begin(), str.end());\n   while (str.size() < 6) str = '0' + str;\n   string ss = '';\n   ss += str[0];\n   ss += str[5];\n   ss += str[3];\n   ss += str[2];\n   ss += str[4];\n   ss += str[1];\n   int ret = 0;\n   for (auto x : ss) ret = ret * 2 + (x - '0');\n   cout << ret << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int getint() {\n   unsigned int c;\n   int x = 0;\n   while (((c = getchar()) - '0') >= 10) {\n     if (c == '-') return -getint();\n     if (!~c) exit(0);\n   }\n   do {\n     x = (x << 3) + (x << 1) + (c - '0');\n   } while (((c = getchar()) - '0') < 10);\n   return x;\n }\n int n, nn, sum;\n int as[20];\n int c[10][10];\n bool used[20];\n int num[20], have[20], ns;\n int perm[20][20][20];\n void dfs(int row, int col, int rows, int cols, int dir, int cnt) {\n   int i, j, k;\n   if (cnt == nn) {\n     int tmp1 = 0, tmp2 = 0;\n     for (i = 0; i < n; i++) {\n       tmp1 += c[i][i];\n       tmp2 += c[i][n - 1 - i];\n     }\n     if (tmp1 != sum) return;\n     if (tmp2 != sum) return;\n     tmp1 = tmp2 = 0;\n     for (i = 0; i < n; i++) {\n       tmp1 += c[n - 1][i];\n       tmp2 += c[i][n - 1];\n     }\n     if (tmp1 != sum) return;\n     if (tmp2 != sum) return;\n     for (i = 0; i < n; i++) {\n       for (j = 0; j < n; j++) {\n         if (j) putchar(' ');\n         printf('%d', c[i][j]);\n       }\n       puts('');\n     }\n     exit(0);\n   }\n   if (row == n or col == n) {\n     int tmp = 0;\n     if (dir == 0) {\n       for (i = 0; i < n; i++) tmp += c[row][i];\n       if (tmp != sum) return;\n     } else {\n       for (i = 0; i < n; i++) tmp += c[i][col];\n       if (tmp != sum) return;\n     }\n     if (dir == 0) {\n       dfs(rows + 1, cols, rows + 1, cols, 1, cnt);\n     } else {\n       dfs(rows, cols + 1, rows, cols + 1, 0, cnt);\n     }\n   }\n   for (i = 0; i < ns; i++) {\n     int d = perm[row][col][i];\n     if (have[d]) {\n       have[d]--;\n       c[row][col] = num[d];\n       if (dir == 0) dfs(row, col + 1, rows, cols, dir, cnt + 1);\n       if (dir == 1) dfs(row + 1, col, rows, cols, dir, cnt + 1);\n       have[d]++;\n     }\n   }\n }\n int main() {\n   int i, j, tcc, tc = 1 << 28;\n   for (tcc = 0; tcc < tc; tcc++) {\n     n = getint(), nn = n * n, sum = 0;\n     for (i = 0; i < nn; i++) as[i] = getint(), sum += as[i];\n     sum /= n;\n     for (i = 0; i < nn; i++) num[i] = as[i];\n     sort(num, num + nn);\n     ns = unique(num, num + nn) - num;\n     for (i = 0; i < ns; i++) {\n       for (j = 0; j < nn; j++)\n         if (num[i] == as[j]) have[i]++;\n     }\n     for (i = 0; i < n; i++)\n       for (j = 0; j < n; j++) {\n         for (int k = 0; k < ns; k++) perm[i][j][k] = k;\n         random_shuffle(perm[i][j], perm[i][j] + ns);\n       }\n     printf('%d\n', sum);\n     dfs(0, 0, 0, 0, 0, 0);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MXX = 3e5 + 5;\n int n, m;\n int a[MXX], ans[MXX];\n bool ok(int x) {\n   int mx = m - 1;\n   for (int i = n - 1; i >= 0; i--) {\n     if (a[i] <= mx) {\n       if (a[i] + x >= mx) {\n         ans[i] = mx;\n       } else {\n         ans[i] = a[i] + x;\n       }\n     } else {\n       if (a[i] + x >= mx + m)\n         ans[i] = mx;\n       else\n         ans[i] = (a[i] + x) % m;\n     }\n     mx = ans[i];\n   }\n   for (int i = 0; i < n - 1; i++) {\n     if (ans[i] > ans[i + 1]) {\n       return false;\n     }\n   }\n   return true;\n }\n bool ok2() {\n   for (int i = 0; i < n - 1; i++) {\n     if (a[i] > a[i + 1]) {\n       return false;\n     }\n   }\n   return true;\n }\n int main() {\n   cin >> n >> m;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   if (ok2()) {\n     return cout << 0 << endl, 0;\n   }\n   int lo = 0, hi = m - 1, mid, ans = -1;\n   while (lo <= hi) {\n     mid = (lo + hi) / 2;\n     if (ok(mid)) {\n       ans = mid;\n       hi = mid - 1;\n     } else {\n       lo = mid + 1;\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long gcd(long long a, long long b);\n void print(long long arr[], long long n);\n void printv(vector<long long> arr);\n signed main() {\n   long long t;\n   cin >> t;\n   while (t--) {\n     long long n;\n     cin >> n;\n     long long k;\n     cin >> k;\n     vector<long long> arr(n);\n     unordered_map<long long, long long> m;\n     for (long long i = 0; i < n; i++) {\n       cin >> arr[i];\n       m[arr[i]]++;\n     }\n     vector<long long> tem = arr;\n     sort(tem.begin(), tem.end());\n     set<long long> a, b;\n     if (arr[0] * 2 != k) a.insert(arr[0]);\n     for (long long i = 1; i < n; i++) {\n       if (arr[i] * 2 == k) continue;\n       if (a.find(k - arr[i]) == a.end())\n         a.insert(arr[i]);\n       else\n         b.insert(arr[i]);\n     }\n     long long ii = 0;\n     for (long long i = 0; i < n; i++) {\n       if (a.find(arr[i]) != a.end())\n         cout << 1 << ' ';\n       else if (b.find(arr[i]) != b.end())\n         cout << 0 << ' ';\n       else {\n         cout << ii << ' ';\n         ii = (ii + 1) % 2;\n       }\n     }\n     cout << '\n';\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 void print(long long arr[], long long n) {\n   for (long long i = 0; i < n; i++) cout << arr[i] << ' ';\n   cout << '\n';\n }\n void printv(vector<long long> arr) {\n   for (long long i = 0; i < arr.size(); i++) cout << arr[i] << ' ';\n   cout << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int par[300005];\n int vis[300005];\n unordered_map<int, int> edge[300005];\n int d[300005];\n vector<int> ans;\n int find(int u) { return par[u] == u ? u : par[u] = find(par[u]); }\n void join(int u, int v) {\n   u = find(u);\n   v = find(v);\n   if (u > v) swap(u, v);\n   par[v] = u;\n }\n void dfs(int u, int pr) {\n   if (vis[u]) return;\n   vis[u] = 1;\n   for (auto i : edge[u]) {\n     dfs(i.first, u);\n   }\n   if (d[u] == 1) {\n     ans.push_back(edge[u][pr]);\n     d[pr]++;\n     d[pr] %= 2;\n     return;\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   memset(vis, 0, sizeof vis);\n   int n, k, u, v;\n   cin >> n >> k;\n   for (int i = 1; i <= n; i++) {\n     edge[i].clear();\n     par[i] = i;\n     cin >> d[i];\n   }\n   for (int i = 1; i <= k; i++) {\n     cin >> u >> v;\n     if (find(u) != find(v)) {\n       edge[u][v] = i;\n       edge[v][u] = i;\n       join(u, v);\n     }\n   }\n   int sum = 0;\n   int avail = 0;\n   for (int i = 1; i <= n; i++) {\n     if (d[i] == -1) {\n       avail++;\n     } else\n       sum += d[i];\n   }\n   if (sum % 2 && !avail) {\n     cout << -1 << endl;\n     return 0;\n   }\n   for (int i = 1; i <= n; i++) {\n     if (d[i] == -1) {\n       if (sum % 2 == 1) {\n         d[i] = 1;\n         sum++;\n       } else\n         d[i] = 0;\n     }\n   }\n   dfs(1, 0);\n   cout << ans.size() << endl;\n   for (int i = 0; i < ans.size(); i++) {\n     cout << ans[i] << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MAX = 1e6 + 100;\n const long long mod = 1e9 + 7;\n const long long inf = 1e18 + 12;\n vector<long long> arr(MAX);\n map<long long, long long> mm;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cout.tie(NULL);\n   cout.tie(NULL);\n   ;\n   long long tt = 1;\n   while (tt--) {\n     long long n;\n     cin >> n;\n     long long a[n];\n     for (long long i = 0; i < n; i++) cin >> a[i];\n     long long w = 0, b = 0;\n     long long i = 0;\n     while (i < n) {\n       if (i % 2 == 0) {\n         w += (a[i] + 1) / 2;\n         b += (a[i]) / 2;\n       } else {\n         w += a[i] / 2;\n         b += (a[i] + 1) / 2;\n       }\n       i++;\n     }\n     cout << min(w, b);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MOD = 998244353;\n const int N = 200005;\n const double PI = 4 * atan(1);\n const long long MAX = 9223372036854775807;\n int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};\n int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};\n long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }\n long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }\n bool issquare(long long w) { return trunc(sqrt(w)) * trunc(sqrt(w)) == w; }\n bool isprime(long long u) {\n   for (long long i = 2; i <= (int)sqrt(u); i++) {\n     if (u % i == 0) return 0;\n   }\n   return 1;\n }\n long long mod(long long to_mod, long long MOD) {\n   to_mod %= MOD;\n   while (to_mod < 0) to_mod += MOD;\n   return to_mod % MOD;\n }\n long long moduloMultiplication(long long a, long long b, long long mod) {\n   long long res = 0;\n   a %= mod;\n   while (b) {\n     if (b & 1) res = (res + a) % mod;\n     a = (2 * a) % mod;\n     b >>= 1;\n   }\n   return res;\n }\n long long power(long long x, long long y) {\n   long long res = 1;\n   x = x;\n   while (y > 0) {\n     if (y & 1) res = (res * x);\n     y = y >> 1;\n     x = (x * x);\n   }\n   return res;\n }\n long long n, m, x, y, t, k, z, w, l, r, ans;\n bool vis[N];\n long long a[N];\n long long lvl[N];\n map<long long, vector<long long> > adj;\n map<long long, long long> maa;\n void bfs(long long src) {\n   queue<long long> q;\n   q.push(src);\n   lvl[src] = 1;\n   while (!q.empty()) {\n     long long ras = q.front();\n     q.pop();\n     if (lvl[ras] % 2 == 0) {\n       vis[ras] = 1;\n       continue;\n     }\n     for (auto t : adj[ras]) {\n       if (vis[t]) continue;\n       lvl[t] = lvl[ras] + 1;\n       q.push(t);\n     }\n   }\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(NULL);\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n     maa[a[i]] = i;\n   }\n   for (int j = 0; j < n; j++) {\n     k = a[j];\n     for (int i = j; i < n; i += k) {\n       if (a[i] > k) adj[i].push_back(j);\n     }\n     for (int i = j; i >= 0; i -= k) {\n       if (a[i] > k) adj[i].push_back(j);\n     }\n   }\n   for (int i = n; i >= 1; i--) {\n     if (vis[maa[i]]) continue;\n     bfs(maa[i]);\n   }\n   for (int i = 0; i < n; i++) {\n     if (vis[i])\n       cout << 'A';\n     else\n       cout << 'B';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 7;\n int n, lim, a[N], mn[N], mx[N], suf[N];\n long long ans;\n int main() {\n   scanf('%d%d', &n, &lim);\n   for (int i = 1; i <= lim; i++) mn[i] = n + 1;\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n     mn[a[i]] = min(mn[a[i]], i);\n     mx[a[i]] = max(mx[a[i]], i);\n   }\n   int L = lim, R = 1, pre = mx[1];\n   for (int i = 1; i < lim; i++) {\n     pre = max(pre, mx[i]);\n     if (pre > mn[i + 1]) {\n       L = i;\n       break;\n     }\n   }\n   if (L == lim) {\n     cout << 1ll * lim * (lim + 1) / 2;\n     return 0;\n   }\n   pre = mn[lim];\n   for (int i = lim; i > 1; i--) {\n     pre = min(pre, mn[i]);\n     if (mx[i - 1] > pre) {\n       R = i;\n       break;\n     }\n   }\n   ans = lim - R + 2;\n   suf[lim] = mn[lim];\n   for (int i = lim - 1; i >= R; i--) suf[i] = min(suf[i + 1], mn[i]);\n   pre = mx[1];\n   for (int i = 1, j = R; i <= L; i++) {\n     pre = max(pre, mx[i]);\n     while (j <= lim && pre > suf[j]) j++;\n     ans += lim - j + 2;\n     if (j == i + 1) ans--;\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma warning(disable : 4996)\n using namespace std;\n int n, m;\n int a[300000];\n int b[300000];\n vector<int> edge[300000];\n int ngood;\n int child[300000];\n int good[300000];\n int d[300000];\n int ans;\n void back(int now, int parent) {\n   child[now] = 1;\n   good[now] = b[now];\n   for (auto e : edge[now])\n     if (e != parent) {\n       back(e, now);\n       child[now] += child[e], good[now] += good[e];\n     }\n }\n vector<pair<int, int> > v;\n void back2(int now, int parent) {\n   for (auto e : edge[now])\n     if (e != parent) {\n       back2(e, now);\n     }\n   if (b[now] == 0) {\n     d[now] = 0;\n     return;\n   }\n   d[now] = 1;\n   int xgood = 0;\n   for (auto e : edge[now])\n     if (e != parent) {\n       if (child[e] == good[e]) xgood += child[e];\n     }\n   d[now] = 1 + xgood;\n   for (auto e : edge[now])\n     if (e != parent) {\n       d[now] =\n           max(d[now], 1 + d[e] + xgood - (child[e] == good[e] ? child[e] : 0));\n     }\n   ans = max(ans, d[now]);\n   int u = 1 + (n - child[now] == ngood - good[now] ? n - child[now] : 0);\n   v.clear();\n   for (auto e : edge[now])\n     if (e != parent) {\n       v.emplace_back(d[e], e);\n     }\n   sort((v).begin(), (v).end(), greater<pair<int, int> >());\n   for (int i = 0; i < 8 && i < v.size(); i++) {\n     for (int j = i + 1; j < 8 && j < v.size(); j++) {\n       ans = max(\n           ans, u + v[i].first + v[j].first + xgood -\n                    (child[v[i].second] == good[v[i].second] ? child[v[i].second]\n                                                             : 0) -\n                    (child[v[j].second] == good[v[j].second] ? child[v[j].second]\n                                                             : 0));\n     }\n   }\n }\n int param(int x) {\n   int i, j, k;\n   for (i = 0; i < n; i++) b[i] = a[i] >= x;\n   ngood = count(b, b + n, 1);\n   back(0, -1);\n   ans = 0;\n   back2(0, -1);\n   return ans >= m;\n }\n int main() {\n   int i, j, k;\n   cin >> n >> m;\n   for (i = 0; i < n; i++) scanf('%d', &a[i]);\n   for (i = 0; i < n - 1; i++) {\n     int x, y;\n     scanf('%d%d', &x, &y), x--, y--;\n     edge[x].push_back(y), edge[y].push_back(x);\n   }\n   int low = 0, high = 1000001, mid;\n   while (low <= high) {\n     mid = (low + high) / 2;\n     if (param(mid))\n       low = mid + 1;\n     else\n       high = mid - 1;\n   }\n   cout << high;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 5e4 + 10, max_node = N * 200;\n int n, m, q, C, c[N], a[N], size[N], heavy[N], dfn[N], dfn_t, top[N], father[N],\n     tt, lo[max_node], ro[max_node], addv[max_node];\n long long sum[max_node], sum2[max_node];\n vector<int> graph[N], nodes[N];\n void dfs1(int u) {\n   size[u] = 1;\n   for (auto v : graph[u]) {\n     dfs1(v);\n     size[u] += size[v];\n     if (size[v] > size[heavy[u]]) {\n       heavy[u] = v;\n     }\n   }\n }\n void dfs2(int u, int t) {\n   top[u] = t;\n   dfn[u] = ++dfn_t;\n   if (heavy[u]) {\n     dfs2(heavy[u], t);\n     for (auto v : graph[u]) {\n       if (v != heavy[u]) {\n         dfs2(v, v);\n       }\n     }\n   }\n }\n void add(int l, int r, int o, int v) {\n   addv[o] += v;\n   sum2[o] += ((sum[o] << 1) + (r - l + 1) * v) * v;\n   sum[o] += (r - l + 1) * v;\n }\n void push_down(int l, int r, int o) {\n   if (addv[o]) {\n     int mid = l + r >> 1;\n     if (!lo[o]) {\n       lo[o] = ++tt;\n     }\n     if (!ro[o]) {\n       ro[o] = ++tt;\n     }\n     add(l, mid, lo[o], addv[o]);\n     add(mid + 1, r, ro[o], addv[o]);\n     addv[o] = 0;\n   }\n }\n void push_up(int o) {\n   sum[o] = sum[lo[o]] + sum[ro[o]];\n   sum2[o] = sum2[lo[o]] + sum2[ro[o]];\n }\n void modify(int l, int r, int& o, int ql, int qr, int v) {\n   if (!o) {\n     o = ++tt;\n   }\n   if (ql <= l && r <= qr) {\n     return add(l, r, o, v);\n   } else {\n     int mid = l + r >> 1;\n     push_down(l, r, o);\n     if (ql <= mid) {\n       modify(l, mid, lo[o], ql, qr, v);\n     }\n     if (qr > mid) {\n       modify(mid + 1, r, ro[o], ql, qr, v);\n     }\n     push_up(o);\n   }\n }\n struct info_t {\n   int root;\n   void init(vector<int>& nodes) {\n     for (auto v : nodes) {\n       for (int x = v; x; x = father[top[x]]) {\n         modify(1, n, root, dfn[top[x]], dfn[x], 1);\n       }\n     }\n   }\n   void update(int u, int type) {\n     for (int x = u; x; x = father[top[x]]) {\n       modify(1, n, root, dfn[top[x]], dfn[x], type);\n     }\n   }\n   double get_answer(int c) {\n     double result = (double)C * C;\n     result -= 2.0 * C * c * sum[root] / n;\n     result += 1.0 * c * c * sum2[root] / n;\n     return result;\n   }\n } info[N];\n int main() {\n   scanf('%d%d%d%d', &n, &m, &q, &C);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &a[i]);\n     nodes[a[i]].push_back(i);\n   }\n   for (int i = 2; i <= n; ++i) {\n     scanf('%d', &father[i]);\n     graph[father[i]].push_back(i);\n   }\n   for (int i = 1; i <= m; ++i) {\n     scanf('%d', &c[i]);\n   }\n   dfs1(1);\n   dfs2(1, 1);\n   for (int i = 1; i <= m; ++i) {\n     info[i].init(nodes[i]);\n   }\n   while (q--) {\n     int type, x, w;\n     scanf('%d', &type);\n     if (type == 1) {\n       scanf('%d%d', &x, &w);\n       info[a[x]].update(x, -1);\n       a[x] = w;\n       info[a[x]].update(x, 1);\n     } else {\n       scanf('%d', &x);\n       printf('%.12lf\n', info[x].get_answer(c[x]));\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long long int mod = 1000000007;\n const long long int AM = 2e6 + 5;\n using namespace std;\n long long int powm(long long int a, long long int b, long long int n) {\n   long long int x = 1, y = a;\n   while (b > 0) {\n     if (b % 2 == 1) {\n       x = (x * y) % n;\n     }\n     y = (y * y) % n;\n     b /= 2;\n   }\n   return x % n;\n }\n long long int pow(long long int x, long long int y) {\n   long long int res = 1;\n   while (y > 0) {\n     if (y & 1) res = ((res) * (x));\n     y = y >> 1;\n     x = ((x) * (x));\n   }\n   return res;\n }\n long long int fact(long long int n) {\n   long long int ans = 1;\n   for (long long int i = 1; i <= n; i++) ans *= i;\n   return ans;\n }\n long long int nCr(long long int n, long long int r) {\n   if (r > n - r) r = n - r;\n   long long int ans = 1, i;\n   for (i = 1; i <= r; i++) {\n     ans *= n - r + i;\n     ans /= i;\n   }\n   return ans;\n }\n bool isPrime(long long int n) {\n   if (n <= 1) return false;\n   for (long long int i = 2; i < n; i++)\n     if (n % i == 0) return false;\n   return true;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   ;\n   long long int n;\n   cin >> n;\n   long long int s = sqrt(n), f1, f2;\n   if (s * s >= n) {\n     f1 = s;\n     f2 = s;\n   } else if (s * (s + 1) >= n) {\n     f1 = s;\n     f2 = s + 1;\n   } else {\n     f1 = s + 1;\n     f2 = s + 1;\n   }\n   cout << f1 + f2;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int f[305][305], rf[305][305], g[305][305], rg[305][305];\n int a[305][305];\n int n, m, s, t1, t2, t3;\n int ans1, ans2, ans3, ans4, Min = 1999999999;\n set<pair<int, int> > S;\n int C(int first, int second) {\n   if (first < second) return t2;\n   if (first == second) return t1;\n   return t3;\n }\n int G(int i, int j, int k, int l) {\n   int ans = (f[i][l] - f[i][k]) + (rf[j][l] - rf[j][k]);\n   ans += (g[l][j] - g[l][i]);\n   return ans;\n }\n int main() {\n   scanf('%d %d %d', &n, &m, &s);\n   scanf('%d %d %d', &t1, &t2, &t3);\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) scanf('%d', &a[i][j]);\n   for (int i = 1; i <= n; i++) {\n     f[i][1] = 0;\n     for (int j = 2; j <= m; j++)\n       f[i][j] = f[i][j - 1] + C(a[i][j - 1], a[i][j]);\n     rf[i][1] = 0;\n     for (int j = 2; j <= m; j++)\n       rf[i][j] = rf[i][j - 1] + C(a[i][j], a[i][j - 1]);\n   }\n   for (int i = 1; i <= m; i++) {\n     g[i][1] = 0;\n     for (int j = 2; j <= n; j++)\n       g[i][j] = g[i][j - 1] + C(a[j - 1][i], a[j][i]);\n     rg[i][1] = 0;\n     for (int j = 2; j <= n; j++)\n       rg[i][j] = rg[i][j - 1] + C(a[j][i], a[j - 1][i]);\n   }\n   for (int i = 1; i <= n; i++)\n     for (int j = i + 2; j <= n; j++) {\n       S.clear();\n       for (int k = m; k >= 1; k--) {\n         if (k <= m - 2) S.insert(make_pair(G(i, j, 1, k + 2), k + 2));\n         if (S.empty()) continue;\n         int tmp = s + f[i][k] + rf[j][k] - rg[k][j] + rg[k][i];\n         set<pair<int, int> >::iterator it = S.upper_bound(make_pair(tmp, 0));\n         if (it != S.end()) {\n           pair<int, int> tmpg = *it;\n           if (abs(tmpg.first - tmp) < Min) {\n             Min = abs(tmpg.first - tmp);\n             ans1 = i, ans2 = j, ans3 = k, ans4 = tmpg.second;\n           }\n         }\n         if (it == S.begin()) continue;\n         it--;\n         pair<int, int> tmpg = *it;\n         if (abs(tmpg.first - tmp) < Min) {\n           Min = abs(tmpg.first - tmp);\n           ans1 = i, ans2 = j, ans3 = k, ans4 = tmpg.second;\n         }\n       }\n     }\n   printf('%d %d %d %d\n', ans1, ans3, ans2, ans4);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n template <class T>\n T abs(T x) {\n   return x > 0 ? x : -x;\n }\n const int MAXINT = 1111 * 1111 * 1111;\n const long long MAXLINT = MAXINT * 1ll * MAXINT;\n const long double EPS = 1e-10;\n using namespace std;\n int n, m, x, y, z, p;\n int a, b;\n void reverse_left() {\n   int aa = a, bb = b;\n   a = m - b + 1;\n   b = aa;\n   swap(n, m);\n }\n void reverse_middle() { b = m - b + 1; }\n void reverse_right() {\n   int aa = a, bb = b;\n   b = n - a + 1;\n   a = bb;\n   swap(n, m);\n }\n void solve() {\n   cin >> n >> m >> x >> y >> z >> p;\n   int N = n, M = m;\n   x %= 4;\n   z %= 4;\n   y %= 2;\n   while (p--) {\n     n = N;\n     m = M;\n     cin >> a >> b;\n     for (int i = 0; i < x; i++) reverse_right();\n     for (int i = 0; i < y; i++) reverse_middle();\n     for (int i = 0; i < z; i++) reverse_left();\n     cout << a << ' ' << b << endl;\n   }\n }\n int main() { solve(); }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n set<long long> s;\n map<long long, long long> m;\n vector<long long> v;\n long long n, a[100010], b[100010], dp[100010], mx = 0;\n bool mark[100010];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin >> n;\n   for (long long i = 1; i <= n; i++) {\n     cin >> a[i];\n     if (i == 1)\n       dp[i] = a[i];\n     else\n       dp[i] = dp[i - 1] + a[i];\n   }\n   for (long long i = 1; i <= n; i++) cin >> b[i];\n   for (long long i = n; i > 0; i--) {\n     v.push_back(mx);\n     long long r, l;\n     mark[b[i]] = 1;\n     if (b[i] < n) {\n       if (mark[b[i] + 1] == 1) {\n         set<long long>::iterator it = s.lower_bound(b[i]);\n         r = *it;\n       } else\n         r = b[i];\n     } else\n       r = b[i];\n     s.insert(r);\n     if (b[i] > 1) {\n       if (mark[b[i] - 1] == 1) {\n         s.erase(b[i] - 1);\n       }\n     }\n     m[r] = m[b[i] - 1] + dp[r] - dp[b[i] - 1];\n     if (m[r] > mx) mx = m[r];\n   }\n   for (long long i = v.size() - 1; i >= 0; i--) cout << v[i] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <class T, class V>\n void _print(pair<T, V> p);\n template <class T>\n void _print(vector<T> v);\n template <class T>\n void _print(vector<vector<T>> v);\n template <class T>\n void _print(set<T> v);\n template <class T, class V>\n void _print(map<T, V> v);\n template <class T>\n void _print(multiset<T> v);\n template <class T, class V>\n void _print(pair<T, V> p) {\n   cerr << '{';\n   _print(p.first);\n   cerr << ',';\n   _print(p.second);\n   cerr << '}';\n }\n template <class T>\n void _print(vector<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T>\n void _print(vector<vector<T>> v) {\n   cerr << '==>' << endl;\n   for (vector<T> vec : v) {\n     for (T i : vec) {\n       _print(i);\n       cerr << ' ';\n     }\n     cerr << endl;\n   }\n }\n template <class T>\n void _print(set<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T>\n void _print(multiset<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T, class V>\n void _print(map<T, V> v) {\n   cerr << '[ ';\n   for (auto i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n mt19937_64 rang(\n     chrono::high_resolution_clock::now().time_since_epoch().count());\n int rng(int lim) {\n   uniform_int_distribution<int> uid(0, lim - 1);\n   return uid(rang);\n }\n const int INF = 0x3f3f3f3f;\n const int mod = 1e9 + 7;\n long long mod_exp(long long a, long long b) {\n   a %= mod;\n   if (a == 0) return 0LL;\n   long long res = 1LL;\n   while (b > 0) {\n     if (b & 1) res = (res * a) % mod;\n     a = (a * a) % mod;\n     b >>= 1;\n   }\n   return res;\n }\n long long mod_inv(long long a) { return mod_exp(a, mod - 2); }\n long long GCD(long long a, long long b) { return (b == 0) ? a : GCD(b, a % b); }\n void solve() {\n   long long a1, a2, a3, a4, a5, a6;\n   cin >> a1 >> a2 >> a3 >> a4 >> a5 >> a6;\n   cout << ((a1 + a2 + a3) * (a1 + a2 + a3)) - (a1 * a1) - (a3 * a3) - (a5 * a5);\n }\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);\n   srand(chrono::high_resolution_clock::now().time_since_epoch().count());\n   int t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s[1005];\n char t[1000005];\n int main() {\n   scanf('%s', s);\n   scanf('%s', t);\n   int len1 = strlen(s);\n   int len2 = strlen(t);\n   int le = 0x3f3f3f3f;\n   int ri = 0x3f3f3f3f;\n   for (int i = 0, j = 0; j < len2; j++) {\n     if (s[i] == t[j]) i++;\n     if (i == len1) {\n       le = j;\n       break;\n     }\n   }\n   for (int i = len1 - 1, j = len2 - 1; j >= 0; j--) {\n     if (s[i] == t[j]) i--;\n     if (i == -1) {\n       ri = j;\n       break;\n     }\n   }\n   if ((le - ri) == (len1 - 1))\n     cout << '0' << endl;\n   else {\n     int ans = ri - le;\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int N, K;\n std::string S;\n int main() {\n   std::cin >> N >> K;\n   std::cin >> S;\n   std::string t = S;\n   std::string s = '';\n   for (int l = 1; l < N; ++l) {\n     if (S.substr(0, l) == S.substr(N - l, l)) {\n       t = S.substr(0, N - l);\n       s = S.substr(N - l, l);\n     }\n   }\n   while (K--) std::cout << t;\n   std::cout << s << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve() {\n   int n;\n   cin >> n;\n   vector<int> candies(n);\n   for (int i = 0; i < n; i++) cin >> candies[i];\n   int i = 0, j = n - 1;\n   int store_a = 0, store_b = 0;\n   int turn = 0, sum_a = 0, sum_b = 0;\n   while (i <= j) {\n     if (turn % 2 == 0) {\n       int str_temp = 0;\n       while ((str_temp <= store_b) && (i <= j)) {\n         str_temp += candies[i];\n         i++;\n       }\n       store_a = str_temp;\n       sum_a += store_a;\n     } else {\n       int str_tem = 0;\n       while ((str_tem <= store_a) && (i <= j)) {\n         str_tem += candies[j];\n         j--;\n       }\n       store_b = str_tem;\n       sum_b += store_b;\n     }\n     turn++;\n   }\n   cout << turn << ' ' << sum_a << ' ' << sum_b << '\n';\n }\n int main() {\n   int t;\n   cin >> t;\n   while (t) {\n     solve();\n     t--;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast', 'unroll-loops', 'no-stack-protector')\n using namespace std;\n using ll = long long;\n using ld = double;\n using pii = pair<int, int>;\n using uint = unsigned int;\n using ull = unsigned long long;\n mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\n default_random_engine generator;\n void solve();\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cout << setprecision(16) << fixed;\n   cerr << setprecision(16) << fixed;\n   int tests = 1;\n   for (int test = 1; test <= tests; ++test) {\n     solve();\n   }\n }\n const int INF = 1e9;\n struct Point {\n   int x, y;\n };\n void solve() {\n   int n;\n   cin >> n;\n   vector<Point> p(n);\n   for (int i = 0; i < n; ++i) {\n     string s;\n     cin >> s;\n     int a = 0, b = 0;\n     for (char c : s) {\n       a += c == 'B';\n       b += c == 'N';\n     }\n     p[i] = {a, b};\n   }\n   int minx = INF, maxx = -INF;\n   int miny = INF, maxy = -INF;\n   int l = INF, r = -INF;\n   for (auto [x, y] : p) {\n     minx = min(minx, x);\n     maxx = max(maxx, x);\n     miny = min(miny, y);\n     maxy = max(maxy, y);\n     l = min(l, x - y);\n     r = max(r, x - y);\n   }\n   int res = 0;\n   res = max(res, (maxx - minx + 1) / 2);\n   res = max(res, (maxy - miny + 1) / 2);\n   res = max(res, (minx - miny) - l);\n   res = max(res, r - (minx - miny));\n   Point best = {minx + res, miny + res};\n   for (int op = 0; op < 2; ++op) {\n     int xx = miny + l;\n     int yy = miny;\n     int cur = 0;\n     cur = max(cur, (maxx - xx + 2) / 3);\n     cur = max(cur, (maxy - yy + 1) / 2);\n     cur = max(cur, (r - l + 1) / 2);\n     if (cur < res && cur <= minx - xx) {\n       res = cur;\n       best = {xx + 2 * res, yy + res};\n       if (op) {\n         swap(best.x, best.y);\n       }\n     }\n     for (int i = 0; i < n; ++i) {\n       swap(p[i].x, p[i].y);\n     }\n     swap(minx, miny);\n     swap(maxx, maxy);\n     r *= -1;\n     l *= -1;\n     swap(l, r);\n   }\n   cout << res << endl;\n   string ans;\n   for (int i = 0; i < best.x; ++i) {\n     ans += 'B';\n   }\n   for (int i = 0; i < best.y; ++i) {\n     ans += 'N';\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   string s;\n   cin >> s;\n   long long w = 0, o = 0;\n   for (long long i = 0; i < s.length() - 1; i++) {\n     if (s[i] == 'v' && s[i + 1] == 'v')\n       w++;\n     else {\n       if (s[i] == 'o') o++;\n     }\n   }\n   if (s[s.length() - 1] == 'o') o++;\n   long long x = 0, ans = 0;\n   for (long long i = 0; i < s.length() - 1; i++) {\n     if (s[i] == 'v' && s[i + 1] == 'v')\n       x++;\n     else {\n       if (s[i] == 'o') {\n         ans += x * (w - x);\n       }\n     }\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main(void) {\n   int lins, cols;\n   cin >> lins >> cols;\n   for (int i(0); i < lins; i++) {\n     if (i % 2 == 0) {\n       for (int j(0); j < cols; j++) {\n         cout << '#';\n       }\n       cout << endl;\n     } else if ((i + 1) % 4 == 0) {\n       cout << '#';\n       for (int j(0); j < cols - 1; j++) {\n         cout << '.';\n       }\n       cout << endl;\n     } else {\n       for (int j(0); j < cols - 1; j++) {\n         cout << '.';\n       }\n       cout << '#';\n       cout << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve() {\n   int n;\n   cin >> n;\n   int arr[n];\n   for (int i = 0; i < n; i++) cin >> arr[i];\n   int ans = 0;\n   while (1) {\n     int maxi = 0;\n     for (int i = 0; i < n; i++) {\n       if (arr[i] >= arr[maxi]) maxi = i;\n     }\n     if (maxi == 0) break;\n     ans++;\n     arr[0]++;\n     arr[maxi]--;\n   }\n   cout << ans << '\n';\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int t;\n   t = 1;\n   while (t--) solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, m, l = 0, p = 0, i, flag = 0, k, j, r = 0, q = 0, t, curr = 0, d,\n                   x;\n   cin >> n >> x >> k;\n   long long a[n];\n   for (long long i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   sort(a, a + n);\n   for (long long i = 0; i < n; i++) {\n     long long r1 = a[i] + (x * k);\n     if (a[i] % x == 0) {\n       r1--;\n     }\n     r1 -= r1 % x;\n     long long r2 = r1 + x - 1;\n     r1 = max(a[i], r1);\n     auto it = upper_bound(a, a + n, r2);\n     auto it1 = lower_bound(a, a + n, r1);\n     p += it - it1;\n   }\n   cout << p;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T, typename T1>\n T amax(T &a, T1 b) {\n   if (b > a) a = b;\n   return a;\n }\n template <typename T, typename T1>\n T amin(T &a, T1 b) {\n   if (b < a) a = b;\n   return a;\n }\n bool isPrime(long long x) {\n   if (x == 1) return false;\n   for (long long i = 2; i * i <= x; i++) {\n     if (x % i == 0) {\n       return false;\n     }\n   }\n   return true;\n }\n bool isPowerOfTwo(long long n) {\n   if (n == 0) return false;\n   return (ceil(log2(n)) == floor(log2(n)));\n }\n long long gcdByBit(long long a, long long b) {\n   if (!a || !b) return a | b;\n   unsigned shift = __builtin_ctz(a | b);\n   a >>= __builtin_ctzl(a);\n   do {\n     b >>= __builtin_ctzl(b);\n     if (a > b) {\n       swap(a, b);\n     }\n     b -= a;\n   } while (b);\n   return a << shift;\n }\n long long powerMod(long long n, long long p) {\n   long long res = 1;\n   while (p) {\n     if (p % 2 == 0) {\n       n = n * 1ll * n % 1000000007;\n       p /= 2;\n     } else {\n       res = res * 1ll * n % 1000000007;\n       p--;\n     }\n   }\n   return res;\n }\n long long powerMod2(long long b, long long p, long long m) {\n   if (p == 0) return 1;\n   return (b * powerMod2(b, p - 1, m) % m) % m;\n }\n long long fact(long long n) {\n   long long res = 1;\n   for (long long i = 1; i <= n; i++) {\n     res = res * 1ll * i % 1000000007;\n   }\n   return res;\n }\n long long nCr(long long n, long long r) {\n   return fact(n) * 1ll * powerMod(fact(r), 1000000007 - 2) % 1000000007 * 1ll *\n          powerMod(fact(n - r), 1000000007 - 2) % 1000000007;\n }\n long long arr[300005];\n long long ans[300005];\n long long parent(long long x) {\n   if (arr[x] != x) arr[x] = parent(arr[x]);\n   return arr[x];\n }\n void Chaliye_Shuru_Karte_Hai() {\n   for (long long i = 0; i < 300005; i++) arr[i] = i;\n   long long n, m;\n   cin >> n >> m;\n   for (long long i = 0; i < m; i++) {\n     long long a, b, c;\n     cin >> a >> b >> c;\n     for (long long j = parent(a); j <= b; j = parent(j + 1)) {\n       if (j != c) ans[j] = c, arr[j] = j + 1;\n     }\n   }\n   for (long long i = 1; i < n + 1; i++) cout << ans[i] << ' ';\n }\n signed main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long tc = 1;\n   while (tc--) {\n     Chaliye_Shuru_Karte_Hai();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2005;\n const int M = 101;\n const double EPS = 1e-9;\n const int INF = 1e9;\n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }\n long long lcm(long long a, long long b) { return a * b / gcd(a, b); }\n double getDist(complex<double> a, complex<double> b) {\n   return sqrt((a.real() - b.real()) * (a.real() - b.real()) +\n               (a.imag() - b.imag()) * (a.imag() - b.imag()));\n }\n int dcmp(double x, double y) { return fabs(x - y) <= EPS ? 0 : x < y ? -1 : 1; }\n long long mod = 1000000007, fib[N], dp[N][N];\n long long power(long long base, int p) {\n   if (!p) return 1;\n   long long ret = power(base, p / 2);\n   ret *= ret;\n   ret %= mod;\n   if (p & 1) ret *= base, ret %= mod;\n   return ret;\n }\n long long modInverse(int a) { return power(a, mod - 2); }\n long long ncr(int n, int r) {\n   return (((fib[n] * modInverse(fib[r])) % mod) * modInverse(fib[n - r])) % mod;\n }\n bool emty[N], taken[N];\n long long solve(int n, int k) {\n   if (k == 0) return fib[n];\n   if (k == 1) return (fib[n] * n) % mod;\n   if (dp[n][k] != -1) return dp[n][k];\n   long long ret =\n       (solve(n, k - 1) * n) % mod + (solve(n + 1, k - 2) * (k - 1)) % mod;\n   return dp[n][k] = ret % mod;\n }\n int main() {\n   fib[0] = fib[1] = 1;\n   for (int i = 2; i < N; i++) fib[i] = (fib[i - 1] * i) % mod;\n   int n, free = 0, k = 0;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     int a;\n     scanf('%d', &a);\n     if (a == -1)\n       emty[i] = 1;\n     else\n       taken[a] = 1;\n   }\n   for (int i = 1; i <= n; i++) {\n     if (emty[i] == 1) {\n       if (taken[i] == 1)\n         free++;\n       else\n         k++;\n     }\n   }\n   memset(dp, -1, sizeof(dp));\n   cout << solve(free, k);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, tmp, sum = 1;\n   int map[200000] = {0};\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> tmp;\n     if (map[tmp] == 0) {\n       map[tmp]++;\n     } else\n       sum++;\n   }\n   cout << sum;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long N;\n long long i, j;\n vector<long long> v;\n map<long long, long long> mp;\n long long arr[200];\n int main() {\n   scanf('%lld', &N);\n   for (i = 0; i < N; i++) scanf('%lld', &arr[i]);\n   sort(arr, arr + N);\n   long long ans = 0;\n   for (i = 0; i < N; i++) {\n     long long get = arr[i];\n     if (mp[arr[i]] == 1) {\n       continue;\n     } else {\n       ans++;\n       for (j = 1; j < 200; j++) {\n         mp[get * j] = 1;\n       }\n     }\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxd = 1e6 + 10;\n int a[maxd];\n long long sum, ans = 1e18;\n vector<long long> b;\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]);\n   for (int i = 1; i <= n; i++) sum += a[i];\n   if (sum == 1) {\n     printf('-1\n');\n     return 0;\n   }\n   for (long long i = 2; i * i <= sum; i++) {\n     if (sum % i == 0) {\n       b.push_back(i);\n       sum /= i;\n       i--;\n     }\n   }\n   b.push_back(sum);\n   for (auto x : b) {\n     long long res = 0;\n     sum = 0;\n     for (int i = 1; i <= n; i++) {\n       sum += a[i];\n       sum %= x;\n       res += min(sum, x - sum);\n     }\n     ans = min(res, ans);\n   }\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a;\n vector<int> q;\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     bool w = true;\n     for (int j = 0; j < n; j++) {\n       scanf('%d', &a);\n       if (a == 1 || a == 3) w = false;\n     }\n     if (w) q.push_back(i + 1);\n   }\n   printf('%d\n', q.size());\n   for (int i = 0; i < q.size(); i++) printf('%d ', q[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool can(bool print, int t, long long S, const vector<pair<int, int> >& bugs,\n          const vector<pair<int, pair<int, int> > >& st) {\n   priority_queue<pair<int, int>, vector<pair<int, int> >,\n                  greater<pair<int, int> > >\n       pq;\n   int ind = bugs.size() - 1;\n   int stind = st.size() - 1;\n   vector<int> ans(bugs.size());\n   long long cost = 0;\n   while (ind >= 0) {\n     while (stind >= 0 and st[stind].first >= bugs[ind].first) {\n       pq.push(pair<int, int>(st[stind].second.first, st[stind].second.second));\n       --stind;\n     }\n     if (pq.empty()) return false;\n     long long c = pq.top().first;\n     int indans = pq.top().second;\n     pq.pop();\n     cost += c;\n     if (cost > S) return false;\n     for (int i = 0; ind >= 0 and i < t; ++i) {\n       ans[bugs[ind].second] = indans;\n       --ind;\n     }\n   }\n   if (print) {\n     for (int i = 0; i < int(bugs.size()); ++i) cout << (i ? ' ' : '') << ans[i];\n     cout << endl;\n   }\n   return true;\n }\n int main() {\n   int n, m, s;\n   cin >> n >> m >> s;\n   vector<pair<int, int> > bugs(m);\n   for (int i = 0; i < m; ++i) {\n     cin >> bugs[i].first;\n     bugs[i].second = i;\n   }\n   vector<pair<int, pair<int, int> > > st(n);\n   for (int i = 0; i < n; ++i) cin >> st[i].first;\n   for (int i = 0; i < n; ++i) {\n     cin >> st[i].second.first;\n     st[i].second.second = i + 1;\n   }\n   sort(bugs.begin(), bugs.end());\n   sort(st.begin(), st.end());\n   int low = 1, hi = m + 1;\n   while (low < hi) {\n     int mid = (low + hi) / 2;\n     if (can(false, mid, s, bugs, st))\n       hi = mid;\n     else\n       low = mid + 1;\n   }\n   if (low == m + 1)\n     cout << 'NO' << endl;\n   else {\n     cout << 'YES' << endl;\n     can(true, low, s, bugs, st);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 1e6 + 10;\n int n, m, q, pos[MAX], bit[MAX], res[MAX], XOR[MAX];\n pair<int, int> cache[MAX], a[MAX], b[MAX];\n struct Node {\n   int lef, rig, tt;\n   bool operator<(const Node& other) const { return this->lef < other.lef; }\n };\n Node query[MAX];\n void up(int i) {\n   int val = a[i].first;\n   while (i <= n) {\n     bit[i] ^= val;\n     i += i & (-i);\n   }\n }\n int get(int i) {\n   int res = 0;\n   while (i) {\n     res ^= bit[i];\n     i -= i & (-i);\n   }\n   return res;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &cache[i].first);\n     a[i].first = cache[i].first;\n     cache[i].second = i;\n   }\n   sort(cache + 1, cache + 1 + n);\n   for (int i = 1; i <= n; ++i) {\n     if (i == 1 || cache[i].first > cache[i - 1].first) ++m;\n     a[cache[i].second].second = m;\n   }\n   for (int i = 1; i <= n; ++i) {\n     b[i] = pair<int, int>(pos[a[i].second], i);\n     pos[a[i].second] = i;\n     XOR[i] = XOR[i - 1] ^ a[i].first;\n   }\n   sort(b + 1, b + 1 + n);\n   scanf('%d', &q);\n   for (int i = 1; i <= q; ++i) {\n     scanf('%d %d', &query[i], &query[i].rig);\n     query[i].tt = i;\n   }\n   sort(query + 1, query + 1 + q);\n   int j = 1;\n   for (int i = 1; i <= q; ++i) {\n     while (j <= n && b[j].first < query[i].lef) up(b[j++].second);\n     res[query[i].tt] = XOR[query[i].rig] ^ XOR[query[i].lef - 1];\n     res[query[i].tt] ^= get(query[i].rig) ^ get(query[i].lef - 1);\n   }\n   for (int i = 1; i <= q; ++i) printf('%d\n', res[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, a[100], b[100], i, c = 0;\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> a[i] >> b[i];\n     if ((b[i] - a[i]) >= 2) c++;\n   }\n   cout << c;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, a = 0, l[101], r[101], k;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> l[i] >> r[i];\n   }\n   cin >> k;\n   for (int i = 0; i < n; i++) {\n     if (k <= r[i]) {\n       a++;\n     }\n   }\n   cout << a;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main(void) {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     vector<int> ans1, ans2;\n     string a, b;\n     cin >> a >> b;\n     a = a + '0';\n     b = b + '0';\n     for (int i = 0; i < n; i++) {\n       if (a[i] != a[i + 1]) ans1.push_back(i);\n     }\n     for (int i = 0; i < n; i++) {\n       if (b[i] != b[i + 1]) ans2.push_back(i);\n     }\n     cout << ans1.size() + ans2.size() << ' ';\n     for (int i = 0; i < ans1.size(); i++) cout << ans1[i] + 1 << ' ';\n     for (int i = ans2.size() - 1; i >= 0; i--) cout << ans2[i] + 1 << ' ';\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long p, x, a, b, ni, ans;\n void e_gcd(long long a, long long b, long long &x, long long &y) {\n   if (b == 0) {\n     x = 1;\n     y = 0;\n     return;\n   }\n   e_gcd(b, a % b, x, y);\n   int tmp = x;\n   x = y;\n   y = tmp - (a / b) * y;\n   return;\n }\n int main() {\n   cin >> a >> b >> p >> x;\n   long long i, j, s;\n   e_gcd(a, p, ni, s);\n   a = 1;\n   for (j = 1; j <= p - 1; j++) {\n     a = a * ni % p;\n     i = (j - b * a % p + p) % p;\n     long long n = i * (p - 1) + j;\n     if (n <= x) ans += (x - n) / (p * (p - 1)) + 1;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   scanf('%d', &n);\n   int *a = new int[n];\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &a[i]);\n   }\n   int m;\n   scanf('%d', &m);\n   int bred[10000];\n   for (int i = 0; i < 10000; i++) bred[i] = 0;\n   for (int i = 0; i < m; i++) {\n     int b;\n     scanf('%d', &b);\n     for (int j = 0; j < n; j++) {\n       if (b % a[j] != 0) continue;\n       bred[b / a[j]]++;\n     }\n   }\n   for (int i = 9999; i >= 0; i--) {\n     if (bred[i] != 0) {\n       printf('%d', bred[i]);\n       break;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n inline int rd(int f = 1, int x = 0, char ch = ' ') {\n   while (!isdigit(ch = getchar()))\n     if (ch == '-') f = -1;\n   while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();\n   return f * x;\n }\n const int N = 1e5 + 5;\n int n, a[N], ans;\n int main() {\n   for (int T = rd(); T--;) {\n     n = rd(), ans = 0;\n     for (int i = 1; i <= n; ++i) a[i] = rd();\n     for (int i = 2; i <= n; ++i) ans |= a[i - 1] <= a[i];\n     puts(ans ? 'YES' : 'NO');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, k, q, a[200005], f[200005];\n int main() {\n   cin >> n >> k >> q;\n   for (int i = 1; i <= n; i++) {\n     long long l, r;\n     cin >> l >> r;\n     a[l]++;\n     a[r + 1]--;\n   }\n   for (int i = 1; i <= 200000; i++) a[i] += a[i - 1];\n   for (int i = 1; i <= 200000; i++) {\n     f[i] += f[i - 1];\n     if (a[i] >= k) {\n       f[i]++;\n     }\n   }\n   for (int i = 1; i <= q; i++) {\n     long long l, r;\n     cin >> l >> r;\n     cout << f[r] - f[l - 1] << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n constexpr int INF = 2e9;\n int main() {\n   int t;\n   t = 1;\n   while (t--) {\n     int n;\n     string s;\n     cin >> n;\n     cin >> s;\n     int res = 0;\n     for (int d = 25; d >= 0; d--) {\n       string tmp = '';\n       for (int i = 0; i < s.size(); i++) {\n         int now = s[i] - 'a';\n         if (now != d) {\n           tmp += s[i];\n         } else {\n           if (tmp.back() - 'a' == d - 1) {\n             res++;\n           } else {\n             tmp += s[i];\n           }\n         }\n       }\n       swap(s, tmp);\n       tmp = '';\n       for (int i = s.size() - 1; i >= 0; i--) {\n         int now = s[i] - 'a';\n         if (now != d) {\n           tmp += s[i];\n         } else {\n           if (tmp.back() - 'a' == d - 1) {\n             res++;\n           } else {\n             tmp += s[i];\n           }\n         }\n       }\n       reverse(tmp.begin(), tmp.end());\n       swap(s, tmp);\n     }\n     cout << res << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n const int MAXN = 2e5 + 5;\n int n, k, d, ansL = 1, ansR = 1, top1, top2;\n int a[MAXN], st1[MAXN], st2[MAXN];\n map<int, int> lst;\n namespace SegmentTree {\n struct Tree {\n   int l, r;\n   int w, tag;\n } tree[MAXN << 2];\n void update(int k) { tree[k].w = min(tree[k << 1].w, tree[k << 1 | 1].w); }\n void apply(int k, int val) {\n   tree[k].w += val;\n   tree[k].tag += val;\n }\n void down(int k) {\n   if (tree[k].tag != 0) {\n     apply(k << 1, tree[k].tag);\n     apply(k << 1 | 1, tree[k].tag);\n     tree[k].tag = 0;\n   }\n }\n void Build(int k, int l, int r) {\n   tree[k].l = l;\n   tree[k].r = r;\n   if (l == r) {\n     tree[k].w = l;\n     return;\n   }\n   int mid = (l + r) >> 1;\n   Build(k << 1, l, mid);\n   Build(k << 1 | 1, mid + 1, r);\n   update(k);\n }\n void Modify(int k, int l, int r, int val) {\n   if (tree[k].l >= l && tree[k].r <= r) {\n     apply(k, val);\n     return;\n   }\n   down(k);\n   int mid = (tree[k].l + tree[k].r) >> 1;\n   if (l <= mid) Modify(k << 1, l, r, val);\n   if (r > mid) Modify(k << 1 | 1, l, r, val);\n   update(k);\n }\n void Delete(int k, int x) {\n   if (tree[k].l == tree[k].r) {\n     tree[k].w = INF;\n     return;\n   }\n   down(k);\n   int mid = (tree[k].l + tree[k].r) >> 1;\n   if (x <= mid)\n     Delete(k << 1, x);\n   else\n     Delete(k << 1 | 1, x);\n   update(k);\n }\n int Query(int k, int l, int r, int x) {\n   if (tree[k].w > x) return INF;\n   if (tree[k].l == tree[k].r) return tree[k].l;\n   if (tree[k].l >= l && tree[k].r <= r) {\n     down(k);\n     if (tree[k << 1].w <= x)\n       return Query(k << 1, l, r, x);\n     else\n       return Query(k << 1 | 1, l, r, x);\n   } else {\n     down(k);\n     int mid = (tree[k].l + tree[k].r) >> 1;\n     int res;\n     if (l <= mid) {\n       res = Query(k << 1, l, r, x);\n       if (res != INF) return res;\n     }\n     if (r > mid) {\n       res = Query(k << 1 | 1, l, r, x);\n       if (res != INF) return res;\n     }\n     return -1;\n   }\n }\n }  // namespace SegmentTree\n int main() {\n   scanf('%d%d%d', &n, &k, &d);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n     a[i] += INF;\n   }\n   if (d == 0) {\n     for (int i = 1; i <= n; i++) {\n       int l = i;\n       while (a[i] == a[i + 1] && i < n) i += 1;\n       if (i - l + 1 > ansR - ansL + 1) {\n         ansL = l;\n         ansR = i;\n       }\n     }\n     printf('%d %d\n', ansL, ansR);\n     return 0;\n   }\n   SegmentTree::Build(1, 1, n);\n   int L = 1;\n   for (int R = 1; R <= n; R++) {\n     int tmp = L;\n     if (a[R] % d == a[R - 1] % d)\n       L = max(lst[a[R]] + 1, L);\n     else\n       L = R;\n     lst[a[R]] = R;\n     while (tmp < L) {\n       SegmentTree::Delete(1, tmp);\n       tmp += 1;\n     }\n     while (top1 && st1[top1] >= L && a[st1[top1]] >= a[R]) {\n       SegmentTree::Modify(1, max(L, st1[top1 - 1] + 1), st1[top1],\n                           a[st1[top1]] / d);\n       top1 -= 1;\n     }\n     SegmentTree::Modify(1, max(L, st1[top1] + 1), R, -a[R] / d);\n     st1[++top1] = R;\n     while (top2 && st2[top2] >= L && a[st2[top2]] <= a[R]) {\n       SegmentTree::Modify(1, max(L, st2[top2 - 1] + 1), st2[top2],\n                           -a[st2[top2]] / d);\n       top2 -= 1;\n     }\n     SegmentTree::Modify(1, max(L, st2[top2] + 1), R, a[R] / d);\n     st2[++top2] = R;\n     int pos = SegmentTree::Query(1, L, R, k + R);\n     if (R - pos + 1 > ansR - ansL + 1) {\n       ansL = pos;\n       ansR = R;\n     }\n   }\n   printf('%d %d\n', ansL, ansR);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long add(long long a, long long b, long long mod) {\n   return (a % mod + b % mod) % mod;\n }\n long long sub(long long a, long long b, long long mod) {\n   return (a % mod - b % mod + mod) % mod;\n }\n long long mul(long long a, long long b, long long mod) {\n   return (a % mod * b % mod) % mod;\n }\n long long sumodd(long long num, long long mod) { return mul(num, num, mod); }\n long long sumeven(long long num, long long mod) {\n   return mul(num, num + 1, mod);\n }\n long long sumrange(long long st, long long en, long long num) {\n   return (num * (st + en) / 2);\n }\n long long gcd(long long a, long long b) {\n   while (b != 0) {\n     long long a2 = a;\n     a = b;\n     b = a2 % b;\n   }\n   return a;\n }\n long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }\n string makeitbinary(long long n) {\n   string s;\n   while (n) {\n     s = s + (char)((n % 2) + '0');\n     n /= 2;\n   }\n   reverse(s.begin(), s.end());\n   return s;\n }\n bool bit(int num, int i) { return ((num >> i) & 1); }\n long long fastpowermod(long long b, long long p, long long mod) {\n   long long ans = 1;\n   while (p) {\n     if (p % 2) {\n       ans = mul(ans, b, mod);\n     }\n     b = mul(b, b, mod);\n     p /= 2;\n   }\n   return ans;\n }\n long long fastpower(long long b, long long p) {\n   long long ans = 1;\n   while (p) {\n     if (p % 2) {\n       ans = ans * b;\n     }\n     b = b * b;\n     p /= 2;\n   }\n   return ans;\n }\n double fastpower_double(double b, long long p) {\n   double ans = 1;\n   while (p) {\n     if (p % 2) {\n       ans = ans * b;\n     }\n     b = b * b;\n     p /= 2;\n   }\n   return ans;\n }\n long long summation_formula(long long n) { return (n * (n + 1) / 2); }\n bool lower_vowel(char c) {\n   return (c == 'i' || c == 'o' || c == 'u' || c == 'a' || c == 'e');\n }\n string bigint_mini(string s1, string s2) {\n   if (s1.size() > s2.size()) {\n     return s2;\n   } else if (s2.size() > s1.size()) {\n     return s1;\n   }\n   for (int i = 0; i < s1.size(); i++) {\n     if ((s1[i] - '0') > (s2[i] - '0')) {\n       return s2;\n     } else if ((s2[i] - '0') > (s1[i] - '0')) {\n       return s1;\n     }\n   }\n   return s1;\n }\n double polygon_area(int n, vector<double> X, vector<double> Y) {\n   double area = 0.0;\n   int j = n - 1;\n   for (int i = 0; i < n; i++) {\n     area += (X[j] + X[i]) * (Y[j] - Y[i]);\n     j = i;\n   }\n   return abs(area / 2.0);\n }\n long long sum_of_digits(string s) {\n   long long sum = 0;\n   for (int i = 0; i < s.size(); i++) {\n     sum += s[i] - '0';\n   }\n   return sum;\n }\n string makeitbase(long long num, long long base) {\n   string s;\n   while (num) {\n     long long mod = num % base;\n     s += (mod + '0');\n     num /= base;\n   }\n   reverse(s.begin(), s.end());\n   return s;\n }\n bool intersect(long long l1, long long r1, long long l2, long long r2) {\n   return (max(l1, l2) <= min(r1, r2));\n }\n pair<long long, long long> find_intersection(long long l1, long long r1,\n                                              long long l2, long long r2) {\n   return {max(l1, l2), min(r1, r2)};\n }\n long long sum_ranges(long long l, long long r) {\n   return summation_formula(r) - summation_formula(l);\n }\n double power_2(double num) { return num * num; }\n struct point {\n   int x, y;\n };\n long long dist(point p1, point p2) {\n   return (p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y);\n }\n bool square(point p1, point p2, point p3, point p4) {\n   long long d2 = dist(p1, p2);\n   long long d3 = dist(p1, p3);\n   long long d4 = dist(p1, p4);\n   if (d2 == d3 && 2 * d2 == d4 && 2 * dist(p2, p4) == dist(p2, p3)) {\n     return true;\n   }\n   if (d3 == d4 && 2 * d3 == d2 && 2 * dist(p3, p2) == dist(p3, p4)) {\n     return true;\n   }\n   if (d2 == d4 && 2 * d2 == d3 && 2 * dist(p2, p3) == dist(p2, p4)) {\n     return true;\n   }\n   return false;\n }\n const int sz = 1e6 + 1;\n long long M = 1e9 + 7;\n int main() {\n   ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n   int n, k, m, t;\n   cin >> n >> k >> m >> t;\n   while (t--) {\n     int x, y;\n     cin >> x >> y;\n     if (x == 1) {\n       if (y <= k) {\n         k++;\n       }\n       n++;\n     } else {\n       if (k >= 1 && k <= y) {\n         n -= (n - y);\n       } else {\n         n -= y;\n         k -= y;\n       }\n     }\n     cout << n << ' ' << k << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int f = n * 1.0 / 3 + 0.5;\n   cout << f / 12 << ' ' << f % 12 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MAX1 = 3e5 + 10;\n long long a, b, c, d, e, cnt, x, y, z, l, r, flag, num[MAX1], mod = 1e10 + 7;\n string s;\n char p[MAX1];\n long long sta(long long n) {\n   for (int i = 1; i < 1000000; ++i) {\n     if (i * (i - 1) / 2 == n) return i;\n   }\n   return 0;\n }\n int main() {\n   cin >> a >> b >> c >> d;\n   x = sta(a);\n   y = sta(d);\n   if (a == 0) {\n     if (b == 0 && c == 0 && x && y) {\n       for (int i = 0; i < y; ++i) cout << 1;\n       return 0;\n     } else\n       x = 1;\n   }\n   if (d == 0) {\n     if (b == 0 && c == 0 && x && y) {\n       for (int i = 0; i < x; ++i) cout << 0;\n       return 0;\n     } else\n       y = 1;\n   }\n   if (x == 0 || y == 0) {\n     cout << 'Impossible';\n     return 0;\n   }\n   if (x * y != b + c) {\n     cout << 'Impossible';\n     return 0;\n   }\n   cnt = b / y;\n   b -= cnt * y;\n   x -= cnt;\n   for (long long i = 0; i < cnt; ++i) cout << 0;\n   for (long long i = 0; i < y - b; ++i) cout << 1;\n   y -= y - b;\n   if (x && b) cout << 0, --x;\n   for (long long i = 0; i < y; ++i) cout << 1;\n   for (long long i = 0; i < x; ++i) cout << 0;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long bigpow(long long x, long long n) {\n   if (n == 0) return 1;\n   long long temp = bigpow(x, n / 2);\n   return n % 2 == 0 ? (temp * temp) % 1000000009\n                     : (x * ((temp * temp) % 1000000009)) % 1000000009;\n }\n int main() {\n   long long n, m, k, x, t, p, q, gaps, groups;\n   cin >> n >> m >> k;\n   gaps = n - m;\n   groups = m % (k - 1) == 0 ? m / (k - 1) : m / (k - 1) + 1;\n   if (gaps >= groups - 1)\n     cout << m << endl;\n   else {\n     x = n - gaps * k;\n     t = 2 * (bigpow(2, x / k) - 1) * k + x % k;\n     t += gaps * (k - 1);\n     cout << t % 1000000009 << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long read() {\n   long long x = 0, f = 1;\n   char s = getchar();\n   while (s < '0' || s > '9') {\n     if (s == '-') f *= -1;\n     s = getchar();\n   }\n   while (s >= '0' && s <= '9') {\n     x = (x << 1) + (x << 3) + s - '0';\n     s = getchar();\n   }\n   return x * f;\n }\n int n = read(), w[5], dp[1005][630], s[15],\n     c[15] = {0, 125, 25, 5, 1, 300, 60, 12, 465, 93, 624};\n bool p[6][1005];\n int main() {\n   for (int i = 1; i < 5; i++) w[i] = read();\n   char ss = getchar();\n   for (int i = 1; i < 5; i++)\n     for (int j = 1; j <= n; j++) {\n       while (ss != '.' && ss != '*') ss = getchar();\n       p[i][j] = (ss == '*');\n       ss = getchar();\n     }\n   memset(dp, 0x3f3f3f3f, sizeof(dp));\n   dp[1][0] = 0;\n   int b[5] = {0, 125, 25, 5, 1};\n   for (int i = 1; i < 11; i++) {\n     if (i < 5)\n       s[i] = w[1];\n     else if (i > 4 && i < 8)\n       s[i] = w[2];\n     else if (i > 7 && i < 10)\n       s[i] = w[3];\n     else\n       s[i] = w[4];\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = 0; j < 625; j++) {\n       int a[5] = {0, j / 125, j / 25 % 5, j / 5 % 5, j % 5};\n       if (max(max(a[1], a[2]), max(a[3], a[4])) > n - i + 1) continue;\n       for (int o = 1; o < 5; o++)\n         if (a[o] > 0 && !p[o][i + a[o] - 1])\n           dp[i][j] = min(dp[i][j], dp[i][j - b[o]]);\n       if (min(min(a[1], a[2]), min(a[3], a[4])) > 0)\n         dp[i + 1][j - 156] = min(dp[i + 1][j - 156], dp[i][j]);\n       for (int k = 1; k < 11; k++) {\n         int b[5] = {0, c[k] / 125, c[k] / 25 % 5, c[k] / 5 % 5, c[k] % 5},\n             l = 0;\n         for (int o = 1; o < 5; o++) l = l * 5 + max(a[o], b[o]);\n         dp[i][l] = min(dp[i][l], dp[i][j] + s[k]);\n       }\n     }\n   }\n   printf('%d\n', dp[n + 1][0]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 1e9;\n const int MOD = 1e9 + 7;\n const int N = 0;\n int a[5], m;\n long long sum(int len, int x) {\n   return 1LL * len * x - 1LL * (x + 1) * x / 2 + x;\n }\n long long cal(int x, int y, int bar, int len) {\n   if (len < 0) return 0;\n   int R = min(bar - y, len), L = min(len - (bar - x), R);\n   long long ans = 0;\n   if (L >= 0)\n     ans += 1LL * (L + 1) * (bar - x + 1);\n   else\n     L = -1;\n   ans += sum(len, R) - sum(len, L);\n   return ans;\n }\n long long solve(int x, int y, int z, int len) {\n   int tmp = max(max(y, z) + 1, x);\n   len -= tmp - x;\n   x = tmp;\n   long long ans = 0;\n   for (auto i = 0; i <= len; i++) {\n     int cur = x + i, rem = min(2 * (cur - 1) - y - z, len - i);\n     if (rem > cur - y - z)\n       ans += cal(y, z, cur - 1, rem) - cal(y, z, cur - 1, (cur - y - z));\n   }\n   return ans;\n }\n long long solve2(int x, int y, int z, int len) {\n   int tmp = max(x, y);\n   len -= 2 * tmp - x - y;\n   x = tmp;\n   if (x <= z) len -= 2 * (z + 1 - x), x = z + 1;\n   long long ans = 0;\n   if (len >= 0)\n     for (auto i = 0; i <= len / 2; i++) {\n       int rem = len - 2 * i;\n       ans += min(x + i - 1 - z, rem) + 1;\n     }\n   return ans;\n }\n int main() {\n   for (auto i = 0; i <= 2; i++) cin >> a[i];\n   cin >> m;\n   long long ans = 0;\n   for (auto i = 0; i <= 2; i++)\n     ans += solve(a[i], a[(i + 1) % 3], a[(i + 2) % 3], m);\n   for (auto i = 0; i <= 2; i++)\n     ans += solve2(a[i], a[(i + 1) % 3], a[(i + 2) % 3], m);\n   int tmp = *max_element(a, a + 3), v = 0;\n   for (auto i = 0; i <= 2; i++) v += tmp - a[i];\n   if (v <= m) ans += (m - v) / 3 + 1;\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, k;\n   cin >> n >> k;\n   int a[k];\n   for (int i = 0; i < k; i++) cin >> a[i];\n   list<int> leader;\n   for (int i = 1; i <= n; i++) leader.insert(leader.end(), i);\n   int l = 1;\n   int i = 0;\n   int begin = 0;\n   while (k--) {\n     l = (leader.size() + a[i] + begin) % leader.size();\n     list<int>::iterator pnlist = leader.begin();\n     advance(pnlist, l);\n     if (k == 0)\n       cout << *pnlist << endl;\n     else\n       cout << *pnlist << ' ';\n     leader.erase(pnlist);\n     begin = l;\n     i++;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long gcd(long long a, long long b) {\n   while (b) {\n     a %= b;\n     swap(a, b);\n   }\n   return a;\n }\n int main() {\n   int n;\n   cin >> n;\n   vector<int> q(n);\n   for (int i = 0; i < n; ++i) cin >> q[i];\n   vector<int> cost(n, -1);\n   int m;\n   cin >> m;\n   for (int i = 0; i < m; ++i) {\n     int a, b, c;\n     cin >> a >> b >> c;\n     if (cost[b - 1] == -1 || cost[b - 1] > c) {\n       cost[b - 1] = c;\n     }\n   }\n   int ans = 0, head = 0;\n   for (int i = 0; i < n; ++i) {\n     if (cost[i] != -1)\n       ans += cost[i];\n     else\n       head++;\n   }\n   if (head > 1)\n     cout << -1 << endl;\n   else {\n     if (!head) {\n       int maxx = cost[0];\n       for (int i = 1; i < n; ++i) maxx = max(maxx, cost[i]);\n       ans -= maxx;\n     }\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n vector<int> g[200002];\n vector<pair<int, pair<int, int> > > first[200002];\n int lvl[200002];\n int p[20][200002];\n int h[20][200002];\n int d[200002][2];\n inline int lca(int v1, int v2) {\n   if (lvl[v1] < lvl[v2]) swap(v1, v2);\n   for (int i = 20 - 1; i >= 0; --i) {\n     if (lvl[p[i][v1]] >= lvl[v2]) {\n       v1 = p[i][v1];\n     }\n   }\n   if (v1 == v2) return v1;\n   for (int i = 20 - 1; i >= 0; --i) {\n     if (p[i][v1] != p[i][v2]) {\n       v1 = p[i][v1];\n       v2 = p[i][v2];\n     }\n   }\n   return p[0][v1];\n }\n void dfs(int v = 0, int level = 0, int pr = 0) {\n   lvl[v] = level;\n   p[0][v] = pr;\n   for (int i = 1; i < 20; ++i) p[i][v] = p[i - 1][p[i - 1][v]];\n   for (const int& v2 : g[v]) {\n     dfs(v2, level + 1, v);\n   }\n }\n inline int getit(int v, int k) {\n   if (h[k][v] != -1) return h[k][v];\n   return h[k][v] = getit(p[k - 1][v], k - 1) + getit(v, k - 1);\n }\n inline int get(int v, int k) {\n   if (k < 0) return 0;\n   int res = 0;\n   for (int i = 20 - 1; i >= 0; --i) {\n     if ((k & (1 << i)) > 0) {\n       res += getit(v, i);\n       k ^= (1 << i);\n       v = p[i][v];\n     }\n   }\n   return res;\n }\n void go(int v = 0) {\n   for (const int& v2 : g[v]) {\n     go(v2);\n     d[v][0] += max(d[v2][0], d[v2][1]);\n   }\n   for (const int& v2 : g[v]) {\n     h[0][v2] = d[v][0] - max(d[v2][0], d[v2][1]);\n   }\n   for (const auto& t : first[v]) {\n     int cost = t.first;\n     int v1 = t.second.first;\n     int v2 = t.second.second;\n     int w = -d[v][0] + get(v1, lvl[v1] - lvl[v]) + get(v2, lvl[v2] - lvl[v]) +\n             d[v1][0] + d[v2][0] + cost;\n     d[v][1] = max(d[v][1], w);\n   }\n }\n int main() {\n   memset(h, -1, sizeof(h));\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < n - 1; ++i) {\n     int t;\n     scanf('%d', &t);\n     --t;\n     g[t].push_back(i + 1);\n   }\n   dfs();\n   for (int i = 0; i < m; ++i) {\n     int v1, v2, cost;\n     scanf('%d%d%d', &v1, &v2, &cost);\n     --v1, --v2;\n     int lcav = lca(v1, v2);\n     first[lcav].push_back(make_pair(cost, make_pair(v1, v2)));\n   }\n   go();\n   printf('%d\n', max(d[0][0], d[0][1]));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int t[2000002];\n int longestPrefix(string &s) {\n   t[0] = 0;\n   for (int pos = 1; pos < s.length(); ++pos) {\n     int prev = t[pos - 1];\n     while (prev > 0 && s[pos] != s[prev]) {\n       prev = t[prev - 1];\n     }\n     if (s[pos] == s[prev]) {\n       t[pos] = prev + 1;\n     } else {\n       t[pos] = prev;\n     }\n   }\n   return t[s.length() - 1];\n }\n int main() {\n   int t;\n   cin >> t;\n   while (t-- > 0) {\n     string s;\n     cin >> s;\n     int lindex = 0, rindex = s.length();\n     while (lindex < rindex && s[lindex] == s[rindex - 1]) {\n       ++lindex;\n       --rindex;\n     }\n     if (lindex >= rindex) {\n       cout << s << endl;\n       continue;\n     }\n     string mid = s.substr(lindex, rindex - lindex);\n     string rmid = mid;\n     reverse(rmid.begin(), rmid.end());\n     string pre = mid + '*' + rmid;\n     string suf = rmid + '*' + mid;\n     int pref = longestPrefix(pre);\n     int suff = longestPrefix(suf);\n     int len = max(pref, suff);\n     for (int i = 0; i < lindex; ++i) {\n       cout << s[i];\n     }\n     if (pref >= suff) {\n       for (int i = lindex; i < lindex + pref; ++i) {\n         cout << s[i];\n       }\n     } else {\n       for (int i = rindex - suff; i < rindex; ++i) {\n         cout << s[i];\n       }\n     }\n     for (int i = rindex; i < s.length(); ++i) {\n       cout << s[i];\n     }\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int V[200010];\n char vowel[] = 'aeiouAEIOU';\n int v(int a, int k) {\n   if (k == 0) return 0;\n   int x = V[a + k - 1];\n   if (a > 0) x -= V[a - 1];\n   return x;\n }\n int f(int a, int k) { return 2 * k - 3 * v(a, k); }\n int g(int k) { return f(0, k); }\n bool Good(int a, int k) { return f(a, k) >= 0; }\n bool is_vowel(char c) {\n   for (int i = 0; i < 10; i++) {\n     if (vowel[i] == c) return true;\n   }\n   return false;\n }\n bool sf(const int& a, const int& b) {\n   if (g(a) < g(b)) return true;\n   if (g(a) > g(b)) return false;\n   return a < b;\n }\n int Q[200010];\n vector<int> P;\n int R[200010];\n int my_bin_search(int s, string S) {\n   int a = 0;\n   int b = P.size() - 1;\n   while (a <= b) {\n     int k = (a + b) / 2;\n     if (P[k] == s)\n       return k;\n     else if (sf(P[k], s))\n       a = k + 1;\n     else\n       b = k - 1;\n   }\n   throw 'element not found';\n }\n void create_data(string S) {\n   int N = S.length();\n   for (int a = 0; a <= N; a++) {\n     P.push_back(a);\n   }\n   sort(P.begin(), P.end(), sf);\n   for (int x = 0; x < P.size(); x++) {\n     R[P[x]] = x;\n   }\n   Q[0] = P[0];\n   for (unsigned int x = 1; x < P.size(); x++) {\n     Q[x] = min(Q[x - 1], P[x]);\n   }\n }\n int main() {\n   string S;\n   cin >> S;\n   int N = S.length();\n   V[0] = 0;\n   for (unsigned int i = 0; i < S.length(); i++) {\n     if (i > 0) V[i] = V[i - 1];\n     if (is_vowel(S[i])) V[i]++;\n   }\n   create_data(S);\n   int bestk = 0;\n   for (int a = 0; a <= N; a++) {\n     int x = R[a];\n     int b = Q[x];\n     bestk = max(bestk, a - b);\n   }\n   if (bestk == 0) {\n     cout << 'No solution' << endl;\n     return 0;\n   }\n   int found = 0;\n   for (int a = 0; (a + bestk) <= N; a++) {\n     if (Good(a, bestk)) {\n       found++;\n     }\n   }\n   cout << bestk << ' ' << found << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double PI = acos(-1);\n void read(int& x) {\n   x = 0;\n   int f = 1;\n   char ch = getchar();\n   while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();\n   if (ch == '-') f = -1, ch = getchar();\n   while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();\n   x *= f;\n }\n int n, f[200005], g[200005], els[200005];\n vector<int> E[200005];\n int power(int a, int b, int p) {\n   int s = 1, w = a;\n   while (b) {\n     if (b & 1) s = (long long)s * w % p;\n     w = (long long)w * w % p;\n     b >>= 1;\n   }\n   return s;\n }\n vector<int> F[200005], B[200005];\n void dfs(int now) {\n   f[now] = 1;\n   for (int i = (0); i < (E[now].size()); i++) {\n     dfs(E[now][i]),\n         f[now] = (long long)f[now] * (f[E[now][i]] + 1) % 1000000007;\n     F[now].push_back(f[E[now][i]] + 1), B[now].push_back(f[E[now][i]] + 1);\n   }\n   for (int i = (1); i < (E[now].size()); i++)\n     F[now][i] = (long long)F[now][i - 1] * F[now][i] % 1000000007;\n   for (int i = (E[now].size() - 2); i >= (0); i--)\n     B[now][i] = (long long)B[now][i + 1] * B[now][i] % 1000000007;\n   if (E[now].size() == 1) {\n     els[E[now][0]] = 1;\n     return;\n   }\n   for (int i = (0); i < (E[now].size()); i++) {\n     if (i == 0)\n       els[E[now][i]] = B[now][i + 1];\n     else if (i + 1 == E[now].size())\n       els[E[now][i]] = F[now][i - 1];\n     else\n       els[E[now][i]] = (long long)B[now][i + 1] * F[now][i - 1] % 1000000007;\n   }\n }\n void work(int now) {\n   for (int i = (0); i < (E[now].size()); i++) {\n     g[E[now][i]] = ((long long)g[now] * els[E[now][i]] + 1) % 1000000007;\n     work(E[now][i]);\n   }\n }\n int main() {\n   read(n);\n   for (int i = (2); i <= (n); i++) {\n     int x;\n     read(x);\n     E[x].push_back(i);\n   }\n   dfs(1);\n   g[1] = 1;\n   work(1);\n   for (int i = (1); i <= (n); i++)\n     printf('%lld ', (long long)f[i] * g[i] % 1000000007);\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string n;\n int i, j, a[9][7], x, y;\n int main() {\n   cin >> n;\n   for (i = n.size() - 1; i >= 0; i--) {\n     x = n[i] - 48;\n     y = max(y, x);\n     for (j = 0; j < x; j++) a[j][7 + i - n.size()] = 1;\n   }\n   cout << y << endl;\n   for (i = 0; i < y; cout << ' ', i++)\n     for (j = 0, x = 0; j < 7; j++) {\n       if (a[i][j] != 0) x = 1;\n       if (x != 0) cout << a[i][j];\n     }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long read() {\n   long long s = 0, w = 1;\n   register char ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') w = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9')\n     s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();\n   return s * w;\n }\n long long n;\n string s;\n signed main() {\n   n = read();\n   cin >> s;\n   for (register long long i = 2; i <= n; i++) {\n     if (n % i) continue;\n     for (register long long j = 0; j < i / 2; j++) swap(s[j], s[i - j - 1]);\n   }\n   cout << s << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int D = 505;\n const int N = 5005;\n pair<int, int> pre[D][N];\n int ans[D][N];\n void solve() {\n   memset(pre, -1, sizeof(pre));\n   memset(ans, -1, sizeof(ans));\n   int d, s;\n   cin >> d >> s;\n   queue<pair<int, int> > que;\n   que.push(pair<int, int>(0, 0));\n   vector<int> vec;\n   while (!que.empty()) {\n     pair<int, int> u = que.front();\n     que.pop();\n     if (u.first == 0 && u.second == s) {\n       pair<int, int> cur = u;\n       while (!(cur.first == 0 && cur.second == 0)) {\n         vec.push_back(ans[cur.first][cur.second]);\n         cur = pre[cur.first][cur.second];\n       }\n       break;\n     }\n     for (int i = 0; i <= 9; i++) {\n       pair<int, int> v = pair<int, int>((u.first * 10 + i) % d, u.second + i);\n       if (v.second <= s && ans[v.first][v.second] == -1) {\n         ans[v.first][v.second] = i;\n         pre[v.first][v.second] = u;\n         que.push(v);\n       }\n     }\n   }\n   if (!vec.size())\n     printf('-1\n');\n   else {\n     reverse(vec.begin(), vec.end());\n     for (auto i : vec) putchar(i + '0');\n     printf('\n');\n   }\n }\n int main() {\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 1e6 + 5, MOD = 998244353;\n int m, n, k;\n long long res;\n int free_Row, free_Col, line_vert, line_hori;\n int Num_Row[N], Num_Row2[N][2], Num_Col[N], Num_Col2[N][2];\n int c[2][2];\n map<pair<int, int>, int> M;\n long long power(long long x, int k) {\n   long long ans = 1;\n   while (k) {\n     if (k & 1) ans = ans * x % MOD;\n     x = x * x % MOD;\n     k >>= 1;\n   }\n   return ans;\n }\n void Calculate() {\n   res = 0;\n   if (line_vert && line_hori) return;\n   if (!line_vert) (res += power(2, free_Row)) %= MOD;\n   if (!line_hori) (res += power(2, free_Col)) %= MOD;\n   if (!line_vert && !line_vert) {\n     if (c[0][0] == 0 && c[1][1] == 0) (res += MOD - 1) %= MOD;\n     if (c[0][1] == 0 && c[1][0] == 0) (res += MOD - 1) %= MOD;\n   }\n }\n void Delete(int x, int y) {\n   if (!M.count({x, y})) return;\n   int z = M[{x, y}];\n   M.erase({x, y});\n   --c[z][(x + y) & 1];\n   if (--Num_Row[x] == 0) ++free_Row;\n   if (--Num_Row2[x][z ^ (y & 1)] == 0 && Num_Row[x]) --line_vert;\n   if (--Num_Col[y] == 0) ++free_Col;\n   if (--Num_Col2[y][z ^ (x & 1)] == 0 && Num_Col[y]) --line_hori;\n }\n void Add(int x, int y, int z) {\n   M[{x, y}] = z;\n   ++c[z][(x + y) & 1];\n   if (Num_Row[x]++ == 0) --free_Row;\n   if (Num_Row2[x][z ^ (y & 1)]++ == 0 && Num_Row[x] > 1) ++line_vert;\n   if (Num_Col[y]++ == 0) --free_Col;\n   if (Num_Col2[y][z ^ (x & 1)]++ == 0 && Num_Col[y] > 1) ++line_hori;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   cin >> m >> n >> k;\n   free_Row = m;\n   free_Col = n;\n   line_hori = 0;\n   line_vert = 0;\n   int x, y, z;\n   while (k--) {\n     cin >> x >> y >> z;\n     Delete(x, y);\n     if (z >= 0) Add(x, y, z);\n     Calculate();\n     cout << res << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 10000;\n vector<int> vec(N);\n int main() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < n; i++) {\n     cin >> vec[i];\n   }\n   sort(vec.begin(), vec.begin() + n);\n   int sum = 0;\n   for (int i = 0; i < m; i++) {\n     sum += vec[i];\n   }\n   cout << sum << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n namespace algo {\n using std::swap;\n const long double PI = 3.141592653589793238462643383279502884L;\n const long double E = 2.718281828459045235360287471352662498L;\n const long double EPS = 1e-12L;\n template <typename T1, typename T2>\n T1 bin_pow(T1 a, T2 n) {\n   T1 r{1};\n   while (n > 0) {\n     if (n % 2 == 1) r *= a;\n     a *= a;\n     n /= 2;\n   }\n   return r;\n }\n template <typename T1, typename T2>\n T1 bin_pow(T1 a, T2 n, const T1& m) {\n   if (m == 1) return 0;\n   T1 r{1};\n   while (n > 0) {\n     if (n % 2 == 1) {\n       r *= a;\n       r %= m;\n     }\n     a *= a;\n     a %= m;\n     n /= 2;\n   }\n   return r;\n }\n template <typename T>\n T gcd(const T& a, const T& b) {\n   if (b == 0) return a < 0 ? -a : a;\n   return gcd(b, a % b);\n }\n template <typename T>\n T gcd(const T& a, const T& b, T& x, T& y) {\n   if (b == 0) {\n     x = a < 0 ? -1 : 1;\n     y = 0;\n     return x * a;\n   }\n   T d{gcd(b, a % b, y, x)};\n   y -= (a / b) * x;\n   return d;\n }\n template <typename T>\n T lcm(const T& a, const T& b) {\n   T r{a / gcd(a, b) * b};\n   return r < 0 ? -r : r;\n }\n template <typename T>\n T mod_add(const T& a, const T& b, const T& m) {\n   if (a < m - b) return a + b;\n   return a - (m - b);\n }\n template <typename T>\n T mod_sub(const T& a, const T& b, const T& m) {\n   if (a < b) return a + (m - b);\n   return a - b;\n }\n template <typename T>\n T mod_mul(T a, T b, const T& m) {\n   if (b > a) swap(a, b);\n   T r{0};\n   while (b > 0) {\n     if (b % 2 == 1) r = mod_add(r, a, m);\n     a = mod_add(a, a, m);\n     b /= 2;\n   }\n   return r;\n }\n template <typename T1, typename T2>\n T1 mod_pow(T1 a, T2 n, const T1& m) {\n   if (m == 1) return 0;\n   T1 r{1};\n   while (n > 0) {\n     if (n % 2 == 1) r = mod_mul(r, a, m);\n     a = mod_mul(a, a, m);\n     n /= 2;\n   }\n   return r;\n }\n template <typename T>\n T mod_inv(const T& a, const T& m) {\n   T x, y;\n   T d{gcd(a, m, x, y)};\n   if (d != 1) return 0;\n   if (x < 0) x += m;\n   return x;\n }\n template <typename T>\n T phi(T n) {\n   T t = std::sqrt(n) + EPS;\n   T r = n;\n   for (T i = 2; i <= t; ++i) {\n     if (n % i == 0) {\n       r -= r / i;\n       do {\n         n /= i;\n       } while (n % i == 0);\n       t = std::sqrt(n) + EPS;\n     }\n   }\n   if (n > 1) r -= r / n;\n   return r;\n }\n class LinearPhi {\n  public:\n   LinearPhi(uint32_t n = 1 << 20) : size_{n} {\n     assert(size_ > 0 && 'Size should be nonzero');\n     assert(size_ <= INT32_MAX && 'Size should fit into an 32-bit signed int');\n     uint32_t sz = (size_ + 1) / 2;\n     phi_ = new int32_t[sz];\n     mark_.assign(sz, false);\n     phi_[0] = 1;\n     if (size_ > 1) primes_.push_back(2);\n     for (uint32_t i = 1; i < sz; ++i) {\n       uint32_t val = i << 1 | 1;\n       if (!mark_[i]) {\n         phi_[i] = val - 1;\n         primes_.push_back(val);\n       }\n       if (val < sz) {\n         for (uint32_t j = 1; j < primes_.size(); ++j) {\n           uint32_t t = val * primes_[j];\n           if (t > size_) break;\n           mark_[t >> 1] = true;\n           if (val % primes_[j] == 0) {\n             phi_[t >> 1] = phi_[i] * primes_[j];\n             break;\n           }\n           phi_[t >> 1] = phi_[i] * (primes_[j] - 1);\n         }\n       }\n     }\n   }\n   LinearPhi(const LinearPhi&) = delete;\n   LinearPhi& operator=(const LinearPhi&) = delete;\n   ~LinearPhi() {\n     delete[] phi_;\n     phi_ = nullptr;\n   }\n   const uint32_t& size() const { return size_; }\n   int32_t phi(int32_t i) const {\n     int32_t r = 1;\n     int k = __builtin_ctz(i);\n     if (k > 0) {\n       i >>= k;\n       r <<= k - 1;\n     }\n     return r * phi_[i >> 1];\n   }\n   int32_t operator[](int32_t i) const { return phi(i); }\n   const std::vector<int32_t>& primes() const { return primes_; }\n \n  private:\n   int32_t* phi_ = nullptr;\n   std::vector<bool> mark_;\n   uint32_t size_;\n   std::vector<int32_t> primes_;\n };\n class Sieve {\n  public:\n   Sieve(uint32_t n = 1 << 20) : size_{n} {\n     assert(size_ > 0 && 'Size should be nonzero');\n     assert(size_ <= INT32_MAX && 'Size should fit into an 32-bit signed int');\n     uint32_t sz = (size_ + 1) / 2;\n     prime_.assign(sz, true);\n     prime_[0] = false;\n     for (uint32_t i = 1; i < sz; ++i) {\n       uint32_t val = i << 1 | 1;\n       if (prime_[i] && val * 1ULL * val <= size_)\n         for (uint32_t j = val * val; j <= size_; j += 2 * val)\n           prime_[j >> 1] = false;\n     }\n   }\n   Sieve(const Sieve&) = delete;\n   Sieve& operator=(const Sieve&) = delete;\n   const uint32_t& size() const { return size_; }\n   bool isPrime(const int32_t& i) const {\n     if (i % 2 == 0) return i == 2;\n     return prime_[i >> 1];\n   }\n   bool operator[](const int32_t& i) const { return isPrime(i); }\n \n  private:\n   uint32_t size_;\n   std::vector<bool> prime_;\n };\n class LinearSieve {\n  public:\n   LinearSieve(uint32_t n = 1 << 20) : size_{n} {\n     assert(size_ > 0 && 'Size should be nonzero');\n     assert(size_ <= INT32_MAX && 'Size should fit into an 32-bit signed int');\n     uint32_t sz = (size_ + 1) / 2;\n     lpf_ = new uint16_t[sz];\n     std::fill(lpf_, lpf_ + sz, 0);\n     lpf_[0] = 1;\n     if (size_ > 1) primes_.push_back(2);\n     for (uint32_t i = 1; i < sz; ++i) {\n       uint32_t val = i << 1 | 1;\n       if (!lpf_[i]) primes_.push_back(val);\n       if (val < sz) {\n         for (uint32_t j = 1; j < primes_.size(); ++j) {\n           uint32_t t = val * primes_[j];\n           if (t > size_) break;\n           lpf_[t >> 1] = static_cast<uint16_t>(primes_[j]);\n           if (lpf_[t >> 1] == (lpf_[i] ? lpf_[i] : val)) break;\n         }\n       }\n     }\n   }\n   LinearSieve(const LinearSieve&) = delete;\n   LinearSieve& operator=(const LinearSieve&) = delete;\n   ~LinearSieve() {\n     delete[] lpf_;\n     lpf_ = nullptr;\n   }\n   const uint32_t& size() const { return size_; }\n   bool isPrime(const int32_t& i) const {\n     if (i % 2 == 0) return i == 2;\n     return !lpf_[i >> 1];\n   }\n   bool operator[](const int32_t& i) const { return isPrime(i); }\n   int32_t lpf(const int32_t& i) const {\n     if (i % 2 == 0) return 2;\n     if (!lpf_[i >> 1]) return i;\n     return lpf_[i >> 1];\n   }\n   int32_t phi(int32_t i) const {\n     int32_t r = 1;\n     int k = __builtin_ctz(i);\n     if (k > 0) {\n       i >>= k;\n       r <<= k - 1;\n     }\n     int32_t n, t = lpf_[i >> 1] ? lpf_[i >> 1] : i;\n     while (t != 1) {\n       r *= (t - 1);\n       i /= t;\n       n = lpf_[i >> 1] ? lpf_[i >> 1] : i;\n       while (n == t) {\n         r *= n;\n         i /= t;\n         n = lpf_[i >> 1] ? lpf_[i >> 1] : i;\n       }\n       t = n;\n     }\n     return r;\n   }\n   const std::vector<int32_t>& primes() const { return primes_; }\n \n  private:\n   uint16_t* lpf_ = nullptr;\n   uint32_t size_;\n   std::vector<int32_t> primes_;\n };\n }  // namespace algo\n using namespace std;\n using namespace algo;\n namespace task {\n int x1, y1, x2, y2, x3, y3;\n int main() {\n   cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;\n   cout << 3 << '\n';\n   cout << x3 - x1 + x2 << ' ' << y3 - y1 + y2 << '\n';\n   cout << x1 - x2 + x3 << ' ' << y1 - y2 + y3 << '\n';\n   cout << x2 - x3 + x1 << ' ' << y2 - y3 + y1 << '\n';\n   return 0;\n }\n }  // namespace task\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout.precision(11);\n   cout.setf(ios::fixed);\n   return task::main();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t, i;\n   string s;\n   cin >> t;\n   while (t--) {\n     cin >> s;\n     int cap = 0, sm = 0, dig = 0;\n     for (i = 0; i < s.size(); i++) {\n       if (s[i] >= 65 && s[i] <= 90) {\n         cap++;\n       } else if (s[i] >= 97 && s[i] <= 122) {\n         sm++;\n       } else if (s[i] >= 48 && s[i] <= 57) {\n         dig++;\n       }\n     }\n     if (sm == 0) {\n       if (cap > 1) {\n         for (i = 0; i < s.size(); i++) {\n           if (s[i] >= 65 && s[i] <= 90) {\n             s[i] = 'a';\n             break;\n           }\n         }\n       } else if (dig > 1) {\n         for (i = 0; i < s.size(); i++) {\n           if (s[i] >= 48 && s[i] <= 57) {\n             s[i] = 'a';\n             break;\n           }\n         }\n       } else {\n         s = s + 'a';\n       }\n     }\n     if (cap == 0) {\n       if (sm > 1) {\n         for (i = 0; i < s.size(); i++) {\n           if (s[i] >= 97 && s[i] <= 122) {\n             s[i] = 'A';\n             break;\n           }\n         }\n       } else if (dig > 1) {\n         for (i = 0; i < s.size(); i++) {\n           if (s[i] >= 48 && s[i] <= 57) {\n             s[i] = 'A';\n             break;\n           }\n         }\n       } else {\n         s = s + 'A';\n       }\n     }\n     if (dig == 0) {\n       if (cap > 1) {\n         for (i = 0; i < s.size(); i++) {\n           if (s[i] >= 65 && s[i] <= 90) {\n             s[i] = '1';\n             break;\n           }\n         }\n       } else if (sm > 1) {\n         for (i = 0; i < s.size(); i++) {\n           if (s[i] >= 97 && s[i] <= 122) {\n             s[i] = '1';\n             break;\n           }\n         }\n       } else {\n         s = s + '1';\n       }\n     }\n     cout << s << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool BeauYear(int y) {\n   int a = y % 10;\n   int b = (y / 10) % 10;\n   int c = (y / 100) % 10;\n   int d = (y / 1000) % 10;\n   if (a != b && a != c && a != d && b != c && b != d && c != d) return true;\n   return false;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int year;\n   cin >> year;\n   for (int i = year + 1; i <= 9012; i++) {\n     if (BeauYear(i) == true) {\n       cout << i;\n       i = 9013;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100005;\n int n, a, b, q, p[N], d[N];\n vector<pair<int, int> > g[N];\n int dp[N][17], v, ud[N], ans[N];\n bool vis[N];\n void dfs(int u) {\n   vis[u] = 1;\n   for (int i = 0; i < (int)g[u].size(); ++i) {\n     v = g[u][i].first;\n     if (!vis[v]) {\n       p[v] = u;\n       d[v] = d[u] + 1;\n       dfs(v);\n     }\n   }\n }\n int lca(int a, int b) {\n   if (d[a] < d[b]) swap(a, b);\n   int log = 0;\n   for (; (1 << log) <= d[a]; ++log)\n     ;\n   --log;\n   for (int i = log; i >= 0; --i) {\n     if (d[a] - (1 << i) >= d[b]) a = dp[a][i];\n   }\n   if (a == b) return a;\n   for (int i = log; i >= 0; --i) {\n     if (dp[a][i] != dp[b][i]) {\n       a = dp[a][i];\n       b = dp[b][i];\n     }\n   }\n   return p[a];\n }\n int DFS(int u) {\n   vis[u] = 1;\n   for (int i = 0; i < (int)g[u].size(); ++i) {\n     int v = g[u][i].first;\n     if (!vis[v]) {\n       ud[u] += DFS(v);\n       ans[g[u][i].second] = ud[v];\n     }\n   }\n   return ud[u];\n }\n int main(int argc, char **argv) {\n   scanf('%d', &n);\n   for (int i = 1; i < n; ++i) {\n     scanf('%d%d', &a, &b);\n     g[a].push_back(make_pair(b, i));\n     g[b].push_back(make_pair(a, i));\n   }\n   memset(p, -1, sizeof p);\n   memset(dp, -1, sizeof dp);\n   dfs(1);\n   for (int i = 0; i <= n; ++i) dp[i][0] = p[i];\n   for (int j = 1; (1 << j) <= n; ++j) {\n     for (int i = 0; i <= n; ++i) {\n       if (dp[i][j - 1] != -1) dp[i][j] = dp[dp[i][j - 1]][j - 1];\n     }\n   }\n   scanf('%d', &q);\n   int LCA;\n   while (q--) {\n     scanf('%d%d', &a, &b);\n     LCA = lca(a, b);\n     ++ud[a], ++ud[b], ud[LCA] -= 2;\n   }\n   memset(vis, 0, sizeof vis);\n   DFS(1);\n   for (int i = 1; i < n; ++i) {\n     if (i > 1) printf(' ');\n     printf('%d', ans[i]);\n   }\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string tobinary(long long x) {\n   string ret;\n   char ch;\n   while (x) ch = '0' + (x % 2), ret = ch + ret, x /= 2;\n   return ret;\n }\n long long todecimal(string s) {\n   int sz = s.size();\n   long long ret = 0;\n   for (int i = 0; i < sz; i++) ret = 2 * ret + (s[i] - '0');\n   return ret;\n }\n bool _greater(string s, string t) {\n   int n = s.size(), m = t.size();\n   if (n > m) return true;\n   if (n < m) return false;\n   for (int i = 0; i < n; i++) {\n     if (s[i] > t[i])\n       return true;\n     else if (s[i] < t[i])\n       return false;\n   }\n   return false;\n }\n long long eval(long long l, long long r) {\n   string s = tobinary(l), t = tobinary(r), ret = s;\n   while (1) {\n     if (_greater(s, t)) break;\n     ret = s;\n     int sz = s.size();\n     bool ok = false;\n     for (int i = sz - 1; i >= 0; i--)\n       if (s[i] == '0') {\n         s[i] = '1';\n         ok = true;\n         break;\n       }\n     if (!ok) {\n       s = '1' + s;\n       int n = s.size(), m = t.size();\n       if (n > m) break;\n     }\n   }\n   return todecimal(ret);\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int n;\n   cin >> n;\n   while (n--) {\n     long long l, r;\n     cin >> l >> r;\n     cout << eval(l, r) << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<pair<int, int> > points;\n pair<int, int> dif(pair<int, int> pa, pair<int, int> pb) {\n   pair<int, int> res;\n   res.first = pb.first - pa.first;\n   res.second = pb.second - pa.second;\n   return res;\n }\n int dot(pair<int, int> a, pair<int, int> b) {\n   return a.first * b.first + a.second * b.second;\n }\n double dist(pair<int, int> a, pair<int, int> b) {\n   return ((double)((a.first - b.first) * (a.first - b.first) +\n                    (a.second - b.second) * (a.second - b.second)));\n }\n double len(pair<int, int> a) { return dist(a, make_pair(0, 0)); }\n int main() {\n   for (int i = 0; i < 8; i++) {\n     int x, y;\n     cin >> x >> y;\n     points.push_back(make_pair(x, y));\n   }\n   vector<int> perm;\n   for (int i = 0; i < 8; i++) perm.push_back(i);\n   int cnt = 0;\n   bool found = false;\n   do {\n     cnt++;\n     bool fs = false, ss = false;\n     bool fis = true, sif = true;\n     pair<int, int> a = points[perm[0]];\n     pair<int, int> b = points[perm[1]];\n     pair<int, int> c = points[perm[2]];\n     pair<int, int> d = points[perm[3]];\n     pair<int, int> e = points[perm[4]];\n     pair<int, int> f = points[perm[5]];\n     pair<int, int> g = points[perm[6]];\n     pair<int, int> h = points[perm[7]];\n     pair<int, int> ab = dif(a, b);\n     pair<int, int> bc = dif(b, c);\n     pair<int, int> cd = dif(c, d);\n     pair<int, int> da = dif(d, a);\n     fs = (dot(ab, bc) == 0 && dot(bc, cd) == 0 && dot(cd, da) == 0 &&\n           dot(da, ab) == 0 && fabs(len(ab) - len(bc)) < 0.01 &&\n           fabs(len(bc) - len(cd)) < 0.01 && fabs(len(cd) - len(da)) < 0.01);\n     pair<int, int> ef = dif(e, f);\n     pair<int, int> fg = dif(f, g);\n     pair<int, int> gh = dif(g, h);\n     pair<int, int> he = dif(h, e);\n     ss = (dot(ef, fg) == 0 && dot(fg, gh) == 0 && dot(gh, he) == 0 &&\n           dot(he, ef) == 0 && fabs(len(ef) - len(gh)) < 0.01 &&\n           fabs(len(fg) - len(he)) < 0.01);\n     if (ss && fs) {\n       found = true;\n       break;\n     }\n   } while (next_permutation(perm.begin(), perm.end()));\n   if (found) {\n     cout << 'YES' << endl;\n     for (int i = 0; i < 4; i++) {\n       if (i != 0) cout << ' ';\n       cout << perm[i] + 1;\n     }\n     cout << endl;\n     for (int i = 4; i < 8; i++) {\n       if (i != 4) cout << ' ';\n       cout << perm[i] + 1;\n     }\n     cout << endl;\n   } else\n     cout << 'NO' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n int n;\n char s[5001];\n int dp[5001][5001];\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('\n%c', &s[i]);\n   }\n   dp[1][0] = 1;\n   for (int j = 1; j <= n; ++j) {\n     dp[1][j] = 0;\n   }\n   for (int i = 2; i <= n; ++i) {\n     if (s[i - 1] == 'f') {\n       for (int j = 1; j <= n; ++j) {\n         dp[i][j] = dp[i - 1][j - 1];\n       }\n     } else {\n       int x = 0;\n       for (int j = n; j >= 0; --j) {\n         x += dp[i - 1][j];\n         if (x >= mod) {\n           x -= mod;\n         }\n         dp[i][j] = x;\n       }\n     }\n   }\n   int res = 0;\n   for (int i = 0; i <= n; ++i) {\n     res += dp[n][i];\n     if (res >= mod) {\n       res -= mod;\n     }\n   }\n   cout << res << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using lli = long long;\n using Double = long double;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   string s[9][3];\n   for (int i = 0; i < 9; ++i) {\n     for (int j = 0; j < 3; ++j) {\n       cin >> s[i][j];\n     }\n   }\n   int x, y, cnt = 0;\n   cin >> x >> y, --x, --y;\n   for (auto c : s[x % 3 * 3][y % 3]) cnt += c == '.';\n   for (auto c : s[x % 3 * 3 + 1][y % 3]) cnt += c == '.';\n   for (auto c : s[x % 3 * 3 + 2][y % 3]) cnt += c == '.';\n   if (cnt == 0) {\n     for (int i = 0; i < 9; ++i) {\n       for (int j = 0; j < 3; ++j) {\n         for (auto c : s[i][j]) {\n           cout << (c == '.' ? '!' : c);\n         }\n         cout << ' \n'[j == 2];\n       }\n       if (i % 3 == 2) cout << '\n';\n     }\n   } else {\n     for (int i = 0; i < 9; ++i) {\n       for (int j = 0; j < 3; ++j) {\n         for (auto c : s[i][j]) {\n           cout << (c == '.' and i / 3 == x % 3 and j == y % 3 ? '!' : c);\n         }\n         cout << ' \n'[j == 2];\n       }\n       if (i % 3 == 2) cout << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char str[606];\n long long tmp[80];\n long long mat[2000][32];\n int see[2000];\n int main() {\n   int M;\n   scanf('%d', &M);\n   for (int i = 0; i < M; i++) {\n     scanf('%s', str);\n     int len = 0;\n     while (str[len]) len++;\n     for (int j = 0; j < 80; j++) tmp[j] = 0;\n     for (int j = 0; j < len; j++) {\n       long long &t = tmp[(len - j - 1) / 8];\n       t = t * 10 + str[j] - '0';\n     }\n     for (int j = 0; j < 250; j++) {\n       long long t = tmp[0] & 255;\n       for (int k = 0; k < 8; k++)\n         if (t & (1 << k)) mat[j * 8 + k][i / 64] |= 1ll << (i % 64);\n       for (int k = 79; k; k--) {\n         tmp[k - 1] += (tmp[k] & 255) * 100000000ll;\n         tmp[k] >>= 8;\n       }\n       tmp[0] >>= 8;\n     }\n   }\n   for (int i = 0, j = 0; i < 2000 && j < M; j++) {\n     bool seen = false;\n     for (int k = i; k < 2000; k++) {\n       if (mat[k][j / 64] & (1ll << (j % 64))) {\n         for (int l = j / 64; l < 32; l++) {\n           swap(mat[i][l], mat[k][l]);\n         }\n         seen = true;\n         break;\n       }\n     }\n     if (!seen) {\n       int cnt = 0;\n       for (int k = 0; k < i; k++)\n         if (mat[k][j / 64] & (1ll << (j % 64))) cnt++;\n       printf('%d', cnt);\n       for (int k = 0; k < i; k++)\n         if (mat[k][j / 64] & (1ll << (j % 64))) printf(' %d', see[k]);\n       puts('');\n       continue;\n     }\n     see[i] = j;\n     printf('0\n');\n     for (int k = 0; k < 2000; k++)\n       if (k != i && (mat[k][j / 64] & (1ll << (j % 64)))) {\n         for (int l = j / 64; l < 32; l++) mat[k][l] ^= mat[i][l];\n       }\n     i++;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxm = 2e5 + 10;\n set<int> g;\n queue<set<int> > q;\n int m, n, x, y;\n int dfs(int top) {\n   if (abs(top) <= 1) return 0;\n   int now = 0;\n   if ((-top) % 2 == 0)\n     now = top / 2;\n   else\n     now = (top + 1) / 2;\n   if (g.find(now) == g.end()) {\n     g.erase(top);\n     g.insert(now);\n     return 1;\n   } else\n     return dfs(now);\n }\n int main() {\n   cin >> m;\n   for (int i = 1; i <= m; i++) {\n     cin >> x;\n     g.insert(-x);\n   }\n   for (;;) {\n     int top = *g.begin();\n     if (!dfs(top)) break;\n   }\n   for (auto e : g) cout << -e << ' ';\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> v;\n int qtd[100001];\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     int a;\n     scanf('%d', &a);\n     v.push_back(a);\n   }\n   sort(v.begin(), v.end());\n   int cont = 0;\n   for (int i = 1, tmp = 0; i < n; i++) {\n     if (v[i] > v[i - 1]) {\n       cont += i - tmp;\n       tmp = i;\n     }\n     qtd[i] = cont;\n   }\n   int ans = 0;\n   int used = 0;\n   for (int i = 0; i < n; i++) {\n     if (qtd[i] > used) {\n       used++;\n       ans++;\n     }\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct W {\n   int t, l, r;\n } w[100010];\n int n, m, s, f;\n int main() {\n   while (cin >> n >> m >> s >> f) {\n     for (int i = (0); i < (m); i++) {\n       cin >> w[i].t >> w[i].l >> w[i].r;\n     }\n     int t = 1, p = 0;\n     int dir = f > s ? 1 : -1;\n     while (s != f) {\n       if (p < m && w[p].t == t &&\n           ((w[p].l <= s && s <= w[p].r) ||\n            (w[p].l <= s + dir && s + dir <= w[p].r))) {\n         cout << 'X';\n       } else {\n         s += dir;\n         cout << (dir == 1 ? 'R' : 'L');\n       }\n       if (++t > w[p].t) p++;\n     }\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 1e9;\n int n, d, p[30005], dp1[60005][700];\n int occ[30005];\n int main() {\n   scanf('%d%d', &n, &d);\n   int xb, x2, x3;\n   for (xb = 0; xb < n; xb++) {\n     scanf('%d', &p[xb]);\n     p[xb]--;\n     occ[p[xb]]++;\n   }\n   d--;\n   int res = 0;\n   for (xb = 0; xb < 60005; xb++) {\n     for (x3 = 0; x3 < 700; x3++) dp1[xb][x3] = -inf;\n   }\n   dp1[d][350] = 0;\n   for (xb = d; xb < 30000; xb++) {\n     for (x3 = 0; x3 < 700; x3++) {\n       if (dp1[xb][x3] == -inf) continue;\n       int tv = d + x3 - 349, adg = occ[xb];\n       if (tv > 0)\n         res = (((res) > (adg + dp1[xb][x3])) ? (res) : (adg + dp1[xb][x3]));\n       if (tv > 1)\n         dp1[xb + tv - 1][x3 - 1] =\n             (((dp1[xb + tv - 1][x3 - 1]) > (dp1[xb][x3] + adg))\n                  ? (dp1[xb + tv - 1][x3 - 1])\n                  : (dp1[xb][x3] + adg));\n       if (tv > 0)\n         dp1[xb + tv][x3] =\n             (((dp1[xb + tv][x3]) > (dp1[xb][x3] + adg)) ? (dp1[xb + tv][x3])\n                                                         : (dp1[xb][x3] + adg));\n       if (tv > -1)\n         dp1[xb + tv + 1][x3 + 1] =\n             (((dp1[xb + tv + 1][x3 + 1]) > (dp1[xb][x3] + adg))\n                  ? (dp1[xb + tv + 1][x3 + 1])\n                  : (dp1[xb][x3] + adg));\n     }\n   }\n   printf('%d\n', res);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 100;\n int t, cnt[N];\n int mx;\n int check(int row, int col, int n, int m) {\n   if (row < 0 || row >= n || col < 0 || col >= m) return 0;\n   int i = 0, j = 0, ok = 1;\n   for (; i < n; i++) {\n     for (j = 0; j < m; j++) {\n       if (!cnt[abs(row - i) + abs(col - j)]--) {\n         ok = 0;\n         break;\n       }\n     }\n     if (!ok) break;\n   }\n   if (ok) {\n     cout << n << ' ' << m << endl;\n     cout << row + 1 << ' ' << col + 1 << endl;\n     return 1;\n   }\n   for (int a = 0; a <= i; a++)\n     for (int b = 0; b < m && (a != i || b <= j); b++)\n       ++cnt[abs(row - a) + abs(col - b)];\n   return 0;\n }\n bool solve(int row, int n, int m, int mxi, int mxj) {\n   if (check(row, mxj - (mx - abs(row - mxi)), n, m)) return 1;\n   return check(row, mxj + (mx - abs(row - mxi)), n, m);\n }\n int main() {\n   scanf('%d', &t);\n   for (int i = 0; i < t; ++i) {\n     int v;\n     scanf('%d', &v);\n     ++cnt[v];\n     mx = max(mx, v);\n   }\n   if (cnt[0] != 1) return puts('-1');\n   int a;\n   if (cnt[1] != 4)\n     a = 0;\n   else {\n     a = 1;\n     while (cnt[a + 1] == (a + 1) * 4) a++;\n   }\n   for (int n = 1; n * n <= t; n++) {\n     if (t % n) continue;\n     int m = t / n;\n     if (solve(a, n, m, 0, 0)) return 0;\n     if (solve(a, n, m, 0, m - 1)) return 0;\n     if (solve(a, n, m, n - 1, 0)) return 0;\n     if (solve(a, n, m, n - 1, m - 1)) return 0;\n     if (solve(a, m, n, 0, 0)) return 0;\n     if (solve(a, m, n, 0, n - 1)) return 0;\n     if (solve(a, m, n, m - 1, 0)) return 0;\n     if (solve(a, m, n, m - 1, n - 1)) return 0;\n   }\n   return puts('-1');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int i, j;\n   int str[6];\n   int num[6];\n   char ch;\n   for (i = 0; i < 6; i++) {\n     str[i] = 0;\n     num[i] = 0;\n   }\n   for (i = 0; i < 6; i++) {\n     scanf('%c', &ch);\n     switch (ch) {\n       case 'R':\n         str[0]++;\n         break;\n       case 'O':\n         str[1]++;\n         break;\n       case 'Y':\n         str[2]++;\n         break;\n       case 'G':\n         str[3]++;\n         break;\n       case 'B':\n         str[4]++;\n         break;\n       case 'V':\n         str[5]++;\n         break;\n     }\n   }\n   for (j = 0; j < 6; j++) {\n     num[str[j]]++;\n   }\n   switch (num[0]) {\n     case 0:\n       printf('30\n');\n       break;\n     case 1:\n       printf('15\n');\n       break;\n     case 2:\n       switch (num[1]) {\n         case 2:\n           printf('8\n');\n           break;\n         case 3:\n           printf('5\n');\n           break;\n       }\n       break;\n     case 3:\n       switch (num[1]) {\n         case 2:\n           printf('2\n');\n           break;\n         case 1:\n           printf('3\n');\n           break;\n         case 0:\n           printf('6\n');\n           break;\n       }\n       break;\n     case 4:\n       switch (num[1]) {\n         case 1:\n           printf('1\n');\n           break;\n         case 0:\n           printf('2\n');\n           break;\n       }\n       break;\n     case 5:\n       printf('1\n');\n       break;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int Head[1000010], Next[1000010], Go[1000010], Val[1000010], iscut[1000010],\n     Len[1000010], Dep[1000010], Fa[400010][21], Cnt = 1, n, m, q;\n int Head2[1000010], Next2[1000010], Go2[1000010], Val2[1000010], Cnt2 = 1;\n int DFN[1000010], MIN[1000010], ins[1000010], Bel[1000010], vis[1000010],\n     tim = 0, tt = 0;\n vector<int> S;\n void addedge(int x, int y) {\n   Go[++Cnt] = y;\n   Next[Cnt] = Head[x];\n   Head[x] = Cnt;\n }\n void addedge2(int x, int y, int v) {\n   Go2[++Cnt2] = y;\n   Next2[Cnt2] = Head2[x];\n   Head2[x] = Cnt2;\n   Val2[Cnt2] = v;\n }\n void Tarjan(int x, int f = 0) {\n   ins[x] = 1;\n   S.push_back(x);\n   DFN[x] = ++tim;\n   MIN[x] = DFN[x];\n   int las = x;\n   for (int T = Head[x]; T; T = Next[T])\n     if (Go[T] != f) {\n       if (!DFN[Go[T]]) {\n         Tarjan(Go[T], x);\n         MIN[x] = min(MIN[x], MIN[Go[T]]);\n         if (DFN[x] <= MIN[Go[T]]) {\n           tt++;\n           for (;;) {\n             if (S.back() == las) break;\n             addedge2(tt + n + 1, S.back(), 1);\n             addedge2(S.back(), tt + n + 1, 1);\n             S.pop_back();\n           }\n           addedge2(x, tt + n + 1, 1);\n           addedge2(tt + n + 1, x, 1);\n         } else\n           las = S.back();\n       } else if (ins[Go[T]])\n         MIN[x] = min(MIN[x], DFN[Go[T]]);\n     }\n   ins[x] = 0;\n }\n void DFS2(int x, int dep = 1, int len = 0) {\n   vis[x] = 1;\n   Len[x] = len;\n   Dep[x] = dep;\n   for (int T = Head[x]; T; T = Next[T])\n     if (!vis[Go[T]]) {\n       Fa[Go[T]][0] = x;\n       DFS2(Go[T], dep + 1, len + Val[T]);\n     }\n }\n int lca(int x, int y) {\n   if (Dep[x] < Dep[y]) swap(x, y);\n   int det = Dep[x] - Dep[y];\n   for (int i = 18; i >= 0; i--)\n     if ((det >> i) & 1) x = Fa[x][i];\n   if (x == y) return x;\n   for (int i = 18; i >= 0; i--)\n     if (Fa[x][i] != Fa[y][i]) x = Fa[x][i], y = Fa[y][i];\n   return Fa[x][0];\n }\n int main() {\n   scanf('%d%d%d', &n, &m, &q);\n   for (int i = 1; i <= m; i++) {\n     int a, b;\n     scanf('%d%d', &a, &b);\n     addedge(a, b);\n     addedge(b, a);\n   }\n   for (int i = 1; i <= n; i++)\n     if (!DFN[i]) Tarjan(i);\n   memcpy(Head, Head2, sizeof Head);\n   memcpy(Next, Next2, sizeof Next);\n   memcpy(Go, Go2, sizeof Go);\n   memcpy(Val, Val2, sizeof Val);\n   for (int i = 1; i <= n + tt + 1; i++)\n     if (!vis[i]) DFS2(i);\n   for (int i = 1; i <= 20; i++)\n     for (int j = 1; j <= n + tt + 1; j++) Fa[j][i] = Fa[Fa[j][i - 1]][i - 1];\n   for (int i = 1; i <= q; i++) {\n     int a, b;\n     scanf('%d%d', &a, &b);\n     printf('%d\n', (Len[a] + Len[b] - 2 * Len[lca(a, b)]) / 2);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int read() {\n   char ch = getchar();\n   int x = 0, f = 1;\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') {\n     x = (x << 1) + (x << 3) - '0' + ch;\n     ch = getchar();\n   }\n   return x * f;\n }\n int main() {\n   priority_queue<int> q;\n   int n = read(), T = read();\n   int ans = 0;\n   for (int i = 1; i <= n; i++) {\n     int x = read();\n     x = max(x, i);\n     while (!q.empty() && q.top() >= T - i) {\n       q.pop();\n     }\n     if (x < T) q.push(x - i);\n     ans = max(ans, (int)q.size());\n   }\n   printf('%d\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[1005];\n int b[1005];\n int h;\n bool cmp(int x, int y) { return x > y; }\n bool check(int x) {\n   for (int i = 1; i <= x; i++) {\n     b[i] = a[i];\n   }\n   sort(b + 1, b + x + 1, cmp);\n   long long sum = 0;\n   for (int i = 1; i <= x; i += 2) {\n     sum += (long long)(b[i]);\n   }\n   if (sum <= h) {\n     return 1;\n   } else {\n     return 0;\n   }\n }\n int main() {\n   int n;\n   cin >> n >> h;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n   }\n   int l = 1, r = n, mid;\n   while (l < r) {\n     mid = (l + r + 1) / 2;\n     if (check(mid)) {\n       l = mid;\n     } else {\n       r = mid - 1;\n     }\n   }\n   cout << l;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int in() {\n   int x;\n   scanf('%d', &x);\n   return x;\n }\n template <typename T>\n inline istream& operator>>(istream& i, vector<T>& v) {\n   for (int j = 0; j < ((int)(v).size()); ++j) i >> v[j];\n   return i;\n }\n template <typename T>\n string join(const vector<T>& v) {\n   stringstream s;\n   for (int i = 0; i < ((int)(v).size()); ++i) s << ' ' << v[i];\n   return s.str().substr(1);\n }\n template <typename T>\n inline ostream& operator<<(ostream& o, const vector<T>& v) {\n   if ((int)(v).size()) o << join(v);\n   return o;\n }\n template <typename T1, typename T2>\n inline istream& operator>>(istream& i, pair<T1, T2>& v) {\n   return i >> v.first >> v.second;\n }\n template <typename T1, typename T2>\n inline ostream& operator<<(ostream& o, const pair<T1, T2>& v) {\n   return o << v.first << ',' << v.second;\n }\n template <typename T>\n inline long long int suma(const vector<T>& a) {\n   long long int res(0);\n   for (auto&& x : a) res += x;\n   return res;\n }\n const double eps = 1e-10;\n const long long int LINF = 1001002003004005006ll;\n const int INF = 1001001001;\n const int MX = 200005;\n int n, m;\n int dp[55][55][55];\n struct Q {\n   int l, r, x, c;\n   int cost(int i, int h) {\n     if (l <= i && i < r && h > x) return c;\n     return 0;\n   }\n };\n vector<Q> q;\n int dfs(int l, int r, int h) {\n   if (l == r) return 0;\n   int& now = dp[l][r][h];\n   if (now != -1) return now;\n   now = 0;\n   if (h) now = dfs(l, r, h - 1);\n   for (int i = l; i < r; ++i) {\n     int c = h * h;\n     for (int k = 0; k < (m); ++k) {\n       if (l <= q[k].l && q[k].r <= r) c -= q[k].cost(i, h);\n     }\n     c += dfs(l, i, h) + dfs(i + 1, r, h);\n     (now = max(now, c));\n   }\n   return now;\n }\n int main() {\n   int h;\n   cin >> n >> h >> m;\n   q = vector<Q>(m);\n   for (int i = 0; i < (m); ++i) {\n     int l, r, x, c;\n     scanf('%d%d%d%d', &l, &r, &x, &c);\n     --l;\n     q[i] = (Q){l, r, x, c};\n   }\n   for (int i = 0; i < (n); ++i)\n     for (int j = 0; j < (n + 1); ++j)\n       for (int k = 0; k < (h + 1); ++k) dp[i][j][k] = -1;\n   int ans = dfs(0, n, h);\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct node {\n   int x, y;\n } p[8];\n int cmp(node a, node b) {\n   if (a.x == b.x) return (a.y < b.y);\n   return a.x < b.x;\n }\n int main() {\n   while (scanf('%d %d', &p[0].x, &p[0].y) != EOF) {\n     int cnt1 = 0;\n     int cnt2 = 0;\n     int cnt3 = 0;\n     int cnt4 = 0;\n     for (int i = 1; i < 8; i++) {\n       scanf('%d %d', &p[i].x, &p[i].y);\n     }\n     sort(p, p + 8, cmp);\n     node zuoshang = p[0];\n     node youxia = p[7];\n     for (int i = 1; i < 7; i++) {\n       if (p[i].x == zuoshang.x) cnt1++;\n       if (p[i].y == zuoshang.y) cnt2++;\n       if (p[i].x == youxia.x) cnt3++;\n       if (p[i].y == youxia.y) cnt4++;\n     }\n     if (cnt1 == 2 && cnt2 == 2 && cnt3 == 2 && cnt4 == 2 && p[1].y == p[6].y &&\n         p[4].x == p[3].x)\n       puts('respectable');\n     else\n       puts('ugly');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     double x, y, z, a, b, c, sq;\n     cin >> x;\n     a = 1.0, b = x, c = x;\n     z = (b * b) - (4 * a * c);\n     if (z < 0) {\n       cout << 'N' << endl;\n       continue;\n     }\n     y = ((-b + (sqrt((b * b) - (4 * a * c)))) / 2 * a);\n     if (y != 0) y = -1 * y;\n     cout << fixed << setprecision(9) << 'Y ' << (x - y) << ' ' << y << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int r1, r2;\n int c1, c2;\n int b, e, k;\n int main() {\n   ios_base::sync_with_stdio(0);\n   b = e = k = 0;\n   cin >> r1 >> c1;\n   cin >> r2 >> c2;\n   if (r1 > r2) {\n     swap(r1, r2);\n     swap(c1, c2);\n   }\n   b = (r1 == r2 || c1 == c2) ? 1 : 2;\n   e = ((((r1 & 1) == (c1 & 1)) && ((r2 & 1) == (c2 & 1))) ||\n        (((r1 & 1) != (c1 & 1)) && ((r2 & 1) != (c2 & 1))))\n           ? 2\n           : 0;\n   e = (abs(r1 - r2) == abs(c1 - c2) && e != 0) ? 1 : e;\n   k = min(abs(r1 - r2), abs(c1 - c2)) + max(abs(r1 - r2), abs(c1 - c2)) -\n       min(abs(r1 - r2), abs(c1 - c2));\n   cout << b << ' ' << e << ' ' << k << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e3 + 789;\n const int M = 2e5 + 5;\n const int NN = 1e5 + 55;\n const long long mod = 1e9 + 7;\n const long long inf = 0x3f3f3f3f;\n const long long INF = 1LL << 62;\n bitset<2000> P[N], S[N], T;\n char ms[N][N];\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int n, m;\n   cin >> n >> m;\n   P[0].reset();\n   for (int i = 0; i < n; i++) {\n     cin >> ms[i];\n     if (i) P[i] = P[i - 1];\n     for (int j = 0; j < m; j++) {\n       if (ms[i][j] == '1') P[i][j] = 1;\n     }\n   }\n   for (int i = n - 1; i >= 0; i--) {\n     if (i != n - 1) S[i] = S[i + 1];\n     for (int j = 0; j < m; j++) {\n       if (ms[i][j] == '1') S[i][j] = 1;\n     }\n   }\n   bool f = 0;\n   for (int i = 0; i < n; i++) {\n     T.reset();\n     if (i - 1 >= 0) T |= P[i - 1];\n     if (i + 1 < n) T |= S[i + 1];\n     if (T.count() == m) f = 1;\n   }\n   if (f)\n     cout << 'YES' << endl;\n   else\n     cout << 'NO' << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline void Boost() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n }\n const int NMax = 1e6 + 50;\n string convert(const string &s) {\n   string ret = '@';\n   for (int i = 0; i < (int)s.size(); ++i) {\n     ret += '#' + s.substr(i, 1);\n   }\n   ret += '#$';\n   return ret;\n }\n int P[NMax * 2];\n void Solve() {\n   string s;\n   cin >> s;\n   int n = (int)s.size();\n   int a = 0;\n   int b = n - 1;\n   while (a <= b) {\n     if (a == b) {\n       cout << s << '\n';\n       return;\n     }\n     if (s[a] == s[b]) {\n       ++a;\n       --b;\n       if (a > b) {\n         cout << s << '\n';\n         return;\n       }\n     } else {\n       string nw = convert(s);\n       int cen = 0, r = 0;\n       for (int i = 0; i < (int)nw.size(); ++i) P[i] = 0;\n       for (int i = 1; i < (int)nw.size() - 1; ++i) {\n         int mir = cen - (i - cen);\n         if (r > i) {\n           P[i] = min(r - i, P[mir]);\n         }\n         while (nw[i + 1 + P[i]] == nw[i - 1 - P[i]]) {\n           P[i]++;\n         }\n         if (i + P[i] > r) {\n           cen = i;\n           r = i + P[i];\n         }\n       }\n       int best = 0;\n       int pos = 0;\n       for (int i = 1; i < (int)nw.size() - 1; i++) {\n         int start = (i - 1 - P[i]) / 2;\n         int fin = start + P[i] - 1;\n         if (start < a) {\n           int mv = a - start;\n           start += mv;\n           fin -= mv;\n         }\n         if (fin > b) {\n           int mv = fin - b;\n           start += mv;\n           fin -= mv;\n         }\n         if (start != a && fin != b) continue;\n         if (start <= fin && (fin - start + 1) > best) {\n           best = fin - start + 1;\n           pos = start;\n         }\n       }\n       for (int i = 0; i < a; ++i) cout << s[i];\n       for (int i = pos; i < pos + best; ++i) cout << s[i];\n       for (int i = a - 1; i >= 0; --i) cout << s[i];\n       cout << '\n';\n       return;\n     }\n   }\n }\n int main() {\n   Boost();\n   int t;\n   cin >> t;\n   while (t--) {\n     Solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool is_prefix(string s, string comp) {\n   bool res = false;\n   int sz = s.size();\n   int comp_sz = comp.size();\n   if (sz > comp_sz)\n     return res;\n   else {\n     res = true;\n     for (int i = 0; i < sz; i++) {\n       if (s[i] != comp[i]) {\n         res = false;\n         break;\n       }\n     }\n   }\n   return res;\n }\n int main(int argc, char* argv[]) {\n   int n;\n   string s;\n   vector<string> res;\n   cin >> s;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     string t;\n     cin >> t;\n     if (is_prefix(s, t)) res.push_back(t);\n   }\n   if (res.size() == 0) {\n     cout << s;\n   } else {\n     sort(res.begin(), res.end());\n     cout << res[0];\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int du[100010], fa[100010], s1[100010], s2[100010];\n int find(int x) {\n   if (x != fa[x]) fa[x] = find(fa[x]);\n   return fa[x];\n }\n int main() {\n   int n, m, x, y, i, j, k, sum;\n   scanf('%d%d', &n, &m);\n   for (i = 1; i <= n; i++) fa[i] = i;\n   memset(du, 0, sizeof(du));\n   memset(s1, 0, sizeof(s1));\n   memset(s2, 0, sizeof(s2));\n   for (i = 1; i <= m; i++) {\n     scanf('%d%d', &x, &y);\n     j = find(x);\n     k = find(y);\n     du[x]++;\n     du[y]++;\n     if (j != k) {\n       if (j < k)\n         fa[k] = j;\n       else\n         fa[j] = k;\n     }\n   }\n   for (i = 1; i <= n; i++) {\n     j = find(i);\n     s1[j] = s1[j] + du[i];\n     s2[j]++;\n   }\n   sum = 0;\n   for (i = 1; i <= n; i++)\n     if (s2[i] != 0) {\n       j = s1[i] / 2;\n       if (j < s2[i]) sum = sum + s2[i] - j;\n     }\n   printf('%d\n', sum);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int maxn = 100001;\n int n, val[maxn], cL[maxn], cR[maxn], ord[maxn], tot, in[maxn], out[maxn],\n     bit[maxn], ans;\n bool vis[maxn];\n void dfs(int u) {\n   if (u == -1) return;\n   in[u] = ++tot;\n   dfs(cL[u]);\n   dfs(cR[u]);\n   out[u] = tot;\n }\n void bit_add(int x, int v) {\n   for (; x <= n; x += x & -x) bit[x] += v;\n }\n int bit_sum(int x) {\n   int ret = 0;\n   for (; x > 0; x -= x & -x) ret += bit[x];\n   return ret;\n }\n bool cmp(int const &x, int const &y) { return val[x] < val[y]; }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d%d%d', val + i, cL + i, cR + i);\n     if (cL[i] != -1) vis[cL[i]] = 1;\n     if (cR[i] != -1) vis[cR[i]] = 1;\n     ord[i] = i;\n   }\n   std::sort(ord + 1, ord + n + 1, cmp);\n   for (int i = 1; i <= n; ++i)\n     if (!vis[i]) dfs(i);\n   for (int i = 1; i <= n; ++i)\n     if (cR[i] != -1) {\n       bit_add(in[cR[i]], 1);\n       bit_add(out[cR[i]] + 1, -1);\n     }\n   for (int i = 1, j = 1; i <= n;) {\n     for (; j <= n && val[ord[j]] <= val[ord[i]]; ++j) {\n       int u = ord[j];\n       if (cL[u] != -1) {\n         bit_add(in[cL[u]], 1);\n         bit_add(out[cL[u]] + 1, -1);\n       }\n       if (cR[u] != -1) {\n         bit_add(in[cR[u]], -1);\n         bit_add(out[cR[u]] + 1, 1);\n       }\n     }\n     int cnt = 0, flg = 0;\n     for (int v = val[ord[i]]; i <= n && val[ord[i]] == v; ++i, ++cnt)\n       flg |= !bit_sum(in[ord[i]]);\n     if (!flg) ans += cnt;\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 210;\n int n, m, x;\n long long dp[maxn][maxn], v[maxn], ans = -1;\n void read_and_parse() {\n   scanf('%d%d%d', &n, &m, &x);\n   for (int i = 1; i <= n; i++) scanf('%d', &v[i]);\n }\n void solve() {\n   memset(dp, 0xcf, sizeof(dp));\n   dp[0][0] = 0;\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= x; j++)\n       for (int k = max(0, i - m); k < i; k++)\n         dp[i][j] = max(dp[i][j], dp[k][j - 1] + v[i]);\n   for (int i = n - m + 1; i <= n; i++) ans = max(ans, dp[i][x]);\n   printf('%lld\n', ans);\n }\n int main() {\n   read_and_parse();\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<long long int, long long int> 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 <bits/stdc++.h>\n using namespace std;\n template <class L, class R>\n ostream &operator<<(ostream &os, map<L, R> P) {\n   for (auto const &vv : P) os << '(' << vv.first << ',' << vv.second << ')';\n   return os;\n }\n template <class T>\n ostream &operator<<(ostream &os, set<T> V) {\n   os << '[';\n   for (auto const &vv : V) os << vv << ',';\n   os << ']';\n   return os;\n }\n template <class T>\n ostream &operator<<(ostream &os, vector<T> V) {\n   os << '[';\n   for (auto const &vv : V) os << vv << ',';\n   os << ']';\n   return os;\n }\n template <class L, class R>\n ostream &operator<<(ostream &os, pair<L, R> 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 <typename T>\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 <typename T, typename... Args>\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 <bits/stdc++.h>\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<int> 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<int> &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<int> 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 <bits/stdc++.h>\n using namespace std;\n const int MAXN = 100010;\n bool operator<(pair<int, int> lhs, pair<int, int> rhs) {\n   return (lhs.first != rhs.first) ? (lhs.first < rhs.first)\n                                   : (lhs.second < rhs.second);\n }\n set<pair<int, int> > 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 <bits/stdc++.h>\n using namespace std;\n map<char, char> 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 <bits/stdc++.h>\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<int, int> 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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, x[100], s[100];\n struct par {\n   int v, id;\n   bool operator<(const par &r) const { return v < r.v; }\n };\n vector<par> v;\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &x[i]);\n     v.push_back({x[i], i});\n   }\n   sort(v.begin(), v.end());\n   vector<par> v1 = v;\n   rotate(v1.begin(), v1.begin() + 1, v1.end());\n   for (int i = 0; i < (int)v.size(); i++) s[v[i].id] = v1[i].v;\n   for (int i = 0; i < n; i++) {\n     printf('%d', s[i]);\n     i == n - 1 ? printf('\n') : printf(' ');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int oo = 3e5 + 7;\n unordered_map<int, vector<int>> values[2];\n int t, n, q, a[oo], p[oo];\n vector<int> ans;\n int psum(int l, int r) { return p[r] - (l ? p[l - 1] : 0); }\n int first(vector<int>& list, int val) {\n   int l = 0, r = list.size();\n   while (l < r) {\n     int s = (l + r) / 2;\n     if (list[s] >= val)\n       r = s;\n     else\n       l = s + 1;\n   }\n   if (l == list.size()) return n * 2;\n   return list[l];\n }\n void problem(int l, int r) {\n   int sum = psum(l, r);\n   if (sum == 0) return;\n   if (sum % 2 == 0) {\n     ans.push_back(r);\n     problem(l, r - 1);\n     return;\n   }\n   int pl = p[l] - a[l];\n   int vals[2] = {pl + (sum + 1) / 2 - 1, pl + (sum - 1) / 2 + 1};\n   for (int i = 0; i < 2; i++) {\n     int pans = first(values[i][vals[i]], l);\n     if (pans <= r) {\n       ans.push_back(pans);\n       return;\n     }\n   }\n   throw 69;\n }\n void solve() {\n   cin >> n >> q;\n   string ss;\n   cin >> ss;\n   for (int i = 0; i < n; i++)\n     a[i] = (ss[i] == '+' ? 1 : -1) * (i % 2 == 0 ? -1 : 1);\n   p[0] = a[0];\n   for (int i = 1; i < n; i++) p[i] = p[i - 1] + a[i];\n   for (int i = 0; i < n; i++) values[(a[i] + 1) / 2][p[i]].push_back(i);\n   while (q--) {\n     int l, r;\n     cin >> l >> r;\n     l--, r--;\n     problem(l, r);\n     cout << ans.size() << endl;\n     for (int e : ans) cout << e + 1 << ' ';\n     cout << endl;\n     ans.clear();\n   }\n   values[0].clear();\n   values[1].clear();\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> t;\n   while (t--) solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[1050], b[1050];\n int main() {\n   int n, m, s = 0, d = 0;\n   cin >> n >> m;\n   for (int i = 0; i < m; i++) {\n     cin >> a[i];\n     b[i] = a[i];\n   }\n   for (int i = 1; i <= n; i++) {\n     sort(a, a + m);\n     for (int j = 0; j < m; j++) {\n       if (a[j] > 0) {\n         s += a[j];\n         a[j]--;\n         break;\n       }\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     sort(b, b + m);\n     for (int j = m - 1; j >= 0; j--) {\n       if (b[j] > 0) {\n         d += b[j];\n         b[j]--;\n         break;\n       }\n     }\n   }\n   cout << d << ' ' << s;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mx(long long a, long long b) { return a >= b ? a : b; }\n long long mn(long long a, long long b) { return a <= b ? a : b; }\n string a[3] = {('twone'), ('two'), ('one')};\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long t, x;\n   cin >> t;\n   while (t--) {\n     string str, str2;\n     long long ans = 0;\n     vector<long long> v;\n     cin >> str;\n     if (str.size() <= 2) {\n       cout << 0 << '\n'\n            << '\n';\n       continue;\n     }\n     for (long long i = 0; i < str.size() - 2; i++) {\n       if (str[i] == 't' and str[i + 1] == 'w' and str[i + 2] == 'o' and\n           str[i + 3] == 'n' and str[i + 4] == 'e')\n         str[i + 2] = 'l', ans++, v.push_back(i + 3);\n       if (str[i] == 't' and str[i + 1] == 'w' and str[i + 2] == 'o')\n         ans++, str[i + 1] = 'l', v.push_back(i + 2);\n       if (str[i] == 'o' and str[i + 1] == 'n' and str[i + 2] == 'e')\n         ans++, str[i + 1] = 'l', v.push_back(i + 2);\n     }\n     cout << ans << '\n';\n     for (long long i = 0; i < v.size(); i++) cout << v[i] << ' ';\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a;\n   cin >> a;\n   int max = 0;\n   vector<int> b;\n   int x;\n   for (int i = 0; i < a; i++) {\n     cin >> x;\n     b.push_back(x);\n   }\n   sort(b.begin() + 1, b.end());\n   int count = 0;\n   if (b[0] > b[b.size() - 1]) {\n     cout << '0';\n   } else {\n     while (1) {\n       b[b.size() - 1]--;\n       count++;\n       b[0] = b[0] + 1;\n       sort(b.begin() + 1, b.end());\n       if (b[0] > b[b.size() - 1]) {\n         cout << count;\n         break;\n       }\n     }\n   }\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int vet[1010], dp[2][1010];\n const int mod = 998244353;\n long long soma(long long x, long long y) {\n   x += y;\n   if (x >= mod) x -= mod;\n   return x;\n }\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> vet[i];\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       dp[1][j] = dp[0][j];\n     }\n     if (vet[i] < n and vet[i] > 0) {\n       dp[1][vet[i]] = soma(soma(dp[0][0], 1), dp[1][vet[i]]);\n     }\n     for (int k = 0; k < n; k++) {\n       dp[1][k] = soma(dp[1][k], dp[0][k + 1]);\n     }\n     swap(dp[0], dp[1]);\n   }\n   cout << dp[0][0] << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class node>\n struct link_cut_tree {\n   bool connected(node* u, node* v) { return lca(u, v) != NULL; }\n   int depth(node* u) {\n     access(u);\n     return get_sz(u->ch[0]);\n   }\n   node* get_root(node* u) {\n     access(u);\n     while (u->ch[0]) u = u->ch[0], u->push();\n     return access(u), u;\n   }\n   node* ancestor(node* u, int k) {\n     k = depth(u) - k;\n     for (;; u->push()) {\n       int sz = get_sz(u->ch[0]);\n       if (sz == k) return access(u), u;\n       if (sz < k)\n         k -= sz + 1, u = u->ch[1];\n       else\n         u = u->ch[0];\n     }\n   }\n   node* lca(node* u, node* v) {\n     if (u == v) return u;\n     access(u);\n     access(v);\n     if (!u->p) return NULL;\n     u->splay();\n     return u->p ?: u;\n   }\n   void link(node* u, node* v) {\n     make_root(v);\n     access(u);\n     set_link(v, u, 0);\n     v->update();\n   }\n   void cut(node* u) {\n     access(u);\n     u->ch[0]->p = NULL;\n     u->ch[0] = NULL;\n     u->update();\n   }\n   void cut(node* u, node* v) { cut(depth(u) > depth(v) ? u : v); }\n   void make_root(node* u) {\n     access(u);\n     u->rev ^= 1;\n     access(u);\n   }\n   void access(node* u) {\n     for (node *v = u, *pre = NULL; v; v = v->p) {\n       v->splay();\n       if (pre) v->update_vsub(pre, false);\n       if (v->ch[1]) v->update_vsub(v->ch[1], true);\n       v->ch[1] = pre;\n       v->update();\n       pre = v;\n     }\n     u->splay();\n   }\n   node* operator[](int i) { return &data[i]; }\n   int operator[](node* i) { return i - &data[0]; }\n   vector<node> data;\n   link_cut_tree(int n) : data(n) {}\n };\n template <typename pnode>\n struct splay_tree {\n   pnode ch[2], p;\n   bool rev;\n   int sz;\n   splay_tree() {\n     ch[0] = ch[1] = p = NULL;\n     rev = 0;\n     sz = 1;\n   }\n   friend int get_sz(pnode u) { return u ? u->sz : 0; }\n   virtual void update() {\n     if (ch[0]) ch[0]->push();\n     if (ch[1]) ch[1]->push();\n     sz = 1 + get_sz(ch[0]) + get_sz(ch[1]);\n   }\n   virtual void push() {\n     if (rev) {\n       if (ch[0]) ch[0]->rev ^= 1;\n       if (ch[1]) ch[1]->rev ^= 1;\n       swap(ch[0], ch[1]);\n       rev = 0;\n     }\n   }\n   int dir() {\n     if (!p) return -2;\n     if (p->ch[0] == this) return 0;\n     if (p->ch[1] == this) return 1;\n     return -1;\n   }\n   bool is_root() { return dir() < 0; }\n   friend void set_link(pnode u, pnode v, int d) {\n     if (v) v->p = u;\n     if (d >= 0) u->ch[d] = v;\n   }\n   void rotate() {\n     int x = dir();\n     pnode g = p;\n     set_link(g->p, static_cast<pnode>(this), g->dir());\n     set_link(g, ch[x ^ 1], x);\n     set_link(static_cast<pnode>(this), g, x ^ 1);\n     g->update();\n     update();\n   }\n   void splay() {\n     while (!is_root() && !p->is_root()) {\n       p->p->push(), p->push(), push();\n       dir() == p->dir() ? p->rotate() : rotate();\n       rotate();\n     }\n     if (!is_root()) p->push(), push(), rotate();\n     push();\n   }\n };\n struct node;\n node* root;\n bool capture;\n vector<pair<int, int>> vec;\n struct node : splay_tree<node*> {\n   using splay_tree::ch;\n   int val, lazy;\n   node() : splay_tree() {\n     val = -1e9;\n     lazy = -1;\n   }\n   void update() override { splay_tree::update(); }\n   void update_vsub(node* v, bool add) {\n     if (!add && capture) vec.push_back({this - root, val});\n   }\n   void push() override {\n     splay_tree::push();\n     if (lazy != -1) {\n       val = lazy;\n       if (ch[0]) ch[0]->lazy = lazy;\n       if (ch[1]) ch[1]->lazy = lazy;\n       lazy = -1;\n     }\n   }\n };\n int main() {\n   ios_base::sync_with_stdio(0), cin.tie(0);\n   int n, m;\n   cin >> n >> m;\n   vector<vector<pair<int, int>>> adj(n);\n   for (int i = 1, u, v, w; i < n; ++i) {\n     cin >> u >> v >> w;\n     --u, --v;\n     adj[u].push_back({v, w});\n   }\n   vector<long long> dist(n);\n   vec.reserve(n);\n   link_cut_tree<node> lct(n);\n   function<void(int)> dfs_access = [&](int u) {\n     for (auto v : adj[u]) {\n       dist[v.first] = dist[u] + v.second;\n       lct.link(lct[u], lct[v.first]);\n       dfs_access(v.first);\n     }\n   };\n   dfs_access(0);\n   root = lct[0];\n   vector<pair<long long, long long>> s;\n   for (int i = 0, d, t; i < m; ++i) {\n     cin >> d >> t;\n     --d;\n     auto u = lct[d], v = u;\n     while (!v->is_root()) v = v->p, v->push();\n     while (v->ch[1]) v = v->ch[1], v->push();\n     vec.clear();\n     capture = true;\n     lct.access(u);\n     capture = false;\n     for (auto x : vec)\n       s.push_back({dist[x.first] + x.second, dist[x.first] + t});\n     int val = u->val;\n     u->lazy = t;\n     u->push();\n     u->val = val;\n     lct.access(v);\n   }\n   long long explosion = -1, changes = s.size();\n   sort(s.begin(), s.end());\n   priority_queue<long long, vector<long long>, greater<long long>> pq;\n   for (long long t = 1, i = 0; i < s.size() || !pq.empty();) {\n     if (pq.empty() && t <= s[i].first) t = s[i].first + 1;\n     while (i < s.size() && s[i].first < t) pq.push(s[i].second), ++i;\n     if (t > pq.top()) {\n       explosion = t - 1;\n       break;\n     }\n     pq.pop();\n     ++t;\n   }\n   if (explosion != -1)\n     changes -= count_if(s.begin(), s.end(), [&](pair<long long, long long> x) {\n       return x.second >= explosion;\n     });\n   cout << explosion << ' ' << changes << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O2')\n using namespace std;\n const int N = 1e5 + 10;\n const long long mod = 1e9 + 7;\n const long long mod2 = 998244353;\n const int inf = 1e9;\n const int LOG = 22;\n long long pw(long long a, long long b, long long M) {\n   return (!b ? 1\n              : (b & 1 ? (a * pw(a * a % M, b / 2, M)) % M\n                       : pw(a * a % M, b / 2, M)));\n }\n struct node {\n   int mx1, mx2, cnt, lz;\n   long long sum;\n   node(int m1 = -inf, int m2 = -inf, int c = 0, int l = inf, long long s = 0) {\n     mx1 = m1, mx2 = m2, cnt = c, lz = l, sum = s;\n   }\n   friend node operator|(node L, node R) {\n     if (L.mx1 < R.mx1) swap(L, R);\n     if (L.mx1 == R.mx1)\n       L.cnt += R.cnt;\n     else\n       L.mx2 = max(L.mx2, R.mx1);\n     L.mx2 = max(L.mx2, R.mx2);\n     L.sum += R.sum;\n     L.lz = inf;\n     return L;\n   }\n };\n struct segment_beats {\n   node seg[N << 2];\n   void shift(int v, int lz) {\n     seg[v].lz = min(seg[v].lz, lz);\n     seg[v].sum -= 1ll * seg[v].cnt * max(0, seg[v].mx1 - lz);\n     seg[v].mx1 = min(seg[v].mx1, lz);\n   }\n   void second(int v, int tl, int tr) {\n     if (tl == tr) return;\n     shift(v << 1, seg[v].lz);\n     shift(v << 1 | 1, seg[v].lz);\n   }\n   void change(int p, int x, int v = 1, int tl = 1, int tr = N - 1) {\n     second(v, tl, tr);\n     if (p > tr || p < tl) return;\n     if (tl == tr) {\n       seg[v] = node(x, -inf, 1, inf, x);\n       return;\n     }\n     int mid = (tl + tr) >> 1;\n     change(p, x, v << 1, tl, mid), change(p, x, v << 1 | 1, mid + 1, tr);\n     seg[v] = seg[v << 1] | seg[v << 1 | 1];\n   }\n   void upd(int l, int r, int x, int v = 1, int tl = 1, int tr = N - 1) {\n     second(v, tl, tr);\n     if (l > tr || r < tl || l > r || seg[v].mx1 <= x) return;\n     if (l <= tl && tr <= r && seg[v].mx2 < x) {\n       shift(v, x);\n       return;\n     }\n     int mid = (tl + tr) >> 1;\n     upd(l, r, x, v << 1, tl, mid), upd(l, r, x, v << 1 | 1, mid + 1, tr);\n     seg[v] = seg[v << 1] | seg[v << 1 | 1];\n   }\n   long long get(int l, int r, int v = 1, int tl = 1, int tr = N - 1) {\n     second(v, tl, tr);\n     if (l > tr || r < tl || l > r) return 0ll;\n     if (l <= tl && tr <= r) {\n       return seg[v].sum;\n     }\n     int mid = (tl + tr) >> 1;\n     return get(l, r, v << 1, tl, mid) + get(l, r, v << 1 | 1, mid + 1, tr);\n   }\n } seg1, seg2;\n struct segment {\n   int lz[N << 2];\n   segment() {\n     for (int i = 0; i < N << 2; i++) lz[i] = inf;\n   }\n   void upd(int l, int r, int x, int v = 1, int tl = 1, int tr = N - 1) {\n     if (l > tr || r < tl || l > r) return;\n     if (l <= tl && tr <= r) {\n       lz[v] = min(lz[v], x);\n       return;\n     }\n     int mid = (tl + tr) >> 1;\n     upd(l, r, x, v << 1, tl, mid), upd(l, r, x, v << 1 | 1, mid + 1, tr);\n   }\n   int ask(int p, int v = 1, int tl = 1, int tr = N - 1) {\n     if (tl == tr) {\n       return lz[v];\n     }\n     int mid = (tl + tr) >> 1;\n     if (p <= mid) {\n       return min(lz[v], ask(p, v << 1, tl, mid));\n     }\n     return min(lz[v], ask(p, v << 1 | 1, mid + 1, tr));\n   }\n } Seg1, Seg2;\n set<int> st1, st2;\n int main() {\n   for (int i = 1; i < N; i++) st1.insert(i), st2.insert(i);\n   int n;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     int tp, l, r;\n     scanf('%d%d%d', &tp, &l, &r);\n     r--;\n     if (tp == 1) {\n       int x;\n       scanf('%d', &x);\n       if (x < 0) {\n         x = abs(x);\n         seg1.upd(l, r, x);\n         Seg1.upd(l, r, x);\n         while (1) {\n           auto it = st1.lower_bound(l);\n           if (it == st1.end() || *it > r) break;\n           int cu = *it;\n           st1.erase(cu);\n           if (st2.count(cu) == 0) {\n             seg1.change(cu, x);\n             seg2.change(cu, Seg2.ask(cu));\n           }\n         }\n       } else {\n         seg2.upd(l, r, x);\n         Seg2.upd(l, r, x);\n         while (1) {\n           auto it = st2.lower_bound(l);\n           if (it == st2.end() || *it > r) break;\n           int cu = *it;\n           st2.erase(cu);\n           if (st1.count(cu) == 0) {\n             seg2.change(cu, x);\n             seg1.change(cu, Seg1.ask(cu));\n           }\n         }\n       }\n     } else {\n       printf('%lld\n', seg1.get(l, r) + seg2.get(l, r));\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1LL << 60;\n string operator*(const string& s, int k) {\n   if (k == 0) return '';\n   string p = (s + s) * (k / 2);\n   if (k % 2 == 1) p += s;\n   return p;\n }\n template <class T>\n inline bool chmin(T& a, T b) {\n   if (a > b) {\n     a = b;\n     return true;\n   }\n   return false;\n }\n template <class T>\n inline bool chmax(T& a, T b) {\n   if (a < b) {\n     a = b;\n     return true;\n   }\n   return false;\n }\n struct Edge {\n   long long to, cap, rev;\n   Edge(long long _to, long long _cap, long long _rev) {\n     to = _to;\n     cap = _cap;\n     rev = _rev;\n   }\n };\n void add_edge(vector<vector<Edge>>& G, long long from, long long to,\n               long long cap, bool revFlag, long long revCap) {\n   G[from].push_back(Edge(to, cap, (long long)G[to].size()));\n   if (revFlag)\n     G[to].push_back(Edge(from, revCap, (long long)G[from].size() - 1));\n }\n long long max_flow_dfs(vector<vector<Edge>>& G, long long v, long long t,\n                        long long f, vector<bool>& used) {\n   if (v == t) return f;\n   used[v] = true;\n   for (int i = 0; i < G[v].size(); ++i) {\n     Edge& e = G[v][i];\n     if (!used[e.to] && e.cap > 0) {\n       long long d = max_flow_dfs(G, e.to, t, min(f, e.cap), used);\n       if (d > 0) {\n         e.cap -= d;\n         G[e.to][e.rev].cap += d;\n         return d;\n       }\n     }\n   }\n   return 0;\n }\n long long max_flow(vector<vector<Edge>>& G, long long s, long long t) {\n   long long flow = 0;\n   for (;;) {\n     vector<bool> used(G.size());\n     for (int(i) = (int)(0); i < (int)(used.size()); i++) used[i] = false;\n     long long f = max_flow_dfs(G, s, t, INF, used);\n     if (f == 0) {\n       return flow;\n     }\n     flow += f;\n   }\n }\n void BellmanFord(vector<vector<Edge>>& G, long long s, vector<long long>& d,\n                  vector<long long>& negative) {\n   d.resize(G.size());\n   negative.resize(G.size());\n   for (int(i) = (int)(0); i < (int)(d.size()); i++) d[i] = INF;\n   for (int(i) = (int)(0); i < (int)(d.size()); i++) negative[i] = false;\n   d[s] = 0;\n   for (int(k) = (int)(0); k < (int)(G.size() - 1); k++) {\n     for (int(i) = (int)(0); i < (int)(G.size()); i++) {\n       for (int(j) = (int)(0); j < (int)(G[i].size()); j++) {\n         if (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {\n           d[G[i][j].to] = d[i] + G[i][j].cap;\n         }\n       }\n     }\n   }\n   for (int(k) = (int)(0); k < (int)(G.size() - 1); k++) {\n     for (int(i) = (int)(0); i < (int)(G.size()); i++) {\n       for (int(j) = (int)(0); j < (int)(G[i].size()); j++) {\n         if (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {\n           d[G[i][j].to] = d[i] + G[i][j].cap;\n           negative[G[i][j].to] = true;\n         }\n         if (negative[i] == true) negative[G[i][j].to] = true;\n       }\n     }\n   }\n }\n void Dijkstra(vector<vector<Edge>>& G, long long s, vector<long long>& d) {\n   d.resize(G.size());\n   for (int(i) = (int)(0); i < (int)(d.size()); i++) d[i] = INF;\n   d[s] = 0;\n   priority_queue<pair<long long, long long>, vector<pair<long long, long long>>,\n                  greater<pair<long long, long long>>>\n       q;\n   q.push(make_pair(0, s));\n   while (!q.empty()) {\n     pair<long long, long long> a = q.top();\n     q.pop();\n     if (d[a.second] < a.first) continue;\n     for (int(i) = (int)(0); i < (int)(G[a.second].size()); i++) {\n       Edge e = G[a.second][i];\n       if (d[e.to] > d[a.second] + e.cap) {\n         d[e.to] = d[a.second] + e.cap;\n         q.push(make_pair(d[e.to], e.to));\n       }\n     }\n   }\n }\n void WarshallFloyd(vector<vector<Edge>>& G, vector<vector<long long>>& d) {\n   d.resize(G.size());\n   for (int(i) = (int)(0); i < (int)(d.size()); i++) d[i].resize(G.size());\n   for (int(i) = (int)(0); i < (int)(d.size()); i++) {\n     for (int(j) = (int)(0); j < (int)(d[i].size()); j++) {\n       d[i][j] = INF;\n     }\n   }\n   for (int(i) = (int)(0); i < (int)(G.size()); i++) {\n     for (int(j) = (int)(0); j < (int)(G[i].size()); j++) {\n       d[i][G[i][j].to] = G[i][j].cap;\n     }\n   }\n   for (int(i) = (int)(0); i < (int)(G.size()); i++) {\n     for (int(j) = (int)(0); j < (int)(G.size()); j++) {\n       for (int(k) = (int)(0); k < (int)(G.size()); k++) {\n         chmin(d[j][k], d[j][i] + d[i][k]);\n       }\n     }\n   }\n }\n bool tsort(vector<vector<Edge>>& graph, vector<int>& order) {\n   int n = graph.size(), k = 0;\n   vector<long long> in(n);\n   for (auto& es : graph)\n     for (auto& e : es) in[e.to]++;\n   priority_queue<long long, vector<long long>, greater<long long>> que;\n   for (int(i) = (int)(0); i < (int)(n); i++)\n     if (in[i] == 0) que.push(i);\n   while (que.size()) {\n     int v = que.top();\n     que.pop();\n     order.push_back(v);\n     for (auto& e : graph[v])\n       if (--in[e.to] == 0) que.push(e.to);\n   }\n   if (order.size() != n)\n     return false;\n   else\n     return true;\n }\n class lca {\n  public:\n   const int n = 0;\n   const int log2_n = 0;\n   std::vector<std::vector<int>> parent;\n   std::vector<int> depth;\n   lca() {}\n   lca(const vector<vector<Edge>>& g, int root)\n       : n(g.size()),\n         log2_n(log2(n) + 1),\n         parent(log2_n, std::vector<int>(n)),\n         depth(n) {\n     dfs(g, root, -1, 0);\n     for (int k = 0; k + 1 < log2_n; k++) {\n       for (int v = 0; v < (int)g.size(); v++) {\n         if (parent[k][v] < 0)\n           parent[k + 1][v] = -1;\n         else\n           parent[k + 1][v] = parent[k][parent[k][v]];\n       }\n     }\n   }\n   void dfs(const vector<vector<Edge>>& g, int v, int p, int d) {\n     parent[0][v] = p;\n     depth[v] = d;\n     for (auto& e : g[v]) {\n       if (e.to != p) dfs(g, e.to, v, d + 1);\n     }\n   }\n   int get(int u, int v) {\n     if (depth[u] > depth[v]) std::swap(u, v);\n     for (int k = 0; k < log2_n; k++) {\n       if ((depth[v] - depth[u]) >> k & 1) {\n         v = parent[k][v];\n       }\n     }\n     if (u == v) return u;\n     for (int k = log2_n - 1; k >= 0; k--) {\n       if (parent[k][u] != parent[k][v]) {\n         u = parent[k][u];\n         v = parent[k][v];\n       }\n     }\n     return parent[0][u];\n   }\n };\n class UnionFind {\n   vector<int> data;\n   long long num;\n \n  public:\n   UnionFind(int size) : data(size, -1), num(size) {}\n   bool unite(int x, int y) {\n     x = root(x);\n     y = root(y);\n     if (x != y) {\n       if (data[y] < data[x]) swap(x, y);\n       data[x] += data[y];\n       data[y] = x;\n     }\n     num -= (x != y);\n     return x != y;\n   }\n   bool findSet(int x, int y) { return root(x) == root(y); }\n   int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }\n   int size(int x) { return -data[root(x)]; }\n   int numSet() { return num; }\n };\n class SumSegTree {\n  private:\n   long long _sum(long long a, long long b, long long k, long long l,\n                  long long r) {\n     if (r <= a || b <= l) return 0;\n     if (a <= l && r <= b)\n       return dat[k];\n     else {\n       long long s1 = _sum(a, b, 2 * k + 1, l, (l + r) / 2);\n       long long s2 = _sum(a, b, 2 * k + 2, (l + r) / 2, r);\n       return s1 + s2;\n     }\n   }\n \n  public:\n   long long n, height;\n   vector<long long> dat;\n   SumSegTree(long long _n) {\n     n = 1;\n     height = 1;\n     while (n < _n) {\n       n *= 2;\n       height++;\n     }\n     dat = vector<long long>(2 * n - 1, 0);\n   }\n   void add(long long i, long long x) {\n     i += n - 1;\n     dat[i] += x;\n     while (i > 0) {\n       i = (i - 1) / 2;\n       dat[i] += x;\n     }\n   }\n   long long sum(long long a, long long b) { return _sum(a, b, 0, 0, n); }\n };\n class RmqTree {\n  private:\n   long long _find(long long a, long long b, long long k, long long l,\n                   long long r) {\n     if (r <= a || b <= l) return INF;\n     if (a <= l && r <= b)\n       return dat[k];\n     else {\n       long long s1 = _find(a, b, 2 * k + 1, l, (l + r) / 2);\n       long long s2 = _find(a, b, 2 * k + 2, (l + r) / 2, r);\n       return min(s1, s2);\n     }\n   }\n \n  public:\n   long long n, height;\n   vector<long long> dat;\n   RmqTree(long long _n) {\n     n = 1;\n     height = 1;\n     while (n < _n) {\n       n *= 2;\n       height++;\n     }\n     dat = vector<long long>(2 * n - 1, INF);\n   }\n   void update(long long i, long long x) {\n     i += n - 1;\n     dat[i] = x;\n     while (i > 0) {\n       i = (i - 1) / 2;\n       dat[i] = min(dat[i * 2 + 1], dat[i * 2 + 2]);\n     }\n   }\n   long long find(long long a, long long b) { return _find(a, b, 0, 0, n); }\n };\n void divisor(long long n, vector<long long>& ret) {\n   for (long long i = 1; i * i <= n; i++) {\n     if (n % i == 0) {\n       ret.push_back(i);\n       if (i * i != n) ret.push_back(n / i);\n     }\n   }\n   sort(ret.begin(), ret.end());\n }\n vector<long long> lis_fast(const vector<long long>& a) {\n   const long long n = a.size();\n   vector<long long> A(n, INT_MAX);\n   vector<long long> id(n);\n   for (int i = 0; i < n; ++i) {\n     id[i] = distance(A.begin(), lower_bound(A.begin(), A.end(), a[i]));\n     A[id[i]] = a[i];\n   }\n   long long m = *max_element(id.begin(), id.end());\n   vector<long long> b(m + 1);\n   for (int i = n - 1; i >= 0; --i)\n     if (id[i] == m) b[m--] = a[i];\n   return b;\n }\n bool z_algorithm(string& str, vector<int>& z, long long s) {\n   const int L = str.size();\n   z.resize(str.size());\n   for (int i = 1, left = 0, right = 0; i < L; i++) {\n     if (i > right) {\n       left = right = i;\n       for (; right < L && str[right - left] == str[right]; right++)\n         ;\n       z[i] = right - left;\n       right--;\n     } else {\n       int k = i - left;\n       if (z[k] < right - i + 1) {\n         z[i] = z[k];\n       } else {\n         left = i;\n         for (; right < L && str[right - left] == str[right]; right++)\n           ;\n         z[i] = right - left;\n         right--;\n       }\n     }\n     if (z[i] == s) return true;\n   }\n   return false;\n }\n bool z_algorithm(string& str, vector<int>& z) {\n   const int L = str.size();\n   z.resize(str.size());\n   for (int i = 1, left = 0, right = 0; i < L; i++) {\n     if (i > right) {\n       left = right = i;\n       for (; right < L && str[right - left] == str[right]; right++)\n         ;\n       z[i] = right - left;\n       right--;\n     } else {\n       int k = i - left;\n       if (z[k] < right - i + 1) {\n         z[i] = z[k];\n       } else {\n         left = i;\n         for (; right < L && str[right - left] == str[right]; right++)\n           ;\n         z[i] = right - left;\n         right--;\n       }\n     }\n   }\n   return true;\n }\n struct RollingHash {\n   static const int base1 = 1007, base2 = 2009;\n   static const int mod1 = 1000000007, mod2 = 1000000009;\n   vector<long long> hash1, hash2, power1, power2;\n   RollingHash(const string& S) {\n     int n = (int)S.size();\n     hash1.assign(n + 1, 0);\n     hash2.assign(n + 1, 0);\n     power1.assign(n + 1, 1);\n     power2.assign(n + 1, 1);\n     for (int i = 0; i < n; ++i) {\n       hash1[i + 1] = (hash1[i] * base1 + S[i]) % mod1;\n       hash2[i + 1] = (hash2[i] * base2 + S[i]) % mod2;\n       power1[i + 1] = (power1[i] * base1) % mod1;\n       power2[i + 1] = (power2[i] * base2) % mod2;\n     }\n   }\n   inline pair<long long, long long> get(int l, int r) const {\n     long long res1 = hash1[r] - hash1[l] * power1[r - l] % mod1;\n     if (res1 < 0) res1 += mod1;\n     long long res2 = hash2[r] - hash2[l] * power2[r - l] % mod2;\n     if (res2 < 0) res2 += mod2;\n     return {res1, res2};\n   }\n   inline int getLCP(int a, int b) const {\n     int len = min((int)hash1.size() - a, (int)hash1.size() - b);\n     int low = 0, high = len;\n     while (high - low > 1) {\n       int mid = (low + high) >> 1;\n       if (get(a, a + mid) != get(b, b + mid))\n         high = mid;\n       else\n         low = mid;\n     }\n     return low;\n   }\n };\n long long mod_pow(long long x, long long n, long long mod) {\n   long long res = 1LL;\n   while (n > 0) {\n     if (n & 1) res = res * x % mod;\n     x = x * x % mod;\n     n >>= 1;\n   }\n   return res;\n }\n long long mod_inv(long long x, long long mod) {\n   return mod_pow(x, mod - 2, mod);\n }\n class Combination {\n  public:\n   vector<long long> fact;\n   vector<long long> inv;\n   long long mod;\n   long long mod_inv(long long x) {\n     long long n = mod - 2LL;\n     long long res = 1LL;\n     while (n > 0) {\n       if (n & 1) res = res * x % mod;\n       x = x * x % mod;\n       n >>= 1;\n     }\n     return res;\n   }\n   long long nCr(long long n, long long r) {\n     return ((fact[n] * inv[r] % mod) * inv[n - r]) % mod;\n   }\n   long long nPr(long long n, long long r) {\n     return (fact[n] * inv[n - r]) % mod;\n   }\n   long long nHr(long long n, long long r) { return nCr(r + n - 1, r); }\n   Combination(long long n, long long _mod) {\n     mod = _mod;\n     fact.resize(n + 1);\n     fact[0] = 1;\n     for (int(i) = (int)(0); i < (int)(n); i++) {\n       fact[i + 1] = (fact[i] * (i + 1LL)) % mod;\n     }\n     inv.resize(n + 1);\n     for (int(i) = (int)(0); i < (int)(n + 1); i++) {\n       inv[i] = mod_inv(fact[i]);\n     }\n   }\n };\n long long gcd(long long m, long long n) {\n   if (n == 0) return m;\n   return gcd(n, m % n);\n }\n long long lcm(long long m, long long n) { return m / gcd(m, n) * n; }\n vector<vector<long long>> mIdentity(long long n) {\n   vector<vector<long long>> A(n, vector<long long>(n));\n   for (int i = 0; i < n; ++i) A[i][i] = 1;\n   return A;\n }\n vector<vector<long long>> mMul(const vector<vector<long long>>& A,\n                                const vector<vector<long long>>& B) {\n   vector<vector<long long>> C(A.size(), vector<long long>(B[0].size()));\n   for (int i = 0; i < C.size(); ++i)\n     for (int j = 0; j < C[i].size(); ++j)\n       for (int k = 0; k < A[i].size(); ++k)\n         (C[i][j] += (A[i][k] % 1000000007) * (B[k][j] % 1000000007)) %=\n             1000000007;\n   return C;\n }\n vector<vector<long long>> mPow(const vector<vector<long long>>& A,\n                                long long e) {\n   return e == 0       ? mIdentity(A.size())\n          : e % 2 == 0 ? mPow(mMul(A, A), e / 2)\n                       : mMul(A, mPow(A, e - 1));\n }\n template <class T>\n class RectangleSum {\n  public:\n   vector<vector<T>> sum;\n   T GetSum(int left, int right, int top, int bottom) {\n     T res = sum[bottom][right];\n     if (left > 0) res -= sum[bottom][left - 1];\n     if (top > 0) res -= sum[top - 1][right];\n     if (left > 0 && top > 0) res += sum[top - 1][left - 1];\n     return res;\n   }\n   RectangleSum(const vector<vector<T>>& s, int h, int w) {\n     sum.resize(h);\n     for (int i = 0; i < h; i++) sum[i].resize(w, 0);\n     for (int y = 0; y < h; y++) {\n       for (int x = 0; x < w; x++) {\n         sum[y][x] = s[y][x];\n         if (y > 0) sum[y][x] += sum[y - 1][x];\n         if (x > 0) sum[y][x] += sum[y][x - 1];\n         if (y > 0 && x > 0) sum[y][x] -= sum[y - 1][x - 1];\n       }\n     }\n   }\n };\n long long _garner(vector<long long>& xs, vector<long long>& mods) {\n   int M = xs.size();\n   vector<long long> coeffs(M, 1), constants(M, 0);\n   for (int i = 0; i < M - 1; ++i) {\n     long long mod_i = mods[i];\n     long long v = (xs[i] - constants[i] + mod_i) % mod_i;\n     v = (v * mod_pow(coeffs[i], mod_i - 2, mod_i)) % mod_i;\n     for (int j = i + 1; j < M; j++) {\n       long long mod_j = mods[j];\n       constants[j] = (constants[j] + coeffs[j] * v) % mod_j;\n       coeffs[j] = (coeffs[j] * mod_i) % mod_j;\n     }\n   }\n   return constants.back();\n }\n template <typename T>\n inline void bit_reverse(vector<T>& a) {\n   int n = a.size();\n   int i = 0;\n   for (int j = 1; j < n - 1; ++j) {\n     for (int k = n >> 1; k > (i ^= k); k >>= 1)\n       ;\n     if (j < i) swap(a[i], a[j]);\n   }\n }\n template <long long mod, long long primitive_root>\n class NTT {\n  public:\n   long long get_mod() { return mod; }\n   void _ntt(vector<long long>& a, int sign) {\n     const int n = a.size();\n     assert((n ^ (n & -n)) == 0);\n     const long long g = primitive_root;\n     long long tmp = (mod - 1) * mod_pow(n, mod - 2, mod) % mod;\n     long long h = mod_pow(g, tmp, mod);\n     if (sign == -1) h = mod_pow(h, mod - 2, mod);\n     bit_reverse(a);\n     for (int m = 1; m < n; m <<= 1) {\n       const int m2 = 2 * m;\n       long long _base = mod_pow(h, n / m2, mod);\n       long long _w = 1;\n       for (int x = 0; x < m; ++x) {\n         for (int 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) % mod;\n           a[s + m] = (u - d + mod) % mod;\n         }\n         _w = (_w * _base) % mod;\n       }\n     }\n   }\n   void ntt(vector<long long>& input) { _ntt(input, 1); }\n   void intt(vector<long long>& input) {\n     _ntt(input, -1);\n     const long long n_inv = mod_pow(input.size(), mod - 2, mod);\n     for (auto& x : input) x = (x * n_inv) % mod;\n   }\n   vector<long long> convolution(const vector<long long>& a,\n                                 const vector<long long>& b) {\n     int result_size = a.size() + b.size() - 1;\n     int n = 1;\n     while (n < result_size) n <<= 1;\n     vector<long long> _a = a, _b = b;\n     _a.resize(n, 0);\n     _b.resize(n, 0);\n     ntt(_a);\n     ntt(_b);\n     for (int i = 0; i < n; ++i) _a[i] = (_a[i] * _b[i]) % mod;\n     intt(_a);\n     _a.resize(result_size);\n     return _a;\n   }\n };\n vector<long long> convolution_ntt(vector<long long>& a, vector<long long>& b,\n                                   long long mod = 1224736769LL) {\n   for (auto& x : a) x %= mod;\n   for (auto& x : b) x %= mod;\n   long long maxval = max(a.size(), b.size()) *\n                      *max_element(a.begin(), a.end()) *\n                      *max_element(b.begin(), b.end());\n   if (maxval < 1224736769) {\n     NTT<1224736769, 3> ntt3;\n     return ntt3.convolution(a, b);\n   }\n   NTT<167772161, 3> ntt1;\n   NTT<469762049, 3> ntt2;\n   NTT<1224736769, 3> ntt3;\n   vector<long long> x1 = ntt1.convolution(a, b);\n   vector<long long> x2 = ntt2.convolution(a, b);\n   vector<long long> x3 = ntt3.convolution(a, b);\n   vector<long long> ret(x1.size());\n   vector<long long> mods{167772161, 469762049, 1224736769, mod};\n   for (int i = 0; i < x1.size(); ++i) {\n     vector<long long> xs{x1[i], x2[i], x3[i], 0};\n     ret[i] = _garner(xs, mods);\n   }\n   return ret;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   long long n, k;\n   cin >> n >> k;\n   long long mi = (n + 1) * n / 2;\n   long long ma = mi * 2 - (n / 2 + 1) * (n / 2);\n   if (n % 2 == 1) ma -= n / 2 + 1;\n   if (k < mi) {\n     cout << -1 << endl;\n     return 0;\n   }\n   cout << min(k, ma) << endl;\n   for (int(i) = (int)(0); i < (int)(n); i++) cout << i + 1 << ' ';\n   cout << endl;\n   if (k >= ma) {\n     for (int(i) = (int)(0); i < (int)(n); i++) cout << n - i << ' ';\n     cout << endl;\n     return 0;\n   }\n   long long rest = k - mi;\n   vector<long long> ans(n);\n   for (int(i) = (int)(0); i < (int)(n); i++) ans[i] = i + 1;\n   long long now = 0;\n   for (int i = n - 1; i >= 0; i--) {\n     if (rest >= i - now) {\n       swap(ans[i], ans[now]);\n       rest -= i - now;\n     } else {\n       swap(ans[i], ans[i - rest]);\n       break;\n     }\n     now++;\n   }\n   for (int(i) = (int)(0); i < (int)(n); i++) cout << ans[i] << ' ';\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int vis[100005], mark[100005];\n vector<int> g[100005];\n int prob = 0;\n void dfs(int node, int k) {\n   mark[node] = k;\n   vis[node] = 1;\n   for (auto i : g[node]) {\n     if (!vis[i]) {\n       dfs(i, 1 - k);\n     } else {\n       if (mark[i] == k) {\n         prob = 1;\n       }\n     }\n   }\n }\n int main() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < m; i++) {\n     int u, v;\n     scanf('%d', &u);\n     scanf('%d', &v);\n     g[u].push_back(v);\n     g[v].push_back(u);\n   }\n   for (int i = 1; i <= n; i++) {\n     if (!vis[i]) dfs(i, 0);\n   }\n   if (prob) {\n     cout << '-1';\n     return 0;\n   }\n   int k = 0;\n   for (int i = 1; i <= n; i++) {\n     if (mark[i] == 1) k++;\n   }\n   cout << k << '\n';\n   for (int i = 1; i <= n; i++) {\n     if (mark[i] == 1) cout << i << ' ';\n   }\n   cout << '\n';\n   k = 0;\n   for (int i = 1; i <= n; i++) {\n     if (mark[i] == 0) k++;\n   }\n   cout << k << '\n';\n   for (int i = 1; i <= n; i++) {\n     if (mark[i] == 0) cout << i << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n template <typename T>\n T sqr(T x) {\n   return x * x;\n }\n template <typename T>\n T abs(T x) {\n   return x < 0 ? -x : x;\n }\n template <typename T>\n T gcd(T a, T b) {\n   return b ? gcd(b, a % b) : a;\n }\n set<vector<int> > s;\n vector<pair<char, pair<int, int> > > ans;\n bool rec(vector<int>& 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<int> 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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n vector<long long int> 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 <bits/stdc++.h>\n using namespace std;\n const int inf = 0x3f3f3f3f;\n const double eps = 1e-6;\n template <typename A, typename B>\n ostream& operator<<(ostream& os, const pair<A, B>& p) {\n   return os << p.first << ',' << p.second;\n }\n template <typename T>\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<T>& p) const { return x == p.x && y == p.y; }\n };\n template <typename T>\n point<T> operator+(const point<T>& a, const point<T>& b) {\n   return point<T>(a.x + b.x, a.y + b.y);\n }\n template <typename T>\n point<T> operator-(const point<T>& a, const point<T>& b) {\n   return point<T>(a.x - b.x, a.y - b.y);\n }\n template <typename T>\n T scal(const point<T>& a, const point<T>& b) {\n   return a.x * b.x + a.y * b.y;\n }\n template <typename T>\n T vect(const point<T>& a, const point<T>& b) {\n   return a.x * b.y - a.y * b.x;\n }\n template <typename T>\n ostream& operator<<(ostream& os, const point<T>& p) {\n   return os << '(' << p.x << ',' << p.y << ')';\n }\n const int maxn = 100100;\n pair<int, pair<int, int> > 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<int, pair<int, int> >* d1 =\n         lower_bound(b, b + m,\n                     pair<int, pair<int, int> >(\n                         a[i].first, pair<int, int>(a[i].second.first, 0)));\n     pair<int, pair<int, int> >* d2 =\n         lower_bound(b, b + m,\n                     pair<int, pair<int, int> >(\n                         a[i].first - 1, pair<int, int>(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<pair<int, int> > res;\n   set<int> 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<int, int>(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<int, int>(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<int, int>(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<int, int>(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<int, int>(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 <bits/stdc++.h>\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<int> 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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 5e5 + 10;\n int t, n, son[maxn], root, p[maxn], rt;\n vector<int> g[maxn];\n void dfs(int u, int fa) {\n   son[u] = 1;\n   p[u] = fa;\n   for (auto it : g[u]) {\n     if (it == fa) continue;\n     dfs(it, u);\n     son[u] += son[it];\n   }\n }\n void getroot(int u, int fa) {\n   root = u;\n   for (auto it : g[u]) {\n     if (it == fa) continue;\n     if (son[it] > n - son[it]) getroot(it, u);\n   }\n }\n int getleaf(int u, int fa) {\n   if (g[u].size() == 1) return u;\n   for (auto it : g[u]) {\n     if (it == fa) continue;\n     return getleaf(it, u);\n   }\n }\n int main() {\n   scanf('%d', &t);\n   while (t--) {\n     root = rt = 0;\n     scanf('%d', &n);\n     for (int i = 1; i < n; 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     getroot(1, 0);\n     for (auto it : g[root]) {\n       if (it != p[root] && son[it] == n - son[it]) rt = it;\n     }\n     if (!rt) {\n       printf('%d %d\n%d %d\n', root, g[root][0], root, g[root][0]);\n     } else {\n       int l = getleaf(rt, p[rt]);\n       printf('%d %d\n%d %d\n', p[l], l, root, l);\n     }\n     for (int i = 1; i <= n; i++) g[i].clear(), p[i] = 0;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline bool cmax(T &a, const T &b) {\n   return a < b ? a = b, 1 : 0;\n }\n const int N = 444444;\n int fa[N], ch[N][26], l[N], f[N], a[N], c[N], pos[N], top[N];\n char s[N];\n int last = 1, cnt = 1, n, ans = 1;\n void ins(int c, int k) {\n   int p = last, np = ++cnt;\n   last = np, l[np] = l[p] + 1, pos[np] = k;\n   for (; p && !ch[p][c]; p = fa[p]) ch[p][c] = np;\n   if (!p)\n     fa[np] = 1;\n   else {\n     int q = ch[p][c];\n     if (l[q] == l[p] + 1)\n       fa[np] = q;\n     else {\n       int nq = ++cnt;\n       l[nq] = l[p] + 1, pos[nq] = pos[q];\n       memcpy(ch[nq], ch[q], sizeof(ch[q]));\n       fa[nq] = fa[q], fa[np] = fa[q] = nq;\n       for (; ch[p][c] == q; p = fa[p]) ch[p][c] = nq;\n     }\n   }\n }\n void calc() {\n   for (int i = 1; i <= cnt; ++i) ++c[l[i]];\n   for (int i = 1; i <= cnt; ++i) c[i] += c[i - 1];\n   for (int i = 1; i <= cnt; ++i) a[c[l[i]]--] = i;\n }\n int L[N * 25], R[N * 25], rt[N], tot;\n void modify(int &now, int l, int r, int x) {\n   now = ++tot;\n   if (l == r) return;\n   int mid = l + r >> 1;\n   if (x <= mid)\n     modify(L[now], l, mid, x);\n   else\n     modify(R[now], mid + 1, r, x);\n }\n int merge(int x, int y) {\n   if (!x || !y) return x | y;\n   int z = ++tot;\n   L[z] = merge(L[x], L[y]);\n   R[z] = merge(R[x], R[y]);\n   return z;\n }\n int query(int x, int l, int r, int ql, int qr) {\n   if (!x) return 0;\n   if (ql <= l && qr >= r) return 1;\n   int mid = l + r >> 1;\n   if (ql <= mid && query(L[x], l, mid, ql, qr)) return 1;\n   if (qr > mid && query(R[x], mid + 1, r, ql, qr)) return 1;\n   return 0;\n }\n int main() {\n   scanf('%d', &n);\n   scanf('%s', s + 1);\n   for (int i = 1; i <= n; ++i) ins(s[i] - 'a', i), modify(rt[last], 1, n, i);\n   calc();\n   for (int i = cnt; i > 1; --i) rt[fa[a[i]]] = merge(rt[fa[a[i]]], rt[a[i]]);\n   for (int i = 2; i <= cnt; ++i) {\n     int u = a[i], ff = fa[u];\n     if (ff == 1) {\n       f[u] = 1, top[u] = u;\n       continue;\n     }\n     int x = query(rt[top[ff]], 1, n, pos[u] - l[u] + l[top[ff]], pos[u] - 1);\n     if (x)\n       f[u] = f[ff] + 1, top[u] = u;\n     else\n       f[u] = f[ff], top[u] = top[ff];\n     cmax(ans, f[u]);\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double eps = 1e-9;\n const long long MOD = 998244353;\n const long long N = (long long)1e4 + 9;\n const long long inf = 1 << 30;\n template <class T>\n T gcd(T a, T b) {\n   return (b != 0 ? gcd<T>(b, a % b) : a);\n }\n template <class T>\n T lcm(T a, T b) {\n   return (a / gcd<T>(a, b) * b);\n }\n template <typename T>\n T exp(T b, T p) {\n   T x = 1;\n   while (p) {\n     if (p & 1) x = (x * b);\n     b = (b * b);\n     p = p >> 1;\n   }\n   return x;\n }\n inline long long ones(long long n) {\n   long long res = 0;\n   while (n && ++res) n -= n & (-n);\n   return res;\n }\n inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }\n long long mem[109][3];\n long long n, arr[109];\n long long go(long long idx, long long last) {\n   if (idx == n) return 0;\n   long long &ret = mem[idx][last];\n   if (ret != -1) return ret;\n   ret = -inf;\n   if (arr[idx] == 0) ret = go(idx + 1, 0);\n   if (arr[idx] == 3) {\n     if (last != 1) ret = max(ret, 1 + go(idx + 1, 1));\n     if (last != 2) ret = max(ret, 1 + go(idx + 1, 2));\n   }\n   if (arr[idx] == 1) {\n     if (last != 1)\n       ret = 1 + go(idx + 1, 1);\n     else\n       ret = go(idx + 1, 0);\n   }\n   if (arr[idx] == 2) {\n     if (last != 2)\n       ret = 1 + go(idx + 1, 2);\n     else\n       ret = go(idx + 1, 0);\n   }\n   return ret;\n }\n int32_t main() {\n   ios::sync_with_stdio(0);\n   cin.tie(nullptr);\n   cout.tie(0);\n   cin >> n;\n   for (long long i = 0; i < n; ++i) {\n     cin >> arr[i];\n   }\n   memset(mem, -1, sizeof(mem));\n   long long ans = go(0, 0);\n   cout << n - ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double PI = 3.14159265358979323846;\n int a[100010], d[100010];\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++) scanf('%d', a + i);\n   for (int i = 1; i <= n + 1; i++) d[i] = a[i] - a[i - 1];\n   stack<int> st;\n   int r = 0;\n   for (int i = 1; i <= n; i++) {\n     if (d[i] > 0) r += d[i];\n   }\n   cout << r << endl;\n   for (int i = 1; i <= n + 1; i++) {\n     if (d[i] > 0) {\n       for (int j = 0; j < d[i]; j++) {\n         st.push(i);\n       }\n     }\n     if (d[i] < 0) {\n       for (int j = 0; j > d[i]; j--) {\n         printf('%d %d\n', st.top(), i - 1);\n         st.pop();\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, k, q, a, b, ans, t;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> q;\n   while (q--) {\n     cin >> k >> n >> a >> b;\n     ans = a * n;\n     if (b * n >= k)\n       cout << -1 << '\n';\n     else {\n       if (ans < k)\n         cout << n << '\n';\n       else {\n         t = a - b;\n         ans = (ans - k) / t + 1;\n         cout << n - ans << '\n';\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, m, k, x, y, z, a[5005], b[50005], ans, val;\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   cin >> n;\n   for (long long i = 0; i < n; i++) cin >> a[i];\n   cin >> m;\n   for (long long i = 0; i < m; i++) cin >> b[i];\n   sort(a, a + n);\n   sort(b, b + m);\n   cout << a[n - 1] << ' ' << b[m - 1];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = ~0U >> 1;\n const long long INF = ~0ULL >> 1;\n template <class T>\n inline void read(T &n) {\n   char c;\n   int flag = 1;\n   for (c = getchar(); !(c >= '0' && c <= '9' || c == '-'); c = getchar())\n     ;\n   if (c == '-')\n     flag = -1, n = 0;\n   else\n     n = c - '0';\n   for (c = getchar(); c >= '0' && c <= '9'; c = getchar()) n = n * 10 + c - '0';\n   n *= flag;\n }\n const int maxn = 2100000;\n const int mo = 1000000007;\n int N, K, M, ans, vis[1000];\n char s[maxn];\n int nxt[maxn][26];\n int dp[maxn];\n void add(int &x, int y) {\n   x += y;\n   if (x >= mo) x -= mo;\n }\n int main(int argc, char *argv[]) {\n   scanf('%d%d', &N, &K);\n   scanf('%s', s + 1);\n   M = strlen(s + 1);\n   string temp = '';\n   for (int i = (M); i >= (1); --i)\n     if (!vis[s[i]]) vis[s[i]] = true, temp = s[i] + temp;\n   for (int i = ('a'); i <= ('a' + K - 1); ++i)\n     if (!vis[i]) temp = (char)i + temp;\n   for (int i = (0); i < (N); ++i) s[++M] = temp[i % temp.size()];\n   for (int j = (0); j < (K); ++j) nxt[M + 1][j] = M + 1;\n   for (int i = (M); i >= (1); --i) {\n     memcpy(nxt[i], nxt[i + 1], sizeof(nxt[i]));\n     nxt[i][s[i] - 'a'] = i;\n   }\n   int cur = 0;\n   dp[0] = 1;\n   for (int i = (0); i < (M); ++i) {\n     int flag = false;\n     for (int j = (0); j < (K); ++j)\n       if (nxt[i + 1][j] <= M) add(dp[nxt[i + 1][j]], dp[i]);\n   }\n   for (int i = (0); i <= (M); ++i) add(ans, dp[i]);\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int prime = 151;\n const long long mod = 1e9 + 7;\n const int maxn = 1e5 + 5;\n const int inf = 0x3f3f3f3f;\n int slen, tlen;\n string t, s;\n unsigned long long hs1[maxn], base[maxn], hs2[maxn];\n inline unsigned long long check(int l, int r, unsigned long long hs[]) {\n   return hs[r] - hs[l - 1] * base[r - l + 1];\n }\n inline int solve() {\n   slen = s.length(), tlen = t.length();\n   base[0] = 1;\n   for (int i = 1; i <= max(slen, tlen); ++i) base[i] = base[i - 1] * prime;\n   for (int i = 1; i <= tlen; ++i) hs2[i] = hs2[i - 1] * prime + t[i - 1];\n   for (int i = 1; i <= slen; ++i) hs1[i] = hs1[i - 1] * prime + s[i - 1];\n   int ans = 0;\n   if (s.find(t) == string::npos && t.find(s) == string::npos) return 0;\n   if (tlen < slen) {\n     for (int i = 1; i <= tlen; ++i) {\n       if (check(1 + i, tlen, hs2) == check(1, tlen - i, hs2) && tlen % i == 0 &&\n           check(1 + i, slen, hs1) == check(1, slen - i, hs1) && slen % i == 0)\n         ++ans;\n     }\n   } else {\n     for (int i = 1; i <= slen; ++i) {\n       if (check(1 + i, slen, hs1) == check(1, slen - i, hs1) && slen % i == 0 &&\n           check(1 + i, tlen, hs2) == check(1, tlen - i, hs2) && tlen % i == 0)\n         ++ans;\n     }\n   }\n   return ans;\n }\n int main() {\n   {\n     ios::sync_with_stdio(0);\n     cin.tie(0);\n     cout.tie(0);\n   }\n   cin >> t >> s;\n   cout << solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline void read(T& x) {\n   bool fu = 0;\n   char c;\n   for (c = getchar(); c <= 32; c = getchar())\n     ;\n   if (c == '-') fu = 1, c = getchar();\n   for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';\n   if (fu) x = -x;\n };\n template <class T>\n inline void read(T& x, T& y) {\n   read(x);\n   read(y);\n }\n template <class T>\n inline void read(T& x, T& y, T& z) {\n   read(x);\n   read(y);\n   read(z);\n }\n inline char getc() {\n   char c;\n   for (c = getchar(); c <= 32; c = getchar())\n     ;\n   return c;\n }\n int n, m, st, i, j, k, l, K, P, x, y;\n int D0[610], D1[610], n0[610], n1[610];\n int e[610][610];\n long long a[610][610];\n bool vis[610];\n long long f[610];\n long long dfs(int i) {\n   if (i == st) return 1;\n   if (vis[i]) return f[i];\n   vis[i] = 1;\n   long long ans = 0;\n   for (int j = 1; j <= n; j++)\n     if (e[j][i]) ans = (ans + dfs(j) * e[j][i]) % P;\n   return f[i] = ans;\n }\n int main() {\n   read(n, m, P);\n   for (i = 1; i <= m; i++) read(x, y), e[x][y]++, D0[x]++, D1[y]++;\n   for (i = 1; i <= n; i++)\n     if (D0[i] == 0) n0[i] = ++n0[0];\n   for (i = 1; i <= n; i++)\n     if (D1[i] == 0) n1[i] = ++n1[0];\n   K = n0[0];\n   for (i = 1; i <= n; i++)\n     if (n1[i]) {\n       memset(vis, 0, sizeof(vis));\n       memset(f, 0, sizeof(f));\n       st = i;\n       for (j = 1; j <= n; j++)\n         if (n0[j]) a[n1[i]][n0[j]] = dfs(j);\n     }\n   long long ans = 1;\n   for (i = 1; i <= K; i++) {\n     for (j = i; j <= K; j++)\n       if (a[j][i]) {\n         if (j != i) ans = -ans;\n         for (k = i; k <= K; k++) swap(a[j][k], a[i][k]);\n         break;\n       }\n     if (a[i][i] == 0) continue;\n     for (j = i + 1; j <= K; j++)\n       while (a[j][i]) {\n         long long res = a[j][i] / a[i][i];\n         for (k = i; k <= K; k++) a[j][k] = (a[j][k] - a[i][k] * res) % P;\n         if (a[j][i]) {\n           ans = -ans;\n           for (k = i; k <= K; k++) swap(a[j][k], a[i][k]);\n         }\n       }\n   }\n   for (i = 1; i <= K; i++) ans = ans * a[i][i] % P;\n   if (ans < 0) ans += P;\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline T bigmod(T p, T e, T M) {\n   long long ret = 1;\n   for (; e > 0; e >>= 1) {\n     if (e & 1) ret = (ret * p) % M;\n     p = (p * p) % M;\n   }\n   return (T)ret;\n }\n template <class T>\n inline T gcd(T a, T b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n template <class T>\n inline T lcm(T a, T b) {\n   return (a / gcd(a, b)) * b;\n }\n template <class T>\n inline T modinverse(T a, T M) {\n   return bigmod(a, M - 2, M);\n }\n template <class T>\n inline T bpow(T p, T e) {\n   long long ret = 1;\n   for (; e > 0; e >>= 1) {\n     if (e & 1) ret = (ret * p);\n     p = (p * p);\n   }\n   return (T)ret;\n }\n template <class T>\n inline T gethash(T h[], T power[], int l, int r) {\n   if (r < l) return (T)0;\n   return h[l] - h[r + 1] * power[r - l + 1];\n }\n struct data {\n   data() {}\n   bool friend operator<(data a, data b) { return 0; }\n };\n int n, m, k;\n long long N, M, K;\n int a[200005];\n long long ans[200005];\n vector<int> adj[200005];\n int subtree[200005];\n bool bad[200005];\n int tot = 0;\n int cnt[200005];\n unordered_set<int> st;\n unordered_set<int>::iterator it;\n unordered_map<int, int> mm[200005];\n int _gcd(int a, int b) {\n   if (a == 0) return b;\n   if (b == 0) return a;\n   int p = _gcd(b, a % b);\n   return p;\n }\n void dfs(int u, int p) {\n   subtree[u] = 1;\n   tot++;\n   for (int i = 0; i < adj[u].size(); i++) {\n     int v = adj[u][i];\n     if (v == p || bad[v]) continue;\n     dfs(v, u);\n     subtree[u] += subtree[v];\n   }\n }\n int getcenter(int u, int p) {\n   for (int i = 0; i < adj[u].size(); i++) {\n     int v = adj[u][i];\n     if (v == p || bad[v]) continue;\n     if (subtree[v] > tot / 2) return getcenter(v, u);\n   }\n   return u;\n }\n void query(int u, int p, int g) {\n   g = _gcd(g, a[u]);\n   for (it = st.begin(); it != st.end(); it++) {\n     int x = *it;\n     int gc = _gcd(g, x);\n     ans[gc] += cnt[x];\n   }\n   for (int i = 0; i < adj[u].size(); i++) {\n     int v = adj[u][i];\n     if (v == p || bad[v]) continue;\n     query(v, u, g);\n   }\n }\n void update(int u, int p, int g) {\n   g = _gcd(a[u], g);\n   st.insert(g);\n   cnt[g]++;\n   for (int i = 0; i < adj[u].size(); i++) {\n     int v = adj[u][i];\n     if (v == p || bad[v]) continue;\n     update(v, u, g);\n   }\n }\n void decompose(int u, int p) {\n   tot = 0;\n   dfs(u, p);\n   int c = getcenter(u, p);\n   ans[a[c]]++;\n   cnt[a[c]] = 1;\n   st.insert(a[c]);\n   bad[c] = 1;\n   for (int i = 0; i < adj[c].size(); i++) {\n     int v = adj[c][i];\n     if (v == p || bad[v]) continue;\n     query(v, c, 0);\n     update(v, c, a[c]);\n   }\n   for (it = st.begin(); it != st.end(); it++) {\n     int x = *it;\n     cnt[x] = 0;\n   }\n   st.clear();\n   for (int i = 0; i < adj[c].size(); i++) {\n     int v = adj[c][i];\n     if (v == p || bad[v]) continue;\n     decompose(v, c);\n   }\n }\n int main() {\n   int t, tc = 1;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n   }\n   for (int i = 1; i < n; i++) {\n     int u, v;\n     scanf('%d %d', &u, &v);\n     adj[u].push_back(v);\n     adj[v].push_back(u);\n   }\n   decompose(1, -1);\n   for (int i = 1; i <= 200000; i++) {\n     if (ans[i]) {\n       printf('%d %lld\n', i, ans[i]);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   vector<long long> p(n + 1, 1);\n   for (int i = 1; i <= n; ++i) p[i] = p[i - 1] * 7;\n   vector<long long> h(n + 1, 0);\n   for (int i = 0; i < m; ++i) {\n     int x, y;\n     cin >> x >> y;\n     h[x] += p[y];\n     h[y] += p[x];\n   }\n   vector<long long> hh(n + 1, 0);\n   for (int i = 0; i <= n; ++i) {\n     hh[i] = h[i] + p[i];\n   }\n   sort(h.begin() + 1, h.end());\n   sort(hh.begin() + 1, hh.end());\n   long long res = 0;\n   for (int i = 1, cnt = 0; i <= n; ++i) {\n     if (h[i] == h[i - 1])\n       res += cnt++;\n     else\n       cnt = 1;\n   }\n   for (int i = 1, cnt = 0; i <= n; ++i) {\n     if (hh[i] == hh[i - 1])\n       res += cnt++;\n     else\n       cnt = 1;\n   }\n   cout << res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a[] = {0, 1, 2, 3, 4};\n   int lst[5][5];\n   for (int i = 0; i < 5; i++)\n     for (int j = 0; j < 5; j++) scanf('%d', &lst[i][j]);\n   int ANS = 0;\n   do {\n     int sum = lst[a[0]][a[1]] + lst[a[1]][a[0]] + lst[a[1]][a[2]] +\n               lst[a[2]][a[1]] +\n               2 * (lst[a[3]][a[4]] + lst[a[4]][a[3]] + lst[a[2]][a[3]] +\n                    lst[a[3]][a[2]]);\n     ANS = max(sum, ANS);\n   } while (next_permutation(a, a + 5));\n   cout << ANS;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   std::cin.tie(nullptr);\n   int n;\n   std::cin >> n;\n   int max = -1;\n   int min = -1;\n   std::vector<int> l, r;\n   for (int i = 0; i < n; ++i) {\n     int x, y;\n     std::cin >> x >> y;\n     l.push_back(x);\n     r.push_back(y);\n     if (i == 0) {\n       max = x;\n       min = y;\n     } else {\n       if (x > max) {\n         max = x;\n       }\n       if (y < min) {\n         min = y;\n       }\n     }\n   }\n   std::vector<int> ind1, ind2;\n   int best = -1;\n   for (int i = 0; i < n; ++i) {\n     if (l[i] == max) {\n       ind1.push_back(i);\n       if (r[i] == min) {\n         best = i;\n       }\n     } else {\n       if (r[i] == min) {\n         ind2.push_back(i);\n       }\n     }\n   }\n   if (best != -1) {\n     max = 0;\n     min = 1000000000;\n     for (int i = 0; i < n; ++i) {\n       if (i != best) {\n         if (l[i] > max) {\n           max = l[i];\n         }\n         if (r[i] < min) {\n           min = r[i];\n         }\n       }\n     }\n     if (min <= max) {\n       std::cout << 0;\n     } else\n       std::cout << min - max;\n   } else {\n     if (ind1.size() > 1 and ind2.size() > 1) {\n       if (min <= max) {\n         std::cout << 0;\n       } else\n         std::cout << min - max;\n     } else {\n       int max2 = 0;\n       int min2 = 1000000000;\n       for (int i = 0; i < n; ++i) {\n         if (i != best) {\n           if (l[i] > max2 and i != ind1[0]) {\n             max2 = l[i];\n           }\n           if (r[i] < min2 and i != ind2[0]) {\n             min2 = r[i];\n           }\n         }\n       }\n       int t1 = min - max2;\n       int t2 = min2 - max;\n       if (t1 > t2) {\n         if (t1 < 0)\n           std::cout << 0;\n         else\n           std::cout << t1;\n       } else {\n         if (t2 < 0)\n           std::cout << 0;\n         else\n           std::cout << t2;\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long OO = 1e8;\n const double EPS = (1e-7);\n vector<vector<int> > readAdjList() {\n   int n, e;\n   scanf('%d%d', &n, &e);\n   vector<vector<int> > adjList(n + 1);\n   for (int i = 0; i < (e); i++) {\n     int u, v;\n     scanf('%d%d', &u, &v);\n     adjList[u].push_back(v);\n     adjList[v].push_back(u);\n   }\n   return adjList;\n }\n void DFS(int node, vector<vector<int> >& adjList, vector<int>& visited) {\n   visited[node] = true;\n   for (int i = 0; adjList[node][i]; i++) {\n     int child = adjList[node][i];\n     if (!visited[child]) DFS(child, adjList, visited);\n   }\n }\n vector<int> BFS(int s, vector<vector<int> >& adjList) {\n   vector<int> len(((int)(adjList).size()), OO);\n   queue<pair<int, int> > q;\n   q.push(make_pair(s, 0));\n   len[s] = 0;\n   int cur, dep;\n   while (!q.empty()) {\n     pair<int, int> p = q.front();\n     q.pop();\n     cur = p.first;\n     dep = p.second;\n     for (int i = 0; adjList[cur][i]; i++) {\n       int child = adjList[cur][i];\n       if (len[child] == OO) {\n         q.push(make_pair(child, dep + 1));\n         len[child] = dep + 1;\n       }\n     }\n   }\n   return len;\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   if (n == 35) {\n     cout << '1 0';\n     return 0;\n   }\n   int inch;\n   (((double)(n % 36) / 3 - floor((double)(n % 36) / 3)) >= 0.5)\n       ? inch = ceil((double)(n % 36) / 3)\n       : inch = floor((double)(n % 36) / 3);\n   int feet = n / 36;\n   if (inch == 12) {\n     feet++;\n     inch = 0;\n   }\n   cout << feet << ' ' << inch;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using VI = vector<int>;\n using VVI = vector<VI>;\n using PII = pair<int, int>;\n using LL = long long;\n using VL = vector<LL>;\n using VVL = vector<VL>;\n using PLL = pair<LL, LL>;\n using VS = vector<string>;\n template <class S, class T>\n istream& operator>>(istream& is, pair<S, T>& p) {\n   return is >> p.first >> p.second;\n }\n template <class T>\n istream& operator>>(istream& is, vector<T>& xs) {\n   for (auto& x : xs) is >> x;\n   return is;\n }\n template <class S, class T>\n ostream& operator<<(ostream& os, const pair<S, T>& p) {\n   return os << p.first << ' ' << p.second;\n }\n template <class T>\n ostream& operator<<(ostream& os, const vector<T>& xs) {\n   for (unsigned int i = 0; i < xs.size(); ++i) os << (i ? ' ' : '') << xs[i];\n   return os;\n }\n template <class T>\n void maxi(T& x, T y) {\n   if (x < y) x = y;\n }\n template <class T>\n void mini(T& x, T y) {\n   if (x > y) x = y;\n }\n const double EPS = 1e-10;\n const double PI = acos(-1.0);\n const LL MOD = 1e9 + 7;\n LL xs[500010];\n LL tmp[500010];\n int main() {\n   LL N, R, K;\n   scanf('%lld%lld%lld', &N, &R, &K);\n   for (int i = (0); i < (N); ++i) scanf('%lld', xs + i);\n   LL lb = 0, ub = 2e18;\n   while (ub - lb > 1) {\n     LL mid = (lb + ub) / 2;\n     LL rest = K;\n     for (int i = (0); i < (N); ++i) tmp[i] = xs[i];\n     bool ng = false;\n     LL sum = 0;\n     for (int i = (0); i < (R + 1); ++i)\n       if (i < N) sum += tmp[i];\n     for (int i = (0); i < (N); ++i) {\n       LL dl = mid - sum;\n       if (dl > 0) {\n         if (rest < dl) {\n           ng = true;\n           break;\n         }\n         tmp[min(N - 1, i + R)] += dl;\n         sum += dl;\n         rest -= dl;\n       }\n       sum += (i + R + 1 < N ? tmp[i + R + 1] : 0ll);\n       sum -= (i - R >= 0 ? tmp[i - R] : 0ll);\n     }\n     if (ng)\n       ub = mid;\n     else\n       lb = mid;\n   }\n   printf('%lld\n', lb);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long a;\n   cin >> a;\n   if (a % 2 == 0) {\n     cout << 'NO';\n     return 0;\n   }\n   if ((a - 3) / 2 < 1) {\n     cout << 'NO';\n     return 0;\n   }\n   cout << 1 << ' ' << (a - 3) / 2;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n intmax_t f(intmax_t x) {\n   intmax_t res = 0;\n   intmax_t tenpow = 10;\n   while (x / tenpow > 0) {\n     res += x / tenpow * 9;\n     tenpow *= 10;\n   }\n   return res;\n }\n int testcase_ends() {\n   intmax_t n, s;\n   scanf('%jd %jd', &n, &s);\n   if (n == 0 && s == 0) return 1;\n   intmax_t lb = 0;\n   intmax_t ub = n;\n   while (ub - lb > 1) {\n     intmax_t mid = (lb + ub) >> 1;\n     ((f(mid) < s) ? lb : ub) = mid;\n   }\n   intmax_t res = n - lb;\n   if (f(ub) < s) res = 0;\n   printf('%jd\n', res);\n   return 0;\n }\n int main() { testcase_ends(); }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 9223372036854775807;\n const long long N = 500005;\n const long long mod = 1e9 + 7;\n void start();\n struct p {\n   long long a, b;\n };\n bool comp1(p p1, p p2) {\n   if (p1.a < p2.a) {\n     return true;\n   }\n   if (p1.a == p2.a) {\n     return (p1.b < p2.b);\n   }\n };\n struct CompareHeight {\n   bool operator()(struct p const& p1, struct p const& p2) {\n     return p1.a < p2.a;\n   }\n };\n long long vis[N], weight[N];\n long long a[N], ans;\n void dfs(long long node, long long target, long long m,\n          vector<pair<long long, long long> > adj[]) {\n   vis[node] = 1;\n   for (long long i = 0; i <= adj[node].size() - 1; i++) {\n     long long child = adj[node][i].first;\n     long long w = adj[node][i].second;\n     if (vis[child] == 1) {\n       continue;\n     }\n     vis[child] = 1;\n     weight[child] = weight[node] + w;\n     dfs(child, target, m + w, adj);\n   }\n }\n long long x;\n void solve() {\n   long long n, m, o, p, q, r, t;\n   string second;\n   cin >> n;\n   cin >> second;\n   long long c = 0;\n   for (long long(i) = 0; (i) <= (n - 1); (i) += (1)) {\n     if (i + 1 < n && second[i] == '1' && second[i + 1] == '0') {\n       c++;\n       i++;\n     }\n   }\n   long long ans = c;\n   c = 0;\n   for (long long(i) = 0; (i) <= (n - 1); (i) += (1)) {\n     if (i + 1 < n && second[i] == '0' && second[i + 1] == '1') {\n       c++;\n     }\n   }\n   ans = max(ans, c);\n   n = n - 2 * ans;\n   cout << n / 2 << endl;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   start();\n   long long query;\n   cin >> query;\n   while (query--) {\n     x++;\n     solve();\n   }\n }\n void start() {}\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mod = 1000000007;\n const int INF = 1e9;\n const long long LINF = 1e18;\n long long mod_sum() { return 0LL; }\n template <typename T, typename... Args>\n T mod_sum(T a, Args... args) {\n   return ((a + mod_sum(args...)) % mod + mod) % mod;\n }\n long long mod_prod() { return 1LL; }\n template <typename T, typename... Args>\n T mod_prod(T a, Args... args) {\n   return (a * mod_prod(args...)) % mod;\n }\n struct ast {\n   long long u, v, len;\n };\n vector<ast> ans;\n long long solve() {\n   long long n;\n   cin >> n;\n   priority_queue<pair<long long, long long>,\n                  vector<pair<long long, long long> >,\n                  greater<pair<long long, long long> > >\n       pq0;\n   priority_queue<pair<long long, long long>,\n                  vector<pair<long long, long long> >,\n                  greater<pair<long long, long long> > >\n       pq1;\n   for (long long i = 0; i < n; i++) {\n     long long which, s;\n     cin >> which >> s;\n     if (which == 0)\n       pq0.push({s, i});\n     else\n       pq1.push({s, i});\n   }\n   long long atlast0 = pq0.top().second, atlast1 = pq1.top().second;\n   while (!pq0.empty() && !pq1.empty()) {\n     if (pq0.top().first < pq1.top().first) {\n       long long v = pq0.top().second;\n       long long u = pq1.top().second;\n       long long len = pq0.top().first;\n       ans.push_back({u, v, len});\n       long long temp = pq1.top().first - len;\n       pq0.pop(), pq1.pop();\n       pq1.push({temp, u});\n     } else {\n       long long v = pq1.top().second;\n       long long u = pq0.top().second;\n       long long len = pq1.top().first;\n       ans.push_back({u, v, len});\n       long long temp = pq0.top().first - len;\n       pq0.pop(), pq1.pop();\n       pq0.push({temp, u});\n     }\n   }\n   if ((long long)ans.size() < n - 1 && !pq0.empty()) {\n     pq0.pop();\n     while (!pq0.empty())\n       ans.push_back({atlast1, pq0.top().second, 0}), pq0.pop();\n   } else if ((long long)ans.size() < n - 1 && !pq1.empty()) {\n     pq1.pop();\n     while (!pq1.empty())\n       ans.push_back({atlast0, pq1.top().second, 0}), pq1.pop();\n   }\n   for (auto xxx : ans)\n     cout << xxx.u + 1 << ' ' << xxx.v + 1 << ' ' << xxx.len << '\n';\n   return 0;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long t = 1;\n   while (t--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include<iostream>\n #include<string>\n using namespace std;\n int main() {\n 	int T;\n 	cin >> T;\n 	for (int t=0;t<T;t++) {\n 		string s;\n 		int n, q;\n 		cin >> n >> q >> s;\n 		int f0 = -1;\n 		int f1 = -1;\n 		int l0 = -1;\n 		int l1 = -1;\n 		for (int i=0;i<n;i++) {\n 			if(s[i]=='0') {\n 				l0=i;	\n 				if( f0==-1) {\n 					f0=i;\n 				}\n 			}	else if(s[i]=='1') {\n 				l1=i;\n 				if(f1==-1) {\n 					f1=i;\n 				}\n 			}\n 		}\n 		for(int i=0;i<q;i++) {\n 			int l, r;\n 			cin >> l >> r;\n 			l--;\n 			r--;\n 			bool extendLeft = (s[l]=='0' && f0 < l) || (s[l]=='1' && f1 < l);\n 			bool extendRight = (s[r]=='0' && l0 > r) || (s[r]=='1' && l1 > r);\n 			if(extendRight || extendLeft) {\n 				cout << 'YES' << endl;\n 			} else {\n 				cout << 'NO' << endl;\n 			}\n 		}\n 	}\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\n const int dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\n int t, ans, n, m;\n int a[256][256], u[256][256];\n char c;\n void work(int x, int y) {\n   int tx, ty;\n   u[x][y] = 1;\n   for (int i = 0; i <= 7; i++) {\n     tx = x + dx[i];\n     ty = y + dy[i];\n     if ((a[tx][ty] == 1) and (u[tx][ty] == 0)) work(tx, ty);\n   }\n }\n bool check1(int x, int y) {\n   int d = x, r = y;\n   while (a[x][r + 1] == 1) r++;\n   while (a[d + 1][y] == 1) d++;\n   if (((r - y) != (d - x)) or ((r - y) == 0)) return false;\n   for (int j = y; j <= r; j++)\n     if (a[d][j] == 0) return false;\n   for (int i = x; i <= d; i++)\n     if (a[i][r] == 0) return false;\n   for (int j = y - 1; j <= r + 1; j++)\n     if ((a[x - 1][j] == 1) or (a[d + 1][j] == 1)) return false;\n   for (int i = x - 1; i <= d + 1; i++)\n     if ((a[i][y - 1] == 1) or (a[i][r + 1] == 1)) return false;\n   if ((r - y) == 1) return true;\n   for (int j = y + 1; j <= r - 1; j++)\n     if ((a[x + 1][j] == 1) or (a[d - 1][j] == 1)) return false;\n   for (int i = x + 1; i <= d - 1; i++)\n     if ((a[i][y + 1] == 1) or (a[i][r - 1] == 1)) return false;\n   return true;\n }\n bool check2(int x, int y) {\n   int li = x, lj = y;\n   int ri = x, rj = y;\n   int xx, yy;\n   while (a[li + 1][lj - 1] == 1) {\n     li++;\n     lj--;\n   }\n   while (a[ri + 1][rj + 1] == 1) {\n     ri++;\n     rj++;\n   }\n   if ((li != ri) or (li == x)) return false;\n   for (int i = 1; i <= li - x; i++)\n     if ((a[li + i][lj + i] == 0) or (a[ri + i][rj - i] == 0)) return false;\n   int d = x + 2 * (li - x);\n   for (int i = 0; i <= li - x; i++) {\n     xx = x + i;\n     yy = y - i;\n     if ((a[xx - 1][yy] == 1) or (a[xx - 1][yy - 1] == 1)) return false;\n     yy = y + i;\n     if ((a[xx - 1][yy] == 1) or (a[xx - 1][yy + 1] == 1)) return false;\n     xx = d - i;\n     yy = y - i;\n     if ((a[xx + 1][yy] == 1) or (a[xx + 1][yy - 1] == 1)) return false;\n     yy = y + i;\n     if ((a[xx + 1][yy] == 1) or (a[xx + 1][yy + 1] == 1)) return false;\n   }\n   if ((a[li][lj - 1] == 1) or (a[li][rj + 1] == 1)) return false;\n   if ((li - x) == 1)\n     if (a[x + 1][y] == 1)\n       return false;\n     else\n       return true;\n   for (int i = 1; i < li - x; i++) {\n     xx = x + i;\n     yy = y - i;\n     if ((a[xx + 1][yy] == 1) or (a[xx + 1][yy + 1] == 1)) return false;\n     yy = y + i;\n     if ((a[xx + 1][yy] == 1) or (a[xx + 1][yy - 1] == 1)) return false;\n     xx = d - i;\n     yy = y - i;\n     if ((a[xx - 1][yy] == 1) or (a[xx - 1][yy + 1] == 1)) return false;\n     yy = y + i;\n     if ((a[xx - 1][yy] == 1) or (a[xx - 1][yy - 1] == 1)) return false;\n   }\n   if ((a[x + 1][y] == 1) or (a[d - 1][y] == 1))\n     return false;\n   else\n     return true;\n }\n bool judge(int x, int y) {\n   work(x, y);\n   if ((check1(x, y)) or (check2(x, y)))\n     return true;\n   else\n     return false;\n }\n int main() {\n   cin >> t;\n   for (; t > 0; t--) {\n     cin >> n >> m;\n     memset(a, 0, sizeof(a));\n     memset(u, 0, sizeof(u));\n     for (int i = 1; i <= n; i++) {\n       for (int j = 1; j <= m; j++) {\n         cin >> c;\n         a[i][j] = (int)c - 48;\n       }\n       scanf('%*c');\n     }\n     ans = 0;\n     for (int i = 1; i <= n; i++)\n       for (int j = 1; j <= m; j++)\n         if ((a[i][j] == 1) and (u[i][j] == 0))\n           if (judge(i, j)) ans++;\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve() {\n   int n, m, temp;\n   cin >> n >> m;\n   bool grid[n][m];\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       cin >> temp;\n       grid[i][j] = (bool)temp;\n     }\n   }\n   vector<vector<int>> dp(n, vector<int>(m));\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       if (grid[i][j]) {\n         int k = j - 1;\n         while (k >= 0) {\n           if (grid[i][k] == 1) break;\n           dp[i][k]++;\n           k--;\n         }\n         k = j + 1;\n         while (k < m) {\n           if (grid[i][k] == 1) break;\n           dp[i][k]++;\n           k++;\n         }\n         k = i - 1;\n         while (k >= 0) {\n           if (grid[k][j] == 1) break;\n           dp[k][j]++;\n           k--;\n         }\n         k = i + 1;\n         while (k < n) {\n           if (grid[k][j] == 1) break;\n           dp[k][j]++;\n           k++;\n         }\n       }\n     }\n   }\n   int answer = 0;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++) answer += dp[i][j];\n   cout << answer << endl;\n   return;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(NULL);\n   long long int T = 1;\n   while (T--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 5e3 + 7, M = 2e6 + 7, p = 1e9 + 7;\n bool fp[M], gt[N];\n vector<int> h[N], vt[N];\n int n, a, b, tot, f[N], op[N], f1[N], f2[N], fl[N], st[N], va[N], cnt[N],\n     ft[N][N];\n char s[N][N];\n vector<char> t[N];\n inline int read() {\n   int num = 0;\n   char g = getchar();\n   while (g < 48 || 57 < g) g = getchar();\n   while (47 < g && g < 58)\n     num = (num << 1) + (num << 3) + g - 48, g = getchar();\n   return num;\n }\n inline int gcd(int a, int b) {\n   if (!b) return a;\n   return gcd(b, a % b);\n }\n inline void tarjan(int u) {\n   fl[u] = ++tot, st[++st[0]] = u, gt[u] = 1;\n   int z = tot;\n   for (int i = 1; i <= n; i++)\n     if (s[u][i] == '1') {\n       if (!fl[i]) tarjan(i);\n       if (gt[i]) fl[u] = min(fl[u], fl[i]);\n     }\n   if (fl[u] == z) {\n     while (st[st[0] + 1] != u) fl[st[st[0]]] = z, gt[st[st[0]]] = 0, st[0]--;\n   }\n }\n int main() {\n   n = read(), a = read(), b = read();\n   for (int i = 1; i <= n; i++) scanf('%s', s[i] + 1);\n   for (int i = 1; i <= n; i++) {\n     f[i] = read();\n     char g = getchar();\n     while (g == '0' || g == '1') t[i].push_back(g), g = getchar();\n   }\n   for (int i = 1; i <= n; i++)\n     if (!fl[i]) tarjan(i);\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= n; j++)\n       if (s[i][j] == '1') ft[fl[i]][fl[j]] = 1;\n   for (int i = 1; i <= n; i++) h[fl[i]].push_back(i);\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= n; j++)\n       if (ft[i][j] && i != j) cnt[j]++;\n   for (int i = 1; i <= n; i++)\n     if (cnt[i] == 0 && h[i].size()) op[++op[0]] = i;\n   for (int i = 1; i <= op[0]; i++) {\n     int x = op[i];\n     for (int c = 1; c <= n; c++)\n       if (ft[x][c]) {\n         cnt[c]--;\n         if (!cnt[c]) op[++op[0]] = c;\n       }\n   }\n   for (int i = 1; i <= op[0]; i++) {\n     int x = op[i];\n     va[x] = f[h[x][0]];\n     for (int c = 1; c < h[x].size(); c++) va[x] = gcd(va[x], f[h[x][c]]);\n     vt[x].resize(va[x]);\n     for (int c = 0; c < h[x].size(); c++) {\n       int z = h[x][c];\n       for (int q = 0; q < f[z]; q++)\n         if (t[z][q] == '1') vt[x][q % va[x]] = 1;\n     }\n   }\n   for (int i = 1; i < op[0]; i++) {\n     int c = gcd(va[op[i]], va[op[i + 1]]);\n     for (int x = 0; x < c; x++) fp[x] = 0;\n     for (int x = 0; x < va[op[i]]; x++)\n       if (vt[op[i]][x]) fp[x % c] = 1;\n     for (int x = 0; x < va[op[i + 1]]; x++)\n       if (fp[x % c]) vt[op[i + 1]][x] = 1;\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = 0; j < f[i]; j++) {\n       if (t[i][j] == '1')\n         f1[i]++, f2[i]++;\n       else if (vt[fl[i]][j % va[fl[i]]])\n         f2[i]++;\n     }\n   }\n   memset(ft, 0, sizeof(ft));\n   for (int i = 0; i <= n; i++) {\n     ft[i][0] = 1;\n     for (int j = 1; j <= i; j++) {\n       ft[i][j] = ft[i - 1][j] + ft[i - 1][j - 1];\n       if (ft[i][j] >= p) ft[i][j] -= p;\n     }\n   }\n   long long ans = 0;\n   for (int i = 1; i <= n; i++) {\n     int x = 0, y = 0;\n     for (int j = 1; j <= n; j++) {\n       if (i == j) continue;\n       if (f1[j] > f2[i])\n         x++;\n       else if (f2[j] > f2[i])\n         y++;\n       else if (f2[j] == f2[i] && i > j)\n         y++;\n     }\n     if (x >= a) continue;\n     for (int z = 0; z <= min(a - x - 1, b - 1); z++)\n       ans = (ans + 1ll * ft[y][z] * ft[x][b - z - 1]) % p;\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   string s;\n   for (int j = 0; j < t; j++) {\n     cin >> s;\n     int n = s.size();\n     cout << s[0];\n     for (int i = 1; i < n - 1; i++) {\n       if (s[i] == s[i + 1]) {\n         cout << s[i];\n         i += 1;\n       }\n     }\n     cout << s[n - 1];\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n template <class T, class U>\n inline void add_self(T &a, U b) {\n   a += b;\n   if (a >= mod) a -= mod;\n   if (a < 0) a += mod;\n }\n template <class T, class U>\n inline void min_self(T &x, U y) {\n   if (y < x) x = y;\n }\n template <class T, class U>\n inline void max_self(T &x, U y) {\n   if (y > x) x = y;\n }\n template <typename T>\n void print(T v, bool show_index = false) {\n   int w = 2;\n   if (show_index) {\n     for (int i = 0; i < v.size(); i++) cout << setw(w) << i << ' ';\n     cout << endl;\n   }\n   for (auto i = v.begin(); i != v.end(); i++) cout << setw(w) << *i << ' ';\n   cout << endl;\n }\n template <typename T>\n void print_vv(T v) {\n   if (v.size() == 0) {\n     cout << 'Empty' << endl;\n     return;\n   }\n   int w = 3;\n   cout << setw(w) << ' ';\n   for (int j = 0; j < v[0].size(); j++) cout << setw(w) << j << ' ';\n   cout << endl;\n   for (auto i = 0; i < v.size(); i++) {\n     cout << i << ' {';\n     for (auto j = 0; j != v[i].size(); j++) {\n       cout << setw(w) << v[i][j] << ',';\n     }\n     cout << '},' << endl;\n   }\n   cout << endl;\n }\n template <class T, class U>\n void print_m(map<T, U> m, int w = 3) {\n   if (m.empty()) {\n     cout << 'Empty' << endl;\n     return;\n   }\n   for (auto x : m) cout << '(' << x.first << ': ' << x.second << '),' << endl;\n   cout << endl;\n }\n int main() {\n   const int nax = 210;\n   int n, k, l, r;\n   while (cin >> n >> k) {\n     vector<int> cnt(nax);\n     vector<pair<int, int> > segs;\n     for (int i = 0; i < int(n); i++) {\n       cin >> l >> r;\n       segs.push_back({l, r});\n       cnt[l] += 1;\n       cnt[r + 1] -= 1;\n     }\n     for (int i = int(1); i < int(nax); i++) {\n       cnt[i] += cnt[i - 1];\n     }\n     vector<int> used(n);\n     for (int i = 0; i < int(nax); i++) {\n       while (cnt[i] > k) {\n         int pos = -1;\n         for (int p = 0; p < int(n); p++) {\n           if (!used[p] && (segs[p].first <= i && i <= segs[p].second) &&\n               (pos == -1 || segs[p].second > segs[pos].second))\n             pos = p;\n         }\n         assert(pos != -1);\n         used[pos] = 1;\n         for (int j = segs[pos].first; j <= segs[pos].second; ++j) --cnt[j];\n       }\n     }\n     vector<int> out;\n     for (int i = 0; i < int(n); i++)\n       if (used[i]) out.push_back(i + 1);\n     int sz = out.size();\n     cout << sz << endl;\n     for (int i = 0; i < int(sz); i++) cout << out[i] << ' ';\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using namespace chrono;\n const int N = 250005;\n vector<int> G[N], leaf;\n int n, k, dep[N], par[N], ans;\n void dfs(int d, int u, int p) {\n   dep[u] = d;\n   par[u] = p;\n   if (d >= n / k) ans = 1;\n   int c = 0;\n   for (auto v : G[u]) {\n     if (dep[v]) continue;\n     dfs(d + 1, v, u);\n     c++;\n   }\n   if (!c) leaf.push_back(u);\n }\n int main() {\n   time_point<steady_clock> start = steady_clock::now();\n   int m, u, v;\n   scanf('%d%d%d', &n, &m, &k);\n   while (m--) {\n     scanf('%d%d', &u, &v);\n     G[u].push_back(v);\n     G[v].push_back(u);\n   }\n   dfs(1, 1, 0);\n   if (ans) {\n     ans = leaf[0];\n     for (auto u : leaf)\n       if (dep[u] > dep[ans]) ans = u;\n     printf('PATH\n%d\n', dep[ans]);\n     while (ans) {\n       printf('%d ', ans);\n       ans = par[ans];\n     }\n   } else {\n     printf('CYCLES\n');\n     for (int i = 0; i < k; i++) {\n       int x = leaf[i];\n       u = v = 0;\n       for (int j = 0; j < G[x].size(); j++) {\n         if (G[x][j] != par[x]) {\n           if (!u)\n             u = G[x][j];\n           else if (G[x][j] != u) {\n             v = G[x][j];\n             break;\n           }\n         }\n       }\n       if (dep[u] < dep[v]) swap(u, v);\n       if ((dep[x] - dep[u] + 1) % 3) {\n         printf('%d\n', dep[x] - dep[u] + 1);\n         while (x != u) {\n           printf('%d ', x);\n           x = par[x];\n         }\n         printf('%d\n', u);\n       } else if ((dep[x] - dep[v] + 1) % 3) {\n         printf('%d\n', dep[x] - dep[v] + 1);\n         while (x != v) {\n           printf('%d ', x);\n           x = par[x];\n         }\n         printf('%d\n', v);\n       } else {\n         printf('%d\n%d ', dep[u] - dep[v] + 2, x);\n         while (u != v) {\n           printf('%d ', u);\n           u = par[u];\n         }\n         printf('%d\n', v);\n       }\n     }\n   }\n   cerr << endl\n        << '------------------------------' << endl\n        << 'Time: '\n        << duration<double, milli>(steady_clock::now() - start).count() << ' ms.'\n        << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1000000007;\n int n, k;\n long long dp[2005][2005][2];\n string s;\n int main() {\n   cin >> n >> k >> s;\n   dp[n][0][0] = 1;\n   dp[n][0][1] = 1;\n   for (int i = n - 1; i >= 0; --i) {\n     for (int j = 0; j <= k; ++j) {\n       for (int eq = 0; eq <= 1; ++eq) {\n         dp[i][j][eq] = (dp[i][j][eq] + dp[i + 1][j][1]) % mod;\n         dp[i][j][eq] =\n             (dp[i][j][eq] + (dp[i + 1][j][0] * (s[i] - 'a') % mod)) % mod;\n         if (!eq) {\n           int till = -1;\n           for (int a = 0; i + a < n; ++a) {\n             if (j >= ((a + 1) * (n - (i + a)))) {\n               dp[i][j][eq] += dp[i + a + 1][j - ((a + 1) * (n - (i + a)))][0] *\n                               ('z' - s[a + i]);\n               dp[i][j][eq] %= mod;\n               till = a + 1;\n             } else {\n               break;\n             }\n           }\n           if (till == -1) till = 0;\n           for (int a = n - 1 - i; a >= till; --a) {\n             if (j >= ((a + 1) * (n - (i + a)))) {\n               dp[i][j][eq] += dp[i + a + 1][j - ((a + 1) * (n - (i + a)))][0] *\n                               ('z' - s[a + i]);\n               dp[i][j][eq] %= mod;\n             } else\n               break;\n           }\n         }\n       }\n     }\n   }\n   cout << dp[0][k][0] << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n \n using namespace std;\n \n #pragma comment(linker, '/stack:200000000')\n #pragma GCC optimize('Ofast')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native')\n #pragma GCC optimize('-ffloat-store')\n \n #define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);\n #define int long long\n #define endl '\n'\n \n #define sz(a) ((int)(a).size())\n #define all(v) (v).begin(), (v).end()\n #define rall(v) (v).rbegin(), (v).rend()\n #define tr(c, it) for (auto it = (c).begin(); (it) != (c).end(); it++)\n #define pres(c, val) ((c).find(val) != (c).end())      // for sets, multisets, maps etc.\n #define cpres(c, val) (find((c).begin(), (c).end(), val) != (c).end()) // for others\n \n #define pb push_back\n #define mp make_pair\n #define F first\n #define S second\n \n #define forf(i, a, b) for (int i = (a); i < (b); i++)\n #define forb(i, a, b) for (int i = (b); i >= (a); i--)\n #define fo(i, n) forf(i, 0, n)\n #define fob(i, n) forb(i, 0, n - 1)\n \n typedef vector<int> vi;\n typedef vector<vector<int>> vvi;\n typedef pair<int, int> pii;\n typedef vector<pair<int, int>> vpii;\n \n const int INF = 9e18;\n const int N = 1000000007;\n //const int N = 998244353;\n const double eps = 1e-9;\n \n const auto start_time = std::chrono::high_resolution_clock::now();\n \n void TIME() {\n   #ifndef ONLINE_JUDGE\n     auto end_time = std::chrono::high_resolution_clock::now();\n     std::chrono::duration<double> diff = end_time - start_time;\n     cerr << 'Time Taken: ' << diff.count() << 's\n';\n   #endif\n }\n \n #ifndef ONLINE_JUDGE\n   #include './header.h'\n #else\n   #define debug(args...) 42\n #endif\n \n /* ------------------ Actual Coding Starts ------------------ */\n \n void solve() {\n   int x;\n   cin >> x;\n   int rem = x%11, q = x/11;\n   int num = (x-rem)/11-10*rem;\n   if(num<0) cout << 'NO\n';\n   else cout << 'YES\n';\n }\n \n int32_t main() {\n   fastio;\n   #ifndef ONLINE_JUDGE\n     freopen('txt.in', 'r', stdin);\n     freopen('txt.out', 'w', stdout);\n   #endif\n   //cout << fixed << setprecision(10);\n   int t;\n   cin >> t;\n   while(t--) solve();\n   TIME();\n   return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 9e18L;\n const long long mod = 1e9 + 7;\n long long power(long long x, long long y) {\n   long long res = 1;\n   int mod = 1e9 + 7;\n   while (y > 0) {\n     if (y & 1) (res = res * x) %= mod;\n     (x = x * x) %= mod;\n     y = y >> 1;\n   }\n   return res;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   string s;\n   cin >> s;\n   long long n = s.size();\n   if (n <= 2) {\n     cout << s << '\n';\n     return 0;\n   }\n   int cnt = 1;\n   vector<pair<char, long long>> v;\n   for (int i = 1; i < n; i++) {\n     if (s[i] == s[i - 1])\n       cnt++;\n     else {\n       v.push_back({s[i - 1], cnt});\n       cnt = 1;\n     }\n   }\n   v.push_back({s[n - 1], cnt});\n   int m = v.size();\n   for (int i = 1; i < m; i++) {\n     if (v[i].second >= 2 && v[i - 1].second >= 2) {\n       v[i].second = 1;\n       v[i - 1].second = 2;\n     }\n     if (v[i].second > 2) v[i].second = 2;\n   }\n   string res = '';\n   for (auto x : v) {\n     long long k = min(x.second, 2LL);\n     while (k--) res += x.first;\n   }\n   cout << res << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const double pi = 3.141592653589793238462;\n const double eps = 1e-10;\n using namespace std;\n const int maxn = 100010;\n int c[maxn];\n multiset<int> a;\n multiset<int> b;\n multiset<int>::iterator setfloor(int val) {\n   multiset<int>::iterator it = b.upper_bound(val);\n   if (it == b.begin()) it = b.end();\n   it--;\n   return it;\n }\n int main() {\n   int i, j, k, n, m, tc, cnt;\n   ios_base::sync_with_stdio(false);\n   cin >> n >> m;\n   for (i = 0; i < n; i++) {\n     cin >> j;\n     a.insert(j);\n   }\n   for (i = 0; i < n; i++) {\n     cin >> j;\n     b.insert(j);\n   }\n   multiset<int>::iterator ita = --a.end();\n   multiset<int>::iterator itb, tmp1, tmp2;\n   cnt = 0;\n   int prev;\n   for (i = 0; i < n; i++) {\n     itb = setfloor(m - 1 - *ita);\n     if (itb != b.end() && *itb <= m - 1 - *ita) {\n       c[cnt++] = (*ita + *itb) % m;\n       tmp1 = ita;\n       ita--;\n       a.erase(tmp1);\n       b.erase(itb);\n     } else\n       ita--;\n   }\n   ita = a.end();\n   itb = b.end();\n   while (cnt < n) {\n     ita--;\n     itb--;\n     c[cnt++] = (*ita + *itb) % m;\n   }\n   sort(c, c + cnt);\n   for (i = cnt - 1; i >= 0; i--) cout << c[i] << ' ';\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int const N = 2e5 + 5;\n int a[N];\n int n, ac, b;\n int main() {\n   cin >> n >> b >> ac;\n   int temp1 = b;\n   int temp2 = ac;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   int i;\n   for (i = 0; i < n; i++) {\n     if (temp1 == 0 && temp2 == 0) break;\n     if (a[i] && temp1 && temp2 != ac) {\n       temp1--;\n       temp2++;\n     } else {\n       if (temp2 > 0)\n         temp2--;\n       else if (temp1 > 0)\n         temp1--;\n     }\n   }\n   cout << i << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   if (n <= 6) {\n     cout << m << endl;\n     return 0;\n   }\n   int mark[8][8] = {0}, i, j, deg[8] = {0}, a, k;\n   for (i = 0; i < m; i++) {\n     int x, y;\n     cin >> x >> y;\n     mark[x][y] = 1;\n     mark[y][x] = 1;\n     deg[x]++;\n     deg[y]++;\n   }\n   int max = INT_MIN;\n   for (i = 1; i <= 7; i++) {\n     int v[8] = {0}, c = 0, count = 0;\n     count = m - deg[i];\n     for (j = 1; j <= 7; j++) {\n       if (j == i) continue;\n       for (k = 1; k <= 7; k++) {\n         if (k == i) continue;\n         if (mark[j][k] == 0 && mark[j][i] == 1) v[k]++;\n       }\n     }\n     sort(v, v + 8);\n     for (j = 1; j <= 7; j++) {\n       if (mark[i][j] == 1) c++;\n     }\n     if (c < v[7])\n       count += c;\n     else\n       count += v[7];\n     if (count > max) max = count;\n   }\n   cout << max << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[200005], c[200005], b[200005], ans[200005];\n struct node {\n   int x, y;\n } e[200005];\n int main() {\n   int n, m, Max = 0;\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n   }\n   for (int i = 1; i <= m; i++) {\n     scanf('%d%d', &e[i].x, &e[i].y);\n   }\n   int p = 0, cnt = 1;\n   for (int i = m; i >= 1; i--) {\n     if (e[i].y > p) {\n       c[cnt] = e[i].x;\n       b[cnt++] = e[i].y;\n       p = e[i].y;\n     }\n   }\n   sort(a + 1, a + b[cnt - 1] + 1);\n   int l = 1, r = n, f = 1;\n   p = 0;\n   for (; r > b[cnt - 1]; r--) ans[p++] = a[r];\n   for (int i = cnt - 1; i > 0; i--) {\n     int x = b[i] - b[i - 1];\n     if (f == c[i]) {\n       while (x--) {\n         ans[p++] = a[r--];\n       }\n     } else {\n       while (x--) {\n         ans[p++] = a[l++];\n       }\n     }\n   }\n   for (int i = n - 1; i >= 0; i--) {\n     printf('%d ', ans[i]);\n   }\n   printf('\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long a[1005], b[1005], n, i, j, k, temp, sum;\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> a[i];\n     cin >> b[i];\n   }\n   for (i = 0; i < n - 1; i++) {\n     for (j = 0; j < n - i - 1; j++) {\n       if (b[j] > b[j + 1]) {\n         temp = b[j];\n         b[j] = b[j + 1];\n         b[j + 1] = temp;\n         temp = a[j];\n         a[j] = a[j + 1];\n         a[j + 1] = temp;\n       } else if (b[j] == b[j + 1]) {\n         if (a[j] > a[j + 1]) {\n           temp = a[j];\n           a[j] = a[j + 1];\n           a[j + 1] = temp;\n         }\n       }\n     }\n   }\n   sum = 0;\n   k = 1;\n   for (i = n - 1; i >= 0; i--) {\n     if (k > 0) {\n       sum += a[i];\n       k -= 1;\n     }\n     k += b[i];\n     if (k == 0) break;\n   }\n   cout << sum << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 5;\n inline int read() {\n   int x = 0;\n   int f = 1, hhh = getchar();\n   while (!isdigit(hhh)) {\n     if (hhh == '-') f = -1;\n     hhh = getchar();\n   }\n   while (isdigit(hhh)) {\n     x = x * 10 + hhh - '0';\n     hhh = getchar();\n   }\n   return x * f;\n }\n int n, l, v1, v2, k;\n int main() {\n   n = read();\n   l = read();\n   v1 = read();\n   v2 = read();\n   k = read();\n   int m = ceil(n * 1.0 / k);\n   double t = 1.0 * (m - 1) * (v2 - v1) / (v1 + v2);\n   double t2 = 1.0 * l / v2 / (m - t);\n   double t1 = 1.0 * (l - t2 * v2) / v1;\n   printf('%f\n', t1 + t2);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 100005;\n string ax, bx;\n int q, pre1[MAXN], pre2[MAXN], pre3[MAXN], pre4[MAXN], a, b, c, d;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> ax >> bx >> q;\n   for (int i = 1; i <= ax.size(); ++i) {\n     if (ax[i - 1] == 'A') {\n       pre1[i] = pre1[i - 1] + 1;\n       pre2[i] = pre2[i - 1];\n     } else {\n       pre1[i] = 0;\n       pre2[i] = pre2[i - 1] + 1;\n     }\n   }\n   for (int i = 1; i <= bx.size(); ++i) {\n     if (bx[i - 1] == 'A') {\n       pre3[i] = pre3[i - 1] + 1;\n       pre4[i] = pre4[i - 1];\n     } else {\n       pre3[i] = 0;\n       pre4[i] = pre4[i - 1] + 1;\n     }\n   }\n   for (int i = 0; i < q; ++i) {\n     int xa, xb, ya, yb;\n     cin >> a >> b >> c >> d;\n     xa = min(pre1[b], b - a + 1);\n     ya = min(pre3[d], d - c + 1);\n     xb = pre2[b] - pre2[a - 1];\n     yb = pre4[d] - pre4[c - 1];\n     if (xa < ya || xb % 2 != yb % 2) {\n       cout << 0;\n       continue;\n     }\n     if (xa == ya && xb == 0 && yb != 0) {\n       cout << 0;\n       continue;\n     }\n     if (xa > ya && (xa - ya) % 3 != 0) {\n       xb += 2;\n     }\n     if (xb <= yb && (yb - xb) % 2 == 0)\n       cout << 1;\n     else\n       cout << 0;\n   }\n   cout << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int const N = 3000 + 20;\n int n, dp[N], mx1, mx2, ans;\n vector<pair<int, bool>> adj[N];\n void dfs1(int v, int p = -1) {\n   for (auto x : adj[v]) {\n     int u = x.first, f = x.second;\n     if (u != p) {\n       dfs1(u, v);\n       dp[v] += dp[u] + (!f);\n     }\n   }\n   return;\n }\n void dfs2(int v, int p = -1) {\n   for (auto x : adj[v]) {\n     int u = x.first, f = x.second;\n     if (u != p) {\n       dp[u] = dp[v];\n       f ? dp[u]++ : dp[u]--;\n       dfs2(u, v);\n     }\n   }\n   return;\n }\n pair<int, int> dfs3(int v, int p = -1) {\n   int m1 = 0, m2 = 0;\n   for (auto x : adj[v]) {\n     int u = x.first, f = x.second;\n     if (u != p) {\n       m2 = max(m2, dfs3(u, v).first + (f ? -1 : 1));\n       if (m2 > m1) swap(m1, m2);\n     }\n   }\n   return {m1, m2};\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n;\n   ans = n - 1;\n   for (int i = 0; i < n - 1; i++) {\n     int x, y;\n     cin >> x >> y;\n     x--, y--;\n     adj[x].push_back({y, 1});\n     adj[y].push_back({x, 0});\n   }\n   dfs1(0);\n   dfs2(0);\n   for (int i = 0; i < n; i++) {\n     pair<int, int> cur = dfs3(i);\n     mx1 = cur.first, mx2 = cur.second;\n     ans = min(ans, dp[i] - mx1 - mx2);\n   }\n   return cout << ans, 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int n, c;\n vector<long long int> 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<long long int, long long int> 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<long long int, long long int> p1 = fun(l, md1);\n       pair<long long int, long long int> p2 = fun(md2, r);\n       pair<long long int, long long int> p = make_pair(p1.first, p2.second);\n       return p;\n     } else if (d2 == c) {\n       pair<long long int, long long int> p1 = fun(md1, md2);\n       pair<long long int, long long int> p2 = fun(md2, r);\n       pair<long long int, long long int> p = make_pair(p1.first, p2.second);\n       return p;\n     } else if (d1 == c) {\n       pair<long long int, long long int> p1 = fun(l, md1);\n       pair<long long int, long long int> p2 = fun(md1, md2);\n       pair<long long int, long long int> 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<long long int, long long int> 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 <bits/stdc++.h>\n #pragma GCC optimize('O3')\n using namespace std;\n template <class c>\n struct rge {\n   c b, e;\n };\n template <class c>\n rge<c> range(c i, c j) {\n   return rge<c>{i, j};\n }\n template <class c>\n auto dud(c* x) -> decltype(cerr << *x, 0);\n template <class c>\n char dud(...);\n struct debug {\n   template <class c>\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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<pair<int, pair<int, int> > > 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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   vector<int> v(n);\n   for (int i = 0; i < n; i++) {\n     cin >> v[i];\n   }\n   sort(v.begin(), v.end());\n   long long sum = 0;\n   for (int i = 0; i < n / 2; i++) {\n     long long p_sum = v[i] + v[n - i - 1];\n     sum += (p_sum * p_sum);\n   }\n   cout << sum << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> r;\n vector<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n vector<int> 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 <bits/stdc++.h>\n using namespace std;\n const int inf = 1e9 + 7;\n const long long INF = 1e18L + 7;\n template <class n, class second>\n ostream &operator<<(ostream &p, pair<n, second> x) {\n   return p << '<' << x.first << ', ' << x.second << '>';\n }\n template <class n>\n auto operator<<(ostream &p, n y) ->\n     typename enable_if<!is_same<n, string>::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 <class n, class... second>\n void dor(n p, second... y) {\n   cerr << p << ' ';\n   dor(y...);\n }\n template <class n, class second>\n void mini(n &p, second y) {\n   if (p > y) p = y;\n }\n template <class n, class second>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a[3005], b[3005], df[3005];\n long long F[3005][3005];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   cin >> n;\n   for (int i = 1; i <= n; ++i) {\n     cin >> a[i];\n     a[i] = a[i] - i;\n     b[i] = a[i];\n   }\n   sort(b + 1, b + n + 1);\n   int m = 0;\n   b[0] = b[1] - 1;\n   for (int i = 1; i <= n; ++i) {\n     if (b[i] > b[i - 1]) df[++m] = b[i];\n   }\n   for (int i = 1; i <= n; ++i)\n     for (int j = 0; j <= m; ++j) {\n       F[i][j] = 1e18;\n     }\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= m; ++j) {\n       F[i][j] = min(F[i][j - 1], F[i - 1][j] + abs(a[i] - df[j]));\n     }\n   }\n   long long rs = 1e18;\n   for (int i = 1; i <= m; ++i) rs = min(rs, F[n][i]);\n   cout << rs;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('-O2')\n using namespace std;\n const int LIM = 2e5 + 5, MOD = 1e9 + 7;\n int t, n, m, k, x, y;\n template <typename... T>\n void read(T &...args) {\n   ((cin >> args), ...);\n }\n template <typename... T>\n void print(T &&...args) {\n   ((cout << args << ' '), ...);\n }\n int main() {\n   int n;\n   read(n);\n   long long int arr[n];\n   for (int i = 0; i < n; i++) read(arr[i]);\n   sort(arr, arr + n);\n   long long int val = pow(arr[n - 1], 1.0 / (n - 1));\n   long long int a1 = 0, a2 = 0;\n   for (int i = 0; i < n; i++) {\n     a1 += abs(pow(val, i) - arr[i]);\n   }\n   val++;\n   for (int i = 0; i < n; i++) {\n     a2 += abs(pow(val, i) - arr[i]);\n   }\n   long long int curr = pow(val, n - 2), curr2 = pow(val, n - 1);\n   if (curr2 / curr == val)\n     cout << min(a1, a2) << endl;\n   else\n     cout << a1 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n typedef struct frac {\n   long long p, q;\n } frac;\n const double eps = 1e-8;\n int n;\n int nb[100100];\n vector<int> G[100100];\n bool col[100100];\n int cur[100100];\n int onstk[100100];\n inline bool operator<(frac a, frac b) { return a.p * b.q < b.p * a.q; }\n inline bool operator==(frac a, frac b) { return a.p * b.q == b.p * a.q; }\n inline bool operator>(frac a, frac b) { return a.p * b.q > b.p * a.q; }\n inline bool operator>=(frac a, double b) {\n   return ((double)a.p / (double)a.q) >= b;\n }\n inline bool operator!=(frac a, frac b) { return a.p * b.q != b.p * a.q; }\n inline frac newfrac(long long a, long long b) {\n   frac x;\n   x.p = a;\n   x.q = b;\n   return x;\n }\n inline bool valid(double z, bool pr) {\n   priority_queue<pair<frac, int>, vector<pair<frac, int> >,\n                  greater<pair<frac, int> > >\n       S;\n   for (int i = (1); i <= (n); i++) {\n     cur[i] = 0;\n     onstk[i] = false;\n   }\n   for (int x = (1); x <= (n); x++) {\n     if (col[x]) {\n       for (int j = (0); j < (G[x].size()); j++) {\n         int y = G[x][j];\n         if (col[y]) {\n           cur[x]++;\n         }\n       }\n       S.push(make_pair(newfrac(cur[x], nb[x]), x));\n       onstk[x] = true;\n     }\n   }\n   bool ok = false;\n   while (!S.empty()) {\n     if (!onstk[S.top().second]) {\n       S.pop();\n       continue;\n     }\n     if (S.top().first >= z) {\n       ok = true;\n       break;\n     } else {\n       int x = S.top().second;\n       S.pop();\n       onstk[x] = false;\n       for (int j = (0); j < (G[x].size()); j++) {\n         int y = G[x][j];\n         if (onstk[y]) {\n           cur[y]--;\n           S.push(make_pair(newfrac(cur[y], nb[y]), y));\n         }\n       }\n     }\n   }\n   if (pr) {\n     int cnt = 0;\n     vector<int> V;\n     for (int i = (1); i <= (n); i++) {\n       if (onstk[i]) {\n         cnt++;\n         V.push_back(i);\n       }\n     }\n     printf('%d\n', cnt);\n     for (int i = (0); i < (V.size()); i++) {\n       printf('%d', V[i]);\n       if (i < V.size() - 1) {\n         printf(' ');\n       }\n     }\n     printf('\n');\n   }\n   return ok;\n }\n int main() {\n   int m, k, x, y;\n   scanf('%d%d%d', &n, &m, &k);\n   for (int i = (1); i <= (n); i++) {\n     nb[i] = 0;\n     col[i] = true;\n   }\n   for (int i = (1); i <= (k); i++) {\n     scanf('%d', &x);\n     col[x] = false;\n   }\n   for (int i = (1); i <= (m); i++) {\n     scanf('%d%d', &x, &y);\n     nb[x]++;\n     nb[y]++;\n     if ((col[y]) and (col[x])) {\n       G[x].push_back(y);\n       G[y].push_back(x);\n     }\n   }\n   double l = 0.0, r = 1.0;\n   while ((r - l) > eps) {\n     double mid = (l + r) / 2;\n     if (valid(mid, false)) {\n       l = mid;\n     } else {\n       r = mid;\n     }\n   }\n   col[0] = valid(l, true);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int n = 100002;\n char h[n], h1[n];\n int a[n];\n bool check(int e, int r, int v1, int c1) {\n   int c, v, c2, v2;\n   while (e < r) {\n     for (c = 0; c < 10; c++)\n       for (v = 0; v < 10; v++)\n         if (c + v == v1 + h[r]) {\n           if ((c == 0) && (e == 0)) continue;\n           goto st;\n         }\n     if ((h[r] == 9) && (v1 == 10)) {\n       c = 9;\n       v = 0;\n       goto st;\n     }\n     return 0;\n   st:\n     h[r - 1] -= (c + v) / 10;\n     if (h[r - 1] < 0) {\n       for (c2 = r - 2; (c2 >= 0) && (h[c2 + 1] < 0); c2--) {\n         h[c2 + 1] += 10;\n         h[c2]--;\n       }\n       if (c2 < e - 1) return 0;\n     }\n     a[e] = c;\n     a[r] = v;\n     c += v;\n     v = v1 + h[e] - c;\n     if ((v != 0) && (v != 1)) return 0;\n     v1 = v * 10;\n     c1 = c / 10;\n     if (e == r - 1) {\n       if (v == 1) return 0;\n       return 1;\n     }\n     e++;\n     r--;\n   }\n   if (e > r) {\n     if ((v1 + c1 == 11) || (v1 + c1 == 0)) return 1;\n     return 0;\n   }\n   for (c = 0; c < 10; c++)\n     if (c + c == v1 + h[e]) break;\n   if (c == 10) return 0;\n   a[e] = c;\n   return 1;\n }\n int main() {\n   int q, w, e, r, t;\n   scanf('%s', h1);\n   q = strlen(h1);\n   for (w = 0; w < q; w++) h1[w] -= 48;\n   for (w = 0; w < q; w++) h[w] = h1[w];\n   if (check(0, q - 1, 0, 0)) {\n     for (w = 0; w < q; w++) printf('%d', a[w]);\n     return 0;\n   }\n   for (w = 0; w < q; w++) h[w] = h1[w];\n   if ((h[0] == 1) && (check(1, q - 1, 10, 0))) {\n     for (w = 1; w < q; w++) printf('%d', a[w]);\n     return 0;\n   }\n   printf('0');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 10;\n int A, B, C, D;\n struct Point {\n   long long x, y;\n   Point(long long x, long long y) : x(x), y(y) {}\n };\n bool operator<(const Point& a, const Point& b) {\n   return a.x < b.x || (a.x == b.x && a.y > b.y);\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   scanf('%d/%d %d/%d', &A, &B, &C, &D);\n   vector<Point> P;\n   for (int i = 0; i < n; ++i) {\n     int u, v;\n     scanf('%d%d', &u, &v);\n     long long x = (long long)B * v - (long long)A * u;\n     long long y = (long long)C * u - (long long)D * v;\n     if (x > 0 && y > 0) {\n       P.emplace_back(Point(x, y));\n     }\n   }\n   sort(P.begin(), P.end());\n   vector<long long> len;\n   for (auto& it : P) {\n     int idx = lower_bound(len.begin(), len.end(), it.y) - len.begin();\n     if (idx == len.size()) {\n       len.emplace_back(it.y);\n     } else {\n       len[idx] = it.y;\n     }\n   }\n   printf('%d\n', len.size());\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dp[5000][5000];\n int main() {\n   char a[5000], b[5000];\n   int ti, td, tr, te;\n   scanf('%d %d %d %d', &ti, &td, &tr, &te);\n   scanf('%s %s', a, b);\n   int n = strlen(a);\n   int m = strlen(b);\n   dp[0][0] = 0;\n   for (int i = 1; i <= n; i++) dp[i][0] = dp[i - 1][0] + td;\n   for (int i = 1; i <= m; i++) dp[0][i] = dp[0][i - 1] + ti;\n   int da[26];\n   int db;\n   memset(da, 0, sizeof(da));\n   int ii, jj, d;\n   for (int i = 1; i <= n; i++) {\n     db = 0;\n     for (int j = 1; j <= m; j++) {\n       d = (a[i - 1] == b[j - 1]) ? 0 : tr;\n       ii = da[b[j - 1] - 'a'];\n       jj = db;\n       db = (a[i - 1] == b[j - 1]) ? j : db;\n       dp[i][j] =\n           min(dp[i][j - 1] + ti, min(dp[i - 1][j] + td, dp[i - 1][j - 1] + d));\n       if (ii > 0 && jj > 0)\n         dp[i][j] = min(dp[i][j], dp[ii - 1][jj - 1] + (i - ii - 1) * td +\n                                      (j - jj - 1) * ti + te);\n     }\n     da[a[i - 1] - 'a'] = i;\n   }\n   printf('%d\n', dp[n][m]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int n;\n int main() {\n   int i;\n   scanf('%d', &n);\n   for (i = 20; i >= 0; i--) {\n     if (n & (1 << i)) printf('%d ', i + 1);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100005;\n struct all {\n   int t, num;\n   char x, type;\n } a[N];\n bool cmp(all a, all b) { return a.t < b.t; }\n int redhome[N], redaway[N];\n int yellhome[N], yellaway[N];\n string home, away;\n int n;\n int main() {\n   cin >> home >> away;\n   cin >> n;\n   for (int i = 1; i <= n; ++i) cin >> a[i].t >> a[i].x >> a[i].num >> a[i].type;\n   sort(a + 1, a + n + 1, &cmp);\n   for (int i = 1; i <= n; ++i) {\n     if (a[i].x == 'h') {\n       if (a[i].type == 'r') {\n         if (redhome[a[i].num] == 0) {\n           redhome[a[i].num] = a[i].t;\n           cout << home << ' ' << a[i].num << ' ' << a[i].t << endl;\n         }\n       } else {\n         if (yellhome[a[i].num] == 0)\n           yellhome[a[i].num] = a[i].t;\n         else if (redhome[a[i].num] == 0) {\n           redhome[a[i].num] = a[i].t;\n           cout << home << ' ' << a[i].num << ' ' << a[i].t << endl;\n         }\n       }\n     } else {\n       if (a[i].type == 'r') {\n         if (redaway[a[i].num] == 0) {\n           redaway[a[i].num] = a[i].t;\n           cout << away << ' ' << a[i].num << ' ' << a[i].t << endl;\n         }\n       } else {\n         if (yellaway[a[i].num] == 0)\n           yellaway[a[i].num] = a[i].t;\n         else if (redaway[a[i].num] == 0) {\n           redaway[a[i].num] = a[i].t;\n           cout << away << ' ' << a[i].num << ' ' << a[i].t << endl;\n         }\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, p;\n   cin >> n >> p;\n   string s;\n   cin >> s;\n   bool f = 0;\n   int i = s.size() - 1;\n   if (i > 0) {\n     while (s[i] - 'a' == p - 1) {\n       s[i] = 'a';\n       i--;\n     }\n     s[i]++;\n   }\n   if (s.size() == 2) i = s.size() - 1;\n   while (!f) {\n     if (i > 1 && s[i] != s[i - 1] && s[i] != s[i - 2])\n       if (i == s.size() - 1) {\n         f = 1;\n         break;\n       } else\n         i++;\n     else if (i > 1 && (s[i] == s[i - 1] || s[i] == s[i - 2])) {\n       if (s[i] - 'a' < p - 1)\n         s[i]++;\n       else {\n         s[i] = 'a';\n         i--;\n         while (s[i] - 'a' == p - 1 && i >= 0) {\n           s[i] = 'a';\n           i--;\n         }\n         if (i < 0) {\n           f = 0;\n           break;\n         }\n         if (i != 0) s[i]++;\n       }\n     } else if (i == 1 && s[i] != s[i - 1])\n       if (i == s.size() - 1) {\n         f = 1;\n         break;\n       } else\n         i++;\n     else if (i == 1 && s[i] == s[i - 1])\n       if (s[i] - 'a' < p - 1)\n         s[i]++;\n       else {\n         s[i] = 'a';\n         i--;\n         if (s[i] - 'a' == p - 1) {\n           f = 0;\n           break;\n         }\n       }\n     else if (i == 0) {\n       if (s[i] - 'a' < p - 1) {\n         s[i]++;\n         i++;\n       } else {\n         f = 0;\n         break;\n       }\n       if (s.size() == 1) {\n         f = 1;\n         break;\n       }\n     }\n   }\n   if (f != 0)\n     cout << s << endl;\n   else\n     cout << 'NO' << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int euclid(int a, int b, int &x, int &y) {\n   if (!a) {\n     x = 0;\n     y = 1;\n     return b;\n   }\n   int _x, _y;\n   int g = euclid(b % a, a, _x, _y);\n   x = _y - b / a * _x;\n   y = _x;\n   return g;\n }\n void relax(int &obj, int C3, int C4, int C5, int _k3, int k4, int _k5, int &K3,\n            int &K4, int &K5) {\n   int f = abs(C3 * _k3 - C4 * k4) + abs(C4 * k4 - C5 * _k5);\n   if (f < obj) {\n     obj = f;\n     K3 = _k3, K4 = k4, K5 = _k5;\n   }\n }\n int main() {\n   int n, S, a[333];\n   cin >> n >> S;\n   for (int i = 0; i < n; ++i) {\n     cin >> a[i];\n   }\n   int C[11] = {0};\n   for (int _n(n), i(0); i < _n; i++) C[a[i]]++;\n   int K3 = 1011111111, K4 = 1011111111, K5 = 1011111111, F = 1011111111;\n   int ek3 = 1011111111, ek5 = 1011111111;\n   const int D = euclid(C[3], C[5], ek3, ek5);\n   for (int k4 = 0; k4 * C[4] <= S; ++k4) {\n     const int REM = S - k4 * C[4];\n     if (REM % D) continue;\n     int k3 = ek3 * (REM / D), k5 = ek5 * (REM / D);\n     assert(k3 * C[3] + k5 * C[5] == REM);\n     int idx[] = {(k4 - k3 + C[5] / D - 1) / (C[5] / D),\n                  (k5 - k4 + C[3] / D - 1) / (C[3] / D),\n                  (k5 - k4 * C[4] + C[3] / D - 1) / (C[3] / D) + 4,\n                  (k4 * C[4] - k3 + C[5] / D - 1) / (C[5] / D) + 4};\n     for (int o = 0; o < 4; ++o) {\n       int j = idx[o];\n       for (int it = 0; it < 1055; --j, ++it) {\n         int _k3 = k3 + j * (C[5] / D);\n         int _k5 = k5 - j * (C[3] / D);\n         if (_k3 < 0) continue;\n         if (_k3 > k4) continue;\n         if (_k5 < k4) continue;\n         relax(F, C[3], C[4], C[5], _k3, k4, _k5, K3, K4, K5);\n       }\n     }\n   }\n   if (F == 1011111111) {\n     cout << -1 << endl;\n   } else {\n     printf('%d %d %d\n', K3, K4, K5);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize(2)\n using namespace std;\n void qread(int &x) {\n   int neg = 1;\n   x = 0;\n   char c = getchar();\n   while (c < '0' || c > '9') {\n     if (c == '-') neg = -1;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') x = 10 * x + c - '0', c = getchar();\n   x *= neg;\n }\n const int maxn = 100005;\n int n, l, r, k, ans, ansu, ansv;\n vector<pair<int, int> > edge[maxn];\n vector<int> num;\n int oriw[maxn], w[maxn], dep[maxn], lvl[maxn], son[maxn];\n int pos[maxn], dis[maxn];\n pair<int, int> val[maxn];\n namespace Segtree {\n int sz;\n pair<int, int> t[maxn * 4];\n void init(int _sz) {\n   for (sz = 1; sz < _sz; sz <<= 1)\n     ;\n   for (int(i) = 0; (i) < sz << 1; i++) t[i] = make_pair(-1e9, -1e9);\n }\n void update(int v, pair<int, int> val) {\n   v += sz - 1;\n   t[v] = val;\n   for (v >>= 1; v; v >>= 1) t[v] = max(t[v << 1], t[v << 1 | 1]);\n }\n pair<int, int> query(int l, int r) {\n   pair<int, int> res = make_pair(-1e9, -1e9);\n   for (l += sz - 1, r += sz - 1; l <= r; l >>= 1, r >>= 1) {\n     if (l & 1) res = max(res, t[l]), l++;\n     if ((r + 1) & 1) res = max(res, t[r]), r--;\n   }\n   return res;\n }\n }  // namespace Segtree\n void prework1(int x, int p, int d) {\n   dep[x] = lvl[x] = d;\n   for (int(i) = 0; (i) < edge[x].size(); i++) {\n     pair<int, int> y = edge[x][i];\n     if (y.first == p) continue;\n     prework1(y.first, x, d + 1);\n     if (!son[x] || lvl[y.first] > lvl[son[x]]) son[x] = y.first;\n     lvl[x] = max(lvl[x], lvl[y.first]);\n   }\n }\n void prework2(int x, int p) {\n   pos[x] = ++k;\n   if (son[x]) prework2(son[x], x);\n   for (int(i) = 0; (i) < edge[x].size(); i++) {\n     pair<int, int> y = edge[x][i];\n     if (y.first == p || y.first == son[x]) continue;\n     prework2(y.first, x);\n   }\n }\n void work(int x, int p, int cur) {\n   val[pos[x]] = make_pair(cur, x);\n   dis[x] = cur;\n   Segtree::update(pos[x], make_pair(cur, x));\n   for (int(i) = 0; (i) < edge[x].size(); i++) {\n     int y = edge[x][i].first;\n     if (y == son[x]) work(y, x, cur + w[edge[x][i].second]);\n   }\n   for (int(i) = 0; (i) < edge[x].size(); i++) {\n     int y = edge[x][i].first;\n     if (y == p || y == son[x]) continue;\n     work(y, x, cur + w[edge[x][i].second]);\n     int tmp = lvl[y] - dep[y];\n     for (int(d) = 0; (d) < tmp + 1; d++) {\n       int ql = max(l - d - 1, 0), qr = min(r - d - 1, lvl[x] - dep[x]);\n       pair<int, int> val2 = Segtree::query(pos[x] + ql, pos[x] + qr);\n       if (val[pos[y] + d].first + val2.first - 2 * dis[x] > ans) {\n         ans = val[pos[y] + d].first + val2.first - 2 * dis[x];\n         ansu = val[pos[y] + d].second;\n         ansv = val2.second;\n       }\n     }\n     for (int(d) = 0; (d) < tmp + 1; d++) {\n       val[pos[x] + d + 1] = max(val[pos[x] + d + 1], val[pos[y] + d]);\n       Segtree::update(pos[x] + d + 1, val[pos[x] + d + 1]);\n     }\n   }\n   pair<int, int> val2 =\n       Segtree::query(pos[x] + l, pos[x] + min(r, lvl[x] - dep[x]));\n   if (val2.first - dis[x] > ans) {\n     ans = val2.first - dis[x];\n     ansu = x;\n     ansv = val2.second;\n   }\n }\n bool check(int x) {\n   for (int(i) = 1; (i) <= n - 1; i++) {\n     if (oriw[i] < x)\n       w[i] = -1;\n     else\n       w[i] = 1;\n   }\n   Segtree::init(n);\n   for (int(i) = 1; (i) <= n; i++) val[i] = make_pair(-1e9, -1e9);\n   ans = -1e9;\n   work(1, 0, 0);\n   return ans >= 0;\n }\n int main() {\n   scanf('%d%d%d', &n, &l, &r);\n   for (int(i) = 1; (i) <= n - 1; i++) {\n     int u, v;\n     scanf('%d%d%d', &u, &v, &oriw[i]);\n     edge[u].push_back(make_pair(v, i));\n     edge[v].push_back(make_pair(u, i));\n     num.push_back(oriw[i]);\n   }\n   prework1(1, 0, 0);\n   prework2(1, 0);\n   sort(num.begin(), num.end());\n   num.resize(unique(num.begin(), num.end()) - num.begin());\n   int l = 0, r = num.size();\n   while (r - l > 1) {\n     int mid = (l + r) >> 1;\n     if (check(num[mid]))\n       l = mid;\n     else\n       r = mid;\n   }\n   check(num[l]);\n   printf('%d %d\n', ansu, ansv);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using namespace std::chrono;\n struct custom_hash {\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 x + FIXED_RANDOM;\n   }\n };\n void solve() {\n   long long n;\n   cin >> n;\n   for (long long i = 2; i * i <= n; i++) {\n     if (n % i == 0) {\n       cout << n / i << ' ' << n - (n / i) << '\n';\n       return;\n     }\n   }\n   cout << 1 << ' ' << n - 1 << '\n';\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int t;\n   cin >> t;\n   while (t--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MAXN = 200 + 17, inf = 2e18 + 17;\n long long a[MAXN], b[MAXN], n, m, k, t[MAXN][MAXN], np;\n void fillA() {\n   for (int i = 1; i <= m; i++)\n     for (int j = 0; i - j > 0 && j < n; j++) a[i] = min(t[j + 1][i - j], a[i]);\n   for (int i = 1; i <= n; i++)\n     for (int j = 0; i + j <= n && j < m; j++)\n       a[i + m - 1] = min(a[i + m - 1], t[i + j][m - j]);\n }\n void fillBackT() {\n   for (int i = 1; i <= m; i++)\n     for (int j = 0; i - j > 0 && j < n; j++) t[j + 1][i - j] = a[i];\n   for (int i = 1; i <= n; i++)\n     for (int j = 0; i + j <= n && j < m; j++) t[i + j][m - j] = a[i + m - 1];\n }\n long long count(int x) {\n   a[x] = 0;\n   long long dp[MAXN][MAXN] = {};\n   if (a[1] == 1)\n     dp[1][1] = 0;\n   else\n     dp[1][1] = 1;\n   for (int i = 2; i <= np; i++)\n     for (int j = 0; j <= np; j++) {\n       if (a[i] == 1)\n         dp[i][j] = dp[i - 1][j + 1];\n       else if (a[i] == 0)\n         dp[i][j] = (j > 0 ? dp[i - 1][j - 1] : 0);\n       else\n         dp[i][j] =\n             min(inf, (dp[i - 1][j + 1] + (j > 0 ? dp[i - 1][j - 1] : 0)));\n     }\n   return dp[np][0];\n }\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   cin >> n >> m >> k;\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) cin >> t[i][j];\n   fill(a, a + MAXN, inf);\n   fillA();\n   np = n + m - 1;\n   iota(b + 1, b + np + 1, 1);\n   sort(b + 1, b + np + 1, [](int i, int j) { return a[i] < a[j]; });\n   for (int i = 1; i <= np; i++) {\n     long long tmp = count(b[i]);\n     if (tmp >= k)\n       a[b[i]] = 0;\n     else {\n       a[b[i]] = 1;\n       k -= tmp;\n     }\n   }\n   fillBackT();\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= m; j++) cout << (t[i][j] ? ')' : '(');\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int high = 2e5 + 6;\n long long cnt[200005], dif[200005];\n int main() {\n   long long n, m, k, i, j, ans, l, r, d, sum = 0, q;\n   scanf('%lld%lld%lld', &n, &k, &q);\n   for (i = 0; i < n; i++) {\n     scanf('%lld%lld', &l, &r);\n     dif[l]++;\n     dif[r + 1]--;\n   }\n   for (i = 1; i <= high; i++) {\n     dif[i] += dif[i - 1];\n   }\n   for (i = 1; i <= high; i++) {\n     if (dif[i] >= k) {\n       cnt[i] = 1;\n     }\n   }\n   for (i = 1; i <= high; i++) {\n     cnt[i] += cnt[i - 1];\n   }\n   while (q--) {\n     scanf('%lld%lld', &l, &r);\n     printf('%lld\n', cnt[r] - cnt[l - 1]);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long long int MOD = 1000000007ll;\n const int mxsz = 200005;\n using namespace std;\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   long long int n, m, a;\n   cin >> n >> m >> a;\n   int ar1[n + 1], ar2[m + 1];\n   for (int i = 1; i <= n; i++) {\n     cin >> ar1[i];\n   }\n   for (int i = 1; i <= m; i++) {\n     cin >> ar2[i];\n   }\n   sort(ar1 + 1, ar1 + n + 1);\n   sort(ar2 + 1, ar2 + m + 1);\n   vector<long long int> b, p;\n   for (int i = 1; i <= min(n, m); i++) {\n     b.push_back(ar1[n - i + 1]);\n     p.push_back(ar2[i]);\n   }\n   int l = 0, r = min(n, m);\n   int ans = 0;\n   while (l <= r) {\n     int mid = (l + r) / 2;\n     long long int tmp = a;\n     for (int i = 0; i < mid; i++) {\n       tmp -= (long long int)max(0LL, p[mid - i - 1] - b[i]);\n       if (tmp < 0) {\n         break;\n       }\n     }\n     if (tmp >= 0) {\n       l = mid + 1;\n       ans = mid;\n     } else {\n       r = mid - 1;\n     }\n   }\n   cout << ans << ' ';\n   long long int tmp = 0;\n   for (int i = 0; i < ans; i++) {\n     tmp += (long long int)p[i];\n   }\n   cout << max(0LL, tmp - a);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int x[1000], y[1000], k, n, m;\n bool chck(int xx) {\n   vector<int> v;\n   v.push_back(1);\n   v.push_back(m);\n   for (int i = 0; i < k; ++i) {\n     v.push_back(max(1, x[i] - xx));\n     v.push_back(max(1, x[i] - xx - 1));\n     v.push_back(min(m, x[i] + xx));\n     v.push_back(min(m, x[i] + xx + 1));\n   }\n   sort(v.begin(), v.end());\n   int mn = 1e9, mx = -1, tmp, nm, c;\n   bool l;\n   vector<pair<int, int> > f;\n   for (int i = 0; i < v.size(); ++i) {\n     tmp = v[i];\n     f.clear();\n     for (int j = 0; j < k; ++j) {\n       if (x[j] - xx <= tmp && x[j] + xx >= tmp) {\n         f.push_back(make_pair(max(1, y[j] - xx), 0));\n         f.push_back(make_pair(min(n, y[j] + xx), 1));\n       }\n     }\n     sort(f.begin(), f.end());\n     c = 0;\n     nm = 0;\n     l = 0;\n     for (int j = 0; j < f.size(); ++j) {\n       if (nm == 0) {\n         if (f[j].first != c + 1) {\n           break;\n         }\n       }\n       c = f[j].first;\n       if (f[j].second == 0)\n         ++nm;\n       else\n         --nm;\n       if (c == n) {\n         l = 1;\n         break;\n       }\n     }\n     if (!l) {\n       mn = min(mn, tmp);\n       mx = max(mx, tmp);\n     }\n   }\n   mx = min(mx, m);\n   mn = max(1, mn);\n   if (mx - mn + 1 > xx + xx + 1) {\n     return 0;\n   }\n   v.clear();\n   v.push_back(1);\n   v.push_back(n);\n   for (int i = 0; i < k; ++i) {\n     v.push_back(max(1, y[i] - xx));\n     v.push_back(max(1, y[i] - xx - 1));\n     v.push_back(min(n, y[i] + xx));\n     v.push_back(min(n, y[i] + xx + 1));\n   }\n   sort(v.begin(), v.end());\n   mn = 1e9, mx = -1;\n   for (int i = 0; i < v.size(); ++i) {\n     tmp = v[i];\n     f.clear();\n     for (int j = 0; j < k; ++j) {\n       if (y[j] - xx <= tmp && y[j] + xx >= tmp) {\n         f.push_back(make_pair(max(1, x[j] - xx), 0));\n         f.push_back(make_pair(min(m, x[j] + xx), 1));\n       }\n     }\n     sort(f.begin(), f.end());\n     c = 0;\n     nm = 0;\n     l = 0;\n     for (int j = 0; j < f.size(); ++j) {\n       if (nm == 0) {\n         if (f[j].first != c + 1) {\n           break;\n         }\n       }\n       c = f[j].first;\n       if (f[j].second == 0)\n         ++nm;\n       else\n         --nm;\n       if (c == m) {\n         l = 1;\n         break;\n       }\n     }\n     if (!l) {\n       mn = min(mn, tmp);\n       mx = max(mx, tmp);\n     }\n   }\n   mx = min(mx, n);\n   mn = max(1, mn);\n   if (mx - mn + 1 > xx + xx + 1) {\n     return 0;\n   }\n   return 1;\n }\n int main() {\n   while (cin >> m >> n >> k) {\n     for (int i = 0; i < k; ++i) {\n       scanf('%d%d', &x[i], &y[i]);\n     }\n     int st = 0, nd = 1e9, md;\n     while (st < nd) {\n       md = (st + nd) / 2;\n       if (chck(md)) {\n         nd = md;\n       } else {\n         st = md + 1;\n       }\n     }\n     printf('%d\n', nd);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int cansel_sync = (ios::sync_with_stdio(0), cin.tie(0), 0);\n const int N = 200010;\n const int inf = ~0u >> 2;\n const long long INF = ~0ull >> 2;\n long long read() {\n   long long x;\n   if (scanf('%lld', &x) == -1) exit(0);\n   return x;\n }\n const double pi = acos(-1.0);\n double readf() {\n   double x;\n   if (scanf('%lf', &x) == -1) exit(0);\n   return x;\n }\n template <typename T>\n T sqr(const T &x) {\n   return x * x;\n }\n int mod = (1 ? 1000000007 : 998244353);\n long long mul(long long a, long long b, long long m = mod) { return a * b % m; }\n long long qpow(long long a, long long b, long long m = mod) {\n   long long ans = 1;\n   for (; b; a = mul(a, a, m), b >>= 1)\n     if (b & 1) ans = mul(ans, a, m);\n   return ans;\n }\n long long getinv(long long v, long long m = mod) { return qpow(v, m - 2, m); }\n long long n, x, t, l, r, sum;\n void solve() {\n   cin >> n >> x;\n   sum = 0;\n   l = inf, r = -inf;\n   for (long long i = (0), _ = (n); i < _; i++) {\n     cin >> t;\n     if (t % x != 0) l = min(l, i), r = max(r, i);\n     sum += t % x;\n   }\n   if (sum % x != 0) {\n     cout << n << endl;\n     return;\n   }\n   if (l != inf) {\n     cout << max(n - l - 1, r) << endl;\n     return;\n   }\n   cout << -1 << endl;\n }\n signed main() {\n   long long T;\n   cin >> T;\n   while (T--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1E5;\n vector<int> vf, vz;\n int main() {\n   ios_base::sync_with_stdio(false);\n   int n, k, p;\n   cin >> n >> k >> p;\n   for (int i = 0; i < n; i++) {\n     int x;\n     cin >> x;\n     if (x % 2 == 0)\n       vz.push_back(x);\n     else\n       vf.push_back(x);\n   }\n   int tf = vf.size(), tz = vz.size();\n   if (tf < (k - p) || p > tz + (tf - (k - p)) / 2 || (k - p) % 2 != tf % 2)\n     cout << 'NO';\n   else {\n     if ((tf - (k - p)) % 2 == 1) {\n       cout << 'NO';\n     }\n     if ((tf - (k - p)) % 2 == 0) {\n       cout << 'YES' << endl;\n       if (p == 0) {\n         for (int i = 0; i < k - 1; i++) cout << '1 ' << vf[i] << endl;\n         cout << tf - (k - 1) + tz;\n         for (int i = k - 1; i < tf; i++) cout << ' ' << vf[i];\n         for (int i = 0; i < tz; i++) cout << ' ' << vz[i];\n         cout << endl;\n       } else if (tz >= p) {\n         for (int i = 0; i < p - 1; i++) cout << '1 ' << vz[i] << endl;\n         cout << tz - p + 1 + tf - (k - p);\n         for (int i = p - 1; i < tz; i++) cout << ' ' << vz[i];\n         for (int i = 0; i < tf - (k - p); i++) cout << ' ' << vf[i];\n         cout << endl;\n         for (int i = tf - (k - p); i < tf; i++) cout << '1 ' << vf[i] << endl;\n       } else {\n         for (int i = 0; i < tz; i++) cout << '1 ' << vz[i] << endl;\n         for (int i = 0; i < (p - tz) - 1; i++)\n           cout << '2 ' << vf[i * 2] << ' ' << vf[i * 2 + 1] << endl;\n         cout << tf - (p - tz - 1) * 2 - (k - p);\n         for (int i = (p - tz - 1) * 2; i < tf - (k - p); i++)\n           cout << ' ' << vf[i];\n         cout << endl;\n         for (int i = tf - (k - p); i < tf; i++) cout << '1 ' << vf[i] << endl;\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int dx[] = {-1, -1, -1, 0, 1, 1, 1, 0};\n int dy[] = {-1, 0, 1, 1, 1, 0, -1, -1};\n using namespace std;\n long long power(long long a, long long p, long long M) {\n   long long r = 1;\n   a = a % M;\n   while (p > 0) {\n     if (p % 2) r = (r * a) % M;\n     a = (a * a) % M;\n     p /= 2;\n   }\n   return r;\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 n, m;\n set<long long> e[100005];\n stack<long long> cycle, temp;\n long long vis[505];\n bool found;\n void findCycle(long long x) {\n   temp.push(x);\n   vis[x] = 1;\n   for (auto y : e[x]) {\n     if (vis[y] == 0)\n       findCycle(y);\n     else if (vis[y] == 1) {\n       if (found) return;\n       cycle = temp;\n       cycle.push(y);\n       found = 1;\n       return;\n     }\n   }\n   if (!temp.empty()) temp.pop();\n   vis[x] = 2;\n }\n void fc(long long x) {\n   vis[x] = 1;\n   for (auto y : e[x]) {\n     if (vis[y] == 0)\n       fc(y);\n     else if (vis[y] == 1) {\n       found = 1;\n       return;\n     }\n   }\n   vis[x] = 2;\n }\n void solve() {\n   cin >> n >> m;\n   for (long long i = 0; i < m; i++) {\n     long long a, b;\n     scanf('%lld%lld', &a, &b);\n     e[a].insert(b);\n   }\n   for (long long i = 1; i < n + 1; i++) {\n     if (!vis[i]) {\n       findCycle(i);\n       if (found) break;\n     }\n   }\n   if (!found) {\n     cout << 'YES\n';\n     return;\n   }\n   vector<long long> c;\n   for (long long i = 0; i < 505; i++) vis[i] = 0;\n   while (!cycle.empty()) {\n     c.push_back(cycle.top());\n     if (vis[cycle.top()]) {\n       break;\n     }\n     vis[cycle.top()] = 1;\n     cycle.pop();\n   }\n   reverse(c.begin(), c.end());\n   for (long long i = 0; i < c.size() - 1; i++) {\n     found = 0;\n     e[c[i]].erase(c[i + 1]);\n     for (long long j = 0; j < 505; j++) vis[j] = 0;\n     for (long long j = 1; j < n + 1; j++) {\n       if (!vis[j]) fc(j);\n       if (found) {\n         break;\n       }\n     }\n     if (!found) {\n       cout << 'YES\n';\n       return;\n     }\n     e[c[i]].insert(c[i + 1]);\n   }\n   cout << 'NO\n';\n }\n int main() {\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long A, B, N;\n long long L, T, M;\n bool ok(long long R) {\n   long long mx = A + (R - 1) * B;\n   long long mn = A + (L - 1) * B;\n   long long D = R - L;\n   if (mx > T) return false;\n   return (mn * (D + 1) + B * D * (D + 1) / 2) <= T * M;\n }\n int main(void) {\n   cin >> A >> B >> N;\n   while (N--) {\n     cin >> L >> T >> M;\n     long long R = L;\n     long long mn = A + (L - 1) * B;\n     if (mn > T) {\n       R = -1;\n     } else {\n       long long XR = 1LL << 22;\n       while (XR > R) {\n         long long m = (R + XR) / 2;\n         if (!ok(m))\n           XR = m;\n         else\n           R = m + 1;\n       }\n       R -= 1;\n     }\n     cout << R << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1e9 + 7, mod = 1e9 + 9, pw = 31;\n const double eps = 1e-11;\n long long binpow(long long a, long long b) {\n   long long rec = 1;\n   while (b) {\n     if (b % 2 == 1) {\n       rec *= a;\n       rec %= INF;\n     }\n     a *= a;\n     a %= INF;\n     b /= 2;\n   }\n   return rec;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(NULL);\n   int n;\n   cin >> n;\n   long long x = binpow(3, n * 3) - binpow(7, n);\n   if (x < 0) x += INF;\n   cout << x;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long long INF64 = 1e18;\n using namespace std;\n const long long N = 2e5 + 6;\n using namespace std;\n vector<pair<long long, long long>> pf;\n int main() {\n   long long n, ans = INF64;\n   cin >> n;\n   vector<long long> cost(n, 0);\n   vector<string> s;\n   for (int i = 0; i < n; i++) cin >> cost[i];\n   for (int i = 0; i < n; i++) {\n     string st;\n     cin >> st;\n     s.push_back(st);\n   }\n   vector<vector<long long>> dp(n, vector<long long>(2, INF64));\n   dp[n - 1][0] = 0;\n   dp[n - 1][1] = cost[n - 1];\n   for (int i = n - 2; i >= 0; i--) {\n     string currStr(s[i]), currrevStr(s[i]);\n     string prevStr(s[i + 1]), prevrevStr(s[i + 1]);\n     reverse(currrevStr.begin(), currrevStr.end());\n     reverse(prevrevStr.begin(), prevrevStr.end());\n     if (currStr.compare(prevStr) <= 0) dp[i][0] = min(dp[i][0], dp[i + 1][0]);\n     if (currStr.compare(prevrevStr) <= 0)\n       dp[i][0] = min(dp[i][0], dp[i + 1][1]);\n     if (currrevStr.compare(prevStr) <= 0)\n       dp[i][1] = min(dp[i][1], dp[i + 1][0] + cost[i]);\n     if (currrevStr.compare(prevrevStr) <= 0)\n       dp[i][1] = min(dp[i][1], dp[i + 1][1] + cost[i]);\n   }\n   ans = min(ans, min(dp[0][0], dp[0][1]));\n   if (ans == INF64)\n     cout << -1;\n   else\n     cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[100005], n, c, mn[100005], dp[200005], sum;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n >> c;\n   for (int i = 0; i < n; sum += a[i++]) cin >> a[i];\n   deque<long long> v;\n   for (int i = n; i--;) {\n     while (v.size() && v.back() >= i + c) v.pop_back();\n     while (v.size() && a[i] <= a[v.front()]) v.pop_front();\n     v.push_front(i);\n     if (i <= n - c) dp[i] = max(dp[i + 1], a[v.back()] + dp[i + c]);\n   }\n   cout << sum - dp[0];\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T1, typename T2>\n inline T1 max(T1 a, T2 b) {\n   return a < b ? b : a;\n }\n template <typename T1, typename T2>\n inline T1 min(T1 a, T2 b) {\n   return a < b ? a : b;\n }\n const char lf = '\n';\n namespace ae86 {\n const int bufl = 1 << 15;\n char buf[bufl], *s = buf, *t = buf;\n inline int fetch() {\n   if (s == t) {\n     t = (s = buf) + fread(buf, 1, bufl, stdin);\n     if (s == t) return EOF;\n   }\n   return *s++;\n }\n inline int ty() {\n   int a = 0;\n   int b = 1, c = fetch();\n   while (!isdigit(c)) b ^= c == '-', c = fetch();\n   while (isdigit(c)) a = a * 10 + c - 48, c = fetch();\n   return b ? a : -a;\n }\n }  // namespace ae86\n using ae86::ty;\n const int _ = 100007, __ = _ << 1;\n const long long linf = 0x3f3f3f3f3f3f3f3f;\n int to[__], ne[__], he[_] = {0}, ecnt = 1;\n inline void adde(int a, int b) {\n   to[++ecnt] = b, ne[ecnt] = he[a], he[a] = ecnt;\n }\n inline void addde(int a, int b) { adde(a, b), adde(b, a); }\n int n, m, qn;\n int fa[_] = {0}, dep[_] = {0}, sz[_] = {0}, mxch[_] = {0};\n void dfs(int x, int ff) {\n   fa[x] = ff, dep[x] = dep[ff] + 1, sz[x] = 1, mxch[x] = 0;\n   for (int i = he[x]; i; i = ne[i]) {\n     int b = to[i];\n     if (b == ff) continue;\n     dfs(b, x), sz[x] += sz[b];\n     if (sz[mxch[x]] < sz[b]) mxch[x] = b;\n   }\n }\n int dfn[_] = {0}, rdfn[_] = {0}, ndf[_] = {0}, top[_] = {0}, dcnt = 0;\n void dfs2(int x, int tp) {\n   dfn[x] = ++dcnt, rdfn[dcnt] = x, top[x] = tp;\n   if (mxch[x]) dfs2(mxch[x], tp);\n   for (int i = he[x]; i; i = ne[i]) {\n     int b = to[i];\n     if (b == fa[x] || b == mxch[x]) continue;\n     dfs2(b, b);\n   }\n   ndf[x] = dcnt;\n }\n vector<int> hav[_];\n struct cxk {\n   int x;\n   long long v;\n   cxk(int x_ = 0, long long v_ = linf) { x = x_, v = v_; }\n   friend bool operator<(cxk a, cxk b) {\n     if (a.v != b.v) return a.v < b.v;\n     return a.x < b.x;\n   }\n };\n const int _t = _ << 2;\n cxk t[_t];\n long long tadd[_t];\n void up(int x) { t[x] = min(t[(x << 1)], t[(x << 1 | 1)]); }\n void putadd(int x, long long d) { t[x].v += d, tadd[x] += d; }\n void dwn(int x) {\n   if (tadd[x])\n     putadd((x << 1), tadd[x]), putadd((x << 1 | 1), tadd[x]), tadd[x] = 0;\n }\n void plant(int x, int l, int r) {\n   tadd[x] = 0;\n   if (l == r) {\n     t[x] = hav[l].empty() ? cxk() : cxk(l, hav[l].back());\n     return;\n   }\n   plant((x << 1), l, ((l + r) >> 1)),\n       plant((x << 1 | 1), ((l + r) >> 1) + 1, r), up(x);\n }\n void change(int x, int l, int r, int tl, int tr, long long dlt) {\n   if (tl <= l && r <= tr) {\n     putadd(x, dlt);\n     return;\n   }\n   dwn(x);\n   if (tl <= ((l + r) >> 1)) change((x << 1), l, ((l + r) >> 1), tl, tr, dlt);\n   if (tr > ((l + r) >> 1))\n     change((x << 1 | 1), ((l + r) >> 1) + 1, r, tl, tr, dlt);\n   up(x);\n }\n void dating(int x, int l, int r, int tar) {\n   if (l == r) {\n     if (!hav[l].empty()) hav[l].pop_back();\n     t[x] = hav[l].empty() ? cxk() : cxk(l, hav[l].back() + tadd[x]);\n     return;\n   }\n   dwn(x);\n   if (tar <= ((l + r) >> 1))\n     dating((x << 1), l, ((l + r) >> 1), tar);\n   else\n     dating((x << 1 | 1), ((l + r) >> 1) + 1, r, tar);\n   up(x);\n }\n cxk finder(int x, int l, int r, int tl, int tr) {\n   if (tl <= l && r <= tr) return t[x];\n   dwn(x);\n   if (tr <= ((l + r) >> 1)) return finder((x << 1), l, ((l + r) >> 1), tl, tr);\n   if (tl > ((l + r) >> 1))\n     return finder((x << 1 | 1), ((l + r) >> 1) + 1, r, tl, tr);\n   return min(finder((x << 1), l, ((l + r) >> 1), tl, tr),\n              finder((x << 1 | 1), ((l + r) >> 1) + 1, r, tl, tr));\n }\n cxk founder(int a, int b) {\n   cxk ans;\n   while (top[a] != top[b]) {\n     if (dep[top[a]] < dep[top[b]]) swap(a, b);\n     ans = min(ans, finder(1, 1, n, dfn[top[a]], dfn[a])), a = fa[top[a]];\n   }\n   if (dep[a] > dep[b]) swap(a, b);\n   return min(ans, finder(1, 1, n, dfn[a], dfn[b]));\n }\n int main() {\n   ios::sync_with_stdio(0), cout.tie(nullptr);\n   n = ty(), m = ty(), qn = ty();\n   for (int i = 1, a, b; i < n; i++) a = ty(), b = ty(), addde(a, b);\n   dfs(1, 0), dfs2(1, 1);\n   for (int i = 1; i <= m; i++) hav[dfn[ty()]].emplace_back(i);\n   for (int i = 1; i <= n; i++)\n     sort(hav[i].begin(), hav[i].end(), greater<int>());\n   plant(1, 1, n);\n   for (int qq = 1; qq <= qn; qq++) {\n     int op = ty();\n     if (op == 1) {\n       int a = ty(), b = ty(), lim = ty();\n       vector<int> ans;\n       while (lim--) {\n         int ret = founder(a, b).x;\n         if (ret <= 0) break;\n         ans.emplace_back(hav[ret].back()), dating(1, 1, n, ret);\n       }\n       cout << ans.size();\n       for (auto i : ans) cout << ' ' << i;\n       cout << lf;\n     }\n     if (op == 2) {\n       int a = ty(), b = ty();\n       change(1, 1, n, dfn[a], ndf[a], b);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 1010;\n int n;\n int a[MAX], c[MAX];\n void init() { cin >> n; }\n void process() {\n   memset(a, 63, sizeof(a));\n   vector<pair<int, int> > ques;\n   ques.push_back(make_pair(1, n));\n   while (!ques.empty()) {\n     vector<pair<int, int> > newQues;\n     for (int i = 0; i < ques.size(); i++) {\n       if (ques[i].first != ques[i].second) {\n         int l = ques[i].first, r = ques[i].second, mid = (l + r) / 2;\n         newQues.push_back(make_pair(l, mid));\n         newQues.push_back(make_pair(mid + 1, r));\n       }\n     }\n     vector<int> b;\n     for (int i = 0; i < newQues.size(); i += 2) {\n       for (int j = newQues[i].first; j <= newQues[i].second; j++)\n         b.push_back(j);\n     }\n     if (b.size() > 0) {\n       cout << b.size() << '\n';\n       for (int i = 0; i < b.size(); i++) cout << b[i] << ' ';\n       cout << '\n';\n       fflush(stdout);\n       for (int i = 1; i <= n; i++) cin >> c[i];\n       for (int i = 1; i <= n; i++) {\n         bool check = true;\n         for (int j = 0; j < b.size(); j++) {\n           if (b[j] == i) {\n             check = false;\n             break;\n           }\n         }\n         if (check) a[i] = min(a[i], c[i]);\n       }\n     }\n     b.resize(0);\n     for (int i = 1; i < newQues.size(); i += 2) {\n       for (int j = newQues[i].first; j <= newQues[i].second; j++)\n         b.push_back(j);\n     }\n     if (b.size() > 0) {\n       cout << b.size() << '\n';\n       for (int i = 0; i < b.size(); i++) cout << b[i] << ' ';\n       cout << '\n';\n       fflush(stdout);\n       for (int i = 1; i <= n; i++) cin >> c[i];\n       for (int i = 1; i <= n; i++) {\n         bool check = true;\n         for (int j = 0; j < b.size(); j++) {\n           if (b[j] == i) {\n             check = false;\n             break;\n           }\n         }\n         if (check) a[i] = min(a[i], c[i]);\n       }\n     }\n     ques = newQues;\n   }\n   cout << -1 << '\n';\n   for (int i = 1; i <= n; i++) cout << a[i] << ' ';\n   cout << '\n';\n   fflush(stdout);\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   init();\n   process();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 300;\n long long orign[MAXN], str[2 * MAXN];\n int radius[2 * MAXN];\n int n, m;\n int mp[MAXN][MAXN];\n int num[MAXN][26];\n long long hashv[MAXN];\n long long base[30];\n int siz[MAXN];\n bool check(int x, int y) {\n   for (int i = 0; i < 26; i++) {\n     if (num[x][i] != num[y][i]) return false;\n   }\n   return true;\n }\n void Manacher(int len, int mark = 0) {\n   for (int i = 0; i < len; i++) {\n     str[2 * i + 1] = orign[i];\n     str[2 * i] = mark;\n   }\n   str[2 * len] = mark;\n   len = 2 * len + 1;\n   int max_right = 0, pos = 0;\n   for (int i = 0; i < len; i++) {\n     if (i < max_right)\n       radius[i] = min(radius[2 * pos - i], max_right - i);\n     else\n       radius[i] = 1;\n     while (i - radius[i] >= 0 && i + radius[i] < len &&\n            str[i - radius[i]] > -1 && str[i + radius[i]] > -1 &&\n            check(str[i - radius[i]], str[i + radius[i]])) {\n       radius[i]++;\n     }\n     if (i + radius[i] >= max_right) {\n       max_right = i + radius[i];\n       pos = i;\n     }\n   }\n }\n int main() {\n   std::ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n >> m;\n   base[0] = 1;\n   for (int i = 1; i <= 26; i++) base[i] = base[i - 1] * 2;\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= m; j++) {\n       char ch;\n       cin >> ch;\n       mp[i][j] = ch - 'a';\n     }\n   }\n   long long ans = 0;\n   for (int l = 1; l <= m; l++) {\n     memset(num, 0, sizeof(num));\n     memset(hashv, 0, sizeof(hashv));\n     memset(siz, 0, sizeof(siz));\n     for (int r = l; r <= m; r++) {\n       for (int i = 1; i <= n; i++) {\n         int id = mp[i][r];\n         num[i][id]++;\n         hashv[i] += base[id];\n         if (num[i][id] & 1)\n           siz[i]++;\n         else\n           siz[i]--;\n         if (siz[i] > 1)\n           orign[i - 1] = -i;\n         else\n           orign[i - 1] = i;\n       }\n       Manacher(n);\n       for (int i = 0; i < 2 * n + 1; i++) {\n         if (str[i] > -1) ans += radius[i] / 2;\n       }\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 10000010;\n int p[N], num, last[N];\n bool flag[N];\n int cnt[N], n, m;\n void make_prime() {\n   for (int i = 2; i < N; ++i)\n     if (!flag[i]) {\n       p[num++] = i;\n       last[i] = i;\n       for (int j = i + i; j < N; j += i) flag[j] = true, last[j] = i;\n     }\n }\n int main() {\n   make_prime();\n   scanf('%d', &n);\n   for (int i = 0, x; i < n; ++i) {\n     scanf('%d', &x);\n     int s = -1;\n     while (x != 1) {\n       if (last[x] != s) cnt[last[x]]++;\n       s = last[x];\n       x /= last[x];\n     }\n   }\n   for (int i = 1; i < N; ++i) cnt[i] += cnt[i - 1];\n   scanf('%d', &m);\n   for (int i = 0, x, y; i < m; ++i) {\n     scanf('%d %d', &x, &y);\n     if (x >= N)\n       puts('0');\n     else {\n       y = min(y, N - 1);\n       printf('%d\n', cnt[y] - cnt[x - 1]);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n const int N = 2005;\n const int M = 730;\n int Head[M * 10], Next[M * 100], vet[M * 100];\n int a[N], b[N], d[M * 10], vis[15], p[M][5], dis[M], Dis[M], P[10], len[M],\n     U[M][12], D[M][12];\n int n, cnt, edgenum;\n pair<int, int> c[M];\n queue<int> q;\n inline int F(int x, int y) { return (x - 1) * cnt + y; }\n inline void addedge(int u, int v) {\n   edgenum++;\n   vet[edgenum] = v;\n   Next[edgenum] = Head[u];\n   Head[u] = edgenum;\n }\n int main() {\n   scanf('%d', &n);\n   int ans = INF;\n   for (int i = 1; i <= n; i++) scanf('%d%d', &a[i], &b[i]);\n   len[cnt = 1] = 0;\n   for (int i = 1; i <= 9; i++) {\n     len[++cnt] = 1;\n     p[cnt][1] = i;\n     for (int j = i; j <= 9; j++) {\n       len[++cnt] = 2;\n       p[cnt][1] = i, p[cnt][2] = j;\n       for (int k = j; k <= 9; k++) {\n         len[++cnt] = 3;\n         p[cnt][1] = i, p[cnt][2] = j, p[cnt][3] = k;\n         for (int t = k; t <= 9; t++)\n           len[++cnt] = 4, p[cnt][1] = i, p[cnt][2] = j, p[cnt][3] = k,\n           p[cnt][4] = t;\n       }\n     }\n   }\n   for (int i = 2; i <= cnt; i++) {\n     memset(vis, 0, sizeof(vis));\n     for (int j = 1; j <= len[i]; j++) vis[p[i][j]] = 1;\n     for (int j = 1; j <= 9; j++) {\n       if (!vis[j]) continue;\n       int res = j, cur = 0;\n       for (int k = 1; k <= len[i]; k++)\n         if (p[i][k] == res)\n           res = -1;\n         else\n           P[++cur] = p[i][k];\n       for (int k = 1; k <= cnt; k++) {\n         if (len[k] != cur) continue;\n         bool flag = 1;\n         for (int t = 1; t <= cur; t++) flag &= (P[t] == p[k][t]);\n         if (flag) {\n           D[i][j] = k;\n           U[k][j] = i;\n           break;\n         }\n       }\n     }\n   }\n   memset(dis, 0x3f, sizeof(dis));\n   dis[1] = a[1] - 1;\n   for (int j = 1; j < 9; j++)\n     for (int k = 1; k <= cnt; k++)\n       addedge(F(j, k), F(j + 1, k)), addedge(F(j + 1, k), F(j, k));\n   for (int j = 1; j <= 9; j++)\n     for (int k = 1; k <= cnt; k++)\n       if (D[k][j]) addedge(F(j, k), F(j, D[k][j]));\n   for (int i = 1; i <= n; i++) {\n     memset(Dis, 0x3f, sizeof(Dis));\n     for (int j = 1; j <= cnt; j++)\n       if (U[j][b[i]]) Dis[U[j][b[i]]] = min(Dis[U[j][b[i]]], dis[j] + 1);\n     for (int j = 1; j <= cnt; j++) dis[j] = Dis[j];\n     memset(d, 0x3f, sizeof(d));\n     for (int j = 1; j <= cnt; j++)\n       d[F(a[i], j)] = dis[j], c[j] = make_pair(dis[j], j);\n     sort(c + 1, c + 1 + cnt);\n     for (int j = 1; j <= cnt; j++)\n       if (c[j].first != INF) q.push(F(a[i], c[j].second));\n     while (!q.empty()) {\n       int u = q.front();\n       q.pop();\n       for (int e = Head[u]; e; e = Next[e]) {\n         int v = vet[e];\n         if (d[v] > d[u] + 1) d[v] = d[u] + 1, q.push(v);\n       }\n     }\n     if (i == n)\n       for (int j = 1; j <= 9; j++) ans = min(ans, d[F(j, 1)]);\n     else\n       for (int j = 1; j <= cnt; j++) dis[j] = d[F(a[i + 1], j)];\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 3003 * 6006;\n const int qwq = 303030;\n const int inf = 0x3f3f3f3f;\n int n, m, k;\n int f[N], fa[N], st[123], cnt;\n int ans;\n int ff[] = {1, 1, 1, 0, -1, -1, -1, 0};\n int gg[] = {1, 0, -1, -1, -1, 0, 1, 1};\n inline int read() {\n   int sum = 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     sum = sum * 10 + c - '0';\n     c = getchar();\n   }\n   return sum * f;\n }\n inline int dian(int x, int y) {\n   if (y == 0) y = 2 * m;\n   if (y == 2 * m + 1) y = 1;\n   return (x - 1) * (m << 1) + y;\n }\n int find(int u) {\n   while (fa[u] != u) u = fa[u];\n   return u;\n }\n int Splay(int u) { return fa[u] == u ? u : fa[u] = Splay(fa[u]); }\n int main() {\n   int x, y;\n   n = read();\n   m = read();\n   k = read();\n   if (m == 1) {\n     cout << 0;\n     return 0;\n   }\n   for (int i = 1; i <= n * m * 2; i++) fa[i] = i;\n   while (k--) {\n     cnt = 0;\n     x = read();\n     y = read();\n     for (int i = 0; i <= 8; i++) {\n       if (x + ff[i] < 1 || x + ff[i] > n) continue;\n       int u = dian(x + ff[i], y + gg[i]);\n       if (!f[u]) continue;\n       int aa = find(u);\n       int bb = find(dian(x, y));\n       if (aa == bb) continue;\n       st[++cnt] = bb;\n       fa[bb] = aa;\n     }\n     y += m;\n     for (int i = 0; i < 8; i++) {\n       if (x + ff[i] < 1 || x + ff[i] > n) continue;\n       int u = dian(x + ff[i], y + gg[i]);\n       if (!f[u]) continue;\n       int aa = find(u);\n       int bb = find(dian(x, y));\n       if (aa == bb) continue;\n       st[++cnt] = bb;\n       fa[bb] = aa;\n     }\n     y -= m;\n     if (find(dian(x, y)) != find(dian(x, y + m))) {\n       ans++;\n       for (int i = 0; i < 8; i++) {\n         if (x + ff[i] < 1 || x + ff[i] > n) continue;\n         Splay(dian(x + ff[i], y + gg[i]));\n       }\n       y += m;\n       for (int i = 0; i < 8; i++) {\n         if (x + ff[i] < 1 || x + ff[i] > n) continue;\n         Splay(dian(x + ff[i], y + gg[i]));\n       }\n       y -= m;\n       f[dian(x, y)] = f[dian(x, y + m)] = 1;\n     } else {\n       for (int i = 1; i <= cnt; i++) fa[st[i]] = st[i];\n     }\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, sum;\n int main() {\n   cin >> n;\n   while (n != 0) {\n     if (n % 8 == 1) sum++;\n     n /= 8;\n   }\n   cout << sum;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1 << 29;\n const int MOD = 1000000007;\n bool isPowerOfTwo(long long int x) { return x && (!(x & (x - 1))); }\n void fastio() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n }\n const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};\n const int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};\n int main() {\n   fastio();\n   int t = 1;\n   while (t--) {\n     int n;\n     cin >> n;\n     string s;\n     cin >> s;\n     int ans = 0;\n     for (int i = 0; i < (s.length()); i++) {\n       int x = int(s[i]) - 48;\n       if (x % 2 == 0) ans += (i + 1);\n     }\n     cout << ans << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<long long, int> mp;\n int n;\n int main() {\n   scanf('%d', &n);\n   int t;\n   long long s = 0;\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &t);\n     s += t;\n     mp[s]++;\n   }\n   int ans = 0;\n   map<long long, int>::iterator it;\n   for (it = mp.begin(); it != mp.end(); it++) {\n     ans = max(ans, it->second);\n   }\n   printf('%d\n', n - ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> edge[100005];\n int v[100005];\n bool cycle = false;\n int mx = -1, last;\n void dfs(int u, int dis = 0) {\n   v[u] = 1;\n   if (dis > mx) {\n     mx = dis;\n     last = u;\n   }\n   for (int i = 0; i <= (int)((int)edge[u].size() - 1); i++) {\n     int first = edge[u][i];\n     if (!v[first]) dfs(first, dis + 1);\n   }\n }\n int main() {\n   int T, n, m, a, b;\n   scanf('%d', &n);\n   scanf('%d', &m);\n   for (int i = 1; i <= (int)(m); i++) {\n     scanf('%d%d', &a, &b);\n     edge[a].push_back(b);\n     edge[b].push_back(a);\n   }\n   dfs(1);\n   memset(v, 0, sizeof(v));\n   mx = -1;\n   dfs(last);\n   printf('%d', mx);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1 << 29;\n const double EPS = 1e-10;\n vector<int> G[50010];\n vector<int> chil[50010];\n int cnt[50010][510];\n void dfs(int pos, int par) {\n   for (int i = 0; i < (int)G[pos].size(); i++) {\n     if (G[pos][i] != par) {\n       chil[pos].push_back(G[pos][i]);\n       dfs(G[pos][i], pos);\n     }\n   }\n }\n void init(int n) {\n   memset(cnt, 0, sizeof(cnt));\n   dfs(0, -1);\n }\n void calc(int v, int k, long long &sum) {\n   for (int i = 0; i < (int)chil[v].size(); i++) {\n     int c = chil[v][i];\n     calc(c, k, sum);\n     for (int j = 0; j < k; j++) {\n       sum += (long long)cnt[c][j] * cnt[v][k - j - 1];\n     }\n     for (int j = 0; j < k; j++) {\n       cnt[v][j + 1] += cnt[c][j];\n     }\n   }\n   cnt[v][0] = 1;\n   sum += (long long)cnt[v][0] * cnt[v][k];\n }\n int main() {\n   int n, k, a, b;\n   cin >> n >> k;\n   for (int i = 0; i < n - 1; i++) {\n     cin >> a >> b;\n     a--, b--;\n     G[a].push_back(b);\n     G[b].push_back(a);\n   }\n   init(n);\n   long long res = 0;\n   calc(0, k, res);\n   cout << res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct P {\n   int x, y;\n   bool operator<(const P &p) {\n     if (x != p.x)\n       return x < p.x;\n     else\n       return y < p.y;\n   }\n };\n int main() {\n   int T;\n   cin >> T;\n   for (int t = 0; t < T; ++t) {\n     int n;\n     cin >> n;\n     int bsz = n / 3;\n     vector<int> buf(bsz);\n     for (int i = 0; i < n / 3; ++i) {\n       cout << '? ' << 3 * i + 1 << ' ' << 3 * i + 2 << ' ' << 3 * i + 3 << endl;\n       cout.flush();\n       cin >> buf[i];\n       if (buf[i] == -1) {\n         break;\n       }\n     }\n     int ind0, ind1;\n     for (int i = 0; i < bsz; ++i) {\n       int indl = i;\n       int indr = (i + 1) % bsz;\n       if (buf[indl] != buf[indr]) {\n         vector<int> tbuf(6);\n         tbuf[0] = buf[indl];\n         for (int j = 1; j <= 5; ++j) {\n           int v1 = (3 * indl + j) % n + 1;\n           int v2 = (3 * indl + j + 1) % n + 1;\n           int v3 = (3 * indl + j + 2) % n + 1;\n           cout << '? ' << v1 << ' ' << v2 << ' ' << v3 << endl;\n           cout.flush();\n           cin >> tbuf[j];\n           if (tbuf[j] == -1) {\n             break;\n           }\n           if (tbuf[j - 1] != tbuf[j]) {\n             if (tbuf[j - 1] == 0) {\n               ind0 = (3 * indl + j - 1) % n + 1;\n               ind1 = v3;\n             } else {\n               ind1 = (3 * indl + j - 1) % n + 1;\n               ind0 = v3;\n             }\n             break;\n           }\n         }\n         break;\n       }\n     }\n     vector<int> mapping(n);\n     mapping[ind1 - 1] = 1;\n     int tmp;\n     for (int i = 0; i < bsz; ++i) {\n       int v1 = 3 * i + 1;\n       int v2 = 3 * i + 2;\n       int v3 = 3 * i + 3;\n       if (buf[i] == 0) {\n         if (v1 == ind1) {\n           cout << '? ' << ind1 << ' ' << ind0 << ' ' << v2 << endl;\n         } else if (v2 == ind1) {\n           cout << '? ' << ind1 << ' ' << v1 << ' ' << ind0 << endl;\n         } else {\n           cout << '? ' << ind1 << ' ' << v1 << ' ' << v2 << endl;\n         }\n         cout.flush();\n         cin >> tmp;\n         if (tmp == 0) {\n           mapping[v1 - 1] = 0;\n           mapping[v2 - 1] = 0;\n           if (v3 == ind0) {\n             tmp = 0;\n           } else if (v3 == ind1) {\n             tmp = 1;\n           } else {\n             cout << '? ' << ind0 << ' ' << ind1 << ' ' << v3 << endl;\n             cout.flush();\n             cin >> tmp;\n           }\n           mapping[v3 - 1] = tmp;\n         } else {\n           mapping[v3 - 1] = 0;\n           if (ind0 == v1) {\n             tmp = 0;\n           } else if (ind1 == v1) {\n             tmp = 1;\n           } else {\n             cout << '? ' << ind0 << ' ' << ind1 << ' ' << v1 << endl;\n             cout.flush();\n             cin >> tmp;\n           }\n           mapping[v1 - 1] = tmp;\n           mapping[v2 - 1] = 1 - tmp;\n         }\n       } else {\n         if (v1 == ind0) {\n           cout << '? ' << ind0 << ' ' << ind1 << ' ' << v2 << endl;\n         } else if (v2 == ind0) {\n           cout << '? ' << ind0 << ' ' << v1 << ' ' << ind1 << endl;\n         } else {\n           cout << '? ' << ind0 << ' ' << v1 << ' ' << v2 << endl;\n         }\n         cout.flush();\n         cin >> tmp;\n         if (tmp == 1) {\n           mapping[v1 - 1] = 1;\n           mapping[v2 - 1] = 1;\n           if (v3 == ind0) {\n             tmp = 0;\n           } else if (v3 == ind1) {\n             tmp = 1;\n           } else {\n             cout << '? ' << ind0 << ' ' << ind1 << ' ' << v3 << endl;\n             cout.flush();\n             cin >> tmp;\n           }\n           mapping[v3 - 1] = tmp;\n         } else {\n           mapping[v3 - 1] = 1;\n           if (v1 == ind0) {\n             tmp = 0;\n           } else if (v1 == ind1) {\n             tmp = 1;\n           } else {\n             cout << '? ' << ind0 << ' ' << ind1 << ' ' << v1 << endl;\n             cout.flush();\n             cin >> tmp;\n           }\n           mapping[v1 - 1] = tmp;\n           mapping[v2 - 1] = 1 - tmp;\n         }\n       }\n     }\n     vector<int> fake;\n     for (int i = 0; i < n; ++i) {\n       if (mapping[i] == 0) {\n         fake.push_back(i + 1);\n       }\n     }\n     cout << '! ' << fake.size();\n     for (int i = 0; i < fake.size(); ++i) {\n       cout << ' ' << fake[i];\n     }\n     cout << endl;\n     cout.flush();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, k, a, b, c, d;\n   scanf('%d%d%d%d%d%d', &n, &k, &a, &b, &c, &d);\n   if (n <= 4 || k < n + 1) {\n     puts('-1');\n     return 0;\n   }\n   printf('%d %d', a, c);\n   for (int i = 1; i <= n; i++) {\n     if (i != a && i != b && i != c && i != d) printf(' %d', i);\n   }\n   printf(' %d %d\n', d, b);\n   printf('%d %d', c, a);\n   for (int i = 1; i <= n; i++) {\n     if (i != a && i != b && i != c && i != d) printf(' %d', i);\n   }\n   printf(' %d %d\n', b, d);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n const int N = 2e5 + 10;\n const long long inf = 1e18;\n const int maxm = 1005;\n vector<vector<char>> matrix(maxm, vector<char>(maxm));\n struct event {\n   int x, y, size;\n };\n int dx[] = {0, 0, 1, -1};\n int dy[] = {-1, 1, 0, 0};\n class even {\n  public:\n   int a, b, c;\n };\n class evenl {\n  public:\n   int a, b, c, ind;\n };\n struct myComp {\n   constexpr bool operator()(evenl f, evenl s) const noexcept {\n     int z = f.b - f.a;\n     int z2 = s.b - s.a;\n     z -= f.c;\n     z2 -= s.c;\n     return z < z2;\n   }\n };\n long long poww(long long a, long long b, long long m) {\n   if (b == 0) return 1ll;\n   if (b % 2 == 1) return a * poww(a, b - 1, m) % m;\n   long long rs = poww(a, b / 2, m);\n   rs = rs * rs % m;\n   return rs;\n }\n long long fact[N];\n long long ncr(long long n, long long r) {\n   long long num = fact[n];\n   long long deno = fact[n - r] * fact[r] % mod;\n   deno = poww(deno, mod - 2, mod);\n   num = num * deno;\n   num = num % mod;\n   return num;\n }\n long long convert(long long a, long long b) {\n   string s;\n   while (a > 0) {\n     long long p = a % b;\n     s += p + '0';\n     a = a / b;\n   }\n   reverse(s.begin(), s.end());\n   long long res = stoi(s);\n   return res;\n }\n long long make(long long a, long long b, long long c) {\n   while (a < b) a *= c;\n   return a % b;\n }\n long long frog_jump(long long pos, long long n) {\n   while (pos % 2 == 0) {\n     pos = pos + (n - pos / 2);\n   }\n   return (pos + 1) / 2;\n }\n void solve() {\n   long long n, q;\n   cin >> n >> q;\n   for (int i = 0; i < q; i++) {\n     long long x;\n     cin >> x;\n     if (x % 2 != 0) {\n       cout << (x + 1) / 2 << '\n';\n       continue;\n     }\n     long long z = frog_jump(x, n);\n     cout << z << '\n';\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n double aa[12];\n int sign[12];\n int compare(const void *a, const void *b) {\n   int i = *(int *)a;\n   int j = *(int *)b;\n   if (sign[i] != sign[j]) return sign[j] - sign[i];\n   if (sign[i] == 0) return i - j;\n   return aa[i] == aa[j] ? i - j : aa[i] > aa[j] ? -sign[i] : sign[i];\n }\n void power(int i, double x, double y, double z) {\n   if (x == 1)\n     sign[i] = 0;\n   else if (x > 1) {\n     sign[i] = 1;\n     aa[i] = z * log(y) + log(log(x));\n   } else {\n     sign[i] = -1;\n     aa[i] = z * log(y) + log(-log(x));\n   }\n }\n void power_(int i, double x, double yz) {\n   if (x == 1)\n     sign[i] = 0;\n   else if (x > 1) {\n     sign[i] = 1;\n     aa[i] = log(yz) + log(log(x));\n   } else {\n     sign[i] = -1;\n     aa[i] = log(yz) + log(-log(x));\n   }\n }\n int main() {\n   static char ss[12][16] = {'x^y^z', 'x^z^y', '(x^y)^z', '(x^z)^y',\n                             'y^x^z', 'y^z^x', '(y^x)^z', '(y^z)^x',\n                             'z^x^y', 'z^y^x', '(z^x)^y', '(z^y)^x'};\n   static int ii[12];\n   double x, y, z;\n   int i;\n   scanf('%lf%lf%lf', &x, &y, &z);\n   power(0, x, y, z);\n   power(1, x, z, y);\n   power_(2, x, y * z);\n   power_(3, x, y * z);\n   power(4, y, x, z);\n   power(5, y, z, x);\n   power_(6, y, x * z);\n   power_(7, y, x * z);\n   power(8, z, x, y);\n   power(9, z, y, x);\n   power_(10, z, x * y);\n   power_(11, z, x * y);\n   for (i = 0; i < 12; i++) ii[i] = i;\n   qsort(ii, 12, sizeof *ii, compare);\n   printf('%s\n', ss[ii[0]]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   int n, m;\n   cin >> n >> m;\n   vector<int> a(n);\n   for (int i = 0; i < n; ++i) {\n     cin >> a[i];\n   }\n   vector<int> rightInc(n), leftInc(n);\n   int end = 0, cur_count = 1;\n   for (int i = 0; i < n; ++i) {\n     if (end < i) {\n       end = i, cur_count = 1;\n     }\n     while (end + 1 < n && a[end + 1] >= a[end]) {\n       end++, cur_count++;\n     }\n     rightInc[i] = end - i + 1, cur_count--;\n   }\n   reverse(a.begin(), a.end());\n   end = 0, cur_count = 1;\n   for (int i = 0; i < n; ++i) {\n     if (end < i) {\n       end = i, cur_count = 1;\n     }\n     while (end + 1 < n && a[end + 1] >= a[end]) {\n       end++, cur_count++;\n     }\n     leftInc[i] = end - i + 1, cur_count--;\n   }\n   reverse(leftInc.begin(), leftInc.end());\n   while (m--) {\n     int l, r;\n     cin >> l >> r;\n     --l, --r;\n     if (rightInc[l] + leftInc[r] >= r - l + 1)\n       cout << 'Yes\n';\n     else\n       cout << 'No\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 3e6 + 7;\n const int INF = 0x7fffffff;\n int n, m;\n struct DATA {\n   int strid;\n   int index;\n };\n vector<DATA> vec;\n string str[maxn];\n char ans[maxn];\n bool cmp(DATA a, DATA b) { return a.index < b.index; }\n int main() {\n   while (cin >> n) {\n     memset(ans, 0, sizeof(ans));\n     vec.clear();\n     for (int i = 0; i < n; i++) {\n       int num;\n       cin >> str[i];\n       scanf('%d', &num);\n       for (int j = 0; j < num; j++) {\n         int k;\n         scanf('%d', &k);\n         k--;\n         DATA t;\n         t.strid = i;\n         t.index = k;\n         vec.push_back(t);\n       }\n     }\n     int last = -1;\n     sort(vec.begin(), vec.end(), cmp);\n     for (int i = 0; i < vec.size(); i++) {\n       for (int j = max(last + 1, vec[i].index);\n            j < vec[i].index + str[vec[i].strid].size(); j++) {\n         ans[j] = str[vec[i].strid][j - vec[i].index];\n         last = max(last, j);\n       }\n     }\n     for (int i = 0; i <= last; i++) {\n       if (ans[i] != 0)\n         printf('%c', ans[i]);\n       else {\n         printf('a');\n       }\n     }\n     puts('');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int num[3];\n   cin >> num[0] >> num[1] >> num[2];\n   char c1 = '*', c2 = '*';\n   if (num[0] == 1) c1 = '+';\n   if (num[2] == 1) c2 = '+';\n   if (num[1] == 1 && num[0] != 1 && num[2] != 1) {\n     cout << max(num[0] * (num[1] + num[2]), (num[0] + num[1]) * num[2]);\n     return 0;\n   }\n   if (c1 == '+' && c2 == '*') {\n     cout << ((num[0] + num[1]) * num[2]);\n     return 0;\n   }\n   if (c2 == '+' && c1 == '*') {\n     cout << (num[0] * (num[1] + num[2]));\n     return 0;\n   }\n   if (c1 == '+' && c2 == '+') {\n     cout << (num[0] + num[1] + num[2]);\n     return 0;\n   }\n   cout << (num[0] * num[1] * num[2]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   scanf('%d', &n);\n   long long int arr[100];\n   for (int i = 0; i < n; i++) cin >> arr[i];\n   long long int cnt[5];\n   long long int p[5];\n   for (int i = 0; i < 5; i++) cin >> p[i];\n   long long int min = 1000000009;\n   for (int i = 0; i < 5; i++)\n     if (p[i] < min) min = p[i];\n   for (int i = 0; i < 5; i++) cnt[i] = 0;\n   long long int ps = 0;\n   for (int i = 0; i < n; i++) {\n     ps = ps + arr[i];\n     while (ps >= min) {\n       long long int pp;\n       for (int j = 4; j >= 0; j--) {\n         if (ps < min) break;\n         pp = ps / p[j];\n         ps = ps - pp * p[j];\n         cnt[j] += pp;\n       }\n     }\n   }\n   for (int i = 0; i < 5; i++) cout << cnt[i] << ' ';\n   cout << '\n' << ps << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long t, n, m, cap, lis[200500], high, low;\n long long f(long long x) {\n   long long res = 0, cnt = 0, buf = 0;\n   for (int i = (0); i <= ((int)(n)-1); i++)\n     if (lis[i] <= x) {\n       if (!cnt) {\n         res += buf;\n         buf = 0;\n       }\n       cnt++;\n       buf += lis[i];\n       res += lis[i];\n       if (cnt == m) {\n         cnt = 0;\n       }\n     }\n   return res;\n }\n long long g(long long x) {\n   long long res = 0, task = 0, cnt = 0, buf = 0;\n   for (int i = (0); i <= ((int)(n)-1); i++)\n     if (lis[i] <= x) {\n       if (!cnt) {\n         res += buf;\n         buf = 0;\n       }\n       if (res + lis[i] > cap) break;\n       res += lis[i];\n       cnt++;\n       buf += lis[i];\n       task++;\n       if (cnt == m) {\n         cnt = 0;\n       }\n     }\n   return task;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin >> t;\n   while (t--) {\n     cin >> n >> m >> cap;\n     for (int i = (0); i <= ((int)(n)-1); i++) cin >> lis[i];\n     high = cap, low = 1;\n     while (high > low) {\n       long long chs = (high + low) / 2;\n       if (f(chs) > cap)\n         high = chs;\n       else\n         low = chs + 1;\n     }\n     long long gh = g(high), gh1 = g(high - 1);\n     if (gh > gh1 || high == 1)\n       cout << gh << ' ' << high << endl;\n     else\n       cout << gh1 << ' ' << high - 1 << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int dp[2010][2010];\n long long int a[2010];\n long long int b[2010];\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i] >> b[i];\n   }\n   for (int i = 0; i <= 2000; i++) {\n     for (int j = 0; j <= 2000; j++) {\n       dp[i][j] = 10000000000000000;\n     }\n   }\n   dp[0][0] = 0;\n   for (int i = 1; i <= n; i++) {\n     long long int o = a[i] + 1;\n     for (int j = 0; j <= n; j++) {\n       o = a[i] + 1;\n       if (j == 0) {\n         dp[i][j] = 0;\n       }\n       if (o >= j) {\n         o = j;\n       }\n       if (j >= o) {\n         dp[i][j] = min(b[i] + dp[i - 1][j - (o)], dp[i][j]);\n       }\n       dp[i][j] = min(dp[i][j], dp[i - 1][j]);\n     }\n   }\n   cout << dp[n][n] << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long long int MOD = 1e9 + 7;\n const long long int INF = 1011111111;\n const long long int LLINF = 1000111000111000111LL;\n const long double EPS = 1e-10;\n const long double PI = 3.14159265358979323;\n using namespace std;\n long long int power(int x, int n) {\n   if (n == 0)\n     return 1;\n   else if (n % 2 == 0)\n     return power((x * x), n / 2);\n   else\n     return x * power((x * x), (n - 1) / 2);\n }\n long long int dp[5005][5005];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long int n, m, i, j, k;\n   cin >> n >> k;\n   vector<long long int> v(n);\n   for (i = 0; i < n; i++) cin >> v[i];\n   sort(v.begin(), v.end());\n   vector<pair<pair<long long int, long long int>, long long int> > check;\n   vector<long long int>::iterator it;\n   for (i = 0; i < n; i++) {\n     long long int idx;\n     it = upper_bound(v.begin(), v.end(), v[i] + 5);\n     if (it == v.end())\n       idx = n - 1;\n     else {\n       idx = it - v.begin();\n       idx--;\n     }\n     check.push_back({{i, idx}, idx - i + 1});\n   }\n   long long int ans = 0;\n   for (i = 0; i < n; i++) {\n     for (j = 0; j <= k; j++) {\n       dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);\n       if (j + 1 <= k)\n         dp[i + check[i].second][j + 1] =\n             max(dp[i + check[i].second][j + 1], dp[i][j] + check[i].second);\n     }\n   }\n   cout << dp[n][k];\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 5, oo = 0x3f3f3f3f, mod = 1e9 + 7;\n int a[N], n, tree[N], srt[N], ans[N];\n void update(int a, int val) {\n   while (a <= n) {\n     tree[a] = max(val, tree[a]);\n     a += a & -a;\n   }\n }\n int query(int a) {\n   int mx = 0;\n   while (a > 0) {\n     mx = max(tree[a], mx);\n     a -= a & -a;\n   }\n   return mx;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', a + i);\n     srt[i] = a[i];\n   }\n   sort(srt + 1, srt + n + 1);\n   for (int i = n; i >= 1; i--) {\n     int idx = lower_bound(srt + 1, srt + n + 1, a[i]) - srt;\n     update(idx, i);\n     ans[i] = query(idx - 1);\n     if (ans[i] == 0)\n       ans[i]--;\n     else\n       ans[i] -= i + 1;\n   }\n   for (int i = 1; i <= n; i++) printf('%d ', ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 2e5 + 9;\n int n, maxx;\n struct p {\n   int lei, num, x;\n } a[maxn];\n int da[maxn], b[maxn], vis[maxn];\n int main() {\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> b[i];\n   int w;\n   cin >> w;\n   for (int i = 1; i <= w; i++) {\n     cin >> a[i].lei;\n     if (a[i].lei == 1) {\n       cin >> a[i].num >> a[i].x;\n       vis[a[i].num] = i;\n       b[a[i].num] = a[i].x;\n     } else {\n       cin >> a[i].x;\n       maxx = max(maxx, a[i].x);\n     }\n   }\n   for (int i = w; i >= 1; i--) {\n     if (a[i].lei == 1)\n       da[i] = da[i + 1];\n     else\n       da[i] = max(da[i + 1], a[i].x);\n   }\n   for (int i = 1; i <= n; i++) {\n     if (vis[i] == 0)\n       cout << max(b[i], maxx) << ' ';\n     else {\n       int xu = vis[i];\n       cout << max(b[i], da[xu]) << ' ';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int INF = 0x3f3f3f3f;\n const int N = 579;\n const long long P = 1000000007;\n int n, b[N];\n long long d[N][N];\n long long solve(int l, int r) {\n   if (l == r) return 1;\n   static bool used[N][N];\n   static long long ans[N][N];\n   if (used[l][r]) return ans[l][r];\n   used[l][r] = true;\n   ++l;\n   ++r;\n   d[l][0] = 1;\n   for (int i = 0; i < r - l; ++i) {\n     if (d[l][i + 1] != -1) continue;\n     int c = l + i;\n     d[l][i + 1] = 0;\n     for (int j = 0; j <= i; ++j)\n       if (b[j + l] < b[c + 1]) (d[l][i + 1] += d[l][j] * solve(j + l, c)) %= P;\n   }\n   long long res = 0;\n   for (int j = 0; j <= r - l - 1; ++j)\n     (res += d[l][j] * solve(j + l, r - 1)) %= P;\n   --l;\n   --r;\n   return ans[l][r] = res;\n }\n int main() {\n   memset(d, -1, sizeof(d));\n   std::cin >> n;\n   for (int i = 0; i < n; ++i) std::cin >> b[i];\n   if (b[0] == 1)\n     std::cout << solve(0, n - 1) << '\n';\n   else\n     std::cout << 0 << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n vector<pair<int, double>> 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 <bits/stdc++.h>\n using namespace std;\n void quickly_quickly_kro() {\n   long long n;\n   cin >> n;\n   vector<long long> v(n);\n   for (long long i = 0; i < n; i++) cin >> v[i];\n   ;\n   map<long long, long long> 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<long long, long long> 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 <bits/stdc++.h>\n using namespace std;\n struct HashMap {\n   vector<pair<int, int> > 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<int> row[100011];\n vector<int> 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 <bits/stdc++.h>\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<int> 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<int>::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 <bits/stdc++.h>\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<int> 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<int> w;\n     vector<int> 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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s[1100];\n int vis[1100];\n int num[100];\n int main() {\n   ios::sync_with_stdio(false);\n   int n, len, k;\n   cin >> n >> len >> k;\n   string st;\n   cin >> st;\n   for (int i = 0; i < st.size(); i++) {\n     num[st[i] - 'a']++;\n   }\n   int l = 0, r = 25;\n   for (int i = k + 1; i <= n; i++) {\n     for (int j = 1; j <= len; j++) {\n       while (!num[r] && r > l) r--;\n       s[i] += (char)(r + 'a');\n       num[r]--;\n     }\n   }\n   int now = 0;\n   int pos = 0;\n   while (1) {\n     for (int i = 1; i <= k; i++) {\n       if (vis[i]) continue;\n       if (pos >= 1 && i != k && (int)(s[i][pos - 1] - 'a') < now) {\n         for (int j = pos + 1; j <= len; j++) {\n           while (!num[r] && r > l) r--;\n           s[i] += (char)(r + 'a');\n           num[r]--;\n         }\n         vis[i] = 1;\n         continue;\n       }\n       while (!num[l] && r > l) l++;\n       s[i] += (char)(l + 'a');\n       num[l]--;\n       if (i == k) {\n         now = l;\n       }\n     }\n     pos++;\n     if (pos == len) break;\n   }\n   sort(s + 1, s + 1 + n);\n   for (int i = 1; i <= n; i++) cout << s[i] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int T, n, m, nw, a[110][110], id[110][110], pos[110], p[110];\n char ch;\n bool cmp(int i, int j) { return a[m][i] < a[m][j]; }\n queue<int> q;\n void find(int x) {\n   p[x] = 0;\n   int y = id[x][pos[x]];\n   pos[x]--;\n   if (!p[y])\n     p[y] = x, p[x] = y;\n   else if (a[y][x] > a[y][p[y]]) {\n     p[p[y]] = 0, q.push(p[y]);\n     p[y] = x, p[x] = y;\n   }\n   if (!p[x]) q.push(x);\n }\n void work() {\n   for (int i = 1; i <= 2 * n; i++) {\n     for (int j = 1; j <= n; j++) id[i][j] = (i <= n) * n + j;\n     m = i;\n     sort(id[i] + 1, id[i] + n + 1, cmp);\n     p[i] = 0;\n   }\n   for (int i = 1; i <= n; i++) pos[i] = n, q.push(i);\n   while (!q.empty()) {\n     int u = q.front();\n     q.pop();\n     find(u);\n   }\n   for (int i = 1; i <= n; i++) assert(p[i]);\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= n; j++)\n       assert(!(a[p[i]][i] < a[p[i]][j] && a[j][p[i]] > a[j][p[j]]));\n }\n void solve() {\n   bool falg = 0;\n   scanf('%d', &n);\n   memset(a, 0, sizeof(a)), memset(id, 0, sizeof(id));\n   for (int i = 1; i <= n; i++)\n     for (int j = n + 1; j <= 2 * n; j++)\n       scanf('%d', &a[i][j]), a[j][i] = -a[i][j];\n   puts('B'), fflush(stdout);\n   scanf(' %c%d', &ch, &nw);\n   if (ch == 'I') falg ^= 1;\n   if (nw > n) falg ^= 1;\n   if (falg)\n     for (int i = 1; i <= 2 * n; i++)\n       for (int j = 1; j <= 2 * n; j++) a[i][j] = -a[i][j];\n   work();\n   printf('%d\n', p[nw]), fflush(stdout);\n   while (~scanf('%d', &nw)) {\n     if (nw == -1) return;\n     printf('%d\n', p[nw]), fflush(stdout);\n   }\n }\n int main() {\n   scanf('%d', &T);\n   while (T--) solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 9;\n vector<int> getBorder(const string str) {\n   int n = str.size();\n   vector<int> border(n, -1);\n   for (int i = 1, j = -1; i < n; i++) {\n     while (j >= 0 && str[i] != str[j + 1]) {\n       j = border[j];\n     }\n     if (str[i] == str[j + 1]) j++;\n     border[i] = j;\n   }\n   return border;\n }\n int matchPattern(string txt, string pat, const vector<int> border) {\n   int freq = 0;\n   for (int i = 0, j = -1; i < (int)txt.size(); i++) {\n     while (j >= 0 && txt[i] != pat[j + 1]) {\n       j = border[j];\n     }\n     if (txt[i] == pat[j + 1]) {\n       j++;\n     }\n     if (j + 1 == (int)pat.size()) {\n       freq++;\n       j = border[j];\n     }\n   }\n   return freq;\n }\n string cut(string s, int p, bool pref = true) {\n   if (!pref) {\n     reverse(s.begin(), s.end());\n   }\n   while ((int)s.size() >= p) s.pop_back();\n   if (!pref) {\n     reverse(s.begin(), s.end());\n   }\n   return s;\n }\n const int ms = 210;\n string pref[ms], suf[ms];\n long long trans[ms];\n int bk = 14;\n long long getFreq(int n, string pat, long long k) {\n   std::vector<long long> f(n + 1, 0);\n   if (pat == '0') f[0]++;\n   if (pat == '1') f[1]++;\n   auto border = getBorder(pat);\n   for (int i = 2; i <= n; i++) {\n     long long cur = trans[i - 2];\n     if (i < bk + 4) {\n       string curString = cut(suf[i - 2], (int)pat.size(), false) +\n                          cut(pref[i - 1], (int)pat.size());\n       cur = matchPattern(curString, pat, border);\n     }\n     f[i] = f[i - 1] + f[i - 2] + cur;\n     if (f[i] > k) return k + 1;\n     trans[i] = cur;\n   }\n   return min(f[n], k + 1);\n }\n int main() {\n   pref[0] = suf[0] = '0';\n   pref[1] = suf[1] = '1';\n   for (int i = 2; i < ms; i++) {\n     pref[i] = cut(pref[i - 2] + pref[i - 1], ms);\n     suf[i] = cut(suf[i - 2] + suf[i - 1], ms, false);\n   }\n   int n, m;\n   long long k;\n   cin >> n >> k >> m;\n   if (n == 0) {\n     cout << '0\n';\n     return 0;\n   }\n   if (n == 1) {\n     cout << '1\n';\n     return 0;\n   }\n   string ans;\n   k--;\n   while (k >= 0 && (int)ans.size() < m) {\n     if (ans.size() > 0 &&\n         suf[n].substr(suf[n].size() - ans.size(), ans.size()) == ans) {\n       k--;\n     }\n     if (k < 0) break;\n     ans += '0';\n     long long got = getFreq(n, ans, k);\n     if (got <= k) {\n       ans.back() = '1';\n       k -= got;\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int tag[10];\n int main() {\n   string a, b;\n   while (cin >> a >> b) {\n     memset(tag, 0, sizeof(tag));\n     ;\n     int len = a.size();\n     int len1 = b.size();\n     for (int i = 0; i < len1; i++) {\n       int num = b[i] - '0';\n       tag[num]++;\n     }\n     for (int i = 0; i < len; i++) {\n       int p = a[i] - '0';\n       int j = 9;\n       while (j > p) {\n         if (!tag[j]) j--;\n         if (tag[j] && j > p) {\n           a[i] = j + '0';\n           tag[j]--;\n           break;\n         }\n       }\n     }\n     for (int i = 0; i < len; i++) cout << a[i];\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1000000007;\n int n, k;\n bool d[1001];\n long long dp[1001][2][1001];\n int cnt[10001];\n long long DP(int i, bool f, int j) {\n   if (i == n) return cnt[j] == k;\n   if (dp[i][f][j] != -1) return dp[i][f][j];\n   long long ret = 0;\n   if (d[i] == 1)\n     ret = (ret + DP(i + 1, f, j + 1)) % mod;\n   else if (d[i] == 0 and f)\n     ret = (ret + DP(i + 1, f, j + 1)) % mod;\n   ret = (ret + DP(i + 1, f | (d[i] == 1), j)) % mod;\n   return dp[i][f][j] = ret;\n }\n int main() {\n   for (int i = 1; i <= 1000; i++) {\n     cnt[i] = 1 + cnt[__builtin_popcount(i)];\n   }\n   string s;\n   cin >> s;\n   n = s.size();\n   cin >> k;\n   int i = 0;\n   for (char c : s) d[i++] = c - '0';\n   memset(dp, -1, sizeof dp);\n   cout << DP(0, 0, 0) - (k == 1);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long int INF = 1e18, N = 2e6 + 3, BASE = 130;\n int main() {\n   long long int n, k;\n   cin >> n >> k;\n   vector<int> arr(n), up(n);\n   for (int i = 0; i < n; i++) {\n     cin >> arr[i];\n   }\n   for (int i = n - 2; i >= 0; i--) {\n     if (arr[i + 1] == 1) {\n       up[i] = up[i + 1] + 1;\n     } else {\n       up[i] = 0;\n     }\n   }\n   long long int ans = 0;\n   for (int i = 0; i < n; i++) {\n     int ind = i;\n     long long int p = 1;\n     long long int sum = 0;\n     int cnt = 0;\n     while (ind < n && cnt <= 20) {\n       if (p > INF / arr[ind]) {\n         break;\n       }\n       p *= arr[ind];\n       sum += arr[ind];\n       cnt++;\n       if (p % sum == 0 && p / sum == k) {\n         ans++;\n       }\n       if (up[ind]) {\n         if (p % k == 0) {\n           long long int num = p / k;\n           if (sum + 1 <= num && num <= sum + up[ind]) {\n             ans++;\n           }\n         }\n       }\n       sum += up[ind];\n       ind = ind + 1 + up[ind];\n     }\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void PLAY() {\n   cout << fixed << setprecision(10);\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, m;\n   cin >> n >> m;\n   vector<string> x(n), y(m), ans;\n   for (int i = 0; i < n; i++) {\n     cin >> x[i];\n   }\n   for (int i = 0; i < m; i++) {\n     cin >> y[i];\n   }\n   long long q;\n   cin >> q;\n   while (q--) {\n     long long a;\n     cin >> a;\n     a--;\n     cout << x[a % n] + y[a % m] << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/stack:64000000')\n using namespace std;\n const double PI = 2 * acos(0.0);\n const double eps = 1e-9;\n template <class T>\n T jog(T a, T b) {\n   return a + b;\n }\n template <class T>\n T bog(T a, T b) {\n   return a - b;\n }\n template <class T>\n T gon(T a, T b) {\n   return a * b;\n }\n template <class T>\n T sq(T x) {\n   return x * x;\n }\n template <class T>\n T gcd(T a, T b) {\n   return b == 0 ? a : gcd(b, a % b);\n }\n template <class T>\n T lcm(T a, T b) {\n   return (a / gcd(a, b)) * b;\n }\n template <class T>\n T power(T a, T p) {\n   T res = 1, x = a;\n   while (p) {\n     if (p & 1) res = res * x;\n     x = x * x;\n     p >>= 1;\n   }\n   return res;\n }\n template <class T>\n T cordinatlenth(T a, T b, T c, T d) {\n   return sqrt(sq(a - c) + sq(b - d));\n }\n template <class T>\n string toString(T n) {\n   ostringstream oss;\n   oss << n;\n   oss.flush();\n   return oss.str();\n }\n int toInt(string s) {\n   int r = 0;\n   istringstream sin(s);\n   sin >> r;\n   return r;\n }\n long long bigmod(long long a, long long p, long long mod) {\n   long long res = 1, x = a;\n   while (p) {\n     if (p & 1) res = (res * x) % mod;\n     x = (x * x) % mod;\n     p >>= 1;\n   }\n   return res;\n }\n int diraction1[] = {-1, 0, 0, 1, 1, -1, -1, 1};\n int diraction2[] = {0, -1, 1, 0, 1, -1, 1, -1};\n int horsed1[] = {-2, -2, -1, 1, 2, 2, 1, -1};\n int horsed2[] = {1, -1, -2, -2, -1, 1, 2, 2};\n void input();\n const int INF = 2147483647;\n const long long LINF = 9223372036854775807ll;\n int n, in[1000010];\n int main() {\n   input();\n   return 0;\n }\n void input() {\n   memset(in, 0, sizeof(in));\n   cin >> n;\n   for (int i = 0, tmp; i < n; i++) {\n     scanf('%d', &tmp);\n     in[tmp]++;\n   }\n   long long ans = 0;\n   for (int i = 0; i < 1000005; i++) {\n     if (in[i] == 0 || in[i] == 1) continue;\n     while (in[i] > 1) {\n       ans++;\n       in[i + 1]++;\n       in[i]--;\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int changed;\n int answer1, answer2 = 1023;\n int main() {\n   cin >> n;\n   int i;\n   for (i = 0; i < n; i++) {\n     char tp;\n     cin >> tp;\n     if (tp == '|') {\n       int number;\n       cin >> number;\n       answer1 |= number;\n       answer2 |= number;\n       changed |= number;\n     } else if (tp == '&') {\n       int number;\n       cin >> number;\n       answer1 &= number;\n       answer2 &= number;\n       number = 1023 - number;\n       changed |= number;\n     } else {\n       int number;\n       cin >> number;\n       answer1 ^= number;\n       answer2 ^= number;\n     }\n   }\n   int answer11 = 0;\n   int answer22 = 0;\n   int answer33 = 0;\n   for (i = 0; i < 10; i++) {\n     if ((answer1 & (1 << i)) && (answer2 & (1 << i))) {\n       answer11 += 1 << i;\n     } else {\n       if ((answer1 & (1 << i)) && (!(answer2 & (1 << i)))) {\n         answer33 += 1 << i;\n         answer22 += 1 << i;\n       }\n       if ((!(answer1 & (1 << i))) && (answer2 & (1 << i))) {\n         answer22 += 1 << i;\n       }\n     }\n   }\n   cout << 3 << endl;\n   cout << '& ' << answer22 << endl;\n   cout << '| ' << answer11 << endl;\n   cout << '^ ' << answer33 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 1;\n string s, t;\n char c[N];\n int cs[2][N], ct[2][N], q;\n int main() {\n   scanf(' %s', c);\n   s = c;\n   scanf(' %s', c);\n   t = c;\n   int at = 0;\n   for (auto &i : s) {\n     at++;\n     if (i == 'C' || i == 'B') {\n       i = 'B';\n       cs[1][at] = cs[1][at - 1] + 1;\n     } else {\n       cs[1][at] = cs[1][at - 1];\n       cs[0][at] = cs[0][at - 1] + 1;\n     }\n   }\n   at = 0;\n   for (auto &i : t) {\n     at++;\n     if (i == 'C' || i == 'B') {\n       i = 'B';\n       ct[1][at] = ct[1][at - 1] + 1;\n     } else {\n       ct[1][at] = ct[1][at - 1];\n       ct[0][at] = ct[0][at - 1] + 1;\n     }\n   }\n   scanf('%d', &q);\n   for (int i = 0, a, b, c, d; i < q; i++) {\n     scanf('%d%d%d%d', &a, &b, &c, &d);\n     int difs = cs[1][b] - cs[1][a - 1];\n     int dift = ct[1][d] - ct[1][c - 1];\n     bool thereis = 0;\n     int need = dift - difs;\n     int trails = min(b - a + 1, cs[0][b]);\n     int trailt = min(d - c + 1, ct[0][d]);\n     if (need & 1) {\n       printf('0');\n       continue;\n     }\n     if (need < 0) {\n       printf('0');\n       continue;\n     }\n     if (!need) {\n       if (trails < trailt || (trails - trailt) % 3) {\n         printf('0');\n         continue;\n       }\n       printf('1');\n       continue;\n     }\n     if (need && trails > trailt) {\n       trails = trailt;\n       thereis = 1;\n     }\n     if ((trails - trailt) % 3 || trails < trailt) {\n       printf('0');\n       continue;\n     }\n     thereis |= difs;\n     if (!thereis && need) {\n       printf('0');\n       continue;\n     }\n     printf('1');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline T maxi(T a, T b) {\n   return a > b ? a : b;\n }\n template <typename T>\n inline T mini(T a, T b) {\n   return a < b ? a : b;\n }\n template <typename T>\n inline T absl(T a) {\n   return a > 0 ? a : -a;\n }\n template <typename T>\n inline T gcd(T a, T b) {\n   T t;\n   if (a < b) {\n     while (a) {\n       t = a;\n       a = b % a;\n       b = t;\n     }\n     return b;\n   } else {\n     while (b) {\n       t = b;\n       b = a % b;\n       a = t;\n     }\n     return a;\n   }\n }\n template <typename T>\n inline T ceiling(T a, T b) {\n   if (b < 0) {\n     a *= -1;\n     b *= -1;\n   }\n   if ((double)a / (double)b < 0) return 0;\n   {\n     if (a % b == 0) return (a / b);\n     return ((a / b) + 1);\n   }\n }\n vector<int> adj[500000];\n map<pair<int, int>, int> m;\n vector<pair<int, int> > v(500000);\n vector<bool> visited(500000, false);\n int d;\n void dfs(int u, int c) {\n   visited[u] = true;\n   for (auto it : adj[u]) {\n     if (!visited[it]) {\n       m[{u, it}] = c % d;\n       ++c;\n       dfs(it, c);\n     }\n   }\n }\n void input() {\n   int n, k;\n   cin >> n >> k;\n   for (int i = 0; i < n - 1; ++i) {\n     int s, d;\n     cin >> s >> d;\n     --s;\n     --d;\n     adj[s].push_back(d);\n     adj[d].push_back(s);\n     v[i].first = s;\n     v[i].second = d;\n   }\n   int b[n];\n   for (int i = 0; i < n; ++i) {\n     b[i] = adj[i].size();\n   }\n   sort(b, b + n, greater<int>());\n   d = b[k];\n   cout << d << endl;\n   dfs(0, 0);\n   for (int i = 0; i < n - 1; ++i) {\n     cout << maxi(m[v[i]], m[{v[i].second, v[i].first}]) + 1 << ' ';\n   }\n }\n int main() {\n   input();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 5;\n struct node {\n   int l, r, sum;\n } hjt[maxn * 40];\n int a[maxn], root[maxn], cnt;\n int last[maxn];\n void insert(int l, int r, int pre, int &now, int p, int v) {\n   hjt[++cnt] = hjt[pre];\n   now = cnt;\n   hjt[now].sum = hjt[pre].sum + v;\n   if (l == r) return;\n   int m = (l + r) >> 1;\n   if (p <= m)\n     insert(l, m, hjt[pre].l, hjt[now].l, p, v);\n   else\n     insert(m + 1, r, hjt[pre].r, hjt[now].r, p, v);\n }\n int query(int now, int l, int r, int k) {\n   if (l == r) {\n     if (hjt[now].sum <= k) return l;\n     return l - 1;\n   }\n   int mid = (l + r) >> 1;\n   int tmp = hjt[hjt[now].l].sum;\n   if (tmp > k)\n     return query(hjt[now].l, l, mid, k);\n   else\n     return query(hjt[now].r, mid + 1, r, k - tmp);\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> a[i];\n   for (int i = n; i >= 1; i--) {\n     if (last[a[i]]) {\n       insert(1, n, root[i + 1], root[i], last[a[i]], -1);\n       insert(1, n, root[i], root[i], i, 1);\n     } else\n       insert(1, n, root[i + 1], root[i], i, 1);\n     last[a[i]] = i;\n   }\n   for (int i = 1; i <= n; i++) {\n     int ans = 0, l = 1, r = 0;\n     while (l <= n) {\n       r = query(root[l], 1, n, i);\n       l = r + 1;\n       ans++;\n     }\n     cout << ans;\n     if (i == n)\n       cout << '\n';\n     else\n       cout << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, k;\n int num = 0;\n int e[21][21];\n int flag[21];\n int dfs(int x, int sum, int mid) {\n   if (x > n) {\n     num = num + 1;\n   } else {\n     mid = dfs(x + 1, sum, mid);\n     for (int y = 1; y <= n; y++) {\n       if (num >= k) {\n         break;\n       }\n       if (flag[y] == 0 && e[x][y] != 0 && sum + e[x][y] <= mid) {\n         flag[y] = 1;\n         mid = dfs(x + 1, sum + e[x][y], mid);\n         flag[y] = 0;\n       }\n     }\n   }\n   return mid;\n }\n int main() {\n   int u, v, w;\n   cin >> n >> m >> k;\n   for (int i = 0; i <= 20; i++) {\n     for (int j = 0; j <= 20; j++) {\n       e[i][j] = 0;\n     }\n   }\n   int l = 0;\n   int h = n * 1000;\n   int mid = 0;\n   for (int i = 0; i < m; i++) {\n     cin >> u >> v >> w;\n     e[u][v] = w;\n   }\n   while (l < h) {\n     num = 0;\n     mid = (l + h) / 2;\n     mid = dfs(1, 0, mid);\n     if (num < k) {\n       l = mid + 1;\n     } else {\n       h = mid;\n     }\n   }\n   cout << h << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 50005;\n const int MAXD = 55;\n const int MOD = 1e9 + 7;\n template <typename T>\n inline void read(T &AKNOI) {\n   T x = 0, flag = 1;\n   char ch = getchar();\n   while (!isdigit(ch)) {\n     if (ch == '-') flag = -1;\n     ch = getchar();\n   }\n   while (isdigit(ch)) {\n     x = x * 10 + ch - '0';\n     ch = getchar();\n   }\n   AKNOI = flag * x;\n }\n namespace ModCalculator {\n inline void Inc(int &x, int y) {\n   x += y;\n   if (x >= MOD) x -= MOD;\n }\n inline void Dec(int &x, int y) {\n   x -= y;\n   if (x < 0) x += MOD;\n }\n inline int Add(int x, int y) {\n   Inc(x, y);\n   return x;\n }\n inline int Sub(int x, int y) {\n   Dec(x, y);\n   return x;\n }\n inline int Mul(int x, int y) { return 1LL * x * y % MOD; }\n }  // namespace ModCalculator\n using namespace ModCalculator;\n char s[MAXN], sx[MAXD], sy[MAXD];\n int n, d, dg[MAXD];\n int tot, ch[MAXN][10], fail[MAXN], ed[MAXN], q[MAXN];\n int dp[MAXD][MAXN];\n void Insert(int l, int r) {\n   int p = 0;\n   for (int i = l; i <= r; ++i) {\n     int x = s[i] - '0';\n     if (!ch[p][x]) ch[p][x] = ++tot;\n     p = ch[p][x];\n   }\n   ed[p] = 1;\n }\n void GetFail() {\n   int head = 1, tail = 0;\n   for (int i = 0; i < 10; ++i) {\n     if (ch[0][i]) {\n       q[++tail] = ch[0][i];\n     }\n   }\n   while (head <= tail) {\n     int u = q[head++];\n     for (int i = 0; i < 10; ++i) {\n       if (ch[u][i]) {\n         fail[ch[u][i]] = ch[fail[u]][i];\n         q[++tail] = ch[u][i];\n       } else {\n         ch[u][i] = ch[fail[u]][i];\n       }\n     }\n   }\n }\n int DP(int i, int j, bool full) {\n   if (i > d) return 1;\n   if (!full && dp[i][j] != -1) return dp[i][j];\n   int ret = 0, r = (full ? dg[i] : 9);\n   for (int k = 0; k <= r; ++k) {\n     if (ed[ch[j][k]]) continue;\n     Inc(ret, DP(i + 1, ch[j][k], full && (k == r)));\n   }\n   if (!full) dp[i][j] = ret;\n   return ret;\n }\n int Calc(char *ss) {\n   int ret = 0;\n   for (int i = 1; i <= d; ++i) {\n     ret = Add(Mul(ret, 10), (dg[i] = ss[i] - '0'));\n   }\n   return Sub(ret, DP(1, 0, 1));\n }\n void init() {\n   scanf('%s', s + 1);\n   n = strlen(s + 1);\n   scanf('%s', sx + 1);\n   scanf('%s', sy + 1);\n   d = strlen(sx + 1);\n   int d2 = d / 2;\n   for (int i = 1; i + d2 - 1 <= n; ++i) {\n     Insert(i, i + d2 - 1);\n   }\n   GetFail();\n }\n void solve() {\n   int p = d;\n   for (; sx[p] == '0'; sx[p--] = '9')\n     ;\n   sx[p] -= 1;\n   memset(dp, -1, sizeof(dp));\n   printf('%d\n', Sub(Calc(sy), Calc(sx)));\n }\n int main() {\n   init();\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mdin(long long a, long long m) {\n   long long r1 = m, r2 = a, t1 = 0, t2 = 1;\n   while (r2 > 0) {\n     long long q = r1 / r2;\n     long long r = r1 % r2;\n     r1 = r2;\n     r2 = r;\n     long long t = (t1 - q * t2) % m;\n     t1 = t2;\n     t2 = t;\n   }\n   return (t1 + m) % m;\n }\n long long ex(long long a, long long n, long long m) {\n   if (n == 0) return 1;\n   long long ans = ex((a * a) % m, n / 2, m);\n   if (n % 2) ans = (a * ans) % m;\n   return ans;\n }\n void bfs(int r, vector<int> adj[], int n) {\n   queue<int> q, l;\n   vector<int> vis(n + 1, 0);\n   q.push(r);\n   l.push(1);\n   while (!q.empty()) {\n     int nd = q.front();\n     q.pop();\n     int lv = l.front();\n     l.pop();\n     for (auto it : adj[nd]) {\n       if (vis[it] == 0) {\n         vis[it] = 1;\n         q.push(it);\n         l.push(lv + 1);\n       }\n     }\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long t = 1;\n   while (t--) {\n     long long n, k;\n     cin >> n >> k;\n     if (k > n - 1) {\n       cout << 0;\n       return 0;\n     }\n     long long f[n + 1], inf[n + 1];\n     f[0] = 1;\n     inf[0] = 1;\n     for (long long i = 1; i <= n; i++) {\n       f[i] = (i * f[i - 1]) % 998244353;\n       inf[i] = mdin(f[i], 998244353);\n     }\n     if (k == 0) {\n       cout << f[n] << endl;\n     } else {\n       long long ans = (((f[n] * inf[n - k]) % 998244353) * inf[k]) % 998244353;\n       k = n - k;\n       long long ml = 0;\n       int s = 1;\n       for (long long i = 0; i <= k - 1; i++) {\n         long long cm = (((f[k] * inf[i]) % 998244353) * inf[k - i]) % 998244353;\n         long long t = k - i;\n         long long et = ex(t, n, 998244353);\n         ml = (ml + (cm * et * s) % 998244353 + 998244353) % 998244353;\n         s *= -1;\n       }\n       ans = (((ml * ans) % 998244353) * 2) % 998244353;\n       cout << ans << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n using namespace std;\n #define mod        1000000007\n #define pb         push_back\n #define mp         make_pair\n #define rep(n)     for(int i=0;i<n;i++)\n #define repit(x)   for(auto it : x)\n #define ll         long long\n #define vi         vector<int>\n #define vc         vector<char>\n #define vs         vector<string>\n #define mii        map<int ,int>\n #define mci        map<char ,int>\n /* bool prime[100001];\n  const int N=100000;\n  void sieve() {\n  int i,j;\n for(i=2;i<=N;i++)\n prime[i]=true;\n  prime[0]=prime[1]=false;\n for(i=2;i*i<=N;i++){\n if(prime[i]){\n for(j=i*i;j<=N;j+=i)\n prime[j]=false;\n }\n }\n }*/\n int gcd(int a,int b){\n if(b==0)\n return a;\n else\n return gcd(b,a%b);\n }\n void swap(int *x,int *y){\n int temp=*x;\n *x=*y;\n *y=temp;\n }\n int main()\n {\n     \n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n int t;\n cin>>t;\n while(t--){\n int i,n,c=0,j;\n cin>>n;\n string s,s2;\n cin>>s;\n map<string,int>m;\n for(i=97;i<=122;i++){\n     string s1;\n     s1.push_back(i);\n     m.insert(make_pair(s1,0));\n }\n for(i=0;i<n;i++){\n     string s1;\n     s1.push_back(s[i]);\n     m[s1]++;\n }\n for(auto it=m.begin();it!=m.end();it++){\n     if(it->second==0){\n         c=1;\n         s2=it->first;\n         break;\n     }\n }\n if(c){\n     cout<<s2<<'\n';\n }\n else{\n     m.clear();\n     for(i=97;i<=122;i++){\n         for(j=97;j<=122;j++){\n             string s1;\n             s1.push_back(i);\n             s1.push_back(j);\n             m.insert(make_pair(s1,0));\n         }\n     }\n     for(i=0;i<n-1;i++){\n         string s1;\n         s1.push_back(s[i]);\n         s1.push_back(s[i+1]);\n         m[s1]++;\n     }\n     for(auto it=m.begin();it!=m.end();it++){\n         if(it->second==0){\n             c=1;\n             s2=it->first;\n             break;\n         }\n     }\n     if(c)\n     cout<<s2<<'\n';\n     else{\n         m.clear();\n         for(i=97;i<=122;i++){\n             for(j=97;j<=122;j++){\n                 for(int k=97;k<=122;k++){\n                     string s1;\n                     s1.push_back(i);\n                     s1.push_back(j);\n                     s1.push_back(k);\n                     m.insert(make_pair(s1,0));\n                 }\n             }\n         }\n         for(i=0;i<n-2;i++){\n             string s1;\n             s1.push_back(s[i]);\n             s1.push_back(s[i+1]);\n             s1.push_back(s[i+2]);\n             m[s1]++;\n             \n         }\n         for(auto it=m.begin();it!=m.end();it++){\n             if(it->second==0){\n                 c=1;\n                 s2=it->first;\n                 break;\n             }\n         }\n         cout<<s2<<'\n';\n     }\n }\n }\n return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n int table[1000][1000];\n int main() {\n   int k = 0;\n   scanf('%d %d %d', &n, &m, &k);\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < m; ++j) {\n       scanf('%d', &table[i][j]);\n     }\n   }\n   while (k) {\n     char command;\n     int x, y;\n     scanf(' %c %d %d', &command, &x, &y);\n     if (command == 'g')\n       printf('%d\n', table[x - 1][y - 1]);\n     else if (command == 'c')\n       for (int i = 0; i < n; ++i) swap(table[i][x - 1], table[i][y - 1]);\n     else\n       for (int i = 0; i < m; ++i) swap(table[x - 1][i], table[y - 1][i]);\n     k--;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n ifstream Cin('input.txt');\n ofstream Cout('output.txt');\n int main() {\n   long long i, n4 = 0, n7 = 0, n;\n   string a, b;\n   cin >> a >> b;\n   for (i = 0; i < a.length(); i++)\n     if (a[i] != b[i]) {\n       if (a[i] == '4')\n         n4++;\n       else\n         n7++;\n     }\n   cout << n4 + n7 - min(n4, n7);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n ll min(ll a, ll b) {\n   if (a < b) return a;\n   return b;\n }\n void solve() {\n   ll testCases;\n   cin >> testCases;\n   while (testCases--) {\n     ll n;\n     cin >> n;\n     vector<ll> arr(n);\n     vector<ll> res(n, 1);\n     for (int i = 0; i < n; i++) cin >> arr[i];\n     int i = 0;\n     for (i = 0; i < n; i++) {\n       if (arr[i] != arr[(i + 1) % n]) break;\n     }\n     if (i == n) {\n       cout << '1\n';\n       for (i = 0; i < n; i++) cout << 1 << ' ';\n       cout << '\n';\n       continue;\n     }\n     if (n % 2 == 0) {\n       cout << '2\n';\n       for (i = 0; i < n; i++) cout << (i % 2) + 1 << ' ';\n       cout << '\n';\n       continue;\n     } else {\n       bool isTwo = 0;\n       for (i = 0; i < n; i++) {\n         if (arr[i] == arr[(i + 1) % n]) {\n           for (int j = 0, k = i + 1; k < n; k++, j ^= 1) res[k] = j + 1;\n           for (int j = 0, k = i; k >= 0; k--, j ^= 1) res[k] = j + 1;\n           cout << '2\n';\n           for (auto e : res) cout << e << ' ';\n           cout << '\n';\n           isTwo = 1;\n           break;\n         }\n       }\n       if (!isTwo) {\n         cout << '3\n';\n         for (i = 0; i < n - 1; i++) cout << i % 2 + 1 << ' ';\n         cout << '3\n';\n       }\n     }\n   }\n }\n int main() {\n   {\n     ios_base::sync_with_stdio(false);\n     cin.tie(NULL);\n   };\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxN = 3000 + 1;\n pair<int, int> a[maxN];\n pair<int, int> b[maxN];\n int nx[maxN], pr[maxN], v[maxN];\n int r, c, n;\n inline int gg(int i) {\n   pair<int, int> x = {a[i].second, a[i].first};\n   return lower_bound(b, b + n + 2, x) - b;\n }\n inline int ff(int i) { return b[i].first; }\n int nex(int i) {\n   if (v[nx[i]]) return nx[i];\n   return nx[i] = nex(nx[i]);\n }\n int prev(int i) {\n   if (v[pr[i]]) return pr[i];\n   return pr[i] = prev(pr[i]);\n }\n int L[11], R[11];\n int main() {\n   cin >> r >> c >> n;\n   int k;\n   cin >> k;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i].first >> a[i].second;\n     b[i] = {a[i].second, a[i].first};\n   }\n   b[n] = {0, 0}, b[n + 1] = {c + 1, 0};\n   sort(a, a + n);\n   sort(b, b + n + 2);\n   v[0] = v[n + 1] = 1;\n   pr[0] = 0, nx[n + 1] = n + 1;\n   long long ans = 0;\n   for (int i = 1; i <= r; i++) {\n     int ind = 0;\n     for (; ind < n && a[ind].first < i; ind++)\n       ;\n     if (ind == n) break;\n     for (int j = ind; j < n; j++) v[gg(j)] = 1;\n     for (int j = 1; j <= n; j++) {\n       nx[j] = j + 1;\n       pr[j] = j - 1;\n     }\n     int curr = 0;\n     for (int j = 1; j <= n; j++)\n       if (v[j]) {\n         int x = j;\n         for (int t = 1; t < k; t++, x = nex(x))\n           ;\n         curr += (ff(j) - ff(prev(j))) * (c + 1 - ff(x));\n       }\n     int ptr = n;\n     for (int i2 = r; i2 >= i; i2--) {\n       ans += curr;\n       for (; ptr > ind && a[ptr - 1].first >= i2; ptr--) {\n         L[0] = R[0] = gg(ptr - 1);\n         for (int t = 1; t < k; t++) {\n           L[t] = prev(L[t - 1]);\n           R[t] = nex(R[t - 1]);\n         }\n         for (int t = 0; t < k; t++) {\n           int left = L[t];\n           int right = R[k - t - 1];\n           curr -= (ff(left) - ff(prev(left))) * (ff(nex(right)) - ff(right));\n         }\n         v[L[0]] = 0;\n       }\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int arr[500005], brr[500005];\n pair<int, int> tree[500005 * 4];\n vector<int> vv[500005];\n vector<pair<int, int> > qr[500005];\n int ans[500005];\n void build(int node, int b, int e) {\n   if (b == e) {\n     tree[node] = make_pair(500000000, 500000000);\n     return;\n   }\n   int left = 2 * node, right = left + 1, mid = (b + e) / 2;\n   build(left, b, mid);\n   build(right, mid + 1, e);\n   tree[node] = tree[left];\n }\n void update(int node, int b, int e, int i, int v) {\n   if (e < i || b > i) return;\n   if (b == e && b == i) {\n     tree[node] = make_pair(v, arr[b]);\n     return;\n   }\n   int left = 2 * node, right = left + 1, mid = (b + e) / 2;\n   update(left, b, mid, i, v);\n   update(right, mid + 1, e, i, v);\n   if (tree[left].first <= tree[right].first) {\n     tree[node] = tree[left];\n   } else\n     tree[node] = tree[right];\n }\n pair<int, int> query(int node, int b, int e, int l, int r) {\n   if (b > r || e < l) return make_pair(500000000, 500000000);\n   if (b >= l && e <= r) return tree[node];\n   int left = 2 * node, right = left + 1, mid = (b + e) / 2;\n   pair<int, int> p = query(left, b, mid, l, r);\n   pair<int, int> q = query(right, mid + 1, e, l, r);\n   if (p.first <= q.first) return p;\n   return q;\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   int mx = 0;\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &arr[i]);\n     vv[arr[i]].push_back(i);\n     mx = max(mx, arr[i]);\n   }\n   int q;\n   scanf('%d', &q);\n   for (int i = 1; i <= q; i++) {\n     int l, r;\n     scanf('%d %d', &l, &r);\n     qr[r].push_back(make_pair(l, i));\n   }\n   build(1, 1, n);\n   for (int i = 1; i <= n; i++) {\n     int id = lower_bound(vv[arr[i]].begin(), vv[arr[i]].end(), i) -\n              vv[arr[i]].begin();\n     int v;\n     if (id == 0) {\n       v = 1;\n       brr[arr[i]] = i;\n     } else {\n       v = vv[arr[i]][id - 1] + 1;\n       update(1, 1, n, brr[arr[i]], 500000000);\n       brr[arr[i]] = i;\n     }\n     update(1, 1, n, i, v);\n     for (int j = 0; j < qr[i].size(); j++) {\n       pair<int, int> ret = query(1, 1, n, qr[i][j].first, i);\n       if (qr[i][j].first >= ret.first) ans[qr[i][j].second] = ret.second;\n     }\n   }\n   for (int i = 1; i <= q; i++) printf('%d\n', ans[i]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 10;\n const int MAXN = 200000;\n int n, tot;\n bool bz[N];\n vector<int> g[N], edge[N];\n int e[N * 2][2], gg[N];\n int sz;\n long long ans[N];\n void add(int x, int y) {\n   e[++tot][0] = y;\n   e[tot][1] = gg[x];\n   gg[x] = tot;\n }\n void dfs(int x) {\n   bz[x] = 0;\n   sz++;\n   for (int i = gg[x]; i; i = e[i][1])\n     if (bz[e[i][0]]) dfs(e[i][0]);\n   gg[x] = 0;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     int x;\n     scanf('%d', &x);\n     for (int j = 1; 1ll * j * j <= x; j++)\n       if ((x % j) == 0) {\n         g[j].push_back(i);\n         if (j * j != x) g[x / j].push_back(i);\n       }\n   }\n   for (int i = 1; i < n; i++) {\n     int x, y;\n     scanf('%d %d', &x, &y);\n     edge[x].push_back(y);\n     edge[y].push_back(x);\n   }\n   for (int i = 1; i <= MAXN; i++)\n     if (g[i].size()) {\n       tot = 0;\n       for (auto u : g[i]) bz[u] = 1;\n       for (auto u : g[i])\n         for (auto v : edge[u])\n           if (bz[v]) add(u, v);\n       for (auto u : g[i])\n         if (bz[u]) {\n           sz = 0;\n           dfs(u);\n           ans[i] += 1ll * sz * (sz - 1) / 2 + sz;\n         }\n     }\n   for (int i = MAXN; i; i--)\n     for (int j = 2; 1ll * j * i <= MAXN; j++) ans[i] -= ans[i * j];\n   for (int i = 1; i <= MAXN; i++)\n     if (ans[i]) printf('%d %lld\n', i, ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int k, n;\n   scanf('%d%d', &n, &k);\n   vector<int> a(n), b(n), distributed(n), p(n);\n   vector<vector<int> > cart(k);\n   for (int i = 0; i < n; ++i) {\n     scanf('%d%d', &a[i], &b[i]);\n     distributed[i] = 0;\n     p[i] = i;\n   }\n   for (int i = 0; i < n; ++i) {\n     for (int j = i + 1; j < n; ++j) {\n       if (a[p[i]] < a[p[j]]) {\n         swap(p[i], p[j]);\n       }\n     }\n   }\n   int cart_ptr = 0;\n   for (int i = 0; i < n && cart_ptr < k; ++i) {\n     if (b[p[i]] == 1) {\n       distributed[p[i]] = 1;\n       cart[cart_ptr].push_back(p[i]);\n       ++cart_ptr;\n     }\n   }\n   deque<int> available;\n   for (int i = 0; i < n; ++i) {\n     if (!distributed[p[i]]) {\n       available.push_back(p[i]);\n     }\n   }\n   while (cart_ptr < k) {\n     cart[cart_ptr].push_back(available.front());\n     available.pop_front();\n     ++cart_ptr;\n   }\n   while (!available.empty()) {\n     cart[k - 1].push_back(available.front());\n     available.pop_front();\n   }\n   long long ans = 0;\n   for (int i = 0; i < k; ++i) {\n     int min_cost = 2000000000;\n     for (int j = 0; j < (int)cart[i].size(); ++j) {\n       ans += a[cart[i][j]] * 2;\n       min_cost = min(min_cost, a[cart[i][j]]);\n     }\n     if (b[cart[i][0]] == 1) {\n       ans -= min_cost;\n     }\n   }\n   cout << ans / 2;\n   if (ans % 2 == 0) {\n     cout << '.0' << endl;\n   } else {\n     cout << '.5' << endl;\n   }\n   for (int i = 0; i < k; ++i) {\n     cout << cart[i].size();\n     for (int j = 0; j < (int)cart[i].size(); ++j) {\n       cout << ' ' << cart[i][j] + 1;\n     }\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = (int)1e9;\n const int mod = (int)1e9 + 7;\n const double pi = acos(-1.0);\n const double eps = 1e-9;\n const int maxn = (int)2e6 + 11;\n long long n;\n long long a[maxn];\n long long sum[maxn];\n int main() {\n   cin >> n;\n   a[1] = 2;\n   sum[1] = 2;\n   for (int i = 2; i <= 2000000; i++) {\n     a[i] = a[i - 1] + 3;\n     sum[i] = sum[i - 1] + a[i];\n   }\n   int ans = 0;\n   for (int i = 1; sum[i] <= n; i++) {\n     if ((n - sum[i]) % 3 == 0) ans++;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<long long, long long> mp[12];\n long long a[200005], dig[200005];\n long long state[200005][12];\n int main() {\n   long long n, k;\n   scanf('%lld %lld', &n, &k);\n   for (int i = 0; i < n; i++) scanf('%lld', &a[i]);\n   for (int i = 0; i < n; i++) {\n     dig[i] = log10(a[i]) + 1;\n   }\n   for (int i = 0; i < n; i++) {\n     long long x = a[i];\n     long long tencnt = 1;\n     while (tencnt < 11) {\n       x = (x * 10LL) % k;\n       mp[tencnt][x]++;\n       state[i][tencnt] = x;\n       tencnt++;\n     }\n   }\n   long long ans = 0;\n   for (int i = 0; i < n; i++) {\n     long long len = dig[i];\n     long long m = (k - (a[i] % k)) % k;\n     if (mp[len].count(m) == 0) continue;\n     ans += mp[len][m];\n   }\n   for (int i = 0; i < n; i++) {\n     long long len = dig[i];\n     long long x = state[i][len];\n     if ((x + a[i]) % k == 0) {\n       ans--;\n     }\n   }\n   printf('%lld\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long LINF = ~0ULL >> 1;\n const int N = 1e3 + 7;\n const int INF = 2e8 + 7;\n const int MOD = 1e9 + 7;\n const double PI = acos(-1.0);\n const double EPS = 1e-8;\n int n;\n long long calc(long long A, long long B, long long C) {\n   return (A + 1) * (B + 2) * (C + 2);\n }\n void solve() {\n   long long mn = LINF, mx = -LINF, tmp;\n   for (int i = 1; 1ll * i * i * i <= n; ++i) {\n     if (n % i) continue;\n     for (int j = i, J = n / i; 1ll * j * j <= J; ++j) {\n       if (J % j) continue;\n       int k = n / i / j;\n       tmp = calc(i, j, k);\n       mn = min(mn, tmp), mx = max(mx, tmp);\n       tmp = calc(j, i, k);\n       mn = min(mn, tmp), mx = max(mx, tmp);\n       tmp = calc(k, i, j);\n       mn = min(mn, tmp), mx = max(mx, tmp);\n     }\n   }\n   cout << mn - n << ' ' << mx - n << endl;\n }\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   cin >> n;\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, x, r[100000], pos[100000], flag = 1, flag2;\n pair<int, int> a[100000];\n vector<int> ans, ans2;\n int l(int n) {\n   if (!n) return 1;\n   if (n % 10 == 4 || n % 10 == 7) return l(n / 10);\n   return 0;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &x);\n     a[i] = pair<int, int>(x, i);\n   }\n   sort(a, a + n);\n   for (int i = 0; i < n; i++) {\n     r[a[i].second] = i;\n     pos[i] = a[i].second;\n     if (a[i].second != i) flag = 0;\n     if (!flag2 && l(a[i].first)) x = i, flag2 = 1;\n   }\n   if (flag) {\n     cout << 0 << endl;\n     return 0;\n   }\n   if (!flag2) {\n     cout << -1 << endl;\n     return 0;\n   }\n   for (int i = 0; i < n; i++)\n     if (i != x) {\n       if (pos[i] == i) continue;\n       if (pos[x] != i) {\n         ans.push_back(pos[x]), ans2.push_back(i);\n         int temp = pos[x];\n         swap(pos[x], pos[r[i]]);\n         swap(r[temp], r[i]);\n       }\n       ans.push_back(pos[x]), ans2.push_back(pos[i]);\n       swap(pos[x], pos[i]);\n       swap(r[pos[x]], r[pos[i]]);\n     }\n   cout << ans.size() << endl;\n   for (int i = 0; i < ans.size(); i++)\n     cout << ans[i] + 1 << ' ' << ans2[i] + 1 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 1e3 + 10;\n const int MOD = 998244353;\n const int INF = 10;\n int fact[MAXN], invfact[MAXN];\n int add(int a, int b) {\n   int sum = a + b;\n   return (sum >= MOD ? sum -= MOD : (sum < 0 ? sum += MOD : sum));\n }\n int mul(int a, int b) { return 1LL * a * b % MOD; }\n int pwr(int a, int b) {\n   return (!b ? 1\n              : (b & 1 ? 1LL * a * pwr(1LL * a * a % MOD, b >> 1) % MOD\n                       : pwr(1LL * a * a % MOD, b >> 1) % MOD));\n }\n int inv(int x) { return pwr(x, MOD - 2); }\n void first() {\n   fact[0] = 1;\n   for (int i = 1; i < MAXN; i++) fact[i] = mul(fact[i - 1], i);\n   for (int i = 0; i < MAXN; i++) invfact[i] = inv(fact[i]);\n }\n int C(int n, int k) { return mul(mul(fact[n], invfact[k]), invfact[n - k]); }\n int P(int n, int k) { return mul(fact[n], invfact[n - k]); }\n int n, a[MAXN], dp[MAXN];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   first();\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   dp[n] = 1;\n   for (int i = n - 1; i >= 0; i--) {\n     if (a[i] <= 0 || a[i] + i - 1 > n - 1) {\n       continue;\n     }\n     for (int j = n - 1; j >= a[i] + i; j--) {\n       dp[i] = add(dp[i], mul(dp[j + 1], C(j - i, a[i])));\n     }\n   }\n   int ans = 0;\n   for (int i = 0; i < n; i++) {\n     ans = add(ans, dp[i]);\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int* m = new int[n];\n   int* r = new int[n];\n   for (int i = 0; i < n; i++) {\n     cin >> m[i];\n   }\n   for (int i = 0; i < n; i++) {\n     cin >> r[i];\n   }\n   double total = 0;\n   for (int i = 0; i < 1000000; i++) {\n     for (int j = 0; j < n; j++) {\n       if (i % m[j] == r[j]) {\n         total++;\n         break;\n       }\n     }\n   }\n   double percentage = total / 1000000;\n   cout << fixed << setprecision(6) << percentage << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dx[] = {1, 1, -1, -1};\n int dy[] = {1, -1, -1, 1};\n long long int n, k, d1, d2, rem;\n bool _solve(long long int w1, long long int w2, long long int w3) {\n   long long int tar = n / 3;\n   if (w1 < 0 || w2 < 0 || w3 < 0) return false;\n   if (tar >= w1 && tar >= w2 && tar >= w3 && abs(w1 - w2) == d1 &&\n       abs(w2 - w3) == d2)\n     return true;\n   return false;\n }\n bool solve() {\n   long long int _d1, w1, w2, w3, _d2;\n   for (int i = 0; i < 4; i++) {\n     _d1 = d1 * dx[i];\n     _d2 = d2 * dy[i];\n     w1 = (k + 2 * _d1 + _d2) / 3;\n     w2 = w1 - _d1;\n     w3 = w2 - _d2;\n     if (w1 + w2 + w3 != k) continue;\n     if (_solve(w1, w2, w3)) return true;\n   }\n   return false;\n }\n int main() {\n   ios_base ::sync_with_stdio(false);\n   cin.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     cin >> n >> k >> d1 >> d2;\n     if (n % 3 == 0) {\n       if (solve())\n         cout << 'yes' << endl;\n       else\n         cout << 'no' << endl;\n     } else\n       cout << 'no' << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 1.01e9;\n const double eps = 1e-9;\n const int N = 1010;\n char s[N][N];\n char res[N * N];\n int resc = 0;\n char ch[4] = {'D', 'L', 'R', 'U'};\n int dx[4] = {1, 0, 0, -1};\n int dy[4] = {0, -1, 1, 0};\n pair<int, int> q[N * N];\n int st = 0, en = 0;\n int d[N][N];\n int n, m;\n void bfs(int x, int y) {\n   for (int i = 0; (i) < (n); ++i)\n     for (int j = 0; (j) < (m); ++j) d[i][j] = inf;\n   d[x][y] = 0;\n   q[en++] = {x, y};\n   while (st < en) {\n     x = q[st].first;\n     y = q[st].second;\n     st++;\n     for (int i = 0; (i) < (4); ++i) {\n       int xx = x + dx[i];\n       int yy = y + dy[i];\n       if (0 <= xx && xx < n && 0 <= yy && yy < m && s[xx][yy] == '.' &&\n           d[xx][yy] == inf) {\n         d[xx][yy] = d[x][y] + 1;\n         q[en++] = {xx, yy};\n       }\n     }\n   }\n }\n int main() {\n   int k;\n   scanf('%d%d%d', &n, &m, &k);\n   if (k & 1) {\n     printf('IMPOSSIBLE\n');\n     return 0;\n   }\n   for (int i = 0; (i) < (n); ++i) scanf('%s', s[i]);\n   int px = -1, py = -1;\n   for (int i = 0; (i) < (n); ++i)\n     for (int j = 0; (j) < (m); ++j)\n       if (s[i][j] == 'X') {\n         px = i;\n         py = j;\n         s[i][j] = '.';\n       }\n   bfs(px, py);\n   int x = px, y = py;\n   for (int it = 0; (it) < (k); ++it) {\n     int ok = 0;\n     for (int i = 0; (i) < (4); ++i) {\n       int xx = x + dx[i];\n       int yy = y + dy[i];\n       if (0 <= xx && xx < n && 0 <= yy && yy < m && d[xx][yy] <= k - it - 1) {\n         res[resc++] = ch[i];\n         x = xx;\n         y = yy;\n         ok = 1;\n         break;\n       }\n     }\n     if (!ok) {\n       printf('IMPOSSIBLE\n');\n       return 0;\n     }\n   }\n   printf('%s\n', res);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s[100010], a[110], b[110];\n int pa[110], pb[110];\n int main() {\n   scanf('%s%s%s', s, a, b);\n   int i, j;\n   j = -1;\n   pa[0] = -1;\n   int lena = strlen(a);\n   for (i = 1; i < lena; i++) {\n     while (j > -1 && a[j + 1] != a[i]) j = pa[j];\n     if (a[j + 1] == a[i]) j++;\n     pa[i] = j;\n   }\n   j = -1;\n   pb[0] = -1;\n   int lenb = strlen(b);\n   for (i = 1; i < lenb; i++) {\n     while (j > -1 && b[j + 1] != b[i]) j = pb[j];\n     if (b[j + 1] == b[i]) j++;\n     pb[i] = j;\n   }\n   int len = strlen(s);\n   int minn = len + 1;\n   j = -1;\n   for (i = 0; i < len; i++) {\n     while (j > -1 && a[j + 1] != s[i]) j = pa[j];\n     if (a[j + 1] == s[i]) j++;\n     if (j == lena - 1) {\n       minn = i;\n       break;\n     }\n   }\n   bool flag1 = false, flag2 = false;\n   j = -1;\n   for (i = minn + 1; i < len; i++) {\n     while (j > -1 && b[j + 1] != s[i]) j = pb[j];\n     if (b[j + 1] == s[i]) j++;\n     if (j == lenb - 1) {\n       flag1 = true;\n       break;\n     }\n   }\n   for (i = 0; i < len / 2; i++) swap(s[i], s[len - i - 1]);\n   j = -1;\n   minn = len;\n   for (i = 0; i < len; i++) {\n     while (j > -1 && a[j + 1] != s[i]) j = pa[j];\n     if (a[j + 1] == s[i]) j++;\n     if (j == lena - 1) {\n       minn = i;\n       break;\n     }\n   }\n   j = -1;\n   for (i = minn + 1; i < len; i++) {\n     while (j > -1 && b[j + 1] != s[i]) j = pb[j];\n     if (b[j + 1] == s[i]) j++;\n     if (j == lenb - 1) {\n       flag2 = true;\n       break;\n     }\n   }\n   if (flag1 && flag2)\n     printf('both\n');\n   else if (flag1)\n     printf('forward\n');\n   else if (flag2)\n     printf('backward\n');\n   else\n     printf('fantasy\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long N, a[100010], s[100100], cnt[100010];\n void update(long long *t, long long pos, long long val) {\n   for (; pos <= N; pos += pos & (-pos)) t[pos] += val;\n }\n long long query(long long *t, long long r) {\n   long long res = 0;\n   for (; r > 0; r -= r & (-r)) res += t[r];\n   return res;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> N;\n   int i;\n   long long nr, sum;\n   long double res = 0;\n   for (i = 1; i <= N; i++) {\n     cin >> a[i];\n     update(cnt, a[i], 1);\n     update(s, a[i], i);\n   }\n   for (i = 1; i <= N; i++) {\n     nr = query(cnt, a[i] - 1);\n     sum = query(s, a[i] - 1);\n     res += nr - (1.0 * i * (nr * (N + 1) - sum)) / (N * (N + 1));\n     nr = N - i - nr;\n     sum = query(s, N) - sum - i;\n     res += (1.0 * i * (nr * (N + 1) - sum)) / (N * (N + 1));\n     update(cnt, a[i], -1);\n     update(s, a[i], -i);\n   }\n   cout << fixed << setprecision(15) << res << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int res[111];\n int a[111][111];\n bool used[111];\n ;\n bool used_j[111];\n int v[111];\n int main() {\n   int n, m, k;\n   cin >> n >> m >> k;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       cin >> a[i][j];\n     }\n   }\n   for (int i = 0; i < m; i++) {\n     for (int w = 0; w < 111; w++) {\n       v[w] = 0;\n     }\n     for (int j = 0; j < n; j++) {\n       if (!used[a[j][i]] && !used_j[j])\n         v[a[j][i]]++;\n       else if (!used_j[j] && used[a[j][i]]) {\n         if (res[j] == 0) res[j] = i + 1;\n         used_j[j] = 1;\n       }\n     }\n     for (int j = 0; j < n; j++) {\n       if (v[a[j][i]] > 1 && a[j][i] != 0) {\n         if (res[j] == 0) res[j] = i + 1;\n         used[a[j][i]] = 1;\n         used_j[j] = 1;\n       }\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     cout << res[i] << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n const int N = 1e6 + 10;\n const long long INF = 1e18;\n const long double EPS = 1e-12;\n int a[300005];\n map<int, int> mi;\n int l_, r_;\n long long pre[300005];\n int b[300005];\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = (int)1; i < (int)n + 1; i++) {\n     scanf('%d', &a[i]);\n   }\n   for (int i = (int)1; i < (int)n + 1; i++) {\n     if (mi[a[i]] == 0) mi[a[i]] = i;\n   }\n   for (int i = (int)1; i < (int)n + 1; i++) {\n     pre[i] = pre[i - 1];\n     if (a[i] >= 0) pre[i] += (long long)(a[i]);\n   }\n   long long ans = -(long long)(1e12);\n   l_ = 0;\n   r_ = 0;\n   for (int i = n; i >= 1; i--) {\n     int x = a[i];\n     int l = mi[x];\n     if (i == mi[x]) continue;\n     long long net = pre[i - 1] - pre[l];\n     net += 2LL * (long long)(x);\n     if (net > ans) {\n       ans = net;\n       l_ = l;\n       r_ = i;\n     }\n   }\n   int cnt = 0;\n   for (int i = 0; i < (int)n + 1; i++) b[i] = 0;\n   for (int i = (int)1; i < (int)n + 1; i++) {\n     if (i == l_ || i == r_) {\n       b[i] = 1;\n       continue;\n     }\n     if (l_ < i && i < r_ && a[i] > 0) {\n       b[i] = 1;\n     } else {\n       b[i] = 0;\n       cnt++;\n     }\n   }\n   cout << ans << ' ' << cnt << endl;\n   for (int i = (int)1; i < (int)n + 1; i++) {\n     if (b[i] == 0) {\n       printf('%d ', i);\n     }\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int Read() {\n   int x = 0, f = 1, c = getchar();\n   for (; !isdigit(c); c = getchar())\n     if (c == '-') f = -1;\n   for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';\n   return x * f;\n }\n const int MAXN = 300005;\n int n, m, a[MAXN], f[MAXN], g[MAXN];\n inline bool Chk(int d) {\n   f[0] = g[0] = 1;\n   for (int i = 1, j = 1; i <= n; i++) {\n     while (a[i] - a[j] > d) j++;\n     if (i >= m && g[i - m] - (j == 1 ? 0 : g[j - 2]) > 0)\n       f[i] = 1;\n     else\n       f[i] = 0;\n     g[i] = g[i - 1] + f[i];\n   }\n   return f[n];\n }\n int main() {\n   n = Read(), m = Read();\n   for (int i = 1; i <= n; i++) a[i] = Read();\n   sort(a + 1, a + n + 1);\n   int l = 0, r = a[n], ret = 0;\n   while (l <= r) {\n     int mid = l + r >> 1;\n     if (Chk(mid))\n       ret = mid, r = mid - 1;\n     else\n       l = mid + 1;\n   }\n   return printf('%d\n', ret), 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int t;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> t;\n   while (t--) {\n     int m;\n     int n;\n     cin >> m >> n;\n     vector<int> a[500];\n     vector<int> b[500];\n     for (int i = 0; i < m; i++) {\n       for (int j = 0; j < n; j++) {\n         int temp;\n         cin >> temp;\n         a[i].push_back(temp);\n       }\n     }\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < m; j++) {\n         int temp;\n         cin >> temp;\n         b[i].push_back(temp);\n       }\n     }\n     pair<int, int> place;\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < m; j++) {\n         if (a[0][0] == b[i][j]) {\n           place = make_pair(i, j);\n         }\n       }\n     }\n     map<int, int> rows;\n     for (int i = 0; i < m; i++) {\n       rows.insert({a[i][0], i});\n     }\n     for (int i = 0; i < m; i++) {\n       for (int j = 0; j < n; j++) {\n         cout << a[rows[b[place.first][i]]][j] << ' ';\n       }\n       cout << '\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n signed main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int t;\n   cin >> t;\n   auto solve = []() {\n     int n;\n     cin >> n;\n     vector<pair<int, int>> a(n);\n     for (int i = 0; i < n; i++) {\n       cin >> a[i].first;\n       a[i].first--;\n     }\n     vector<int> ans(n + n);\n     vector<int> used(n + n);\n     for (int i = 0; i < n; i++) {\n       ans[i * 2] = a[i].first;\n       a[i].second = i * 2;\n       used[a[i].first] = 1;\n     }\n     for (int i = 1; i < n + n; i += 2) {\n       int x = ans[i - 1];\n       int j;\n       for (j = x + 1; j < n + n && used[j]; j++)\n         ;\n       if (j == n + n) {\n         cout << -1 << '\n';\n         return 0;\n       }\n       used[j] = 1;\n       ans[i] = j;\n     }\n     for (int i = 0; i < n + n; i++) {\n       if (i > 0) cout << ' ';\n       cout << ans[i] + 1;\n     }\n     cout << '\n';\n   };\n   while (t--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int res(long long int x) {\n   long long int ans = 0;\n   if (x > 0) ans = (x * (x - 1)) / 2;\n   return ans;\n }\n int main() {\n   long int n;\n   long long int d;\n   cin >> n >> d;\n   vector<long long int> vect;\n   long long int x;\n   for (long int i = 0; i < n; i++) {\n     cin >> x;\n     vect.push_back(x);\n   }\n   vector<long long int>::iterator it, it2;\n   long long int ans = 0;\n   for (long int i = 2; i < n; i++) {\n     it = lower_bound(vect.begin(), vect.end(), vect[i] - d);\n     if (it != vect.end()) {\n       ans = ans + res(i - (it - vect.begin()));\n     }\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool Check(int N, int pos) { return (bool)(N & (1 << pos)); }\n int Set(int N, int pos) { return (N | (1 << pos)); }\n long long BigMod(long long B, long long P, long long M) {\n   long long R = 1;\n   while (P > 0) {\n     if (P % 2 == 1) {\n       R = (R * B) % M;\n     }\n     P /= 2;\n     B = (B * B) % M;\n   }\n   return R;\n }\n int n, m;\n vector<pair<double, int> > v;\n int dp[5005][5005][2];\n inline int call(int pos, int got, int stat) {\n   if (got > m) return 10000;\n   if (pos == n) {\n     if (got == m)\n       return 0;\n     else\n       return 10000;\n   }\n   if (dp[pos][got][stat] != -1) return dp[pos][got][stat];\n   int ret = 0;\n   int g = 0;\n   if (v[pos].second != got and stat == 0) g = 1;\n   ret = min(call(pos + 1, got, 0), call(pos, got + 1, 1));\n   return dp[pos][got][stat] = ret + g;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(nullptr);\n   memset(dp, -1, sizeof(dp));\n   cin >> n >> m;\n   v.resize(n);\n   for (int i = 0; i < n; i++) {\n     cin >> v[i].second >> v[i].first;\n   }\n   sort(v.begin(), v.end());\n   int mx = 10000;\n   for (int i = 0; i < m; i++) {\n     mx = min(mx, call(0, i + 1, 0));\n   }\n   cout << mx;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char bd[1100][1100];\n int n, m;\n int rt[1100][1100];\n int down[1100][1100];\n int cnt[1100][1100];\n int check(int width, int height, int x, int y) {\n   int filled = 0;\n   bool first = true;\n   while (true) {\n     int godown = down[x][y] - height;\n     if (godown < 0) break;\n     if (cnt[x][y] - cnt[x][y + width] - cnt[x + down[x][y]][y] +\n             cnt[x + down[x][y]][y + width] ==\n         width * down[x][y]) {\n       if (first) {\n         filled += width * down[x][y];\n         first = false;\n       } else {\n         filled += height + width * godown;\n       }\n     } else\n       break;\n     if ((y + 1) + width <= m) {\n       y++;\n       x += godown;\n     } else\n       break;\n   }\n   return filled;\n }\n int main() {\n   scanf('%d %d', &n, &m);\n   for (int i = 0; i < n; i++) scanf('%s', bd[i]);\n   for (int i = n - 1; i >= 0; i--) {\n     for (int j = m - 1; j >= 0; j--) {\n       if (bd[i][j] == '.') {\n         rt[i][j] = down[i][j] = 0;\n       } else {\n         rt[i][j] = 1 + rt[i][j + 1];\n         down[i][j] = 1 + down[i + 1][j];\n       }\n     }\n   }\n   int tlx = -1;\n   int tly = -1;\n   int tot = 0;\n   for (int i = n - 1; i >= 0; i--) {\n     for (int j = m - 1; j >= 0; j--) {\n       if (bd[i][j] == 'X') {\n         tlx = i;\n         tly = j;\n         tot++;\n       }\n       cnt[i][j] =\n           (bd[i][j] == 'X') + cnt[i + 1][j] + cnt[i][j + 1] - cnt[i + 1][j + 1];\n     }\n   }\n   int best = 1000000000;\n   for (int height = 1; height <= down[tlx][tly]; height++) {\n     int width = rt[tlx][tly];\n     int filled = check(width, height, tlx, tly);\n     if (filled == tot) best = min(best, width * height);\n   }\n   for (int width = 1; width <= rt[tlx][tly]; width++) {\n     int height = down[tlx][tly];\n     int filled = check(width, height, tlx, tly);\n     if (filled == tot) best = min(best, width * height);\n   }\n   printf('%d\n', best == 1000000000 ? -1 : best);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<pair<char, char> > 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 <bits/stdc++.h>\n using namespace std;\n double pi = acos(-1);\n struct point {\n   int x, y;\n } p[2005];\n vector<double> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long> col(m);\n   for (long long i = 0; i < m; i++) {\n     cin >> col[i];\n   }\n   vector<long long> 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<long long> 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 <bits/stdc++.h>\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<long long, long long> p1, pair<long long, long long> p2) {\n   return p1.first * p2.second - p2.first * p1.second;\n }\n bool online(pair<long long, long long> a, pair<long long, long long> b,\n             pair<long long, long long> c) {\n   pair<long long, long long> p1{b.first - a.first, b.second - a.second};\n   pair<long long, long long> p2{c.first - a.first, c.second - a.second};\n   return cross(p1, p2) == 0;\n }\n void z_func(vector<int> &z, vector<int> &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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long inf = 2147383647;\n const double pi = 2 * acos(0.0);\n const double eps = 1e-9;\n struct debugger {\n   template <typename T>\n   debugger& operator,(const T& v) {\n     cerr << v << ' ';\n     return *this;\n   }\n } dbg;\n inline long long gcd(long long a, long long b) {\n   a = ((a) < 0 ? -(a) : (a));\n   b = ((b) < 0 ? -(b) : (b));\n   while (b) {\n     a = a % b;\n     swap(a, b);\n   }\n   return a;\n }\n int ext_gcd(int a, int b, int& x, int& y) {\n   if (a == 0) {\n     x = 0;\n     y = 1;\n     return b;\n   }\n   int x1, y1;\n   int d = ext_gcd(b % a, a, x1, y1);\n   x = y1 - (b / a) * x1;\n   y = x1;\n   return d;\n }\n inline long long modInv(int a, int m) {\n   int x, y;\n   ext_gcd(a, m, x, y);\n   if (x < 0) x += m;\n   return x;\n }\n inline long long power(long long a, long long p) {\n   long long res = 1, x = a;\n   while (p) {\n     if (p & 1) res = (res * x);\n     x = (x * x);\n     p >>= 1;\n   }\n   return res;\n }\n inline long long bigmod(long long a, long long p, long long m) {\n   long long res = 1, x = a % m;\n   while (p) {\n     if (p & 1) res = (res * x) % m;\n     x = (x * x) % m;\n     p >>= 1;\n   }\n   return res;\n }\n bool ispalin(string s) {\n   string s2 = s;\n   reverse(s2.begin(), s2.end());\n   if (s == s2)\n     return true;\n   else\n     return false;\n }\n int main() {\n   string s, t, x;\n   cin >> s;\n   int len = s.size();\n   for (int i = (0); i <= (len); ++i) {\n     for (int j = ('a'); j <= ('z'); ++j) {\n       t = s;\n       x = j;\n       t.insert(i, x);\n       if (ispalin(t)) {\n         cout << t << endl;\n         return 0;\n       }\n     }\n   }\n   cout << 'NA' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int f[4040][4040], n, k, ans;\n struct info {\n   int be, ti;\n } e[4040];\n int main() {\n   scanf('%d%d', &n, &k);\n   for (int i = 1; i <= n; i++) scanf('%d%d', &e[i].be, &e[i].ti);\n   e[n + 1].be = 86401;\n   if (n == k) {\n     printf('86400');\n     return 0;\n   }\n   f[1][0] = e[1].be + e[1].ti - 1;\n   for (int i = 2; i <= n; i++) {\n     f[i][0] = max(e[i].be + e[i].ti - 1, f[i - 1][0] + e[i].ti);\n     for (int j = 1; j <= min(i, k); j++) {\n       if (i - 1 >= j)\n         f[i][j] = min(max(f[i - 1][j] + e[i].ti, e[i].be + e[i].ti - 1),\n                       f[i - 1][j - 1]);\n       else\n         f[i][j] = min(e[i].be + e[i].ti - 1, f[i - 1][j - 1]);\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = 0; j <= k; j++) {\n       ans = max(ans, e[min(n + 1, k - j + i + 1)].be - f[i][j] - 1);\n     }\n   }\n   printf('%d', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long fmm(long long a, long long b, long long m = 1000000007) {\n   long long r = 0;\n   a %= m;\n   b %= m;\n   while (b > 0) {\n     if (b & 1) {\n       r += a;\n       r %= m;\n     }\n     a += a;\n     a %= m;\n     b >>= 1;\n   }\n   return r % m;\n }\n inline long long fme(long long a, long long b, long long m = 1000000007) {\n   long long r = 1;\n   a %= m;\n   while (b > 0) {\n     if (b & 1) {\n       r *= a;\n       r %= m;\n     }\n     a *= a;\n     a %= m;\n     b >>= 1;\n   }\n   return r % m;\n }\n inline long long sfme(long long a, long long b, long long m = 1000000007) {\n   long long r = 1;\n   a %= m;\n   while (b > 0) {\n     if (b & 1) r = fmm(r, a, m);\n     a = fmm(a, a, m);\n     b >>= 1;\n   }\n   return r % m;\n }\n std::vector<long long> primes;\n long long primsiz;\n std::vector<long long> fact;\n std::vector<long long> invfact;\n inline void sieve(long long n) {\n   long long i, j;\n   std::vector<bool> a(n);\n   a[0] = true;\n   a[1] = true;\n   for (i = 2; i * i < n; ++i) {\n     if (!a[i]) {\n       for (j = i * i; j < n; j += i) {\n         a[j] = true;\n       }\n     }\n   }\n   for (i = 2; i < n; ++i)\n     if (!a[i]) primes.push_back(i);\n   primsiz = primes.size();\n }\n inline void sieve() {\n   long long n = 1010000, i, j, k = 0;\n   std::vector<bool> a(n);\n   primes.resize(79252);\n   a[0] = a[1] = true;\n   for (i = 2; (j = (i << 1)) < n; ++i) a[j] = true;\n   for (i = 3; i * i < n; i += 2) {\n     if (!a[i]) {\n       k = (i << 1);\n       for (j = i * i; j < n; j += k) a[j] = true;\n     }\n   }\n   k = 0;\n   for (i = 2; i < n; ++i)\n     if (!a[i]) primes[k++] = i;\n   primsiz = k;\n }\n inline bool isPrimeSmall(unsigned long long n) {\n   if (((!(n & 1)) && n != 2) || (n < 2) || (n % 3 == 0 && n != 3)) return false;\n   for (unsigned long long k = 1; 36 * k * k - 12 * k < n; ++k)\n     if ((n % (6 * k + 1) == 0) || (n % (6 * k - 1) == 0)) return false;\n   return true;\n }\n bool _p(unsigned long long a, unsigned long long n) {\n   unsigned long long t, u, i, p, c = 0;\n   u = n / 2, t = 1;\n   while (!(u & 1)) {\n     u /= 2;\n     ++t;\n   }\n   p = fme(a, u, n);\n   for (i = 1; i <= t; ++i) {\n     c = (p * p) % n;\n     if ((c == 1) && (p != 1) && (p != n - 1)) return 1;\n     p = c;\n   }\n   if (c != 1) return 1;\n   return 0;\n }\n inline bool isPrime(unsigned long long n) {\n   if (((!(n & 1)) && n != 2) || (n < 2) || (n % 3 == 0 && n != 3)) return 0;\n   if (n < 1373653) {\n     for (unsigned long long k = 1; (((36 * k * k) - (12 * k)) < n); ++k)\n       if ((n % (6 * k + 1) == 0) || (n % (6 * k - 1) == 0)) return 0;\n     return 1;\n   }\n   if (n < 9080191) {\n     if (_p(31, n) || _p(73, n)) return 0;\n     return 1;\n   }\n   if (_p(2, n) || _p(7, n) || _p(61, n)) return 0;\n   return 1;\n }\n unsigned long long nCk(long long n, long long k,\n                        unsigned long long m = 1000000007) {\n   if (k < 0 || k > n || n < 0) return 0;\n   if (k == 0 || k == n) return 1;\n   if (fact.size() >= (unsigned long long)n && isPrime(m)) {\n     return (((fact[n] * invfact[k]) % m) * invfact[n - k]) % m;\n   }\n   unsigned long long i = 0, j = 0, a = 1;\n   k = ((k) < (n - k) ? (k) : (n - k));\n   for (; i < (unsigned long long)k; ++i) {\n     a = (a * (n - i)) % m;\n     while (j < (unsigned long long)k && (a % (j + 1) == 0)) {\n       a = a / (j + 1);\n       ++j;\n     }\n   }\n   while (j < (unsigned long long)k) {\n     a = a / (j + 1);\n     ++j;\n   }\n   return a % m;\n }\n void nCkInit(unsigned long long m = 1000000007) {\n   long long i, mx = 1010000;\n   fact.resize(mx + 1);\n   invfact.resize(mx + 1);\n   fact[0] = 1;\n   for (i = 1; i <= mx; ++i) {\n     fact[i] = (i * fact[i - 1]) % m;\n   }\n   invfact[mx] = fme(fact[mx], m - 2, m);\n   for (i = mx - 1; i >= 0; --i) {\n     invfact[i] = (invfact[i + 1] * (i + 1)) % m;\n   }\n }\n template <class T>\n T gcd(T a, T b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n void extGCD(long long a, long long b, long long &x, long long &y) {\n   if (b == 0) {\n     x = 1, y = 0;\n     return;\n   }\n   long long x1, y1;\n   extGCD(b, a % b, x1, y1);\n   x = y1;\n   y = x1 - (a / b) * y1;\n }\n inline void get(long long &x) {\n   int n = 0;\n   x = 0;\n   char c = getchar_unlocked();\n   if (c == '-') n = 1;\n   while (c < '0' || c > '9') {\n     c = getchar_unlocked();\n     if (c == '-') n = 1;\n   }\n   while (c >= '0' && c <= '9') {\n     x = (x << 3) + (x << 1) + c - '0';\n     c = getchar_unlocked();\n   }\n   if (n) x = -x;\n }\n inline int get(char *p) {\n   char c = getchar_unlocked();\n   int i = 0;\n   while (c != '\n' && c != '\0' && c != ' ' && c != '\r' && c != EOF) {\n     p[i++] = c;\n     c = getchar_unlocked();\n   }\n   p[i] = '\0';\n   return i;\n }\n inline void put(long long a) {\n   int n = (a < 0 ? 1 : 0);\n   if (n) a = -a;\n   char b[20];\n   int i = 0;\n   do {\n     b[i++] = a % 10 + '0';\n     a /= 10;\n   } while (a);\n   if (n) putchar_unlocked('-');\n   i--;\n   while (i >= 0) putchar_unlocked(b[i--]);\n   putchar_unlocked(' ');\n }\n inline void putln(long long a) {\n   int n = (a < 0 ? 1 : 0);\n   if (n) a = -a;\n   char b[20];\n   int i = 0;\n   do {\n     b[i++] = a % 10 + '0';\n     a /= 10;\n   } while (a);\n   if (n) putchar_unlocked('-');\n   i--;\n   while (i >= 0) putchar_unlocked(b[i--]);\n   putchar_unlocked('\n');\n }\n const int K = 3;\n std::vector<std::vector<long long> > mul(std::vector<std::vector<long long> > a,\n                                          std::vector<std::vector<long long> > b,\n                                          unsigned long long m = 1000000007) {\n   std::vector<std::vector<long long> > c(K, std::vector<long long>(K));\n   for (int ii = 0; ii < (K); ++ii)\n     for (int jj = 0; jj < (K); ++jj)\n       for (int kk = 0; kk < (K); ++kk)\n         c[ii][jj] = (c[ii][jj] + a[ii][kk] * b[kk][jj]) % m;\n   return c;\n }\n std::vector<std::vector<long long> > fme(std::vector<std::vector<long long> > a,\n                                          unsigned long long n,\n                                          unsigned long long m = 1000000007) {\n   if (n == 1) return a;\n   if (n & 1) return mul(a, fme(a, n - 1, m), m);\n   std::vector<std::vector<long long> > x = fme(a, n / 2, m);\n   return mul(x, x, m);\n }\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   std::cin.tie(NULL);\n   std::cout.tie(NULL);\n   long long t = 0, n = 0, m = 0, maxx = 0, minn = 0, curr = 0, k = 0, num = 0,\n             siz = 0, n1 = 0, n2 = 0, n3 = 0, n4 = 0, ind = 0;\n   long long root = 0, sum = 0, diff = 0, q = 0, choice = 0, d = 0, len = 0,\n             begg = 0, endd = 0, pos = 0, cnt = 0, lo = 0, hi = 0, mid = 0,\n             ans = 0;\n   bool flag = false;\n   std::string s1, s2, s3, str;\n   char ch, ch1, ch2, ch3, *ptr;\n   double dub = 0;\n   cin >> n1 >> n2;\n   root = 1;\n   while (1) {\n     if (pos == 0) {\n       if (n1 < root) break;\n       n1 -= root;\n     } else {\n       if (n2 < root) break;\n       n2 -= root;\n     }\n     ++root;\n     pos = 1 - pos;\n   }\n   if (pos == 0)\n     cout << 'Vladik';\n   else\n     cout << 'Valera';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long t = 1;\n void solve() {\n   long long n, x, y, cnt = 0, p = 1;\n   cin >> n;\n   vector<long long> arr(n + 1), vis(n + 1, 0);\n   vector<vector<long long> > v(n + 1);\n   for (long long i = 0; i < n - 1; i += 1) {\n     cin >> x >> y;\n     v[x].push_back(y);\n     v[y].push_back(x);\n   }\n   queue<long long> q1, q;\n   for (long long i = 0; i < n; i += 1) {\n     cin >> x;\n     arr[i] = x;\n     q1.push(x);\n   }\n   q.push(1);\n   q1.pop();\n   while (!q.empty()) {\n     x = q.front();\n     vector<long long> vv;\n     set<long long> s;\n     cnt = 0;\n     for (long long i = 0; i < int((v[x]).size()); i += 1) {\n       if (vis[v[x][i]] == 0) {\n         cnt++;\n         vv.push_back(v[x][i]);\n       }\n     }\n     vis[q.front()] = 1;\n     q.pop();\n     for (long long i = p; i < p + cnt; i += 1) {\n       s.insert(arr[i]);\n       q.push(arr[i]);\n       vis[arr[i]] = 1;\n     }\n     for (long long i = 0; i < int((vv).size()); i += 1) {\n       if (((s).find(vv[i]) != (s).end())) {\n         s.erase(vv[i]);\n       } else {\n         cout << 'No';\n         return;\n       }\n     }\n     p = p + cnt;\n   }\n   cout << 'Yes';\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   while (t--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n pair<int, int> point[100];\n double ang[100];\n double dp[10000000];\n int i, j, k, N, M, K, l, r;\n void clear() {}\n void init() {\n   scanf('%d%d%d', &N, &l, &r);\n   for (i = 0; i <= N - 1; i++) {\n     int first;\n     scanf('%d%d%d', &point[i].first, &point[i].second, &first);\n     ang[i] = (first * 1.0) * 3.1415926535 / 180.0;\n   }\n }\n double func(int a, int h, double ang, double st) {\n   double alpha = atan(fabs(a - st) / h);\n   if (a > st) {\n     double beta = alpha - ang;\n     if (beta > 0) {\n       double q = h * tan(beta);\n       return min(1.0 * r, a - q);\n     } else {\n       beta *= -1;\n       return min(1.0 * r, a + h * tan(beta));\n     }\n   } else {\n     if (alpha + ang > 3.1415926535 / 2) {\n       return 1.0 * r;\n     } else {\n       double beta = alpha + ang;\n       return min(1.0 * r, h * tan(beta) + a);\n     }\n   }\n }\n void calc() {\n   for (i = 0; i <= (1 << N) - 1; i++) {\n     dp[i] = l * 1.0;\n   }\n   for (i = 0; i <= (1 << N) - 1; i++) {\n     for (j = 0; j <= N - 1; j++) {\n       if (!(i & (1 << j)))\n         dp[i | (1 << j)] =\n             max(dp[i | (1 << j)],\n                 func(point[j].first, point[j].second, ang[j], dp[i]));\n     }\n   }\n   printf('%.8f\n', dp[(1 << N) - 1] - l);\n }\n int main() {\n   clear();\n   init();\n   calc();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int vis[100005], n, m, x, y, mi, eg, re;\n char t;\n vector<vector<pair<int, int> > > adj;\n vector<vector<int> > re1;\n vector<int> t0, t1;\n void dfs(int u, int ty) {\n   if (vis[u] == -1) {\n     vis[u] = ty;\n     if (ty == 0)\n       t0.push_back(u);\n     else\n       t1.push_back(u);\n     for (int j = 0; j < adj[u].size(); j++) {\n       pair<int, int> te = adj[u][j];\n       if (te.second == eg)\n         dfs(te.first, ty);\n       else\n         dfs(te.first, 1 - ty);\n     }\n   } else if (vis[u] != ty) {\n     mi = -1;\n     return;\n   }\n }\n int main() {\n   cin >> n >> m;\n   adj.assign(n + 1, vector<pair<int, int> >(0));\n   re1.assign(2, vector<int>(0));\n   for (int i = 0; i < m; i++) {\n     cin >> x >> y >> t;\n     adj[x].push_back(pair<int, int>(y, t == 'B'));\n     adj[y].push_back(pair<int, int>(x, t == 'B'));\n   }\n   memset(vis, -1, sizeof(vis));\n   mi = 0;\n   eg = 1;\n   for (int i = 1; i <= n; i++) {\n     t0.clear();\n     t1.clear();\n     if (vis[i] == -1) dfs(i, 0);\n     if (mi == -1) break;\n     if (t0.size() < t1.size()) {\n       mi += t0.size();\n       for (int j = 0; j < t0.size(); j++) re1[0].push_back(t0[j]);\n     } else {\n       mi += t1.size();\n       for (int j = 0; j < t1.size(); j++) re1[0].push_back(t1[j]);\n     }\n   }\n   re = mi;\n   memset(vis, -1, sizeof(vis));\n   mi = 0;\n   eg = 0;\n   for (int i = 1; i <= n; i++) {\n     t0.clear();\n     t1.clear();\n     if (vis[i] == -1) dfs(i, 0);\n     if (mi == -1) break;\n     if (t0.size() < t1.size()) {\n       mi += t0.size();\n       for (int j = 0; j < t0.size(); j++) re1[1].push_back(t0[j]);\n     } else {\n       mi += t1.size();\n       for (int j = 0; j < t1.size(); j++) re1[1].push_back(t1[j]);\n     }\n   }\n   if (mi == -1) {\n     if (re == -1)\n       cout << -1 << endl;\n     else {\n       cout << re << endl;\n       for (int i = 0; i < re1[0].size(); i++) cout << re1[0][i] << ' ';\n       cout << endl;\n     }\n   } else if (re == -1) {\n     cout << mi << endl;\n     for (int i = 0; i < re1[1].size(); i++) cout << re1[1][i] << ' ';\n     cout << endl;\n   } else {\n     if (mi < re) {\n       cout << mi << endl;\n       for (int i = 0; i < re1[1].size(); i++) cout << re1[1][i] << ' ';\n       cout << endl;\n     } else {\n       cout << re << endl;\n       for (int i = 0; i < re1[0].size(); i++) cout << re1[0][i] << ' ';\n       cout << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int hashCh = 31;\n struct HashCh {\n   string code;\n   int number;\n };\n long long getHash(string text) {\n   long long hash = 0;\n   int size = text.size();\n   for (int i = 0; i < size; i++) {\n     int ch = static_cast<int>(text[i]);\n     hash += pow(hashCh, i) * ch;\n   }\n   return hash;\n }\n int main() {\n   vector<string> password;\n   map<long long, HashCh> numbers;\n   char buf[80];\n   string oneNumber;\n   for (int i = 0; i < 80; i++) {\n     char ch;\n     cin >> ch;\n     oneNumber += ch;\n     if ((i % 10) == 9) {\n       password.push_back(oneNumber);\n       oneNumber = '';\n     }\n   }\n   for (int i = 0; i < 10; i++) {\n     string number;\n     cin >> number;\n     HashCh ch = HashCh();\n     ch.code = number;\n     ch.number = i;\n     long long hash = getHash(number);\n     numbers[hash] = ch;\n   }\n   vector<int> result;\n   for (int i = 0; i < 8; i++) {\n     auto it = numbers.find(getHash(password[i]));\n     if (it != numbers.end() && it->second.code == password[i]) {\n       result.push_back(it->second.number);\n     }\n   }\n   for (auto i = result.begin(); i != result.end(); i++) {\n     cout << *i;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct fastIO {\n   fastIO() { ios_base::sync_with_stdio(0); }\n };\n const int MAXN = 1e6 * 2;\n long long n, a[MAXN], x, ans = MAXN, b;\n int main() {\n   fastIO();\n   cin >> n;\n   for (long long i = 0; i < n; i++) cin >> a[i];\n   for (x = 0; x < n; x++) {\n     b = 0;\n     for (long long i = 0; i < n; i++) {\n       b += (abs(x - i) + i + x) * a[i] * 2;\n     }\n     if (0) cerr << ans << endl;\n     ans = min(ans, b);\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n, k, x;\n     cin >> n >> k;\n     char s;\n     string str;\n     int p = n / k, q = n % k;\n     for (int i = 0; i < k; ++i) {\n       x = i + 97;\n       s = x;\n       if (i == k - 1) p = p + q;\n       for (int j = 0; j < p; ++j) str += s;\n     }\n     cout << str << endl;\n   }\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n using namespace std;\n typedef long long ll;\n const int maxn=405;\n const int P=998244353;\n ll dp[2][maxn][maxn][3][3],sum[maxn][maxn];\n int cur,las,n,c[26];\n void add(ll &dpp,ll add) {\n 	add%=P;\n 	while(add<0) add+=P;\n 	dpp+=add;\n 	while(dpp>=P) dpp-=P;\n }\n int main() {\n 	scanf('%d',&n);\n 	for(int i=0;i<26;++i)\n 		scanf('%d',&c[i]);\n 	dp[0][0][0][0][0]=1;\n 	las=1;cur=0;\n 	for(int i=1;i<=n;++i) {\n 		swap(las,cur);\n 		for(int j=0;j<=i;++j)\n 			for(int k=0;k<=i;++k)\n 				for(int l=0;l<3;++l)\n 					for(int m=0;m<3;++m)\n 						dp[cur][j][k][l][m]=0;\n 		for(int j=0;j<=i;++j)\n 			for(int k=0;k<=i;++k)\n 				for(int l=0;l<3;++l)\n 					for(int m=0;m<3;++m) {\n 						if(!dp[las][j][k][l][m])continue;\n 						add(dp[cur][j][k][m][0],1LL*dp[las][j][k][l][m]*((l||(i<=2))?24:23)%P);\n 						if(l!=1) add(dp[cur][j+1][k][m][1],dp[las][j][k][l][m]);\n 						if(l!=2) add(dp[cur][j][k+1][m][2],dp[las][j][k][l][m]);\n 					}\n 	}	\n 	for(int i=0;i<=n;++i)\n 		for(int j=0;j<=n;++j)\n 			for(int k=0;k<3;++k)\n 				for(int kk=0;kk<3;++kk)\n 					add(sum[i][j],dp[cur][i][j][k][kk]);\n 	for(int i=n;i>=0;--i)\n 		for(int j=n;j>=0;--j)\n 			add(sum[i][j],sum[i+1][j]+sum[i][j+1]-sum[i+1][j+1]);\n 	ll res=1;\n 	for(int i=1;i<=n;++i)\n 		res=res*((i<=2)?26:25)%P;\n 	for(int i=0;i<26;++i)\n 		add(res,-sum[c[i]+1][0]);\n 	for(int i=0;i<26;++i)\n 		for(int j=i+1;j<26;++j)\n 			add(res,sum[c[i]+1][c[j]+1]);\n 	res+=P;\n 	res%=P;\n 	printf('%lld\n',res);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long gcd(long long a, long long b) {\n   a = abs(a), b = abs(b);\n   if (a < b) swap(a, b);\n   return b ? gcd(b, a % b) : a;\n }\n vector<vector<int> > adj;\n set<int> st;\n const int dx[] = {0, 0, -1, 1};\n const int dy[] = {-1, 1, 0, 0};\n long long n, ary[300000 + 5] = {4, 8, 15, 16, 23, 42}, dp[300000 + 5];\n int main(void) {\n   ios::sync_with_stdio(false), cin.tie(NULL);\n   cin >> n;\n   for (int i = 0, j, x; i < n; ++i) {\n     cin >> x;\n     j = lower_bound(ary, ary + 6, x) - ary;\n     if (j == 0)\n       dp[0] += 1;\n     else if (dp[j - 1]) {\n       dp[j - 1] -= 1;\n       dp[j] += 1;\n     }\n   }\n   cout << n - dp[5] * 6;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> v[100001];\n int n, cost[100001];\n int gr, nod, gr2;\n void DFS(int x, int t, int val) {\n   for (int i = 1; i <= v[x][0]; i++) {\n     if (v[x][i] != t) {\n       if (val == 0) {\n         DFS(v[x][i], x, cost[v[x][i]]);\n       } else {\n         if (val != cost[v[x][i]]) {\n           gr++;\n           if (nod != x) gr2++;\n           nod = x;\n         }\n         DFS(v[x][i], x, cost[v[x][i]]);\n       }\n     }\n   }\n }\n int main() {\n   int a, b, i, j;\n   cin >> n;\n   for (i = 1; i <= n; i++) {\n     v[i].push_back(0);\n   }\n   for (i = 1; i < n; i++) {\n     cin >> a >> b;\n     v[a][0]++;\n     v[b][0]++;\n     v[a].push_back(b);\n     v[b].push_back(a);\n   }\n   for (i = 1; i <= n; i++) cin >> cost[i];\n   DFS(1, 0, 0);\n   if (gr2 <= 2) {\n     if (gr == 0) {\n       cout << 'YES'\n            << '\n'\n            << 1;\n     } else {\n       gr = 0;\n       DFS(nod, 0, 0);\n       if (gr != 0) {\n         cout << 'NO';\n       } else {\n         cout << 'YES';\n         cout << '\n' << nod;\n       }\n     }\n   } else {\n     cout << 'NO';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int Ans[1001], A[1001], B[1001], C[1001], D[1001], E[1001];\n int value(int Arr[], int i, int j, int k) {\n   return (Arr[j] - Arr[i]) * (Arr[k] - Arr[i]);\n }\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> A[i] >> B[i] >> C[i] >> D[i] >> E[i];\n   }\n   int index = 0;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       if (j != i) {\n         for (int k = 0; k < n; k++) {\n           if (k != i && k != j) {\n             if ((value(A, i, j, k) + value(B, i, j, k) + value(C, i, j, k) +\n                  value(D, i, j, k) + value(E, i, j, k)) > 0) {\n               Ans[i] = -1;\n               break;\n             }\n           }\n         }\n       }\n     }\n   }\n   int count = 0;\n   for (int i = 0; i < n; i++) {\n     if (Ans[i] != -1) {\n       count++;\n     }\n   }\n   cout << count << endl;\n   for (int i = 0; i < n; i++) {\n     if (Ans[i] != -1) {\n       cout << i + 1 << endl;\n       count++;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   int T;\n   cin >> T;\n   while (T--) {\n     int N;\n     cin >> N;\n     vector<int> a(N);\n     ;\n     for (int& x : a) cin >> x;\n     int ans = (a[0] == 1);\n     for (int i = 1; i < N; ++i) {\n       if (a[i] == 0) continue;\n       int j = i;\n       while (j < N && a[j] == 1) ++j;\n       ans += (j - i) / 3;\n       i = j - 1;\n     }\n     cout << ans << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n using Vi = vector<int>;\n using Pii = pair<int, int>;\n int uplg(int n) { return 32 - __builtin_clz(n); }\n int uplg(ll n) { return 64 - __builtin_clzll(n); }\n void run();\n int main() {\n   cin.sync_with_stdio(0);\n   cin.tie(0);\n   cout << fixed << setprecision(12);\n   run();\n   cout << flush;\n   _Exit(0);\n }\n ll ch2(ll n) { return n * (n - 1) / 2; }\n ll ch3(ll n) { return n * (n - 1) * (n - 2) / 6; }\n void run() {\n   int n;\n   double p;\n   cin >> n >> p;\n   constexpr ll SCALE = 10000;\n   ll pScaled = llround(p * SCALE);\n   ll low = pScaled * ch3(n) * 2;\n   for (int a = (0); a < (n + 1); a++) {\n     ll cur = (ch3(a) * 2 + ch2(a) * (n - a) * 2 + a * ch2(n - a)) * SCALE;\n     if (cur >= low) {\n       cout << a << '\n';\n       return;\n     }\n   }\n   assert(0);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string q[41];\n   long long n, p, i, count = 1, check = 1;\n   cin >> n >> p;\n   for (i = 0; i < n; i++) cin >> q[i];\n   for (i = n - 2; i >= 0; i--) {\n     if (q[i] == 'halfplus') {\n       count = count * 2 + 1;\n       check++;\n     } else\n       count = count * 2;\n   }\n   cout << p * count - (p / 2) * check << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve();\n const int N = 10000005;\n long long i, j, n, s;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int t = 1;\n   while (t--) {\n     solve();\n     cout << '\n';\n   }\n   return 0;\n }\n void solve() {\n   cin >> n;\n   for (i = 1; i <= n; i = i * 10) {\n     s += n - i + 1;\n   }\n   cout << s;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mod = 1000000007;\n int main() {\n   long long dp[3001][100][2] = {0};\n   long long n, l;\n   cin >> n >> l;\n   vector<long long> a(n), b(n);\n   for (long long i = 0; i < n; ++i) {\n     cin >> a[i] >> b[i];\n     dp[a[i]][i][0] = 1;\n     dp[b[i]][i][1] = 1;\n   }\n   for (long long i = 1; i <= l; ++i) {\n     for (long long j = 0; j < n; ++j) {\n       for (long long k = 0; k < n; ++k) {\n         if (j != k) {\n           if (a[j] == b[k] && i - a[j] >= 0) {\n             dp[i][j][0] = (dp[i][j][0] + dp[i - a[j]][k][0]) % mod;\n           }\n           if (a[j] == a[k] && a[k] != b[k] && i - a[j] >= 0) {\n             dp[i][j][0] = (dp[i][j][0] + dp[i - a[j]][k][1]) % mod;\n           }\n           if (b[j] == b[k] && a[j] != b[j] && i - b[j] >= 0) {\n             dp[i][j][1] = (dp[i][j][1] + dp[i - b[j]][k][0]) % mod;\n           }\n           if (b[j] == a[k] && a[j] != b[j] && a[k] != b[k] && i - b[j] >= 0) {\n             dp[i][j][1] = (dp[i][j][1] + dp[i - b[j]][k][1]) % mod;\n           }\n         }\n       }\n     }\n   }\n   long long res = 0;\n   for (long long i = 0; i < n; ++i) {\n     res = (res + dp[l][i][0]) % mod;\n     if (a[i] != b[i]) res = (res + dp[l][i][1]) % mod;\n   }\n   cout << res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int par[100005], val[100005];\n int lefm[100005], rim[100005];\n int root = 0;\n vector<vector<int> > adjl;\n int n;\n void pre(int node) {\n   if (adjl[node].size() == 0) {\n     lefm[node] = val[node];\n     rim[node] = val[node];\n     return;\n   }\n   for (int i = (0); i < (adjl[node].size()); ++i) {\n     pre(adjl[node][i]);\n     if (val[adjl[node][i]] < val[node])\n       lefm[node] = lefm[adjl[node][i]];\n     else\n       rim[node] = rim[adjl[node][i]];\n   }\n }\n double res[100005];\n pair<int, int> qu[100005];\n void query(int node, int left, int right, long long cost, int dep) {\n   if (adjl[node].size() == 0) {\n     for (int i = (left); i < (right); ++i) res[qu[i].second] += cost * 1. / dep;\n     return;\n   }\n   int ind = lower_bound(qu + left, qu + right, make_pair(val[node], 0)) - qu;\n   if (ind > left && adjl[node].size() == 2)\n     query(adjl[node][0], left, ind, cost + lefm[adjl[node][1]], dep + 1);\n   if (ind < right && adjl[node].size() == 2)\n     query(adjl[node][1], ind, right, cost + rim[adjl[node][0]], dep + 1);\n }\n int main() {\n   int x, y, k;\n   scanf('%d', &n);\n   adjl.clear();\n   adjl.resize(n);\n   for (int i = (0); i < (n); ++i) {\n     scanf('%d %d', &x, &y);\n     x--;\n     val[i] = y;\n     par[i] = x;\n     if (x >= 0) adjl[x].push_back(i);\n     if (x < 0) root = i;\n   }\n   for (int i = (0); i < (adjl.size()); ++i) {\n     if (adjl[i].size() == 2)\n       if (val[adjl[i][0]] > val[adjl[i][1]]) swap(adjl[i][0], adjl[i][1]);\n     if (adjl[i].size() == 1) throw 2;\n   }\n   pre(root);\n   scanf('%d', &k);\n   for (int i = (0); i < (k); ++i) scanf('%d', &qu[i].first), qu[i].second = i;\n   sort(qu, qu + k);\n   query(root, 0, k, 0, 0);\n   for (int i = (0); i < (k); ++i) printf('%.12lf\n', res[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long double judge1(long long k, long long d, long long t) {\n   long double ans;\n   long double unit = k + (d - k) * 1.0 / 2;\n   ans = floor(t / unit) * d;\n   long double res = t * 1.0 - floor(t / unit) * unit;\n   if (res <= k) {\n     ans += res;\n     return ans;\n   } else {\n     ans += k;\n     res -= k;\n   }\n   ans += (res * 2);\n   return ans;\n }\n long double judge2(long long k, long long d, long long t) {\n   long double ans;\n   ans = t;\n   return ans;\n }\n long double judge3(long long k, long long d, long long t) {\n   long double ans;\n   long double unitt = (k / d + 1) * d * 1.0;\n   long double unitw = k + (unitt - k) / 2.0;\n   ans += floor(t / unitw) * unitt;\n   long double res = t - floor(t / unitw) * unitw;\n   if (fabs(res - k) <= 1e-9 || res < k) {\n     ans += res;\n     return ans;\n   } else {\n     ans += k;\n     res -= k;\n   }\n   ans += (res * 2.0);\n   return ans;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   long long k, d, t;\n   while (cin >> k >> d >> t) {\n     long double ans;\n     if (k < d)\n       ans = judge1(k, d, t);\n     else if (k % d == 0)\n       ans = judge2(k, d, t);\n     else\n       ans = judge3(k, d, t);\n     cout << fixed << setprecision(1) << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n, k;\n   cin >> n >> k;\n   vector<bool> pref(1 << n);\n   for (int i = 0; i < k; i++) {\n     int x;\n     cin >> x;\n     pref[x - 1] = true;\n   }\n   const int oo = -1;\n   vector<vector<vector<int>>> dp(\n       4, vector<vector<int>>(n + 1, vector<int>(1 << n, oo)));\n   for (int i = 0; i < (1 << n); i += 2) {\n     if (pref[i] && pref[i + 1])\n       dp[3][1][i] = 1;\n     else if (pref[i] || pref[i + 1])\n       dp[1][1][i] = dp[2][1][i] = 1;\n     else\n       dp[0][1][i] = 0;\n   }\n   for (int i = 2; i <= n; i++)\n     for (int j = 0; j < (1 << n); j += (1 << i))\n       for (int p = 0; p < 4; p++)\n         for (int q = 0; q < 4; q++)\n           if (dp[p][i - 1][j] != -1 && dp[q][i - 1][j + (1 << (i - 1))] != -1) {\n             int t = dp[p][i - 1][j] + dp[q][i - 1][j + (1 << (i - 1))];\n             int upper = ((p & 2) > 0) + ((q & 2) > 0);\n             int lower = ((p & 1) + (q & 1));\n             if (upper == 2) {\n               t += (lower > 0) + 2;\n               dp[3][i][j] = max(dp[3][i][j], t);\n               if (lower < 2) dp[2][i][j] = max(dp[2][i][j], t);\n             } else if (upper == 1) {\n               t += (lower > 0) + 1;\n               if (lower == 0) {\n                 dp[2][i][j] = max(dp[2][i][j], t);\n                 dp[1][i][j] = max(dp[1][i][j], t + 1);\n                 dp[0][i][j] = max(dp[0][i][j], t + 1);\n               }\n               if (lower == 1) {\n                 dp[3][i][j] = max(dp[3][i][j], t + 1);\n                 dp[2][i][j] = max(dp[2][i][j], t + 1);\n                 dp[1][i][j] = max(dp[1][i][j], t + 1);\n                 dp[0][i][j] = max(dp[0][i][j], t + 1);\n               }\n               if (lower == 2) {\n                 dp[3][i][j] = max(dp[3][i][j], t + 1);\n                 dp[2][i][j] = max(dp[2][i][j], t + 1);\n                 dp[1][i][j] = max(dp[1][i][j], t + 1);\n               }\n             } else if (upper == 0) {\n               t += (lower > 0);\n               if (lower == 0) dp[0][i][j] = max(dp[0][i][j], t);\n               if (lower == 1) {\n                 dp[1][i][j] = max(dp[1][i][j], t + 1);\n                 dp[0][i][j] = max(dp[0][i][j], t + 1);\n               }\n               if (lower == 2) {\n                 dp[1][i][j] = max(dp[1][i][j], t + 1);\n                 dp[0][i][j] = max(dp[0][i][j], t + 1);\n               }\n             }\n           }\n   int ans = 0;\n   for (int p = 0; p < 4; p++) ans = max(dp[p][n][0] + (p > 0), ans);\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int l[2005], r[2005];\n long long k, w[2005];\n long long s[2005][2005];\n long long f[2005];\n long long h[2005];\n long long up(long long x) { return (x / k + (x % k > 0)); }\n int main() {\n   cin >> n >> k;\n   for (int i = (1); i <= (n); i++) cin >> l[i] >> r[i] >> w[i];\n   for (int i = (1); i <= (n); i++) h[i] = -1;\n   for (int i = (1); i <= (n); i++)\n     for (int j = (1); j <= (n); j++) s[i][j] = -1;\n   for (int i = (1); i <= (n); i++) {\n     long long start = k;\n     long long has = 0;\n     for (int j = (i); j <= (n); j++) {\n       if (start >= w[j]) {\n         if (l[j] < l[j + 1]) s[i][j] = has + start;\n         has += w[j];\n         start -= w[j];\n         if (j == n) h[i] = has;\n       } else {\n         long long t = up(w[j] - start) + 1;\n         if (t > r[j] - l[j] + 1) break;\n         if (l[j] + t - 1 < l[j + 1]) s[i][j] = has + (t - 1) * k + start;\n         has += w[j];\n         if (j == n) h[i] = has;\n         start = start + (t - 1) * k - w[j];\n       }\n     }\n   }\n   for (int i = (1); i <= (n - 1); i++) {\n     f[i] = -1;\n     for (int j = (i - 1); j >= (0); j--) {\n       if (s[j + 1][i] >= 0 && f[j] >= 0)\n         if (f[i] < 0 || f[j] + s[j + 1][i] < f[i]) f[i] = f[j] + s[j + 1][i];\n     }\n   }\n   long long ans = -1;\n   for (int i = (0); i <= (n - 1); i++)\n     if (f[i] >= 0 && h[i + 1] >= 0) {\n       if (ans < 0 || f[i] + h[i + 1] < ans) ans = f[i] + h[i + 1];\n     }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 310;\n int n, a[maxn];\n int main() {\n   scanf('%d', &n);\n   for (int i = (1); i <= (n); ++i) scanf('%d', &a[i]);\n   for (int i = (1); i <= (n - 1); ++i) {\n     for (int j = (1); j <= (a[i]); ++j) printf('PRL');\n     printf('R');\n   }\n   for (int j = (1); j <= (a[n]); ++j) printf('LRP');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, h, ok;\n long long cal(long long dep, long long pos, int tag) {\n   if (ok) return 0;\n   if (dep == 0) {\n     ok = 1;\n     return 0;\n   }\n   long long tmp;\n   if (!tag) {\n     if (pos > (1LL << (dep - 1)))\n       tmp = (1LL << dep) + cal(dep - 1, pos - (1LL << (dep - 1)), 0);\n     else\n       tmp = 1LL + cal(dep - 1, pos, 1);\n   } else {\n     if (pos > (1LL << (dep - 1)))\n       tmp = 1LL + cal(dep - 1, pos - (1LL << (dep - 1)), 0);\n     else\n       tmp = (1LL << dep) + cal(dep - 1, pos, 1);\n   }\n   return tmp;\n }\n int main() {\n   while (cin >> h >> n) {\n     ok = 0;\n     cout << cal(h, n, 0) << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n long long a[100][100];\n using namespace std;\n struct DynamicDisjointSetDS {\n   std::unordered_map<int, int> parent, degree;\n   int N;\n   DynamicDisjointSetDS(int n) { N = n; }\n   int getParent(int vertex) {\n     if (parent.find(vertex) != parent.end()) {\n       if (parent[vertex] != vertex) {\n         parent[vertex] = getParent(parent[vertex]);\n         return parent[vertex];\n       }\n     } else {\n       parent.insert(make_pair(vertex, vertex));\n       degree.insert(make_pair(vertex, 1));\n     }\n     return vertex;\n   }\n   void Union(int vertexA, int vertexB) {\n     int x = getParent(vertexA);\n     int y = getParent(vertexB);\n     if (x == y) return;\n     if (degree[x] > degree[y]) {\n       parent[y] = x;\n       degree[x] = degree[x] + degree[y];\n     } else {\n       parent[x] = y;\n       degree[y] = degree[y] + degree[x];\n     }\n   }\n   int GetTotalComponent() {\n     unordered_set<int> total;\n     for (auto itr = parent.begin(); itr != parent.end(); itr++) {\n       total.insert(getParent(itr->first));\n     }\n     return N - parent.size() + total.size();\n   }\n };\n int main() {\n   using namespace std;\n   long long n, m, q;\n   cin >> n >> m >> q;\n   unordered_set<long long> s, s2;\n   for (long long i = 1; i <= n; i++) {\n     s.insert(i);\n   }\n   for (long long i = 1; i <= m; i++) {\n     s2.insert(i);\n   }\n   DynamicDisjointSetDS ds(m + 1);\n   vector<vector<long long>> v(m + 1);\n   while (q--) {\n     long long r, c;\n     cin >> r >> c;\n     v[c].push_back(r);\n     s.erase(r);\n     s2.erase(c);\n   }\n   for (vector<long long> v2 : v) {\n     for (long long i = 1; i < v2.size(); i++) {\n       ds.Union(v2[i], v2[i - 1]);\n     }\n   }\n   unordered_set<long long> sc;\n   for (long long i = 1; i <= n; i++) {\n     sc.insert(ds.getParent(i));\n   }\n   cout << (s2.size() + sc.size() - 1) << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int read() {\n   int f = 1, x = 0;\n   char c = getchar();\n   while (c < '0' || c > '9') {\n     if (c == '-') f = -f;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();\n   return f * x;\n }\n inline int lowbit(int x) { return x & (-x); }\n inline int modadd(int x, int y) {\n   return (x + y >= 1000000007 ? x + y - 1000000007 : x + y);\n }\n inline int sgn(int x) { return (x < 0 ? -1 : (x > 0 ? 1 : 0)); }\n template <typename T>\n T gcd(T a, T b) {\n   return (!b) ? a : gcd(b, a % b);\n }\n int poww(int a, int b) {\n   int res = 1;\n   while (b > 0) {\n     if (b & 1) res = 1ll * res * a % 1000000007;\n     a = 1ll * a * a % 1000000007, b >>= 1;\n   }\n   return res;\n }\n const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};\n const int ddx[] = {-1, -1, -1, 0, 0, 1, 1, 1},\n           ddy[] = {-1, 0, 1, -1, 1, -1, 0, 1};\n int n, a[100005];\n void init() {\n   n = read();\n   for (int i = 1; i <= n; ++i) a[i] = read();\n }\n bool check1() {\n   long long tot = 0;\n   for (int i = n - 1; i >= 1; --i) {\n     if (a[i] < tot) return false;\n     if (a[i] > a[i + 1]) tot += a[i] - a[i + 1];\n   }\n   return true;\n }\n bool check2() {\n   long long tot = 0;\n   for (int i = 2; i <= n; ++i) {\n     if (a[i] < tot) return false;\n     if (a[i] > a[i - 1]) tot += a[i] - a[i - 1];\n   }\n   return true;\n }\n void solve() {\n   if (check1())\n     printf('YES\n');\n   else if (check2())\n     printf('YES\n');\n   else\n     printf('NO\n');\n }\n int main() {\n   int T = read();\n   while (T--) {\n     init();\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct grp {\n   long long to, wt, edgeCode;\n   char type;\n };\n struct Node {\n   long long x, dis;\n };\n struct comp {\n   inline bool operator()(const Node& n1, const Node& n2) const {\n     if (n1.dis != n2.dis) return n1.dis < n2.dis;\n     return n1.x < n2.x;\n   }\n };\n void dijkstra(long long n, vector<vector<grp> >& edges, vector<long long>& dis,\n               vector<bool>& visited, vector<pair<long long, long long> >& par) {\n   set<Node, comp> myset;\n   for (long long i = 1; i <= n; ++i) {\n     Node node;\n     node.x = i, node.dis = dis[i];\n     myset.insert(node);\n   }\n   while (myset.size()) {\n     set<Node>::iterator it = myset.begin();\n     Node node = *it;\n     myset.erase(it);\n     visited[node.x] = true;\n     for (long long i = 0; i < edges[node.x].size(); ++i) {\n       grp& edge = edges[node.x][i];\n       if (visited[edge.to]) {\n         continue;\n       }\n       long long newDis = dis[node.x] + edge.wt;\n       if (newDis < dis[edge.to] ||\n           (newDis == dis[edge.to] && edge.type == 'r')) {\n         Node prevNode, newNode;\n         prevNode.x = edge.to, prevNode.dis = dis[edge.to];\n         newNode.x = edge.to, newNode.dis = newDis;\n         dis[edge.to] = newDis;\n         par[edge.to] = {node.x, edge.edgeCode};\n         myset.erase(myset.find(prevNode));\n         myset.insert(newNode);\n       }\n     }\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   long long n, m, k;\n   cin >> n >> m >> k;\n   vector<vector<grp> > edges(n + 1);\n   long long edgeCode = 0;\n   for (long long i = 0; i < m; i++) {\n     long long x, y, w;\n     cin >> x >> y >> w;\n     grp g;\n     g.to = y, g.wt = w, g.type = 'r', g.edgeCode = edgeCode++;\n     edges[x].push_back(g);\n     g.to = x, g.edgeCode = edgeCode++;\n     edges[y].push_back(g);\n   }\n   vector<pair<long long, long long> > trainPaths(k);\n   for (long long i = 0; i < k; ++i) {\n     long long y, w;\n     cin >> y >> w;\n     trainPaths[i] = {y, edgeCode};\n     grp g;\n     g.to = y, g.wt = w, g.type = 't', g.edgeCode = edgeCode++;\n     edges[1].push_back(g);\n   }\n   vector<long long> dis(n + 1, 100000000000000000);\n   vector<bool> visited(n + 1, false);\n   vector<pair<long long, long long> > par(n + 1, {-1, -1});\n   dis[1] = 0;\n   dijkstra(n, edges, dis, visited, par);\n   long long ans = 0;\n   for (long long i = 0; i < k; ++i) {\n     long long dest = trainPaths[i].first, edgeCode = trainPaths[i].second;\n     if (par[dest].first == 1 && par[dest].second == edgeCode) {\n       continue;\n     }\n     ++ans;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n long long int power(long long int x, long long int b) {\n   long long int p = 1;\n   while (b > 0) {\n     if (b & 1) {\n       p = p * x;\n       p %= 1000000007;\n     }\n     b >>= 1;\n     x *= x;\n     x %= 1000000007;\n   }\n   return p % 1000000007;\n }\n using namespace std;\n struct lex_compare {\n   bool operator()(\n       const pair<long long int, pair<long long int, long long int> > p1,\n       const pair<long long int, pair<long long int, long long int> > p2) {\n     return (p1.first == p2.first) ? p1.second.first < p2.second.first\n                                   : p1.first > p2.first;\n   }\n };\n long long int n, m, b, mo;\n long long int dp[2][500 + 1][500 + 1];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   ;\n   long long int w, m;\n   cin >> w >> m;\n   bool f = 1;\n   map<long long int, long long int> coeff;\n   long long int term = 1;\n   while (m >= term && term <= 10000000000) {\n     long long int x = (term * (m / term) - (w * term) * (m / (w * term)));\n     x /= term;\n     if (x <= 1) {\n       term *= w;\n     } else {\n       if (x != (w - 1)) {\n         f = 0;\n         break;\n       } else {\n         m += (w * term - term);\n       }\n       term *= w;\n     }\n   }\n   if (f)\n     cout << 'YES'\n          << '\n';\n   else\n     cout << 'NO'\n          << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> di[100003];\n struct trie {\n   trie *zero, *one;\n   int val;\n   trie() {\n     zero = one = NULL;\n     val = 100003;\n   }\n } * root[100003];\n void add(trie *cur, int a) {\n   int i, ck;\n   for (i = 20; i >= 0; i--) {\n     ck = (1 << i & a);\n     if (ck == 0) {\n       cur->val = min(cur->val, a);\n       if (cur->zero == NULL) cur->zero = new trie();\n       cur = cur->zero;\n       cur->val = min(cur->val, a);\n     } else {\n       cur->val = min(cur->val, a);\n       if (cur->one == NULL) cur->one = new trie();\n       cur = cur->one;\n       cur->val = min(cur->val, a);\n     }\n   }\n }\n int query(trie *cur, int a, int lim) {\n   int i, ck, ans;\n   for (i = 20; i >= 0; i--) {\n     ck = (1 << i & a);\n     if (ck == 0) {\n       if (cur->one != NULL && cur->one->val + a <= lim)\n         cur = cur->one;\n       else if (cur->zero != NULL)\n         cur = cur->zero;\n       ans = cur->val;\n     } else {\n       if (cur->zero != NULL && cur->zero->val + a <= lim)\n         cur = cur->zero;\n       else if (cur->one != NULL)\n         cur = cur->one;\n       ans = cur->val;\n     }\n   }\n   return ans;\n }\n void pre() {\n   for (int i = 1; i < 100003; i++) {\n     for (int j = i; j < 100003; j += i) di[j].push_back(i);\n     root[i] = new trie();\n   }\n }\n int main() {\n   pre();\n   int q, a, k, s, v, ty;\n   scanf('%d', &q);\n   while (q--) {\n     scanf('%d', &ty);\n     if (ty == 1) {\n       scanf('%d', &a);\n       for (int x : di[a]) {\n         add(root[x], a);\n       }\n     } else {\n       scanf('%d %d %d', &v, &k, &s);\n       if (root[k]->val + v > s || root[k]->val == 0 || v % k)\n         printf('-1\n');\n       else\n         printf('%d\n', query(root[k], v, s));\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool isPrime(int n) {\n   if (n <= 1) return false;\n   for (int i = 2; i < n; i++)\n     if (n % i == 0) return false;\n   return true;\n }\n int main() {\n   long long int t;\n   cin >> t;\n   while (t--) {\n     long long int n;\n     cin >> n;\n     vector<long long int> v;\n     for (long long int i = 0; i < n; i++) {\n       long long int x;\n       cin >> x;\n       v.push_back(x);\n     }\n     if (v[0] + v[1] <= v[n - 1]) {\n       cout << 1 << ' ' << 2 << ' ' << n << '\n';\n     } else {\n       cout << -1 << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char bb[111][111];\n int in[111][111];\n int main() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < n; i++) scanf('%s', bb[i]);\n   vector<pair<pair<int, int>, int>> stars;\n   for (int i = 1; i < n - 1; i++) {\n     for (int j = 1; j < m - 1; j++) {\n       if (bb[i][j] != '*') continue;\n       int l, r, u, d;\n       l = r = i;\n       u = d = j;\n       for (int k = i; k < n; k++)\n         if (bb[k][j] == '*')\n           r = k;\n         else\n           break;\n       for (int k = i; k >= 0; k--)\n         if (bb[k][j] == '*')\n           l = k;\n         else\n           break;\n       for (int k = j; k < m; k++)\n         if (bb[i][k] == '*')\n           d = k;\n         else\n           break;\n       for (int k = j; k >= 0; k--)\n         if (bb[i][k] == '*')\n           u = k;\n         else\n           break;\n       int starLevel = min(min(r - i, i - l), min(d - j, j - u));\n       if (starLevel) {\n         for (int k = i - starLevel; k <= i + starLevel; k++) in[k][j] = 1;\n         for (int k = j - starLevel; k <= j + starLevel; k++) in[i][k] = 1;\n         stars.push_back({{i + 1, j + 1}, starLevel});\n       }\n     }\n   }\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++)\n       if ((bb[i][j] == '*' && in[i][j] == 0) ||\n           (in[i][j] == 1 && bb[i][j] == '.'))\n         return puts('-1');\n   cout << stars.size() << endl;\n   for (auto u : stars) {\n     printf('%d %d %d\n', u.first.first, u.first.second, u.second);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 500;\n const int LN = 21;\n const long long mod = 1e9 + 7;\n const long long INF = 1LL << 57;\n long long n, m, u, v, k, t, q, a, x, d;\n int tree[4 * N];\n int sum[4 * N];\n int lim = 1e6 + 2;\n int arr[N], brr[N];\n bool print = false;\n void modify(int i, int l, int r, int index, int val) {\n   if (l == r) {\n     tree[i] += val;\n     sum[i] = tree[i];\n     return;\n   }\n   int mid = (l + r) / 2;\n   if (index <= mid)\n     modify(i + 1 + i, l, mid, index, val);\n   else\n     modify(i + 2 + i, mid + 1, r, index, val);\n   tree[i] = max(tree[i + 2 + i], tree[i + 1 + i] + sum[i + 2 + i]);\n   sum[i] = sum[i + 1 + i] + sum[i + 2 + i];\n }\n int find(int i, int l, int r, int sumx) {\n   if (l == r) return l;\n   int mid = (l + r) / 2;\n   if (tree[i + 2 + i] + sumx > 0) {\n     return find(i + 2 + i, mid + 1, r, sumx);\n   } else\n     return find(i + 1 + i, l, mid, sumx + sum[i + 2 + i]);\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n >> m;\n   for (int i = 1; i <= n; ++i) {\n     cin >> arr[i];\n   }\n   for (int i = 1; i <= m; ++i) cin >> brr[i];\n   for (int i = 1; i <= n; ++i) {\n     modify(0, 0, lim, arr[i], 1);\n   }\n   for (int i = 1; i <= m; ++i) {\n     modify(0, 0, lim, brr[i], -1);\n   }\n   cin >> q;\n   while (q--) {\n     int type;\n     cin >> type;\n     if (type == 1) {\n       int i, x;\n       cin >> i >> x;\n       modify(0, 0, lim, arr[i], -1);\n       modify(0, 0, lim, x, 1);\n       arr[i] = x;\n       int price = find(0, 0, lim, 0);\n       if (price == 0)\n         cout << -1 << '\n';\n       else\n         cout << price << '\n';\n     } else {\n       int i, x;\n       cin >> i >> x;\n       modify(0, 0, lim, brr[i], 1);\n       modify(0, 0, lim, x, -1);\n       brr[i] = x;\n       int price = find(0, 0, lim, 0);\n       if (price == 0)\n         cout << -1 << '\n';\n       else\n         cout << price << '\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int n, k, d;\n   cin >> n >> k >> d;\n   long long a[101], b[101];\n   memset(a, 0, sizeof(a));\n   memset(b, 0, sizeof(b));\n   a[0] = 1;\n   long long sum = 0;\n   for (int i = 0; i < k; i++) {\n     sum += a[i];\n     sum = (sum) % 1000000007;\n     a[i + 1] = sum;\n   }\n   for (int i = k; i < n; i++) {\n     sum += a[i];\n     sum -= a[i - k];\n     sum = ((sum % 1000000007) + 1000000007) % 1000000007;\n     a[i + 1] = sum;\n   }\n   for (int i = 1; i < d; i++) {\n     b[i] = 0;\n   }\n   b[d] = 1;\n   for (int i = d + 1; i <= k; i++) {\n     b[i] = b[i - 1] + b[i - 1] - b[i - d] + a[i - d];\n     b[i] = ((b[i] % 1000000007) + 1000000007) % 1000000007;\n   }\n   for (int i = k + 1; i <= n; i++) {\n     b[i] = b[i - 1] + b[i - 1] - b[i - d] + a[i - d] - a[i - k - 1];\n     b[i] = ((b[i] % 1000000007) + 1000000007) % 1000000007;\n   }\n   cout << b[n] << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n void read(T &a) {\n   T x = 0, f = 1;\n   char ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') {\n     x = (x << 1) + (x << 3) + (ch ^ 48);\n     ch = getchar();\n   }\n   a = x * f;\n }\n template <typename T, typename... Args>\n void read(T &t, Args &...args) {\n   read(t);\n   read(args...);\n }\n long long n, k, a[100005];\n struct node {\n   long long len, k;\n   bool operator<(const node &x) const {\n     long long tmp1 = (len / k) * (len / k) * (k - len % k) +\n                      (len / k + 1) * (len / k + 1) * (len % k);\n     long long tmp2 = (x.len / x.k) * (x.len / x.k) * (x.k - x.len % x.k) +\n                      (x.len / x.k + 1) * (x.len / x.k + 1) * (x.len % x.k);\n     long long kk = k + 1;\n     long long tmpp1 = (len / kk) * (len / kk) * (kk - len % kk) +\n                       (len / kk + 1) * (len / kk + 1) * (len % kk);\n     kk = x.k + 1;\n     long long tmpp2 = (x.len / kk) * (x.len / kk) * (kk - x.len % kk) +\n                       (x.len / kk + 1) * (x.len / kk + 1) * (x.len % kk);\n     tmp1 -= tmpp1;\n     tmp2 -= tmpp2;\n     if (k == len) tmp1 = 0;\n     if (x.k == x.len) tmp2 = 0;\n     return tmp1 < tmp2;\n   }\n };\n priority_queue<node> q;\n void update(long long &ans, node &x) {\n   ans -= (x.len / x.k) * (x.len / x.k) * (x.k - x.len % x.k) +\n          (x.len / x.k + 1) * (x.len / x.k + 1) * (x.len % x.k);\n   x.k++;\n   ans += (x.len / x.k) * (x.len / x.k) * (x.k - x.len % x.k) +\n          (x.len / x.k + 1) * (x.len / x.k + 1) * (x.len % x.k);\n }\n signed main() {\n   read(n, k);\n   long long ans = 0;\n   for (long long i = 1; i <= n; i++) {\n     read(a[i]);\n     node tmp;\n     tmp.len = a[i];\n     tmp.k = 1;\n     q.push(tmp);\n   }\n   for (long long i = 1; i <= n; i++) ans += a[i] * a[i];\n   k -= n;\n   while (k) {\n     k += 19260817;\n     node x = q.top();\n     q.pop();\n     update(ans, x);\n     q.push(x);\n     k -= 19260818;\n   }\n   printf('%lld\n', ans + 'O' - 'O');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, l, v1, v2, k;\n long double dn, dl, dv1, dv2, dk;\n long long times;\n long double x;\n double T;\n int main() {\n   scanf('%lld%lld%lld%lld%lld', &n, &l, &v1, &v2, &k);\n   dn = n;\n   dl = l;\n   dv1 = v1;\n   dv2 = v2;\n   dk = k;\n   times = (n - 1) / k + 1;\n   x = l / (v2 * times - (dv2 - dv1) / (dv2 + dv1) * dv2 * (times - 1));\n   T = x * (times + (dv2 - dv1) / (dv2 + dv1) * (times - 1));\n   printf('%lf\n', T);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int const N = 3e5;\n int n, p1[N], p2[N], p3[N], num1[N], num2[N], F[N][2], T[N * 4];\n void buildT(int v, int tl, int tr) {\n   if (tl == tr) {\n     T[v] = 1;\n   } else {\n     int tm = (tl + tr) / 2;\n     buildT(v * 2, tl, tm);\n     buildT(v * 2 + 1, tm + 1, tr);\n     T[v] = T[v * 2] + T[v * 2 + 1];\n   }\n }\n void updT(int v, int tl, int tr, int p) {\n   if (tl == tr) {\n     T[v] = 0;\n   } else {\n     int tm = (tl + tr) / 2;\n     if (tm >= p)\n       updT(v * 2, tl, tm, p);\n     else\n       updT(v * 2 + 1, tm + 1, tr, p);\n     T[v] = T[v * 2] + T[v * 2 + 1];\n   }\n }\n int getT(int v, int tl, int tr, int k) {\n   if (tl == tr) {\n     return tl;\n   } else {\n     int tm = (tl + tr) / 2;\n     if (T[v * 2] >= k)\n       return getT(v * 2, tl, tm, k);\n     else\n       return getT(v * 2 + 1, tm + 1, tr, k - T[v * 2]);\n   }\n }\n void upd(int x, int t) {\n   while (x < n) {\n     ++F[x][t];\n     x |= (x + 1);\n   }\n }\n int get(int x, int t) {\n   int r = 0;\n   while (x >= 0) {\n     r += F[x][t];\n     x = (x & (x + 1)) - 1;\n   }\n   return r;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; ++i) scanf('%d', &p1[i]);\n   for (int i = 0; i < n; ++i) scanf('%d', &p2[i]);\n   for (int i = 0; i < n; ++i) {\n     num1[i] = p1[i] - get(p1[i], 0);\n     upd(p1[i] + 1, 0);\n     num2[i] = p2[i] - get(p2[i], 1);\n     upd(p2[i] + 1, 1);\n   }\n   for (int i = n - 1; i >= 0; --i) {\n     num1[i] += num2[i];\n     if (i) num1[i - 1] += num1[i] / (n - i);\n     num1[i] %= (n - i);\n   }\n   buildT(1, 0, n - 1);\n   for (int i = 0; i < n; ++i) {\n     int need = num1[i] + 1;\n     int val = getT(1, 0, n - 1, need);\n     p3[i] = val;\n     updT(1, 0, n - 1, val);\n   }\n   for (int i = 0; i < n; ++i) printf('%d ', p3[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<long long> v;\n long long x, y, z, a, b, c, sum, ans, total, t, cnt, n, m, k, p, kase;\n string s1, s2;\n map<long long, long long> mp;\n set<long long> s;\n map<long long, long long>::iterator itr1, ptr1;\n set<long long>::iterator itr, ptr;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   cin >> t;\n   while (t--) {\n     long long x1, x2, y1, y2;\n     cin >> x1 >> y1 >> x2 >> y2;\n     ans = abs(x1 - x2);\n     ans *= abs(y1 - y2);\n     cout << ans + 1 << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 3e5 + 10;\n long long n, sum, n1, pick, ans, t, a[N], b[N], f[N], f1[N], m, t1;\n int main() {\n   scanf('%lld', &n);\n   for (int i = 1; i <= 8; i++) {\n     scanf('%lld', &a[i]);\n     sum = sum + a[i] * i;\n   }\n   if (sum <= n) return printf('%lld\n', sum), 0;\n   n1 = std::max((long long)0, n - 840), n = n - n1;\n   for (int i = 1; i <= 8; i++) {\n     if (a[i] < n1 / i)\n       pick = a[i];\n     else\n       pick = n1 / i;\n     if (a[i] - pick < 10) pick = std::max((long long)0, a[i] - 10);\n     ans = ans + pick * i, n1 = n1 - pick * i, a[i] = a[i] - pick;\n   }\n   n += n1;\n   for (int i = 1; i <= 8; i++) {\n     t = 1;\n     while (a[i] > 0) {\n       t1 = std::min(t, a[i]);\n       a[i] = a[i] - t1;\n       f[++m] = t1 * i;\n       t <<= 1;\n     }\n   }\n   for (long long i = 1; i <= m; i++)\n     for (long long j = n; j >= f[i]; j--)\n       f1[j] = std::max(f1[j], f1[j - f[i]] + f[i]);\n   printf('%lld\n', ans + f1[n]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string st[5050];\n int fr[27];\n int main() {\n   memset(fr, 0, sizeof(fr));\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n, k;\n   cin >> k >> n;\n   for (int i = 0; i < k; i++) {\n     cin >> st[i];\n   }\n   string res = st[0];\n   memset(fr, 0, sizeof(fr));\n   bool du = false;\n   for (int i = 0; i < n; i++) {\n     fr[res[i] - 'a']++;\n     if (fr[res[i] - 'a'] > 1) {\n       du = true;\n     }\n   }\n   int ma = 0;\n   int mi = 0;\n   bool po = true;\n   for (int i = 1; i < k; i++) {\n     int df = 0;\n     int ct[27] = {0};\n     for (int j = 0; j < n; j++) {\n       ct[st[i][j] - 'a']++;\n       if (st[i][j] != res[j]) {\n         df++;\n       }\n     }\n     if (df > 4) {\n       po = false;\n       break;\n     }\n     for (int j = 0; j < 27; j++) {\n       if (ct[j] != fr[j]) {\n         po = false;\n         break;\n       }\n     }\n     if (df > ma) {\n       ma = df;\n       mi = i;\n     }\n   }\n   if (!po) {\n     cout << -1 << '\n';\n     return 0;\n   }\n   if (ma == 0) {\n     swap(res[0], res[1]);\n     cout << res << '\n';\n     return 0;\n   }\n   if (ma == 2) {\n     if (!du) {\n       cout << -1 << '\n';\n       return 0;\n       cout << -1 << '\n';\n       return 0;\n     }\n     cout << res << '\n';\n     return 0;\n   }\n   int q[4];\n   int ctr = 0;\n   for (int i = 0; i < n; i++) {\n     if (res[i] != st[mi][i]) {\n       q[ctr++] = i;\n     }\n   }\n   po = false;\n   int tr[2] = {0, 0};\n   for (int id = 0; id < 3; id++) {\n     if (ma < 4) {\n       q[3] = q[id];\n     } else if (id > 0)\n       break;\n     for (int i = 0; i < 4; i++) {\n       for (int j = 0; j < 4; j++) {\n         if (po) break;\n         int md = 0;\n         swap(res[q[i]], res[q[j]]);\n         for (int c = 1; c < k; c++) {\n           int df = 0;\n           for (int l = 0; l < n; l++) {\n             if (res[l] != st[c][l]) {\n               df++;\n             }\n           }\n           md = max(md, df);\n         }\n         swap(res[q[i]], res[q[j]]);\n         if (md == 2) {\n           po = true;\n           tr[0] = i;\n           tr[1] = j;\n         }\n       }\n     }\n   }\n   if (po) {\n     swap(res[q[tr[0]]], res[q[tr[1]]]);\n     cout << res << '\n';\n   } else {\n     cout << -1 << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[5];\n int main() {\n   scanf('%d%d%d%d', &a[0], &a[1], &a[2], &a[3]);\n   while (a[0] != 1 || a[1] != 1 || a[2] != 1 || a[3] != 1) {\n     bool f = 1;\n     for (int i = 0; i < 4; i++)\n       if (a[i] % 2 == 0 && a[(i + 1) % 4] % 2 == 0) {\n         printf('/%d\n', i + 1);\n         a[i] >>= 1;\n         a[(i + 1) % 4] >>= 1;\n         f = 0;\n         break;\n       }\n     if (f) {\n       for (int i = 0; i < 4; i++)\n         if (a[i] % 2 == 1 && a[(i + 1) % 4] % 2 == 1 &&\n             !(a[i] == 1 && a[(i + 1) % 4] == 1)) {\n           a[i]++;\n           a[(i + 1) % 4]++;\n           printf('+%d\n', i + 1);\n           f = 0;\n           break;\n         }\n       if (f)\n         for (int i = 0; i < 4; i++)\n           if (a[i] % 2 == 1 && a[(i + 1) % 4] % 2 == 0 &&\n               a[(i + 2) % 4] % 2 == 1) {\n             printf('+%d\n+%d\n', i + 1, (i + 1) % 4 + 1);\n             a[i]++;\n             a[(i + 2) % 4]++;\n             a[(i + 1) % 4] += 2;\n             break;\n           }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string multiply(string num1, string num2) {\n   int len1 = num1.size();\n   int len2 = num2.size();\n   if (len1 == 0 || len2 == 0) return '0';\n   vector<int> result(len1 + len2, 0);\n   int i_n1 = 0;\n   int i_n2 = 0;\n   for (int i = len1 - 1; i >= 0; i--) {\n     int carry = 0;\n     int n1 = num1[i] - '0';\n     i_n2 = 0;\n     for (int j = len2 - 1; j >= 0; j--) {\n       int n2 = num2[j] - '0';\n       int sum = n1 * n2 + result[i_n1 + i_n2] + carry;\n       carry = sum / 10;\n       result[i_n1 + i_n2] = sum % 10;\n       i_n2++;\n     }\n     if (carry > 0) result[i_n1 + i_n2] += carry;\n     i_n1++;\n   }\n   int i = result.size() - 1;\n   while (i >= 0 && result[i] == 0) i--;\n   if (i == -1) return '0';\n   string s = '';\n   while (i >= 0) s += std::to_string(result[i--]);\n   return s;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int T;\n   cin >> T;\n   while (T--) {\n     long int n;\n     cin >> n;\n     n = n / 2;\n     string n1, n2, n3, ans1, ans;\n     int temp;\n     if (n % 3 == 0) {\n       temp = 4 * n / 3;\n       n1 = to_string(temp);\n       n2 = to_string(n + 1);\n       n3 = to_string(2 * n + 1);\n       ans1 = multiply(n1, n2);\n       ans = multiply(ans1, n3);\n     } else if (n % 3 == 2) {\n       temp = 4 * (n + 1) / 3;\n       n1 = to_string(temp);\n       n2 = to_string(n);\n       n3 = to_string(2 * n + 1);\n       ans1 = multiply(n1, n2);\n       ans = multiply(ans1, n3);\n     } else {\n       temp = 4 * (2 * n + 1) / 3;\n       n1 = to_string(temp);\n       n2 = to_string(n + 1);\n       n3 = to_string(n);\n       ans1 = multiply(n1, n2);\n       ans = multiply(ans1, n3);\n     }\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100010;\n int n, x[N], y[N], xs[N], ys[N], cnt[2][2];\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d%d', &x[i], &y[i]);\n     xs[i] = x[i], ys[i] = y[i];\n   }\n   sort(xs + 1, xs + n + 1);\n   sort(ys + 1, ys + n + 1);\n   int m = (n + 1) / 2;\n   int cx = xs[m], cy = ys[m];\n   int dx = xs[m + 1] - xs[m], dy = ys[m + 1] - ys[m];\n   if (n & 1) {\n     dx = min(dx, xs[m] - xs[m - 1]);\n     dy = min(dy, ys[m] - ys[m - 1]);\n   }\n   long long ans = 0;\n   bool flag = 0;\n   for (int i = 1; i <= n; i++) {\n     ans += abs(x[i] - cx) + abs(y[i] - cy);\n     ++cnt[x[i] <= cx][y[i] <= cy];\n     if (x[i] == cx && y[i] == cy) flag = 1;\n   }\n   if (cnt[0][0] && cnt[0][1] && cnt[1][1] && cnt[1][0]) {\n     if (n % 2 == 0 || flag) ans -= min(dx, dy);\n   }\n   printf('%lld\n', ans * 2);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   cout << fixed;\n   double d, L, v1, v2;\n   cin >> d >> L >> v1 >> v2;\n   cout << setprecision(8) << (L - d) / (v1 + v2) << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long scan_d() {\n   char t = getchar();\n   long long you = 0;\n   while (t > '9' || t < '0') t = getchar();\n   while (t <= '9' && t >= '0') {\n     you *= 10;\n     you += t - '0';\n     t = getchar();\n   }\n   return you;\n }\n long long dp[1050][1050];\n long long op[1001];\n int main() {\n   for (int i = 0; i <= 1010; i++) dp[1][i] = 1;\n   for (int i = 2; i <= 1010; i++)\n     for (int o = i - 1; o <= 1010; o++) {\n       dp[i][o] = dp[i - 1][o - 1] + dp[i][o - 1];\n       dp[i][o] %= 1000000007;\n     }\n   long long y;\n   y = scan_d();\n   long long sum = 0;\n   for (int i = 1; i <= y; i++) {\n     op[i] = scan_d();\n   }\n   long long ans = 1;\n   for (int i = 1; i <= y; i++) {\n     sum += op[i];\n     ans *= dp[op[i]][sum - 1];\n     ans %= 1000000007;\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n void read(T &x) {\n   int f = 0;\n   x = 0;\n   char ch = getchar();\n   for (; !isdigit(ch); ch = getchar()) f |= (ch == '-');\n   for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';\n   if (f) x = -x;\n }\n const int N = 20, mod = 998244353;\n int f[N][N][N][N][2][2];\n int g[N][N][N][N][2][2];\n int x[N], y[N], n, m;\n void add(int &x, int y) { x = (x + y >= mod ? x + y - mod : x + y); }\n int main() {\n   read(n), read(m);\n   for (int i = (1); i <= (n); i++) read(x[i]), read(y[i]);\n   f[0][0][0][0][0][0] = 1;\n   for (; m; m >>= 1) {\n     memset(g, 0, sizeof g);\n     for (int px = 0; px < (N); px++)\n       for (int nx = 0; nx < (N); nx++)\n         for (int py = 0; py < (N); py++)\n           for (int ny = 0; ny < (N); ny++)\n             for (int fx = 0; fx < (2); fx++)\n               for (int fy = 0; fy < (2); fy++) {\n                 int t = f[px][nx][py][ny][fx][fy];\n                 if (!t) continue;\n                 for (int s = 0; s < (1 << n); s++) {\n                   int Px = px, Nx = nx, Py = py, Ny = ny;\n                   for (int i = (1); i <= (n); i++)\n                     if (s >> (i - 1) & 1) {\n                       Px += max(x[i], 0);\n                       Nx -= min(x[i], 0);\n                       Py += max(y[i], 0);\n                       Ny -= min(y[i], 0);\n                     }\n                   if ((Px & 1) != (Nx & 1) || (Py & 1) != (Ny & 1)) continue;\n                   int gx =\n                       ((Px & 1) < (m & 1) ? 0 : ((Px & 1) > (m & 1) ? 1 : fx));\n                   int gy =\n                       ((Py & 1) < (m & 1) ? 0 : ((Py & 1) > (m & 1) ? 1 : fy));\n                   Px >>= 1, Nx >>= 1, Py >>= 1, Ny >>= 1;\n                   add(g[Px][Nx][Py][Ny][gx][gy], t);\n                 }\n               }\n     swap(f, g);\n   }\n   cout << ((f[0][0][0][0][0][0] + mod - 1) % mod) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1e18;\n const long long mod = 1e9 + 7;\n const long long N = 1e5 + 10;\n inline long long add(long long x, long long y) {\n   x += y;\n   if (x >= mod) x -= mod;\n   return x;\n }\n inline long long mul(long long x, long long y) {\n   x = (1LL * x * y) % mod;\n   return x;\n }\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   long long n;\n   cin >> n;\n   n--;\n   cout << '0 0' << endl;\n   fflush(stdout);\n   if (n == 0) {\n     cout << '1 0 1 1';\n     fflush(stdout);\n     return 0;\n   }\n   string prev;\n   cin >> prev;\n   long long l = 0;\n   long long r = 1e9;\n   long long i = 1;\n   while (i <= n) {\n     long long m = (l + r) / 2;\n     cout << m << ' '\n          << '0' << endl;\n     fflush(stdout);\n     string s;\n     cin >> s;\n     if (s == prev) {\n       l = m;\n     } else {\n       r = m;\n     }\n     i++;\n   }\n   if (r - l < 2) {\n     cout << r << ' 1 ' << (r + 1) << ' ' << (2 * (r + 1) - 2 * l - 1);\n     fflush(stdout);\n     return 0;\n   }\n   long long m = (l + r) / 2;\n   cout << m << ' 0 ' << m << ' 1';\n   fflush(stdout);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> c;\n vector<bool> used;\n void dfs(int u, vector<vector<int>>& v) {\n   used[u] = 1;\n   for (int i = 0; i < v[u].size(); i++) {\n     if (c[u] == c[v[u][i]] && !used[v[u][i]]) {\n       dfs(v[u][i], v);\n     }\n   }\n }\n int main() {\n   int n;\n   cin >> n;\n   vector<vector<int>> v(n);\n   c.resize(n);\n   used.resize(n, 0);\n   vector<int> cnt(110000);\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   for (int i = 0; i < n; i++) {\n     cin >> c[i];\n   }\n   for (int i = 0; i < n; i++) {\n     if (!used[i]) {\n       cnt[c[i]]++;\n       dfs(i, v);\n     }\n   }\n   multiset<int> data;\n   for (int i = 0; i < 100010; i++) {\n     for (int j = 0; j < cnt[i]; j++) {\n       data.insert(i);\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     bool check = 0;\n     multiset<int> tmp;\n     for (int j = 0; j < v[i].size(); j++) {\n       if (c[v[i][j]] == c[i]) {\n         check = 1;\n       }\n       tmp.insert(c[v[i][j]]);\n     }\n     if (!check) {\n       tmp.insert(c[i]);\n     }\n     if (tmp == data) {\n       cout << 'YES' << endl;\n       cout << i + 1 << endl;\n       return 0;\n     }\n   }\n   cout << 'NO' << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n long long n, x, c, cnt;\n vector<long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<Aho *> 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<string> &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<string> 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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 0x3f3f3f3f;\n const int MOD = 1e9 + 7;\n const int base = 101;\n inline void chmax(int& x, int y) {\n   if (x < y) x = y;\n }\n inline void chmin(int& x, int y) {\n   if (x > y) x = y;\n }\n inline int LSB(int i) { return (i & -i); }\n int n, m, dp[10005];\n char s[10005], str[10005];\n map<long long, string> mp;\n vector<string> v;\n inline long long Hash(int a, int b) { return (1LL * a * base + b) % MOD; }\n int main() {\n   scanf('%d%s%d', &n, &s, &m);\n   for (int i = 0; i < m; i++) {\n     scanf('%s', &str);\n     long long h = 1;\n     for (int j = 0; j < strlen(str); j++) {\n       h = Hash(h, tolower(str[j]));\n     }\n     mp[h] = str;\n   }\n   fill(dp, dp + n, -1);\n   dp[0] = 0;\n   for (int i = 0; i < n; i++) {\n     long long h = 1;\n     for (int j = i; j >= 0; j--) {\n       h = Hash(h, s[j]);\n       if (dp[j] != -1 && mp.find(h) != mp.end()) {\n         dp[i + 1] = h;\n         break;\n       }\n     }\n   }\n   int p = n;\n   while (p > 0) {\n     v.push_back(mp[dp[p]]);\n     p -= mp[dp[p]].length();\n   }\n   reverse(v.begin(), v.end());\n   for (string& i : v) printf('%s ', &i[0]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long p = 1e9 + 7;\n int mk[705][705][3][3];\n char s[705];\n long long ck(int l, int r, int lc, int rc) {\n   if (l > r) return !lc || !rc || lc != rc;\n   if (mk[l][r][lc][rc]) return mk[l][r][lc][rc];\n   for (int i = l, cnt = 0;; i++) {\n     if (s[i] == ')')\n       cnt++;\n     else\n       cnt--;\n     if (!cnt) {\n       long long m = ck(l + 1, i - 1, 0, 1) * ck(i + 1, r, 1, rc) % p +\n                     ck(l + 1, i - 1, 0, 2) * ck(i + 1, r, 2, rc);\n       if (lc != 1) m += ck(l + 1, i - 1, 1, 0) * ck(i + 1, r, 0, rc);\n       if (lc != 2) m += ck(l + 1, i - 1, 2, 0) * ck(i + 1, r, 0, rc);\n       return mk[l][r][lc][rc] = m % p;\n     }\n   }\n }\n int main() {\n   scanf('%s', s + 1);\n   printf('%lld', ck(1, strlen(s + 1), 0, 0));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC target('avx,avx2,fma')\n using namespace std;\n using ll = long long;\n using ull = unsigned long long;\n template <typename T>\n void print(vector<T> v) {\n   for (T i : v) cout << i << ' ';\n   cout << '\n';\n }\n template <typename T>\n void print(vector<vector<T>>& v) {\n   for (vector<T>& vv : v) {\n     for (T& i : vv) cout << i << ' ';\n     cout << '\n';\n   }\n }\n template <typename T>\n void print(T&& t) {\n   cout << t << '\n';\n }\n template <typename T, typename... Args>\n void print(T&& t, Args&&... args) {\n   cout << t << ' ';\n   print(forward<Args>(args)...);\n }\n template <typename T>\n istream& operator>>(istream& is, vector<T>& v) {\n   for (auto& i : v) is >> i;\n   return is;\n }\n template <typename T>\n ostream& operator<<(ostream& os, vector<T>& v) {\n   for (auto& i : v) os << i << ' ';\n   return os;\n }\n void __print(int x) { cerr << x; }\n void __print(long x) { cerr << x; }\n void __print(long long x) { cerr << x; }\n void __print(unsigned x) { cerr << x; }\n void __print(unsigned long x) { cerr << x; }\n void __print(unsigned long long x) { cerr << x; }\n void __print(float x) { cerr << x; }\n void __print(double x) { cerr << x; }\n void __print(long double x) { cerr << x; }\n void __print(char x) { cerr << '\'' << x << '\''; }\n void __print(const char* x) { cerr << '\'' << x << '\''; }\n void __print(const string& x) { cerr << '\'' << x << '\''; }\n void __print(bool x) { cerr << (x ? 'true' : 'false'); }\n template <typename T, typename V>\n void __print(const pair<T, V>& x) {\n   cerr << '{';\n   __print(x.first);\n   cerr << ',';\n   __print(x.second);\n   cerr << '}';\n }\n template <typename T>\n void __print(const T& x) {\n   int f = 0;\n   cerr << '{';\n   for (auto& i : x) cerr << (f++ ? ',' : ''), __print(i);\n   cerr << '}';\n }\n void _print() { cerr << ']\n'; }\n template <typename T, typename... V>\n void _print(T t, V... v) {\n   __print(t);\n   if (sizeof...(v)) cerr << ', ';\n   _print(v...);\n }\n void loop() {\n   ll n;\n   cin >> n;\n   vector<ll> a(n);\n   cin >> a;\n   if (n == 1) {\n     print('Alice');\n     return;\n   }\n   vector<ll> inc, dec;\n   inc.push_back(a[0]);\n   for (ll i = 0; i < n - 1; i++) {\n     if (a[i] < a[i + 1]) {\n       inc.push_back(a[i + 1]);\n     } else\n       break;\n   }\n   dec.push_back(a[n - 1]);\n   for (ll i = n - 1; i > 0; i--) {\n     if (a[i] < a[i - 1]) {\n       dec.push_back(a[i - 1]);\n     } else\n       break;\n   }\n   if (dec.size() % 2) {\n     print('Alice');\n     return;\n   } else if ((inc.size() - 1 + dec.size()) % 2 == 0) {\n     print('Alice');\n     return;\n   }\n   print('Bob');\n }\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ll t;\n   t = 1;\n   while (t--) {\n     loop();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 10;\n const int INF = 0x3f3f3f3f;\n int n, m, a[maxn], b[maxn], f[maxn], g[maxn], l[maxn], p[maxn], ans[maxn];\n bool vis[maxn];\n int main() {\n   scanf('%d', &n);\n   for (int i = (1), _end_ = (n); i <= _end_; ++i) scanf('%d', &a[i]);\n   a[++n] = INF;\n   scanf('%d', &m);\n   for (int i = (1), _end_ = (m); i <= _end_; ++i) scanf('%d', &b[i]);\n   sort(b + 1, b + m + 1);\n   for (int i = (1), _end_ = (n + 1); i <= _end_; ++i) f[i] = INF;\n   for (int i = (1), _end_ = (n); i <= _end_; ++i)\n     if (a[i] != -1) {\n       int L = 1, R = n, pos = 0;\n       while (L <= R) {\n         int Mid = L + R >> 1;\n         if (f[Mid] < a[i]) {\n           pos = Mid;\n           L = Mid + 1;\n         } else\n           R = Mid - 1;\n       }\n       f[pos + 1] = a[i];\n       g[pos + 1] = i;\n       l[i] = pos + 1;\n       p[i] = g[pos];\n     } else {\n       int pos = n;\n       for (int j = m; j >= 1; --j) {\n         while (f[pos] >= b[j]) --pos;\n         f[pos + 1] = b[j];\n         g[pos + 1] = i;\n       }\n     }\n   for (int len = l[n], pos = n, val = a[n]; len >= 1; --len)\n     if (a[pos] != -1) {\n       if (a[p[pos]] != -1) {\n         pos = p[pos];\n         val = a[pos];\n       } else {\n         int t = lower_bound(b + 1, b + m + 1, val) - b - 1;\n         vis[t] = true;\n         pos = p[pos];\n         val = ans[pos] = b[t];\n       }\n     } else {\n       for (int i = pos - 1; i >= 1; --i)\n         if (a[i] != -1 && l[i] == len - 1 && a[i] < val) {\n           pos = i;\n           val = a[i];\n           goto Next;\n         }\n       for (int i = pos - 1; i >= 1; --i)\n         if (a[i] == -1) {\n           int t = lower_bound(b + 1, b + m + 1, val) - b - 1;\n           vis[t] = true;\n           pos = i;\n           val = ans[pos] = b[t];\n           goto Next;\n         }\n     Next:;\n     }\n   int pos = 1;\n   for (int i = (1), _end_ = (n - 1); i <= _end_; ++i)\n     if (a[i] != -1)\n       ans[i] = a[i];\n     else if (!ans[i]) {\n       while (vis[pos]) ++pos;\n       ans[i] = b[pos];\n       ++pos;\n     }\n   for (int i = (1), _end_ = (n - 1); i <= _end_; ++i) printf('%d ', ans[i]);\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int getChar(char c) {\n   if (c == '+') return 1;\n   return 0;\n }\n string s;\n stack<int> mystack;\n int main() {\n   cin >> s;\n   int n = s.size();\n   int temp;\n   for (int i = 0; i < n; i++) {\n     temp = getChar(s[i]);\n     if (mystack.empty())\n       mystack.push(temp);\n     else {\n       if (mystack.top() == temp)\n         mystack.pop();\n       else\n         mystack.push(temp);\n     }\n   }\n   if (mystack.empty()) {\n     cout << 'Yes' << endl;\n     return 0;\n   }\n   cout << 'No' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 2000000000;\n const double eps = 1e-9, Pi = 2 * acos(0);\n int main() {\n   ifstream fin('input.txt');\n   ofstream fout('output.txt');\n   string s;\n   cin >> s;\n   map<string, int> make_pair;\n   for (int i = 0; i <= 9; i++) {\n     string x;\n     cin >> x;\n     make_pair[x] = i;\n   }\n   for (int i = 0; i < 8; i++) {\n     string x = '';\n     for (int j = i * 10; j < (i + 1) * 10; j++) x += s[j];\n     cout << make_pair[x];\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int N, memo[1 << 25];\n pair<int, int> arr[30];\n int dist(int a, int n) {\n   int k1 = arr[n].first - arr[a].first;\n   int k2 = arr[n].second - arr[a].second;\n   return k1 * k1 + k2 * k2;\n }\n int dp(int mask) {\n   if (__builtin_popcount(mask) == N) {\n     return 0;\n   }\n   if (memo[mask] != 0) return memo[mask];\n   int res = 1e9;\n   for (int i = 1; i <= N; i++) {\n     if (!((mask >> (i - 1) & 1))) {\n       res = min(res, dp(mask | (1 << (i - 1))) + 2 * dist(i, 0));\n       for (int j = i + 1; j <= N; j++) {\n         if (!(mask >> (j - 1) & 1) and i != j) {\n           res = min(res, dp(mask | (1 << (i - 1)) | (1 << (j - 1))) +\n                              dist(i, 0) + dist(i, j) + dist(j, 0));\n         }\n       }\n       break;\n     }\n   }\n   memo[mask] = res;\n   return res;\n }\n void backtrack(int mask) {\n   if (__builtin_popcount(mask) == N) {\n     return;\n   }\n   for (int i = 1; i <= N; i++) {\n     if (!((mask >> (i - 1) & 1))) {\n       if (dp(mask | (1 << (i - 1))) + 2 * dist(i, 0) == dp(mask)) {\n         cout << 0 << ' ' << i << ' ';\n         backtrack(mask | (1 << (i - 1)));\n         return;\n       }\n       for (int j = i + 1; j <= N; j++) {\n         if (!(mask >> (j - 1) & 1) and i != j) {\n           if (dp(mask | (1 << (i - 1)) | (1 << (j - 1))) + dist(i, 0) +\n                   dist(i, j) + dist(j, 0) ==\n               dp(mask)) {\n             cout << 0 << ' ' << i << ' ' << j << ' ';\n             backtrack(mask | (1 << (i - 1)) | (1 << (j - 1)));\n             return;\n           }\n         }\n       }\n       break;\n     }\n   }\n   return;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0), cout.tie(0);\n   cin >> arr[0].first >> arr[0].second;\n   cin >> N;\n   for (int i = 1; i <= N; i++) cin >> arr[i].first >> arr[i].second;\n   cout << dp(0) << endl;\n   backtrack(0);\n   cout << 0 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char a[51][51];\n int main() {\n   memset(a, '0', sizeof(a));\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= n; j++) cin >> a[i][j];\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= n; j++) {\n       int x = a[i][j] - '0';\n       if (x != 0) {\n         if (a[i - 1][j - 1] != '0') x--;\n         if (a[i - 1][j + 1] != '0') x--;\n         if (a[i + 1][j - 1] != '0') x--;\n         if (a[i + 1][j + 1] != '0') x--;\n         if (x != 0) return cout << 'No', 0;\n       }\n     }\n   cout << 'Yes';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char str[2][400000 + 10];\n int n;\n void sortstr(int t, int l, int r) {\n   if ((r - l + 1) & 1) return;\n   int md = (l + r) / 2;\n   sortstr(t, l, (l + r) / 2), sortstr(t, (l + r) / 2 + 1, r);\n   bool needswap = false;\n   for (int i = l, j = md + 1; i <= md; i++, j++) {\n     if (str[t][i] < str[t][j]) break;\n     if (str[t][i] > str[t][j]) {\n       needswap = true;\n       break;\n     }\n   }\n   if (needswap) {\n     for (int i = l, j = md + 1; i <= md; i++, j++) swap(str[t][i], str[t][j]);\n   }\n }\n int main() {\n   for (int i = 0; i < 2; i++)\n     scanf('%s', str[i]), n = strlen(str[i]), sortstr(i, 0, n - 1);\n   bool equ = true;\n   for (int i = 0; i < n; i++)\n     if (str[0][i] != str[1][i]) equ = false;\n   printf('%s\n', equ ? 'YES' : 'NO');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, gxx;\n pair<int, int> a[411111];\n int p[411111];\n int Gxx[411111], bb[411111];\n int degree[411111];\n int h, t;\n void make_ans(int x, int y, int tot) {\n   int now_x = degree[x] - 1 - tot;\n   int need_x = max(h - now_x, 0);\n   int now_y = degree[y] - 1 - tot;\n   int need_y = max(t - now_y, 0);\n   for (int i = p[x]; i < p[x + 1]; i++) Gxx[a[i].second] = 1;\n   for (int i = p[y]; i < p[y + 1]; i++)\n     if (Gxx[a[i].second] == 1) bb[a[i].second] = 1;\n   printf('YES\n');\n   printf('%d %d\n', x, y);\n   bool bo = false;\n   for (int i = p[x]; i < p[x + 1]; i++)\n     if ((bb[a[i].second] == 0 || need_x) && a[i].second != y && h) {\n       h--;\n       if (bb[a[i].second]) {\n         bb[a[i].second] = -1;\n         need_x--;\n       }\n       if (bo) printf(' ');\n       bo = true;\n       printf('%d', a[i].second);\n     }\n   printf('\n');\n   bo = false;\n   for (int i = p[y]; i < p[y + 1]; i++)\n     if ((bb[a[i].second] == 0 || need_y) && a[i].second != x && t &&\n         bb[a[i].second] != -1) {\n       t--;\n       if (bb[a[i].second]) need_y--;\n       if (bo) printf(' ');\n       bo = true;\n       printf('%d', a[i].second);\n     }\n   printf('\n');\n }\n int find(int x, int y) {\n   int ans = 0;\n   for (int i = p[x]; i < p[x + 1]; i++)\n     if (a[i].second != y) {\n       int t =\n           lower_bound(a + p[y], a + p[y + 1], make_pair(y, a[i].second)) - a;\n       if (a[t].second == a[i].second) ans++;\n     }\n   return ans;\n }\n int main() {\n   scanf('%d%d%d%d', &n, &m, &h, &t);\n   for (int i = 1; i <= m; i++) {\n     scanf('%d%d', &a[i].first, &a[i].second);\n     degree[a[i].first]++;\n     degree[a[i].second]++;\n     a[i + m].second = a[i].first;\n     a[i + m].first = a[i].second;\n   }\n   int M = m * 2;\n   sort(a + 1, a + M + 1);\n   a[0].first = 0;\n   a[M + 1].first = n + 1;\n   int now = 0;\n   for (int i = 1; i <= M + 1; i++)\n     while (now != a[i].first) {\n       now++;\n       p[now] = i;\n     }\n   p[0] = 0;\n   for (int i = 1; i <= M; i++)\n     if (degree[a[i].first] > h && degree[a[i].second] > t) {\n       int t1 = a[i].first;\n       int t2 = a[i].second;\n       int tot = 0;\n       if (t1 < t2)\n         tot = find(t1, t2);\n       else\n         tot = find(t2, t1);\n       if (degree[t1] + degree[t2] - 2 - tot >= h + t) {\n         make_ans(t1, t2, tot);\n         return 0;\n       }\n     }\n   printf('NO\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k;\n int v[100000 + 1];\n int mx, rez;\n pair<int, int> rz[100000 + 1];\n int stkLen;\n int stkLen2;\n int stk[100000 + 1];\n int stk2[100000 + 1];\n int s, s2;\n void readFile() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie();\n   cin >> n >> k;\n   for (int i = 1; i <= n; i++) cin >> v[i];\n }\n int cautBin(int nr, int stk[], int stkLen) {\n   int i = 0;\n   int pas = 1 << 16;\n   while (pas != 0) {\n     if (i + pas <= stkLen && abs(v[stk[i + pas]] - nr) > k) i += pas;\n     pas >>= 1;\n   }\n   return stk[i] + 1;\n }\n bool verif(int st, int dr) {\n   while (s < stkLen && stk[s] < st) s++;\n   while (s2 < stkLen2 && stk2[s2] < st) s2++;\n   return (abs(v[stk[s]] - v[stk2[s2]]) <= k);\n }\n void solve() {\n   stkLen = 0;\n   int st = 1;\n   s = s2 = 1;\n   for (int i = 1; i <= n; i++) {\n     while (stkLen >= s && v[i] >= v[stk[stkLen]]) stkLen--;\n     stk[++stkLen] = i;\n     while (stkLen2 >= s2 && v[i] <= v[stk2[stkLen2]]) stkLen2--;\n     stk2[++stkLen2] = i;\n     while (st < i && verif(st, i) == 0) st++;\n     int len = i - st + 1;\n     if (len > mx) {\n       mx = len;\n       rez = 0;\n     }\n     if (len == mx) rz[++rez] = {st, i};\n   }\n }\n void printFile() {\n   cout << mx << ' ' << rez << '\n';\n   for (int i = 1; i <= rez; i++)\n     cout << rz[i].first << ' ' << rz[i].second << '\n';\n }\n int main() {\n   readFile();\n   solve();\n   printFile();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long ar[200010];\n void solve() {\n   long long a, b, c = 0, i, j, t, k, lie, m, n, o, x, y, z;\n   long long p = 0, sm = 0, cnt = 0;\n   scanf('%lld', &n);\n   string s;\n   cin >> s;\n   if (n == 1) {\n     printf('Yes\n');\n     return;\n   }\n   for (i = 0; i < n; i++) ar[s[i] - 'a']++;\n   for (i = 0; i < 26; i++) {\n     if (ar[i] > 1) {\n       printf('Yes\n');\n       return;\n     }\n   }\n   printf('No\n');\n }\n int main() {\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double eps = 1e-8;\n const int mod = 1e9 + 7;\n const int N = 1e6 + 10;\n const int inf = 1e9;\n int t, n, k;\n char s[N];\n int cnt[N];\n int a[N], b[N];\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> t;\n   while (t--) {\n     cin >> n >> k;\n     cin >> s + 1;\n     for (int i = 1; i <= n; i++) {\n       cnt[i] = cnt[i - 1];\n       if (s[i] == '1') cnt[i]++;\n     }\n     int ans = inf;\n     for (int i = 1; i <= k; i++) {\n       int ret = 0, mn = inf, tp = inf, l = 0;\n       vector<int> q;\n       q.push_back(0);\n       for (int j = i; j <= n; j += k) {\n         int tmp = cnt[j - 1] - cnt[l];\n         ret += tmp;\n         q.push_back(cnt[j] - cnt[j - 1]);\n         l = j;\n       }\n       ret += cnt[n] - cnt[l];\n       int sz = q.size() - 1;\n       for (int i = 1; i <= sz; i++) {\n         a[i] = a[i - 1];\n         b[i] = b[i - 1];\n         if (q[i] == 1)\n           a[i]++;\n         else\n           b[i]++;\n       }\n       tp = a[sz];\n       for (int i = sz; i >= 1; i--) {\n         mn = min(mn, b[i] - a[i] + a[sz]);\n         tp = min(tp, a[i - 1] - b[i - 1] + mn);\n       }\n       ans = min(ans, ret + tp);\n     }\n     cout << ans << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using std::string;\n using std::vector;\n namespace Template {\n struct IN {\n   template <class T>\n   void fr(T& a) {\n     T s = 0;\n     int w = 1;\n     char ch = getchar();\n     while (ch < '0' || ch > '9') {\n       if (ch == '-') w = -1;\n       ch = getchar();\n     }\n     while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();\n     a = w * s;\n   }\n   template <class T>\n   T fr() {\n     T a;\n     fr(a);\n     return a;\n   }\n   IN& operator>>(long long& x) { return fr(x), *this; }\n   IN& operator>>(signed& x) { return fr(x), *this; }\n   IN& operator>>(unsigned& x) { return fr(x), *this; }\n   IN& operator>>(char& c) {\n     while (isspace(c = getchar()))\n       ;\n     return *this;\n   }\n   IN& operator>>(string& str) {\n     char ch;\n     while (isspace(ch = getchar()))\n       ;\n     str = ch;\n     while (!isspace(ch = getchar())) str += ch;\n     return *this;\n   }\n } cin;\n struct OUT {\n   char D[1 << 27], *A = D - 1;\n   ~OUT() { fwrite(D, 1, A - D + 1, stdout); }\n   template <class T>\n   void fw(T x) {\n     static char C[20];\n     static int f;\n     x < 0 ? * ++A = '-', x = -x : 0;\n     while (C[++f] = 48 + x % 10, x /= 10)\n       ;\n     while (*++A = C[f], --f)\n       ;\n   }\n   OUT& operator<<(char c) { return *++A = c, *this; }\n   OUT& operator<<(string str) {\n     int len = str.length();\n     for (int i = 0; i < len; i++) *++A = str[i];\n     return *this;\n   }\n   OUT& operator<<(long long x) { return fw(x), *this; }\n   OUT& operator<<(signed x) { return fw(x), *this; }\n   OUT& operator<<(unsigned x) { return fw(x), *this; }\n } cout;\n char endl = '\n';\n int DEBUG = 0;\n template <class T>\n T sqr(T a) {\n   return a * a;\n }\n template <class T>\n T abs(T a) {\n   return a < 0 ? -a : a;\n }\n template <class T>\n T cmin(T a, T b) {\n   return a < b ? a : b;\n }\n template <class T>\n T cmax(T a, T b) {\n   return a > b ? a : b;\n }\n template <class T>\n void cswp(T& a, T& b) {\n   T t = a;\n   a = b;\n   b = t;\n }\n }  // namespace Template\n using namespace Template;\n const int N = 1e5;\n int n, blo, tot = 0, fa[N + 10], len[N + 10], arr[N + 10];\n vector<int> E[N + 10];\n void adde(int u, int v) { E[u].push_back(v); }\n void dfs(int u, int f) {\n   fa[u] = f, arr[++tot] = u;\n   for (int v : E[u])\n     if (v != f) dfs(v, u);\n }\n int calc(int k) {\n   int ret = 0;\n   for (int i = 1; i <= n; i++) len[i] = 1;\n   for (int i = n; i > 1; i--) {\n     int u = arr[i], f = fa[u];\n     if (len[f] != -1 && len[u] != -1) {\n       if (len[f] + len[u] >= k)\n         ret++, len[f] = -1;\n       else\n         len[f] = cmax(len[f], len[u] + 1);\n     }\n   }\n   return ret;\n }\n int main() {\n   cin >> n;\n   blo = sqrt(n * log2(n));\n   for (int i = 1; i < n; ++i) {\n     int u, v;\n     cin >> u >> v;\n     adde(u, v), adde(v, u);\n   }\n   dfs(1, 0), cout << n << endl;\n   for (int i = 2; i <= blo; i++) cout << calc(i) << endl;\n   for (int i = blo + 1; i <= n;) {\n     int f = calc(i), l = i, r = n, pos = 0;\n     while (l <= r) {\n       int mid = (l + r) >> 1;\n       if (calc(mid) == f)\n         l = mid + 1, pos = mid;\n       else\n         r = mid - 1;\n     }\n     for (; i <= pos; i++) cout << f << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n template <typename T>\n void MACRO_VAR_Scan(T& t) {\n   std::cin >> t;\n }\n template <typename First, typename... Rest>\n void MACRO_VAR_Scan(First& first, Rest&... rest) {\n   std::cin >> first;\n   MACRO_VAR_Scan(rest...);\n }\n template <typename T>\n void MACRO_VEC_ROW_Init(int n, T& t) {\n   t.resize(n);\n }\n template <typename First, typename... Rest>\n void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {\n   first.resize(n);\n   MACRO_VEC_ROW_Init(n, rest...);\n }\n template <typename T>\n void MACRO_VEC_ROW_Scan(int p, T& t) {\n   std::cin >> t[p];\n }\n template <typename First, typename... Rest>\n void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {\n   std::cin >> first[p];\n   MACRO_VEC_ROW_Scan(p, rest...);\n }\n template <class T>\n inline T CHMAX(T& a, const T b) {\n   return a = (a < b) ? b : a;\n }\n template <class T>\n inline T CHMIN(T& a, const T b) {\n   return a = (a > b) ? b : a;\n }\n template <class T>\n using V = std::vector<T>;\n template <class T>\n using VV = V<V<T>>;\n template <typename S, typename T>\n std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {\n   os << '(' << p.first << ', ' << p.second << ')';\n   return os;\n }\n using ll = long long;\n using ull = unsigned long long;\n using ld = long double;\n using PAIR = std::pair<ll, ll>;\n using PAIRLL = std::pair<ll, ll>;\n constexpr ll INFINT = 1 << 30;\n constexpr ll INFINT_LIM = (1LL << 31) - 1;\n constexpr ll INFLL = 1LL << 60;\n constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);\n constexpr double EPS = 1e-6;\n constexpr ll MOD = 1000000007;\n constexpr double PI = 3.141592653589793238462643383279;\n template <class T, size_t N>\n void FILL(T (&a)[N], const T& val) {\n   for (auto& x : a) x = val;\n }\n template <class ARY, size_t N, size_t M, class T>\n void FILL(ARY (&a)[N][M], const T& val) {\n   for (auto& b : a) FILL(b, val);\n }\n template <class T>\n void FILL(std::vector<T>& a, const T& val) {\n   for (auto& x : a) x = val;\n }\n template <class ARY, class T>\n void FILL(std::vector<std::vector<ARY>>& a, const T& val) {\n   for (auto& b : a) FILL(b, val);\n }\n struct Trie {\n   std::vector<std::vector<ll>> g;\n   ll p;\n   Trie() : p(0) {\n     g.emplace_back(std::vector<ll>(2, -1));\n     ++p;\n   }\n   void add(const std::string& s) {\n     size_t par = 0;\n     for (size_t i = 0; i < s.size(); ++i) {\n       ll t = s[i] - '0';\n       if (g[par][t] == -1) {\n         g.emplace_back(std::vector<ll>(2, -1));\n         g[par][t] = p++;\n       }\n       par = g[par][t];\n     }\n   }\n   ll next(size_t par, char c) {\n     ll t = c - '0';\n     return g[par][t];\n   }\n };\n bool ng(std::string s) {\n   return s == '1100' || s == '1010' || s == '0111' || s == '1111';\n }\n signed main() {\n   std::ios::sync_with_stdio(false);\n   std::cin.tie(0);\n   ;\n   ll n;\n   MACRO_VAR_Scan(n);\n   ;\n   std::string s;\n   for (ll i = 0; i < ll(n); ++i) {\n     char c;\n     MACRO_VAR_Scan(c);\n     ;\n     s += c;\n   }\n   Trie tr;\n   std::vector<ll> c(n, 0);\n   for (ll i = 0; i < ll(n); ++i) {\n     auto S = s.substr(0, i + 1);\n     std::reverse((S).begin(), (S).end());\n     std::vector<ll> dp(S.size() + 1, 0);\n     dp[0] = 1;\n     for (ll j = 0; j < ll(S.size()); ++j) {\n       for (ll k = 0; k < ll(4); ++k) {\n         if (j < k) break;\n         if (k == 3) {\n           if (ng(S.substr(j - 3, 4))) continue;\n         }\n         (dp[j + 1] += dp[j - k]) %= MOD;\n       }\n     }\n     ll p = 0;\n     ll len = 0;\n     for (ll j = 0; j < ll(S.size()); ++j) {\n       ll ne = tr.next(p, S[j]);\n       if (ne == -1) break;\n       p = ne;\n       dp[++len] = 0;\n     }\n     tr.add(S);\n     for (ll j = (1); j < (S.size() + 1); ++j) {\n       (c[i] += dp[j]) %= MOD;\n     }\n   }\n   for (ll i = 0; i < ll(n - 1); ++i) (c[i + 1] += c[i]) %= MOD;\n   for (ll i = 0; i < ll(n); ++i) {\n     std::cout << (c[i]);\n     std::cout << '\n';\n     ;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename A, typename B, typename C>\n struct triple {\n   A X;\n   B Y;\n   C Z;\n   triple(A a = 0, B b = 0, C c = 0) : X(a), Y(b), Z(c) {}\n };\n template <typename A, typename B, typename C>\n triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {\n   return triple<A, B, C>(a, b, c);\n }\n template <typename A, typename B, typename C>\n bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {\n   if (a.X != b.X) return a.X < b.X;\n   if (a.Y != b.Y) return a.Y < b.Y;\n   return a.Z < b.Z;\n }\n template <typename T, typename SS>\n ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {\n   ofs << '( ' << p.first << ' , ' << p.second << ' )';\n   return ofs;\n }\n template <typename T>\n void print(T a) {\n   for (auto i : a) cout << i << ' ';\n   cout << '\n';\n }\n template <typename T>\n T max(T a, T b, T c) {\n   return max(a, max(b, c));\n }\n template <typename T>\n T min(T a, T b, T c) {\n   return min(a, min(b, c));\n }\n template <typename T, typename D>\n D min(T a) {\n   return *min_element(a.begin(), a.end());\n }\n template <typename T, typename D>\n D max(T a) {\n   return *max_element(a.begin(), a.end());\n }\n struct custom_hash {\n   static uint64_t splitmix64(uint64_t x) {\n     x += 0x9e3779b97f4a7c15;\n     x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n     x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n     return x ^ (x >> 31);\n   }\n   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 void solve() {\n   string s;\n   cin >> s;\n   if ((long long)(s.size()) & 1) s = '0' + s;\n   long long n = (long long)(s.size());\n   for (long long i = 0; i < (n); i++) s[i] -= '0';\n   reverse(s.begin(), s.end());\n   vector<vector<long long> > dp(n / 2 + 1, vector<long long>(4));\n   dp[0][0] = 1;\n   for (long long i = 0; i < (n / 2); i++)\n     for (long long j = 0; j < (4); j++) {\n       long long x = 2 * i, y = x + 1;\n       long long dx = j & 1, dy = j >> 1;\n       for (long long d11 = 0; d11 < (10); d11++)\n         for (long long d12 = 0; d12 < (10); d12++) {\n           long long sx = d11 + d12 + dx;\n           if (sx % 10 != s[x]) continue;\n           long long nmask = (sx >= 10);\n           for (long long d21 = 0; d21 < (10); d21++)\n             for (long long d22 = 0; d22 < (10); d22++) {\n               long long sy = d21 + d22 + dy;\n               if (sy % 10 != s[y]) continue;\n               if (sy >= 10) nmask |= 2;\n               dp[i + 1][nmask] += dp[i][j];\n             }\n         }\n     }\n   cout << dp[n / 2][0] - 2 << '\n';\n };\n signed main() {\n   if (0) {\n     freopen(\n         'a'\n         '.in',\n         'r', stdin);\n     freopen(\n         'a'\n         '.out',\n         'w', stdout);\n   }\n   srand(time(NULL));\n   cin.tie(0);\n   cout.tie(0);\n   ios_base::sync_with_stdio(false);\n   long long t = 1;\n   cin >> t;\n   for (long long _ = 0; _ < (t); _++) solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 1000000000 + 7;\n const int N = 1000006;\n int n, a[305], ar[6], s, aa, bb, cc, mn = inf, x, t;\n int main() {\n   cin >> n >> s;\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &x);\n     ar[x]++;\n   }\n   for (int i = s / n; i >= 0; i--) {\n     for (int j = (s - i * ar[3]) / (ar[4] + ar[5]); j >= i; j--) {\n       t = (s - i * ar[3] - j * ar[4]) / ar[5];\n       if (t * ar[5] - j * ar[4] >= mn) break;\n       if (i * ar[3] + j * ar[4] + t * ar[5] == s && j <= t) {\n         if (mn > abs(i * ar[3] - j * ar[4]) + abs(j * ar[4] - t * ar[5])) {\n           aa = i;\n           bb = j;\n           cc = t;\n           mn = abs(i * ar[3] - j * ar[4]) + abs(j * ar[4] - t * ar[5]);\n         }\n       }\n     }\n   }\n   if (mn == inf)\n     cout << -1 << endl;\n   else\n     cout << aa << ' ' << bb << ' ' << cc << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double pi = acos(-1.0);\n const int MAXN = 200005;\n int n, x[MAXN];\n long long a[MAXN], t;\n long long b[MAXN];\n void solve() {\n   for (int i = 0; i + 1 < n; i++) {\n     if (x[i] > x[i + 1]) {\n       cout << 'No' << endl;\n       return;\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     if (i > x[i]) {\n       cout << 'No' << endl;\n       return;\n     }\n   }\n   for (int i = 0; i < n;) {\n     int pos = x[i];\n     int j = i;\n     while (j < n && x[j] == pos) {\n       j++;\n     }\n     if (j < x[i] + 1) {\n       cout << 'No' << endl;\n       return;\n     }\n     long long num = a[j - 1];\n     for (int k = i; k + 1 < j; k++) {\n       b[k] = a[k + 1] + t;\n     }\n     b[j - 1] = a[j - 1] + t + (j - i > 1);\n     if (j < n && b[j - 1] >= a[j] + t) {\n       cout << 'No' << endl;\n       return;\n     }\n     i = j;\n   }\n   cout << 'Yes' << endl;\n   for (int i = 0; i < n; i++) {\n     cout << b[i] << ' ';\n   }\n   cout << endl;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   while (cin >> n >> t) {\n     for (int i = 0; i < n; i++) {\n       cin >> a[i];\n     }\n     for (int i = 0; i < n; i++) {\n       cin >> x[i];\n       x[i]--;\n     }\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int N, Q, C, Rt, L[200005], R[200005], G[200005], F[200005], ch[200005][2];\n struct Nod {\n   int Now, Max, Min, Laz;\n   Nod() {\n     Min = 1 << 30;\n     Max = -Min;\n   }\n } T[200005];\n vector<int> son[200005];\n void Upd(int x, int k) {\n   if (x) T[x].Now += k, T[x].Max += k, T[x].Min += k, T[x].Laz += k;\n }\n void Up(int x) {\n   int l = ch[x][0], r = ch[x][1];\n   T[x].Max = max(T[x].Now, max(T[l].Max, T[r].Max));\n   T[x].Min = min(T[x].Now, min(T[l].Min, T[r].Min));\n }\n void Dn(int x) {\n   int k = T[x].Laz;\n   if (k) Upd(ch[x][0], k), Upd(ch[x][1], k), T[x].Laz = 0;\n }\n void Rot(int x) {\n   int y = F[x], z = F[y], k = ch[y][0] == x, t;\n   if (t = ch[y][!k] = ch[x][k]) F[t] = y;\n   if (F[x] = z) ch[z][ch[z][1] == y] = x;\n   ch[F[y] = x][k] = y;\n   Up(y);\n }\n void Splay(int x, int Aim) {\n   for (Dn(x); F[x] ^ Aim; Rot(x)) {\n     int y = F[x], z = F[y];\n     Dn(z);\n     Dn(y);\n     Dn(x);\n     if (F[y] ^ Aim) (ch[z][0] == y ^ ch[y][0] == x) ? Rot(x) : Rot(y);\n   }\n   Up(x);\n   if (!Aim) Rt = x;\n }\n void DFS(int u, int d) {\n   L[u] = ++C;\n   G[C] = u;\n   T[C].Now = d;\n   for (int i = 1, lim = son[u].size(); i <= lim; i++) DFS(son[u][i - 1], d + 1);\n   R[u] = ++C;\n   G[C] = u;\n   T[C].Now = d;\n }\n void Build(int& u, int l, int r, int fa) {\n   F[u = l + r >> 1] = fa;\n   if (l < u) Build(ch[u][0], l, u - 1, u);\n   if (u < r) Build(ch[u][1], u + 1, r, u);\n   Up(u);\n }\n int Find(int x, int k) {\n   int l = ch[x][0], r = ch[x][1];\n   Dn(x);\n   if (T[r].Min <= k && k <= T[r].Max) return Find(r, k);\n   return T[x].Now == k ? x : Find(l, k);\n }\n int Pre(int x) {\n   Splay(x, 0);\n   x = ch[x][0];\n   for (; ch[x][1]; x = ch[x][1]) Dn(x);\n   return x;\n }\n int Suf(int x) {\n   Splay(x, 0);\n   x = ch[x][1];\n   for (; ch[x][0]; x = ch[x][0]) Dn(x);\n   return x;\n }\n void Get(int x, int y) {\n   Splay(x, 0);\n   Splay(y, x);\n }\n int main() {\n   scanf('%d%d', &N, &Q);\n   for (int i = 1, lim = N; i <= lim; i++) {\n     int x, t;\n     scanf('%d', &x);\n     for (; x--;) scanf('%d', &t), son[i].push_back(t);\n   }\n   C++;\n   DFS(1, 1);\n   C++;\n   Build(Rt, 1, C, 0);\n   for (int k, x, y, z, l, r, w, t; Q--;) {\n     scanf('%d', &k);\n     if (k == 1) {\n       scanf('%d%d', &x, &y);\n       if (x == y)\n         puts('0');\n       else {\n         x = L[x];\n         y = L[y];\n         Get(x, y);\n         z = (ch[x][0] == y ? T[ch[y][1]] : T[ch[y][0]]).Min;\n         printf('%d\n',\n                T[x].Now + T[y].Now - 2 * min(z - 1, min(T[x].Now, T[y].Now)));\n       }\n     } else if (k == 2) {\n       scanf('%d%d', &x, &y);\n       Get(1, L[x]);\n       w = G[Find(ch[L[x]][0], T[L[x]].Now - y)];\n       l = Pre(L[x]);\n       r = Suf(R[x]);\n       Get(l, r);\n       t = ch[r][0];\n       ch[r][0] = 0;\n       Up(r);\n       Up(l);\n       r = R[w];\n       l = Pre(r);\n       Get(l, r);\n       ch[r][0] = t;\n       F[t] = r;\n       Upd(t, -y + 1);\n       Splay(t, 0);\n     } else\n       scanf('%d', &x), printf('%d\n', G[Find(Rt, x + 1)]);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 112, INF = 1e18;\n long long t, n, m, a[N];\n long long B10(string s) {\n   reverse(s.begin(), s.end());\n   long long ret = 0;\n   for (long long i = 0; i < s.size(); i++) {\n     if (s[i] == '1') ret += (1ll << i);\n   }\n   return ret;\n }\n string B2(long long a) {\n   string ret;\n   for (long long i = 0; i < m; i++) {\n     if (a & (1ll << i))\n       ret += '1';\n     else\n       ret += '0';\n   }\n   reverse(ret.begin(), ret.end());\n   return ret;\n }\n long long BS() {\n   long long low = 0, high = (1ll << m);\n   while (high - low > 1) {\n     long long mid = (low + high) >> 1;\n     long long v1 = mid - (lower_bound(a, a + n, mid) - a);\n     long long v2 = ((1ll << m) - n - 1) / 2;\n     if (v1 <= v2)\n       low = mid;\n     else\n       high = mid;\n   }\n   return low;\n }\n int32_t main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> t;\n   while (t--) {\n     cin >> n >> m;\n     for (long long i = 0; i < n; i++) {\n       string s;\n       cin >> s;\n       a[i] = B10(s);\n     }\n     sort(a, a + n);\n     cout << B2(BS()) << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int p[100100];\n int main() {\n   int n, a, b, t, cn = 1;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> a;\n     p[i] = a;\n   }\n   sort(p, p + n);\n   int ans = 0;\n   vector<int> v;\n   for (int i = 0; i < n; i++) {\n     int j = 0;\n     for (j = 0; j < v.size(); j++) {\n       if (p[i] >= v[j]) {\n         v[j]++;\n         break;\n       }\n     }\n     if (j == v.size()) {\n       v.push_back(1);\n     }\n   }\n   cout << v.size() << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2100;\n char mp[N][N];\n int n, m, lp, rp, dis[N][N];\n bool vis[N][N];\n struct poi {\n   int x, y;\n } q[N * N], st;\n void expan(int x, int y, int di) {\n   int i;\n   for (i = x; mp[i][y] != '*'; i--) {\n     q[++rp] = (poi){i, y};\n     dis[i][y] = di;\n     vis[i][y] = 1;\n   }\n   for (i = x + 1; mp[i][y] != '*'; i++) {\n     q[++rp] = (poi){i, y};\n     dis[i][y] = di;\n     vis[i][y] = 1;\n   }\n }\n int main() {\n   int i, j, k, le, ri, x, y;\n   scanf('%d%d%d%d%d%d', &n, &m, &st.x, &st.y, &le, &ri);\n   for (i = 1; i <= n; i++) scanf('%s', mp[i] + 1);\n   for (i = 0; i <= m + 1; i++) mp[0][i] = mp[n + 1][i] = '*';\n   for (i = 0; i <= n + 1; i++) mp[i][0] = mp[i][m + 1] = '*';\n   lp = 1;\n   rp = 0;\n   expan(st.x, st.y, 0);\n   while (lp <= rp) {\n     poi now = q[lp++];\n     x = now.x;\n     y = now.y;\n     if ((!vis[x][y - 1]) && (mp[x][y - 1] != '*'))\n       expan(x, y - 1, dis[x][y] + 1);\n     if ((!vis[x][y + 1]) && (mp[x][y + 1] != '*'))\n       expan(x, y + 1, dis[x][y] + 1);\n   }\n   int ans = 0;\n   for (i = 1; i <= n; i++)\n     for (j = 1; j <= m; j++) {\n       int fix = st.y - j;\n       if ((vis[i][j]) && (mp[i][j] != '*') &&\n           (le >= ((dis[i][j] + fix) >> 1)) && (ri >= ((dis[i][j] - fix) >> 1)))\n         ans++;\n     }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char buf[25];\n struct node {\n   long long x, y;\n   bool operator<(node tp) const {\n     if (x != tp.x) return x < tp.x;\n     return y < tp.y;\n   }\n };\n map<long long, long long> h1, h2;\n map<node, long long> t, q;\n const long long inf = 1e17;\n const long long maxn = 200010;\n long long L1[maxn], R1[maxn], l1[maxn], r1[maxn], s1[maxn], a[maxn];\n long long L2[maxn], R2[maxn], l2[maxn], r2[maxn], s2[maxn];\n long long n, m, sum1, sum2;\n long long ans;\n long long read() {\n   long long x = 0, f = 0;\n   char ch;\n   do {\n     ch = getchar();\n     if (ch == '-') f = 1;\n   } while (ch < '0' || ch > '9');\n   while (ch >= '0' && ch <= '9') {\n     x = (x << 1) + (x << 3) + (ch ^ 48);\n     ch = getchar();\n   }\n   return f ? -x : x;\n }\n void write(long long x) {\n   if (x < 0) {\n     putchar('-');\n     x = -x;\n   }\n   if (!x) {\n     putchar('0');\n     return;\n   }\n   long long cnt = 0;\n   while (x) {\n     buf[++cnt] = '0' + x % 10;\n     x /= 10;\n   }\n   for (long long i = cnt; i >= 1; --i) putchar(buf[i]);\n }\n signed main() {\n   srand(19267180);\n   n = read();\n   m = read();\n   for (long long i = 1; i <= n; ++i) {\n     h1[i] = (1ll * rand() * rand() * rand() * rand() % inf + inf) % inf;\n     h2[i] = (1ll * rand() * rand() * rand() * rand() % inf + inf) % inf;\n     sum1 = h1[i] ^ sum1;\n     sum2 = h2[i] ^ sum2;\n   }\n   for (long long i = 1; i <= n; ++i) {\n     long long l = read(), r = read();\n     ++a[l];\n     --a[r + 1];\n     s1[l] ^= h1[i];\n     s1[r + 1] ^= h1[i];\n     L1[l - 1] ^= h1[i];\n     R1[r + 1] ^= h1[i];\n     s2[l] ^= h2[i];\n     s2[r + 1] ^= h2[i];\n     L2[l - 1] ^= h2[i];\n     R2[r + 1] ^= h2[i];\n   }\n   for (long long i = m - 1; i >= 1; --i) L1[i] ^= L1[i + 1], L2[i] ^= L2[i + 1];\n   for (long long i = 2; i <= m; ++i) {\n     R1[i] ^= R1[i - 1], s1[i] ^= s1[i - 1];\n     R2[i] ^= R2[i - 1], s2[i] ^= s2[i - 1];\n   }\n   for (long long i = 2; i <= m; ++i) s1[i] ^= s1[i - 1], s2[i] ^= s2[i - 1];\n   for (long long i = 1; i <= m; ++i) {\n     l1[i] = s1[i - 1] ^ R1[i], r1[i] = s1[i] ^ L1[i];\n     l2[i] = s2[i - 1] ^ R2[i], r2[i] = s2[i] ^ L2[i];\n   }\n   for (long long i = m; i >= 1; --i) {\n     t[(node){r1[i], r2[i]}] += 1;\n     q[(node){r1[i], r2[i]}] += i;\n     long long x_1 = sum1 ^ l1[i], x_2 = sum2 ^ l2[i];\n     ans += q[(node){x_1, x_2}] - 1ll * t[(node){x_1, x_2}] * (i - 1);\n   }\n   for (long long i = 1; i <= m; ++i) a[i] += a[i - 1];\n   long long x = 0;\n   for (long long i = 1; i <= m; ++i) {\n     if (a[i] == 0)\n       ++x;\n     else\n       x = 0;\n     if (x)\n       if (i == m || a[i + 1] != 0)\n         for (long long j = 1; j <= x; ++j) ans -= 1ll * j * (x - j + 1);\n   }\n   write(ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void RI() {}\n template <typename... T>\n void RI(int& head, T&... tail) {\n   scanf('%d', &head);\n   RI(tail...);\n }\n template <typename T>\n void _dump(const char* s, T&& head) {\n   cerr << s << '=' << head << endl;\n }\n template <typename T, typename... Args>\n void _dump(const char* s, T&& head, Args&&... tail) {\n   int c = 0;\n   while (*s != ',' || c != 0) {\n     if (*s == '(' || *s == '[' || *s == '{') c++;\n     if (*s == ')' || *s == ']' || *s == '}') c--;\n     cerr << *s++;\n   }\n   cerr << '=' << head << ', ';\n   _dump(s + 1, tail...);\n }\n template <typename Iter>\n ostream& _out(ostream& s, Iter b, Iter e) {\n   s << '[';\n   for (auto it = b; it != e; it++) s << (it == b ? '' : ' ') << *it;\n   s << ']';\n   return s;\n }\n template <typename A, typename B>\n ostream& operator<<(ostream& s, const pair<A, B>& p) {\n   return s << '(' << p.first << ',' << p.second << ')';\n }\n template <typename T>\n ostream& operator<<(ostream& s, const vector<T>& c) {\n   return _out(s, begin(c), end(c));\n }\n template <typename T>\n ostream& operator<<(ostream& s, const set<T>& c) {\n   return _out(s, begin(c), end(c));\n }\n template <typename A, typename B>\n ostream& operator<<(ostream& s, const map<A, B>& c) {\n   return _out(s, begin(c), end(c));\n }\n vector<int> app[1000010];\n int ask(int l, int r, int v) {\n   auto it = lower_bound(begin(app[v]), end(app[v]), l);\n   auto jt = upper_bound(begin(app[v]), end(app[v]), r);\n   return jt - it;\n }\n int n, m, a[300010], sa[300010], ord[300010], l[300010], r[300010];\n bool vis[300010];\n bool cmp(int x, int y) { return a[x] < a[y]; }\n long long calc(int l1, int r1, int l2, int r2, int mx) {\n   long long ans = 0;\n   mx %= m;\n   if (r1 - l1 <= r2 - l2) {\n     for (int i = (l1 - 1); i <= int(r1 - 1); i++) {\n       int x = sa[i] + mx;\n       if (x >= m) x -= m;\n       int now = ask(l2, r2, x);\n       ans += now;\n     }\n   } else {\n     for (int i = (l2); i <= int(r2); i++) {\n       int x = sa[i] - mx;\n       if (x < 0) x += m;\n       int now = ask(l1 - 1, r1 - 1, x);\n       ans += now;\n     }\n   }\n   return ans;\n }\n int main() {\n   RI(n, m);\n   for (int i = (1); i <= int(n); i++) RI(a[i]);\n   for (int i = (1); i <= int(n); i++) l[i] = r[i] = i;\n   for (int i = (1); i <= int(n); i++) ord[i] = i;\n   for (int i = (1); i <= int(n); i++) sa[i] = (sa[i - 1] + a[i]) % m;\n   for (int i = (0); i <= int(n); i++) app[sa[i]].push_back(i);\n   sort(ord + 1, ord + n + 1, cmp);\n   long long ans = 0;\n   for (int ii = (1); ii <= int(n); ii++) {\n     int i = ord[ii];\n     vis[i] = 1;\n     if (i > 1 && vis[i - 1]) {\n       ans += calc(l[i - 1], i - 1, i, i, a[i]);\n       l[i] = l[i - 1];\n       r[l[i - 1]] = i;\n     }\n     if (i < n && vis[i + 1]) {\n       ans += calc(l[i], i, i + 1, r[i + 1], a[i]);\n       r[l[i]] = r[i + 1];\n       l[r[i + 1]] = l[i];\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n long long a, b[100100], p[100100];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   cin >> n >> m >> a;\n   for (int i = 1; i <= n; i++) cin >> b[i];\n   for (int i = 1; i <= m; i++) cin >> p[i];\n   sort(b + 1, b + n + 1);\n   sort(p + 1, p + m + 1);\n   int le = -1, ri = min(n, m) + 1;\n   while (le + 1 < ri) {\n     int mi = (le + ri) / 2;\n     long long cnt = 0;\n     for (int i = 1; i <= mi; i++) {\n       cnt += max(0LL, p[mi + 1 - i] - b[n + 1 - i]);\n     }\n     if (cnt > a) {\n       ri = mi;\n     } else {\n       le = mi;\n     }\n   }\n   long long tot = 0;\n   for (int i = 1; i <= le; i++) tot += p[i];\n   cout << le << ' ' << max(tot - a, 0LL) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a[100000], outpalsz, inn, b[100000];\n long long result;\n int inicount[100001], iniodd;\n int ccount[100001], codd;\n int main() {\n   cin.sync_with_stdio(false);\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   for (int i = 0; i < n - 1 - i && a[i] == a[n - 1 - i]; i++) outpalsz++;\n   for (int i = outpalsz; i < n - outpalsz; i++) {\n     inicount[a[i]]++;\n     if (inicount[a[i]] % 2)\n       iniodd++;\n     else\n       iniodd--;\n     b[inn++] = a[i];\n   }\n   if (inn <= 1) {\n     cout << 1LL * n * (n + 1) / 2 << '\n';\n     return 0;\n   }\n   if (iniodd <= 1) result = 1LL * (outpalsz + 1) * (outpalsz + 1);\n   for (int i = 0; i <= 100000; i++) ccount[i] = inicount[i];\n   codd = iniodd;\n   for (int i = 0; i < inn; i++) {\n     ccount[b[i]] -= 2;\n     if (i * 2 + 1 == inn) ccount[b[i]]++;\n     if (i > inn - 1 - i && b[i] == b[inn - 1 - i]) ccount[b[i]] += 2;\n     if (ccount[b[i]] < 0) break;\n     if (codd <= 1) result += outpalsz + 1;\n   }\n   for (int i = 0; i <= 100000; i++) ccount[i] = inicount[i];\n   codd = iniodd;\n   for (int i = inn - 1; i >= 0; i--) {\n     ccount[b[i]] -= 2;\n     if (i * 2 + 1 == inn) ccount[b[i]]++;\n     if (i < inn - 1 - i && b[i] == b[inn - 1 - i]) ccount[b[i]] += 2;\n     if (ccount[b[i]] < 0) break;\n     if (codd <= 1) result += outpalsz + 1;\n   }\n   cout << result << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long get(string a) {\n   long long len = a.length();\n   long long b = 0;\n   long long cnt = 1;\n   for (int i = len - 1; i >= 0; i--) {\n     b += ((a[i] - '0') % 2) * cnt;\n     cnt *= 2;\n   }\n   return b;\n }\n int p[262150];\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     char c;\n     cin >> c;\n     string a;\n     cin >> a;\n     long long b = get(a);\n     switch (c) {\n       case '+': {\n         p[b]++;\n         break;\n       }\n       case '-': {\n         p[b]--;\n         break;\n       }\n       case '?': {\n         cout << p[b] << endl;\n         break;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MOD = (int)1e9 + 7;\n const int INF = (int)1e9;\n const long long LINF = (long long)1e18;\n const long double PI = acos((long double)-1);\n const long double EPS = 1e-9;\n inline long long gcd(long long a, long long b) {\n   long long r;\n   while (b) {\n     r = a % b;\n     a = b;\n     b = r;\n   }\n   return a;\n }\n inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }\n inline long long fpow(long long n, long long k, int p = MOD) {\n   long long r = 1;\n   for (; k; k >>= 1) {\n     if (k & 1) r = r * n % p;\n     n = n * n % p;\n   }\n   return r;\n }\n template <class T>\n inline int chkmin(T& a, const T& val) {\n   return val < a ? a = val, 1 : 0;\n }\n template <class T>\n inline int chkmax(T& a, const T& val) {\n   return a < val ? a = val, 1 : 0;\n }\n template <class T>\n inline T isqrt(T k) {\n   T r = sqrt(k) + 1;\n   while (r * r > k) r--;\n   return r;\n }\n template <class T>\n inline T icbrt(T k) {\n   T r = cbrt(k) + 1;\n   while (r * r * r > k) r--;\n   return r;\n }\n inline void addmod(int& a, int val, int p = MOD) {\n   if ((a = (a + val)) >= p) a -= p;\n }\n inline void submod(int& a, int val, int p = MOD) {\n   if ((a = (a - val)) < 0) a += p;\n }\n inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }\n inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }\n const int maxn = 2000 + 10;\n const int maxm = 500000 + 10;\n int n, m;\n int a[maxm];\n int b[maxm];\n bitset<maxn << 1> mat[maxn];\n void solve() {\n   cin >> n >> m;\n   for (int i = (0); i < (m); i++) {\n     cin >> a[i] >> b[i], a[i]--, b[i]--;\n     mat[b[i]][a[i]] = 1;\n   }\n   for (int i = (0); i < (n); i++)\n     for (int j = (0); j < (n); j++) mat[i][j + n] = i == j;\n   for (int i = (0); i < (n); i++) {\n     if (!mat[i][i]) {\n       for (int j = (i + 1); j < (n); j++)\n         if (mat[j][i]) {\n           mat[i] ^= mat[j];\n           break;\n         }\n     }\n     for (int j = (0); j < (n); j++) {\n       if (j == i) continue;\n       if (mat[j][i]) {\n         mat[j] ^= mat[i];\n       }\n     }\n   }\n   for (int i = (0); i < (m); i++) {\n     if (!mat[a[i]][b[i] + n]) {\n       cout << 'YES\n';\n     } else {\n       cout << 'NO\n';\n     }\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string str;\n   cin >> str;\n   int ans(0);\n   for (int i = 0; i < str.size(); ++i)\n     if (str[i] != str[str.size() - 1 - i]) ++ans;\n   if (ans == 2 || (ans == 0 && str.size() % 2 == 1))\n     cout << 'YES' << endl;\n   else\n     cout << 'NO' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/STACK:256000000')\n using namespace std;\n int main() {\n   srand(1373737);\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int n, t, k, d, q;\n   cin >> n >> q;\n   vector<int> arr(n);\n   for (int i = 0; i < (int)q; i++) {\n     cin >> t >> k >> d;\n     int free = 0;\n     for (int j = 0; j < (int)n; j++) {\n       if (arr[j] <= t) free++;\n     }\n     if (free < k) {\n       cout << -1 << '\n';\n       continue;\n     }\n     int res = 0;\n     for (int j = 0; j < n && k; j++) {\n       if (arr[j] <= t) {\n         arr[j] = t + d;\n         k--;\n         res += j + 1;\n       }\n     }\n     cout << res << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline bool uin(T& a, T b) {\n   return a > b ? (a = b, true) : false;\n }\n template <class T>\n inline bool uax(T& a, T b) {\n   return a < b ? (a = b, true) : false;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   long long N, K;\n   cin >> N >> K;\n   if (K == 1) {\n     cout << N << '\n';\n     return 0;\n   }\n   string be, en;\n   cin >> be >> en;\n   long long ans = 0, cur = 1;\n   for (int i = 0; i < N; ++i) {\n     cur *= 2LL;\n     if (be[i] == 'b') --cur;\n     if (en[i] == 'a') --cur;\n     uin(cur, K);\n     ans += cur;\n   }\n   cout << ans << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #pragma GCC optimize('O2')\n #pragma GCC optimize('unroll-loops')\n struct POINT {\n   int x, y;\n   POINT() : x(0), y(0) {}\n   POINT(int x, int y) : x(x), y(y) {}\n   POINT operator+(const POINT &t) const { return POINT(x + t.x, y + t.y); }\n   POINT operator-(const POINT &t) const { return POINT(x - t.x, y - t.y); }\n   POINT operator!() const { return POINT(-y, x); }\n };\n inline long long dot(const POINT &a, const POINT &b) {\n   return (long long)a.x * b.x + (long long)a.y * b.y;\n }\n inline long long cross(const POINT &a, const POINT &b) {\n   return (long long)a.x * b.y - (long long)a.y * b.x;\n }\n inline long long cross(const POINT &a, const POINT &b, const POINT &c) {\n   return cross(a - c, b - c);\n }\n inline bool halfPlane(const POINT &p) {\n   if (p.y == 0) return p.x < 0;\n   return p.y < 0;\n }\n inline bool angSortCmp(const POINT &a, const POINT &b) {\n   bool ha = halfPlane(a);\n   bool hb = halfPlane(b);\n   if (ha != hb) return ha < hb;\n   return cross(a, b) > 0;\n }\n const int N = 2000;\n int n;\n long long S;\n POINT tab[N + 7];\n int poz[N + 7];\n POINT stab[N + 7];\n struct kierunek {\n   POINT wek;\n   int p, q;\n };\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n >> S;\n   S *= 2;\n   for (int i = 1; i <= n; ++i) cin >> tab[i].x >> tab[i].y;\n   sort(tab + 1, tab + n + 1, [](const POINT &a, const POINT &b) -> bool {\n     if (a.x == b.x) return a.y > b.y;\n     return a.x < b.x;\n   });\n   for (int i = 1; i <= n; ++i) {\n     poz[i] = i;\n     stab[i] = tab[i];\n   }\n   vector<kierunek> kol((n * (n - 1)) / 2);\n   int it = 0;\n   for (int i = 1; i <= n; ++i) {\n     for (int j = i + 1; j <= n; ++j) {\n       kol[it].wek = !(tab[j] - tab[i]);\n       kol[it].p = i;\n       kol[it].q = j;\n       it++;\n     }\n   }\n   sort(kol.begin(), kol.end(),\n        [](const kierunek &a, const kierunek &b) -> bool {\n          return angSortCmp(a.wek, b.wek);\n        });\n   for (kierunek u : kol) {\n     int p = u.p;\n     int q = u.q;\n     swap(stab[poz[p]], stab[poz[q]]);\n     swap(poz[p], poz[q]);\n     int l = 1;\n     int r = n;\n     while (l <= r) {\n       int s = (l + r) / 2;\n       long long ww = cross(tab[q], stab[s], tab[p]);\n       if (ww == S) {\n         cout << 'Yes' << endl;\n         cout << tab[p].x << ' ' << tab[p].y << endl;\n         cout << tab[q].x << ' ' << tab[q].y << endl;\n         cout << stab[s].x << ' ' << stab[s].y << endl;\n         exit(0);\n       }\n       if (ww > S)\n         r = s - 1;\n       else\n         l = s + 1;\n     }\n     l = 1;\n     r = n;\n     while (l <= r) {\n       int s = (l + r) / 2;\n       long long ww = cross(tab[q], stab[s], tab[p]);\n       if (ww == -S) {\n         cout << 'Yes' << endl;\n         cout << tab[p].x << ' ' << tab[p].y << endl;\n         cout << tab[q].x << ' ' << tab[q].y << endl;\n         cout << stab[s].x << ' ' << stab[s].y << endl;\n         exit(0);\n       }\n       if (ww > -S)\n         r = s - 1;\n       else\n         l = s + 1;\n     }\n   }\n   cout << 'No' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(0);\n   int i, j, n, m, k, l, r;\n   cin >> n >> m;\n   int a[n][m];\n   pair<int, int> start_end[n][m];\n   for (i = 0; i < n; i += 1)\n     for (j = 0; j < m; j += 1) {\n       cin >> a[i][j];\n       start_end[i][j].first = i;\n       start_end[i][j].second = i;\n     }\n   for (j = 0; j < m; j += 1)\n     for (i = 1; i < n; i += 1)\n       if (a[i][j] >= a[i - 1][j])\n         start_end[i][j].first = start_end[i - 1][j].first;\n   int min_l[n];\n   for (i = 0; i < n; i++) min_l[i] = 100010;\n   for (i = 0; i < n; i += 1)\n     for (j = 0; j < m; j += 1)\n       if (start_end[i][j].first < min_l[i]) min_l[i] = start_end[i][j].first;\n   cin >> k;\n   while (k--) {\n     cin >> l >> r;\n     cout << ((min_l[r - 1] <= l - 1) ? 'Yes\n' : 'No\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n void read(T &x) {\n   x = 0;\n   char ch = getchar();\n   long long fh = 1;\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') fh = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();\n   x *= fh;\n }\n template <typename T>\n void write(T x) {\n   if (x < 0) x = -x, putchar('-');\n   if (x > 9) write(x / 10);\n   putchar(x % 10 + '0');\n }\n template <typename T>\n void writeln(T x) {\n   write(x);\n   puts('');\n }\n long long n, a[100005];\n signed main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long t;\n   cin >> t;\n   while (t--) {\n     cin >> n;\n     for (long long i = 1; i <= n; i++) cin >> a[i];\n     long long x = 0;\n     for (long long i = n; i >= 1; i--)\n       if (a[i] < 0)\n         x += -a[i];\n       else if (x >= a[i])\n         x -= a[i];\n       else\n         x = 0;\n     cout << x << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int n, m, h;\n   cin >> n >> m >> h;\n   vector<int> ms(m), ns(n);\n   vector<vector<int> > ok(n, vector<int>(m));\n   for (int i = 0; i < m; i++) {\n     cin >> ms[i];\n   }\n   for (int i = 0; i < n; i++) {\n     cin >> ns[i];\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       cin >> ok[i][j];\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       if (ok[i][j] == 0) {\n         cout << 0 << ' ';\n       } else {\n         cout << min(ms[j], ns[i]) << ' ';\n       }\n     }\n     cout << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 7;\n vector<pair<int, int> > 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<int, int> 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 <bits/stdc++.h>\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<long long> 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 <bits/stdc++.h>\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<int> c[3000000];\n vector<pair<long long, long long> > 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<long long, long long>((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<long long, long long>((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 <bits/stdc++.h>\n using namespace std;\n vector<vector<long long> > matmul(vector<vector<long long> > &a,\n                                   vector<vector<long long> > &b) {\n   int i, j, k, n = a.size();\n   vector<vector<long long> > ans(n, vector<long long>(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<vector<long long> > matpwr(vector<vector<long long> > &a, long long p) {\n   int n = a.size();\n   vector<vector<long long> > ans(n, vector<long long>(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 <bits/stdc++.h>\n using namespace std;\n int n, a[110], b[110], sum = 0;\n pair<int, int> dp[110][11000], q = {-1, -1};\n pair<int, int> 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<int, int> 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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1000000007;\n const int N = 3020;\n const int D = 1001;\n int c[N][N], x[N], y[N], b[N], v[N][N], f[N][N], w[N];\n int dis(int i, int j) { return max(abs(x[i] - x[j]), abs(y[i] - y[j])); }\n int C(int x, int y) { return x >= y ? c[x][y] : 0; }\n int main() {\n   int n, m, r, i, j, u, d, l, ri, ans = 0, tmp;\n   scanf('%d%d%d', &n, &m, &r);\n   c[0][0] = 1;\n   for (i = 1; i <= 2000; 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   for (i = 1; i <= n; i++) {\n     scanf('%d%d%d', &x[i], &y[i], &b[i]);\n     x[i] += D, y[i] += D;\n     v[x[i]][y[i]]++;\n   }\n   for (i = 1; i <= 3000; i++)\n     for (j = 1; j <= 3000; j++)\n       v[i][j] += v[i - 1][j] + v[i][j - 1] - v[i - 1][j - 1];\n   for (i = 1; i <= n - 1; i++) {\n     for (j = i + 1; j <= n; j++) {\n       u = max(y[i], y[j]) - r;\n       d = min(y[i], y[j]) + r;\n       l = max(x[i], x[j]) - r;\n       ri = min(x[i], x[j]) + r;\n       if (l <= ri && u <= d)\n         f[i][j] = v[ri][d] - v[l - 1][d] - v[ri][u - 1] + v[l - 1][u - 1];\n     }\n   }\n   for (i = 1; i <= n; i++) {\n     for (j = 1; j <= n; j++) {\n       if (dis(i, j) > r) w[i]++;\n     }\n     ans = (ans +\n            (long long)(C(n, m) - C(w[i], m) + mod) * b[i] % mod * b[i] % mod) %\n           mod;\n   }\n   for (i = 1; i <= n - 1; i++)\n     for (j = i + 1; j <= n; j++) {\n       tmp = ((C(w[i], m) + C(w[j], m) -\n               C(n - (n - w[i] + n - w[j] - f[i][j]), m)) %\n                  mod +\n              mod) %\n             mod;\n       ans = (ans +\n              (long long)(C(n, m) - tmp + mod) * b[j] % mod * b[i] * 2 % mod) %\n             mod;\n     }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, t1, t2;\n vector<int> q1, q2;\n vector<vector<int> > Visted;\n int des(int point1, int point2, int point3, int point4) {\n   return abs(point1 - point3) + abs(point2 - point4);\n }\n int main() {\n   cin >> n >> m >> t1;\n   Visted.resize(n + 10, vector<int>(m + 10));\n   q1.resize(t1);\n   for (int i = 0; i < t1; i++) cin >> q1[i];\n   cin >> t2;\n   q2.resize(t2);\n   for (int i = 0; i < t2; i++) cin >> q2[i];\n   sort(q1.begin(), q1.end());\n   sort(q2.begin(), q2.end());\n   for (int i = 0; i < t1; i++) {\n     bool take = false;\n     int desEnd = -1e9, X, Y;\n     for (int j = 1; j <= n; j++) {\n       for (int z = 1; z <= m; z++) {\n         if (!Visted[j][z] && des(0, 0, j, z) <= q1[i] &&\n             des(0, m + 1, j, z) > desEnd) {\n           desEnd = des(0, m + 1, j, z);\n           take = true;\n           X = j, Y = z;\n         }\n       }\n     }\n     if (take) {\n       Visted[X][Y] = 1;\n     } else {\n       cout << 'NO';\n       return 0;\n     }\n   }\n   for (int i = 0; i < t2; i++) {\n     bool take = false;\n     int desEnd = 1e9, X, Y;\n     for (int j = 1; j <= n; j++) {\n       for (int z = 1; z <= m; z++) {\n         if (!Visted[j][z] && des(0, m + 1, j, z) <= q2[i] &&\n             des(0, m + 1, j, z) < desEnd) {\n           take = true;\n           X = j, Y = z;\n         }\n       }\n     }\n     if (take) {\n       Visted[X][Y] = 1;\n     } else {\n       cout << 'NO';\n       return 0;\n     }\n   }\n   cout << 'YES';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class TH>\n void _dbg(const char *sdbg, TH h) {\n   cerr << sdbg << '=' << h << endl;\n }\n template <class TH, class... TA>\n void _dbg(const char *sdbg, TH h, TA... a) {\n   while (*sdbg != ',') cerr << *sdbg++;\n   cerr << '=' << h << ',';\n   _dbg(sdbg + 1, a...);\n }\n template <class T>\n ostream &operator<<(ostream &os, vector<T> V) {\n   os << '[';\n   for (auto vv : V) os << vv << ',';\n   return os << ']';\n }\n template <class L, class R>\n ostream &operator<<(ostream &os, pair<L, R> P) {\n   return os << '(' << P.first << ',' << P.second << ')';\n }\n template <class T>\n using min_heap = priority_queue<T, vector<T>, greater<T>>;\n template <class T>\n using max_heap = priority_queue<T>;\n const int mod = 1e9 + 7;\n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n struct PairHash {\n   template <typename T1, typename T2>\n   std::size_t operator()(const pair<T1, T2> &p) const {\n     return hash<T1>()(p.first) ^ hash<T2>()(p.second);\n   }\n };\n void solve(int ncase) {\n   int a, b, c, d;\n   cin >> a >> b >> c >> d;\n   int minx = min({a, b, c});\n   a -= minx;\n   b -= minx;\n   c -= minx;\n   cout << (((a % 2 + b % 2 + c % 2 + (d + 3 * 1LL * minx) % 2) <= 1) ||\n                    (minx >= 1 && ((a + 1) % 2 + (b + 1) % 2 + (c + 1) % 2 +\n                                   (d + 3 * 1LL * minx - 3) % 2) <= 1)\n                ? 'Yes'\n                : 'No')\n        << endl;\n }\n void solve_all_cases() {\n   int T = 1;\n   cin >> T;\n   int ncase = 0;\n   while (T--) {\n     solve(++ncase);\n   }\n }\n int main() {\n   cout << std::fixed;\n   cout << setprecision(6);\n   solve_all_cases();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   scanf('%d', &n);\n   int a[n];\n   for (int i = 0; i < n; i++) cin >> a[i];\n   for (int i = 0; i < n - 1; i++) cout << (a[i] + a[i + 1]) << ' ';\n   cout << a[n - 1];\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int j, i, a, b, c, k, d, e, f[1005], n, mi, ma;\n int main() {\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> f[i];\n     ma = max(f[i], ma);\n   }\n   for (i = 0; i < n - 1; i++)\n     for (j = i + 1; j < n; j++) {\n       c = 0;\n       for (k = i; k <= j; k++) c = f[k] ^ c;\n       ma = max(ma, c);\n     }\n   cout << ma;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC target( \\n     'avx,avx2,fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native')\n using namespace std;\n long long MOD = 1e9 + 7;\n long long k;\n vector<long long> v, w, num;\n vector<pair<long long, pair<long long, long long> > > zp;\n vector<vector<long long> > dp;\n long long st(long long t, long long id, long long mod) {\n   long long res = 1, a = t, n = id;\n   while (n) {\n     if (n & 1) res = (res * a) % mod;\n     a = (a * a) % mod;\n     n >>= 1;\n   }\n   return res % mod;\n }\n void add(long long id) {\n   vector<long long> mem(k + 1);\n   dp.push_back(mem);\n   long long lst = dp.size() - 1;\n   for (int i = 0; i < k + 1; i++) {\n     dp[lst][i] = dp[lst - 1][i];\n     if (i >= w[id])\n       dp[lst][i] = max(dp[lst - 1][i], dp[lst - 1][i - w[id]] + v[id]);\n   }\n }\n void del() { dp.pop_back(); }\n long long ans() {\n   long long lst = dp.size() - 1;\n   long long anss = 0;\n   for (int i = 1; i < k + 1; i++) {\n     anss = ((10000019 * (long long)anss) + (long long)dp[lst][k - i + 1]) % MOD;\n     if (anss > MOD) anss -= MOD;\n   }\n   return anss;\n }\n void get(long long l, long long r) {\n   if (r == l + 1) {\n     if (zp[l].first == 3) {\n       zp[l].second.first = ans();\n     }\n     return;\n   }\n   long long mid = (l + r) / 2;\n   long long kol = 0;\n   for (int i = mid; i < r; i++) {\n     if (zp[i].first == 2) {\n       if (num[zp[i].second.second] < l) {\n         add(zp[i].second.second);\n         kol++;\n       }\n     }\n   }\n   get(l, mid);\n   while (kol--) del();\n   kol = 0;\n   for (int i = l; i < mid; i++) {\n     if (zp[i].first == 1) {\n       if (zp[i].second.second >= r) {\n         add(zp[i].second.first);\n         kol++;\n       }\n     }\n   }\n   get(mid, r);\n   while (kol--) del();\n }\n int main() {\n   ios::sync_with_stdio(0), cin.tie(0), cout.tie(0),\n       cout << fixed << setprecision(20);\n   long long n;\n   cin >> n >> k;\n   v.resize(n), w.resize(n), num.resize(n);\n   vector<long long> mem(k + 1);\n   dp.push_back(mem);\n   for (int i = 0; i < n; i++) {\n     cin >> v[i] >> w[i];\n     zp.push_back({1, {i, MOD}});\n     num[i] = i;\n   }\n   long long q;\n   cin >> q;\n   while (q--) {\n     long long sz = zp.size();\n     zp.push_back({0, {num.size(), MOD}});\n     cin >> zp[zp.size() - 1].first;\n     if (zp.back().first == 1) {\n       long long vv, ww;\n       cin >> vv >> ww;\n       v.push_back(vv);\n       w.push_back(ww);\n       num.push_back(sz);\n     }\n     if (zp.back().first == 2) {\n       long long x;\n       cin >> x;\n       x--;\n       zp[num[x]].second.second = sz;\n       zp[sz].second.second = x;\n     }\n   }\n   get(0, zp.size());\n   for (auto i : zp) {\n     if (i.first == 3) {\n       cout << i.second.first << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long read() {\n   long long w = 0;\n   char c = getchar();\n   while (c < '0' || c > '9') c = getchar();\n   while (c >= '0' && c <= '9') w = w * 10 + c - 48, c = getchar();\n   return w;\n }\n long long n, s[100005], e[100005];\n bool f[100005][2];\n bool check(long long x, long long y, long long op) {\n   if ((y & 1) && (!op)) return (y - x) & 1;\n   long long h = y >> 1;\n   if (x > h) return op ? 1 : (y - x) & 1;\n   return check(x, h, op ^ 1);\n }\n signed main() {\n   n = read();\n   for (long long i = 1; i <= n; i++)\n     s[i] = read(), e[i] = read(), f[i][0] = check(s[i], e[i], 0),\n     f[i][1] = check(s[i], e[i], 1);\n   bool need = f[n][0];\n   for (long long i = n - 1; i > 0; i--) need = f[i][need];\n   printf(need ? '1 ' : '0 ');\n   need = f[n][1];\n   for (long long i = n - 1; i > 0; i--) need = f[i][need];\n   printf(need ? '1' : '0');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 16, Inf = 1e9, lastS = (1 << N) - 1;\n static int n, sqrn, R, B, ans, lasts;\n struct TCard {\n   bool c;\n   int r, b;\n } card[N];\n static int f[lastS][N * N + 1][2], cardr[lastS], cardb[lastS];\n inline int GetF(int s, int rem, bool c) {\n   rem = min(rem, sqrn);\n   if (s == lasts) return 0;\n   auto &fs = f[s][rem][c];\n   if (fs != -1) return fs;\n   fs = Inf;\n   for (int i = 0; i < n; ++i) {\n     if (s & 1 << i) continue;\n     int R = max(0, card[i].r - cardr[s]), B = max(0, card[i].b - cardb[s]),\n         turn, _r, _b;\n     if (c) {\n       turn = max(R - rem, B);\n       _r = rem + turn - R;\n       _b = turn - B;\n     } else {\n       turn = max(B - rem, R);\n       _b = rem + turn - B;\n       _r = turn - R;\n     }\n     if (_r)\n       fs = min(fs, turn + GetF(s ^ 1 << i, _r, 1));\n     else\n       fs = min(fs, turn + GetF(s ^ 1 << i, _b, 0));\n   }\n   return fs;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n;\n   sqrn = n * n;\n   lasts = (1 << n) - 1;\n   for_each(card, card + n, [](TCard &C) {\n     char tmp;\n     cin >> tmp >> C.r >> C.b;\n     C.c = tmp == 'R';\n     if (C.r > n) R += C.r - n, C.r = n;\n     if (C.b > n) B += C.b - n, C.b = n;\n   });\n   for (int s = 1; s <= lasts; ++s) {\n     int i = __builtin_ctz(s);\n     cardr[s] = cardr[s ^ 1 << i] + card[i].c;\n     cardb[s] = cardb[s ^ 1 << i] + !card[i].c;\n   }\n   memset(f, -1, sizeof f);\n   if (R > B)\n     ans = R + GetF(0, R - B, 0);\n   else\n     ans = B + GetF(0, B - R, 1);\n   cout << ans + n;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n ifstream file('input.txt');\n using namespace std;\n void maker(int x);\n int main() {\n   int y;\n   cin >> y;\n   maker(y + 1);\n }\n void maker(int x) {\n   int a, b, c, d;\n   a = (x / 1000) % 10;\n   b = (x / 100) % 10;\n   c = (x / 10) % 10;\n   d = (x / 1) % 10;\n   while (a == b || a == c || a == d || b == c || b == d || c == d) {\n     x++;\n     a = (x / 1000) % 10;\n     b = (x / 100) % 10;\n     c = (x / 10) % 10;\n     d = (x / 1) % 10;\n   }\n   cout << (a * 1000 + b * 100 + c * 10 + d);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename... Args>\n void logger(string vars, Args&&... values) {}\n template <typename T>\n inline void maxa(T& a, T b) {\n   a = max(a, b);\n }\n template <typename T>\n inline void mina(T& a, T b) {\n   a = min(a, b);\n }\n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n const int mxN = 2e5 + 5;\n const int mod = 1e9 + 7;\n int main() {\n   cin.sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   vector<int> a(n);\n   vector<char> ans(n);\n   for (int& i : a) cin >> i;\n   string s;\n   cin >> s;\n   sort(a.begin(), a.end());\n   int cnt = 0;\n   for (int i = 1; i < n; i++) cnt += (s[i] != s[i - 1]);\n   int l = n - cnt - 1;\n   int r = n - cnt - 1;\n   cout << a[l] << ' ' << s[0] << '\n';\n   ans[l] = s[0];\n   for (int i = 1; i < (int)(s.size()); i++) {\n     if (s[i] != s[i - 1]) {\n       ans[++r] = ans[r] == 'L' ? 'R' : 'L';\n       cout << a[r] << ' ' << ans[r] << '\n';\n     } else {\n       ans[--l] = ans[l] == 'L' ? 'R' : 'L';\n       cout << a[l] << ' ' << ans[l] << '\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 2000 + 100;\n map<pair<long long, long long>, int> rat;\n int n;\n pair<long long, long long> px[maxn], py[maxn];\n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }\n int main() {\n   cin >> n;\n   for (int i = 1, a, b, c; i <= n; i++) {\n     cin >> a >> b >> c;\n     px[i] = make_pair(c * b, a * a + b * b);\n     py[i] = make_pair(a * c, a * a + b * b);\n   }\n   long long ans = 0;\n   for (int i = 1; i <= n; i++) {\n     rat.clear();\n     long long two0 = 0;\n     for (int j = i + 1; j <= n; j++) {\n       long long a = px[j].first * px[i].second - px[j].second * px[i].first;\n       long long b = py[j].first * py[i].second - py[j].second * py[i].first;\n       long long g = gcd(abs(a), abs(b));\n       if (g != 0) a /= g, b /= g;\n       if (a == 0 && b == 0) {\n         two0++;\n         ans += j - i - 1;\n       } else {\n         if (a == 0) b = 1;\n         if (b == 0) a = 1;\n         if (a < 0 && b < 0) a *= -1, b *= -1;\n         if (a > 0 && b < 0) a *= -1, b *= -1;\n         ans += two0;\n         if (rat.count(make_pair(a, b))) {\n           ans += rat[make_pair(a, b)];\n           rat[make_pair(a, b)]++;\n         } else\n           rat[make_pair(a, b)] = 1;\n       }\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 25;\n int dp[MAXN][MAXN][MAXN];\n int n, t;\n int main() {\n   scanf('%d%d', &n, &t);\n   t = 2 * t;\n   dp[1][0][1] = dp[1][0][2] = dp[1][0][3] = 1;\n   for (int i = 1; i < n; ++i)\n     for (int j = 0; j <= t; ++j)\n       for (int k = 1; k <= 4; ++k)\n         for (int l = 1; l <= 4; ++l) {\n           if ((i == 1 && l > k) || (i != 1 && l != k)) {\n             int nj = j;\n             if (j % 2 && l < k)\n               ++nj;\n             else if (j % 2 == 0 && l > k)\n               ++nj;\n             dp[i + 1][nj][l] += dp[i][j][k];\n           }\n         }\n   int ans = 0;\n   for (int i = 1; i <= 4; ++i) ans += dp[n][t][i];\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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   multiset<long long int> s;\n   map<string, int> mp;\n   while (t--) {\n     char ch;\n     long long int x;\n     cin >> ch >> x;\n     string str(18, '0');\n     string temp = to_string(x);\n     int j = 17;\n     for (int i = ((int)(temp).size()) - 1; i >= 0; i--) {\n       if ((temp[i] - '0') % 2 != 0) {\n         str[j] = '1';\n       }\n       j--;\n     }\n     if (ch == '+') {\n       mp[str]++;\n     } else if (ch == '-') {\n       mp[str]--;\n     } else {\n       cout << mp[str] << '\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma warning(disable : 4996)\n #pragma comment(linker, '/STACK:666000000')\n using namespace std;\n const int INF = (1 << 30) - 1;\n const long double EPS = 1e-9;\n const long double PI = fabs(atan2(0.0, -1.0));\n int n;\n void load() { cin >> n; }\n const int SZ = 1010;\n int sv[SZ];\n int rec(const int v) {\n   if (v < SZ && -1 != sv[v]) return sv[v];\n   bool can[10];\n   int p9;\n   memset(can, false, sizeof(can));\n   {\n     int p = 0;\n     int tmp = v;\n     while (tmp != 0) {\n       can[tmp % 10] = true;\n       if (9 == tmp % 10) p9 = p;\n       tmp /= 10;\n       p *= 10;\n     }\n   }\n   if (v >= SZ) {\n     if (can[9] && p9 > 10) {\n       int cnt = 9 * (p9 / 10) - 8;\n       return cnt + rec(v - cnt * 9);\n     }\n     for (int i = 9; i >= 1; i--)\n       if (can[i]) return 1 + rec(v - i);\n   }\n   int res = INT_MAX;\n   for (int i = 1; i <= 9; i++)\n     if (can[i]) res = min(res, 1 + rec(v - i));\n   if (v < SZ) sv[v] = res;\n   return res;\n }\n void solve() {\n   memset(sv, -1, sizeof(sv));\n   sv[0] = 0;\n   int res = rec(n);\n   cout << res;\n }\n int main() {\n   load();\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5;\n map<int, int> dic;\n int n, a[N + 10], ma[N + 10], ma2[N + 10];\n int main() {\n   ios::sync_with_stdio(0), cin.tie(0);\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> a[i];\n   ma[1] = a[1];\n   ma2[1] = -1;\n   for (int i = 2; i <= n; i++) {\n     if (a[i] > ma[i - 1]) {\n       ma2[i] = ma[i - 1];\n       ma[i] = a[i];\n     } else {\n       ma[i] = ma[i - 1];\n       if (ma2[i - 1] < a[i]) {\n         ma2[i] = a[i];\n       } else\n         ma2[i] = ma2[i - 1];\n     }\n     if (a[i] != ma[i] && a[i] == ma2[i]) {\n       dic[ma[i]]++;\n     }\n   }\n   int tot = -1e6, idx = -1;\n   for (int i = 1; i <= n; i++) {\n     int temp = dic[a[i]];\n     if (a[i] == ma[i]) temp--;\n     if (temp > tot) {\n       tot = temp;\n       idx = a[i];\n     } else if (temp == tot) {\n       idx = min(idx, a[i]);\n     }\n   }\n   cout << idx << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[1000005] = {0};\n long long b[1000005] = {0};\n long long c[1000005] = {0};\n long long d[1000005] = {0};\n long long s;\n long long i, j = 0, l;\n long long count1 = 0;\n long long count2 = 0;\n long long count3 = 0;\n long long count4 = 0;\n long long ans = 0;\n bool cmp(long long aa, long long bb) { return aa > bb; }\n int main() {\n   long long n;\n   scanf('%lld\n', &n);\n   for (i = 0; i < n; i++) {\n     cin >> s >> j;\n     if (s == 11) {\n       a[count1++] = j;\n       ans += j;\n     } else if (s == 10) {\n       b[count2++] = j;\n     } else if (s == 1) {\n       c[count3++] = j;\n     } else {\n       d[count4++] = j;\n     }\n   }\n   sort(b, b + count2, cmp);\n   sort(c, c + count3, cmp);\n   for (i = 0; i < min(count2, count3); i++) ans += (b[i] + c[i]);\n   for (i = 0; i < abs(count2 - count3); i++) {\n     if (count3 > count2)\n       d[count4 + i] = c[min(count2, count3) + i];\n     else if (count3 < count2)\n       d[count4 + i] = b[min(count2, count3) + i];\n   }\n   count4 += abs(count2 - count3);\n   sort(d, d + count4, cmp);\n   for (i = 0; i < count1 && i < count4; i++) ans += d[i];\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[35], b[35], diff[35];\n int main() {\n   std::ios::sync_with_stdio(false);\n   int t;\n   t = 1;\n   while (t--) {\n     long long x, x1, val, val1, i, j, res = 0;\n     cout << '? 0 0' << endl;\n     cin >> x;\n     x1 = x;\n     if (x == 0) {\n       for (i = 0; i < 30; i++) {\n         val = (1 << i);\n         cout << '? ' << val << ' ' << 0 << endl;\n         cin >> x;\n         if (x == -1) {\n           res += (1 << i);\n         }\n       }\n       cout << '! ' << res << ' ' << res << endl;\n     } else {\n       {\n         x1 = x;\n         i = 29;\n         val = 0;\n         val1 = 0;\n         for (i = 29; i >= 0; i--) {\n           val += (1 << i);\n           val1 += (1 << i);\n           cout << '? ' << val << ' ' << val1 << endl;\n           cin >> x;\n           if (x != x1) {\n             diff[i] = 1;\n             val -= (1 << i);\n             if (x == -1) {\n               a[i] = 1;\n               b[i] = 0;\n             } else {\n               a[i] = 0;\n               b[i] = 1;\n             }\n             cout << '? ' << val << ' ' << val1 << endl;\n             cin >> x;\n             x1 = x;\n           } else {\n             diff[i] = 0;\n           }\n         }\n         for (i = 29; i >= 0; i--) {\n           val = 0;\n           val1 = 0;\n           if (diff[i]) {\n             continue;\n           }\n           for (j = 0; j < 30; j++) {\n             if (j == i) {\n               continue;\n             }\n             if (diff[j]) {\n               val += (1 << j);\n             }\n           }\n           {\n             val += (1 << i);\n             cout << '? ' << val << ' ' << val1 << endl;\n             cin >> x;\n             if (x == -1) {\n               a[i] = 1;\n               b[i] = 1;\n             } else {\n               a[i] = 0;\n               b[i] = 0;\n             }\n           }\n         }\n         val = 0;\n         val1 = 0;\n         for (i = 0; i < 30; i++) {\n           if (a[i]) {\n             val += (1 << i);\n           }\n           if (b[i]) {\n             val1 += (1 << i);\n           }\n         }\n         cout << '! ' << val << ' ' << val1 << endl;\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long int mod = 1e9 + 7;\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long int n, k;\n   cin >> n >> k;\n   long long int ans = 1;\n   while (k % 2 == 0) {\n     k = k / 2;\n     ans++;\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e4 + 10, mod = 1e9 + 7, M = 510;\n const double PI = 3.1415926535;\n long long res[40], p[40], ei[40], sum[N], cnt;\n double pre[N];\n int path[100];\n void dfs(int u, int s, long long va) {\n   if (u == -1) {\n     sum[s] = ((long long)sum[s] + va) % mod;\n     return;\n   }\n   for (int i = 0; i <= cnt; i++) {\n     path[i]++;\n     if (res[i] - path[i] + 1)\n       dfs(u - 1, s + i, (long long)va * (res[i] - path[i] + 1) % mod);\n     path[i]--;\n   }\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   vector<int> temp;\n   int t = n;\n   while (t) t /= 10, cnt++;\n   p[1] = 1;\n   for (int i = 2; i <= 11; i++) p[i] = p[i - 1] * 10;\n   ei[0] = 1;\n   for (int i = 1; i < 11; i++) ei[i] = ei[i - 1] * 8;\n   for (int i = 0; i < (1 << cnt); i++) {\n     vector<int> temp;\n     for (int j = 0; j < cnt; j++)\n       if (i >> j & 1) temp.push_back(j);\n     int len = temp.size();\n     for (int j = 0; j < 1 << len; j++) {\n       int a[15] = {0};\n       for (int k = 0; k < len; k++)\n         if (j >> k & 1)\n           a[temp[k]] = 7;\n         else\n           a[temp[k]] = 4;\n       long long f = p[cnt], va = 0;\n       for (long long k = cnt - 1, r = 1; k >= 0; k--, r *= 10)\n         va += (long long)a[k] * r;\n       if (va > n) continue;\n       for (int k = 0; k < cnt; k++) {\n         if (a[k]) {\n           f /= 10;\n           continue;\n         }\n         for (int r = 9; r >= 0; r--)\n           if ((long long)r * f + va <= n) {\n             a[k] = r, va = r * f + va;\n             break;\n           }\n         f /= 10;\n       }\n       long long num = 0, ans = 0;\n       for (int k = 0; k < cnt; k++) {\n         if (num < temp.size() && temp[num] == k) {\n           num++;\n           if (k == cnt - 1) ans++;\n           continue;\n         }\n         if (a[k] == 7 || a[k] == 4) {\n           int sum = cnt - 1 - k;\n           int ts = temp.size() - num;\n           int tnum = a[k] + 1;\n           if (a[k] == 4)\n             tnum--;\n           else\n             tnum -= 2;\n           ans = ans + ei[sum - ts] * (long long)tnum;\n           break;\n         } else {\n           int sum = cnt - 1 - k;\n           int ts = temp.size() - num;\n           int tnum = a[k] + 1;\n           if (a[k] > 7)\n             tnum -= 3;\n           else if (a[k] > 4)\n             tnum -= 2;\n           else\n             tnum--;\n           if (k == cnt - 1) tnum++;\n           ans = ans + ei[sum - ts] * (long long)tnum;\n         }\n       }\n       res[len] = (res[len] + (long long)ans);\n     }\n   }\n   res[0]--;\n   dfs(5, 0, 1);\n   long long ans = 0, pre = 0;\n   for (int i = 1; i <= cnt; i++) {\n     pre = pre + sum[i - 1];\n     ans = (ans + pre * res[i]) % mod;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int N, good;\n bool prime[100010];\n vector<int> fact, num, lis;\n int main() {\n   memset(prime, true, sizeof(prime));\n   for (int i = 2; i * i <= 100000; i++)\n     if (prime[i])\n       for (int j = 2; i * j <= 100000; j++) prime[i * j] = false;\n   for (int i = 2; i <= 100000; i++)\n     if (prime[i]) {\n       num.push_back(i);\n       lis.push_back(0);\n     }\n   scanf('%d', &N);\n   while (N--) {\n     scanf('%d', &good);\n     int temp = good;\n     fact.clear();\n     int longest = 0;\n     for (int i = 0; i < num.size() && num[i] * num[i] <= good; i++)\n       if (good % num[i] == 0) {\n         fact.push_back(i);\n         longest = max(longest, lis[i] + 1);\n         while (temp % num[i] == 0) temp /= num[i];\n       }\n     if (temp > 1) {\n       int i = lower_bound(num.begin(), num.end(), temp) - num.begin();\n       fact.push_back(i);\n       longest = max(longest, lis[i] + 1);\n     }\n     for (int i = 0; i < fact.size(); i++)\n       lis[fact[i]] = max(lis[fact[i]], longest);\n   }\n   int ans = 1;\n   for (int i = 0; i < num.size(); i++) ans = max(ans, lis[i]);\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2300;\n int dp[N], a[N], res = 0, n;\n void dfs(int u, int d) {\n   if (d == n) {\n     dp[u] = 0;\n     return;\n   }\n   int l = u * 2, r = l + 1;\n   dfs(l, d + 1);\n   dfs(r, d + 1);\n   int x = dp[l] + a[l], y = dp[r] + a[r];\n   if (x < y) swap(x, y);\n   dp[u] = x;\n   res += x - y;\n }\n int main() {\n   cin >> n;\n   for (int i = 2; i < (1 << n + 1); i++) {\n     scanf('%d', &a[i]);\n   }\n   dfs(1, 0);\n   cout << res << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, root, val, rem;\n int main() {\n   cin >> n;\n   root = floor((sqrt(1.0 + 8.0 * n) - 1.0) / 2.0);\n   val = root * (root + 1) / 2;\n   if (n == val) --root;\n   val = root * (root + 1) / 2;\n   rem = n - val;\n   cout << rem << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 1e5 + 2;\n const long long M = 1e6 + 2;\n const long long mod = 998244353;\n long long ar[N], fact[M], inv[M], cnt[N];\n long long binpow(long long x, long long y) {\n   long long tich = 1;\n   while (y) {\n     if (y & 1) {\n       tich *= x;\n       tich %= mod;\n     }\n     x *= x;\n     x %= mod;\n     y >>= 1;\n   }\n   return tich;\n }\n long long C(long long x, long long y) {\n   return ((fact[y] * inv[y - x]) % mod * inv[x]) % mod;\n }\n signed main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   long long n, i, j, k, l, ans = 0, sum = 0;\n   cin >> n;\n   for (i = 1; i <= n; i++) {\n     cin >> ar[i];\n     cnt[ar[i] % n]++;\n     sum += ar[i];\n   }\n   fact[0] = 1;\n   for (i = 1; i < M - 1; i++) {\n     fact[i] = (fact[i - 1] * i) % mod;\n   }\n   inv[M - 2] = binpow(fact[M - 2], mod - 2);\n   for (i = M - 2; i > 0; i--) {\n     inv[i - 1] = (inv[i] * i) % mod;\n   }\n   sort(ar + 1, ar + 1 + n);\n   long long pos = 0;\n   for (i = 1; i < n; i++) {\n     if (ar[i + 1] < i) {\n       pos = i;\n       break;\n     }\n   }\n   if (pos) {\n     j = 1;\n     for (i = 0; i < pos; i++) {\n       while (ar[j] < i) {\n         j++;\n       }\n       ans += C(n - 1, i - (j - 1) + n - 1);\n       if (ans >= mod) {\n         ans -= mod;\n       }\n     }\n     cout << ans;\n   } else {\n     for (i = 1; i <= n; i++) {\n       sum -= ar[i] % n;\n     }\n     sum /= n;\n     for (i = 1; i <= n; i++) {\n       sum = sum + cnt[n - i] - 1;\n       if (sum >= 0) {\n         ans += C(n - 1, sum + n - 1);\n         if (ans >= mod) {\n           ans -= mod;\n         }\n       }\n     }\n     cout << ans;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   vector<pair<int, int>> v;\n   for (int i = 0; i < m; i++) {\n     int a, b;\n     cin >> a >> b;\n     v.push_back(make_pair(a, b));\n   }\n   int x1 = v[0].first;\n   int y1 = v[0].second;\n   vector<int> p1, p2;\n   for (int i = 1; i < m; i++) {\n     int a = v[i].first;\n     int b = v[i].second;\n     if (x1 != a && x1 != b) {\n       p1.push_back(i);\n     }\n     if (y1 != a && y1 != b) {\n       p2.push_back(i);\n     }\n   }\n   if (p1.size() == 0 || p2.size() == 0) {\n     cout << 'YES' << endl;\n     return 0;\n   }\n   x1 = v[p1[0]].first;\n   y1 = v[p1[0]].second;\n   int c1 = 0, c2 = 0, c3 = 0, c4 = 0;\n   for (int i = 1; i < p1.size(); i++) {\n     int a = v[p1[i]].first;\n     int b = v[p1[i]].second;\n     if (x1 != a && x1 != b) {\n       c1++;\n     }\n     if (y1 != a && y1 != b) {\n       c2++;\n     }\n   }\n   x1 = v[p2[0]].first;\n   y1 = v[p2[0]].second;\n   for (int i = 1; i < p2.size(); i++) {\n     int a = v[p2[i]].first;\n     int b = v[p2[i]].second;\n     if (x1 != a && x1 != b) {\n       c3++;\n     }\n     if (y1 != a && y1 != b) {\n       c4++;\n     }\n   }\n   if (c1 == 0 || c2 == 0) {\n     cout << 'YES' << endl;\n   } else if (c3 == 0 || c4 == 0) {\n     cout << 'YES' << endl;\n   } else {\n     cout << 'NO' << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline bool chmax(T &a, T b) {\n   return a < b ? (a = b, 1) : 0;\n }\n template <class T>\n inline bool chmin(T &a, T b) {\n   return a > b ? (a = b, 1) : 0;\n }\n int main() {\n   int n, m;\n   cin >> n >> m;\n   map<int, vector<int>> obs;\n   int left = n;\n   while (m--) {\n     int x, y;\n     cin >> x >> y;\n     if (x == 1)\n       chmin(left, y - 1);\n     else\n       obs[x].emplace_back(y);\n   }\n   vector<pair<int, int>> segs = {{1, left}};\n   int prv = 1;\n   for (auto &p : obs) {\n     auto &v = p.second;\n     sort(begin(v), end(v));\n     if (p.first != prv + 1) {\n       segs.assign(1, {segs.begin()->first, n});\n     }\n     vector<pair<int, int>> segs2;\n     auto it = segs.begin();\n     int p_v = 0, sz_v = v.size();\n     int lst = -1;\n     while (it != segs.end() && p_v < sz_v) {\n       chmax(it->first, lst);\n       if (it->first > it->second) {\n         it++;\n         continue;\n       }\n       if (v[p_v] <= it->first) {\n         it->first += v[p_v++] == it->first;\n         continue;\n       }\n       segs2.emplace_back(it->first, v[p_v] - 1);\n       lst = v[p_v++] + 1;\n     }\n     if (p_v == sz_v) {\n       while (it != segs.end()) {\n         chmax(it->first, lst);\n         if (it->first <= it->second) break;\n         it++;\n       }\n       if (it != segs.end()) {\n         segs2.emplace_back(it->first, n);\n       }\n     }\n     if ((segs = segs2).empty()) return !(cout << -1 << endl);\n     prv = p.first;\n   }\n   if (prv < n) {\n     segs.assign(1, {segs.begin()->first, n});\n   }\n   cout << (segs.rbegin()->second == n ? (n - 1) * 2 : -1) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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     long long n, k;\n     cin >> n >> k;\n     if (n > k)\n       cout << k << endl;\n     else {\n       int ne = (k - 1) / (n - 1);\n       cout << k + ne << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int mat[110][110];\n int main() {\n   int n, k, i, j;\n   scanf('%d %d', &n, &k);\n   if (n * n < k) {\n     printf('-1\n');\n     return 0;\n   }\n   for (i = 0; i < n; i++) {\n     for (j = i; j < n; j++) {\n       if (i == j) {\n         if (k > 0) {\n           k--;\n           mat[i][j] = 1;\n         } else\n           break;\n       } else {\n         if (k >= 2) {\n           mat[i][j] = 1;\n           mat[j][i] = 1;\n           k = k - 2;\n         } else if (k == 0)\n           break;\n       }\n     }\n   }\n   for (i = 0; i < n; i++) {\n     for (j = 0; j < n; j++) {\n       printf('%d ', mat[i][j]);\n     }\n     printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int n, k;\n bool visited[101][101][1010];\n double ar[101], dp[101][101][1010];\n double F(int i, int j, int k) {\n   if (i > j) return 1.0 - F(j, i, k);\n   if (k == 0) return 1.0;\n   if (visited[i][j][k]) return dp[i][j][k];\n   int a, b, c, d, l;\n   double x, y, p = 1.0 / ((n * (n + 1)) >> 1), res = 0.0;\n   for (a = 0; a < n; a++) {\n     for (b = a; b < n; b++) {\n       c = i, d = j;\n       if (c >= a && c <= b) c = b - (c - a);\n       if (d >= a && d <= b) d = b - (d - a);\n       res += (p * F(c, d, k - 1));\n     }\n   }\n   visited[i][j][k] = true;\n   return (dp[i][j][k] = res);\n }\n int main() {\n   int i, j, l;\n   while (scanf('%d %d', &n, &k) != EOF) {\n     if (k > 1000) k = 1000;\n     for (i = 0; i < n; i++) scanf('%d', &ar[i]);\n     memset(visited, 0, sizeof(visited));\n     double res = 0.0;\n     for (i = 0; i < n; i++) {\n       for (j = i + 1; j < n; j++) {\n         if (ar[i] < ar[j])\n           res += (1.0 - F(i, j, k));\n         else\n           res += F(i, j, k);\n       }\n     }\n     printf('%0.12f\n', res + 1e-15);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\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<long long> 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 <bits/stdc++.h>\n using namespace std;\n void dfs(set<int> &temp, list<int> adj[], vector<bool> &v, int s, int &t1,\n          int &t2, vector<int> b, vector<int> w) {\n   v[s] = true;\n   list<int>::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<int> adj[1001];\n int main() {\n   int n, m, weight;\n   cin >> n >> m >> weight;\n   vector<int> b(n + 1);\n   vector<int> 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<bool> v(n + 1, false);\n   vector<set<int> > arr;\n   vector<int> tw;\n   vector<int> tb;\n   for (int i = 1; i <= n; i++) {\n     if (!v[i]) {\n       set<int> 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<vector<int> > dp(arr.size() + 1, vector<int>(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<int>::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 <bits/stdc++.h>\n using namespace std;\n long long n, m, ans, x, i, j, s;\n double a[100], b[100];\n map<double, pair<long long, long long> > mp;\n map<double, pair<long long, long long> >::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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n constexpr long long INF = numeric_limits<long long>::max() / 4;\n constexpr long long n_max = 2e5 + 10;\n template <typename A, typename B>\n string to_string(pair<A, B> 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 <size_t N>\n string to_string(bitset<N> v) {\n   string res = '';\n   for (size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);\n   return res;\n }\n template <typename A>\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 <typename A, typename B>\n string to_string(pair<A, B> p) {\n   return '(' + to_string(p.first) + ', ' + to_string(p.second) + ')';\n }\n void debug_out() { cerr << endl; }\n template <typename Head, typename... Tail>\n void debug_out(Head H, Tail... T) {\n   cerr << ' ' << to_string(H);\n   debug_out(T...);\n }\n template <class T>\n bool chmax(T &a, T b) {\n   if (a < b) {\n     a = b;\n     return true;\n   }\n   return false;\n }\n template <class T>\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<long long> a(n);\n     for (long long i = 0; i < (long long)(n); i++) cin >> a[i];\n     vector<long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline void dmin(T& x, T y) {\n   y < x ? x = y : 0;\n }\n template <class T>\n inline void dmax(T& x, T y) {\n   y > x ? x = y : 0;\n }\n template <class T>\n inline void dmin(T& x, vector<T> y) {\n   for (auto t : y) t < x ? x = t : 0;\n }\n template <class T>\n inline void dmax(T& x, vector<T> y) {\n   for (auto t : y) t > x ? x = t : 0;\n }\n const int N = 5 + 1e6;\n const long long INF = -2e18;\n int n, k;\n long long gk(int x, long long a[], int i, long long f) {\n   return a[x] + (i - x) / 3 * f;\n }\n bool cmp(int x, int y, long long a[], int i, long long f) {\n   return gk(x, a, i, f) > gk(y, a, i, f);\n }\n void opera(long long a[], int n, long long f, int k) {\n   static long long b[N];\n   static long long q[3][N], left[3], right[3];\n   for (int i = 0; i < 3; ++i) left[i] = 1, right[i] = 0;\n   for (int i = 0; i < n; ++i) b[i] = INF;\n   for (int i = 0; i < n; ++i) {\n     int t = i % 3;\n     while (left[t] <= right[t] && q[t][left[t]] < i - 3 * k) ++left[t];\n     while (left[t] <= right[t] && cmp(i, q[t][right[t]], a, i, f)) --right[t];\n     q[t][++right[t]] = i;\n     b[i] = gk(q[t][left[t]], a, i, f);\n   }\n   for (int i = 0; i < n; ++i) a[i] = b[i];\n }\n void opera2(long long a[], int n, long long f, int k) {\n   static long long f1[N], f2[N];\n   for (int i = 0; i < n; ++i) {\n     f1[i] = f2[i] = a[i];\n     for (int j = 1; j < 10 && i - j >= 0; ++j) f2[i] = max(f2[i], a[i - j]);\n   }\n   opera(f1, n, f, 3 * k);\n   opera(f2, n, f, 3 * (k - 1));\n   for (int i = 0; i < n; ++i) a[i] = max(f1[i], f2[i]);\n }\n long long a[N], b[N];\n int main() {\n   int k;\n   scanf('%d', &k);\n   long long f[6];\n   for (int i = 0; i < 6; ++i) scanf('%lld', &f[i]);\n   a[0] = 0;\n   n = 1;\n   for (int i = 5; i >= 0; --i) {\n     for (int j = 0; j < 10 * n; ++j) b[j] = INF;\n     for (int j = 0; j < n; ++j) b[j * 10] = a[j];\n     n *= 10;\n     opera2(b, n, f[i], k);\n     for (int j = 0; j < n; ++j) a[j] = b[j];\n   }\n   int q;\n   scanf('%d', &q);\n   while (q--) {\n     int x;\n     scanf('%d', &x);\n     printf('%lld\n', a[x]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     int arr[n];\n     for (int i = 0; i < n; i++) {\n       cin >> arr[i];\n     }\n     sort(arr, arr + n);\n     bool f = true;\n     for (int j = 1; j < n; j++) {\n       int diff = abs(arr[j] - arr[j - 1]);\n       if (diff > 1) {\n         f = false;\n       }\n     }\n     if (f) {\n       cout << 'YES\n';\n     } else {\n       cout << 'NO\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a, b, k, t, suan, d[1100002], f[1110000];\n int main() {\n   cin >> a >> b >> k >> t;\n   int shu = k * 2 * t;\n   d[shu] = 1;\n   int y = d[0];\n   for (int i = 1; i <= t * 2; i++) {\n     f[0] = y;\n     for (int j = 1; j <= shu * 2 + k; j++) {\n       f[j] = (f[j - 1] + d[j]) % 1000000007;\n     }\n     for (int j = 0; j <= k; j++) {\n       d[j] = f[j + k];\n     }\n     for (int j = k + 1; j <= shu * 2; j++) {\n       d[j] = (f[j + k] - f[j - 1 - k] + 1000000007) % 1000000007;\n     }\n   }\n   for (int i = shu - a + b + 1; i <= shu * 2; i++) {\n     suan = (suan + d[i]) % 1000000007;\n   }\n   cout << suan;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int modulo = 1000000007;\n const int limite = 1000001;\n long long int elev[limite];\n int ocupado[limite];\n int main() {\n   ios_base::sync_with_stdio(false);\n   int n, m, k;\n   cin >> n >> m >> k;\n   elev[0] = 1;\n   for (int i = 1; i < limite; i++) elev[i] = (elev[i - 1] * 2) % modulo;\n   int ini = 0;\n   int fin = n + 1;\n   int inf = k + 2;\n   int sup = n;\n   for (int i = 0; i < m; i++) {\n     int u, v;\n     cin >> u >> v;\n     if (v == u + 1)\n       ;\n     else if (v == u + k + 1) {\n       ocupado[v] = 1;\n       ini = max(ini, u);\n       fin = min(fin, v);\n       inf = max(inf, u + 1);\n       sup = min(sup, v + k);\n     } else {\n       cout << 0 << endl;\n       exit(0);\n     }\n   }\n   if (fin <= ini) {\n     cout << 0 << endl;\n     exit(0);\n   }\n   int libres = 0;\n   long long int maneras = 1;\n   for (int i = inf; i <= sup; i++) {\n     if (not ocupado[i]) {\n       maneras = (maneras + elev[libres]) % modulo;\n       libres++;\n     }\n     if (i - k >= inf and not ocupado[i - k]) libres--;\n   }\n   cout << maneras << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool v[6];\n int a[100009][6], maxx = -1, t;\n long long m = 1e9 + 7;\n struct pi {\n   long long ah[60][60];\n };\n pi multi(pi x, pi y) {\n   pi z;\n   for (int i = 1; i <= t; i++) {\n     for (int j = 1; j <= t; j++) {\n       z.ah[i][j] = 0;\n       for (int k = 1; k <= t; k++)\n         z.ah[i][j] = (z.ah[i][j] % m + x.ah[i][k] % m * y.ah[k][j] % m) % m;\n       z.ah[i][j] %= m;\n     }\n   }\n   return z;\n }\n pi quimul(pi x, long long int n) {\n   pi an;\n   for (int i = 1; i <= t; i++) an.ah[i][i] = 1;\n   for (; n; n >>= 1) {\n     if (n & 1) an = multi(an, x);\n     x = multi(x, x);\n   }\n   return an;\n }\n int main() {\n   long long n;\n   int x, v, p[600], zh[90][90];\n   char c = 'a', u;\n   for (int i = 1; i <= 52; i++)\n     for (int j = 1; j <= 52; j++) zh[i][j] = 1;\n   for (int i = 1; i <= 26; i++) p[(int)c + i - 1] = i;\n   c = 'A';\n   for (int i = 27; i <= 52; i++) p[(int)c + i - 27] = i;\n   cin >> n >> t >> v;\n   for (int i = 0; i < v; i++) {\n     scanf(' %c %c', &c, &u);\n     zh[p[(int)c]][p[(int)u]] = 0;\n   }\n   pi ans;\n   for (int i = 1; i <= t; i++)\n     for (int j = 1; j <= t; j++) ans.ah[i][j] = zh[i][j];\n   ans = quimul(ans, n - 1);\n   long long int pp = 0;\n   for (int i = 1; i <= t; i++)\n     for (int j = 1; j <= t; j++) pp = (pp + ans.ah[i][j]) % m;\n   cout << (pp + m) % m << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a, b, c, n, i, j, money;\n   cin >> a >> b >> c;\n   cin >> n;\n   int m[n];\n   money = 0;\n   for (i = 0; i < n; i++) {\n     cin >> m[i];\n     if (m[i] > b && m[i] < c) money = money + 1;\n   }\n   if (a > b && a < c)\n     cout << money;\n   else\n     cout << 0;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n void display(T a[], int size) {\n   for (int i = 0; i < size; i++) {\n     cout << a[i] << ' ';\n   }\n   cout << endl;\n }\n void display(vector<pair<int, int> > a) {\n   for (int i = 0; i < a.size(); i++) {\n     cout << '(' << a[i].first << ',' << a[i].second << ')'\n          << ' ';\n   }\n   cout << endl;\n }\n void display(const vector<int>& a) {\n   for (int i = 0; i < a.size(); i++) {\n     cout << a[i];\n     if (i == a.size() - 1)\n       cout << endl;\n     else\n       cout << ' ';\n   }\n }\n template <typename T>\n void initialise(T a[], T value, int length) {\n   for (int i = 0; i < length; i++) a[i] = value;\n }\n template <typename T>\n void initialise(vector<T>& a, T value) {\n   for (int i = 0; i < a.size(); i++) a[i] = value;\n }\n bool compare(pair<int, int> a, pair<int, int> b) {\n   if (a.first != b.first)\n     return a.first < b.first;\n   else\n     return a.second < b.second;\n }\n int max(int a[], int n) {\n   int max = -1000000000;\n   for (int i = 0; i < n; i++) {\n     if (a[i] > max) max = a[i];\n   }\n   return max;\n }\n bool find(string a[], string s, int n) {\n   int left = 0;\n   int right = n - 1;\n   while (left < right) {\n     int mid = (left + right) / 2;\n     if (s.compare(a[mid]) == 0)\n       return true;\n     else if (s.compare(a[mid]) < 0) {\n       right = mid;\n     } else {\n       left = mid + 1;\n     }\n   }\n   return false;\n }\n void factor(int a[], int base, int num, int n) {\n   for (int i = n - 1; i >= 0; i--) {\n     a[i] = num % base;\n     num = num / base;\n   }\n }\n int findLength(int n, int base) {\n   int i = 0;\n   while (n > 0) {\n     i++;\n     n = n / base;\n   }\n   return i;\n }\n int gcd(int a, int b) {\n   while (a % b != 0 && b % a != 0) {\n     if (b > a) {\n       b = b % a;\n     } else if (a > b) {\n       a = a % b;\n     }\n   }\n   if (a <= b)\n     return a;\n   else\n     return b;\n }\n int main() {\n   int n;\n   cin >> n;\n   int dir[n];\n   int step[n];\n   for (int i = 0; i < n; i++) {\n     char now;\n     cin >> now;\n     if (now == '>')\n       dir[i] = 1;\n     else\n       dir[i] = -1;\n   }\n   for (int i = 0; i < n; i++) {\n     cin >> step[i];\n   }\n   int trace[n];\n   initialise(trace, 0, n);\n   int curr = 0;\n   while (true) {\n     if (trace[curr] == 1) {\n       cout << 'INFINITE' << endl;\n       break;\n     } else {\n       trace[curr] = 1;\n       curr = curr + dir[curr] * step[curr];\n       if (curr >= n || curr < 0) {\n         cout << 'FINITE' << endl;\n         break;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int N, dp[100005][3], MOD = 1000000007;\n char s[2][100005];\n long long ans = 1;\n int main() {\n   scanf('%d%s%s', &N, s[0], s[1]);\n   for (int i = 0; i < N; ++i) {\n     if (s[0][i] == '?') ans = (((ans * 10) % (MOD) + (MOD)) % (MOD));\n     if (s[1][i] == '?') ans = (((ans * 10) % (MOD) + (MOD)) % (MOD));\n     for (int x = 0; x < 10; ++x) {\n       for (int y = 0; y < 10; ++y) {\n         if ((s[0][i] == '?' || s[0][i] == x + '0') &&\n             (s[1][i] == '?' || s[1][i] == y + '0')) {\n           if (x >= y) {\n             dp[i][0] =\n                 (((dp[i][0] + (i ? dp[i - 1][0] : 1)) % (MOD) + (MOD)) % (MOD));\n           }\n           if (x <= y) {\n             dp[i][1] =\n                 (((dp[i][1] + (i ? dp[i - 1][1] : 1)) % (MOD) + (MOD)) % (MOD));\n           }\n           if (x == y) {\n             dp[i][2] =\n                 (((dp[i][2] + (i ? dp[i - 1][2] : 1)) % (MOD) + (MOD)) % (MOD));\n           }\n         }\n       }\n     }\n   }\n   if (N == 1)\n     puts('0');\n   else\n     printf(\n         '%d\n',\n         (((ans - dp[N - 1][0] - dp[N - 1][1] + dp[N - 1][2]) % (MOD) + (MOD)) %\n          (MOD)));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n, c = 0, d = 0, k;\n   string str;\n   cin >> n >> str;\n   for (int i = 0; i < n; i++) {\n     if (str[i] == '-') c++;\n   }\n   if (c == n) {\n     cout << 0 << endl;\n     return 0;\n   } else if (str[0] == '-') {\n     for (int i = 0; i < n; i++) {\n       if (str[i] == '-') {\n         continue;\n       } else {\n         k = i;\n         break;\n       }\n     }\n     for (int i = k; i < n; i++) {\n       if (str[i] == '+')\n         d += 1;\n       else {\n         d -= 1;\n         if (d < 0) d = 0;\n       }\n     }\n   } else {\n     for (int i = 0; i < n; i++) {\n       if (str[i] == '+')\n         d += 1;\n       else {\n         d -= 1;\n         if (d < 0) d = 0;\n       }\n     }\n   }\n   cout << d << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int M;\n const int MAX = 100001;\n vector<int> _size, marked, _pow, _ipow;\n vector<pair<int, int> > adjList[MAX + 1];\n int getSize(int u, int p = -1) {\n   _size[u] = 1;\n   for (auto [v, w] : adjList[u])\n     if (v != p && !marked[v]) _size[u] += getSize(v, u);\n   return _size[u];\n }\n int getCentroid(int u, int p, int n) {\n   for (auto [v, w] : adjList[u])\n     if (v != p && !marked[v] && _size[v] * 2 > n) return getCentroid(v, u, n);\n   return u;\n }\n void add(unordered_map<int, int> &aux, int u, int p, int lvl, int rem) {\n   aux[rem]++;\n   for (auto [v, w] : adjList[u])\n     if (v != p && !marked[v])\n       add(aux, v, u, lvl + 1, (int(1LL * w * _pow[lvl] % M) + rem) % M);\n }\n void remove(unordered_map<int, int> &aux, int u, int p, int lvl, int rem) {\n   aux[rem]--;\n   for (auto [v, w] : adjList[u])\n     if (v != p && !marked[v])\n       remove(aux, v, u, lvl + 1, (int(1LL * w * _pow[lvl] % M) + rem) % M);\n }\n long long count(unordered_map<int, int> &aux, int u, int p, int lvl, int rem) {\n   int nxt = int(1LL * _ipow[lvl] * (M - rem) % M);\n   long long ans = aux[nxt];\n   for (auto [v, w] : adjList[u])\n     if (v != p && !marked[v])\n       ans += count(aux, v, u, lvl + 1, (rem * 10LL + w) % M);\n   return ans;\n }\n long long solve(int u) {\n   int N = getSize(u);\n   u = getCentroid(u, -1, N);\n   marked[u] = 1;\n   unordered_map<int, int> aux;\n   aux[0] = 1;\n   for (auto [v, w] : adjList[u])\n     if (!marked[v]) add(aux, v, u, 1, w % M);\n   long long ans = aux[0] - 1;\n   for (auto [v, w] : adjList[u])\n     if (!marked[v]) {\n       remove(aux, v, u, 1, w % M);\n       ans += count(aux, v, u, 1, w % M);\n       add(aux, v, u, 1, w % M);\n     }\n   aux.clear();\n   for (auto [v, w] : adjList[u])\n     if (!marked[v]) ans += solve(v);\n   return ans;\n }\n int gcd(int a, int b, int &x, int &y) {\n   if (b == 0) {\n     x = 1;\n     y = 0;\n     return a;\n   }\n   int x1, y1;\n   int d = gcd(b, a % b, x1, y1);\n   x = y1;\n   y = x1 - y1 * (a / b);\n   return d;\n }\n int getInv() {\n   int x, y;\n   int g = gcd(10, M, x, y);\n   assert(g == 1);\n   return (x % M + M) % M;\n }\n int main() {\n   ios_base ::sync_with_stdio(false);\n   cin.tie(nullptr);\n   int n;\n   cin >> n >> M;\n   _size = vector<int>(n), _pow = vector<int>(n + 1, 1),\n   _ipow = vector<int>(n + 1, 1), marked = vector<int>(n + 1);\n   _ipow[1] = getInv();\n   _pow[1] = 10;\n   for (int i = 2; i <= n; i++) {\n     _pow[i] = int(1LL * _pow[i - 1] * 10 % M);\n     _ipow[i] = int(1LL * _ipow[i - 1] * _ipow[1] % M);\n   }\n   for (int i = 0; i < n - 1; i++) {\n     int u, v, w;\n     cin >> u >> v >> w;\n     adjList[u].push_back({v, w});\n     adjList[v].push_back({u, w});\n   }\n   cout << solve(0) << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e6 + 100, M = 1e6 + 100;\n int n, up[N], down[M], nei[M][2];\n int lim;\n bool mark[M], bad[M];\n vector<int> vec;\n int f(int a) { return lower_bound(vec.begin(), vec.end(), a) - vec.begin(); }\n bool dfs(int v) {\n   mark[v] = true;\n   for (int i = 0; i < 2 && nei[v][i] <= lim; i++) {\n     int u = nei[v][i];\n     if (up[u] == -1 || (mark[up[u]] == false && dfs(up[u]))) {\n       up[u] = v;\n       down[v] = u;\n       return true;\n     }\n   }\n   return false;\n }\n bool ok(int X) {\n   lim = X;\n   fill(up, up + N, -1);\n   fill(down, down + M, -1);\n   memset(bad, false, sizeof bad);\n   int matching = 0;\n   bool done = false;\n   for (int v = 0; v < n; v++)\n     if (nei[v][0] > lim)\n       return false;\n     else if (nei[v][1] > lim) {\n       if (up[nei[v][0]] != -1) return false;\n       down[v] = nei[v][0];\n       up[nei[v][0]] = v;\n       bad[v] = true;\n       matching++;\n     }\n   while (done == false) {\n     done = true;\n     copy(bad, bad + n, mark);\n     for (int v = 0; v < n; v++)\n       if (mark[v] == false && down[v] == -1 && dfs(v)) {\n         matching++;\n         done = false;\n       }\n   }\n   return matching == n;\n }\n int main() {\n   ios::sync_with_stdio(false), cin.tie(0);\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> nei[i][0] >> nei[i][1];\n     vec.push_back(nei[i][0]);\n     vec.push_back(nei[i][1]);\n   }\n   sort(vec.begin(), vec.end());\n   vec.resize(unique(vec.begin(), vec.end()) - vec.begin());\n   for (int i = 0; i < n; i++)\n     nei[i][0] = f(nei[i][0]), nei[i][1] = f(nei[i][1]);\n   if (ok(vec.size() - 1) == false) {\n     cout << -1;\n     return 0;\n   }\n   if (ok(vec.size() - 2) == false) {\n     cout << vec.back();\n     return 0;\n   }\n   int l = -1, r = vec.size() - 1;\n   while (r - l > 1) {\n     if (ok((l + r) >> 1))\n       r = lim;\n     else\n       l = lim;\n   }\n   cout << vec[r];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int val[200007], add[200007];\n int main() {\n   int n, t, a, x, k, l = 1;\n   long long sum = 0;\n   scanf('%d', &n);\n   for (int i = 0; i < n; ++i) {\n     scanf('%d', &t);\n     if (t == 1) {\n       scanf('%d%d', &a, &x);\n       add[a] += x;\n       sum += a * x;\n     } else if (t == 2) {\n       scanf('%d', &k);\n       val[++l] = k;\n       sum += val[l];\n     } else if (l > 1) {\n       sum -= val[l];\n       sum -= add[l];\n       add[l - 1] += add[l];\n       add[l] = 0;\n       --l;\n     }\n     printf('%.6lf\n', (double)sum / l);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n constexpr int N = 2e5 + 10;\n long long n, w, k, happy[N], nice, t[N], mytime, ans;\n bool in[N];\n pair<int, int> lowest;\n set<pair<int, int>> st;\n queue<int> q;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n >> w >> k;\n   for (int i = 0; i < n; i++) cin >> happy[i];\n   for (int i = 0; i < n; i++) cin >> t[i];\n   for (int i = n - 1; ~i; i--) {\n     st.insert({t[i], -i});\n     if ((int)st.size() == w) {\n       lowest = *st.begin();\n       mytime += (t[i] + 1) / 2;\n       in[i] = true;\n     } else if ((int)st.size() > w) {\n       if (t[i] >= lowest.first) {\n         in[-lowest.second] = false;\n         mytime += (t[i] + 1) / 2;\n         mytime -= (lowest.first + 1) / 2;\n         mytime += lowest.first;\n         lowest = *st.upper_bound(lowest);\n         in[i] = true;\n       } else\n         mytime += t[i];\n     } else {\n       in[i] = true;\n       mytime += (t[i] + 1) / 2;\n     }\n     nice += happy[i];\n     q.push(i);\n     while (mytime > k) {\n       nice -= happy[q.front()];\n       if (in[q.front()]) {\n         mytime -= (t[q.front()] + 1) / 2;\n         in[q.front()] = false;\n         st.erase({t[q.front()], -q.front()});\n         if ((int)st.size() >= w) {\n           lowest = *(--st.lower_bound(lowest));\n           in[-lowest.second] = true;\n           mytime -= lowest.first;\n           mytime += (lowest.first + 1) / 2;\n         }\n       } else {\n         mytime -= t[q.front()];\n         st.erase({t[q.front()], -q.front()});\n       }\n       q.pop();\n     }\n     ans = max(ans, nice);\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline void speedUp() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n }\n long long int t, n, m, p[100005], q[100005], Podd, Peven, Qodd, Qeven, tot;\n int main() {\n   speedUp();\n   int t, n;\n   cin >> t;\n   while (t--) {\n     tot = Podd = Peven = Qodd = Qeven = 0;\n     cin >> n;\n     for (int i = 1; i <= n; i++) {\n       cin >> p[i];\n       if (p[i] % 2 == 0)\n         Peven++;\n       else\n         Podd++;\n     }\n     cin >> m;\n     for (int i = 1; i <= m; i++) {\n       cin >> q[i];\n       if (q[i] % 2 == 0)\n         Qeven++;\n       else\n         Qodd++;\n     }\n     for (int i = 1; i <= n; i++) {\n       if (p[i] % 2 == 0)\n         tot += Qeven;\n       else\n         tot += Qodd;\n     }\n     cout << tot << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main(void) {\n   int n;\n   scanf('%d', &n);\n   int v[n];\n   for (int i = 0; i < n; i++) scanf('%d', v + i);\n   if (n > 2) {\n     for (int i = 0; i + 3 <= n; i++) {\n       int a = v[i], b = v[i + 1], c = v[i + 2];\n       int ans1 = -1, ans2 = -1;\n       set<int> ms;\n       ms.insert(a);\n       ms.insert(b);\n       ms.insert(c);\n       if (ms.size() == 1)\n         continue;\n       else if (ms.size() == 3) {\n         if (a == *ms.begin())\n           ans1 = i, ans2 = i + 1;\n         else if (a == *(++ms.begin()))\n           ans1 = i, ans2 = i + 2;\n         else if (a == *ms.rbegin())\n           ans1 = i, ans2 = i + 1;\n       } else if (ms.size() == 2) {\n         if (a == c) {\n           int d = -1;\n           if (i > 0) {\n             d = v[i - 1];\n             if (d != a)\n               ans1 = i - 1, ans2 = i;\n             else\n               ans1 = i, ans2 = i + 1;\n           } else if (i + 3 < n) {\n             d = v[i + 3];\n             if (d != a)\n               ans1 = i + 2, ans2 = i + 3;\n             else\n               ans1 = i + 1, ans2 = i + 2;\n           } else\n             continue;\n         } else if (a == b)\n           ans1 = i + 1, ans2 = i + 2;\n         else if (b == c)\n           ans1 = i, ans2 = i + 1;\n       }\n       printf('%d %d\n', ans1 + 1, ans2 + 1);\n       return 0;\n     }\n   }\n   printf('-1\n');\n   return (0);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double eps = 1e-2;\n struct cplx {\n   double x, y;\n   cplx(double x1 = 0, double x2 = 0) { x = x1, y = x2; }\n } g[2000001], f[2000001];\n cplx operator+(cplx a, cplx b) { return cplx(a.x + b.x, a.y + b.y); }\n cplx operator-(cplx a, cplx b) { return cplx(a.x - b.x, a.y - b.y); }\n cplx operator*(cplx a, cplx b) {\n   return cplx(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x);\n }\n void swap(cplx &a, cplx &b) { swap(a.x, b.x), swap(a.y, b.y); }\n int a[2000001], b[2000001];\n int r[2000001];\n const double Pi = acos(-1);\n void fft(cplx f[], int op, int n) {\n   for (int i = 0; i < n; i++)\n     if (i < r[i]) swap(f[i], f[r[i]]);\n   for (int w = 2; w <= n; w <<= 1) {\n     int len = w / 2;\n     cplx tmp(cos(Pi / len), op * sin(Pi / len));\n     for (int k = 0; k < n; k += w) {\n       cplx buf(1, 0);\n       for (int l = k; l < k + len; l++) {\n         cplx tt = f[len + l] * buf;\n         f[len + l] = f[l] - tt;\n         f[l] = f[l] + tt;\n         buf = buf * tmp;\n       }\n     }\n   }\n   if (op == -1) {\n     for (int i = 0; i < n; i++) f[i].x /= n, f[i].y /= n;\n   }\n }\n char p[2000001];\n char q[2000001];\n int res[2000001];\n int l1, l2, k, n, m;\n void solve(char c) {\n   for (int i = 0; i <= n; i++) f[i].x = f[i].y = g[i].x = g[i].y = 0;\n   int far = -1;\n   for (int i = 0; i < l1; i++) {\n     if (p[i] == c) far = i + k;\n     if (i <= far) f[i].x = 1;\n   }\n   far = l1;\n   for (int i = l1 - 1; i >= 0; i--) {\n     if (p[i] == c) far = i - k;\n     if (i >= far) f[i].x = 1;\n   }\n   for (int i = 0; i < l2; i++)\n     if (q[i] == c) g[i].x = 1;\n   fft(f, 1, n);\n   fft(g, 1, n);\n   for (int i = 0; i < n; i++) f[i] = f[i] * g[i];\n   fft(f, -1, n);\n   for (int i = 0; i < n; i++) res[i] += (int)(f[i].x + eps);\n }\n signed main() {\n   int ans = 0;\n   scanf('%d%d%d', &l1, &l2, &k);\n   cin >> p;\n   cin >> q;\n   reverse(p, p + l1);\n   n = l1, m = l2;\n   for (m += n, n = 1; n <= m; n <<= 1)\n     ;\n   for (int i = 0; i < n; i++) r[i] = (r[i >> 1] >> 1) | ((i & 1) ? n >> 1 : 0);\n   solve('A');\n   solve('T');\n   solve('G');\n   solve('C');\n   for (int i = 0; i <= l1 - l2; i++)\n     if (res[l1 - i - 1] >= l2) ans++;\n   printf('%d', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n struct edge {\n   int to, nxt;\n } e[100005], e2[100005];\n int h[100005], n, cnt, hei[100005], gson[100005], node[100005], N, fa[100005];\n void ins(int x, int y) {\n   e[++cnt].nxt = h[x];\n   e[cnt].to = y;\n   h[x] = cnt;\n }\n void dfs1(int x) {\n   hei[x] = 1;\n   for (int i = h[x]; i; i = e[i].nxt) {\n     dfs1(e[i].to);\n     hei[x] = std::max(hei[x], hei[e[i].to] + 1);\n     if (hei[gson[x]] < hei[e[i].to]) gson[x] = e[i].to;\n   }\n }\n void dfs2(int x) {\n   node[++N] = x;\n   for (int i = h[x]; i; i = e[i].nxt)\n     if (e[i].to != gson[x]) dfs2(e[i].to);\n   if (gson[x]) dfs2(gson[x]);\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 2; i <= n; i++) scanf('%d', &fa[i]), ins((++fa[i]), i);\n   dfs1(1);\n   dfs2(1);\n   for (int i = 1; i <= n; i++) printf('%d ', node[i] - 1);\n   printf('\n%d\n', n - hei[1]);\n   for (int i = 1, j = 1, k = 0; i <= n - hei[1]; i++) {\n     while (j <= n && fa[node[j]] == k) k = node[j++];\n     if (j > n) break;\n     printf('%d ', node[j] - 1);\n     k = fa[k];\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char a[1005], b[1005];\n int main() {\n   int s1 = 0, s2 = 0;\n   scanf('%s %s', &a, &b);\n   int len1 = strlen(a);\n   int len2 = strlen(b);\n   for (int i = 0; i < len1; i++)\n     if (a[i] == '1') s1++;\n   for (int i = 0; i < len2; i++)\n     if (b[i] == '1') s2++;\n   if (s1 & 1) s1++;\n   if (s1 >= s2)\n     puts('YES');\n   else\n     puts('NO');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, Q, x, y, z, kk;\n int dis[500005], head[500005], father[500005], top[500005], q[500005];\n bool vis[500005];\n int far[500005], heavyson[500005], rak[500005], sum[500005], leaf[500005], ans,\n     d[500005];\n struct Tree {\n   int nxt, to, step;\n } e[500005];\n inline bool cmp(int u, int v) {\n   return dis[u] - dis[father[top[u]]] > dis[v] - dis[father[top[v]]];\n }\n inline void link(int x, int y, int z) {\n   e[++kk].nxt = head[x];\n   e[kk].to = y;\n   e[kk].step = z;\n   head[x] = kk;\n }\n inline int bfs(int S) {\n   int left1 = 1;\n   int right1 = 1;\n   q[left1] = S;\n   memset(d, 0, sizeof(d));\n   memset(vis, false, sizeof(vis));\n   vis[S] = true;\n   while (left1 <= right1) {\n     int u = q[left1++];\n     for (int i = head[u]; i; i = e[i].nxt) {\n       int v = e[i].to;\n       if (vis[v]) continue;\n       vis[v] = true;\n       q[++right1] = v;\n       d[v] = d[u] + e[i].step;\n     }\n   }\n   int kkk = 0;\n   for (int i = 1; i <= n; i++) {\n     if (d[i] > d[kkk]) kkk = i;\n   }\n   return kkk;\n }\n void dfs1(int u, int fa) {\n   far[u] = dis[u];\n   for (int i = head[u]; i; i = e[i].nxt) {\n     int v = e[i].to;\n     if (v == fa) continue;\n     father[v] = u;\n     dis[v] = dis[u] + e[i].step;\n     dfs1(v, u);\n     if (!heavyson[u] || far[u] < far[v]) heavyson[u] = v, far[u] = far[v];\n   }\n }\n void dfs2(int u, int first) {\n   top[u] = first;\n   if (!heavyson[u]) {\n     leaf[++leaf[0]] = u;\n     return;\n   }\n   dfs2(heavyson[u], first);\n   for (int i = head[u]; i; i = e[i].nxt) {\n     int v = e[i].to;\n     if (v == father[u] || v == heavyson[u]) continue;\n     dfs2(v, v);\n   }\n }\n inline int solve(int x, int y) {\n   if (rak[top[x]] <= 2 * y - 1) return sum[min(y * 2 - 1, leaf[0])];\n   int u = x;\n   while (rak[top[u]] > y * 2 - 1) u = father[top[u]];\n   return sum[y * 2 - 1] -\n          min(min(sum[y * 2 - 1] - sum[y * 2 - 2], far[u] - dis[u]), dis[u]) +\n          far[x] - dis[u];\n }\n int main() {\n   scanf('%d%d', &n, &Q);\n   for (int i = 1; i < n; i++) {\n     scanf('%d%d%d', &x, &y, &z);\n     link(x, y, z);\n     link(y, x, z);\n   }\n   int first = bfs(1);\n   int root = bfs(first);\n   dfs1(root, -1);\n   dfs2(root, root);\n   sort(leaf + 1, leaf + leaf[0] + 1, cmp);\n   for (int i = 1; i <= leaf[0]; i++) {\n     rak[top[leaf[i]]] = i;\n     sum[i] = sum[i - 1] + dis[leaf[i]] - dis[father[top[leaf[i]]]];\n   }\n   while (Q--) {\n     scanf('%d%d', &x, &y);\n     x = ((x + ans - 1) % n) + 1;\n     y = ((y + ans - 1) % n) + 1;\n     printf('%d\n', ans = solve(x, y));\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n \n #define For(i, x, n) for(int i = x; i < n; i++)\n #define ROF(i,x,n) for(int i = n - 1; i >= x; i--)\n \n #define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)\n #define F first\n #define S second\n #define pb push_back\n #define po pop_back\n #define mp make_pair\n #define En endl\n ///#define endl '\n'\n \n #define ALL(x) x.begin(), x.end()\n \n using namespace std;\n \n typedef double db;\n typedef long long LL;\n typedef string str;\n typedef pair<int, int> PII;\n typedef pair<LL, LL> PLL;\n \n typedef vector<int> VI;\n typedef vector<LL> VLL;\n typedef vector<bool> VB;\n typedef vector<char> VC;\n typedef vector<PII> VPII;\n typedef vector<string> VSTR;\n typedef set<int> SI;\n typedef set<LL> SLL;\n typedef set<PII> SPII;\n \n typedef const int CI;\n typedef const long long CLL;\n \n /// CI MAX_N = ;\n CI MOD = 1e9 + 7;\n \n int t, n, a;\n \n int main () {\n     IOS;\n     cin >> t;\n     while (t--) {\n         cin >> n;\n         int sumz = 0;\n         int sumf = 0;\n         For (i, 0, 2 * n) {\n             cin >> a;\n             if (a % 2 == 0) sumz++;\n             else sumf++;\n         }\n         if (sumz == sumf) cout << 'YES' << En;\n         else cout << 'NO' << En;\n     }\n }\n \n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 200010;\n int n, m, X, a[maxn], b[maxn], c[maxn], d[maxn], tr[maxn];\n long long ans;\n vector<int> M[maxn];\n vector<pair<int, int>> Q[maxn];\n void add(int p) {\n   for (; p <= X; p += p & -p) tr[p]++;\n }\n int sum(int p) {\n   int s = 0;\n   for (; p; p -= p & -p) s += tr[p];\n   return s;\n }\n int main() {\n   scanf('%d %d %d', &n, &m, &X);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]), a[i] = min(a[i], X);\n   }\n   for (int i = 1; i <= m; i++) {\n     scanf('%d', &b[i]), b[i] = min(b[i], X);\n   }\n   auto init = [&](int n, int *a, int *c) {\n     static int mx[20][maxn], lb[maxn], rb[maxn];\n     for (int i = 1; i <= n; i++) {\n       mx[0][i] = a[i], lb[i] = rb[i] = 0;\n     }\n     for (int i = 1; i < 20; i++) {\n       for (int j = 1; j + (1 << i) - 1 <= n; j++) {\n         mx[i][j] = max(mx[i - 1][j], mx[i - 1][j + (1 << (i - 1))]);\n       }\n     }\n     auto query = [&](int l, int r) {\n       int k = log2(r - l + 1);\n       return max(mx[k][l], mx[k][r - (1 << k) + 1]);\n     };\n     stack<int> st;\n     for (int i = 1; i <= n; i++) {\n       while (!st.empty() && a[st.top()] > a[i]) rb[st.top()] = i, st.pop();\n       if (!st.empty()) lb[i] = st.top();\n       st.push(i);\n     }\n     for (int i = 1; i <= n; i++) {\n       c[i] = min(!lb[i] ? X : query(lb[i], i), !rb[i] ? X : query(i, rb[i]));\n     }\n   };\n   init(n, a, c), init(m, b, d);\n   for (int i = 1; i <= n; i++) {\n     Q[X - c[i]].emplace_back(a[i], -1);\n     Q[X - a[i]].emplace_back(a[i], 1);\n   }\n   for (int i = 1; i <= m; i++) {\n     M[b[i]].push_back(X - d[i] + 1);\n   }\n   for (int i = 0; i < X; i++) {\n     for (int d : M[i]) add(d);\n     for (auto p : Q[i]) ans += p.second * sum(p.first);\n   }\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n;\n   scanf('%d', &n);\n   int a[n], b[n];\n   long int s = 0;\n   for (int i = 0; i < n; i++) scanf('%d%d', &a[i], &b[i]);\n   for (int i = 1; i < n; i++) {\n     if (b[i] >= b[i - 1]) b[i] = b[i - 1];\n     s += (a[i] * b[i]);\n   }\n   printf('%ld\n', s + (a[0] * b[0]));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a = 1023, b = 0, n, e;\n   char op;\n   cin >> n;\n   while (n--) {\n     cin >> op >> e;\n     if (op == '|') {\n       a |= e;\n       b |= e;\n     } else if (op == '&') {\n       a &= e;\n       b &= e;\n     } else if (op == '^') {\n       a ^= e;\n       b ^= e;\n     }\n   }\n   int ouxor = 0;\n   int ou = 0;\n   int exor = 0;\n   e = 0;\n   for (int i = 0; i < 10; i++) {\n     int num = 1 << i;\n     if ((a & num) && (b & num))\n       ou |= num;\n     else if ((b & num))\n       exor |= num;\n     else if (!(a & num) && !(b & num))\n       ouxor |= num;\n   }\n   int count = 0;\n   count += ouxor ? 2 : 0;\n   count += ou ? 1 : 0;\n   count += exor ? 1 : 0;\n   cout << count << endl;\n   if (ou) cout << '| ' << ou << endl;\n   if (ouxor) {\n     cout << '| ' << ouxor << endl;\n     cout << '^ ' << ouxor << endl;\n   }\n   if (exor) cout << '^ ' << exor << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int t;\n   scanf('%d', &t);\n   int a, b, c, d, k, x, y;\n   while (t--) {\n     scanf('%d %d %d %d %d', &a, &b, &c, &d, &k);\n     if (a % c == 0) {\n       x = a / c;\n     } else {\n       x = a / c + 1;\n     }\n     if (b % d == 0) {\n       y = b / d;\n     } else {\n       y = b / d + 1;\n     }\n     if (x + y > k) {\n       printf('-1\n');\n     } else\n       printf('%d %d\n', k - y, y);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = (long long)1e15 + 696969;\n long long n, k;\n long long a[1LL << 20], b[1LL << 20];\n long long opt[20][1LL << 20];\n signed main() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   memset(opt, -1, sizeof opt);\n   cin >> n;\n   for (long long i = 1; i < n; i <<= 1) k++;\n   long long ok = false;\n   for (long long i = 0; i < n; i++) {\n     long long x;\n     cin >> x;\n     if (x == -1)\n       ok = true;\n     else if (!ok)\n       a[i] = 0;\n     else\n       a[i - 1] = x;\n   }\n   n--;\n   reverse(a, a + n);\n   for (long long i = k - 1, j = 0; i > 0; i--) {\n     j += 1 << i;\n     b[i] = j;\n   }\n   for (long long i = 0; i < n; i++) {\n     opt[0][i] = a[i];\n   }\n   for (long long i = 1; i < k; i++) {\n     long long mn = INF;\n     for (long long j = n - 1; j >= 0; j--) {\n       if (j > b[i])\n         opt[i][j] = INF;\n       else {\n         opt[i][j] = mn + a[j];\n         mn = min(mn, opt[i - 1][j]);\n       }\n     }\n   }\n   cout << opt[k - 1][0] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     long long x1, y1, z1;\n     long long x2, y2, z2;\n     cin >> x1 >> y1 >> z1;\n     cin >> x2 >> y2 >> z2;\n     long long sum = 0;\n     if (z2 > x1) {\n       z2 -= x1;\n       if (z2 > z1) {\n         z2 -= z1;\n         sum -= (2 * z2);\n       } else {\n         z1 -= z2;\n         sum += 2 * min(z1, y2);\n       }\n     } else {\n       sum += 2 * min(z1, y2);\n     }\n     cout << sum << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename Arg1>\n void __f(const char* name, Arg1&& arg1) {\n   cerr << name << ' : ' << arg1 << std::endl;\n }\n template <typename Arg1, typename... Args>\n void __f(const char* names, Arg1&& arg1, Args&&... args) {\n   const char* comma = strchr(names + 1, ',');\n   cerr.write(names, comma - names) << ' : ' << arg1 << ' | ';\n   __f(comma + 1, args...);\n }\n const int N = 1510;\n int DP[27][N][N];\n int ans[27][N];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int n;\n   cin >> n;\n   string s;\n   cin >> s;\n   memset(DP, 0, sizeof(DP));\n   memset(ans, 0, sizeof(ans));\n   DP[s[0] - 'a'][0][0] = 1;\n   for (int i = (int)1; i < (int)N; i++) DP[s[0] - 'a'][0][i] = 1;\n   for (char ch = 'a'; ch <= 'z'; ch++) {\n     if (s[0] == ch) continue;\n     for (int i = (int)1; i < (int)N; i++) DP[ch - 'a'][0][i] = 1;\n   }\n   for (int i = (int)1; i < (int)(int)(s.size()); i++) {\n     for (char ch = 'a'; ch <= 'z'; ch++) {\n       if (s[i] == ch) {\n         int len = 0;\n         for (int k = i; k >= 0; k--) {\n           if (s[k] != ch) break;\n           len++;\n         }\n         DP[ch - 'a'][i][0] = len;\n       }\n       for (int j = (int)1; j < (int)N; j++) {\n         if (ch == s[i])\n           DP[ch - 'a'][i][j] = 1 + DP[ch - 'a'][i - 1][j];\n         else\n           DP[ch - 'a'][i][j] = 1 + DP[ch - 'a'][i - 1][j - 1];\n       }\n     }\n   }\n   for (char ch = 'a'; ch <= 'z'; ch++) {\n     for (int j = 0; j < N; j++) {\n       for (int i = (int)0; i < (int)(int)(s.size()); i++)\n         ans[ch - 'a'][j] = max(ans[ch - 'a'][j], DP[ch - 'a'][i][j]);\n     }\n   }\n   int q;\n   cin >> q;\n   for (int i = (int)0; i < (int)q; i++) {\n     int m;\n     char ch;\n     cin >> m >> ch;\n     cout << ans[ch - 'a'][m] << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = INT_MAX;\n const long long INFL = LLONG_MAX;\n int N, ans, P[100100], ord[100100];\n int comp(int a, int b) { return P[a] > P[b]; }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cout.precision(15);\n   cin >> N;\n   for (int(i) = 1; (i) <= (N); (i)++) {\n     cin >> P[i];\n     ord[i] = i;\n   }\n   sort(ord + 1, ord + 1 + N, comp);\n   cout << ord[1] << ' ' << P[ord[2]] << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   vector<int> a(n);\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   int inv = 0;\n   for (int i = 1; i < n; i++) {\n     for (int j = 0; j < i; j++) {\n       if (a[i] < a[j]) {\n         inv++;\n       }\n     }\n   }\n   inv %= 2;\n   int m;\n   cin >> m;\n   for (int i = 0; i < m; i++) {\n     int l, r;\n     cin >> l >> r;\n     int len = r - l + 1;\n     int di = (len * (len - 1)) / 2;\n     inv += di;\n     inv %= 2;\n     if (inv == 1) {\n       cout << 'odd' << endl;\n     } else {\n       cout << 'even' << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n const int MAXN = 23;\n int parseInt() {\n   int d;\n   scanf('%d', &d);\n   ;\n   return d;\n }\n int n;\n int a[MAXN], b[MAXN];\n vector<pair<int, int> > v;\n map<int, int> rang;\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; ++i) {\n     a[i] = parseInt();\n     v.push_back(make_pair(a[i], i));\n   }\n   sort(v.begin(), v.end());\n   for (int i = 0; i < n; ++i) {\n     rang[v[i].first] = i;\n     b[i] = v[i].first;\n   }\n   int rng;\n   for (int i = 0; i < n; ++i) {\n     rng = rang[a[i]];\n     rng = (rng + 1) % n;\n     cout << b[rng] << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int P = 1e9 + 7, INF = 0x3f3f3f3f;\n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n long long qpow(long long a, long long n) {\n   long long r = 1 % P;\n   for (a %= P; n; a = a * a % P, n >>= 1)\n     if (n & 1) r = r * a % P;\n   return r;\n }\n long long inv(long long first) {\n   return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;\n }\n inline int rd() {\n   int first = 0;\n   char p = getchar();\n   while (p < '0' || p > '9') p = getchar();\n   while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();\n   return first;\n }\n const int N = 1e6 + 10;\n int n, a, b;\n struct _ {\n   long long a, b, c;\n   void pr() { printf('a=%lld,b=%lld\n', a, b); }\n   bool operator<(const _& rhs) const { return c > rhs.c; }\n } e[N];\n long long ans;\n int vis[N];\n int main() {\n   scanf('%d%d%d', &n, &a, &b);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%lld%lld', &e[i].a, &e[i].b);\n     e[i].c = e[i].a - e[i].b;\n   }\n   for (int i = 1; i <= n; ++i) ans += e[i].b;\n   if (!b) return printf('%lld\n', ans), 0;\n   if (b == 1) {\n     long long t = 0;\n     for (int i = 1; i <= n; ++i) t = max(t, (e[i].a << a) - e[i].b);\n     return printf('%lld\n', ans + t), 0;\n   }\n   sort(e + 1, e + 1 + n);\n   for (int i = 1; i <= n; ++i)\n     if (e[i].a > e[i].b) vis[i] = 1;\n   int cnt = 0;\n   for (int i = 1; i <= b; ++i)\n     if (vis[i]) ans += e[i].a - e[i].b, ++cnt;\n   long long t = 0;\n   for (int i = 1; i <= b; ++i) {\n     if (vis[i])\n       t = max(t, (e[i].a << a) - e[i].a);\n     else\n       t = max(t, (e[i].a << a) - e[i].b);\n   }\n   long long ret = ans + t;\n   t = 0;\n   for (int i = b + 1; i <= n; ++i) t = max(t, (e[i].a << a) - e[i].b);\n   if (cnt < b)\n     ret = max(ret, ans + t);\n   else\n     ret = max(ret, ans + t - e[b].a + e[b].b);\n   printf('%lld\n', ret);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int Length[1001], n, x, a[1001], Concern, Pos, Ppl;\n vector<int> Queues, adj[1001], Ans;\n int32_t main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   cin >> n >> x;\n   for (int i = 1; i <= n; ++i) {\n     cin >> a[i];\n     if (a[i]) adj[a[i]].push_back(i);\n   }\n   for (int i = 1; i <= n; ++i) {\n     if (a[i] == 0) {\n       Ppl = i;\n       int len = 0;\n       while (Ppl) {\n         ++len;\n         if (Ppl == x) Concern = i, Pos = len;\n         if (adj[Ppl].size())\n           Ppl = adj[Ppl][0];\n         else\n           Ppl = 0;\n       }\n       if (Concern != i) Queues.push_back(len);\n     }\n   }\n   for (int i = Queues.size() - 1; i >= 0; --i) {\n     vector<int> Add;\n     for (int j = 0; j < Ans.size(); ++j) {\n       if (!Length[Ans[j] + Queues[i]])\n         Add.push_back(Ans[j] + Queues[i]), Length[Ans[j] + Queues[i]] = 1;\n     }\n     for (int j = 0; j < Add.size(); ++j) Ans.push_back(Add[j]);\n     if (!Length[Queues[i]]) Ans.push_back(Queues[i]), Length[Queues[i]] = 1;\n   }\n   cout << Pos << '\n';\n   sort(Ans.begin(), Ans.end());\n   for (int i = 0; i < Ans.size(); ++i) cout << Pos + Ans[i] << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int Min = -10000000;\n int Max = -Min;\n int A[8] = {1, 1, 0, 0, 1, 1, 1, 1};\n int B[8] = {0, 0, 1, 1, 1, 1, -1, -1};\n int C[8];\n struct Nodes {\n   int x, y;\n } p[100010];\n bool operator<(Nodes &p1, Nodes p2) {\n   if (p1.x == p2.x) return p1.y < p2.y;\n   return p1.x < p2.x;\n }\n long long cross(long long x1, long long y1, long long x2, long long y2) {\n   return x1 * y2 - y1 * x2;\n }\n int main() {\n   int i, j, k;\n   int n;\n   long long a, b, c, res;\n   while (scanf('%d', &n) != EOF) {\n     for (i = 0; i < 8; i++) {\n       if (i & 1) {\n         C[i] = Max;\n       } else\n         C[i] = Min;\n     }\n     for (i = 1; i <= n; i++) {\n       scanf('%d%d', &p[i].x, &p[i].y);\n       C[0] = max(C[0], p[i].x);\n       C[1] = min(C[1], p[i].x);\n       C[2] = max(C[2], p[i].y);\n       C[3] = min(C[3], p[i].y);\n       C[4] = max(C[4], p[i].x + p[i].y);\n       C[5] = min(C[5], p[i].x + p[i].y);\n       C[6] = max(C[6], p[i].x - p[i].y);\n       C[7] = min(C[7], p[i].x - p[i].y);\n     }\n     res = 0;\n     for (i = 0; i < 8; i++) {\n       Nodes p1, p2;\n       p1.x = p1.y = Min;\n       p2.x = p2.y = Max;\n       for (j = 0; j < 8; j += 2) {\n         Nodes tmp[2];\n         for (k = j; k < j + 2; k++) {\n           c = cross(A[i], B[i], A[k], B[k]);\n           a = cross(A[i], C[i], A[k], C[k]);\n           b = cross(C[i], B[i], C[k], B[k]);\n           if (c == 0) break;\n           if (b % c || a % c) break;\n           tmp[k - j].x = b / c;\n           tmp[k - j].y = a / c;\n         }\n         if (k < j + 2) continue;\n         if (tmp[1] < tmp[0]) swap(tmp[0], tmp[1]);\n         if (p1 < tmp[0]) p1 = tmp[0];\n         if (tmp[1] < p2) p2 = tmp[1];\n       }\n       res += max(abs(p2.x - p1.x), abs(p2.y - p1.y));\n     }\n     cout << res + 4 << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 5e4 + 2;\n int head[N], grp_edge[N][30], max1[N][30], grp[N], level[N], okfine = 0, sum[N],\n                                                              dem = 0;\n char edge[N];\n bool cac = true;\n vector<pair<int, char> > adj[N];\n vector<int> adj_grp[N];\n stack<pair<int, char> > lis;\n void dfs(int x) {\n   int i = 0, j;\n   if (adj[x].size() == 0) {\n     if (!okfine) {\n       okfine = level[x];\n     }\n     if (okfine != level[x]) {\n       cac = false;\n     }\n     while (lis.size()) {\n       i = lis.top().first;\n       if (lis.top().second != '?') {\n         grp_edge[x][(int)(lis.top().second - 'a' + 1)]++;\n       }\n       grp[i] = x;\n       lis.pop();\n     }\n     if (i) {\n       adj_grp[head[i]].push_back(x);\n       head[x] = head[i];\n     }\n   }\n   if (adj[x].size() == 1) {\n     level[adj[x][0].first] = level[x] + 1;\n     lis.push({adj[x][0].first, edge[adj[x][0].first]});\n     dfs(adj[x][0].first);\n   }\n   if (adj[x].size() == 2) {\n     while (lis.size()) {\n       i = lis.top().first;\n       if (lis.top().second != '?') {\n         grp_edge[x][(int)(lis.top().second - 'a' + 1)]++;\n       }\n       grp[i] = x;\n       lis.pop();\n     }\n     if (i) {\n       adj_grp[head[i]].push_back(x);\n       head[x] = head[i];\n     }\n     level[adj[x][0].first] = level[x] + 1;\n     lis.push({adj[x][0].first, edge[adj[x][0].first]});\n     dfs(adj[x][0].first);\n     level[adj[x][1].first] = level[x] + 1;\n     lis.push({adj[x][1].first, edge[adj[x][1].first]});\n     dfs(adj[x][1].first);\n   }\n }\n void dfs1(int x) {\n   int i, j;\n   for (i = 0; i < adj_grp[x].size(); i++) {\n     dfs1(adj_grp[x][i]);\n     for (j = 1; j <= 26; j++) {\n       max1[x][j] =\n           max(max1[x][j], max1[adj_grp[x][i]][j] + grp_edge[adj_grp[x][i]][j]);\n     }\n   }\n   for (j = 1; j <= 26; j++) {\n     sum[x] += max1[x][j];\n   }\n   if (sum[x] > okfine - level[x]) {\n     dem++;\n   }\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int n, i, j, k, l, q, ans, ans1;\n   char x, x1;\n   cin >> n >> q;\n   for (i = 2; i <= n; i++) {\n     cin >> head[i] >> edge[i];\n     adj[head[i]].push_back({i, edge[i]});\n   }\n   dfs(1);\n   dfs1(1);\n   head[1] = 0;\n   for (i = 1; i <= q; i++) {\n     if (!cac) {\n       cout << 'Fou\n';\n       continue;\n     }\n     cin >> j >> x;\n     x1 = edge[j];\n     if (edge[j] != '?') {\n       grp_edge[grp[j]][(int)(edge[j] - 'a' + 1)]--;\n     }\n     edge[j] = x;\n     if (edge[j] != '?') {\n       grp_edge[grp[j]][(int)(edge[j] - 'a' + 1)]++;\n     }\n     k = grp[j];\n     while (k != 1) {\n       if (adj_grp[head[k]].size() == 2) {\n         if (sum[head[k]] > okfine - level[head[k]]) {\n           if (x1 != '?') {\n             sum[head[k]] -= max1[head[k]][(int)(x1 - 'a' + 1)];\n             max1[head[k]][(int)(x1 - 'a' + 1)] =\n                 max(max1[adj_grp[head[k]][0]][(int)(x1 - 'a' + 1)] +\n                         grp_edge[adj_grp[head[k]][0]][(int)(x1 - 'a' + 1)],\n                     max1[adj_grp[head[k]][1]][(int)(x1 - 'a' + 1)] +\n                         grp_edge[adj_grp[head[k]][1]][(int)(x1 - 'a' + 1)]);\n             sum[head[k]] += max1[head[k]][(int)(x1 - 'a' + 1)];\n           }\n           if (x != '?') {\n             sum[head[k]] -= max1[head[k]][(int)(x - 'a' + 1)];\n             max1[head[k]][(int)(x - 'a' + 1)] =\n                 max(max1[adj_grp[head[k]][0]][(int)(x - 'a' + 1)] +\n                         grp_edge[adj_grp[head[k]][0]][(int)(x - 'a' + 1)],\n                     max1[adj_grp[head[k]][1]][(int)(x - 'a' + 1)] +\n                         grp_edge[adj_grp[head[k]][1]][(int)(x - 'a' + 1)]);\n             sum[head[k]] += max1[head[k]][(int)(x - 'a' + 1)];\n           }\n           if (sum[head[k]] <= okfine - level[head[k]]) {\n             dem--;\n           }\n         } else {\n           if (x1 != '?') {\n             sum[head[k]] -= max1[head[k]][(int)(x1 - 'a' + 1)];\n             max1[head[k]][(int)(x1 - 'a' + 1)] =\n                 max(max1[adj_grp[head[k]][0]][(int)(x1 - 'a' + 1)] +\n                         grp_edge[adj_grp[head[k]][0]][(int)(x1 - 'a' + 1)],\n                     max1[adj_grp[head[k]][1]][(int)(x1 - 'a' + 1)] +\n                         grp_edge[adj_grp[head[k]][1]][(int)(x1 - 'a' + 1)]);\n             sum[head[k]] += max1[head[k]][(int)(x1 - 'a' + 1)];\n           }\n           if (x != '?') {\n             sum[head[k]] -= max1[head[k]][(int)(x - 'a' + 1)];\n             max1[head[k]][(int)(x - 'a' + 1)] =\n                 max(max1[adj_grp[head[k]][0]][(int)(x - 'a' + 1)] +\n                         grp_edge[adj_grp[head[k]][0]][(int)(x - 'a' + 1)],\n                     max1[adj_grp[head[k]][1]][(int)(x - 'a' + 1)] +\n                         grp_edge[adj_grp[head[k]][1]][(int)(x - 'a' + 1)]);\n             sum[head[k]] += max1[head[k]][(int)(x - 'a' + 1)];\n           }\n           if (sum[head[k]] > okfine - level[head[k]]) {\n             dem++;\n           }\n         }\n       } else {\n         if (sum[head[k]] > okfine - level[head[k]]) {\n           if (x1 != '?') {\n             sum[head[k]] -= max1[head[k]][(int)(x1 - 'a' + 1)];\n             max1[head[k]][(int)(x1 - 'a' + 1)] =\n                 max1[adj_grp[head[k]][0]][(int)(x1 - 'a' + 1)] +\n                 grp_edge[adj_grp[head[k]][0]][(int)(x1 - 'a' + 1)];\n             sum[head[k]] += max1[head[k]][(int)(x1 - 'a' + 1)];\n           }\n           if (x != '?') {\n             sum[head[k]] -= max1[head[k]][(int)(x - 'a' + 1)];\n             max1[head[k]][(int)(x - 'a' + 1)] =\n                 max1[adj_grp[head[k]][0]][(int)(x - 'a' + 1)] +\n                 grp_edge[adj_grp[head[k]][0]][(int)(x - 'a' + 1)];\n             sum[head[k]] += max1[head[k]][(int)(x - 'a' + 1)];\n           }\n           if (sum[head[k]] <= okfine - level[head[k]]) {\n             dem--;\n           }\n         } else {\n           if (x1 != '?') {\n             sum[head[k]] -= max1[head[k]][(int)(x1 - 'a' + 1)];\n             max1[head[k]][(int)(x1 - 'a' + 1)] =\n                 max1[adj_grp[head[k]][0]][(int)(x1 - 'a' + 1)] +\n                 grp_edge[adj_grp[head[k]][0]][(int)(x1 - 'a' + 1)];\n             sum[head[k]] += max1[head[k]][(int)(x1 - 'a' + 1)];\n           }\n           if (x != '?') {\n             sum[head[k]] -= max1[head[k]][(int)(x - 'a' + 1)];\n             max1[head[k]][(int)(x - 'a' + 1)] =\n                 max1[adj_grp[head[k]][0]][(int)(x - 'a' + 1)] +\n                 grp_edge[adj_grp[head[k]][0]][(int)(x - 'a' + 1)];\n             sum[head[k]] += max1[head[k]][(int)(x - 'a' + 1)];\n           }\n           if (sum[head[k]] > okfine - level[head[k]]) {\n             dem++;\n           }\n         }\n       }\n       k = head[k];\n     }\n     if (dem) {\n       cout << 'Fou\n';\n     } else {\n       ans = 0;\n       ans1 = 0;\n       for (j = 1; j <= 26; j++) {\n         ans += max1[1][j] * j;\n         ans1 += max1[1][j];\n       }\n       cout << 'Shi ' << ans + (okfine - ans1) * 27 * 13 << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   while (scanf('%d', &n) == 1) {\n     string s;\n     cin >> s;\n     s = '#' + s;\n     bool used[n + 1];\n     memset(used, 0, sizeof used);\n     int d[n + 1];\n     for (int i = 1; i <= n; i++) {\n       scanf('%d', d + i);\n     }\n     int pos = 1;\n     bool ok = false;\n     while (!used[pos]) {\n       used[pos] = true;\n       if (s[pos] == '<') {\n         pos -= d[pos];\n       } else {\n         pos += d[pos];\n       }\n       if (pos <= 0 || pos > n) {\n         ok = true;\n         break;\n       }\n     }\n     if (ok) {\n       puts('FINITE');\n     } else {\n       puts('INFINITE');\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native')\n #pragma GCC optimize('unroll-loops')\n using namespace std;\n template <typename T, typename U>\n inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) {\n   _out << _p.first << ' ' << _p.second;\n   return _out;\n }\n template <typename T, typename U>\n inline istream &operator>>(istream &_in, pair<T, U> &_p) {\n   _in >> _p.first >> _p.second;\n   return _in;\n }\n template <typename T>\n inline ostream &operator<<(ostream &_out, const vector<T> &_v) {\n   if (_v.empty()) {\n     return _out;\n   }\n   _out << _v.front();\n   for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) {\n     _out << ' ' << *_it;\n   }\n   return _out;\n }\n template <typename T>\n inline istream &operator>>(istream &_in, vector<T> &_v) {\n   for (auto &_i : _v) {\n     _in >> _i;\n   }\n   return _in;\n }\n const long long MAXN = 3604;\n const long long MAXM = MAXN / 2;\n const long long INF = 1e9;\n const long long MOD = 998244353;\n long long sum(long long a, long long b) {\n   if (a + b >= MOD) {\n     return a + b - MOD;\n   }\n   return a + b;\n }\n long long mul(long long a, long long b) {\n   if (a * b >= MOD) {\n     return (a * b) % MOD;\n   }\n   return a * b;\n }\n long long sqr(long long a) { return (a * a) % MOD; }\n long long bin_pow(long long a, long long b) {\n   if (b == 0) {\n     return 1;\n   }\n   if (b % 2) {\n     return mul(a, bin_pow(a, b - 1));\n   }\n   return sqr(bin_pow(a, b / 2));\n }\n long long fact[MAXN];\n long long rfact[MAXN];\n long long dp[2][MAXM][MAXN];\n bool connected[MAXN];\n long long dp1[MAXM];\n long long dp2[MAXN][MAXM];\n inline long long c(long long n, long long k) {\n   return mul(fact[n], mul(rfact[k], rfact[n - k]));\n }\n class FSbalansirovannieRaspolozheniyaDomino {\n  public:\n   void solve(std::istream &in, std::ostream &out) {\n     fact[0] = 1;\n     for (long long i = 1; i < MAXN; i++) {\n       fact[i] = mul(i, fact[i - 1]);\n     }\n     rfact[MAXN - 1] = bin_pow(fact[MAXN - 1], MOD - 2);\n     for (long long j = MAXN - 1; j >= 1; j--) {\n       rfact[j - 1] = mul(rfact[j], j);\n     }\n     long long h, w;\n     in >> h >> w;\n     long long n;\n     in >> n;\n     vector<pair<pair<long long, long long>, pair<long long, long long>>> a(n);\n     in >> a;\n     {\n       for (long long i = 0; i <= h; i++) {\n         for (long long j = 0; j < MAXM; j++) {\n           dp2[i][j] = 0;\n           dp[0][j][i] = 0;\n         }\n         connected[i] = 0;\n       }\n       for (long long j = 0; j < MAXM; j++) {\n         dp1[j] = 0;\n       }\n       for (auto v : a) {\n         connected[v.first.first - 1] = 1;\n         connected[v.second.first - 1] = 1;\n       }\n       long long counts = 0;\n       for (long long j = 0; j < h; j++) {\n         counts += !connected[j];\n       }\n       dp1[0] = 1;\n       for (long long i = 0; i <= h; i++) {\n         for (long long j = 0; j < MAXM; j++) {\n           dp1[j] = sum(dp1[j], dp2[i][j]);\n         }\n         if (i + 1 < h && connected[i] == 0 && connected[i + 1] == 0) {\n           for (long long j = 0; j + 1 < MAXM; j++) {\n             dp2[i + 2][j + 1] = dp1[j];\n           }\n         }\n       }\n       for (long long i = 0; i < MAXM; i++) {\n         for (long long j = 0; j <= counts - 2 * i; j++) {\n           dp[0][i][j] =\n               mul(dp1[i], mul(fact[counts - 2 * i],\n                               mul(fact[i], rfact[counts - 2 * i - j])));\n         }\n       }\n     }\n     {\n       for (long long i = 0; i <= w; i++) {\n         for (long long j = 0; j < MAXM; j++) {\n           dp2[i][j] = 0;\n           dp[1][j][i] = 0;\n         }\n         connected[i] = 0;\n       }\n       for (long long j = 0; j < MAXM; j++) {\n         dp1[j] = 0;\n       }\n       for (auto v : a) {\n         connected[v.first.second - 1] = 1;\n         connected[v.second.second - 1] = 1;\n       }\n       long long counts = 0;\n       for (long long j = 0; j < w; j++) {\n         counts += !connected[j];\n       }\n       dp1[0] = 1;\n       for (long long i = 0; i <= w; i++) {\n         for (long long j = 0; j < MAXM; j++) {\n           dp1[j] = sum(dp1[j], dp2[i][j]);\n         }\n         if (i + 1 < w && connected[i] == 0 && connected[i + 1] == 0) {\n           for (long long j = 0; j + 1 < MAXM; j++) {\n             dp2[i + 2][j + 1] = dp1[j];\n           }\n         }\n       }\n       for (long long i = 0; i < MAXM; i++) {\n         for (long long j = 0; j <= counts - 2 * i; j++) {\n           dp[1][i][j] = mul(dp1[i], c(counts - 2 * i, j));\n         }\n       }\n     }\n     long long ans = 0;\n     for (long long i = 0; 2 * i <= h; i++) {\n       for (long long j = 0; 2 * j <= w; j++) {\n         ans += dp[0][i][j] * dp[1][j][i];\n         if (ans >= MOD * MOD) {\n           ans -= MOD * MOD;\n         }\n       }\n     }\n     ans %= MOD;\n     out << ans;\n   }\n };\n signed main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   FSbalansirovannieRaspolozheniyaDomino solver;\n   std::istream &in(std::cin);\n   std::ostream &out(std::cout);\n   solver.solve(in, out);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char _;\n int num_rectangles;\n pair<pair<int, int>, pair<int, int> > rectangles[135000], pre[135000],\n     suff[135000];\n pair<pair<int, int>, pair<int, int> > intersection(\n     pair<pair<int, int>, pair<int, int> > first,\n     pair<pair<int, int>, pair<int, int> > second) {\n   if (first.first.first == INT_MIN || second.first.first == INT_MIN)\n     return {{INT_MIN, INT_MIN}, {INT_MIN, INT_MIN}};\n   int tx = max(first.first.first, second.first.first),\n       bx = min(first.second.first, second.second.first);\n   int ty = max(first.first.second, second.first.second),\n       by = min(first.second.second, second.second.second);\n   if (bx < tx || by < ty) return {{INT_MIN, INT_MIN}, {INT_MIN, INT_MIN}};\n   return {{tx, ty}, {bx, by}};\n }\n int main() {\n   scanf('%d', &num_rectangles);\n   for (int i = 0; i < num_rectangles; i++)\n     scanf(' %d %d %d %d', &rectangles[i].first.first,\n           &rectangles[i].first.second, &rectangles[i].second.first,\n           &rectangles[i].second.second);\n   sort(rectangles, rectangles + num_rectangles);\n   pre[0] = rectangles[0];\n   suff[num_rectangles - 1] = rectangles[num_rectangles - 1];\n   for (int i = 1; i < num_rectangles; i++) {\n     pre[i] = intersection(pre[i - 1], rectangles[i]);\n     suff[num_rectangles - i - 1] = intersection(\n         suff[num_rectangles - i], rectangles[num_rectangles - i - 1]);\n   }\n   for (int i = 0; i < num_rectangles; i++) {\n     if (i == 0) {\n       if (suff[1].first.first != INT_MIN) {\n         printf('%d %d\n', suff[1].first.first, suff[1].first.second);\n         return 0;\n       }\n     } else if (i == num_rectangles - 1) {\n       if (pre[num_rectangles - 2].first.first != INT_MIN) {\n         printf('%d %d\n', pre[num_rectangles - 2].first.first,\n                pre[num_rectangles - 2].first.second);\n         return 0;\n       }\n     } else {\n       pair<pair<int, int>, pair<int, int> > first = pre[i - 1],\n                                             second = suff[i + 1],\n                                             intersect =\n                                                 intersection(first, second);\n       if (intersect.first.first != INT_MIN) {\n         printf('%d %d\n', intersect.first.first, intersect.first.second);\n         return 0;\n       }\n     }\n   }\n   if (pre[num_rectangles - 1].first.first != INT_MIN) {\n     printf('%d %d\n', pre[num_rectangles - 1].first.first,\n            pre[num_rectangles - 1].first.second);\n     return 0;\n   }\n   printf('-1\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e6, maxm = 1e6;\n unsigned int degree[maxn + 10], blk[maxn + 10];\n namespace find {\n unsigned int fa[maxn + 10], siz[maxn + 10];\n inline void Init(const unsigned int n) {\n   iota(fa, fa + n + 1, 0);\n   fill(siz, siz + n + 1, 1);\n }\n unsigned int GetFather(const unsigned int x) {\n   return fa[x] == x ? x : fa[x] = GetFather(fa[x]);\n }\n inline void Merge(const unsigned int x, const unsigned int y) {\n   unsigned int fx = GetFather(x), fy = GetFather(y);\n   if (fx == fy) return;\n   if (siz[fx] < siz[fy]) swap(fx, fy);\n   fa[fy] = fx;\n   siz[fx] += siz[fy];\n }\n }  // namespace find\n int main() {\n   ios_base::sync_with_stdio(false);\n   unsigned int n, m;\n   cin >> n >> m;\n   find::Init(n);\n   for (unsigned int i = 0; i < m; ++i) {\n     unsigned int a, b;\n     cin >> a >> b;\n     find::Merge(a, b);\n     ++degree[a];\n     ++degree[b];\n   }\n   unsigned long long ans = 0;\n   const unsigned int r = find::GetFather(1);\n   bool fl = true;\n   for (unsigned int i = 1; i <= n; ++i) {\n     if (degree[i] & 0x01) ++blk[find::GetFather(i)];\n     if (degree[i] && find::GetFather(i) != r) fl = false;\n   }\n   if (fl && !blk[r]) {\n     cout << '0' << endl;\n     return 0;\n   }\n   for (unsigned int i = 1; i <= n; ++i)\n     if (find::GetFather(i) == i) {\n       ans += blk[i] / 2;\n       if (degree[i] && !blk[i]) ++ans;\n     }\n   if (!degree[1] && find::siz[1] == 1 && find::GetFather(1) == 1) ++ans;\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s;\n   int count = 0, count1 = 0;\n   cin >> s;\n   for (int i = 0; i < s.size(); i++) {\n     if (s[i] >= 97 && s[i] <= 122)\n       count++;\n     else\n       count1++;\n   }\n   if (count >= count1) {\n     for (int i = 0; i < s.size(); i++) {\n       if (isupper(s[i])) s[i] = s[i] + 32;\n     }\n   } else {\n     for (int i = 0; i < s.size(); i++) {\n       if (islower(s[i])) s[i] = s[i] - 32;\n     }\n   }\n   cout << s;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dirx[] = {-1, -1, -1, 0, 0, 1, 1, 1};\n int diry[] = {-1, 0, 1, -1, 1, -1, 0, 1};\n vector<string> vec_splitter(string s) {\n   s += ',';\n   vector<string> res;\n   while (!s.empty()) {\n     res.push_back(s.substr(0, s.find(',')));\n     s = s.substr(s.find(',') + 1);\n   }\n   return res;\n }\n void debug_out(vector<string> __attribute__((unused)) args,\n                __attribute__((unused)) int idx,\n                __attribute__((unused)) int LINE_NUM) {\n   cerr << endl;\n }\n template <typename Head, typename... Tail>\n void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {\n   if (idx > 0)\n     cerr << ', ';\n   else\n     cerr << 'Line(' << LINE_NUM << ') ';\n   stringstream ss;\n   ss << H;\n   cerr << args[idx] << ' = ' << ss.str();\n   debug_out(args, idx + 1, LINE_NUM, T...);\n }\n int const lmt = 2e5 + 5;\n int a[lmt];\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     long long n;\n     cin >> n;\n     for (long long i = 0; i < n; i++) cin >> a[i];\n     if (a[0] + a[1] <= a[n - 1]) {\n       cout << 1 << ' ';\n       cout << 2 << ' ';\n       cout << n << '\n';\n     } else {\n       cout << -1 << '\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[300005], p[300005], out[300005];\n long long f[300005];\n bool v[300005];\n int n, m, cnt;\n void work(int p) {\n   int t = min(a[p], a[p + 1]);\n   if (t) out[++m] = p;\n   a[p] -= t;\n   a[p + 1] -= t;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n     long long O = f[max(i - 2, 0)] + a[i];\n     long long E = f[max(i - 3, 0)] + max(a[i], a[i - 1]);\n     f[i] = min(O, E);\n     v[i] = (f[i] != O);\n   }\n   long long ans = min(f[n - 1], f[n]);\n   for (int i = n - (ans == f[n - 1]); i > 0; i -= 2 + v[i]) p[++cnt] = i;\n   reverse(p + 1, p + cnt + 1);\n   for (int i = 1; i <= cnt; i++) {\n     int pre = p[i - 1], now = p[i];\n     if (v) work(now - 1);\n     work(pre + 1);\n     work(now);\n   }\n   printf('%d\n', m);\n   for (int i = 1; i <= m; i++) printf('%d\n', out[i]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[4] = {1, 2, 3, 5};\n int main(void) {\n   int n, k;\n   scanf('%d%d', &n, &k);\n   printf('%d\n', (5 + 6 * (n - 1)) * k);\n   for (int i = 0; i < n; i++) {\n     printf('%d %d %d %d\n', (a[0] + 6 * i) * k, (a[1] + 6 * i) * k,\n            (a[2] + 6 * i) * k, (a[3] + 6 * i) * k);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n, mxpos = 0, mx = 0, temp, i;\n   scanf('%d', &n);\n   int p[n];\n   for (i = 0; i < n; i++) {\n     scanf('%d', &p[i]);\n     if (mx < p[i]) {\n       mx = p[i];\n       mxpos = i;\n     }\n   }\n   int loopno = 0, j;\n   int notsorted = 1;\n   while (notsorted) {\n     notsorted = 0;\n     for (j = 0; j < n - loopno - 1; j++) {\n       if (p[j] > p[j + 1]) {\n         temp = p[j];\n         p[j] = p[j + 1];\n         p[j + 1] = temp;\n         notsorted = 1;\n       }\n     }\n     loopno++;\n   }\n   printf('%d %d', mxpos + 1, p[n - 2]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 32000;\n const int mod = 1000000007;\n const int inf = 2 * mod;\n int dp[5001][5001];\n pair<long long, long long> hashVal[5001];\n pair<long long, long long> powVal[5001];\n const long long base1 = 37;\n const long long base2 = 2017;\n const long long mod1 = 1e9 + 7;\n const long long mod2 = 1e9 + 297;\n int ans[50001];\n string s;\n inline int ceil(int p, int q) { return (p + q - 1) / q; }\n int call(int l, int r) {\n   if (l > r) return 0;\n   if (l == r) return 1;\n   if (l == r - 1) return (s[l] == s[r] ? 2 : 0);\n   if (dp[l][r] != -1) return dp[l][r];\n   int ret;\n   if (s[l] != s[r] || call(l + 1, r - 1) == 0)\n     ret = 0;\n   else\n     ret = 1 + call(l, ceil(l + r, 2) - 1);\n   return dp[l][r] = ret;\n }\n int main() {\n   cin >> s;\n   int len = s.length();\n   memset(dp, -1, sizeof(dp));\n   for (int i = 0; i < len; i++) {\n     for (int j = 0; j < len; j++) {\n       ans[call(i, j)]++;\n     }\n   }\n   for (int i = len - 1; i >= 1; i--) ans[i] += ans[i + 1];\n   for (int i = 1; i <= len; i++) {\n     cout << ans[i] << ' ';\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = LLONG_MAX;\n const long long mod = 1e9 + 7;\n inline long long power(long long n, long long k, long long mod = INF) {\n   long long ans = 1;\n   while (k > 0) {\n     if (k & 1) ans = (ans * n) % mod;\n     n = (n * n) % mod;\n     k >>= 1;\n   }\n   return ans;\n }\n void sum() {\n   string s;\n   cin >> s;\n   long long n = (long long)s.size();\n   long long pre[n + 1];\n   long long suf[n + 2];\n   pre[1] = s[0] - '0';\n   suf[n] = s[n - 1] - '0';\n   suf[n + 1] = 0;\n   suf[0] = 0;\n   pre[0] = 0;\n   long long st = pre[1];\n   long long en = suf[n];\n   long long t = 1;\n   long long ans = 0;\n   for (long long i = 1; i < n; ++i) {\n     t = (t * 10) % mod;\n     st = (st * 10 + s[i] - '0') % mod;\n     pre[i + 1] = (pre[i] % mod + st) % mod;\n     en = (en + t * (s[n - i - 1] - '0')) % mod;\n     suf[n - i] = en;\n   }\n   for (long long i = 2; i <= n + 1; ++i) {\n     long long temp = i - 1;\n     temp %= mod;\n     ans += (((pre[i - 2] * t) % mod) + (((temp)*suf[i]) % mod)) % mod;\n     ans %= mod;\n     t = ((t % mod) * power(10, mod - 2, mod)) % mod;\n   }\n   cout << (ans) % mod << '\n';\n }\n int32_t main() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   sum();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int a[100005], s[100005];\n int main() {\n   int l, r, q1, q2, i, N, S;\n   scanf('%d%d%d%d%d', &N, &l, &r, &q1, &q2);\n   s[0] = 0;\n   for (i = 1; i <= N; i++) {\n     scanf('%d', &a[i]);\n     s[i] = s[i - 1] + a[i];\n   }\n   int mx = s[N] * l + q1 * (N - 1);\n   for (i = 0; i <= N; i++) {\n     int t = s[i] * l + (s[N] - s[i]) * r;\n     int p = N - 2 * i;\n     if (p < 0) p = -p;\n     if (p) p--;\n     if (l > r)\n       t += p * q2;\n     else\n       t += p * q1;\n     if (t < mx) mx = t;\n   }\n   printf('%d\n', mx);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int arr[1000] = {0};\n int main() {\n   int n, m, i, j, k;\n   cin >> n;\n   for (i = 0; i < n; i++) cin >> arr[i];\n   if (n % 2 == 0) {\n     cout << 'No' << endl;\n     return 0;\n   } else {\n     if (arr[0] % 2 == 1 && arr[n - 1] % 2 == 1) {\n       cout << 'Yes' << endl;\n     } else\n       cout << 'No' << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int pages, readPages[7];\n   scanf('%d', &pages);\n   for (int i = 0; i < 7; i++) scanf('%d', &readPages[i]);\n   int day = 1, i = 0;\n   while (pages > 0) {\n     if (day == 8) day = 1;\n     if (i == 7) i = 0;\n     pages -= readPages[i];\n     day++, i++;\n   }\n   printf('%d\n', day - 1);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX_N = 3000 + 50;\n const int MAX_D = 15;\n struct DP {\n   int d1;\n   int d2;\n   int d3;\n   int v1;\n   int v2;\n   int v3;\n };\n bool operator<(const DP& l, const DP& r) {\n   return l.v1 < r.v1 || (l.v1 == r.v1 && l.v2 < r.v2) ||\n          (l.v1 == r.v1 && l.v2 == r.v2 && l.v3 < r.v3);\n }\n class SparseTable {\n  public:\n   SparseTable(vector<pair<int, int> >& vals) {\n     N = vals.size();\n     depths.assign(MAX_N, -1);\n     table.assign(N, vector<pair<int, int> >(MAX_D));\n     init();\n     build(vals);\n   }\n   void init() {\n     for (int i = 1; i < MAX_N; ++i) {\n       depths[i] = depths[i - 1];\n       if ((i & (i - 1)) == 0) {\n         ++depths[i];\n       }\n     }\n   }\n   void build(vector<pair<int, int> >& vals) {\n     for (int i = 0; i < N; ++i) {\n       table[i][0] = vals[i];\n     }\n     for (int d = 1; d <= depths[N] + 1; ++d) {\n       for (int i = 0; i < N; ++i) {\n         int left = i;\n         int right = min(N - 1, left + (1 << (d - 1)));\n         table[i][d] = max(table[left][d - 1], table[right][d - 1]);\n       }\n     }\n   }\n   pair<int, int> getMax(int left, int right) {\n     int len = right - left + 1;\n     int d = depths[len];\n     return max(table[left][d], table[left + len - (1 << d)][d]);\n   }\n \n  private:\n   vector<vector<pair<int, int> > > table;\n   vector<int> depths;\n   int N = 0;\n };\n int main() {\n   ios_base::sync_with_stdio(false);\n   int n;\n   cin >> n;\n   vector<int> vec(n);\n   vector<pair<int, int> > vec_with_index(n);\n   for (int i = 0; i < n; ++i) {\n     cin >> vec[i];\n     vec_with_index[i].first = vec[i];\n     vec_with_index[i].second = i;\n   }\n   sort(vec_with_index.begin(), vec_with_index.end());\n   vector<pair<int, int> > vals;\n   vals.push_back({vec_with_index[0].first, 0});\n   for (int i = 1; i < vec_with_index.size(); ++i) {\n     vals.push_back({vec_with_index[i].first - vec_with_index[i - 1].first, i});\n   }\n   SparseTable st(vals);\n   DP ret;\n   ret.v1 = -1;\n   ret.v2 = -1;\n   ret.v3 = -1;\n   for (int d1 = n - 1; d1 >= 0; --d1) {\n     for (int d2 = d1 - 1; d2 >= 0; --d2) {\n       int len1 = n - 1 - d1 + 1;\n       int len2 = d1 - 1 - d2 + 1;\n       if (len1 > 2 * len2 || len2 > 2 * len1) {\n         continue;\n       }\n       int min_len3 = max({1, (len1 + 1) / 2, (len2 + 1) / 2});\n       int max_len3 = min({d2, 2 * len1, 2 * len2});\n       if (min_len3 > max_len3) {\n         continue;\n       }\n       int min_d3 = d2 - max_len3;\n       int max_d3 = d2 - min_len3;\n       pair<int, int> max_val = st.getMax(min_d3, max_d3);\n       DP temp;\n       temp.d1 = d1;\n       temp.d2 = d2;\n       temp.d3 = max_val.second;\n       temp.v1 = vec_with_index[d1].first - vec_with_index[d1 - 1].first;\n       temp.v2 = vec_with_index[d2].first - vec_with_index[d2 - 1].first;\n       temp.v3 = max_val.first;\n       if (ret < temp) {\n         ret = temp;\n       }\n     }\n   }\n   vector<int> ret_vec(n);\n   for (int i = 0; i < ret.d3; ++i) {\n     ret_vec[vec_with_index[i].second] = -1;\n   }\n   for (int i = ret.d3; i < ret.d2; ++i) {\n     ret_vec[vec_with_index[i].second] = 3;\n   }\n   for (int i = ret.d2; i < ret.d1; ++i) {\n     ret_vec[vec_with_index[i].second] = 2;\n   }\n   for (int i = ret.d1; i < n; ++i) {\n     ret_vec[vec_with_index[i].second] = 1;\n   }\n   for (auto item : ret_vec) {\n     cout << item << ' ';\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Node {\n   long long l, r;\n   mutable long long val;\n   Node(long long l = 0, long long r = 0, long long v = 0)\n       : l(l), r(r), val(v) {}\n   bool operator<(const Node& rv) const { return l < rv.l; }\n };\n long long n, m;\n set<Node> t;\n long long a[100005];\n long long seed;\n long long vmax;\n long long qpow(long long x, long long p, long long m) {\n   long long ans = 1;\n   long long base = x;\n   while (p) {\n     if (p & 1) ans = (ans * base) % m;\n     base = (base * base) % m;\n     p >>= 1;\n   }\n   return ans;\n }\n long long rnd() {\n   long long ans = seed;\n   seed = (seed * 7 + 13) % 1000000007;\n   return ans;\n }\n set<Node>::iterator split(long long p) {\n   set<Node>::iterator it = t.lower_bound(Node(p));\n   if (it != t.end() && it->l == p) {\n     return it;\n   }\n   --it;\n   long long l = it->l, r = it->r, val = it->val;\n   t.erase(it);\n   t.insert(Node(l, p - 1, val));\n   return t.insert(Node(p, r, val)).first;\n }\n void assign(long long l, long long r, long long v) {\n   set<Node>::iterator end = split(r + 1);\n   set<Node>::iterator begin = split(l);\n   t.erase(begin, end);\n   t.insert(Node(l, r, v));\n }\n void add(long long l, long long r, long long k) {\n   set<Node>::iterator end = split(r + 1);\n   set<Node>::iterator begin = split(l);\n   for (set<Node>::iterator it = begin; it != end; ++it) {\n     it->val += k;\n   }\n }\n long long kth(long long l, long long r, long long k) {\n   vector<pair<long long, long long> > v;\n   set<Node>::iterator end = split(r + 1);\n   set<Node>::iterator begin = split(l);\n   for (set<Node>::iterator it = begin; it != end; ++it) {\n     v.push_back(make_pair(it->val, it->r - it->l + 1));\n   }\n   sort(v.begin(), v.end());\n   for (long long i = 0; i < v.size(); ++i) {\n     k -= v[i].second;\n     if (k <= 0) return v[i].first;\n   }\n   return -1;\n }\n long long power(long long l, long long r, long long k, long long mod) {\n   set<Node>::iterator end = split(r + 1);\n   set<Node>::iterator begin = split(l);\n   long long ans = 0;\n   for (set<Node>::iterator it = begin; it != end; ++it) {\n     ans = (ans +\n            (((qpow(it->val % mod, k, mod) % mod) * (it->r - it->l + 1 % mod)) %\n             mod)) %\n           mod;\n   }\n   return ans % mod;\n }\n signed main() {\n   ios::sync_with_stdio(false);\n   cin >> n >> m >> seed >> vmax;\n   for (long long i = 1; i <= n; ++i) {\n     a[i] = (rnd() % vmax) + 1;\n     t.insert(Node(i, i, a[i]));\n   }\n   for (long long i = 1; i <= m; ++i) {\n     long long opt = (rnd() % 4) + 1, l = (rnd() % n) + 1, r = (rnd() % n) + 1,\n               x, y;\n     if (l > r) swap(l, r);\n     if (opt == 3)\n       x = (rnd() % (r - l + 1)) + 1;\n     else\n       x = (rnd() % vmax) + 1;\n     if (opt == 4) y = (rnd() % vmax) + 1;\n     if (opt == 1) {\n       add(l, r, x);\n     } else if (opt == 2) {\n       assign(l, r, x);\n     } else if (opt == 3) {\n       cout << kth(l, r, x) << endl;\n     } else {\n       cout << power(l, r, x, y) << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxp = 22;\n const long double EPS = 1e-18;\n const long long INF = 1e18;\n const int MOD = 1e9 + 7;\n const int N = 2e5 + 1;\n void yesno(bool a) {\n   if (a) {\n     cout << 'YES' << '\n';\n   } else {\n     cout << 'NO' << '\n';\n   }\n }\n long long power(long long x, long long n, long long m) {\n   if (n == 0) return 1;\n   long long u = power(x, n / 2, m);\n   u = (u * u) % m;\n   if (n % 2) u = (u * x) % m;\n   return u;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   int n;\n   cin >> n;\n   long long i, arr[n];\n   for (i = 0; i < n; i++) cin >> arr[i];\n   if (n == 1) {\n     cout << 1 << ' ' << 1 << '\n';\n     cout << -arr[0] << '\n';\n     cout << 1 << ' ' << 1 << '\n';\n     cout << 0 << '\n';\n     cout << 1 << ' ' << 1 << '\n';\n     cout << 0 << '\n';\n     return 0;\n   }\n   cout << 1 << ' ' << n - 1 << '\n';\n   for (i = 0; i < n - 1; i++) {\n     long long num = arr[i] % n;\n     cout << num * (n - 1) << ' ';\n     arr[i] += num * (n - 1);\n   }\n   cout << '\n';\n   cout << n << ' ' << n << '\n';\n   long long num = arr[n - 1] % n;\n   cout << (n - num) << '\n';\n   arr[n - 1] += n - num;\n   cout << 1 << ' ' << n << '\n';\n   for (i = 0; i < n; i++) cout << -arr[i] << ' ';\n   cout << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long n;\n   cin >> n;\n   char c[n][n];\n   for (long long i = 0; i < n; i++) {\n     for (long long j = 0; j < n; j++) {\n       cin >> c[i][j];\n     }\n   }\n   bool re = 1, ce = 1;\n   for (long long i = 0; i < n; i++) {\n     re = 1;\n     for (long long j = 0; j < n; j++) {\n       if (c[i][j] != 'E') {\n         re = 0;\n       }\n     }\n     if (re == 1) {\n       break;\n     }\n   }\n   for (long long j = 0; j < n; j++) {\n     ce = 1;\n     for (long long i = 0; i < n; i++) {\n       if (c[i][j] != 'E') {\n         ce = 0;\n       }\n     }\n     if (ce == 1) {\n       break;\n     }\n   }\n   if (re == 1 && ce == 1) {\n     cout << '-1';\n     return 0;\n   }\n   if (re == 1) {\n     for (long long j = 0; j < n; j++) {\n       for (long long i = 0; i < n; i++) {\n         if (c[i][j] != 'E') {\n           cout << i + 1 << ' ' << j + 1 << '\n';\n           break;\n         }\n       }\n     }\n   } else {\n     for (long long i = 0; i < n; i++) {\n       for (long long j = 0; j < n; j++) {\n         if (c[i][j] != 'E') {\n           cout << i + 1 << ' ' << j + 1 << '\n';\n           break;\n         }\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n;\n   std::string s;\n   std::cin >> n >> s;\n   int cnt = 0;\n   for (int i = 0; i < s.length(); i++) {\n     if (s[i] == '1')\n       cnt++;\n     else {\n       std::cout << cnt;\n       cnt = 0;\n     }\n   }\n   std::cout << cnt;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long f[105][105][2];\n struct seg {\n   int a;\n   long long len;\n   bool operator<(const seg &p) const { return a < p.a; }\n } a[105];\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d%lld', &a[i].a, &a[i].len);\n   }\n   sort(a + 1, a + n + 1);\n   long long ans = 0;\n   a[0].a = -2e9;\n   for (int i = 0; i <= n; ++i)\n     for (int j = 0; j <= i; ++j) {\n       for (int k = 0; k <= 1; ++k) {\n         ans = max(ans, f[i][j][k]);\n         int pr = a[j].a + k * a[j].len;\n         int R, x;\n         for (int p = i + 1, mx = -2e9; p <= n; ++p) {\n           for (int q = 0; q <= 1; ++q) {\n             int r = a[p].a + q * a[p].len;\n             if (r > mx) mx = r, R = p, x = q;\n             f[p][R][x] =\n                 max(f[p][R][x],\n                     f[i][j][k] + min(a[p].len, (long long)r - pr) + (mx - r));\n           }\n         }\n       }\n     }\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> pq;\n vector<vector<int> > graph;\n queue<int> que;\n pair<int, int> 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 <bits/stdc++.h>\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<long long, long long> A;\n map<long long, long long>::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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long, long long> left;\n   map<long long, long long> 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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1050;\n int dp[maxn][9], nxt[maxn][9][maxn], a[maxn], n, cnt[9];\n inline int ask(int k) { return (1 << (k - 1)); }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; ++i) scanf('%d', &a[i]);\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= 8; ++j) cnt[j] = 0;\n     for (int j = 1; j <= 8; ++j)\n       for (int k = 1; k <= n; ++k) nxt[i][j][k] = 1e9;\n     for (int j = i; j <= n; ++j) nxt[i][a[j]][++cnt[a[j]]] = j;\n   }\n   int ans = 0;\n   for (int num = 0; num * 8 <= n; ++num) {\n     for (int i = 0; i < 256; ++i)\n       for (int k = 0; k <= 8; ++k) dp[i][k] = 1e9;\n     dp[0][0] = 1;\n     for (int i = 0; i < 256; ++i)\n       for (int j = 0; j <= 8; ++j)\n         for (int k = 1; k <= 8; ++k) {\n           if (dp[i][j] > n || ask(k) & i) continue;\n           dp[i ^ ask(k)][j] = min(dp[i ^ ask(k)][j], nxt[dp[i][j]][k][num] + 1);\n           dp[i ^ ask(k)][j + 1] =\n               min(dp[i ^ ask(k)][j + 1], nxt[dp[i][j]][k][num + 1] + 1);\n         }\n     for (int i = 0; i <= 8; ++i)\n       if (dp[255][i] <= n + 1) ans = max(ans, 8 * num + i);\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using lint = long long;\n using ldouble = long double;\n void solve() {\n   int n, d;\n   std::cin >> n >> d;\n   std::vector<int> vs(n, 1);\n   int diff = n * (n - 1) / 2 - d;\n   if (diff < 0) {\n     std::cout << 'NO' << std::endl;\n     return;\n   }\n   int head = 1;\n   for (int v = n - 1; v > head; --v) {\n     int to = std::max(v - diff, head);\n     --vs[v];\n     ++vs[to];\n     diff -= v - to;\n     if (diff == 0) break;\n     while (vs[head] == (1 << head)) ++head;\n   }\n   if (diff > 0) {\n     std::cout << 'NO' << std::endl;\n     return;\n   }\n   std::cout << 'YES' << std::endl;\n   int p = 1;\n   for (int i = 1; i < n; ++i) {\n     int v = p, ch = 0;\n     for (int j = 0; j < vs[i]; ++j) {\n       std::cout << v << ' ';\n       if (++ch == 2) {\n         ++v;\n         ch = 0;\n       }\n     }\n     p += vs[i - 1];\n   }\n   std::cout << std::endl;\n }\n int main() {\n   std::cin.tie(nullptr);\n   std::cout.tie(nullptr);\n   std::ios::sync_with_stdio(false);\n   int q;\n   std::cin >> q;\n   while (q--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1e9 + 7;\n const long long inf = 1e18;\n int main(void) {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     long long n, k;\n     cin >> n >> k;\n     k++;\n     long long A[n];\n     for (long long i = 0; i < n; i++) {\n       cin >> A[i];\n       long long t = 1;\n       while (A[i]--) {\n         t *= 10;\n       }\n       A[i] = t;\n     }\n     long long ans = 0;\n     for (long long i = 0; i < n; i++) {\n       long long cnt = k;\n       if (i != n - 1) {\n         cnt = min(cnt, A[i + 1] / A[i] - 1);\n       }\n       ans += A[i] * 1LL * cnt;\n       k -= cnt;\n       if (k == 0) break;\n     }\n     cout << ans << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void r(int b, int p, int f, int h, int c);\n int main() {\n   int b, p, f, h, c, t;\n   cin >> t;\n   while (t--) {\n     cin >> b >> p >> f >> h >> c;\n     r(b, p, f, h, c);\n   }\n }\n void r(int b, int p, int f, int h, int c) {\n   int i, j, k, t = 0;\n   i = b / 2;\n   if (i == 0) {\n     cout << 0 << endl;\n   } else {\n     if (i >= (p + f)) {\n       t = (p * h) + (c * f);\n       cout << t << endl;\n     } else {\n       if (h >= c) {\n         if (p >= i) {\n           t = (i * h);\n           cout << t << endl;\n         } else {\n           t = (h * p);\n           i = i - p;\n           t = t + (i * c);\n           cout << t << endl;\n         }\n       } else {\n         if (f >= i) {\n           t = (i * c);\n           cout << t << endl;\n         } else {\n           t = (c * f);\n           i = i - f;\n           t = t + (i * h);\n           cout << t << endl;\n         }\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n ;\n clock_t start;\n mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());\n const long long N = 501, lmx = 11;\n long long mx[N][N][lmx][lmx], n, m, q, col[4][N][N], logg[N];\n long long sum(long long k, long long r1, long long c1, long long r2,\n               long long c2) {\n   return col[k][r2][c2] - col[k][r2][c1] - col[k][r1][c2] + col[k][r1][c1];\n }\n void sparse() {\n   for (long long i = 2; i < N; i++) logg[i] = logg[i / 2] + 1;\n   for (long long lgi = 1; lgi < lmx; lgi++) {\n     for (long long i = 1; i <= n; i++) {\n       for (long long j = 1; j <= m; j++) {\n         if (i + (1 << (lgi - 1)) <= n)\n           mx[i][j][lgi][0] = max(mx[i][j][lgi - 1][0],\n                                  mx[i + (1 << (lgi - 1))][j][lgi - 1][0]);\n       }\n     }\n   }\n   for (long long lgi = 0; lgi < lmx; lgi++) {\n     for (long long lgj = 1; lgj < lmx; lgj++) {\n       for (long long i = 1; i <= n; i++) {\n         for (long long j = 1; j <= m; j++) {\n           long long k = lgj - 1;\n           if (j + (1 << k) <= m)\n             mx[i][j][lgi][lgj] =\n                 max(mx[i][j][lgi][k], mx[i][j + (1 << k)][lgi][k]);\n         }\n       }\n     }\n   }\n }\n long long query(long long r1, long long c1, long long r2, long long c2) {\n   if (r1 > r2 || c1 > c2) return 0;\n   long long k1 = logg[r2 - r1 + 1], k2 = logg[c2 - c1 + 1];\n   long long m1 = max(mx[r1][c1][k1][k2], mx[r2 - (1 << k1) + 1][c1][k1][k2]);\n   long long m2 = max(mx[r1][c2 - (1 << k2) + 1][k1][k2],\n                      mx[r2 - (1 << k1) + 1][c2 - (1 << k2) + 1][k1][k2]);\n   return max(m1, m2);\n }\n void solve() {\n   string s, ss = 'RGYB';\n   cin >> n >> m >> q;\n   for (long long i = 0; i < n; i++) {\n     cin >> s;\n     for (long long j = 0; j < m; j++) {\n       for (long long k = 0; k < 4; k++)\n         if (ss[k] == s[j]) col[k][i + 1][j + 1] = 1;\n     }\n   }\n   for (long long k = 0; k < 4; k++) {\n     for (long long i = 1; i <= n; i++)\n       for (long long j = 1; j <= m; j++)\n         col[k][i][j] +=\n             col[k][i - 1][j] + col[k][i][j - 1] - col[k][i - 1][j - 1];\n   }\n   for (long long i = 1; i <= n; i++) {\n     for (long long j = 1; j <= m; j++) {\n       long long lim = min(min(i, j), min(n - i, m - j));\n       for (long long len = 1; len <= lim; len++) {\n         if (sum(0, i - len, j - len, i, j) != len * len) break;\n         if (sum(1, i - len, j, i, j + len) != len * len) break;\n         if (sum(2, i, j - len, i + len, j) != len * len) break;\n         if (sum(3, i, j, i + len, j + len) != len * len) break;\n         mx[i][j][0][0] = len * len;\n       }\n     }\n   }\n   sparse();\n   while (q--) {\n     long long r1, c1, r2, c2, ans = 0;\n     cin >> r1 >> c1 >> r2 >> c2;\n     long long s = 1, e = min(r2 - r1 + 1, c2 - c1 + 1);\n     while (s <= e) {\n       long long mid = (s + e) / 2;\n       if (query(r1 + mid - 1, c1 + mid - 1, r2 - mid, c2 - mid) >= mid * mid) {\n         s = mid + 1, ans = mid;\n       } else\n         e = mid - 1;\n     }\n     cout << 4 * ans * ans << '\n';\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   start = clock();\n   cout << fixed << setprecision(15);\n   while (t--) {\n     solve();\n   }\n   double time_taken = double(clock() - start) / double(CLOCKS_PER_SEC);\n   cerr << time_taken;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }\n bool is_simple(int a) {\n   for (int i = 2; i < a; ++i) {\n     if (a % i == 0) return false;\n   }\n   return true;\n }\n int elems[200009] = {0};\n int addings[200009] = {0};\n int removes[200009] = {0};\n vector<string> orders;\n int main() {\n   int n;\n   double current_mean = 0.;\n   long long cur_num = 1;\n   scanf('%d', &n);\n   char buf[100];\n   gets(buf);\n   orders.reserve(n);\n   for (int i = 1; i < n + 1; ++i) {\n     gets(buf);\n     orders.push_back(string(buf));\n     int t = orders[i - 1][0] - '0';\n     addings[i] = addings[i - 1];\n     removes[i] = removes[i - 1];\n     if (t == 2) addings[i]++;\n     if (t == 3) removes[i]++;\n   }\n   for (int i = 0; i < n; ++i) {\n     stringstream ss(orders[i]);\n     int t;\n     ss >> t;\n     if (t == 1) {\n       int x, a;\n       ss >> a >> x;\n       double ttt = current_mean * cur_num;\n       ttt += a * x;\n       current_mean = ttt / cur_num;\n       int start_change = cur_num - (removes[n] - removes[i]);\n       if (start_change < 0) start_change = 0;\n       for (int i = start_change; i < a && i < cur_num; ++i) elems[i] += x;\n     }\n     if (t == 2) {\n       int k;\n       ss >> k;\n       elems[cur_num] = k;\n       cur_num++;\n       double ttt = current_mean * (cur_num - 1);\n       ttt += k;\n       current_mean = ttt / cur_num;\n     }\n     if (t == 3) {\n       double ttt = current_mean * (cur_num);\n       ttt -= elems[cur_num - 1];\n       cur_num--;\n       current_mean = ttt / cur_num;\n     }\n     printf('%.6f\n', current_mean);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline void chkmin(T &a, T b) {\n   if (a > b) a = b;\n }\n template <class T>\n inline void chkmax(T &a, T b) {\n   if (a < b) a = b;\n }\n long long sum[30];\n char fir[210000], sec[210000];\n int main() {\n   int len, i;\n   double ans, cnt;\n   scanf('%d', &len);\n   scanf('%s%s', fir, sec);\n   cnt = 1LL * len * (len + 1) * (2 * len + 1) / 6;\n   ans = 0;\n   memset(sum, 0, sizeof(sum));\n   for (i = len - 1; i >= 0; i--) {\n     sum[fir[i] - 'A'] += len - i;\n     ans += sum[sec[i] - 'A'] * (i + 1) / cnt;\n   }\n   memset(sum, 0, sizeof(sum));\n   for (i = len - 1; i >= 0; i--) {\n     ans += sum[fir[i] - 'A'] * (i + 1) / cnt;\n     sum[sec[i] - 'A'] += len - i;\n   }\n   printf('%.15lf\n', 1.0 * ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 5;\n int n, m, k, ans[5];\n char s[N];\n void solve(int l, int r) {\n   while (l != r) {\n     int mid = l + r >> 1;\n     printf('1 %d %d\n', mid, mid + 1);\n     fflush(stdout);\n     scanf('%s', s);\n     if (!strcmp(s, 'NIE'))\n       l = mid + 1;\n     else\n       r = mid;\n   }\n   ans[++m] = l;\n }\n int main() {\n   scanf('%d%d', &n, &k);\n   solve(1, n);\n   if (ans[1] > 1) solve(1, ans[1] - 1);\n   if (ans[1] < n) solve(ans[1] + 1, n);\n   if (m == 2) {\n     printf('2 %d %d\n', ans[1], ans[2]);\n     exit(0);\n   }\n   printf('1 %d %d\n', ans[2], ans[3]);\n   fflush(stdout);\n   scanf('%s', s);\n   if (!strcmp(s, 'NIE')) ans[2] = ans[3];\n   printf('2 %d %d\n', ans[1], ans[2]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = 2e5 + 5;\n const int highestboolN = 1e9;\n const long long unsigned inf = 1234568901234567890;\n const long double pi = 3.141592653589793;\n const int md = 1e9 + 7;\n using namespace std;\n int here = 1;\n void force_break() {\n   here++;\n   if (here >= (N * 100)) {\n     cout << '\n\n\t Infinite loop \n\n';\n     exit(1);\n   }\n   return;\n }\n int board[105][105];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int n;\n   scanf('%d', &n);\n   memset(board, 0, sizeof(board));\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       if (board[i][j]) continue;\n       char temp;\n       if ((i + j) % 2) {\n         board[i][j] = 1;\n         temp = 2;\n       } else {\n         board[i][j] = 2;\n         temp = 1;\n       }\n       if (i + 2 < n and j + 1 < n) board[i + 2][j + 1] = temp;\n       if (i + 1 < n and j + 2 < n) board[i + 1][j + 2] = temp;\n       if (i + 2 < n and j - 1 >= 0) board[i + 2][j - 1] = temp;\n       if (i + 1 < n and j - 2 >= 0) board[i + 1][j - 2] = temp;\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       if (board[i][j] == 1)\n         cout << 'B';\n       else if (board[i][j] == 2)\n         cout << 'W';\n     }\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long arr[1010], brr[1010];\n int main() {\n   long long n, i, j, x, y, ans;\n   cin >> n;\n   for (i = 1; i <= n; i++) cin >> arr[i];\n   for (i = 1; i <= n; i++) cin >> brr[i];\n   ans = 0;\n   for (i = 1; i <= n; i++) {\n     x = arr[i];\n     y = brr[i];\n     ans = max(ans, x + y);\n     for (j = i + 1; j <= n; j++) {\n       x = (x | arr[j]);\n       y = (y | brr[j]);\n       ans = max(ans, x + y);\n     }\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n long long dp[26][2][2];\n long long need;\n bool hasone = 0;\n int ans[55];\n inline void upd(long long &a, long long b) { a += b; }\n inline long long getval(int p, int v) {\n   memset(dp, 0, sizeof(dp));\n   dp[0][0][0] = 1;\n   for (int i = 0; i < (n + 1) / 2; i++) {\n     for (int x = 0; x < 2; x++) {\n       for (int y = 0; y < 2; y++) {\n         if (!dp[i][x][y]) continue;\n         for (int a = 0; a < 2; a++) {\n           if (!i && a) continue;\n           if (i <= p && a != ans[i]) continue;\n           for (int b = 0; b < 2; b++) {\n             if ((n - 1 - i) <= p && b != ans[n - 1 - i]) continue;\n             if (i == n - 1 - i && a != b) continue;\n             if (a > b && !x) continue;\n             if (a > !b && !y) continue;\n             upd(dp[i + 1][x | (a < b)][y | (a < !b)], dp[i][x][y]);\n           }\n         }\n       }\n     }\n   }\n   return dp[(n + 1) / 2][0][0] + dp[(n + 1) / 2][0][1] + dp[(n + 1) / 2][1][0] +\n          dp[(n + 1) / 2][1][1] - !hasone;\n }\n int main() {\n   cin >> n >> need;\n   dp[0][0][0] = 1;\n   for (int i = 0; i < (n + 1) / 2; i++) {\n     for (int x = 0; x < 2; x++) {\n       for (int y = 0; y < 2; y++) {\n         if (!dp[i][x][y]) continue;\n         for (int a = 0; a < 2; a++) {\n           if (!i && a) continue;\n           for (int b = 0; b < 2; b++) {\n             if (i == n - 1 - i && a != b) continue;\n             if (a > b && !x) continue;\n             if (a > !b && !y) continue;\n             upd(dp[i + 1][x | (a < b)][y | (a < !b)], dp[i][x][y]);\n           }\n         }\n       }\n     }\n   }\n   long long all = dp[(n + 1) / 2][0][0] + dp[(n + 1) / 2][0][1] +\n                   dp[(n + 1) / 2][1][0] + dp[(n + 1) / 2][1][1];\n   all--;\n   if (all < need) {\n     printf('-1\n');\n     return 0;\n   }\n   for (int i = 0; i < n; i++) {\n     ans[i] = 0;\n     long long num = getval(i, ans[i]);\n     if (num < need || (i == n - 1 && !hasone)) {\n       ans[i] = 1;\n       need -= num;\n       hasone = 1;\n     }\n   }\n   for (int i = 0; i < n; i++) printf('%d', ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline void read(T& x) {\n   int f = 0, c = getchar();\n   x = 0;\n   while (!isdigit(c)) f |= c == '-', c = getchar();\n   while (isdigit(c)) x = x * 10 + c - 48, c = getchar();\n   if (f) x = -x;\n }\n template <typename T, typename... Args>\n inline void read(T& x, Args&... args) {\n   read(x);\n   read(args...);\n }\n template <typename T>\n void write(T x) {\n   if (x < 0) x = -x, putchar('-');\n   if (x > 9) write(x / 10);\n   putchar(x % 10 + 48);\n }\n template <typename T>\n void writes(T x) {\n   write(x);\n   putchar(' ');\n }\n template <typename T>\n void writeln(T x) {\n   write(x);\n   puts('');\n }\n template <typename T>\n inline bool chkmin(T& x, const T& y) {\n   return y < x ? (x = y, true) : false;\n }\n template <typename T>\n inline bool chkmax(T& x, const T& y) {\n   return x < y ? (x = y, true) : false;\n }\n const int maxn = (int)3e5 + 10;\n const long long inf = (long long)1e18;\n const int mod = (int)1e9 + 7;\n int n, a[maxn];\n long long ans;\n vector<int> v[maxn];\n int main() {\n   read(n);\n   for (int i = (1); i < (2 * n + 1); i++) read(a[i]);\n   for (int i = (1); i < (2 * n + 1); i++) {\n     v[a[i]].push_back(i);\n   }\n   int now = 1;\n   for (int i = (1); i < (n + 1); i++) {\n     ans += abs(v[i][0] - now);\n     now = v[i][0];\n   }\n   now = 1;\n   for (int i = (1); i < (n + 1); i++) {\n     ans += abs(v[i][1] - now);\n     now = v[i][1];\n   }\n   write(ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const bool debug = 1;\n int xl = 1 << 30, xr = -(1 << 30), yl = 1 << 30, yr = -(1 << 30), zl = 1 << 30,\n     zr = -(1 << 30);\n bool getpod(pair<int, int> p, int s) {\n   int pzl = p.first - p.second - s;\n   int pzr = p.first - p.second + s;\n   int pxl = p.first - s;\n   int pxr = p.first + s;\n   int pyl = p.second - s;\n   int pyr = p.second + s;\n   if (pzl <= zl && pzr >= zr && pyl <= yl && pyr >= yr && pxl <= xl &&\n       pxr >= xr)\n     return 1;\n   return 0;\n }\n int main() {\n   if (!debug) {\n     cin.tie(0);\n     cout.tie(0);\n     ios::sync_with_stdio(0);\n   }\n   int n;\n   cin >> n;\n   vector<pair<int, int>> pt(n, {0, 0});\n   for (int i = 0; i < n; i++) {\n     string s;\n     cin >> s;\n     for (int j = 0; j < s.size(); j++)\n       if (s[j] == 'B')\n         pt[i].first++;\n       else\n         pt[i].second++;\n   }\n   for (int i = 0; i < n; i++) {\n     xl = min(pt[i].first, xl);\n     xr = max(pt[i].first, xr);\n     yl = min(pt[i].second, yl);\n     yr = max(pt[i].second, yr);\n     zl = min(pt[i].first - pt[i].second, zl);\n     zr = max(pt[i].first - pt[i].second, zr);\n   }\n   vector<pair<int, int>> p(12);\n   vector<int> s(12);\n   {\n     int l = -1, r = 1 << 23;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {zr + yl, yl + c};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[0] = r;\n     p[0] = {zr + yl, yl + s[0]};\n   }\n   {\n     int l = -1, r = 1 << 23;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {xl + c, xl - zl};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[1] = r;\n     p[1] = {xl + s[1], xl - zl};\n   }\n   {\n     int l = -1, r = 1 << 23;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {zl + yr, yr - c};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[2] = r;\n     p[2] = {zl + yr, yr - s[2]};\n   }\n   {\n     int l = -1, r = 1 << 23;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {xr - c, xr - zr};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[3] = r;\n     p[3] = {xr - s[3], xr - zr};\n   }\n   {\n     int l = -1, r = 1 << 23;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {xr - c, yr - c};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[4] = r;\n     p[4] = {xr - s[4], yr - s[4]};\n   }\n   {\n     int l = -1, r = 1 << 23;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {xl + c, yl + c};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[5] = r;\n     p[5] = {xl + s[5], yl + s[5]};\n   }\n   {\n     int l = -1, r = zl - xl + yr;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {xl + c, yr - c};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[6] = r;\n     p[6] = {xl + s[6], yr - s[6]};\n   }\n   {\n     int l = -1, r = xr - yl - zr;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {xr - c, yl + c};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[7] = r;\n     p[7] = {xr - s[7], yl + s[7]};\n   }\n   {\n     int l = -1, r = xr - zl - yr;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {xr - c, xr - zl - 2 * c};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[8] = r;\n     p[8] = {xr - s[8], xr - zl - 2 * s[8]};\n   }\n   {\n     int l = -1, r = zr + yr - xr;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {zr + yr - 2 * c, yr - c};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[9] = r;\n     p[9] = {zr + yr - 2 * s[9], yr - s[9]};\n   }\n   {\n     int l = -1, r = yl + zr - xl;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {xl + c, xl - zr + 2 * c};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[10] = r;\n     p[10] = {xl + s[10], xl - zr + 2 * s[10]};\n   }\n   {\n     int l = -1, r = xl - zl - yl;\n     while (l + 1 < r) {\n       int c = (l + r) / 2;\n       pair<int, int> p = {zl + yl + 2 * c, yl + c};\n       if (getpod(p, c))\n         r = c;\n       else\n         l = c;\n     }\n     s[11] = r;\n     p[11] = {zl + yl + 2 * s[11], yl + s[11]};\n   }\n   int iout = 0;\n   for (int i = 0; i < 12; i++)\n     if (s[i] < s[iout] && getpod(p[i], s[i])) iout = i;\n   cout << s[iout] << '\n';\n   for (int i = 0; i < p[iout].first; i++) cout << 'B';\n   for (int i = 0; i < p[iout].second; i++) cout << 'N';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int arr[3][3];\n   int cnt1, cnt2, cnt3;\n   for (int i = 0; i < 3; i++)\n     for (int j = 0; j < 3; j++) scanf('%d', &arr[i][j]);\n   cnt1 = arr[0][1] + arr[0][2];\n   cnt2 = arr[1][0] + arr[1][2];\n   cnt3 = arr[2][0] + arr[2][1];\n   if (cnt1 >= cnt2 && cnt1 >= cnt3) {\n     for (int i = 1; i <= 1e5; i++)\n       if (cnt1 + i == cnt2 + (cnt1 - cnt2 + i) &&\n           cnt1 + i == cnt3 + (cnt1 - cnt3 + i) &&\n           i + (cnt1 - cnt3 + i) + (cnt1 - cnt2 + i) == cnt1 + i) {\n         arr[0][0] = i;\n         arr[1][1] = (cnt1 - cnt2 + i);\n         arr[2][2] = (cnt1 - cnt3 + i);\n         break;\n       }\n   } else if (cnt2 >= cnt1 && cnt2 >= cnt3) {\n     for (int i = 1; i <= 1e5; i++)\n       if (cnt2 + i == cnt1 + (cnt2 - cnt1 + i) &&\n           cnt2 + i == cnt3 + (cnt2 - cnt3 + i) &&\n           i + (cnt2 - cnt3 + i) + (cnt2 - cnt1 + i) == cnt2 + i) {\n         arr[0][0] = (cnt2 - cnt1 + i);\n         arr[1][1] = i;\n         arr[2][2] = (cnt2 - cnt3 + i);\n         break;\n       }\n   } else if (cnt3 >= cnt1 && cnt3 >= cnt2) {\n     for (int i = 1; i <= 1e5; i++)\n       if (cnt3 + i == cnt1 + (cnt3 - cnt1 + i) &&\n           cnt3 + i == cnt2 + (cnt3 - cnt2 + i) &&\n           i + (cnt3 - cnt2 + i) + (cnt3 - cnt1 + i) == cnt3 + i) {\n         arr[0][0] = (cnt3 - cnt1 + i);\n         arr[1][1] = (cnt3 - cnt2 + i);\n         arr[2][2] = i;\n         break;\n       }\n   }\n   for (int i = 0; i < 3; i++) {\n     for (int j = 0; j < 3; j++) printf('%d ', arr[i][j]);\n     puts('');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, x, a1, a2;\n int main() {\n   scanf('%lld', &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%lld', &x);\n     if (i % 2 == 0) {\n       a1 += (x + 1) / 2;\n       a2 += x / 2;\n     } else {\n       a1 += x / 2;\n       a2 += (x + 1) / 2;\n     }\n   }\n   printf('%lld\n', min(a1, a2));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);\n   int a, b, c;\n   cin >> a >> b >> c;\n   cout << ((a + c - 1) * (b + c - 1) - c * (c - 1)) << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1e9 + 7;\n long long dx[] = {-1, 0, 1, 0};\n long long dy[] = {0, -1, 0, 1};\n vector<long long> p(10000005, -1);\n void f(long long n = 10000005) {\n   p[2] = 2;\n   for (long long i = 4; i < n; i += 2) {\n     p[i] = 2;\n   }\n   for (long long i = 3; i < n; i += 2) {\n     if (p[i] == -1) {\n       p[i] = i;\n       for (long long j = i * i; j < n; j += i) {\n         if (p[j] == -1) p[j] = i;\n       }\n     }\n   }\n }\n void find(long long x, vector<long long>& v) {\n   while (x != 1) {\n     v.push_back(p[x]);\n     x /= p[x];\n   }\n }\n void solve() {\n   long long n, m;\n   cin >> n >> m;\n   vector<vector<long long>> v(n, vector<long long>(m));\n   map<long long, vector<long long>> z;\n   for (long long i = 0; i < n; i++) {\n     for (long long j = 0; j < m; j++) {\n       cin >> v[i][j];\n       z[i + j].push_back(v[i][j]);\n     }\n   }\n   long long f = 0, r = n + m - 2;\n   long long ans = 0;\n   while (f < r) {\n     map<long long, long long> p;\n     for (auto x : z[f]) p[x]++;\n     for (auto x : z[r]) p[x]++;\n     long long t = 0, mx = 0;\n     for (auto x : p) {\n       t += x.second;\n       mx = max(mx, x.second);\n     }\n     ans += t - mx;\n     f++;\n     r--;\n   }\n   cout << ans << '\n';\n }\n int32_t main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long t;\n   cin >> t;\n   while (t--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char str[100005];\n int cnt[250];\n int main() {\n   scanf('%s', &str);\n   int len = strlen(str);\n   set<char> myset;\n   for (int i = 0; i < len; i++) {\n     myset.insert(str[i]);\n     cnt[str[i]]++;\n   }\n   if (myset.size() == 1 || myset.size() > 4) {\n     printf('NO');\n     return 0;\n   }\n   if (myset.size() == 4) {\n     printf('YES');\n     return 0;\n   }\n   if (myset.size() == 3) {\n     if (len == 3) {\n       printf('NO');\n       return 0;\n     } else {\n       printf('YES');\n       return 0;\n     }\n   }\n   if (myset.size() == 2) {\n     for (int i = 'a'; i <= 'z'; i++) {\n       if (cnt[i] == 1) {\n         printf('NO');\n         return 0;\n       }\n     }\n     printf('YES');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX_N = 100005;\n int n, m;\n int t[MAX_N], x[MAX_N];\n int nxt;\n int idx[MAX_N];\n int res[MAX_N];\n bool mycmp(const int a, const int b) {\n   if (x[a] != x[b]) return x[a] < x[b];\n   return a < b;\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < n; ++i) scanf('%d%d', &t[i], &x[i]);\n   int time = 0;\n   for (int step = 0; step < n; step += m) {\n     nxt = 0;\n     for (int i = step; i < min(step + m, n); ++i) idx[nxt++] = i;\n     time += max(0, t[idx[nxt - 1]] - time);\n     sort(idx, idx + nxt, mycmp);\n     for (int i = 0; i < nxt;) {\n       int j = i;\n       for (; j < nxt && x[idx[i]] == x[idx[j]]; ++j)\n         ;\n       time += x[idx[i]];\n       if (i > 0) time -= x[idx[i - 1]];\n       for (int k = i; k < j; ++k) res[idx[k]] = time;\n       time += 1 + (j - i) / 2;\n       i = j;\n     }\n     time += x[idx[nxt - 1]];\n   }\n   printf('%d', res[0]);\n   for (int i = 1; i < n; ++i) printf(' %d', res[i]);\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 2e5 + 7;\n const int mod = 1e9 + 7;\n const long long INF = 1e18;\n string a[30], b[30], ans[407];\n void rua() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   for (int i = 0; i < m; i++) cin >> b[i];\n   int cnt = 0, s1 = -1, s2 = -1;\n   while (cnt < n * m) {\n     s1 = (s1 + 1) % n;\n     s2 = (s2 + 1) % m;\n     ans[cnt++] = a[s1] + b[s2];\n   }\n   int q;\n   cin >> q;\n   while (q--) {\n     int x;\n     cin >> x;\n     cout << ans[(x - 1) % (n * m)] << endl;\n   }\n }\n int main() {\n   rua();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main(int argc, char *argv[]) {\n   int n, i, a, b, c, d;\n   long int s;\n   scanf('%d', &n);\n   s = 0;\n   for (i = 1; i <= n; i++) {\n     scanf('%d %d %d %d', &a, &b, &c, &d);\n     s = s + (1 + abs(a - c)) * (1 + abs(b - d));\n   }\n   printf('%ld', s);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int a, int b) {\n   if (b == 0)\n     return a;\n   else\n     return gcd(b, a % b);\n }\n long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }\n int main() {\n   ios_base::sync_with_stdio(false);\n   int n, m;\n   cin >> n >> m;\n   vector<vector<int> > edges(n + 10, vector<int>());\n   for (int i = 0; i < m; i++) {\n     int x, y;\n     cin >> x >> y;\n     edges[x].push_back(y);\n     edges[y].push_back(x);\n   }\n   map<int, int> not_first;\n   map<int, int> not_second;\n   map<int, int> not_third;\n   set<int> first;\n   set<int> second;\n   set<int> third;\n   for (int i = 1; i < n + 1; i++) {\n     if (not_first.find(i) == not_first.end()) {\n       first.insert(i);\n       for (int j = 0; j < edges[i].size(); j++) {\n         not_first[edges[i][j]]++;\n       }\n     } else if (not_second.find(i) == not_second.end()) {\n       second.insert(i);\n       for (int j = 0; j < edges[i].size(); j++) {\n         not_second[edges[i][j]]++;\n       }\n     } else if (not_third.find(i) == not_third.end()) {\n       third.insert(i);\n       for (int j = 0; j < edges[i].size(); j++) {\n         not_third[edges[i][j]]++;\n       }\n     } else {\n       cout << -1;\n       return 0;\n     }\n   }\n   if (second.size() == 0 or third.size() == 0) {\n     cout << -1;\n   } else {\n     for (auto i = not_first.begin(); i != not_first.end(); i++) {\n       if (i->second != first.size()) {\n         cout << -1;\n         return 0;\n       }\n     }\n     for (auto i = not_second.begin(); i != not_second.end(); i++) {\n       if (i->second != second.size()) {\n         cout << -1;\n         return 0;\n       }\n     }\n     for (auto i = not_third.begin(); i != not_third.end(); i++) {\n       if (i->second != third.size()) {\n         cout << -1;\n         return 0;\n       }\n     }\n     vector<int> cols(n + 1, 0);\n     for (auto i = first.begin(); i != first.end(); i++) {\n       cols[*i] = 1;\n     }\n     for (auto i = second.begin(); i != second.end(); i++) {\n       cols[*i] = 2;\n     }\n     for (auto i = third.begin(); i != third.end(); i++) {\n       cols[*i] = 3;\n     }\n     for (int i = 1; i < n + 1; i++) {\n       cout << cols[i] << ' ';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimization('unroll-loops')\n #pragma GCC optimize('Ofast')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4')\n using namespace std;\n const int BASE = 1000000;\n char what[1 << 20];\n pair<int, int> nxt[10][1 << 20];\n pair<long long, int> to[10][10];\n inline long long Calc(long long x) {\n   long long suff = x / BASE, pref = x % BASE;\n   long long ans = suff;\n   while (suff > 0) {\n     ans += nxt[what[suff]][pref].first;\n     pref = nxt[what[suff]][pref].second;\n     pref += BASE - max(what[suff], what[pref]);\n     --suff;\n   }\n   return ans + nxt[0][pref].first;\n }\n inline long long Process(long long x) {\n   long long suff = x / (1LL * BASE * BASE), psuff = x / BASE % BASE,\n             pref = x % BASE;\n   if (suff == 0) {\n     return Calc(x);\n   }\n   long long ans = 0;\n   while (psuff >= 0) {\n     ans += nxt[max(what[psuff], what[suff])][pref].first + 1;\n     pref = nxt[max(what[psuff], what[suff])][pref].second;\n     pref += BASE - max(what[psuff], max(what[suff], what[pref]));\n     --psuff;\n   }\n   --suff;\n   while (suff > 0) {\n     ans += to[what[suff]][BASE - pref].first;\n     pref = to[what[suff]][BASE - pref].second;\n     --suff;\n   }\n   return ans + Calc(1LL * (BASE - 1) * BASE + pref);\n }\n int main() {\n   for (int i = 1; i <= BASE; ++i) {\n     what[i] = i % 10 > what[i / 10] ? i % 10 : what[i / 10];\n     for (int d = 0; d < 10; ++d) {\n       char r = what[i] < d ? d : what[i];\n       if (i >= r) {\n         nxt[d][i] = make_pair(nxt[d][i - r].first + 1, nxt[d][i - r].second);\n       } else {\n         nxt[d][i] = make_pair(0, i);\n       }\n     }\n   }\n   for (char d = 1; d < 10; ++d) {\n     for (int l = 0; l < 10; ++l) {\n       int suff = BASE - 1, pref = BASE - l;\n       to[d][l].first = BASE;\n       while (suff >= 0) {\n         char r = (d < what[suff] ? what[suff] : d);\n         to[d][l].first += nxt[r][pref].first;\n         pref = nxt[r][pref].second;\n         pref += BASE - (r < what[pref] ? what[pref] : r);\n         --suff;\n       }\n       to[d][l].second = pref;\n     }\n   }\n   long long n;\n   cin >> n;\n   cout << Process(n) << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int MAXN = 200000 + 10;\n const int INF = 0x7fffffff;\n using namespace std;\n struct EDGE {\n   int u, v, w;\n   bool operator<(const EDGE &b) const { return w > b.w; }\n };\n int fa[MAXN + MAXN];\n int n, m, vis[MAXN];\n int Min[MAXN];\n vector<EDGE> edge;\n int Find(int x) { return fa[x] < 0 ? x : fa[x] = Find(fa[x]); }\n int main() {\n   edge.clear();\n   scanf('%d%d', &n, &m);\n   memset(fa, -1, sizeof(fa));\n   memset(vis, 0, sizeof(vis));\n   for (int i = 1; i <= m; i++) {\n     int a, b, w;\n     scanf('%d%d%d', &a, &b, &w);\n     edge.push_back((EDGE){a, b, w});\n   }\n   sort(edge.begin(), edge.end());\n   long long Ans = 0ll;\n   for (int i = 0; i < m; i++) {\n     int u = edge[i].u, v = edge[i].v;\n     u = Find(u);\n     v = Find(v);\n     if (u == v) {\n       if (fa[u] == -2) continue;\n       fa[u] = -2;\n       Ans += (long long)edge[i].w;\n       continue;\n     }\n     if (fa[u] == -2 && fa[v] == -2) continue;\n     fa[v] = min(fa[v], fa[u]);\n     Ans += (long long)edge[i].w;\n     fa[u] = v;\n   }\n   printf('%lld\n', Ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int intervalo[200010];\n int aparicoes[200010];\n int aceito[200010];\n int main() {\n   int n, k, q;\n   cin >> n >> k >> q;\n   int l, r;\n   for (int i = 0; i < n; i++) {\n     cin >> l >> r;\n     intervalo[l] += 1;\n     intervalo[r + 1] -= 1;\n   }\n   int x = 0;\n   for (int i = 1; i <= 200000; i++) {\n     x += intervalo[i];\n     aparicoes[i] = x;\n   }\n   for (int i = 1; i <= 200000; i++) {\n     if (aparicoes[i] >= k)\n       aceito[i] = 1;\n     else\n       aceito[i] = 0;\n     aceito[i] += aceito[i - 1];\n   }\n   for (int i = 0; i < q; i++) {\n     cin >> l >> r;\n     cout << aceito[r] - aceito[l - 1] << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string a, b;\n   cin >> a;\n   b = a;\n   for (string::reverse_iterator itr = a.rbegin(); itr != a.rend(); itr++)\n     b += *itr;\n   cout << b << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using lint = long long;\n const int inf = 1000000007;\n const int MOD = 1000000007;\n int f(int x) {\n   int res = 0;\n   while (x > 0) {\n     res += x % 10;\n     x /= 10;\n   }\n   return res;\n }\n bool calc(int n, int k) {\n   int sm = 0;\n   for (int i = 0; i < k; ++i) {\n     sm += f(i);\n   }\n   for (int i = k; i <= 100000; ++i) {\n     sm += f(i);\n     if (sm == n) {\n       cout << i - k << '\n';\n       return true;\n     }\n     sm -= f(i - k);\n   }\n   if (n <= 45) {\n     cout << -1 << '\n';\n     return true;\n   }\n   return false;\n }\n void solve() {\n   int n, k;\n   cin >> n >> k;\n   if (calc(n, k)) return;\n   n -= k * (k + 1) / 2;\n   if (n < 0) {\n     cout << -1 << '\n';\n     return;\n   }\n   int top = 0;\n   string mid;\n   int last = 0;\n   int cnt = 0;\n   while (n % (k + 1) != 0) {\n     n += 9;\n     cnt++;\n     if (cnt > 9) {\n       cout << -1 << '\n';\n       return;\n     }\n   }\n   if (n - cnt * 9 < (k - cnt) * 9) {\n     cout << -1 << '\n';\n     return;\n   }\n   last = 9 - (k - cnt);\n   n /= (k + 1);\n   n -= last;\n   while (n > 9) {\n     n -= 9;\n     mid += '9';\n   }\n   top = n;\n   if (cnt > 0) {\n     int l = mid.length();\n     if (l != 0) {\n       mid[l - 1] = '8';\n       top++;\n     }\n   }\n   string hoge;\n   while (top > 9) {\n     top -= 9;\n     hoge += '9';\n   }\n   if (top > 0) cout << top;\n   cout << hoge << mid << last << '\n';\n }\n signed main() {\n   int t;\n   cin >> t;\n   for (int i = 0; i < t; ++i) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3,no-stack-protector,unroll-loops,fast-math')\n using namespace std;\n struct coor {\n   long long x, y, x1, y1;\n };\n vector<struct coor> v;\n struct coor ldp[200005], rdp[200005];\n struct coor inter(struct coor l, struct coor r) {\n   struct coor res = {INT_MIN, INT_MIN, INT_MIN, INT_MIN};\n   if (min(l.x1, r.x1) < max(r.x, l.x) || min(l.y1, r.y1) < max(r.y, l.y))\n     return res;\n   res.x = max(l.x, r.x);\n   res.x1 = min(l.x1, r.x1);\n   res.y = max(l.y, r.y);\n   res.y1 = min(l.y1, r.y1);\n   return res;\n }\n bool check(struct coor l) { return (l.x != INT_MIN); }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long a = 0, b = 0, c, d, e, f = 0, l, g, m, n, k, i, j, t, p, q;\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> a >> b >> c >> d;\n     v.push_back({a, b, c, d});\n   }\n   ldp[0] = v[0];\n   for (i = 1; i < n; i++) {\n     ldp[i] = inter(ldp[i - 1], v[i]);\n   }\n   rdp[n - 1] = v[n - 1];\n   for (i = n - 2; i >= 0; i--) {\n     rdp[i] = inter(rdp[i + 1], v[i]);\n   }\n   if (check(ldp[n - 2])) {\n     cout << ldp[n - 2].x << ' ' << ldp[n - 2].y << '\n';\n   } else if (check(rdp[1])) {\n     cout << rdp[1].x << ' ' << rdp[1].y << '\n';\n   } else {\n     for (i = 1; i < n - 1; i++) {\n       struct coor fin = inter(ldp[i - 1], rdp[i + 1]);\n       if (check(fin)) {\n         cout << fin.x << ' ' << fin.y << '\n';\n         return 0;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t, n, a, b, c, d;\n   cin >> t;\n   while (t--) {\n     cin >> n >> a >> b >> c >> d;\n     int mi = (a - b) * n, ma = (a + b) * n;\n     if ((mi > c + d) || (ma < c - d))\n       cout << 'NO' << endl;\n     else\n       cout << 'YES' << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n using namespace std;\n const long long mod = 1000000007;\n void solve() {\n   int n, m, u, v;\n   cin >> n >> m;\n   vector<int> adj[n + 1];\n   for (int i = 0; i < m; i++) {\n     cin >> u >> v;\n     adj[u].push_back(v);\n     adj[v].push_back(u);\n   }\n   vector<pair<long long, long long> > hash, hash_orig;\n   hash.reserve(n);\n   long long p1 = 31, p2 = 53, h1, h2;\n   long long pow_p1[n + 1], pow_p2[n + 1];\n   pow_p1[0] = pow_p2[0] = 1;\n   for (int i = 1; i <= n; i++) {\n     pow_p1[i] = pow_p1[i - 1] * p1 % mod;\n     pow_p2[i] = pow_p2[i - 1] * p2 % mod;\n   }\n   for (int i = 1; i <= n; i++) {\n     h1 = 0;\n     h2 = 0;\n     for (int &j : adj[i]) {\n       h1 += pow_p1[j];\n       h2 += pow_p2[j];\n     }\n     hash.push_back({h1, h2});\n   }\n   hash_orig = hash;\n   sort((hash).begin(), (hash).end());\n   long long ans = 0;\n   int cnt = 1;\n   for (int i = 1; i < n; i++) {\n     if (hash[i] != hash[i - 1]) {\n       ans += 1ll * cnt * (cnt - 1) / 2;\n       cnt = 1;\n     } else\n       cnt++;\n   }\n   ans += 1ll * cnt * (cnt - 1) / 2;\n   for (int i = 1; i <= n; i++) {\n     hash_orig[i - 1].first += pow_p1[i];\n     hash_orig[i - 1].second += pow_p2[i];\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int &j : adj[i]) {\n       if (j < i || adj[i].size() != adj[j].size()) continue;\n       if (hash_orig[i - 1] == hash_orig[j - 1]) ans++;\n     }\n   }\n   cout << ans << '\n';\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int t = 1;\n   while (t--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using namespace std;\n typedef long long int ll;\n typedef unsigned long long int ull;\n inline void smax(int &x, int y) { x = max(x, y); }\n inline void smin(int &x, int y) { x = min(x, y); }\n ll gcd(ll a, ll b) { return ((b == 0) ? a : gcd(b, a % b)); }\n const double PI = acos(-1.0l);\n vector<long long> rev;\n vector<complex<double> > omega;\n void calc_rev(long long n, long long log_n) {\n   rev.resize(n);\n   omega.resize(n);\n   for (long long i = 0; i < n; i++) {\n     rev[i] = 0;\n     for (long long j = 0; j < log_n; j++) {\n       if ((i >> j) & 1) rev[i] |= 1 << (log_n - j - 1);\n     }\n   }\n }\n void fft(vector<complex<double> > &A, long long n, bool invert) {\n   for (long long i = 0; i < n; i++) {\n     if (i < rev[i]) swap(A[i], A[rev[i]]);\n   }\n   for (long long len = 2; len <= n; len <<= 1) {\n     double ang = 2 * PI / len * (invert ? -1 : +1);\n     long long half = (len >> 1);\n     complex<double> curomega(cos(ang), sin(ang));\n     omega[0] = complex<double>(1, 0);\n     for (long long i = 1; i < half; i++) omega[i] = omega[i - 1] * curomega;\n     for (long long i = 0; i < n; i += len) {\n       complex<double> t;\n       long long pu = i, pv = i + half, pu_end = i + half, pw = 0;\n       for (; pu != pu_end; pu++, pv++, pw++) {\n         t = A[pv] * omega[pw];\n         A[pv] = A[pu] - t;\n         A[pu] += t;\n       }\n     }\n   }\n   if (invert)\n     for (long long i = 0; i < n; i++) A[i] /= n;\n }\n void multiply(long long n, vector<complex<double> > &A,\n               vector<complex<double> > &B, vector<long long> &C) {\n   fft(A, n, false);\n   fft(B, n, false);\n   for (long long i = 0; i < n; i++) A[i] *= B[i];\n   fft(A, n, true);\n   for (long long i = 0; i < n; i++) {\n     C[i] = (long long)(A[i].real() + 0.5);\n     C[i] = min(C[i], 1LL);\n   }\n }\n void Solve(long long n, vector<long long> &coeffA, vector<long long> &coeffB,\n            vector<long long> &result) {\n   vector<complex<double> > A(n), B(n);\n   for (long long i = 0; i < n; i++) A[i] = coeffA[i];\n   for (long long i = 0; i < n; i++) B[i] = coeffB[i];\n   multiply(n, A, B, result);\n }\n void do_FFT(vector<long long> &A, vector<long long> &B,\n             vector<long long> &result) {\n   long long n = 1, bits = 0;\n   while (n < 2 * A.size() || n < 2 * B.size()) n <<= 1, bits++;\n   result.resize(n, 0);\n   calc_rev(n, bits);\n   vector<long long> tempA(A.begin(), A.end());\n   vector<long long> tempB(B.begin(), B.end());\n   tempA.resize(n);\n   tempB.resize(n);\n   Solve(n, tempA, tempB, result);\n }\n vector<ll> polpow(vector<ll> &arr, long long k) {\n   vector<ll> sol;\n   while (k > 0) {\n     if (k % 2) {\n       if (sol.size() == 0)\n         for (__typeof(arr.size()) i = (0) - ((0) > (arr.size()));\n              i != (arr.size()) - ((0) > (arr.size()));\n              i += 1 - 2 * ((0) > (arr.size())))\n           sol.push_back(arr[i]);\n       else\n         do_FFT(sol, arr, sol);\n     }\n     do_FFT(arr, arr, arr);\n     k = k / 2;\n   }\n   return sol;\n }\n int32_t main() {\n   long long n, k;\n   cin >> n >> k;\n   vector<long long> v(n);\n   for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));\n        i += 1 - 2 * ((0) > (n)))\n     cin >> v[i];\n   vector<ll> arr(1001);\n   for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));\n        i += 1 - 2 * ((0) > (n))) {\n     arr[v[i]] = 1;\n   }\n   while (arr.back() == 0) {\n     arr.pop_back();\n   }\n   vector<ll> res = polpow(arr, k);\n   for (__typeof(res.size()) i = (1) - ((1) > (res.size()));\n        i != (res.size()) - ((1) > (res.size()));\n        i += 1 - 2 * ((1) > (res.size()))) {\n     if (res[i] > 0) cout << i << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m = 0;\n   cin >> n;\n   int last;\n   for (int(i) = 0; (i) < (n); ++(i)) {\n     cin >> last;\n     m += last;\n   }\n   cout << ((n - m == 1 && n > 1) || (n == 1 && m == 1) ? 'YES\n' : 'NO\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, trie[100100][27], sz = 1, ok[2][100100];\n char s[100100];\n void add() {\n   int v = 0;\n   for (int i = 0; s[i] != '\0'; i++) {\n     if (trie[v][s[i] - 'a'] == 0) trie[v][s[i] - 'a'] = sz++;\n     v = trie[v][s[i] - 'a'];\n   }\n }\n void calc(int v, bool bo, int temp[30]) {\n   int arr[5];\n   for (int i = 0; i < 5; i++) arr[i] = 0;\n   for (int i = 0; i < 26; i++) {\n     if (temp[i] == -1) continue;\n     if (temp[i] == 0) {\n       ok[bo][v] = 0;\n       break;\n     }\n     if (temp[i] == 1) {\n       if (arr[2]) {\n         ok[bo][v] = 0;\n         break;\n       }\n     }\n     if (temp[i] == 2) {\n       if (arr[1]) {\n         ok[bo][v] = 0;\n         break;\n       }\n     }\n     arr[temp[i]]++;\n   }\n   if (ok[bo][v] != 0)\n     ok[bo][v] = (arr[3] && !arr[1] && !arr[2] ? 3 : (arr[1] ? 1 : 2));\n }\n int dfs(int v, bool st, bool bo) {\n   int cnt = 0, temp[26];\n   for (int i = 0; i < 26; i++) temp[i] = -1;\n   for (int i = 0; i < 26; i++) {\n     if (!trie[v][i]) continue;\n     cnt++;\n     temp[i] = dfs(trie[v][i], !st, bo);\n     if (temp[i] == 1)\n       ok[bo][v] = (ok[bo][v] < 2 ? 1 : 3);\n     else if (temp[i] == 2)\n       ok[bo][v] = (ok[bo][v] == 2 || ok[bo][v] == 0 ? 2 : 3);\n     else if (temp[i] == 3)\n       ok[bo][v] = 3;\n   }\n   if (cnt > 1 && !st && !bo) calc(v, bo, temp);\n   if (cnt > 1 && st && bo) calc(v, bo, temp);\n   if (cnt == 0) ok[bo][v] = (st ? 2 : 1);\n   return ok[bo][v];\n }\n int main() {\n   scanf('%d%d', &n, &k);\n   for (int i = 0; i < n; i++) {\n     scanf('%s', &s);\n     add();\n   }\n   dfs(0, 1, 0);\n   dfs(0, 1, 1);\n   if (ok[0][0] == 3)\n     printf('First\n');\n   else if (ok[0][0] == 1) {\n     if (k % 2)\n       printf('First\n');\n     else\n       printf('Second\n');\n   } else if (ok[0][0] == 2)\n     printf('Second\n');\n   else {\n     if (ok[1][0] == 3)\n       printf('Second\n');\n     else if (ok[1][0] == 1) {\n       if (k % 2)\n         printf('First\n');\n       else\n         printf('Second\n');\n     } else if (ok[1][0] == 2)\n       printf('Second\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 5;\n int t, id, n, m, x, y, k, c, p, dif, ans, sum, pre, rem, cur, tmp, tot, r, l, u,\n     d, xx, yy;\n int a[N], vis[N], f[N], b[N], cu[N];\n vector<int> v, adj[N];\n bool fl, ok;\n int dp[N];\n int mem[N];\n int sol(int i = n) {\n   int &ret = mem[i];\n   if (~ret) return ret;\n   if (!i) return ret = 0;\n   ret = sol(i - 1) + 20;\n   int B90 = upper_bound(a + 1, a + n + 1, a[i] - 90) - (a + 1);\n   ret = min(ret, sol(B90) + 50);\n   int Bday = upper_bound(a + 1, a + n + 1, a[i] - 1440) - (a + 1);\n   ret = min(ret, sol(Bday) + 120);\n   return ret;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= (int)n; ++i) scanf('%d', &a[i]);\n   memset(mem, -1, sizeof mem);\n   ;\n   sol();\n   for (int i = 1; i <= (int)n; ++i) printf('%d\n', sol(i) - sol(i - 1));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n char maz[505][505];\n int dp[10][505][505];\n inline void cm(int& x) {\n   if (x >= mod) x -= mod;\n }\n int main() {\n   int n, m;\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; ++i) scanf('%s', maz[i] + 1);\n   int up = (n + m - 1) / 2;\n   if (maz[1][1] != maz[n][m]) {\n     puts('0');\n     return 0;\n   }\n   dp[0][1][m] = 1;\n   for (int i = 0; i < up; ++i) {\n     int ni = (i + 1) & 1, li = i & 1;\n     memset(dp[ni], 0, sizeof(dp[ni]));\n     for (int j = 1; j <= m; ++j) {\n       int y1 = i + 2 - j;\n       if (y1 < 1 || y1 > n) continue;\n       for (int k = m; k >= 1; --k) {\n         int y2 = n + m - i - k;\n         if (y2 < 1 || y2 > n || maz[y1][j] != maz[y2][k]) continue;\n         if (y1 < n && y2 > 1 && maz[y1 + 1][j] == maz[y2 - 1][k])\n           dp[ni][j][k] += dp[li][j][k];\n         if (y1 < n && k > 1 && maz[y1 + 1][j] == maz[y2][k - 1])\n           dp[ni][j][k - 1] += dp[li][j][k];\n         if (j < m && y2 > 1 && maz[y1][j + 1] == maz[y2 - 1][k])\n           dp[ni][j + 1][k] += dp[li][j][k];\n         if (j < m && k > 1 && maz[y1][j + 1] == maz[y2][k - 1])\n           dp[ni][j + 1][k - 1] += dp[li][j][k];\n         cm(dp[ni][j][k]);\n         cm(dp[ni][j][k - 1]);\n         cm(dp[ni][j + 1][k]);\n         cm(dp[ni][j + 1][k - 1]);\n       }\n     }\n   }\n   int ans = 0;\n   if ((n + m - 1) % 2) {\n     for (int i = 1; i <= n; ++i) {\n       ans += dp[up & 1][up + 2 - i][up + 2 - i];\n       cm(ans);\n     }\n   } else {\n     up--;\n     for (int i = 1; i <= n; ++i) {\n       ans += dp[up & 1][up + 2 - i][up + 3 - i];\n       cm(ans);\n       ans += dp[up & 1][up + 2 - i][up + 2 - i];\n       cm(ans);\n     }\n   }\n   printf('%d\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void task();\n int main() {\n   task();\n   return 0;\n }\n const int N = 2e5 + 10;\n const long long int MOD = (long long int)1e9 + 7;\n const int INF = 0x3f3f3f3f;\n const long long int LINF = (long long int)4e18 + 100;\n const int BUF_SIZE = (int)1e6 + 10;\n const double PI = acos(-1);\n pair<int, int> a[N];\n double u[N], ad[N], bd[N];\n long long int sq_dist(long long int x1, long long int y1, long long int x2,\n                       long long int y2) {\n   return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);\n }\n double dist(long long int x1, long long int y1, long long int x2,\n             long long int y2) {\n   return sqrt(sq_dist(x1, y1, x2, y2));\n }\n double dp[N][2][2];\n void task() {\n   int ai, aj, bi, bj, ui, uj;\n   cin >> ai >> aj >> bi >> bj >> ui >> uj;\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; ++i) {\n     cin >> a[i].first >> a[i].second;\n   }\n   for (int i = 0; i < n; ++i) {\n     u[i] = dist(ui, uj, a[i].first, a[i].second);\n     (void(1));\n     ;\n   }\n   for (int i = 0; i < n; ++i) {\n     ad[i] = dist(ai, aj, a[i].first, a[i].second) + u[i];\n     (void(1));\n     ;\n   }\n   for (int i = 0; i < n; ++i) {\n     bd[i] = dist(bi, bj, a[i].first, a[i].second) + u[i];\n     (void(1));\n     ;\n   }\n   fill(dp[0][0], dp[0][0] + N * 2 * 2, LINF);\n   dp[0][1][1] = 0;\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < 2; ++j) {\n       for (int k = 0; k < 2; ++k) {\n         (void(1));\n         ;\n         if (j == 1) {\n           dp[i + 1][j - 1][k] = min(dp[i][j][k] + ad[i], dp[i + 1][j - 1][k]);\n         }\n         if (k == 1) {\n           dp[i + 1][j][k - 1] = min(dp[i][j][k] + bd[i], dp[i + 1][j][k - 1]);\n         }\n         dp[i + 1][j][k] = min(dp[i + 1][j][k], dp[i][j][k] + 2 * u[i]);\n       }\n     }\n   }\n   double ans = LINF;\n   for (int i = 0; i < 2; ++i) {\n     for (int j = 0; j < 2; ++j)\n       if (!(i == 1 && j == 1)) {\n         (void(1));\n         ;\n         ans = min(ans, dp[n][i][j]);\n       }\n   }\n   cout << fixed << setprecision(12) << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\n using namespace std;\n const int maxn = 500100;\n multiset<pair<long long, long long> > 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 <bits/stdc++.h>\n using namespace std;\n struct node {\n   int x, y;\n };\n vector<node> 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 <bits/stdc++.h>\n using namespace std;\n template <class T, class U>\n void maximize(T &x, U y) {\n   if (x < y) x = y;\n }\n template <class T, class U>\n void minimize(T &x, U y) {\n   if (x > y) x = y;\n }\n template <class T>\n T Abs(T x) {\n   return (x < (T)0 ? -x : x);\n }\n template <class T>\n T safe_sqrt(T x) {\n   return sqrt(max((T)0, x));\n }\n template <class T, class U, class V>\n T addmod(T x, U k, V mod) {\n   return ((x + k) % mod + mod) % mod;\n }\n template <class T, class U, class V>\n T submod(T x, U k, V mod) {\n   return ((x - k) % mod + mod) % mod;\n }\n template <class T, class U, class V>\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<int> digits;\n vector<int> trans(int64_t x, int b) {\n   vector<int> 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 <bits/stdc++.h>\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<int> answer;\n   for (int rem = 0; rem < 10000000; rem++) {\n     double fuel = tens * 10 + static_cast<double>(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<int>(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 <bits/stdc++.h>\n using namespace std;\n const int MAXN = (int)2e5 + 10;\n vector<pair<int, int> > a, b;\n vector<int> 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 <bits/stdc++.h>\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<vector<int>> rmq_min(log_n, vector<int>(n)),\n       rmq_max(log_n, vector<int>(n));\n   vector<int> a(n), next(n), jump(n), times(n), now_min(n), now_max(n);\n   priority_queue<pair<int, int>> 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<int> last(n);\n   vector<bool> 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<int> 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<pair<int, int>> queries(q);\n   vector<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long int> v;\n vector<long long int> vv;\n vector<long long int> ans;\n long long int prime[2005];\n bool pr[2005];\n set<char> st;\n priority_queue<long long int> bob;\n priority_queue<long long int> ali;\n priority_queue<long long int> bth;\n queue<long long int> q;\n map<long long int, long long int> mp;\n long long int taken[105];\n map<long long int, long long int>::iterator it;\n map<long long int, vector<long long int> > 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int q, ans;\n char s[300010];\n set<int> 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 <bits/stdc++.h>\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<int> all;\n   pair<int, int> 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<char> 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<Node> nodes;\n const int maxn = 100000;\n vector<pair<int, int> > add;\n vector<int> g[maxn + 1];\n vector<int> 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<pair<int, int> > add_after;\n   for (int i = 0; i < k; ++i) {\n     pair<int, int> 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<int, int> 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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   vector<int> dis(n + 1, n), cnt(n + 1, -1);\n   while (m--) {\n     int a, b;\n     cin >> a >> b;\n     ++cnt[a];\n     dis[a] = min(dis[a], a > b ? b - a + n : b - a);\n   }\n   for (int i = 1; i <= n; ++i) {\n     int res = 0;\n     for (int j = 1; j <= n; ++j)\n       if (~cnt[j])\n         res = max(res, (i > j ? j - i + n : j - i) + cnt[j] * n + dis[j]);\n     cout << res << ' ';\n   }\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie();\n   string s, mx;\n   cin >> s;\n   int len = s.length();\n   for (int i = 1; i < 1 << len; i++) {\n     string foo;\n     for (int j = 0; j < len; j++)\n       if (i & (1 << j)) foo += s[j];\n     bool flag = 1;\n     for (int k = 0; k <= foo.length() / 2; k++)\n       if (foo[k] != foo[foo.length() - k - 1]) flag = 0;\n     if (flag && foo > mx) mx = foo;\n   }\n   cout << mx;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int size = 300000001;\n bitset<size> gut;\n int main() {\n   int l, r;\n   cin >> l >> r;\n   gut.set();\n   for (int i = 3; i * i <= r; i += 2) {\n     if (gut[i])\n       for (int j = i * i; j <= r; j += (i << 1)) {\n         gut[j] = false;\n       }\n   }\n   int rez = 0;\n   rez = (l <= 2 && r >= 2);\n   for (int i = 5; i <= r; i += 4) {\n     if (i >= l && gut[i]) rez++;\n   }\n   cout << rez << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 3010;\n struct edge {\n   int v, next, flag;\n } e[N << 2];\n int head[N], cnt;\n void addedge(int u, int v, int flag) {\n   e[cnt].v = v;\n   e[cnt].flag = flag;\n   e[cnt].next = head[u];\n   head[u] = cnt++;\n }\n int sum[N], dp[N];\n void dfs(int u, int pre) {\n   sum[u] = 0;\n   for (int i = head[u]; i != -1; i = e[i].next) {\n     if (e[i].v == pre) continue;\n     dfs(e[i].v, u);\n     int v = e[i].v;\n     sum[u] += sum[v] + e[i].flag;\n   }\n   dp[u] = sum[u];\n   for (int i = head[u]; i != -1; i = e[i].next) {\n     if (e[i].v == pre) continue;\n     int v = e[i].v;\n     dp[u] = min(dp[u], sum[u] - sum[v] + 1 - e[i].flag + dp[v] - e[i].flag);\n   }\n }\n int main() {\n   memset(head, -1, sizeof(head));\n   int n;\n   scanf('%d', &n);\n   for (int i = 1; i < n; i++) {\n     int x, y, z;\n     scanf('%d%d', &x, &y);\n     addedge(x, y, 0);\n     addedge(y, x, 1);\n   }\n   int ans = 0x7fffffff;\n   for (int i = 1; i <= n; i++) {\n     dfs(i, -1);\n     for (int j = 1; j <= n; j++) {\n       ans = min(ans, sum[i] - sum[j] + dp[j]);\n     }\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 1e3 + 100;\n int N;\n int p[MAXN], rp[MAXN];\n char ans[MAXN][MAXN];\n bool v[MAXN];\n int lvl, C;\n bool pd;\n bool id(int* a, int as) {\n   for (int i = 1; i <= as; i++)\n     if (a[i] != i) return false;\n   return true;\n }\n char get_dir(bool d) { return d ? '/' : '\\'; }\n char get_dir(int a, int b) {\n   assert(a != b);\n   return get_dir(a < b);\n }\n bool addE(int a, int b) {\n   assert(a != b);\n   if (a < b) {\n     ans[lvl][a] = ans[lvl][b] = '/';\n     return true;\n   }\n   if (a > b) {\n     ans[lvl][a] = ans[lvl][b] = '\\';\n     return false;\n   }\n   assert(false);\n   return false;\n }\n void init(int n) {\n   assert(p[n] != n);\n   v[n] = true;\n   C = n;\n   for (int i = p[n]; i != n; i = p[i]) {\n     v[i] = true;\n     pd = addE(p[i], i);\n     lvl--;\n   }\n }\n int addFE(int n, int lf) {\n   if ((pd) xor (n > C)) {\n     ans[lvl][n] = get_dir(p[n], C);\n     ans[lf][C] = get_dir(C, n);\n     pd = C < n;\n     ans[lf][n] = get_dir(C, n);\n     return -1;\n   }\n   if ((p[n] < n) xor (n < C)) {\n     ans[lvl - 1][C] = get_dir(p[n], C);\n     ans[lf][C] = get_dir(C, n);\n     ans[lf][n] = get_dir(C, n);\n     return -1;\n   }\n   assert(false);\n   return -1;\n }\n void fill(int n) {\n   v[n] = true;\n   int l = 1, s = -1;\n   for (int i = p[n]; i != n; i = p[i]) {\n     v[i] = true, l++;\n     if (((p[n] < n) xor (C < n)) or (pd xor (n > C))) s = i;\n   }\n   lvl += addFE(s, lvl - l);\n   for (int i = p[s]; i != s; i = p[i]) {\n     addE(p[i], i), lvl--;\n   }\n }\n int main() {\n   scanf('%d', &N);\n   lvl = N;\n   pd = false;\n   for (int i = 0; i <= N; i++) v[i] = false, p[i] = rp[i] = -1;\n   for (int i = 1; i <= N; i++) scanf('%d', rp + i);\n   for (int i = 1; i <= N; i++) p[rp[i]] = i;\n   for (int i = 1; i <= N; i++)\n     for (int j = 1; j <= N; j++) ans[i][j] = '.';\n   if (id(p, N)) {\n     printf('%d\n', N);\n     for (int i = 1; i <= N; i++, printf('\n'))\n       for (int j = 1; j <= N; j++) printf('%c', ans[i][j]);\n     return 0;\n   }\n   for (int i = 1; i <= N; i++)\n     if (p[i] == i) v[i] = true;\n   for (int i = 1, c = 1; c and i <= N; i++)\n     if (!v[i]) init(i), c = 0;\n   lvl++;\n   for (int i = 1; i <= N; i++)\n     if (!v[i]) fill(i);\n   printf('%d\n', N - 1);\n   for (int i = 1; i <= N; i++, printf('\n'))\n     for (int j = 1; j <= N; j++) printf('%c', ans[i][j]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int t[35], mp[400][400], n;\n void dfs(int step, int x, int y, int dir) {\n   if (step > n) return;\n   if (dir == 0) {\n     dfs(step + 1, x, y + t[step], 1 - dir);\n     for (int i = 0; i < 400; i++)\n       for (int j = 0; j < 400; j++)\n         if (mp[i][j]) {\n           mp[i][j] = mp[x * 2 - i][j] = 1;\n         }\n     for (int i = 1; i <= t[step]; i++) mp[x][y + i] = 1;\n   } else {\n     dfs(step + 1, x + t[step], y + t[step], 1 - dir);\n     int b = y - x;\n     for (int i = 0; i < 400; i++)\n       for (int j = 0; j < 400; j++)\n         if (mp[i][j]) {\n           mp[i][j] = mp[j - b][i + b] = 1;\n         }\n     for (int i = 1; i <= t[step]; i++) {\n       mp[x + i][y + i] = 1;\n     }\n   }\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) scanf('%d', t + i);\n   memset(mp, 0, sizeof(mp));\n   dfs(1, 200, 199, 0);\n   int ans = 0;\n   for (int i = 0; i < 400; i++)\n     for (int j = 0; j < 400; j++)\n       if (mp[i][j]) ans++;\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 2000000;\n char a[MAXN + 10], b[MAXN + 10];\n int main(void) {\n   int n;\n   scanf('%d%s%s', &n, a, b);\n   int cnt[2][2];\n   for (int i = 0; i < (2); ++i) {\n     for (int j = 0; j < (2); ++j) {\n       cnt[i][j] = 0;\n     }\n   }\n   n *= 2;\n   for (int i = 0; i < (n); ++i) {\n     ++cnt[a[i] - '0'][b[i] - '0'];\n   }\n   int sA = 0, sB = 0;\n   for (int i = 0; i < (n); ++i) {\n     if (cnt[1][1] > 0) {\n       --cnt[1][1];\n       ++sA;\n     } else if (cnt[1][0] > 0) {\n       --cnt[1][0];\n       ++sA;\n     } else if (cnt[0][1] > 0) {\n       --cnt[0][1];\n     } else {\n       --cnt[0][0];\n     }\n     if (cnt[1][1] > 0) {\n       --cnt[1][1];\n       ++sB;\n     } else if (cnt[0][1] > 0) {\n       --cnt[0][1];\n       ++sB;\n     } else if (cnt[1][0] > 0) {\n       --cnt[1][0];\n     } else {\n       --cnt[0][0];\n     }\n   }\n   if (sA > sB) {\n     puts('First');\n   } else if (sA < sB) {\n     puts('Second');\n   } else {\n     puts('Draw');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m, X, Y, Z, p;\n   int x, y;\n   while (scanf('%d%d%d%d%d%d', &n, &m, &X, &Y, &Z, &p) != EOF) {\n     X %= 4;\n     Y %= 2;\n     Z %= 4;\n     int tn = n;\n     int tm = m;\n     for (int i = 1; i <= p; i++) {\n       n = tn;\n       m = tm;\n       scanf('%d%d', &x, &y);\n       if (X == 1) {\n         int xx = x;\n         x = y;\n         y = n + 1 - xx;\n         int nn = n;\n         n = m;\n         m = nn;\n       } else if (X == 2) {\n         x = n + 1 - x;\n         y = m + 1 - y;\n       } else if (X == 3) {\n         int xx = x;\n         x = m + 1 - y;\n         y = xx;\n         int nn = n;\n         n = m;\n         m = nn;\n       }\n       if (Y == 1) {\n         y = m + 1 - y;\n       }\n       if (Z == 1) {\n         int xx = x;\n         x = m + 1 - y;\n         y = xx;\n         int nn = n;\n         n = m;\n         m = nn;\n       } else if (Z == 2) {\n         x = n + 1 - x;\n         y = m + 1 - y;\n       } else if (Z == 3) {\n         int xx = x;\n         x = y;\n         y = n + 1 - xx;\n         int nn = n;\n         n = m;\n         m = nn;\n       }\n       printf('%d %d\n', x, y);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize(2)\n using namespace std;\n const int INF = 1e9 + 7;\n const int N = 4e5 + 7;\n const int M = 5e6 + 7;\n int vis[M];\n int p[N];\n int qt[N];\n signed main() {\n   ios::sync_with_stdio(false);\n   int q, x, y;\n   cin >> q >> x;\n   set<pair<int, int>> vals;\n   for (int i = 0; i < x; i++) vals.insert({qt[i], i});\n   while (q--) {\n     int y;\n     cin >> y;\n     y %= x;\n     vals.erase({qt[y], y});\n     vals.insert({++qt[y], y});\n     auto k = *vals.begin();\n     int nVal = k.first * x + k.second;\n     cout << nVal << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   double n, m;\n   cin >> n >> m;\n   printf('%.10lf\n', n * pow(1.000000011, m));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, x, l[60], r[60], ans;\n int main() {\n   scanf('%d %d', &n, &x);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d %d', &l[i], &r[i]);\n   }\n   for (int i = 1; i <= n; ++i) {\n     ans += (l[i] - r[i - 1] - 1) % x;\n     ans += r[i] - l[i] + 1;\n   }\n   printf('%d', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2000 + 7, Mod = 1000000000 + 7;\n inline int Inc(int A, int B) {\n   A += B;\n   return A >= Mod ? A - Mod : A;\n }\n inline int Dec(int A, int B) {\n   A -= B;\n   return A < 0 ? A + Mod : A;\n }\n int n, m, A, B, Dpd[N][N], Dpr[N][N], Sumd[N][N], Sumr[N][N], d[N][N], r[N][N];\n char Map[N][N];\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = (1), iLimit = (n); i <= iLimit; (++(i)))\n     for (int j = (1), jLimit = (m); j <= jLimit; (++(j))) cin >> Map[i][j];\n   if (n == 1 && m == 1) {\n     if (Map[1][1] == 'R')\n       puts('0');\n     else\n       puts('1');\n     return 0;\n   }\n   for (int i = (n), iLimit = (1); i >= iLimit; (--(i)))\n     for (int j = (m), jLimit = (1); j >= jLimit; (--(j))) {\n       d[i][j] = d[i + 1][j] + (Map[i + 1][j] == 'R');\n       r[i][j] = r[i][j + 1] + (Map[i][j + 1] == 'R');\n     }\n   Dpd[n][m] = Dpr[n][m] = Sumd[n][m] = Sumr[n][m] = (Map[n][m] != 'R');\n   for (int i = (n), iLimit = (1); i >= iLimit; (--(i)))\n     for (int j = (m), jLimit = (1); j >= jLimit; (--(j)))\n       if (i != n || j != m) {\n         Dpr[i][j] = Dec(Sumd[i][j + 1], Sumd[i][m - r[i][j] + 1]);\n         Dpd[i][j] = Dec(Sumr[i + 1][j], Sumr[n - d[i][j] + 1][j]);\n         Sumr[i][j] = Inc(Sumr[i + 1][j], Dpr[i][j]);\n         Sumd[i][j] = Inc(Sumd[i][j + 1], Dpd[i][j]);\n       }\n   printf('%d', Inc(Dpr[1][1], Dpd[1][1]));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/STACK:256000000')\n const long long INF = 1e9;\n const long long mod = 1e9 + 7;\n const long long LINF = 1e14;\n using namespace std;\n long long n, l;\n vector<long long> c;\n vector<int> b;\n int main() {\n   std::ios::sync_with_stdio(false);\n   cin >> n >> l;\n   c.resize(n);\n   cin >> c[0];\n   for (long long i = (1); i < (n); i++) {\n     cin >> c[i];\n     c[i] = min(c[i - 1] * 2, c[i]);\n   }\n   while (l > 0) b.push_back(l % 2), l /= 2;\n   while (c.size() < b.size()) c.push_back(c.back() * 2);\n   while (b.size() < c.size()) b.push_back(0);\n   c.push_back(c.back() * 2);\n   n = b.size();\n   vector<long long> d(n + 1, LINF);\n   d[0] = 0;\n   for (long long i = (1); i < (n + 1); i++) {\n     d[i] = min(d[i - 1], c[i - 1]);\n     if (b[i - 1] == 1) d[i] += c[i - 1];\n   }\n   cout << min(d[n], c.back()) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int x;\n   cin >> x;\n   int k = x % 4;\n   if (k == 1) {\n     cout << 0 << ' A' << endl;\n   } else if (k == 0) {\n     cout << 1 << ' A' << endl;\n   } else if (k == 2) {\n     cout << 1 << ' B' << endl;\n   } else {\n     cout << 2 << ' A' << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char arr[50][50];\n int main() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++) {\n       if ((i % 2 == 0 ||\n            ((i % 4 == 1 && j == m - 1) || (i % 4 == 3 && j == 0))))\n         arr[i][j] = '#';\n       else\n         arr[i][j] = '.';\n     }\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) cout << arr[i][j];\n     cout << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename A, typename B>\n inline void chmin(A &a, B b) {\n   if (a > b) a = b;\n }\n template <typename A, typename B>\n inline void chmax(A &a, B b) {\n   if (a < b) a = b;\n }\n struct UnionFindTree {\n   vector<long long> par, sz;\n   UnionFindTree(long long n) {\n     par.resize(n);\n     sz.resize(n);\n     for (long long i = 0; i < n; i++) {\n       par[i] = i;\n       sz[i] = 1;\n     }\n   }\n   long long find(long long x) {\n     return x == par[x] ? x : par[x] = find(par[x]);\n   }\n   void unite(long long x, long long y) {\n     x = find(x);\n     y = find(y);\n     if (x == y) return;\n     if (sz[x] < sz[y]) swap(x, y);\n     sz[x] += sz[y];\n     par[y] = x;\n   }\n   bool areSame(long long x, long long y) { return find(x) == find(y); }\n   long long size(long long x) { return sz[find(x)]; }\n };\n const long long SIZE = 1000000;\n long long N, M;\n long long A[SIZE], B[SIZE];\n long long cnt[SIZE];\n signed main() {\n   scanf('%lld%lld', &N, &M);\n   for (long long i = 0; i < (M); i++) scanf('%lld%lld', &A[i], &B[i]);\n   vector<long long> vs;\n   for (long long i = 0; i < (M); i++) {\n     vs.push_back(A[i]);\n     vs.push_back(B[i]);\n   }\n   sort((vs).begin(), (vs).end());\n   vs.erase(unique((vs).begin(), (vs).end()), vs.end());\n   for (long long i = 0; i < (M); i++) {\n     A[i] = lower_bound((vs).begin(), (vs).end(), A[i]) - vs.begin();\n     B[i] = lower_bound((vs).begin(), (vs).end(), B[i]) - vs.begin();\n   }\n   N = vs.size();\n   UnionFindTree uf(N);\n   for (long long i = 0; i < (M); i++) uf.unite(A[i], B[i]);\n   if (uf.size(0) != N) {\n     puts('0');\n     return 0;\n   }\n   long long luz = 0;\n   for (long long i = 0; i < (M); i++) {\n     if (A[i] == B[i])\n       luz++;\n     else {\n       cnt[A[i]]++;\n       cnt[B[i]]++;\n     }\n   }\n   long long ans = 0;\n   ans += luz * (M - luz);\n   ans += luz * (luz - 1) / 2;\n   for (long long i = 0; i < N; i++) ans += cnt[i] * (cnt[i] - 1) / 2;\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int N = 100000, M = 100000;\n long long int MOD = 1000000007;\n void solve() {\n   long long int n;\n   cin >> n;\n   long long int a[n + 1], b[n + 1];\n   for (long long int i = 0; i < n; i++) cin >> a[i];\n   for (long long int i = 0; i < n; i++) {\n     b[i] = a[i] - i;\n     if (b[i] < 0)\n       b[i] = 0;\n     else if (b[i] % n == 0)\n       b[i] = b[i] / n;\n     else\n       b[i] = (b[i] / n) + 1;\n   }\n   for (long long int i = 0; i < n; i++) b[i] = i + (n * b[i]);\n   long long int min1 = b[0];\n   long long int ans = 0;\n   for (long long int i = 0; i < n; i++) {\n     if (min1 > b[i]) {\n       min1 = b[i];\n       ans = i;\n     }\n   }\n   cout << ans + 1;\n }\n int main() {\n   long long int t = 1;\n   while (t--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int k, m;\n set<int> S;\n int pw[10];\n void rec(int ind, int number, int value) {\n   if (ind == 4) {\n     if (value > k && value - k < 10000) {\n       S.insert(number * 10000 + (value - k));\n     }\n     if (k >= value && k - value < 10000) {\n       S.insert(number * 10000 + (k - value));\n     }\n     return;\n   }\n   for (int i = 1; i + ind < 5; i++) {\n     for (int j = 0; j < pw[i]; j++) {\n       if (ind == 0) {\n         rec(ind + i, j, j);\n       } else {\n         rec(ind + i, number * pw[i] + j, value + j);\n         rec(ind + i, number * pw[i] + j, value - j);\n         rec(ind + i, number * pw[i] + j, value * j);\n       }\n     }\n   }\n }\n int main() {\n   scanf('%d', &k);\n   scanf('%d', &m);\n   pw[0] = 1;\n   for (int i = 1; i <= 6; i++) pw[i] = pw[i - 1] * 10;\n   rec(0, 0, 0);\n   for (set<int>::iterator it = S.begin(); (it != S.end()) && m; it++, m--) {\n     cout << setw(8) << setfill('0') << (*it) << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/STACK:102400000,102400000')\n using namespace std;\n int main() {\n   int cases;\n   scanf('%d', &cases);\n   while (cases--) {\n     char str[1009];\n     int ret[9];\n     scanf('%s', str);\n     int num = 0;\n     int i;\n     int cnt = 0;\n     int flag = -1;\n     for (i = 0; str[i]; i++) {\n       if (str[i] >= 'A' && str[i] <= 'Z') {\n         str[i] = str[i] - 'A' + 'a';\n       }\n       if (str[i] == ':') {\n         if (str[i + 1] == ':') {\n           flag = cnt;\n           i++;\n         }\n         ret[cnt] = num;\n         cnt++;\n         num = 0;\n       } else if (str[i] >= '0' && str[i] <= '9') {\n         num = num * 16 + str[i] - '0';\n       } else {\n         num = num * 16 + str[i] - 'a' + 10;\n       }\n     }\n     ret[cnt++] = num;\n     int k = 0;\n     for (int j = 0; j < cnt; j++) {\n       printf('%04x', ret[j]);\n       k++;\n       if (k != 8) {\n         putchar(':');\n       }\n       if (flag == j) {\n         for (i = 0; i < 8 - cnt; i++) {\n           printf('0000');\n           k++;\n           if (k != 8) {\n             putchar(':');\n           }\n         }\n       }\n     }\n     putchar(10);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n, i, j, r, mn, mx, x, cnt = 0, a = 1, b = 1;\n   string s;\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> s;\n     if (s == 'UR' || s == 'DL')\n       a++;\n     else if (s == 'UL' || s == 'DR')\n       b++;\n     else {\n       a++, b++;\n     }\n   }\n   cout << a * b << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 2e9;\n int n;\n pair<int, int> p[25];\n int dis[25][25];\n int dp[1 << 24 | 1];\n int pre[1 << 24 | 1];\n int main() {\n   scanf('%d%d%d', &p[0].first, &p[0].second, &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d%d', &p[i].first, &p[i].second);\n   }\n   for (int i = 0; i <= n; ++i)\n     for (int j = i; j <= n; ++j) {\n       dis[i][j] = dis[j][i] =\n           pow(p[i].first - p[j].first, 2) + pow(p[i].second - p[j].second, 2);\n     }\n   for (int m = 1; m < (1 << n); ++m) {\n     dp[m] = INF;\n   }\n   dp[0] = 0;\n   for (int m = 0; m < (1 << n); ++m) {\n     if (dp[m] == INF) continue;\n     for (int i = 1; i <= n; ++i) {\n       if (m & 1 << (i - 1)) continue;\n       for (int j = 1; j <= n; ++j) {\n         if (m & 1 << (j - 1)) continue;\n         if (dp[m | (1 << i - 1) | (1 << j - 1)] >\n             dp[m] + dis[0][i] + dis[i][j] + dis[j][0]) {\n           dp[m | (1 << i - 1) | (1 << j - 1)] =\n               dp[m] + dis[0][i] + dis[i][j] + dis[j][0];\n           pre[m | (1 << i - 1) | (1 << j - 1)] = m;\n         }\n       }\n       break;\n     }\n   }\n   printf('%d\n', dp[(1 << n) - 1]);\n   int num = (1 << n) - 1;\n   while (num) {\n     printf('0 ');\n     int t = pre[num] ^ num;\n     for (int i = 0; i < n; ++i) {\n       if (t & (1 << i)) {\n         printf('%d ', i + 1);\n       }\n     }\n     num = pre[num];\n   }\n   printf('0\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MAXN = 1000001;\n long long n, l[MAXN], r[MAXN], id[MAXN], K;\n bool cmp(long long i, long long j) {\n   return (l[i] / K == l[j] / K)\n              ? ((l[i] / K & 1) ? (r[i] < r[j]) : (r[i] > r[j]))\n              : (l[i] < l[j]);\n }\n int main() {\n   scanf('%lld', &n);\n   K = 1000;\n   for (long long i = 1; i <= n; i++) scanf('%lld%lld', &l[i], &r[i]), id[i] = i;\n   sort(id + 1, id + 1 + n, cmp);\n   for (int i = 1; i <= n; i++) printf('%lld ', id[i]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long neutral = 0;\n class SegmentTree {\n   vector<long long> a;\n   int n;\n \n  public:\n   SegmentTree(long long* st, long long* en) {\n     int sz = int(en - st);\n     for (n = 1; n < sz; n <<= 1)\n       ;\n     a.assign(n << 1, neutral);\n     for (int i = 0; i < sz; i++) a[i + n] = st[i];\n     for (int i = n + sz - 1; i > 1; i--) a[i >> 1] = ((a[i >> 1]) | (a[i]));\n   }\n   void update(int i, long long x) {\n     a[i += n] = x;\n     for (i >>= 1; i; i >>= 1) a[i] = ((a[i << 1]) | (a[1 + (i << 1)]));\n   }\n   long long query(int l, int r) {\n     long long ans = neutral;\n     for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1) {\n       if (l & 1) ans = ((ans) | (a[l++]));\n       if (r & 1) ans = ((ans) | (a[--r]));\n     }\n     return ans;\n   }\n };\n int main() {\n   cin.sync_with_stdio(0);\n   cin.tie(0);\n   cin.exceptions(cin.failbit);\n   int n, q, m;\n   string s;\n   cin >> s;\n   n = (int)(s).size();\n   long long v[n];\n   for (int i = 0; i < (n); ++i) {\n     v[i] = 1LL << (s[i] - 'a');\n   }\n   cin >> q;\n   SegmentTree st(v, v + n);\n   while (q--) {\n     int t;\n     cin >> t;\n     if (t == 2) {\n       int a, b;\n       cin >> a >> b;\n       long long res = st.query(a - 1, b - 1), c = 0;\n       while (res > 0) c++, res -= (res & -res);\n       cout << c << endl;\n     } else {\n       int a;\n       char c;\n       cin >> a >> c;\n       int b = c - 'a';\n       st.update(a - 1, 1LL << b);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 10, size = 1 << 20, mod = 998244353, inf = 2e9;\n const long long INF = 1e15;\n template <class o>\n void qr(o& x) {\n   char c = getchar();\n   x = 0;\n   int f = 1;\n   while (!isdigit(c)) {\n     if (c == '-') f = -1;\n     c = getchar();\n   }\n   while (isdigit(c)) x = x * 10 + c - '0', c = getchar();\n   x *= f;\n }\n template <class o>\n void qw(o x) {\n   if (x / 10) qw(x / 10);\n   putchar(x % 10 + '0');\n }\n template <class o>\n void pr1(o x) {\n   if (x < 0) x = -x, putchar('-');\n   qw(x);\n   putchar(' ');\n }\n template <class o>\n void pr2(o x) {\n   if (x < 0) x = -x, putchar('-');\n   qw(x);\n   putchar(10);\n }\n template <class o>\n void cmax(o& x, o y) {\n   if (x < y) x = y;\n }\n void cmax(int& x, int y) { x = x - y >> 31 ? y : x; }\n template <class o>\n void cmin(o& x, o y) {\n   if (x > y) x = y;\n }\n void cmin(int& x, int y) { x = x - y >> 31 ? x : y; }\n int n, m, a[N], p[N], b[N];\n struct BIT {\n   int c[N];\n   void clear() { memset(c + 1, 0, n * sizeof(int)); }\n   void clear(int x) {\n     for (; x <= n; x += x & -x) c[x] = 0;\n   }\n   int ask(int x) {\n     int y = 0;\n     for (; x; x -= x & -x) y += c[x];\n     return y;\n   }\n   int ask(int l, int r) { return ask(r) - ask(l - 1); }\n   void add(int x, int y) {\n     for (; x <= n; x += x & -x) c[x] += y;\n   }\n } tr;\n struct Q {\n   int l, r, y, v, id;\n   Q(int _l, int _r, int _y, int _v, int _id = 0)\n       : l(_l), r(_r), y(_y), v(_v), id(_id){};\n   Q(){};\n   bool operator<(Q b) const { return y < b.y; }\n } q[N * 5], t[N * 5];\n int tot, ans[N], id;\n void cdq(int l, int r) {\n   if (r - l < 100) {\n     int j = 0;\n     for (auto i = l; i <= r; i++) {\n       if (!q[i].id)\n         t[++j] = q[i];\n       else\n         for (auto k = 1; k <= j; k++) {\n           if (q[i].l <= t[k].l && t[k].l <= q[i].r && t[k].y <= q[i].y)\n             ans[q[i].id] += q[i].v * t[k].v;\n         }\n     }\n     sort(q + l, q + r + 1);\n     return;\n   }\n   int mid = (l + r) / 2;\n   cdq(l, mid);\n   cdq(mid + 1, r);\n   Q* p = t;\n   for (int i = l, j = mid + 1; i <= mid || j <= r;) {\n     if (j > r || (i <= mid && q[i].y <= q[j].y)) {\n       if (!q[i].id) tr.add(q[i].l, q[i].v);\n       *p++ = q[i++];\n     } else {\n       if (q[j].id) ans[q[j].id] += q[j].v * tr.ask(q[j].l, q[j].r);\n       *p++ = q[j++];\n     }\n   }\n   if (r - l > 2333)\n     tr.clear();\n   else\n     for (auto i = l; i <= mid; i++)\n       if (!q[i].id) tr.clear(q[i].l);\n   for (auto i = r; i >= l; i--) q[i] = *--p;\n }\n void solve() {\n   qr(n);\n   qr(m);\n   for (auto i = 1; i <= n; i++) qr(a[i]), p[a[i]] = i;\n   for (auto i = 1; i <= n; i++)\n     qr(b[i]), b[i] = p[b[i]], q[++tot] = Q(i, i, b[i], 1);\n   int op, x, y, l, r;\n   while (m--) {\n     qr(op);\n     qr(x);\n     qr(y);\n     if (op == 1) {\n       qr(l);\n       qr(r);\n       ++id;\n       q[++tot] = Q(l, r, y, 1, id);\n       q[++tot] = Q(l, r, x - 1, -1, id);\n     } else {\n       q[++tot] = Q(x, x, b[x], -1);\n       q[++tot] = Q(y, y, b[y], -1);\n       swap(b[x], b[y]);\n       q[++tot] = Q(x, x, b[x], 1);\n       q[++tot] = Q(y, y, b[y], 1);\n     }\n   }\n   cdq(1, tot);\n   for (auto i = 1; i <= id; i++) pr2(ans[i]);\n }\n int main() {\n   int T = 1;\n   while (T--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n template <class T>\n class _Fenwick {\n  private:\n   std::vector<T> sum;\n   int _size;\n \n  public:\n   _Fenwick() { _size = 0; }\n   void reset(int n) {\n     _size = n;\n     sum.clear();\n     sum.resize(n + 1);\n   }\n   void add(int x, T y) {\n     while (x <= _size) {\n       sum[x] += y;\n       x += x & -x;\n     }\n   }\n   T query(int x, T y) {\n     T ans = y;\n     while (x) {\n       ans += sum[x];\n       x -= x & -x;\n     };\n     return ans;\n   }\n   void build(T *a, int n) {\n     reset(n);\n     for (int i = 1; i <= n; ++i) add(i, a[i]);\n   }\n };\n template <typename T>\n void read(T &x);\n template <typename T>\n void read(T &x, T &y);\n template <typename T>\n void read(T &x, T &y, T &z);\n template <typename T>\n void write(T x);\n template <typename T>\n void writeC(T x);\n template <typename T>\n void writeN(T x);\n template <typename T>\n void _binary(T x, int len);\n long long _qpow(long long a, long long b, long long M);\n long long _inv(long long x, long long M);\n long long ans;\n int n, a[200005], b[200005][31], R[200005][31], L[200005][31], pre[35];\n signed main() {\n   read(n);\n   for (int i = 1; i <= (n); ++i) read(a[i]);\n   ;\n   long long ans = (long long)n * (n + 1) / 2;\n   for (int i = 1; i <= n; ++i)\n     for (int j = 0; j <= 30; ++j) b[i][j] = (a[i] >> j) & 1;\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 0; j <= 30; ++j) {\n       L[i][j] = pre[j];\n       if (b[i][j]) pre[j] = i;\n     }\n   }\n   for (int i = 0; i <= 30; ++i) pre[i] = n + 1;\n   for (int i = n; i >= 1; i--) {\n     for (int j = 0; j <= 30; ++j) {\n       R[i][j] = pre[j];\n       if (b[i][j]) pre[j] = i;\n     }\n   }\n   std::map<int, int> last;\n   for (int i = 1; i <= n; ++i) {\n     int l = last[a[i]] + 1, r = n;\n     for (int j = 0; j <= 30; ++j)\n       if (!b[i][j]) {\n         l = std::max(l, L[i][j] + 1);\n         r = std::min(r, R[i][j] - 1);\n       }\n     ans -= (long long)(i - l + 1) * (r - i + 1);\n     last[a[i]] = i;\n   }\n   printf('%lld', ans);\n }\n template <typename T>\n void read(T &x) {\n   x = 0;\n   char c = getchar();\n   T flag = 1;\n   while (c < '0' || c > '9') {\n     if (c == '-') flag = -flag;\n     c = getchar();\n   }\n   while ('0' <= c && c <= '9') {\n     x = x * 10 + c - '0';\n     c = getchar();\n   }\n   x *= flag;\n }\n template <typename T>\n void read(T &x, T &y) {\n   read(x);\n   read(y);\n }\n template <typename T>\n void read(T &x, T &y, T &z) {\n   read(x);\n   read(y);\n   read(z);\n }\n template <typename T>\n void writeC(T x) {\n   if (x < 0) x = ~x + 1, putchar('-');\n   if (x > 9) writeC(x / 10);\n   putchar(x % 10 + '0');\n }\n template <typename T>\n void write(T x) {\n   writeC(x);\n   putchar(' ');\n }\n template <typename T>\n void writeN(T x) {\n   writeC(x);\n   puts('');\n }\n template <typename T>\n void _binary(T x, int len) {\n   for (int i = len - 1; i >= 0; --i) writeC((x >> i) & 1);\n }\n long long _inv(long long x, long long M) {\n   assert(x != 0);\n   return x == 1 ? 1 : (M - M / x) * _inv(M % x, M) % M;\n }\n long long _qpow(long long a, long long b, long long M) {\n   long long res = 1;\n   while (b > 0) {\n     if (b & 1) res = res * a % M;\n     a = a * a % M;\n     b >>= 1;\n   }\n   return res;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int num[400005];\n int tot = 0;\n set<int> st;\n int mp[20];\n int freq[20];\n long long push[20][20];\n long long addp[20][1048576];\n vector<int> pos[20];\n long long sum[20];\n int cnt[20];\n long long memo[1048576];\n long long cost(int mask, int ofst, int id) {\n   return sum[id] + addp[id][mask] -\n          1LL * (ofst + 1 + ofst + cnt[id]) * cnt[id] / 2;\n   ;\n }\n long long dp(int i, int mask, int ofst) {\n   if (i == tot) return 0;\n   if (memo[mask] != -1) return memo[mask];\n   long long mn = 1000000000000000000;\n   int id;\n   for (int j = (0); j <= (tot - 1); j++) {\n     if ((mask >> j) & 1) continue;\n     long long v =\n         dp(i + 1, mask | (1 << j), ofst + cnt[j]) + cost(mask, ofst, j);\n     if (v < mn) {\n       mn = v;\n       id = j;\n     }\n   }\n   return memo[mask] = mn;\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = (1); i <= (n); i++) {\n     scanf('%d', &num[i]);\n     --num[i];\n     st.insert(num[i]);\n   }\n   for (auto u : st) {\n     mp[u] = tot++;\n   }\n   for (int i = (0); i <= (tot - 1); i++) pos[i].push_back(0);\n   for (int i = (1); i <= (n); i++) {\n     num[i] = mp[num[i]];\n     int t = num[i];\n     pos[t].push_back(i);\n     cnt[t]++;\n     sum[t] += i;\n   }\n   memset(push, 0, sizeof(push));\n   for (int i = (1); i <= (n); i++) {\n     freq[num[i]]++;\n     for (int j = (0); j <= (tot - 1); j++) {\n       push[num[i]][j] += cnt[j] - freq[j];\n     }\n   }\n   memset(addp, 0, sizeof(addp));\n   for (int i = (0); i <= (tot - 1); i++) {\n     for (int j = (0); j <= ((1 << tot) - 1); j++) {\n       if ((j >> i) & 1) continue;\n       for (int k = (0); k <= (tot - 1); k++) {\n         if (~(j >> k) & 1) continue;\n         addp[i][j] += push[i][k];\n       }\n     }\n   }\n   memset(memo, -1, sizeof(memo));\n   printf('%lld\n', dp(0, 0, 0));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> adj[200010];\n long long int ans = 0LL;\n int odd = 0, sz[200010] = {};\n void dfs(int cur, int par = -1, int ht = 0) {\n   sz[cur]++;\n   for (int u : adj[cur]) {\n     if (u == par) continue;\n     dfs(u, cur, ht ^ 1);\n     sz[cur] += sz[u];\n   }\n   if (ht) odd++;\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 0; i < n - 1; i++) {\n     int x, y;\n     scanf('%d %d', &x, &y);\n     adj[x].push_back(y);\n     adj[y].push_back(x);\n   }\n   dfs(1);\n   for (int i = 1; i <= n; i++) ans += (1LL) * sz[i] * (n - sz[i]);\n   ans += (1LL) * odd * (n - odd);\n   printf('%lld\n', ans / 2);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> adj[300003];\n vector<int> adje[300003];\n int d[300003];\n int pickd[300003];\n bool vis[300003];\n int n, m;\n int x;\n int dfs1(int u) {\n   int ans = 0;\n   if (d[u] == -1)\n     x = u;\n   else if (d[u] == 1)\n     ++ans;\n   vis[u] = true;\n   for (int v : adj[u]) {\n     if (!vis[v]) {\n       ans += dfs1(v);\n     }\n   }\n   return ans;\n }\n int dfs2(int u) {\n   int ans = 0;\n   if (d[u] == 1) ++ans;\n   vis[u] = true;\n   for (int i = 0; i < ((int)(adj[u].size())); ++i) {\n     int v = adj[u][i];\n     if (!vis[v]) {\n       int c = dfs2(v);\n       if (c % 2) pickd[adje[u][i]] = 1;\n       ans += c;\n     }\n   }\n   return ans;\n }\n bool solve() {\n   memset(vis, 0, sizeof(vis));\n   for (int i = 1; i <= n; ++i) {\n     if (!vis[i]) {\n       x = -1;\n       int c = dfs1(i);\n       if (c % 2) {\n         if (x == -1)\n           return false;\n         else {\n           d[x] = 1;\n         }\n       }\n     }\n   }\n   memset(vis, 0, sizeof(vis));\n   memset(pickd, 0, sizeof(pickd));\n   for (int i = 1; i <= n; ++i) {\n     if (!vis[i]) {\n       dfs2(i);\n     }\n   }\n   int k = accumulate(pickd + 1, pickd + m + 1, 0);\n   cout << k << '\n';\n   for (int i = 1; i <= m; ++i) {\n     if (pickd[i]) {\n       cout << i << ' \n'[(--k) == 0];\n     }\n   }\n   return true;\n }\n int main() {\n   ios ::sync_with_stdio(0);\n   while (cin >> n >> m) {\n     for (int i = 1; i <= n; ++i) {\n       cin >> d[i];\n     }\n     for (int i = 1; i <= m; ++i) {\n       int u, v;\n       cin >> u >> v;\n       adj[u].push_back(v);\n       adj[v].push_back(u);\n       adje[u].push_back(i);\n       adje[v].push_back(i);\n     }\n     if (!solve()) cout << '-1\n';\n     for (int i = 1; i <= n; ++i) {\n       adj[i].clear();\n       adje[i].clear();\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline void read(int &x) {\n   char ch = getchar();\n   x = 0;\n   while (!isdigit(ch)) ch = getchar();\n   while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();\n }\n int n, m, mx, now, a[5200];\n signed main() {\n   read(n), read(m);\n   int tmp = 0;\n   for (int i = 3; i <= n; ++i) {\n     if (i & 1) ++tmp;\n     mx += tmp;\n   }\n   if (m > mx) return puts('-1'), 0;\n   a[1] = 1, a[2] = 2;\n   int p = n + 1;\n   tmp = 0;\n   for (int i = 3; i <= n; ++i) {\n     if (i & 1) ++tmp;\n     if (now + tmp > m) {\n       p = i - 1;\n       break;\n     }\n     now += tmp, a[i] = i;\n   }\n   m -= now;\n   if (m)\n     a[p + 1] = p - m * 2 + 1 + p, p += 2;\n   else\n     ++p;\n   for (int i = p; i <= n; ++i) a[i] = 200000000 + i * n;\n   for (int i = 1; i <= n; ++i) printf('%d ', a[i]);\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1e9 + 7;\n const int N = 5e3 + 10;\n vector<double> vd;\n int flag = 0;\n vector<int> check(double x, int sz) {\n   vector<int> v;\n   int cur = 0;\n   double tot = x;\n   while (v.size() < sz) {\n     int o = tot / 10;\n     cur += o;\n     v.push_back(cur);\n     tot -= o * 10;\n     if (v.size() == sz) break;\n     tot += x;\n   }\n   if (flag) vd.push_back(tot);\n   return v;\n }\n double solve(vector<int>& v1, int o = 0) {\n   double l = 10 + 1e-10;\n   double r = INF;\n   int cnt = 200;\n   while (cnt--) {\n     double mid = (l + r) / 2;\n     auto v2 = check(mid, v1.size());\n     for (int i = 0; i < v1.size(); i++) {\n       if (v1[i] < v2[i]) {\n         r = mid;\n         break;\n       }\n       if (v1[i] > v2[i]) {\n         l = mid;\n         break;\n       }\n     }\n     if (v1 != v2) continue;\n     if (o == 0)\n       l = mid;\n     else\n       r = mid;\n   }\n   return l;\n }\n int main() {\n   int n;\n   cin >> n;\n   vector<int> v(n);\n   for (auto& x : v) cin >> x;\n   double key1 = solve(v, 0);\n   double key2 = solve(v, 1);\n   flag = 1;\n   if (key1 > key2) swap(key1, key2);\n   int ans1 = check(key1, n + 1).back();\n   int ans2 = check(key2, n + 1).back();\n   if (abs(vd[0] - 10) <= 1e-8) ans1++;\n   if (ans1 == ans2)\n     puts('unique'), printf('%d\n', ans1), exit(0);\n   else\n     puts('not unique');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long p[11];\n int main() {\n   string s;\n   cin >> s;\n   int n = s.size();\n   p[0] = 1;\n   for (int i = 1; i < n; i++) p[i] = p[i - 1] * 9ll;\n   long long ans = 1ll;\n   for (char c : s) ans *= (long long)(c - '0');\n   ans = max(ans, p[n - 1]);\n   long long pre = 1;\n   for (int i = 1; i <= n; i++) {\n     for (long long j = 1; j < s[i - 1] - '0'; j++) {\n       ans = max(ans, pre * j * p[n - i]);\n     }\n     pre *= (long long)(s[i - 1] - '0');\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   string a;\n   cin >> a;\n   int sum = 0;\n   char b[3] = {'R', 'G', 'B'};\n   for (int i = 1; i < n; i++) {\n     if (a[i - 1] == a[i] && a[i] == a[i + 1]) {\n       for (int j = 0; j < 3; j++) {\n         if (b[j] != a[i]) {\n           a[i] = b[j];\n           break;\n         }\n       }\n       sum++;\n     } else if (a[i - 1] == a[i]) {\n       for (int j = 0; j < 3; j++) {\n         if (b[j] != a[i] && b[j] != a[i + 1]) {\n           a[i] = b[j];\n           break;\n         }\n       }\n       sum++;\n     }\n   }\n   printf('%d\n', sum);\n   for (int i = 0; i < n; i++) {\n     printf('%c', a[i]);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long r, i;\n   int flag = 1;\n   cin >> r;\n   for (i = 1; i <= 1000000; i++) {\n     if ((r - i * i - i - 1) > 0 && (r - i * i - i - 1) % (2 * i) == 0) {\n       flag = 0;\n       break;\n     }\n   }\n   if (flag == 0)\n     printf('%lld %lld\n', i, (r - i * i - i - 1) / 2 * i);\n   else\n     puts('NO');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int distance(int x1, int y1, int x2, int y2) {\n   return (int)ceil(sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2)));\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n, m, x, q, cnt = 0;\n   string t;\n   char ch;\n   map<char, vector<pair<int, int>>> keys;\n   int freq[26] = {0};\n   cin >> n >> m >> x;\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= m; j++) {\n       cin >> ch;\n       if (!freq[ch - 'a']) freq[ch - 'a']++;\n       keys[ch].push_back(make_pair(i, j));\n     }\n   }\n   if (keys.count('S')) {\n     vector<pair<int, int>> shiftCords = keys['S'];\n     vector<pair<int, int>> chCords;\n     for (int i = 'a'; i <= 'z'; i++) {\n       if (keys.count(i)) {\n         chCords = keys[i];\n         bool validDistance = 0;\n         for (int j = 0; j < (int)chCords.size(); j++) {\n           for (int k = 0; k < (int)shiftCords.size(); k++) {\n             if (distance(chCords[j].first, chCords[j].second,\n                          shiftCords[k].first, shiftCords[k].second) <= x) {\n               freq[i - 'a']++;\n               validDistance = 1;\n               break;\n             }\n           }\n           if (validDistance) break;\n         }\n       }\n     }\n   }\n   cin >> q;\n   cin >> t;\n   for (int i = 0; i < q; i++) {\n     char c = t[i];\n     if (islower(c)) {\n       if (!freq[c - 'a']) {\n         cout << -1 << endl;\n         return 0;\n       }\n     } else {\n       c = tolower(c);\n       if (!keys.count('S') || !freq[c - 'a']) {\n         cout << -1 << endl;\n         return 0;\n       } else {\n         if (freq[c - 'a'] == 1) cnt++;\n       }\n     }\n   }\n   cout << cnt << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int k;\n   cin >> k;\n   int maxP = 0;\n   int maxQ = 0;\n   for (int i = 0; i < k; i++) {\n     int p = 0;\n     int q = 0;\n     cin >> p;\n     cin >> q;\n     if (p < q) {\n       cout << 'Happy Alex' << endl;\n       return 0;\n     }\n   }\n   cout << 'Poor Alex' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int maxn = 4e5 + 10;\n const int maxm = 2e5 + 10;\n const int inf = 0x3f3f3f3f;\n const long long mod = 1e9 + 7;\n const double eps = 1e-7;\n using namespace std;\n long long cnt[25][25], dp[1 << 21];\n int n;\n vector<int> col[25];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     int x;\n     cin >> x;\n     col[x].push_back(i);\n   }\n   for (int i = 1; i <= 20; ++i)\n     for (int j = 1; j <= 20; ++j)\n       if (i != j) {\n         if (!col[i].size() || !col[j].size()) continue;\n         int l = 0;\n         for (int k = 0; k < col[i].size(); ++k) {\n           while (true) {\n             if (l == col[j].size() - 1 || col[j][l + 1] > col[i][k]) break;\n             l++;\n           }\n           if (col[j][l] < col[i][k]) cnt[i][j] += l + 1;\n         }\n       }\n   memset(dp, 0x3f, sizeof dp);\n   dp[0] = 0;\n   for (int S = 0; S < 1 << 20; ++S) {\n     for (int i = 0; i < 20; ++i)\n       if (!(S >> i & 1)) {\n         long long sum(0);\n         for (int j = 0; j < 20; ++j)\n           if (S >> j & 1) sum += cnt[j + 1][i + 1];\n         dp[S | (1 << i)] = min(dp[S | (1 << i)], dp[S] + sum);\n       }\n   }\n   cout << dp[(1 << 20) - 1] << endl;\n   return ~~(0 - 0);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }\n long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long v;\n   cin >> v;\n   for (long long i = 0; i < v; i++) {\n     vector<long double> arr(250);\n     for (long long j = 0; j < 250; j++) cin >> arr[j];\n     long double avg1 = 0;\n     for (long long j = 0; j < 250; j++) avg1 += arr[j];\n     avg1 /= 250.0;\n     sort(arr.begin(), arr.end());\n     long double v1 = ((arr[249] - arr[0]) * (arr[249] - arr[0])) / 12.0;\n     long double v2 = 0;\n     for (long long j = 0; j < 250; j++)\n       v2 += ((avg1 - arr[j]) * (avg1 - arr[j]));\n     v2 /= 250.0;\n     long double avg2 = 0;\n     if (abs(v2 - avg1) > abs(v1 - v2))\n       cout << 'uniform\n';\n     else\n       cout << 'poisson\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool check(string new_l, string old_l) {\n   int len_1;\n   int col_izm;\n   col_izm = 0;\n   len_1 = new_l.length();\n   if (len_1 == old_l.length()) {\n     for (int i = 0; i < len_1; i++) {\n       if (new_l[i] == old_l[i]) {\n         col_izm++;\n       } else if (((new_l[i] == '1') || (new_l[i] == 'i') || (new_l[i] == 'l') ||\n                   (new_l[i] == 'I') || (new_l[i] == 'L')) &&\n                  ((old_l[i] == '1') || (old_l[i] == 'i') || (old_l[i] == 'l') ||\n                   (old_l[i] == 'I') || (old_l[i] == 'L'))) {\n         col_izm++;\n       } else if (((new_l[i] == '0') || (new_l[i] == 'o') ||\n                   (new_l[i] == 'O')) &&\n                  ((old_l[i] == '0') || (old_l[i] == 'o') ||\n                   (old_l[i] == 'O'))) {\n         col_izm++;\n       } else if (((new_l[i] - old_l[i]) == 32) ||\n                  ((new_l[i] - old_l[i]) == -32)) {\n         col_izm++;\n       } else\n         return true;\n     }\n     if (col_izm == len_1)\n       return false;\n     else\n       return true;\n   } else\n     return true;\n }\n int main() {\n   string n_login, login;\n   int col;\n   cin >> n_login;\n   cin >> col;\n   for (int i = 0; i < col; i++) {\n     cin >> login;\n     if (!check(n_login, login)) {\n       cout << 'No' << endl;\n       return 0;\n     }\n   }\n   cout << 'Yes' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int cmp(const void *a, const void *b) { return *((int *)a) - *((int *)b); }\n int maximum(int a, int b) {\n   if (a > b) {\n     return a;\n   } else {\n     return b;\n   }\n }\n int minimum(int a, int b) {\n   if (a < b) {\n     return a;\n   } else {\n     return b;\n   }\n }\n int main() {\n   int a[2000];\n   int p = 0, q = 1, x = 1, i, j;\n   int pl, pr, vl, vr, k;\n   long long c = 0, d;\n   a[0] = 0;\n   for (i = 0; i < 9; i++) {\n     for (j = p; j < q; j++) {\n       a[x++] = a[j] * 10 + 4;\n       a[x++] = a[j] * 10 + 7;\n     }\n     p = q;\n     q = x;\n   }\n   qsort(a, x, sizeof(int), cmp);\n   a[x] = 1000000001;\n   scanf('%d %d %d %d %d', &pl, &pr, &vl, &vr, &k);\n   d = (long long)(pr - pl + 1) * (vr - vl + 1);\n   for (i = 1; i <= x - k; i++) {\n     if (pl <= a[i] && vr >= a[i + k - 1]) {\n       int s1 = minimum(a[i], pr);\n       int s2 = maximum(a[i - 1] + 1, pl);\n       int t1 = maximum(a[i + k - 1], vl);\n       int t2 = minimum(a[i + k] - 1, vr);\n       if (s1 - s2 >= 0 && t2 - t1 >= 0) {\n         c += (long long)(s1 - s2 + 1) * (t2 - t1 + 1);\n       }\n     }\n     if (vl <= a[i] && pr >= a[i + k - 1]) {\n       int s1 = minimum(a[i], vr);\n       int s2 = maximum(a[i - 1] + 1, vl);\n       int t1 = maximum(a[i + k - 1], pl);\n       int t2 = minimum(a[i + k] - 1, pr);\n       if (s1 - s2 >= 0 && t2 - t1 >= 0) {\n         c += (long long)(s1 - s2 + 1) * (t2 - t1 + 1);\n       }\n     }\n   }\n   if (k == 1) {\n     for (i = 1; i < x; i++) {\n       if (pl <= a[i] && pr >= a[i] && vl <= a[i] && vr >= a[i]) c--;\n     }\n   }\n   printf('%.20lf\n', (double)c / d);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 5100;\n char Map[N][N];\n int dp[N][N];\n int main() {\n   int i, j;\n   int line, row;\n   scanf('%d%d', &line, &row);\n   for (i = 0; i < line; i++) scanf('%s', Map[i]);\n   for (i = 0; i < line; i++) {\n     for (j = row - 1; j >= 0; j--) {\n       if (Map[i][j] == '1')\n         dp[j][i] = dp[j + 1][i] + 1;\n       else\n         dp[j][i] = 0;\n     }\n   }\n   int ret = 0;\n   for (i = 0; i < row; i++) {\n     sort(dp[i], dp[i] + line);\n     for (j = 0; j < line; j++) {\n       ret = max(ret, (line - j) * dp[i][j]);\n     }\n   }\n   printf('%d\n', ret);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long s[1000005];\n int main(void) {\n   int n, d, ans = 0;\n   cin >> n >> d >> s[1];\n   for (int i = 2; i <= n; ++i) {\n     cin >> s[i];\n     int cnt = 0;\n     if (s[i] <= s[i - 1]) cnt = (s[i - 1] - s[i] + d) / d;\n     s[i] += cnt * d;\n     ans += cnt;\n   }\n   return cout << ans << '\n', 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC target('sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx')\n using namespace std;\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 = 3e5 + 123;\n const int PRI = 555557;\n const int pri = 997;\n int tests = 1;\n int n, m, q;\n int sz[N], pr[N], ans[N];\n bool u[N];\n vector<int> g[N];\n void dfs(int v, int p = 1) {\n   sz[v] = 1;\n   pr[v] = p;\n   for (int to : g[v]) {\n     if (to == p) continue;\n     dfs(to, v);\n     sz[v] += sz[to];\n   }\n }\n void dfs_center(int v) {\n   u[v] = 1;\n   if (sz[v] == 1) {\n     ans[v] = v;\n     return;\n   }\n   int mx = g[v].back();\n   for (int to : g[v]) {\n     if (u[to]) continue;\n     dfs_center(to);\n     if (sz[mx] < sz[to]) {\n       mx = to;\n     }\n   }\n   int c = ans[mx];\n   while (sz[v] > sz[c] * 2) {\n     c = pr[c];\n   }\n   ans[v] = c;\n }\n inline void Solve() {\n   cin >> n >> q;\n   for (int i = 2; i <= n; i++) {\n     int x;\n     cin >> x;\n     g[x].push_back(i);\n   }\n   dfs(1);\n   dfs_center(1);\n   while (q--) {\n     int x;\n     cin >> x;\n     cout << ans[x] << '\n';\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(0), cin.tie(0);\n   while (tests--) {\n     Solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s;\n   cin >> s;\n   regex w('WUB');\n   cout << regex_replace(s, w, ' ');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long n, m, i, j;\n   char x[2], y[2], t;\n   cin >> n >> m;\n   cin >> x[0];\n   for (i = 2; i < n; i++) cin >> t;\n   cin >> x[1] >> y[0];\n   y[0] = (y[0] == '^') ? '>' : '<';\n   for (j = 2; j < m; j++) cin >> t;\n   cin >> y[1];\n   y[1] = (y[1] == '^') ? '>' : '<';\n   if (x[0] == y[0] && x[1] == y[1] && x[0] != x[1])\n     cout << 'YES';\n   else\n     cout << 'NO';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long MOD = int(1e9) + 7;\n int debug = 0;\n const int N = int(2e3) + 5;\n using namespace std;\n int a[N], b[N], p[N];\n int main() {\n   int i, j, n, t;\n   ios::sync_with_stdio(false);\n   cin >> n;\n   for (i = 0; i < n; i++) cin >> a[i];\n   for (i = 0; i < n; i++) cin >> b[i];\n   int ans = 0;\n   vector<pair<int, int> > moves;\n   for (i = 0; i < n; i++) p[a[i]] = i;\n   for (i = 0; i < n; i++) {\n     int pos = -1;\n     for (j = 0; j < n; j++)\n       if (debug)\n         cerr << 'j'\n              << ': ' << j << ' | '\n              << 'b[j]'\n              << ': ' << b[j] << endl;\n     ;\n     for (j = 0; j < n; j++)\n       if (p[b[j]] == i) pos = j;\n     if (j == i) continue;\n     if (debug)\n       cerr << 'pos'\n            << ': ' << pos << ' | '\n            << 'i'\n            << ': ' << i << endl;\n     ;\n     int cur = pos;\n     for (j = pos - 1; j >= i; j--) {\n       if (p[b[j]] >= cur) {\n         ans += cur - j;\n         moves.push_back(make_pair(j, cur));\n         b[cur] = b[j];\n         b[j] = i;\n         cur = j;\n       }\n     }\n   }\n   cout << ans << '\n';\n   reverse(moves.begin(), moves.end());\n   cout << moves.size() << '\n';\n   for (i = 0; i < moves.size(); i++)\n     cout << moves[i].second + 1 << ' ' << moves[i].first + 1 << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 3079;\n int r, c, n, k;\n vector<int> nx(maxn, -1), pv(maxn, -1), kth(maxn, -1);\n vector<vector<int> > 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<point> 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 <bits/stdc++.h>\n using namespace std;\n const int N = 5e5 + 233;\n const int INF = numeric_limits<int>::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 <bits/stdc++.h>\n using namespace std;\n int n, k;\n int y;\n vector<pair<int, int> > 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 <bits/stdc++.h>\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 <typename Tp>\n Tp gcd(Tp A, Tp B) {\n   if (B == 0) return A;\n   return gcd(B, A % B);\n }\n template <typename Tp>\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 <bits/stdc++.h>\n using namespace std;\n template <typename T>\n std::ostream &operator<<(std::ostream &out, vector<T> &v) {\n   for (typename vector<T>::size_type i = 0; i < v.size(); ++i)\n     out << v[i] << ' ';\n   out << '\n';\n   return out;\n }\n template <typename T>\n std::ostream &operator<<(std::ostream &out, vector<vector<T> > &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<long long> 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 <bits/stdc++.h>\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<pair<int, int> >& ans) {\n   ans.push_back(pair<int, int>(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<pair<int, int> > 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int INF = 0x7fffffff;\n const int oo = 0x3f3f3f3f;\n template <typename T>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int MAXN = 100;\n char s[MAXN + 5];\n int main() {\n   int n, p, q;\n   scanf('%d%d%d', &n, &p, &q);\n   scanf('%s', s);\n   for (int i = 0; p * i <= n; i++) {\n     if ((n - p * i) % q == 0) {\n       int j = (n - p * i) / q;\n       printf('%d\n', i + j);\n       int pos = 0;\n       for (int k = 1; k <= i; k++) {\n         for (int l = 1; l <= p; l++) {\n           printf('%c', s[pos]);\n           pos++;\n         }\n         puts('');\n       }\n       for (int k = 1; k <= j; k++) {\n         for (int l = 1; l <= q; l++) {\n           printf('%c', s[pos]);\n           pos++;\n         }\n         puts('');\n       }\n       return 0;\n     }\n   }\n   puts('-1');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n void read(T &x) {\n   x = 0;\n   bool f = 0;\n   char c = getchar();\n   for (; !isdigit(c); c = getchar())\n     if (c == '-') f = 1;\n   for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);\n   if (f) x = -x;\n }\n long long T, n, m, k;\n int main() {\n   read(T);\n   while (T--) {\n     read(n), read(k);\n     k = k * k;\n     if ((n & 1) != (k & 1) || k > n)\n       puts('NO');\n     else\n       puts('YES');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mxn(3e5 + 10), mxm(4e5 + 10);\n const long long modl(998244353);\n int nm, n, m, p, t, k;\n int ans;\n int a[mxn], b[mxn], c[mxn];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin >> nm;\n   while (cin >> n >> m) {\n     ans = max(0, n + m - 3) / m + 1;\n     cout << ans;\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 27;\n vector<vector<int>> g;\n int t, tin[N], tout[N], up[N][20], sz[N], d[N];\n void dfs(int v, int p = 0, int dp = 0) {\n   tin[v] = t++;\n   d[v] = dp;\n   sz[v] = 1;\n   up[v][0] = p;\n   for (int i = 1; i < 20; i++) up[v][i] = up[up[v][i - 1]][i - 1];\n   for (int u : g[v]) {\n     if (u != p) {\n       dfs(u, v, dp + 1);\n       sz[v] += sz[u];\n     }\n   }\n   tout[v] = t++;\n }\n bool is(int a, int b) { return tin[a] <= tin[b] && tout[b] <= tout[a]; }\n int get_up(int a, int b) {\n   for (int i = 18; i >= 0; i--) {\n     if (!is(up[a][i], b)) a = up[a][i];\n   }\n   return a;\n }\n int lca(int a, int b) {\n   if (is(a, b)) return a;\n   if (is(b, a)) return b;\n   return up[get_up(a, b)][0];\n }\n int main() {\n   int n;\n   cin >> n;\n   g.resize(n + 1);\n   for (int i = 1; i < n; i++) {\n     int a, b;\n     cin >> a >> b;\n     g[a].push_back(b);\n     g[b].push_back(a);\n   }\n   tin[0] = -1;\n   tout[0] = 3 * N;\n   dfs(1);\n   int q;\n   cin >> q;\n   for (int o = 0; o < q; o++) {\n     int a, b;\n     cin >> a >> b;\n     int l = lca(a, b);\n     if (a == b)\n       cout << n << '\n';\n     else if (d[b] - d[l] == d[a] - d[l]) {\n       a = get_up(a, l);\n       b = get_up(b, l);\n       cout << n - sz[a] - sz[b] << '\n';\n     } else {\n       if (d[a] < d[b]) swap(a, b);\n       int dist = d[a] + d[b] - 2 * d[l];\n       if (dist % 2) {\n         puts('0');\n         continue;\n       }\n       dist /= 2;\n       int u = a;\n       for (int i = 18; i >= 0; i--) {\n         if (d[a] - d[up[u][i]] < dist) u = up[u][i];\n       }\n       int m = up[u][0];\n       cout << sz[m] - sz[u] << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s;\n int l, t, c, a;\n bool vis[26];\n bool ok = false;\n int main() {\n   cin >> s;\n   l = s.size();\n   if (l < 26) {\n     cout << -1 << endl;\n     return 0;\n   }\n   for (int i = 0; i < l; ++i) {\n     memset(vis, 0, sizeof vis);\n     t = c = 0;\n     for (int j = i; j < i + 26 && j < l; ++j) {\n       if (vis[s[j] - 'A']) break;\n       if (s[j] == '?') {\n         c++;\n         continue;\n       }\n       vis[s[j] - 'A']++;\n       t++;\n     }\n     if (c + t == 26) {\n       a = i;\n       ok = true;\n       break;\n     }\n   }\n   if (!ok) {\n     cout << -1 << endl;\n     return 0;\n   }\n   queue<char> q;\n   for (int j = 0; j < 26; ++j) {\n     if (!vis[j]) q.push((char)j + 'A');\n   }\n   for (int i = 0; i < a; ++i)\n     if (s[i] != '?')\n       cout << s[i];\n     else\n       cout << 'A';\n   for (int i = a; i < 26 + a; ++i)\n     if (s[i] != '?')\n       cout << s[i];\n     else {\n       cout << q.front();\n       q.pop();\n     }\n   for (int i = 26 + a; i < l; ++i)\n     if (s[i] != '?')\n       cout << s[i];\n     else\n       cout << 'A';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main(void) {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long k;\n   cin >> k;\n   long long second = 2000 + k;\n   long long ar[2000];\n   ar[0] = -1;\n   for (long long int i = 1; i < 2000; i++) {\n     if (second <= 1000000) {\n       ar[i] = second;\n       second = 0;\n     } else {\n       ar[i] = 1000000;\n       second -= 1000000;\n     }\n   }\n   cout << 2000 << '\n';\n   for (long long int i = 0; i < 2000; i++)\n     cout << ar[i] << ((i == (2000 - 1)) ? '\n' : ' ');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<long long> blame(1002, 0);\n vector<bool> visited(1002, false);\n long long dfs(long long u) {\n   if (visited[u]) return u;\n   visited[u] = true;\n   return dfs(blame[u]);\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long n;\n   cin >> n;\n   for (long long i = 1; i <= n; i++) {\n     cin >> blame[i];\n   }\n   for (long long i = 1; i <= n; i++) {\n     cout << dfs(i) << ' ';\n     fill(visited.begin(), visited.end(), false);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long g;\n void ex_gcd(long long a, long long b, long long& x, long long& y) {\n   if (!b) {\n     g = a;\n     x = 1, y = 0;\n   } else {\n     ex_gcd(b, a % b, y, x);\n     y = y - a / b * x;\n   }\n }\n int main() {\n   long long a, b, c;\n   scanf('%lld%lld%lld', &a, &b, &c);\n   long long x, y;\n   ex_gcd(a, b, x, y);\n   if (c % g != 0) return 0 * printf('-1\n');\n   return 0 * printf('%lld %lld\n', x * (-c / g), y * (-c / g));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, x[300300], y[300300];\n vector<int> graph[300300];\n int counter, dfs_num[300300], dfs_low[300300], dfs_parent[300300];\n vector<pair<int, int> > bs;\n void bridges(int u) {\n   dfs_low[u] = dfs_num[u] = counter++;\n   for (int v : graph[u]) {\n     if (!dfs_num[v]) {\n       dfs_parent[v] = u;\n       bridges(v);\n       if (dfs_low[v] > dfs_num[u]) bs.push_back(pair<int, int>(u, v));\n       dfs_low[u] = min(dfs_low[u], dfs_low[v]);\n     } else if (v != dfs_parent[u]) {\n       dfs_low[u] = min(dfs_low[u], dfs_num[v]);\n     }\n   }\n }\n vector<pair<int, int> > ng[300300];\n struct subset {\n   int parent, _rank;\n } subsets[300300];\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), yroot = Find(y);\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 int maxi = 1, dist[300300];\n void dfs(int u, int p, int d) {\n   if (d > dist[maxi]) maxi = u;\n   dist[u] = d;\n   for (pair<int, int> v : ng[u]) {\n     if (v.first != p) {\n       dfs(v.first, u, d + v.second);\n     }\n   }\n }\n int main() {\n   scanf('%d %d', &n, &m);\n   for (int i = 0; i < m; i++) {\n     scanf('%d %d', &x[i], &y[i]);\n     graph[x[i]].push_back(y[i]);\n     graph[y[i]].push_back(x[i]);\n   }\n   counter = 1;\n   for (int i = 1; i <= n; i++)\n     if (!dfs_num[i]) bridges(i);\n   for (int i = 1; i <= n; i++) {\n     subsets[i].parent = i;\n     subsets[i]._rank = 1;\n   }\n   for (int i = 0; i < bs.size(); i++) {\n     Union(bs[i].first, bs[i].second);\n     ng[bs[i].first].push_back(pair<int, int>(bs[i].second, 1));\n     ng[bs[i].second].push_back(pair<int, int>(bs[i].first, 1));\n   }\n   for (int i = 0; i < m; i++) {\n     if (Find(x[i]) == Find(y[i])) continue;\n     Union(x[i], y[i]);\n     ng[x[i]].push_back(pair<int, int>(y[i], 0));\n     ng[y[i]].push_back(pair<int, int>(x[i], 0));\n   }\n   dfs(1, 0, 0);\n   memset(dist, 0, sizeof dist);\n   dfs(maxi, 0, 0);\n   printf('%d\n', dist[maxi]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<vector<long long> > m(n, vector<long long>(n));\n   vector<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n template <typename Arg1>\n void ZZ(const char* name, Arg1&& arg1) {\n   std::cout << name << ' = ' << arg1 << std::endl;\n }\n template <typename Arg1, typename... Args>\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<long long int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n #pragma GCC optimize('Ofast,unroll-loops')\n #pragma GCC target('avx,avx2,sse,sse2')\n using namespace std;\n using vi = vector<long long>;\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<long long> u1(1e9, 2e9);\n   long long pepega = u1(rnd);\n   while (prime(pepega) != 1) pepega = u1(rnd);\n   return pepega;\n }\n template <typename T1>\n void ifmax(T1& max, T1 kek) {\n   if (kek > max) max = kek;\n   return;\n }\n template <typename T1>\n void ifmin(T1& min, T1 kek) {\n   if (kek < min) min = kek;\n   return;\n }\n template <typename T1>\n istream& operator>>(std::istream& in, pair<T1, T1>& a) {\n   in >> a.first >> a.second;\n   return in;\n }\n template <typename T1>\n istream& operator>>(std::istream& in, vector<T1>& a) {\n   for (long long i = 0; i < a.size(); i++) in >> a[i];\n   return in;\n }\n template <typename T1>\n ostream& operator<<(std::ostream& out, vector<T1>& b) {\n   for (long long i = 0; i < b.size(); i++) out << b[i];\n   return out;\n }\n template <typename T1>\n void sort(vector<T1>& m) {\n   sort(m.begin(), m.end());\n }\n template <typename T1>\n void reverse(vector<T1>& 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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long double n;\n   cin >> n;\n   long long m = sqrt(n);\n   if (m * m == n) {\n     cout << 2 * m;\n   } else if ((long long)m * (long long)(m + 1) >= n) {\n     cout << (long long)m + (long long)(m + 1);\n   } else\n     cout << (long long)2 * (long long)(m + 1);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int t, i, oo = 0, oz = 0, zo = 0, zz = 0;\n   char s1[2000005], s2[2000005];\n   cin >> t;\n   cin >> s1;\n   cin >> s2;\n   t = 2 * t;\n   for (i = 0; i < t; i++) {\n     if (s1[i] == '1' && s2[i] == '1')\n       oo++;\n     else if (s1[i] == '1' && s2[i] == '0')\n       oz++;\n     else if (s1[i] == '0' && s2[i] == '1')\n       zo++;\n     else\n       zz++;\n   }\n   if (oo % 2 == 0) {\n     if (oz > zo)\n       cout << 'First';\n     else if (oz + 1 == zo || oz == zo)\n       cout << 'Draw';\n     else\n       cout << 'Second';\n   } else {\n     if (oz >= zo)\n       cout << 'First';\n     else if (oz + 1 == zo || oz + 2 == zo)\n       cout << 'Draw';\n     else\n       cout << 'Second';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, l, r, q;\n map<pair<int, int>, int> vi;\n int V[100005 << 2], ly[100005 << 2];\n void push_down(int o) {\n   if (ly[o]) {\n     ly[o << 1] |= ly[o];\n     ly[o << 1 | 1] |= ly[o];\n     V[o << 1] |= ly[o];\n     V[o << 1 | 1] |= ly[o];\n     ly[o] = 0;\n   }\n }\n void push_up(int o) { V[o] = V[o << 1] & V[o << 1 | 1]; }\n void ud(int o, int l, int r, int L, int R, int x) {\n   int mid = (l + r) / 2;\n   if (L <= l && r <= R) {\n     V[o] |= x;\n     ly[o] |= x;\n     return;\n   }\n   push_down(o);\n   if (L <= mid) ud(o << 1, l, mid, L, R, x);\n   if (R > mid) ud(o << 1 | 1, mid + 1, r, L, R, x);\n   push_up(o);\n }\n int qy(int o, int l, int r, int L, int R) {\n   int mid = (l + r) / 2;\n   if (L <= l && r <= R) return V[o];\n   push_down(o);\n   int ans = (1 << 30) - 1;\n   if (L <= mid) ans &= qy(o << 1, l, mid, L, R);\n   if (R > mid) ans &= qy(o << 1 | 1, mid + 1, r, L, R);\n   push_up(o);\n   return ans;\n }\n int main() {\n   cin >> n >> m;\n   int ok = 1;\n   for (int i = 0; i < m; i++) {\n     scanf('%d%d%d', &l, &r, &q);\n     int tp = qy(1, 1, n, l, r);\n     if (vi[make_pair(l, r)]) {\n       if (tp != q) {\n         ok = 0;\n       }\n     }\n     if (!ok) continue;\n     vi[make_pair(l, r)] = 1;\n     if ((tp & q) == tp)\n       ud(1, 1, n, l, r, q);\n     else\n       ok = 0;\n   }\n   if (!ok) {\n     puts('NO');\n     return 0;\n   }\n   printf('YES\n');\n   for (int i = 1; i <= n; i++) printf('%d ', qy(1, 1, n, i, i));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   if (n == 1)\n     cout << m;\n   else if (n - m > m - 1 && n - m != 0)\n     cout << m + 1;\n   else\n     cout << m - 1;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 10;\n int main() {\n   list<int> a;\n   int n;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     int x;\n     scanf('%d', &x);\n     a.push_back(x);\n   }\n   for (auto t = a.begin(); t != a.end(); t++) {\n     auto s = t;\n     s--;\n     if (t == a.begin()) continue;\n     while (true) {\n       if (*t == *s) {\n         *t = *t + 1;\n         t = a.erase(s);\n         if (t == a.begin()) break;\n         s = t, s--;\n       } else\n         break;\n     }\n   }\n   printf('%d\n', a.size());\n   for (auto t : a) printf('%d ', t);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n int dp[800][800][10];\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= m; i++) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     dp[x][y][1]++;\n     dp[y][x][1]++;\n   }\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= n; j++)\n       if (i != j)\n         for (int q = 1; q <= n; q++)\n           if (q != i && q != j) {\n             dp[i][j][2] += dp[i][q][1] * dp[j][q][1];\n           }\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= n; j++)\n       if (i != j) {\n         for (int q = 1; q <= n; q++)\n           if (q != i && q != j) {\n             dp[i][j][3] += dp[i][q][2] * dp[j][q][1] +\n                            dp[i][q][1] * dp[j][q][2] -\n                            dp[i][j][1] * dp[i][q][1] * dp[i][q][1] -\n                            dp[i][j][1] * dp[j][q][1] * dp[j][q][1];\n           }\n         dp[i][j][3] /= 2;\n       }\n   long long sum = 0;\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= n; j++)\n       if (i != j && dp[i][j][3] != 0 && dp[i][j][2] != 0) {\n         for (int q = 1; q <= n; q++)\n           if (q != i && q != j && dp[i][q][1] != 0 && dp[j][q][1] != 0) {\n             sum += dp[i][j][3];\n             sum -= dp[j][q][2] - dp[i][j][1] + dp[i][q][2] - dp[i][j][1];\n           }\n       }\n   printf('%lld', sum / 10);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MOD = 1e9 + 7;\n template <typename T>\n void chmin(T &a, T b) {\n   if (a > b) a = b;\n }\n template <typename T>\n void chmax(T &a, T b) {\n   if (a < b) a = b;\n }\n template <typename T>\n void add(T &a, T b) {\n   a += b;\n   if (a < 0) a += MOD;\n   if (a >= MOD) a -= MOD;\n }\n void FastIn(int &T) {\n   char C;\n   bool F = 0;\n   for (; C = getchar(), C < '0' || C > '9';)\n     if (C == '-') F = 1;\n   for (T = C - '0'; C = getchar(), C >= '0' && C <= '9'; T = T * 10 + C - '0')\n     ;\n   F && (T = -T);\n }\n int in() {\n   int x;\n   scanf('%d', &x);\n   return x;\n }\n long long lin() {\n   long long x;\n   scanf('%lld', &x);\n   return x;\n }\n double din() {\n   double x;\n   scanf('%lf', &x);\n   return x;\n }\n long long p2[63];\n void initP2() {\n   p2[0] = 1;\n   for (int i = (1); i <= (62); ++i) {\n     p2[i] = p2[i - 1] * 2;\n   }\n }\n int countBitsBaseB(long long n, long long b) {\n   if (n == 0) return 1;\n   int ret = 0;\n   while (n) {\n     ret++;\n     n /= b;\n   }\n   return ret;\n }\n int count1(long long n) {\n   int ret = 0;\n   while (n) {\n     ret += n & 1;\n     n >>= 1;\n   }\n   return ret;\n }\n long long c[1024][1024] = {0};\n void initC() {\n   for (int i = 0; i < (1024); ++i) {\n     for (int j = 0; j < (i + 1); ++j) {\n       if (j == 0 || j == i) {\n         c[i][j] = 1;\n       } else {\n         c[i][j] = c[i - 1][j - 1];\n         add(c[i][j], c[i - 1][j]);\n       }\n     }\n   }\n }\n bool IsPrime(int n) {\n   if (n < 2) return false;\n   for (int i = 2; i * i <= n; i++) {\n     if (n % i == 0) return false;\n   }\n   return true;\n }\n void init() {\n   initP2();\n   initC();\n }\n const unsigned INVALID = 2000000001;\n struct CMD {\n   int cmd, x, y;\n } q[(int)(2e5 + 10)];\n struct DSU {\n   int f[(int)(2e5 + 10)];\n   int h[(int)(2e5 + 10)];\n   int *addr[(int)(2e5 + 10) << 2];\n   int val[(int)(2e5 + 10) << 2];\n   int stkSize = 0;\n   void init(int n) {\n     for (int i = (1); i <= (n); ++i) {\n       f[i] = i;\n       h[i] = 1;\n     }\n     stkSize = 0;\n   }\n   int find(int x) { return x == f[x] ? x : find(f[x]); }\n   void merge(int x, int y) {\n     x = find(x);\n     y = find(y);\n     if (x == y) {\n       return;\n     }\n     if (h[x] > h[y]) swap(x, y);\n     addr[stkSize] = &f[x];\n     val[stkSize++] = f[x];\n     f[x] = y;\n     if (h[x] == h[y]) {\n       addr[stkSize] = &h[y];\n       val[stkSize++] = h[y];\n       h[y]++;\n     }\n   }\n   void mergeFast(int x, int y) {\n     x = find(x);\n     y = find(y);\n     if (x == y) {\n       return;\n     }\n     if (h[x] > h[y]) swap(x, y);\n     f[x] = y;\n     if (h[x] == h[y]) {\n       h[y]++;\n     }\n   }\n   void undo(int size) {\n     while (stkSize > size) {\n       stkSize--;\n       *addr[stkSize] = val[stkSize];\n     }\n   }\n \n  private:\n } dsu;\n const int BLOCK = 5000;\n int last[(int)(2e5 + 10)];\n pair<int, int> GetEdge(int x, int y, int der, int n) {\n   x += der - 1;\n   if (x >= n) x -= n;\n   y += der - 1;\n   if (y >= n) y -= n;\n   if (x > y) swap(x, y);\n   return make_pair(x + 1, y + 1);\n }\n void Switch(const pair<int, int> &edge, set<pair<int, int>> &edges) {\n   if (edges.find(edge) != edges.end()) {\n     edges.erase(edge);\n   } else {\n     edges.insert(edge);\n   }\n }\n int main() {\n   init();\n   int n = in(), m = in();\n   for (int i = (1); i <= (m); ++i) {\n     q[i].cmd = in();\n     q[i].x = in();\n     q[i].y = in();\n   }\n   last[0] = 0;\n   for (int start = 1; start <= m; start += BLOCK) {\n     int end = start + BLOCK - 1;\n     if (end > m) {\n       end = m;\n     }\n     set<pair<int, int>> nowEdges;\n     nowEdges.clear();\n     for (int i0 = (start); i0 <= (end); ++i0) {\n       nowEdges.insert(GetEdge(q[i0].x, q[i0].y, 0, n));\n       nowEdges.insert(GetEdge(q[i0].x, q[i0].y, 1, n));\n     }\n     set<pair<int, int>> possible;\n     possible.clear();\n     set<pair<int, int>> impossible;\n     impossible.clear();\n     for (int i1 = (1); i1 <= (start - 1); ++i1) {\n       if (q[i1].cmd == 2) {\n         continue;\n       }\n       auto edge0 = GetEdge(q[i1].x, q[i1].y, last[i1 - 1], n);\n       if (nowEdges.find(edge0) == nowEdges.end()) {\n         Switch(edge0, impossible);\n       } else {\n         Switch(edge0, possible);\n       }\n     }\n     dsu.init(n);\n     for (auto edge1 : impossible) {\n       dsu.mergeFast(edge1.first, edge1.second);\n     }\n     for (int i2 = (start); i2 <= (end); ++i2) {\n       if (q[i2].cmd == 1) {\n         last[i2] = last[i2 - 1];\n         Switch(GetEdge(q[i2].x, q[i2].y, last[i2 - 1], n), possible);\n         continue;\n       } else {\n         const int top = dsu.stkSize;\n         for (auto edge1 : possible) {\n           dsu.merge(edge1.first, edge1.second);\n         }\n         auto queryEdge = GetEdge(q[i2].x, q[i2].y, last[i2 - 1], n);\n         last[i2] = dsu.find(queryEdge.first) == dsu.find(queryEdge.second);\n         putchar('0' + last[i2]);\n         dsu.undo(top);\n       }\n     }\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const bool debug = false;\n int triple[1 << 12][3];\n int use[1 << 12];\n int cost[1 << 12];\n std::vector<int> gen_masks(int L) {\n   std::vector<int> masks;\n   masks.push_back(0);\n   for (int i = 0; i < L; i++) {\n     for (int j = 1; j < L; j++) {\n       if (i + j * 2 >= L) continue;\n       masks.push_back((1 << i) | (1 << (i + j)) | (1 << (i + 2 * j)));\n     }\n   }\n   return masks;\n }\n int as[100005];\n int main() {\n   std::vector<int> masks = gen_masks(12);\n   for (int u : masks) {\n     for (int v : masks) {\n       for (int w : masks) {\n         int res = (u ^ v ^ w) & ((1 << 9) - 1);\n         triple[res][0] = u;\n         triple[res][1] = v;\n         triple[res][2] = w;\n       }\n     }\n   }\n   std::vector<std::array<int, 3> > moves;\n   int NN;\n   scanf('%d', &NN);\n   int N = NN;\n   for (int i = 1; i <= N; i++) {\n     scanf('%d', &as[i]);\n   }\n   while (N >= 12) {\n     int M = 0;\n     for (int i = 0; i < 9; i++) {\n       M |= (as[N - i] << i);\n     }\n     for (int t = 0; t < 3; t++) {\n       std::array<int, 3> move;\n       int index = 0;\n       for (int i = 0; i < 12; i++) {\n         if (triple[M][t] & (1 << i)) {\n           as[N - i] ^= 1;\n           move[index++] = N - i;\n         }\n       }\n       if (index) {\n         assert(index == 3);\n         moves.push_back(move);\n       }\n     }\n     N -= 9;\n   }\n   N = std::min(NN, 12);\n   masks = gen_masks(N);\n   for (int i = 1; i < (1 << N); i++) {\n     cost[i] = 1e9;\n   }\n   for (int mask : masks) {\n     for (int i = 0; i < (1 << N); i++) {\n       if (cost[i ^ mask] > cost[i] + 1) {\n         cost[i ^ mask] = cost[i] + 1;\n         use[i ^ mask] = mask;\n       }\n     }\n   }\n   if (debug) {\n     int worst = 0;\n     for (int i = 0; i < (1 << N); i++) {\n       if (cost[i] < 1e9) worst = std::max(worst, cost[i]);\n       printf('%d: ', i);\n       for (int k = 0; k < N; k++) {\n         printf('%d', (use[i] >> k) & 1);\n       }\n       printf('\n');\n     }\n     printf('WORST: %d\n', worst);\n   }\n   while (true) {\n     int M = 0;\n     for (int i = 0; i < N; i++) {\n       M |= (as[N - i] << i);\n     }\n     if (M == 0) break;\n     std::array<int, 3> move;\n     int index = 0;\n     for (int i = 0; i < 12; i++) {\n       if (use[M] & (1 << i)) {\n         as[N - i] ^= 1;\n         move[index++] = N - i;\n       }\n     }\n     if (index == 0) {\n       printf('NO\n');\n       return 0;\n     }\n     assert(index == 3);\n     moves.push_back(move);\n   }\n   for (int i = 0; i < N; i++) {\n     assert(as[i] == 0);\n   }\n   printf('YES\n');\n   printf('%d\n', (int)moves.size());\n   for (auto move : moves) {\n     printf('%d %d %d\n', move[0], move[1], move[2]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, a[100010], b[100010], c[100010];\n void nhap() {\n   scanf('%d%d', &n, &k);\n   for (int i = 1; i <= n; i++) scanf('%d', &c[i]);\n   int dem = 1;\n   a[1] = c[1];\n   for (int i = 2; i <= n; i++)\n     if (c[i] != a[dem]) {\n       dem++;\n       a[dem] = c[i];\n     }\n   n = dem;\n }\n void xuli() {\n   a[0] = 0;\n   a[n + 1] = 0;\n   memset(b, 0, sizeof b);\n   for (int i = 1; i <= n; i++)\n     if (a[i - 1] == a[i + 1])\n       b[a[i]] += 2;\n     else\n       b[a[i]]++;\n   int dem = 0, kq;\n   for (int i = 1; i <= k; i++)\n     if (dem < b[i]) dem = b[i], kq = i;\n   cout << kq;\n }\n int main() {\n   if (0) {\n     freopen('input.txt', 'r', stdin);\n     freopen('output.txt', 'w', stdout);\n   };\n   nhap();\n   xuli();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main(void) {\n   long n, m, l, r;\n   vector<long> a(100005);\n   map<long, vector<long> >::iterator mi;\n   vector<long>::iterator vi1, vi2;\n   map<long, vector<long> > hash;\n   scanf('%ld %ld', &n, &m);\n   for (long i = 0; i < n; i++) {\n     scanf('%ld', &a[i]);\n     if (hash.find(a[i]) != hash.end())\n       hash[a[i]].push_back(i);\n     else {\n       vector<long> v;\n       v.push_back(i);\n       hash[a[i]] = v;\n     }\n   }\n   mi = hash.begin();\n   while (mi != hash.end()) {\n     if (mi->first > mi->second.size()) {\n       long temp = mi->first;\n       mi++;\n       hash.erase(hash.find(temp));\n     } else\n       mi++;\n   }\n   long diff = r - l + 1, count = 0;\n   long first, last;\n   for (long i = 0; i < m; i++) {\n     scanf('%ld %ld', &l, &r);\n     diff = r - l + 1, count = 0;\n     mi = hash.begin();\n     while (mi->first <= diff && mi != hash.end()) {\n       vi1 = upper_bound(mi->second.begin(), mi->second.end(), r - 1);\n       vi2 = lower_bound(\n           mi->second.begin(),\n           mi->second.end() - ((mi->first - 3 > 0) ? (mi->first - 3) : 0),\n           l - 1);\n       last = vi1 - mi->second.begin(), first = vi2 - mi->second.begin();\n       if (last - first == mi->first) count++;\n       mi++;\n     }\n     printf('%ld\n', count);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int __SIZE = 1 << 18;\n char ibuf[__SIZE], *iS, *iT;\n template <typename T>\n inline void read(T &x) {\n   char ch, t = 0;\n   x = 0;\n   while (!isdigit(ch = (iS == iT\n                             ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),\n                                (iS == iT ? EOF : *iS++))\n                             : *iS++)))\n     t |= ch == '-';\n   while (isdigit(ch))\n     x = x * 10 + (ch ^ 48),\n     ch = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),\n                       (iS == iT ? EOF : *iS++))\n                    : *iS++);\n   x = t ? -x : x;\n }\n inline int read_int() {\n   int x;\n   return read(x), x;\n }\n inline long long read_ll() {\n   long long x;\n   return read(x), x;\n }\n template <typename T>\n inline void chkmin(T &a, T b) {\n   a = a < b ? a : b;\n }\n template <typename T>\n inline void chkmax(T &a, T b) {\n   a = a > b ? a : b;\n }\n const int MAXN = 150010;\n const int mod = 998244353;\n inline void Add(int &x, int y) { x += y, x -= x >= mod ? mod : 0; }\n inline int Mod(int x) { return x >= mod ? x - mod : x; }\n inline int fsp(int x, int k = mod - 2) {\n   int s = 1;\n   while (k) {\n     if (k & 1) s = 1LL * s * x % mod;\n     x = 1LL * x * x % mod, k >>= 1;\n   }\n   return s;\n }\n inline long long S(long long x, long long k) { return (x + x + k - 1) * k / 2; }\n inline long long find(long long x, long long k) {\n   if (!x) return k * (k + 1) >> 1;\n   long long p = find(x / k, k), rest = x % k;\n   long long st = (x / k) * (k * k + 1) + rest * k + 1;\n   if (st + k <= p)\n     return S(st, k);\n   else\n     return S(st, k) + min(k, st + k - p);\n }\n inline void Solve() {\n   long long n = read_ll(), k = read_int(), bel = (n - 1) / (k * k + 1);\n   long long p = find(bel, k);\n   if (p == n)\n     cout << (bel + 1) * (k + 1) << endl;\n   else {\n     long long pos = n - bel - 1 + (n < p);\n     long long t = (n - 1) % (k * k + 1) + 1;\n     long long cnt = bel * k + (t - 1 - (n >= p)) / k;\n     cout << pos + cnt << endl;\n   }\n }\n int main() {\n   int Case = read_int();\n   while (Case--) Solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int, int>, pair<string, int> > myMap;\n pair<string, long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long> 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 <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\n using namespace std;\n const int inf = 1e5 + 9;\n int n;\n int mp[9];\n bool done[109];\n vector<pair<long long, pair<long long, long long> > > 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 <bits/stdc++.h>\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<Edge> E;\n int E_size;\n vector<int> 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<Edge> 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 <bits/stdc++.h>\n using namespace std;\n vector<long long int> 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<long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int e[100010];\n int main() {\n   int n, u, i, j = 3;\n   double ans = 0;\n   scanf('%d%d', &n, &u);\n   for (i = 1; i <= n; i++) scanf('%d', &e[i]);\n   for (i = 1; i <= n; i++) {\n     while (j <= n && e[j] - e[i] <= u) j++;\n     j--;\n     if (j > i + 1) ans = max(ans, (e[j] - e[i + 1] + 0.0) / (e[j] - e[i]));\n   }\n   if (ans == 0)\n     cout << -1 << endl;\n   else {\n     cout.precision(19);\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int t;\n   cin >> t;\n   while (t--) {\n     long long int temperature;\n     long long int a12, b11;\n     long long int solution;\n     cin >> a12 >> b11;\n     if (b11 == a12) {\n       solution = 0;\n     } else if (b11 > a12) {\n       temperature = b11 - a12;\n       if (temperature & 1) {\n         solution = 1;\n       } else {\n         solution = 2;\n       }\n     } else {\n       temperature = a12 - b11;\n       if (temperature & 1) {\n         solution = 2;\n       } else {\n         solution = 1;\n       }\n     }\n     cout << solution << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int a[26];\n int w[256];\n int n;\n int LIMIT = 1;\n int su[26], sv[26], sk[26];\n int go(int lev) {\n   if (a[lev] == n) {\n     printf('%d\n', lev);\n     for (int i = 0; i < lev; i++)\n       if (su[i] == -1) {\n         printf('lea e%cx, [%d*e%cx]\n', 'a' + i + 1, 1 << sk[i], 'a' + sv[i]);\n       } else if (sk[i] == 0)\n         printf('lea e%cx, [e%cx + e%cx]\n', 'a' + i + 1, 'a' + su[i],\n                'a' + sv[i]);\n       else\n         printf('lea e%cx, [e%cx + %d*e%cx]\n', 'a' + i + 1, 'a' + su[i],\n                1 << sk[i], 'a' + sv[i]);\n     return 1;\n   }\n   if (lev >= LIMIT) return 0;\n   int &i = su[lev], &j = sv[lev], &k = sk[lev];\n   i = -1;\n   for (j = 0; j <= lev; j++)\n     for (k = 0; k <= 3; k++) {\n       int v = (a[j] << k);\n       if (v > a[lev] && v <= n) {\n         a[lev + 1] = v;\n         if (go(lev + 1)) return 1;\n         a[lev + 1] = 0;\n       }\n     }\n   for (i = 0; i <= lev; i++)\n     for (j = 0; j <= lev; j++) {\n       for (k = 0; k <= 3; k++) {\n         int v = a[i] + (a[j] << k);\n         if (v > a[lev] && v <= n) {\n           a[lev + 1] = v;\n           if (go(lev + 1)) return 1;\n           a[lev + 1] = 0;\n         }\n       }\n     }\n   return 0;\n }\n int main(void) {\n   scanf('%d', &n);\n   if (n == 1) {\n     printf('0\n');\n     return 0;\n   }\n   a[0] = 1;\n   w[1] = 1;\n   for (LIMIT = 1;; LIMIT++) {\n     if (go(0)) {\n       break;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n;\n   long long ans = 0;\n   for (int i = 2; i <= n; i++)\n     for (int j = i + i; j <= n; j += i) ans += j / i;\n   cout << ans * 4 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int64_t INF = INT64_MAX / 4;\n const int64_t NINF = -INF;\n map<pair<int64_t, uint32_t>, int64_t> dp;\n int64_t grundy(int64_t pile, uint32_t pattern) {\n   if (pile == 0) {\n     return 0;\n   }\n   pair<int64_t, uint32_t> key = {pile, pattern};\n   auto fd = dp.find(key);\n   if (fd != dp.end()) {\n     return fd->second;\n   }\n   bitset<32> bs(pattern);\n   set<int64_t> res;\n   for (int64_t i = 0; i < pile; i++) {\n     if (!bs[i]) {\n       bs[i] = true;\n       res.insert(grundy(pile - (i + 1), bs.to_ulong()));\n       bs[i] = false;\n     }\n   }\n   int64_t ans = 0;\n   while (res.find(ans) != res.end()) {\n     ans++;\n   }\n   dp.insert({key, ans});\n   return ans;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int64_t n;\n   cin >> n;\n   int64_t ans = 0;\n   for (int64_t i = 0; i < n; i++) {\n     int64_t pile;\n     cin >> pile;\n     ans ^= grundy(pile, 0);\n   };\n   if (ans == 0) {\n     cout << 'YES';\n   } else {\n     cout << 'NO';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long p, q, b, t, g;\n long long gcd(long long a, long long b) {\n   if (a < b) swap(a, b);\n   while (b != 0) {\n     a %= b;\n     swap(a, b);\n   }\n   return a;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> t;\n   while (t--) {\n     cin >> p >> q >> b;\n     g = gcd(p, q);\n     q /= g;\n     while (true) {\n       g = gcd(b, q);\n       if (g == 1) break;\n       while (q % g == 0) q /= g;\n     }\n     if (q == 1)\n       cout << 'Finite';\n     else\n       cout << 'Infinite';\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC target('avx')\n #pragma GCC optimize('O3')\n #pragma GCC optimize('unroll-loops')\n using namespace std;\n int dx[4] = {1, 0, -1, 0};\n int dy[4] = {0, 1, 0, -1};\n int main() {\n   long long A, B, C, D, E, F, N, K, M, Z, sum = 0, num = 0, flag = 0;\n   string S, T;\n   cin >> Z;\n   queue<long long> que;\n   while (Z--) {\n     cin >> S;\n     vector<long long> P(0, 0);\n     num = 0;\n     S += '0';\n     for (long long int i = 0; i < S.size(); i++) {\n       if (S[i] == '1')\n         num++;\n       else {\n         P.push_back(num);\n         num = 0;\n       }\n     }\n     sort(P.begin(), P.end());\n     reverse(P.begin(), P.end());\n     sum = 0;\n     for (long long int i = 0; i < P.size(); i++) {\n       sum += P[i];\n       i++;\n     }\n     que.push(sum);\n   }\n   while (!que.empty()) {\n     cout << que.front() << endl;\n     que.pop();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int k, n;\n   cin >> n >> k;\n   int x[n];\n   for (int i = 0; i < n; i++) {\n     cin >> x[i];\n   }\n   double m = -1, sum = 0;\n   int c = 0;\n   for (int i = 0; i < n; i++) {\n     for (int j = i; j < n; j++) {\n       c++;\n       sum += x[j];\n       if (c >= k && (sum / c) > m) {\n         m = sum / c;\n       }\n     }\n     c = 0;\n     sum = 0;\n   }\n   cout << setprecision(15) << fixed << m << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long powm(long long base, long long exp, long long mod = 1000000009) {\n   long long ans = 1;\n   while (exp) {\n     if (exp & 1) ans = (ans * base) % mod;\n     exp >>= 1, base = (base * base) % mod;\n   }\n   return ans;\n }\n long long ctl(char x, char an = 'a') { return (long long)(x - an); }\n char ltc(long long x, char an = 'a') { return (char)(x + an); }\n long long first[300005], pref[300005], pref_fib[300005], a[300005];\n long long get_fibo_sum(long long l, long long r) {\n   return (pref_fib[r] - (l ? pref_fib[l - 1] : 0) + 1000000009) % 1000000009;\n }\n long long get_fibo(long long st1, long long st2, long long i) {\n   if (i == 0)\n     return st1;\n   else if (i == 1)\n     return st2;\n   else {\n     long long ret = ((first[i - 1] * st2) % 1000000009 +\n                      (first[i - 2] * st1) % 1000000009) %\n                     1000000009;\n     return ret;\n   }\n }\n long long get_fibo_sum(long long st1, long long st2, long long i) {\n   if (i == 0)\n     return st1;\n   else if (i == 1)\n     return (st1 + st2) % 1000000009;\n   else {\n     long long ans = (st2 * get_fibo_sum(1, i - 1)) % 1000000009;\n     ans = (ans + (st1 * get_fibo_sum(0, i - 2)) % 1000000009) % 1000000009;\n     ans = (ans + st1) % 1000000009;\n     ans = (ans + st2) % 1000000009;\n     return ans;\n   }\n }\n const pair<long long, long long> khali = make_pair(0LL, 0LL);\n struct lazySegTree {\n   long long tree[4 * 300005], x, y, val;\n   pair<long long, long long> lazy[4 * 300005];\n   void push(long long low, long long high, long long pos) {\n     if (lazy[pos] != khali) {\n       tree[pos] +=\n           get_fibo_sum(lazy[pos].first, lazy[pos].second, (high - low));\n       if (low != high) {\n         pair<long long, long long> tmp;\n         tmp = lazy[pos];\n         lazy[2 * pos + 1].first =\n             (lazy[2 * pos + 1].first + tmp.first) % 1000000009;\n         lazy[2 * pos + 1].second =\n             (lazy[2 * pos + 1].second + tmp.second) % 1000000009;\n         tmp.first = get_fibo(lazy[pos].first, lazy[pos].second,\n                              (low + high) / 2 - low + 1);\n         tmp.second = get_fibo(lazy[pos].first, lazy[pos].second,\n                               (low + high) / 2 - low + 2);\n         lazy[2 * pos + 2].first =\n             (lazy[2 * pos + 2].first + tmp.first) % 1000000009;\n         lazy[2 * pos + 2].second =\n             (lazy[2 * pos + 2].second + tmp.second) % 1000000009;\n       }\n       lazy[pos] = khali;\n     }\n   }\n   long long query(long long low, long long high, long long pos) {\n     push(low, high, pos);\n     if (x <= low and y >= high) return tree[pos];\n     if (x > high || y < low) return 0;\n     long long mid = (high + low) / 2;\n     return (query(low, mid, 2 * pos + 1) + query(mid + 1, high, 2 * pos + 2)) %\n            1000000009;\n   }\n   void update(long long low, long long high, long long pos) {\n     push(low, high, pos);\n     if (x > high || y < low) return;\n     if (x <= low and y >= high) {\n       lazy[pos].first = first[low - x];\n       lazy[pos].second = first[low - x + 1];\n       push(low, high, pos);\n       return;\n     }\n     long long mid = (low + high) / 2;\n     update(low, mid, 2 * pos + 1), update(mid + 1, high, 2 * pos + 2);\n     tree[pos] = (tree[2 * pos + 1] + tree[2 * pos + 2]) % 1000000009;\n   }\n } lst;\n int main() {\n   first[0] = 1, first[1] = 1;\n   for (long long i = 2; i < 300005; i++)\n     first[i] = (first[i - 1] + first[i - 2]) % 1000000009;\n   for (long long i = 0; i < 4 * 300005; i++) lst.lazy[i] = khali;\n   long long type, l, r, n, q;\n   cin >> n >> q;\n   for (long long i = 1; i < n + 1; i++) cin >> a[i];\n   pref_fib[0] = 1;\n   for (long long i = 1; i < 300005; i++)\n     pref_fib[i] = (pref_fib[i - 1] + first[i]) % 1000000009;\n   pref[1] = a[1];\n   for (long long i = 1; i < 300005; i++)\n     pref[i] = (pref[i - 1] + a[i]) % 1000000009;\n   while (q--) {\n     cin >> type >> l >> r;\n     lst.x = l, lst.y = r;\n     if (type == 1) {\n       lst.update(1, n, 0);\n     } else {\n       long long ans = lst.query(1, n, 0);\n       ans = (ans + pref[r]) % 1000000009;\n       ans = (ans - pref[l - 1] + 1000000009) % 1000000009;\n       cout << ans << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n void solve() {\n   int n;\n   std::cin >> n;\n   std::stack<int> q;\n   int a = 0;\n   int cur = 1;\n   n += n;\n   while (n--) {\n     std::string s;\n     std::cin >> s;\n     if (s[0] == 'r') {\n       if (!q.empty() && q.top() != cur) {\n         while (!q.empty()) q.pop();\n         ++a;\n       }\n       if (!q.empty()) q.pop();\n       ++cur;\n     } else {\n       int x;\n       std::cin >> x;\n       q.push(x);\n     }\n   }\n   std::cout << a;\n }\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   std::cin.tie(nullptr);\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline bool smin(T &a, const T &b) {\n   return b < a ? a = b, 1 : 0;\n }\n template <typename T>\n inline bool smax(T &a, const T &b) {\n   return a < b ? a = b, 1 : 0;\n }\n const long long N = 1e5 + 100, lg = 22;\n long long n, k, add[N], h[N];\n vector<pair<long long, long long> > adj[N];\n long long par[N][lg];\n void dfs(long long v = 1, long long p = -1, long long dep = 0) {\n   if (v != 1) {\n     par[v][0] = p;\n     for (long long i = 1; i < lg; i++) par[v][i] = par[par[v][i - 1]][i - 1];\n   } else {\n     for (long long i = 0; i < lg; i++) par[v][i] = v;\n   }\n   h[v] = dep;\n   for (auto u : adj[v])\n     if (u.first != p) dfs(u.first, v, dep + 1);\n }\n long long getPar(long long v, long long k) {\n   for (long long i = lg - 1; i >= 0; i--)\n     if (k >> i & 1) v = par[v][i];\n   return v;\n }\n long long lca(long long u, long long v) {\n   if (h[u] > h[v]) swap(u, v);\n   v = getPar(v, h[v] - h[u]);\n   if (u == v) return v;\n   for (long long i = lg - 1; i >= 0; i--) {\n     if (par[u][i] != par[v][i]) u = par[u][i], v = par[v][i];\n   }\n   return par[v][0];\n }\n long long ans[N];\n long long calc(long long v = 1, long long p = -1, long long want = -1) {\n   long long res = add[v];\n   for (auto u : adj[v]) {\n     if (u.first == p) continue;\n     res += calc(u.first, v, u.second);\n   }\n   if (want != -1) ans[want] = res;\n   return res;\n }\n int32_t main() {\n   cin >> n;\n   for (long long i = 0; i < n - 1; i++) {\n     long long u, v;\n     cin >> u >> v;\n     adj[v].push_back({u, i}), adj[u].push_back({v, i});\n   }\n   dfs();\n   cin >> k;\n   while (k--) {\n     long long u, v;\n     cin >> u >> v;\n     long long l = lca(u, v);\n     add[u]++, add[v]++, add[l] -= 2;\n   };\n   calc();\n   for (long long i = 0; i < n - 1; i++) cout << ans[i] << ' ';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   int arr[n][4];\n   multiset<int> s[4];\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < 4; j++) {\n       cin >> arr[i][j];\n       s[j].insert(arr[i][j]);\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < 4; j++) {\n       auto temp = s[j].find(arr[i][j]);\n       s[j].erase(temp);\n     }\n     if (*s[0].rbegin() <= *s[2].begin() && *s[1].rbegin() <= *s[3].begin()) {\n       cout << *s[0].rbegin() << ' ' << *s[1].rbegin() << endl;\n       break;\n     }\n     for (int j = 0; j < 4; j++) s[j].insert(arr[i][j]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve() {\n   long long n, m, k;\n   cin >> n >> m >> k;\n   long long p[m];\n   for (long long int i = 0; i < m; i++) cin >> p[i];\n   sort(p, p + m);\n   long long an = 0, x = 0, c = 0, cp = 1;\n   while (1) {\n     long long y = x, pg = ceil((long double)(p[x] - x) / (k));\n     while (y < m && ceil((long double)(p[y] - x) / (k)) == pg) y++;\n     if (y == m) {\n       cout << an + 1;\n       return;\n     }\n     an++;\n     x = y;\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long TESTS = 1;\n   while (TESTS--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int requestNum;\n   cin >> requestNum;\n   vector<pair<int, pair<int, int>>> vect(requestNum);\n   for (int i = 0; i < requestNum; i++) {\n     int num, money;\n     cin >> num >> money;\n     vect.push_back(make_pair(money, make_pair(num, i + 1)));\n   }\n   sort(vect.rbegin(), vect.rend());\n   int tablesNum;\n   cin >> tablesNum;\n   vector<pair<int, int>> maxPeople(tablesNum);\n   for (int i = 0; i < tablesNum; i++) {\n     cin >> maxPeople[i].first;\n     maxPeople[i].second = i + 1;\n   }\n   sort(maxPeople.begin(), maxPeople.end());\n   vector<bool> tablesFull(tablesNum, false);\n   long long int totalMoney = 0;\n   vector<pair<long, long>> result;\n   for (int i = 0; i < requestNum; i++) {\n     for (int j = 0; j < tablesNum; j++) {\n       if (vect[i].second.first <= maxPeople[j].first && !tablesFull[j]) {\n         result.push_back(make_pair(vect[i].second.second, maxPeople[j].second));\n         totalMoney += vect[i].first;\n         tablesFull[j] = true;\n         break;\n       }\n     }\n   }\n   cout << result.size() << ' ' << totalMoney << endl;\n   for (int i = 0; i < result.size(); i++) {\n     cout << result[i].first << ' ' << result[i].second << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 2e5 + 5, inf = 1e18, mod = 1e9 + 7;\n const double PI = 3.1415926536;\n int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n bool is_prime(long long n) {\n   for (long long i = 2; i * i <= n; ++i) {\n     if (n % i == 0) {\n       return false;\n     }\n   }\n   return true;\n }\n inline long long getPow(long long a, long long b) {\n   long long res = 1ll, tp = a;\n   while (b) {\n     if (b & 1ll) {\n       res *= tp;\n     }\n     tp *= tp;\n     b >>= 1ll;\n   }\n   return res;\n }\n long long vec_mult(const pair<long long, long long> &t1,\n                    const pair<long long, long long> &t2,\n                    const pair<long long, long long> &t3) {\n   const long long &x1 = t1.first, y1 = t1.second;\n   const long long &x2 = t2.first, y2 = t2.second;\n   const long long &x3 = t3.first, y3 = t3.second;\n   return ((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1));\n }\n void ok() {\n   cout << 'YES' << endl;\n   exit(0);\n }\n void no() {\n   cout << 'NO' << endl;\n   exit(0);\n }\n inline long long nxt() {\n   long long x;\n   cin >> x;\n   return x;\n }\n long long otr(long long num) {\n   long long cur = 0;\n   long long ct = 1;\n   while (num) {\n     cur += ct * (9 - num % 10);\n     num /= 10;\n     ct *= 10;\n   }\n   return cur;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0), cout.tie(0);\n   long long l = nxt(), r = nxt();\n   long long t = 1ll;\n   long long ans = -1;\n   while (t <= r) {\n     long long left = max(l, t);\n     long long right = min(r, 10ll * t - 1);\n     while (right - left > 2) {\n       long long len = (right - left + 1) / 3;\n       long long t1 = left + len;\n       long long t2 = right - len;\n       if (t1 * otr(t1) >= t2 * otr(t2)) {\n         right = t2;\n       } else {\n         left = t1;\n       }\n     }\n     while (left <= right) {\n       ans = max(ans, left * otr(left));\n       left++;\n     }\n     t *= 10ll;\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void faster() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n }\n string s, x, t, ans;\n long long q, n, a[456789], b[456789], sum, prefa[456789], prefb[456789], k, l,\n     r, mx;\n bool ok;\n void dii() {\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n   }\n   k = 1;\n   for (int i = 1; i <= n; i++) {\n     if (a[i] <= 2 * a[i - 1]) {\n       k++;\n     } else {\n       k = 1;\n     }\n     if (k > mx) {\n       mx = k;\n     }\n   }\n   cout << mx;\n }\n int main() {\n   faster();\n   q = 1;\n   while (q--) {\n     dii();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int INF = 1 << 29;\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   std::cin.tie(NULL);\n   ;\n   int n;\n   std::cin >> n;\n   std::vector<int> v(n);\n   for (int &it : v) std::cin >> it;\n   int alice = v[0];\n   int sum = std::accumulate(v.begin(), v.end(), 0);\n   int target = sum / 2 + 1;\n   std::vector<int> ans;\n   ans.push_back(1);\n   int cur = alice;\n   for (int i = 0; i < n; i++) {\n     if (alice < v[i] * 2) continue;\n     cur += v[i];\n     ans.push_back(i + 1);\n     if (cur >= target) break;\n   }\n   if (cur < target) {\n     std::cout << 0;\n     exit(0);\n   } else {\n     std::cout << ans.size() << '\n';\n     for (int it : ans) std::cout << it << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n void dfs(int64_t node, int64_t from,\n          const std::vector<std::vector<int64_t> > &g,\n          std::vector<bool> &visited, int64_t &count, bool &cycle, bool &self) {\n   if (visited[node]) {\n     return;\n   }\n   visited[node] = 1;\n   ++count;\n   for (int64_t p = 0; p < g[node].size(); p++) {\n     int64_t u = g[node][p];\n     if (u == from) {\n       continue;\n     } else if (u == node) {\n       self = true;\n     } else if (visited[u]) {\n       cycle = true;\n     } else {\n       dfs(u, node, g, visited, count, cycle, self);\n     }\n   }\n   return;\n }\n int main() {\n   const int64_t MOD = 1000000007;\n   int64_t n;\n   scanf('%lld', &n);\n   std::vector<std::vector<int64_t> > g(2 * n);\n   for (int64_t p = 0; p < n; p++) {\n     int64_t x, y;\n     scanf('%lld %lld', &x, &y);\n     --x;\n     --y;\n     g[x].push_back(y);\n     g[y].push_back(x);\n   }\n   std::vector<bool> visited(2 * n, false);\n   int64_t total(1);\n   for (int64_t p = 0; p < 2 * n; p++) {\n     if (visited[p]) {\n       continue;\n     }\n     int64_t count(0);\n     bool cycle(false), self(false);\n     dfs(p, -1, g, visited, count, cycle, self);\n     if (self) {\n       count = 1;\n     } else if (cycle) {\n       count = 2;\n     }\n     total *= count;\n     total %= MOD;\n   }\n   printf('%lld\n', total);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = 1010, M = 2010;\n int las[M], nxt[M], to[M], cnt;\n int l[M], r[M], siz[M], mx[N][N], f[N];\n inline void add(int u, int v) {\n   cnt++;\n   to[cnt] = v;\n   nxt[cnt] = las[u];\n   las[u] = cnt;\n }\n int n, m;\n inline void fmin(int &a, int b) {\n   if (a > b) a = b;\n }\n inline void fmax(int &a, int b) {\n   if (a < b) a = b;\n }\n void dfs(int now) {\n   int i;\n   siz[now] = now != 1;\n   if (las[now]) l[now] = n, r[now] = 0;\n   for (i = las[now]; i; i = nxt[i])\n     dfs(to[i]), siz[now] += siz[to[i]], fmin(l[now], l[to[i]]),\n         fmax(r[now], r[to[i]]);\n   fmax(mx[l[now]][r[now]], siz[now]);\n }\n int main() {\n   int i, j, x;\n   scanf('%d', &n);\n   scanf('%d', &m);\n   for (i = 2; i <= m; i++) scanf('%d', &x), add(x, i);\n   for (i = 1; i <= n; i++) scanf('%d', &x), l[x] = r[x] = i;\n   dfs(1);\n   cnt = 0;\n   memset(las, 0, sizeof las);\n   scanf('%d', &m);\n   for (i = 2; i <= m; i++) scanf('%d', &x), add(x, i);\n   for (i = 1; i <= n; i++) scanf('%d', &x), l[x] = r[x] = i;\n   dfs(1);\n   for (i = 1; i <= n; i++)\n     for (j = 1; j <= i; j++)\n       if (mx[j][i]) fmax(f[i], f[j - 1] + mx[j][i]);\n   printf('%d\n', f[n]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <class T, class V>\n void _print(pair<T, V> p);\n template <class T>\n void _print(vector<T> v);\n template <class T>\n void _print(set<T> v);\n template <class T, class V>\n void _print(map<T, V> v);\n template <class T>\n void _print(multiset<T> v);\n template <class T, class V>\n void _print(pair<T, V> p) {\n   cerr << '{';\n   _print(p.first);\n   cerr << ',';\n   _print(p.second);\n   cerr << '}';\n }\n template <class T>\n void _print(vector<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T>\n void _print(set<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T>\n void _print(multiset<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T, class V>\n void _print(map<T, V> v) {\n   cerr << '[ ';\n   for (auto i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T, class V>\n void _print(unordered_map<T, V> v) {\n   cerr << '[ ';\n   for (auto i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T>\n void _print(list<T> 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 <bits/stdc++.h>\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<vector<int> > 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<int>(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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n double dp[(1 << 20)];\n double a[20][20];\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       cin >> a[i][j];\n     }\n   }\n   dp[(1 << n) - 1] = 1.0;\n   for (int st = (1 << n) - 1; st >= 0; st--) {\n     for (int i = 0; i < n; i++) {\n       if (st & (1 << i)) {\n         for (int j = 0; j < n; j++) {\n           if ((st & (1 << j)) && (i != j)) {\n             int q = __builtin_popcount(st);\n             dp[st ^ (1 << j)] += dp[st] * a[i][j] * (1.0 / (q * (q - 1) / 2));\n           }\n         }\n       }\n     }\n   }\n   for (int i = 1; i < (1 << n); i = (i << 1)) {\n     printf('%.6f ', dp[i]);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int pr[] = {2, 3, 5, 7, 11, 13, 17, 19};\n int big[50000005];\n int c[10];\n int ans[10100];\n int main() {\n   int k;\n   scanf('%d', &k);\n   big[1] = 0;\n   for (int i = 0; i < 7; i++) big[pr[i]] = i + 1;\n   for (int i = 2; i <= 2 * k * k; i++) {\n     if (big[i] == 0) continue;\n     for (int j = 0; j < 7; j++) {\n       if (i * pr[j] <= 2 * k * k) {\n         big[i * pr[j]] = max(big[i], j + 1);\n       }\n     }\n     for (int j = big[i] - 1; j < 7; j++) c[j]++;\n   }\n   for (int j = 0; j < 7; j++)\n     if (c[j] >= k) {\n       int sz = 0;\n       for (int i = 2 * k * k; i >= 0; i--)\n         if (big[i] != 0 && big[i] - 1 <= j &&\n             big[i / pr[big[i] - 1]] - 1 < big[i] - 1) {\n           ans[sz++] = i;\n           if (sz == k) break;\n         }\n       if (sz < k) continue;\n       for (int i = sz - 1; i >= 0; i--) printf('%d ', ans[i]);\n       printf('\n');\n       return 0;\n     }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e7 + 5;\n int s[maxn];\n int a[maxn];\n int main() {\n   int n;\n   scanf('%d', &n);\n   long long ans = 0;\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &s[i]);\n   }\n   sort(s + 1, s + n + 1);\n   for (int i = 1; i <= n / 2; i++) {\n     a[i] = s[i] + s[n + 1 - i];\n     ans += a[i] * a[i];\n   }\n   printf('%lld\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long double EPS = 1e-9;\n long long Power(long long a, long long b) {\n   if (b == 0) return 1;\n   long long p = Power(a, b / 2);\n   p = (p * p);\n   if (b & 1) {\n     p = (p * a);\n   }\n   return p;\n }\n long long Gcd(long long a, long long b) {\n   if (b == 0) return a;\n   if (a < b) return Gcd(b, a);\n   return Gcd(b, a % b);\n }\n void Solve() {\n   int n, m;\n   long long l;\n   cin >> n >> m >> l;\n   vector<long long> arr(n), seg(n, -1);\n   for (int i = 0; i < n; i++) cin >> arr[i];\n   int curr = 0, prev = -1;\n   for (int i = 0; i < n; i++) {\n     if (arr[i] > l) {\n       seg[i] = 0;\n       if (prev == -1) {\n         curr++;\n       }\n       prev = 0;\n     } else {\n       prev = -1;\n       seg[i] = -1;\n     }\n   }\n   while (m--) {\n     int t;\n     cin >> t;\n     if (t == 0) {\n       cout << curr << '\n';\n     } else {\n       int p;\n       long long d;\n       cin >> p >> d;\n       p--;\n       arr[p] += d;\n       if (seg[p] == -1 && arr[p] > l) {\n         seg[p] = 0;\n         if (p == 0) {\n           if (p + 1 < n && seg[p + 1] == -1) {\n             curr++;\n           } else if (n == 1) {\n             curr++;\n           }\n         } else if (p == n - 1) {\n           if (p - 1 >= 0 && seg[p - 1] == -1) {\n             curr++;\n           } else if (n == 1) {\n             curr++;\n           }\n         } else {\n           if (seg[p - 1] == 0 && seg[p + 1] == 0) {\n             curr--;\n           } else if (seg[p - 1] == -1 && seg[p + 1] == -1) {\n             curr++;\n           }\n         }\n       }\n     }\n   }\n }\n int main() {\n   int t = 1;\n   while (t--) {\n     Solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e4 + 5;\n char s[N];\n int dp[10][N];\n int ans[N];\n int len;\n int dfs(int num, int idx) {\n   if (~dp[num][idx]) return dp[num][idx];\n   if (idx == len)\n     return 1;\n   else if (idx > len)\n     return 0;\n   int &ret = dp[num][idx];\n   ret = dfs(num ^ 1, idx + num);\n   bool flag = false;\n   for (int i = idx; i < idx + num; ++i) {\n     if (s[i] != s[i + num]) {\n       flag = true;\n       break;\n     }\n   }\n   if (flag) {\n     ret = max(ret, dfs(num, idx + num));\n   }\n   return ret;\n }\n const int B = 333;\n int cal(char a, char b, char c) { return a * B * B + b * B + c; }\n int cal(char a, char b) { return a * B * B + b * B; }\n void prt(int x) {\n   printf('%c', x / (B * B));\n   printf('%c', x % (B * B) / B);\n   if (x % B) {\n     printf('%c', x % B);\n   }\n   puts('');\n }\n int main() {\n   while (~scanf('%s', s)) {\n     memset(dp, -1, sizeof(dp));\n     int cnt = 0;\n     len = strlen(s);\n     for (int i = len - 2; i >= 5; --i) {\n       if (dfs(2, i) == 1) {\n         ans[cnt++] = (cal(s[i], s[i + 1]));\n       }\n       if (dfs(3, i) == 1) {\n         ans[cnt++] = (cal(s[i], s[i + 1], s[i + 2]));\n       }\n     }\n     sort(ans, ans + cnt);\n     cnt = unique(ans, ans + cnt) - ans;\n     printf('%d\n', cnt);\n     for (int i = 0; i < cnt; ++i) {\n       prt(ans[i]);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long jc[210000], ny[210000];\n char s[210000];\n int n, f[210000], g[210000], ans;\n int C(int n, int m) {\n   if (m > n) return 0;\n   return jc[n] * ny[m] % 1000000007 * ny[n - m] % 1000000007;\n }\n int main() {\n   scanf('%s', s + 1);\n   n = strlen(s + 1);\n   for (int i = 1; i <= n; i++) {\n     f[i] = f[i - 1];\n     if (s[i] == '(') f[i]++;\n   }\n   for (int i = n; i >= 1; i--) {\n     g[i] = g[i + 1];\n     if (s[i] == ')') g[i]++;\n   }\n   jc[0] = jc[1] = ny[0] = ny[1] = 1;\n   for (int i = 2; i <= n; i++)\n     jc[i] = jc[i - 1] * i % 1000000007,\n     ny[i] = (long long)(-1000000007 / i) * ny[1000000007 % i] % 1000000007;\n   for (int i = 2; i <= n; i++) ny[i] = ny[i] * ny[i - 1] % 1000000007;\n   for (int i = 1; i <= n; i++)\n     if (s[i] == '(') ans = (ans + C(f[i] + g[i] - 1, f[i])) % 1000000007;\n   ans = (ans + 1000000007) % 1000000007;\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1e18;\n const int mod = 1e9 + 7;\n const int N = 100 + 10;\n inline int add(int x, int y) {\n   x += y;\n   if (x >= mod) x -= mod;\n   return x;\n }\n inline int mul(int x, int y) {\n   x = (1LL * x * y) % mod;\n   return x;\n }\n vector<pair<int, int> > G[N];\n int dp[N][N][30][2];\n int f(int i, int j, int last, int turn) {\n   int &ret = dp[i][j][last][turn];\n   if (~ret) return ret;\n   ret = 0;\n   if (turn == 1) {\n     for (auto it : G[i]) {\n       int nxt = it.first;\n       int ed = it.second;\n       if (ed >= last) {\n         int x = f(nxt, j, ed, 0);\n         if (x == 0) return ret = 1;\n       }\n     }\n   } else {\n     for (auto it : G[j]) {\n       int nxt = it.first;\n       int ed = it.second;\n       if (ed >= last) {\n         int x = f(i, nxt, ed, 1);\n         if (x == 0) return ret = 1;\n       }\n     }\n   }\n   return ret;\n }\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   memset(dp, -1, sizeof(dp));\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i <= m - 1; ++i) {\n     int u, v;\n     cin >> u >> v;\n     char c;\n     cin >> c;\n     int x = c - 'a';\n     G[u].push_back({v, x});\n   }\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= n; ++j) {\n       int curr = f(i, j, 0, 1);\n       if (curr == 0)\n         cout << 'B';\n       else\n         cout << 'A';\n     }\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n \n const int N = 1e5 + 5;\n \n struct query {\n 	int i, type, l, r, k, p, x;\n };\n \n int n, m;\n vector<int> a, _a;\n query q[N];\n int queryCnt;\n int block_size;\n int ans[N];\n int freqA[N];\n int freqL[N], freqR[N], freqV[N];\n \n void increaseFreq(int f) {\n 	freqR[f]++, freqL[f - 1]++, freqV[freqR[f] - 1] = f;\n }\n \n void decreaseFreq(int f) {\n 	freqR[f]--, freqL[f - 1]--, freqV[freqR[f]] = f - 1;\n }\n \n void include(int i) {\n 	increaseFreq(++freqA[a[i]]);\n }\n \n void remove(int i) {\n 	decreaseFreq(freqA[a[i]]--);\n }\n \n void go(int& fromL, int& fromR, int toL, int toR) {\n 	// debug() << name(fromL) name(fromR) name(toL) name(toR);\n 	while (fromL > toL) include(--fromL);\n 	while (fromR < toR) include(fromR++);\n 	while (fromL < toL) remove(fromL++);\n 	while (fromR > toR) remove(--fromR);\n }\n \n void update(int qi, int L, int R) {\n 	if (L <= q[qi].p && q[qi].p < R) remove(q[qi].p);\n 	a[q[qi].p] = q[qi].x;\n 	if (L <= q[qi].p && q[qi].p < R) include(q[qi].p);\n }\n \n int answer(int k) {\n 	vector<pair<int, int>> v;\n 	for (int at = freqV[1]; at != 0; ) {\n 		v.push_back({at, freqR[at] - freqL[at]});\n 		at = freqV[freqR[at]];\n 	}\n 	reverse(v.begin(), v.end());\n 	\n 	int ret = -1;\n 	for (int l = 0, r = 0, cnt = 0; l < v.size(); cnt -= v[l++].second) {\n 		r = max(l, r);\n 		while (r < v.size() && cnt < k) cnt += v[r++].second;\n 		if (cnt >= k) {\n 			int _ret = v[r - 1].first - v[l].first;\n 			ret = ret == -1 ? _ret : min(ret, _ret);\n 		}\n 	}\n     // debug() << name(k) name(v) name(ret);\n 	\n 	return ret;\n }\n \n int main() {\n 	scanf('%d %d', &n, &m);\n 	_a.resize(n + 1);\n 	for (int i = 1; i <= n; i++) scanf('%d', &_a[i]); a = _a;\n 	for (int i = 1; i <= m; i++) {\n 		q[i].i = i;\n 		scanf('%d', &q[i].type);\n 		if (q[i].type == 1) scanf('%d %d %d', &q[i].l, &q[i].r, &q[i].k);\n 		else scanf('%d %d', &q[i].p, &q[i].x);\n 		queryCnt += q[i].type == 1;\n 	}\n 	\n 	block_size = ceil(cbrt((long double)2 * n * n));\n 	\n 	sort(q + 1, q + m + 1, [](const query& q1,const query& q2) {\n 		int l1 = (q1.l - 1) / block_size, r1 = (q1.r - 1) / block_size;\n 		int l2 = (q2.l - 1) / block_size, r2 = (q2.r - 1) / block_size;\n 		auto p1 = make_pair(l1, r1);\n 		auto p2 = make_pair(l2, r2);\n 		\n 		if (q1.type == 1) {\n 			if (q2.type == 1) return make_pair(p1, q1.i) < make_pair(p2, q2.i);\n 			else return true;\n 		} else {\n 			if (q2.type == 1) return false;\n 			else return q1.i < q2.i;\n 		}\n 	});\n 	\n 	// for (int i = 1; i <= m; i++) debug() << name(i) name(q[i].type) name(q[i].i);\n 	\n 	fill(ans, ans + N, -2);\n 	fill(freqL, freqL + N, 1);\n 	fill(freqR, freqR + N, 1);\n 	freqR[0] = N;\n 	\n 	pair<int, int> qp = {-1, -1};\n 	int qAt;\n 	int L = 1, R = 1;\n 	for (int i = 1; i <= m && q[i].type == 1; i++) {\n 		int ql = (q[i].l - 1) / block_size, qr = (q[i].r - 1) / block_size;\n 		pair<int, int> _qp = {ql, qr};\n 		if (qp != _qp) {\n 			go(L, R, block_size * ql + 1, block_size * ql + 1);\n 			a = _a;\n 			qAt = queryCnt + 1;\n 			qp = _qp;\n 		}\n 		\n 		while (qAt <= m && q[qAt].i < q[i].i) {\n 			update(qAt, L, R);\n 			qAt++;\n 		}\n 		\n 		go(L, R, q[i].l, q[i].r + 1);\n 		\n 		// debug() << name(q[i].i);\n 		ans[q[i].i] = answer(q[i].k);\n 	}\n 	\n 	for (int i = 1; i <= m; i++) if (ans[i] >= -1) printf('%d\n', ans[i]);\n 	\n 	return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n pair<long long, pair<long long, long long> > stree[4000005];\n char sa[1000005];\n void build(long long node, long long start, long long end) {\n   if (start == end) {\n     stree[node].first = 0;\n     stree[node].second.first = 0;\n     stree[node].second.second = 0;\n     if (sa[start] == '(')\n       stree[node].second.first = 1;\n     else if (sa[start] == ')')\n       stree[node].second.second = 1;\n   } else {\n     long long mid = (start + end) / 2;\n     build(2 * node, start, mid);\n     build(2 * node + 1, mid + 1, end);\n     long long com =\n         min(stree[2 * node].second.first, stree[2 * node + 1].second.second);\n     long long left =\n         stree[2 * node].second.first + stree[2 * node + 1].second.first - com;\n     long long right =\n         stree[2 * node].second.second + stree[2 * node + 1].second.second - com;\n     stree[node].first = stree[2 * node].first + stree[2 * node + 1].first + com;\n     stree[node].second.first = left;\n     stree[node].second.second = right;\n   }\n }\n pair<long long, pair<long long, long long> > query(long long node,\n                                                    long long start,\n                                                    long long end, long long l,\n                                                    long long r) {\n   if (l > end || start > r) return make_pair(0, make_pair(0, 0));\n   if (l <= start && r >= end) return stree[node];\n   long long mid = (start + end) / 2;\n   pair<long long, pair<long long, long long> > p1 =\n       query(2 * node, start, mid, l, r);\n   pair<long long, pair<long long, long long> > p2 =\n       query(2 * node + 1, mid + 1, end, l, r);\n   long long a = min(p1.second.first, p2.second.second);\n   long long b = p1.second.first + p2.second.first - a;\n   long long c = p1.second.second + p2.second.second - a;\n   return make_pair(p1.first + p2.first + a, make_pair(b, c));\n }\n int main() {\n   string str;\n   cin >> str;\n   long long n, q;\n   n = str.length();\n   cin >> q;\n   for (long long i = 1; i <= n; i++) sa[i] = str[i - 1];\n   build(1, 1, n);\n   while (q-- != 0) {\n     long long x, y;\n     cin >> x >> y;\n     long long ans = 2 * query(1, 1, n, x, y).first;\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s, t, ss, tt;\n   int bc;\n   vector<int> res;\n   cin >> bc >> s >> t;\n   ss = s;\n   tt = t;\n   sort(ss.begin(), ss.end());\n   sort(tt.begin(), tt.end());\n   if (ss != tt) {\n     cout << -1;\n     return 0;\n   }\n   if (!is_permutation(s.begin(), s.end(), t.begin())) return cout << -1, 0;\n   for (int i = 0; i < t.size(); ++i) {\n     for (int j = i; j < s.size(); ++j)\n       if (t[t.size() - i - 1] == s[j]) {\n         res.insert(res.end(), {(int)s.size(), j, 1});\n         reverse(s.begin() + j, s.end());\n         rotate(s.begin(), s.begin() + s.size() - 1, s.end());\n         break;\n       }\n   }\n   cout << res.size() << '\n';\n   for (int i = 0; i < res.size(); i++) {\n     cout << res[i] << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n typename T::value_type arr_sum(const T& v, int n) {\n   typename T::value_type sum = 0;\n   for (int i = 0; i < n; ++i) sum += v[i];\n   return sum;\n }\n struct Sync_stdio {\n   Sync_stdio() {\n     cin.tie(NULL);\n     ios_base::sync_with_stdio(false);\n   }\n } _sync_stdio;\n int n, m;\n vector<string> w(n);\n void print_square(int x1, int x2, int y1, int y2) {\n   for (int i = x1; i < x2 + 1; ++i) {\n     if (w[i][y1] != 'w') {\n       w[i][y1] = '+';\n     }\n     if (w[i][y2] != 'w') {\n       w[i][y2] = '+';\n     }\n   }\n   for (int i = y1; i < y2 + 1; ++i) {\n     if (w[x1][i] != 'w') {\n       w[x1][i] = '+';\n     }\n     if (w[x2][i] != 'w') {\n       w[x2][i] = '+';\n     }\n   }\n   for (auto i : w) {\n     cout << i << '\n';\n   }\n   exit(0);\n }\n void check1(vector<pair<int, int> >& v) {\n   int max1 = -1, min1 = 100001;\n   int max2 = -1, min2 = 100001;\n   for (int i = 0; i < v.size(); ++i) {\n     max1 = max(max1, v[i].first);\n     min1 = min(min1, v[i].first);\n     max2 = max(max2, v[i].second);\n     min2 = min(min2, v[i].second);\n   }\n   int left = 0, up = 0, right = 0, down = 0;\n   for (int i = 0; i < v.size(); ++i) {\n     if (v[i].first == min1 && min2 < v[i].second && v[i].second < max2) {\n       up = 1;\n     }\n     if (v[i].first == max1 && min2 < v[i].second && v[i].second < max2) {\n       down = 1;\n     }\n     if (v[i].second == min2 && min1 < v[i].first && v[i].first < max1) {\n       left = 1;\n     }\n     if (v[i].second == max2 && min1 < v[i].first && v[i].first < max1) {\n       right = 1;\n     }\n     if (min1 < v[i].first && v[i].first < max1 && min2 < v[i].second &&\n         v[i].second < max2) {\n       cout << -1;\n       exit(0);\n     }\n   }\n   if (max1 == min1) {\n     up = 0;\n     down = 0;\n   }\n   if (min2 == max2) {\n     left = 0;\n     right = 0;\n   }\n   if (max1 - min1 == max2 - min2) {\n     print_square(min1, max1, min2, max2);\n   }\n   if (up && down && left && right) {\n     cout << -1;\n     exit(0);\n   }\n   int diff = (max1 - min1) - (max2 - min2);\n   if (diff > 0) {\n     if (!left && max2 + (min1 - max1) >= 0) {\n       print_square(min1, max1, max2 + (min1 - max1), max2);\n     }\n     if (!right && min2 + (max1 - min1) < m) {\n       print_square(min1, max1, min2, min2 + (max1 - min1));\n     }\n     if (!left && !right && max1 - min1 < m) {\n       print_square(min1, max1, 0, max1 - min1);\n     }\n   }\n   if (diff < 0) {\n     if (!up && max1 + (min2 - max2) >= 0) {\n       print_square(max1 + (min2 - max2), max1, min2, max2);\n     }\n     if (!down && min1 + (max2 - min2) < n) {\n       print_square(min1, min1 + (max2 - min2), min2, max2);\n     }\n     if (!up && !down && max2 - min2 < n) {\n       print_square(0, max2 - min2, min2, max2);\n     }\n   }\n   cout << -1;\n   exit(0);\n }\n int main() {\n   cin >> n >> m;\n   vector<pair<int, int> > v;\n   for (int i = 0; i < n; ++i) {\n     string t;\n     cin >> t;\n     w.push_back(t);\n     for (int j = 0; j < m; ++j) {\n       if (t[j] == 'w') {\n         v.push_back({i, j});\n       }\n     }\n   }\n   check1(v);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int q;\n   cin >> q;\n   while (q--) {\n     ll a, b, m;\n     cin >> a >> b >> m;\n     if (a == b) {\n       cout << 1 << ' ' << a << '\n';\n       continue;\n     }\n     bool f = false;\n     for (int k = 1; k <= 49 && (1ll << (k - 1)) <= b / a; k++) {\n       ll t = (1ll << (k - 1)) * a;\n       ll b_tmp = b - t;\n       vector<ll> rs(k + 1);\n       rs[0] = a;\n       for (int cur = 1; cur <= k; cur++) {\n         ll pw = (cur == k) ? 1 : (1ll << (k - cur - 1));\n         rs[cur] = 1;\n         b_tmp -= pw * rs[cur];\n       }\n       if (b_tmp < 0) {\n         continue;\n       }\n       for (int cur = 1; cur <= k; cur++) {\n         ll pw = (cur == k) ? 1 : (1ll << (k - cur - 1));\n         ll now = min(m - 1, b_tmp / pw);\n         b_tmp -= pw * now;\n         rs[cur] += now;\n       }\n       if (b_tmp == 0) {\n         f = true;\n         cout << k + 1 << ' ';\n         vector<ll> ans;\n         for (int i = 0; i <= k; i++) {\n           ll cur = rs[i];\n           for (int j = i - 1; j >= 0; j--) {\n             cur += ans[j];\n           }\n           ans.push_back(cur);\n           cout << cur << ' ';\n         }\n         cout << '\n';\n         break;\n       }\n     }\n     if (!f) cout << -1 << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool check(string s) {\n   string t = s;\n   reverse(t.begin(), t.end());\n   return (s == t);\n }\n int main() {\n   string s;\n   cin >> s;\n   int l = 0, r = ((int)s.length()) - 1;\n   set<char> all;\n   while (l < r) {\n     all.insert(s[l]);\n     all.insert(s[r]);\n     l++;\n     r--;\n   }\n   if (all.size() <= 1) {\n     cout << 'Impossible' << endl;\n     return 0;\n   }\n   for (int i = 0; i < ((int)s.length()) - 1; i++) {\n     string fi = '', se = '';\n     for (int j = 0; j <= i; j++) fi += s[j];\n     for (int j = i + 1; j < (int)s.length(); j++) se += s[j];\n     if (check(se + fi) && (se + fi != s)) {\n       cout << 1 << endl;\n       return 0;\n     }\n   }\n   cout << 2 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline T MAX(T a, T b) {\n   if (a > b) return a;\n   return b;\n }\n template <class T>\n inline T MIN(T a, T b) {\n   if (a < b) return a;\n   return b;\n }\n template <class T>\n inline T ABS(T x) {\n   if (x < 0) return -x;\n   return x;\n }\n inline void OPEN(const string &s) {\n   freopen((s + '.in').c_str(), 'r', stdin);\n   freopen((s + '.out').c_str(), 'w', stdout);\n }\n const static int inf = 1000000000;\n int n, m, x, y, z, p;\n int a, b;\n vector<pair<int, int> > cek;\n void rotate90(int &a, int &b, int &r, int &c) {\n   int tempa = a;\n   int tempb = b;\n   a = tempb;\n   b = r - tempa + 1;\n   swap(r, c);\n }\n void flipH(int &a, int &b, int &r, int &c) { b = c - b + 1; }\n void rotate(int &a, int &b, int &r, int &c) {\n   int tempa = a;\n   int tempb = b;\n   a = c - tempb + 1;\n   b = tempa;\n   swap(r, c);\n }\n int main() {\n   scanf('%d%d%d%d%d%d', &n, &m, &x, &y, &z, &p);\n   for (int(i) = (0); (i) < (p); ++(i)) {\n     scanf('%d%d', &a, &b);\n     cek.push_back(make_pair(a, b));\n   }\n   x %= 4;\n   z %= 4;\n   y %= 2;\n   for (int(i) = (0); (i) < (cek.size()); ++(i)) {\n     a = cek[i].first;\n     b = cek[i].second;\n     int r = n, c = m;\n     for (int(j) = (0); (j) < (x); ++(j)) rotate90(a, b, r, c);\n     for (int(j) = (0); (j) < (y); ++(j)) flipH(a, b, r, c);\n     for (int(j) = (0); (j) < (z); ++(j)) rotate(a, b, r, c);\n     printf('%d %d\n', a, b);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int dx[] = {0, -1, 0, 1, -1, -1, 1, 1};\n const int dy[] = {1, 0, -1, 0, 1, -1, 1, -1};\n int n, pre = 0;\n int a[1005], b[1005], p[1005];\n vector<int> num;\n bool vis[1005];\n bool valid() {\n   int na = 0;\n   set<int> st;\n   for (int j = 0; j < n; ++j) {\n     if (a[j] == p[j]) ++na;\n     st.insert(p[j]);\n   }\n   return ((st.size()) == n && na == n - 1);\n }\n int main() {\n   int v;\n   scanf('%d', &n);\n   for (int i = 0; i < n; ++i) scanf('%d', &a[i]);\n   for (int i = 0; i < n; ++i) {\n     scanf('%d', &b[i]);\n     p[i] = b[i];\n     if (vis[p[i]]) v = p[i];\n     vis[p[i]] = 1;\n   }\n   vis[v] = 0;\n   for (int i = 0; i < n; ++i)\n     if (b[i] == v) num.push_back(i);\n   int tmp1 = p[num[0]], tmp2 = p[num[1]];\n   for (int j = 1; j <= n; ++j) {\n     if (!vis[j]) {\n       vis[j] = 1;\n       p[num[0]] = j;\n       for (int k = 1; k <= n; ++k) {\n         if (!vis[k]) {\n           vis[k] = 1;\n           p[num[1]] = k;\n           break;\n         }\n       }\n       if (valid())\n         break;\n       else {\n         vis[p[num[0]]] = vis[p[num[1]]] = 0;\n         p[num[0]] = tmp1;\n         p[num[1]] = tmp2;\n       }\n     }\n   }\n   for (int i = 0; i < n; ++i) printf('%d ', p[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   string s;\n   cin >> s;\n   if (n % 2 == 0) {\n     for (int i = 0; i < n - 2; i++) {\n       cout << s[i];\n       if (i % 2) {\n         cout << '-';\n       }\n     }\n     cout << s[n - 2] << s[n - 1];\n   }\n   if (n % 2) {\n     for (int i = 0; i < n - 3; i++) {\n       cout << s[i];\n       if (i % 2) {\n         cout << '-';\n       }\n     }\n     cout << s[n - 3] << s[n - 2] << s[n - 1];\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int C[100005], D[505][505], L[100005], R[100005], Par[100005];\n int N, K, M;\n using namespace std;\n int find(int n) {\n   if (Par[n] == n)\n     return n;\n   else\n     return Par[n] = find(Par[n]);\n }\n void join(int a, int b) { Par[find(a)] = find(b); }\n int main() {\n   cin >> N >> M >> K;\n   for (int i = 1; i <= K; i++) {\n     int x;\n     cin >> x;\n     L[i] = R[i - 1] + 1;\n     R[i] = L[i] + x - 1;\n     for (int p = L[i]; p <= R[i]; p++) C[p] = i;\n   }\n   for (int i = 1; i <= N; i++) Par[i] = i;\n   for (int i = 1; i <= K; i++) {\n     for (int j = 1; j <= K; j++) D[i][j] = 1000000005;\n     D[i][i] = 0;\n   }\n   while (M--) {\n     int a, b, d;\n     cin >> a >> b >> d;\n     if (d == 0) join(a, b);\n     D[C[a]][C[b]] = min(D[C[a]][C[b]], d);\n     D[C[b]][C[a]] = min(D[C[b]][C[a]], d);\n   }\n   for (int i = 1; i <= K; i++)\n     for (int p = L[i]; p <= R[i]; p++)\n       if (find(p) != find(L[i])) {\n         cout << 'No';\n         return 0;\n       }\n   for (int k = 1; k <= K; k++)\n     for (int i = 1; i <= K; i++)\n       for (int j = 1; j <= K; j++) D[i][j] = min(D[i][j], D[i][k] + D[k][j]);\n   cout << 'Yes\n';\n   for (int i = 1; i <= K; i++) {\n     for (int j = 1; j <= K; j++) {\n       if (D[i][j] < 1000000005)\n         cout << D[i][j] << ' ';\n       else\n         cout << '-1 ';\n     }\n     cout << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n vector<int> g[100001], vc;\n int judge(int x) {\n   vc.clear();\n   int need = x - g[0].size(), ans = 0;\n   for (int i = 1; i < 100001; i++) {\n     for (int j = 0; j < g[i].size(); j++) {\n       if (g[i].size() - j >= x) {\n         need--;\n         ans += g[i][j];\n       } else\n         vc.push_back(g[i][j]);\n     }\n   }\n   sort(vc.begin(), vc.end());\n   for (int i = 0; i < need; i++) ans += vc[i];\n   return ans;\n }\n int main() {\n   scanf('%d', &n);\n   int a, b;\n   for (int i = 0; i < n; i++) {\n     scanf('%d%d', &a, &b);\n     g[a].push_back(b);\n   }\n   for (int i = 1; i < 100001; i++) {\n     sort(g[i].begin(), g[i].end());\n   }\n   int l = g[0].size(), r = n;\n   while (l < r) {\n     int mid = (l + l + r) / 3, mmid = (l + r + r) / 3;\n     if (judge(mid) > judge(mmid)) {\n       if (l == mid)\n         break;\n       else\n         l = mid;\n     } else {\n       if (r == mmid)\n         break;\n       else\n         r = mmid;\n     }\n   }\n   int ans = 0x3f3f3f3f;\n   for (int i = l; i <= r; i++) ans = min(ans, judge(i));\n   printf('%d\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, x, y, z;\n   int sum1 = 0, sum2 = 0, sum3 = 0;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> x >> y >> z;\n     sum1 += x;\n     sum2 += y;\n     sum3 += z;\n   }\n   if ((sum1 == 0) && (sum2 == 0) && (sum3 == 0)) {\n     cout << 'YES' << endl;\n   } else {\n     cout << 'NO' << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int i, j, n;\n void solve() {\n   int n;\n   long long l;\n   cin >> n >> l;\n   long long a[n];\n   for (i = 0; i < n; i++) cin >> a[i];\n   ;\n   sort(a, a + n);\n   long long m = 2 * max(a[0], l - a[n - 1]);\n   for (i = 0; i < n - 1; i++) {\n     m = max(m, a[i + 1] - a[i]);\n   }\n   long double d = 1.0 * m / 2;\n   cout << setprecision(9) << d;\n }\n int main() {\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 100005;\n const int maxd = 205;\n struct Node {\n   int l, d;\n } leg[maxn];\n bool operator<(const Node &a, const Node &b) { return a.l > b.l; }\n int n, tot[maxd], td = 0, md = 0;\n int Solve(int st, int ed) {\n   int cnt = ed - st;\n   int res = td;\n   for (int i = md; i >= 0 && cnt > 0; i--) {\n     res -= min(cnt, tot[i]) * i;\n     cnt -= min(cnt, tot[i]);\n   }\n   return res;\n }\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> leg[i].l;\n   for (int i = 0; i < n; i++) cin >> leg[i].d;\n   for (int i = 0; i < n; i++) md = max(md, leg[i].d);\n   sort(leg, leg + n);\n   for (int i = 0; i < n; i++) {\n     tot[leg[i].d]++;\n     td += leg[i].d;\n   }\n   int p = 0;\n   int res = INT_MAX, tot_d = 0;\n   while (p < n) {\n     int p1 = p + 1;\n     while (p1 < n && leg[p1].l == leg[p].l) p1++;\n     p1--;\n     for (int i = p; i <= p1; i++) {\n       tot[leg[i].d]--;\n       td -= leg[i].d;\n     }\n     int tmp = tot_d + Solve(p, p1);\n     res = min(tmp, res);\n     for (int i = p; i <= p1; i++) tot_d += leg[i].d;\n     p = p1 + 1;\n   }\n   cout << res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long read() {\n   register long long x = 0, f = 1;\n   char ch = getchar();\n   while (!isdigit(ch)) {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (isdigit(ch)) {\n     x = (x << 1) + (x << 3) + (ch ^ 48);\n     ch = getchar();\n   }\n   return x * f;\n }\n const long long N = 1e5 + 10;\n long long n, m, k, p;\n long long h[N], a[N];\n long long c[N];\n struct node {\n   long long t, id;\n   bool operator<(const node& x) const { return t > x.t; }\n };\n priority_queue<node> q;\n bool check(long long x) {\n   while (!q.empty()) q.pop();\n   memset(c, 0, sizeof c);\n   for (long long i = 1; i <= n; i++)\n     if (x - a[i] * m < h[i]) q.push((node){x / a[i], i});\n   for (long long i = 1; !q.empty() && i <= m; i++)\n     for (long long j = 1; !q.empty() && j <= k; j++) {\n       node u = q.top();\n       q.pop();\n       if (u.t < i) return 0;\n       ++c[u.id];\n       if (x + c[u.id] * p - a[u.id] * m < h[u.id])\n         q.push((node){(x + c[u.id] * p) / a[u.id], u.id});\n     }\n   return q.empty();\n }\n signed main() {\n   n = read(), m = read(), k = read(), p = read();\n   for (long long i = 1; i <= n; i++) h[i] = read(), a[i] = read();\n   long long l = 0, r = 1e15, ans;\n   while (l <= r) {\n     long long mid = l + r >> 1;\n     if (check(mid))\n       ans = mid, r = mid - 1;\n     else\n       l = mid + 1;\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct data {\n   int idx, val;\n   bool operator<(const data &a1) const {\n     if (a1.val == val) {\n       return a1.idx < idx;\n     }\n     return val > a1.val;\n   }\n   data(int t, int w) : idx(t), val(w) {}\n };\n set<data> coastline;\n set<data>::iterator it, it2;\n int main() {\n   int N;\n   scanf('%d', &N);\n   string ans[N];\n   int a;\n   for (int i = 0; i < N; i++) {\n     scanf('%d', &a);\n     if (a == 0) {\n       int sz = coastline.size();\n       if (sz == 0) {\n         ans[i] = '0';\n       } else if (sz == 1) {\n         ans[i] = '1 popStack';\n         it = coastline.begin();\n         ans[it->idx] = 'pushStack';\n       } else if (sz == 2) {\n         ans[i] = '2 popStack popQueue';\n         it = coastline.begin();\n         ans[it->idx] = 'pushQueue';\n         it++;\n         ans[it->idx] = 'pushStack';\n         it++;\n       } else {\n         ans[i] = '3 popStack popQueue popFront';\n         it = coastline.begin();\n         ans[it->idx] = 'pushFront';\n         it++;\n         ans[it->idx] = 'pushQueue';\n         it++;\n         ans[it->idx] = 'pushStack';\n         it++;\n       }\n       coastline.clear();\n     } else {\n       coastline.insert(data(i, a));\n     }\n   }\n   for (int i = 0; i < N; i++) {\n     if (ans[i].size() == 0) {\n       cout << 'pushBack' << endl;\n     } else\n       cout << ans[i] << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #define ll long long\n #define mod 1000000007\n using namespace std;\n \n ll dp[10][200001];\n string s = 'abcdefghijklmnopqrstuvwxyz';\n ll findgcd(ll a, ll b) {\n     if (b == 0) {\n         return a;\n     }\n     return findgcd(b, a % b);\n }\n \n bool ispalindrome(string s) {\n     int n = s.length();\n     bool flag = true;\n     for (int i = 0; i < n / 2; i++) {\n         if (s[i] != s[n - 1 - i]) {\n             flag = false;\n             break;\n         }\n     }\n     return flag;\n }\n \n ll factorial(ll n) {\n     vector<ll> v(n + 1);\n     for (ll i = 0; i <= n; i++) {\n         if (i == 0 || i == 1) {\n             v[i] = 1;\n         }\n         else {\n             v[i] = (i * v[i - 1]) % mod;\n         }\n     }\n     return v[n];\n }\n \n void calculatedp() {\n     for (ll i = 0; i <= 9; i++) {\n         ll temp = 10 - i;\n         for (ll j = 0; j <= 200000; j++) {\n             if (j < temp) {\n                 dp[i][j] = 1;\n             }\n             else if (j == temp) {\n                 dp[i][j] = 2;\n             }\n             else {\n                 break;\n             }\n         }\n     }\n     dp[1][10] = 2;\n     for (ll i = 11; i <= 200000; i++) {\n         int temp1 = i - 10;\n         int temp2 = i - 9;\n         dp[0][i] = (dp[0][temp1] + dp[1][temp1]) % mod;\n         dp[1][i] = (dp[0][temp2] + dp[1][temp2]) % mod;\n     }\n     for (ll i = 2; i <= 9; i++) {\n         ll temp = 10 - i;\n         for (ll j = temp + 1; j <= 200000; j++) {\n             dp[i][j] = (dp[0][j - temp] + dp[1][j - temp]) % mod;\n         }\n     }\n }\n \n void solve() {\n     // ll m;\n     // cin >> s;\n     // cin >> m;\n     // ll ans = 0;\n     // for (int i = 0; i < s.length(); i++) {\n     //     ans = (ans + (dp[s[i] - '0'][m])) % mod;\n     // }\n     // cout << ans << '\n';\n     int n, k;\n     cin >> n >> k;\n \n     string ans = '';\n \n     for (int i = 0 ; i < k ; i++) {\n         ans += s[i];\n         for (int j = i + 1 ; j < k ; j++) {\n             ans += s[i];\n             ans += s[j];\n         }\n     }\n \n     if (n < ans.size()) {\n         cout << ans.substr(0, n) << endl;\n     }\n     else {\n         int j = ans.length();\n         int i = 0;\n         while (j < n) {\n             ans += ans[i];\n             i++;\n             j++;\n         }\n \n         cout << ans << endl;\n     }\n }\n int main() {\n #ifndef ONLINE_JUDGE\n     //for getting input from input.txt\n     freopen('input.txt', 'r', stdin);\n     //for writing output to output.txt\n     freopen('output.txt', 'w', stdout);\n #endif\n     ios_base::sync_with_stdio(0);\n     cin.tie(0);\n     cout.tie(0);\n     // calculatedp();\n     // for (int i = 0; i <= 10; i++) {\n     //     for (int j = 0; j <= 10; j++) {\n     //         cout << dp[i][j] << ' ';\n     //     }\n     //     cout << '\n';\n     // }\n     int t;\n     t = 1;\n     // cin >> t;\n     while (t--) {\n         solve();\n     }\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline int popcount(T t) {\n   if (std::numeric_limits<T>::digits <=\n       std::numeric_limits<unsigned int>::digits) {\n     return __builtin_popcount(t);\n   } else {\n     return __builtin_popcountll(t);\n   }\n }\n const long double EPS = 1e-8;\n const long double PI = acosl(0.0) * 2;\n void solve() {\n   int n;\n   cin >> n;\n   vector<int> a(n);\n   for (int i = 0; i < int(n); ++i) cin >> a[i];\n   for (int i = 30; i >= 0; --i) {\n     vector<int> b;\n     int mask = (1 << i) - 1;\n     for (int x : a) {\n       if ((x >> i) & 1) {\n         b.push_back(x);\n         mask &= x;\n       }\n     }\n     if (!mask) {\n       cout << b.size() << endl;\n       for (int x : b) {\n         cout << x << ' ';\n       }\n       cout << endl;\n       return;\n     }\n   }\n   assert(false);\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n1, n2, n3, n4;\n   long long ans;\n   unordered_map<char, int> m;\n   string s;\n   while (cin >> n1 >> n2 >> n3 >> n4) {\n     ans = 0;\n     m['1'] = n1;\n     m['2'] = n2;\n     m['3'] = n3;\n     m['4'] = n4;\n     cin >> s;\n     for (int i = 0; i < s.size(); i++) {\n       ans += m[s[i]];\n     }\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool cmp(double a, double b) { return a > b; }\n int n;\n double a[110], x, sum, ans;\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) scanf('%lf', &a[i]);\n   sort(a, a + n, cmp);\n   ans = 0;\n   for (int i = 1; i <= n; i++) {\n     sum = 0;\n     for (int j = 0; j < i; j++) {\n       x = a[j];\n       for (int k = 0; k < i; k++) {\n         if (j != k) x *= 1 - a[k];\n       }\n       sum += x;\n     }\n     ans = max(sum, ans);\n   }\n   printf('%.12lf\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int a[200][3];\n int main() {\n   ios ::sync_with_stdio(false);\n   cin.tie(0);\n   ;\n   long long int i, k, l, n, j;\n   cin >> n;\n   for (i = 0; i <= n - 1; i++) cin >> a[i][0] >> a[i][1];\n   cin >> j;\n   for (i = 0; i <= n - 1; i++)\n     if (j >= a[i][0] && j <= a[i][1]) {\n       cout << n - i << endl;\n       return 0;\n     }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int N, K;\n string S;\n int vis[5050][5050];\n vector<pair<int, int>> nex[26];\n void dfs(int cur, int mask) {\n   if (vis[cur][mask] || cur + 1 + mask > N) return;\n   vis[cur][mask] = 1;\n   int i;\n   nex[S[cur] - 'a'].push_back({cur + 1, mask});\n   for (i = 0; i < (K); i++)\n     if (mask & (1 << i)) dfs(cur + (1 << i), mask ^ (1 << i));\n }\n void solve() {\n   int i, j, k, l, r, x, y;\n   string s;\n   cin >> S;\n   N = S.size();\n   while (1 << (K + 1) <= N) K++;\n   vector<pair<int, int>> now;\n   now.push_back({0, (1 << K) - 1});\n   while (now.size()) {\n     for (i = 0; i < (26); i++) nex[i].clear();\n     for (auto& n : now) dfs(n.first, n.second);\n     char c = 'z' + 1;\n     for (i = 25; i >= 0; i--)\n       if (nex[i].size()) c = 'a' + i;\n     if (c == 'z' + 1) break;\n     cout << c;\n     swap(now, nex[c - 'a']);\n   }\n   cout << endl;\n }\n int main(int argc, char** argv) {\n   string s;\n   int i;\n   if (argc == 1) ios::sync_with_stdio(false), cin.tie(0);\n   for (i = 0; i < (argc - 1); i++) s += argv[i + 1], s += '\n';\n   for (i = 0; i < (s.size()); i++) ungetc(s[s.size() - 1 - i], stdin);\n   cout.tie(0);\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n pair<double, double> get_vec_rotate(pair<double, double> nv, double fi) {\n   return make_pair(nv.first * cos(fi) - nv.second * sin(fi),\n                    nv.second * cos(fi) + nv.first * sin(fi));\n }\n pair<double, double> get_normal(pair<double, double> vec) {\n   double len = sqrt(vec.first * vec.first + vec.second * vec.second);\n   vec.first /= len;\n   vec.second /= len;\n   return vec;\n }\n pair<double, double> end_p(pair<double, double> start_p,\n                            pair<double, double> nv, double len) {\n   nv.first *= len;\n   nv.second *= len;\n   return make_pair(nv.first + start_p.first, nv.second + start_p.second);\n }\n double a, b, c, d;\n pair<double, double> p, v, ToWrite;\n pair<double, double> len_fi[7];\n int main() {\n   cin >> p.first >> p.second >> v.first >> v.second >> a >> b >> c >> d;\n   v = get_normal(v);\n   len_fi[0].first = b;\n   len_fi[0].second = 0;\n   len_fi[1].first = a / 2;\n   len_fi[1].second = M_PI / 2;\n   len_fi[2].first = c / 2;\n   len_fi[2].second = M_PI / 2;\n   len_fi[3].first = sqrt(c * c + 4 * d * d) / 2;\n   len_fi[3].second = M_PI / 2 + atan(2 * d / c);\n   len_fi[4].first = sqrt(c * c + 4 * d * d) / 2;\n   len_fi[4].second = 3 * M_PI / 2 - atan(2 * d / c);\n   len_fi[5].first = c / 2;\n   len_fi[5].second = 3 * M_PI / 2;\n   len_fi[6].first = a / 2;\n   len_fi[6].second = 3 * M_PI / 2;\n   cout.precision(10);\n   for (int i = 0; i < 7; i++) {\n     ToWrite = end_p(p, get_vec_rotate(v, len_fi[i].second), len_fi[i].first);\n     cout << fixed << ToWrite.first << ' ' << ToWrite.second << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int T;\n int n, m;\n bool get() {\n   char ch = getchar();\n   while (ch != 'O' && ch != 'X') ch = getchar();\n   return (ch == 'X');\n }\n int map[21][21], con[4001][2], top, cnt[4001], head[401], nxt[100001],\n     b[100001], k = 1, dis[4001], pre[4001];\n char ans[41][41];\n int q[4001], h, t;\n void push(int s, int t) {\n   nxt[++k] = head[s];\n   head[s] = k;\n   b[k] = t;\n }\n bool iscut[4001], chosen[4001], lim[4001], good[4001][4001];\n std::vector<int> vec[4001];\n int Cnt;\n int hash(int i, int j) { return (i - 1) * m + j; }\n void dfs(int x, bool *vis) {\n   if (vis[x]) return;\n   ++Cnt;\n   vis[x] = 1;\n   for (int i = head[x]; i; i = nxt[i])\n     if (!chosen[i >> 1]) dfs(b[i], vis);\n }\n int main() {\n   scanf('%d', &T);\n   for (int fd = 1; fd <= T; fd++) {\n     scanf('%d%d', &n, &m);\n     int all = 0;\n     top = 0;\n     memset(chosen, 0, sizeof chosen);\n     memset(lim, 0, sizeof lim);\n     memset(head, 0, sizeof head);\n     k = 1;\n     for (int i = 1; i <= n; i++)\n       for (int j = 1; j <= m; j++) map[i][j] = get(), all += (!map[i][j]);\n     for (int i = 1; i < n; i++)\n       for (int j = 1; j <= m; j++)\n         if (!map[i][j] && !map[i + 1][j]) {\n           ++top;\n           con[top][0] = hash(i, j);\n           con[top][1] = hash(i + 1, j);\n           push(hash(i, j), hash(i + 1, j));\n           push(hash(i + 1, j), hash(i, j));\n         }\n     for (int i = 1; i <= n; i++)\n       for (int j = 1; j < m; j++)\n         if (!map[i][j] && !map[i][j + 1]) {\n           ++top;\n           con[top][0] = hash(i, j);\n           con[top][1] = hash(i, j + 1);\n           push(hash(i, j), hash(i, j + 1));\n           push(hash(i, j + 1), hash(i, j));\n         }\n     for (int i = 1; i <= n; i++)\n       for (int j = 1; j <= m; j++)\n         if ((i + j) % 2 == 0 && (i > 1 || j > 1)) lim[hash(i, j)] = 1;\n     memset(cnt, 0, sizeof cnt);\n     for (int i = 1; i <= top; i++) {\n       ++cnt[con[i][0]], ++cnt[con[i][1]];\n     }\n     bool cando = 1;\n     for (int i = 1; i <= n; i++)\n       for (int j = 1; j <= m; j++)\n         if (lim[hash(i, j)] && cnt[hash(i, j)] <= 1 && !map[i][j]) {\n           cando = 0;\n         }\n     memset(good[0], 0, sizeof good[0]);\n     Cnt = 0;\n     dfs(1, good[0]);\n     if (Cnt < all) cando = 0;\n     if (!cando)\n       puts('NO');\n     else {\n       for (;;) {\n         memset(cnt, 0, sizeof cnt);\n         for (int i = 1; i <= top; i++)\n           if (!chosen[i]) {\n             if (lim[con[i][0]])\n               ++cnt[con[i][0]];\n             else\n               ++cnt[con[i][1]];\n             Cnt = 0;\n             chosen[i] = 1;\n             memset(good[i], 0, sizeof good[i]);\n             dfs(1, good[i]);\n             iscut[i] = (Cnt < all);\n             chosen[i] = 0;\n           }\n         for (int i = 1; i <= top; i++) vec[i].clear();\n         for (int i = 1; i <= top; i++)\n           if (chosen[i])\n             for (int j = 1; j <= top; j++)\n               if (!chosen[j]) {\n                 int u = (lim[con[i][0]] ? con[i][0] : con[i][1]),\n                     v = (lim[con[j][0]] ? con[j][0] : con[j][1]);\n                 if (u == v || cnt[v] >= 3) {\n                   vec[j].push_back(i);\n                 }\n                 if (!iscut[j] || good[j][con[i][0]] != good[j][con[i][1]]) {\n                   vec[i].push_back(j);\n                 }\n               }\n         h = t = 0;\n         for (int i = 1; i <= top; i++) {\n           dis[i] = 0x7f7f7f7f;\n           pre[i] = 0;\n           if (!chosen[i] && !iscut[i]) dis[i] = 0, q[++t] = i;\n         }\n         while (h < t) {\n           ++h;\n           for (int i = 0; i < vec[q[h]].size(); i++)\n             if (dis[vec[q[h]][i]] == 0x7f7f7f7f) {\n               dis[vec[q[h]][i]] = dis[q[h]] + 1;\n               q[++t] = vec[q[h]][i];\n               pre[vec[q[h]][i]] = q[h];\n             }\n         }\n         int p = 0;\n         for (int i = 1; i <= top; i++) {\n           if (!chosen[i] && (cnt[con[i][0]] >= 3 || !lim[con[i][0]]) &&\n               (cnt[con[i][1]] >= 3 || !lim[con[i][1]]) &&\n               dis[i] != 0x7f7f7f7f) {\n             if (!p || dis[p] > dis[i]) p = i;\n           }\n         }\n         if (!p) break;\n         while (p) {\n           chosen[p] ^= 1;\n           p = pre[p];\n         }\n       }\n       Cnt = 0;\n       for (int i = 1; i <= top; i++) Cnt += (!chosen[i]);\n       if (Cnt != all - 1)\n         puts('NO');\n       else {\n         puts('YES');\n         for (int i = 1; i <= (n << 1); i++)\n           for (int j = 1; j <= (m << 1); j++) ans[i][j] = ' ';\n         for (int i = 1; i <= n; i++)\n           for (int j = 1; j <= m; j++)\n             ans[(i << 1) - 1][(j << 1) - 1] = (map[i][j]) ? 'X' : 'O';\n         for (int i = 1; i <= top; i++)\n           if (!chosen[i]) {\n             int u = con[i][0], v = con[i][1];\n             if (v == u + 1)\n               ans[(((u - 1) / m + 1) << 1) - 1][((u - 1) % m + 1) << 1] = 'O';\n             else\n               ans[(((u - 1) / m + 1) << 1)][(((u - 1) % m + 1) << 1) - 1] = 'O';\n           }\n         for (int i = 1; i < (n << 1); i++, putchar('\n'))\n           for (int j = 1; j < (m << 1); j++) putchar(ans[i][j]);\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct node {\n   int active;\n   set<int> prev, next;\n   node() : active(1) {}\n };\n int main() {\n   int n, k, m, i, j;\n   int a, b;\n   cin >> n >> m;\n   int cnt = 1;\n   set<int> sh;\n   set<int>::iterator it;\n   for (i = 0; i < n; i++) sh.insert(i);\n   node* graf = new node[n];\n   for (i = 0; i < m; i++) {\n     cin >> a >> b;\n     a--, b--;\n     if (graf[a].active == 0) continue;\n     if (graf[b].prev.size() == 0) sh.erase(b);\n     graf[a].next.insert(b);\n     graf[b].prev.insert(a);\n     while (sh.size() == 1) {\n       k = *sh.begin();\n       cnt++;\n       if (cnt == n) {\n         cout << i + 1 << endl;\n         return 0;\n       }\n       for (it = graf[k].next.begin(); it != graf[k].next.end(); it++) {\n         j = *it;\n         graf[j].prev.erase(k);\n         if (graf[j].prev.size() == 0) sh.insert(j);\n       }\n       sh.erase(k);\n       graf[k].active = 0;\n     }\n   }\n   cout << -1 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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<int>::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 <typename T, size_t N>\n int SIZE(const T (&t)[N]) {\n   return N;\n }\n template <typename T>\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 <size_t N>\n string to_string(bitset<N> &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 <typename A, typename... C>\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 <typename A, typename B>\n string to_string(pair<A, B> &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 <typename A, typename... C>\n string to_string(A(&v), int x1, int x2, C... coords) {\n   int rnk = rank<A>::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 <typename Heads, typename... Tails>\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 <bits/stdc++.h>\n using namespace std;\n const int mxN = 2e5 + 10;\n vector<int> 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 <bits/stdc++.h>\n using namespace std;\n const long long inf = 1LL << 28;\n const long long mod = 1LL;\n vector<int> 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 <bits/stdc++.h>\n using namespace std;\n template <class T>\n bool umin(T& a, T b) {\n   if (a > b) {\n     a = b;\n     return 1;\n   }\n   return 0;\n }\n template <class T>\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<long long> bg;\n priority_queue<long long, vector<long long>, greater<long long> > 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 <bits/stdc++.h>\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<long long> 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 <bits/stdc++.h>\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<pair<int, long long>> child[100000];\n map<int, int> 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<long long> 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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/stack:200000000')\n #pragma GCC optimize('Ofast')\n #pragma GCC optimize('unroll-loops')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native')\n using namespace std;\n const long long inf = numeric_limits<long long>::max() / 2;\n const long double eps = 1e-9;\n const long double pi = acos(-1);\n template <typename T>\n inline bool mineq(T& a, T b) {\n   return (a > b) ? (a = b, 1) : 0;\n }\n template <typename T>\n inline bool maxeq(T& a, T b) {\n   return (a < b) ? (a = b, 1) : 0;\n }\n inline void solve(), read();\n const string file = '';\n int main() {\n   if (file != '') {\n     freopen((file + '.in').c_str(), 'r', stdin);\n     freopen((file + '.out').c_str(), 'w', stdout);\n   }\n   ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n   ;\n   read();\n   solve();\n   return 0;\n }\n long long n;\n vector<long long> a;\n vector<pair<long long, long long> > b;\n inline void solve() {\n   for (long long i = 0; i < n; i++) {\n     if (i && a[i] == a[i - 1]) {\n       ++b.back().second;\n     } else if (i == 0 || a[i] == a[i - 1] + 1) {\n       b.push_back({a[i], 1});\n     } else {\n       cout << 'NO'\n            << '\n';\n       return;\n     }\n   }\n   for (long long i = 0; i < (long long)((b).size()) - 2; i++) {\n     b[i + 1].second -= b[i].second;\n     if (b[i + 1].second <= 0) {\n       cout << 'NO'\n            << '\n';\n       return;\n     }\n   }\n   if (b[(long long)((b).size()) - 1].second !=\n       b[(long long)((b).size()) - 2].second) {\n     cout << 'NO'\n          << '\n';\n     return;\n   }\n   cout << 'YES'\n        << '\n';\n }\n inline void read() {\n   cin >> n;\n   a.resize(n);\n   for (long long i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   sort((a).begin(), (a).end());\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long base = 31, M = 1000000007, base1 = 29, M1 = 1000000009;\n long long fpow(long long x, long long y) {\n   if (y == 0) return 1;\n   if (y == 1) return x;\n   long long p = fpow(x, y / 2) % M;\n   p *= p;\n   p %= M;\n   if (y & 1) p *= x;\n   return p % M;\n }\n long long po1[5005], pr[5005], po[5005], pr1[5005], suf[5005], suf1[5005];\n int ans[5005][5005], dp[5005][5005];\n pair<long long, long long> gethash(int i, int j) {\n   long long has = pr[j];\n   if (i != 0) has -= (pr[i - 1] * po[j - i + 1]) % M;\n   has += M;\n   has %= M;\n   long long has1 = pr1[j];\n   if (i != 0) has1 -= (pr1[i - 1] * po1[j - i + 1]) % M1;\n   has1 += M1;\n   has1 %= M1;\n   return {has, has1};\n }\n pair<long long, long long> gethash1(int i, int j) {\n   long long has = suf[j];\n   if (i != 0) has -= (suf[i - 1] * po[j - i + 1]) % M;\n   has += M;\n   has %= M;\n   long long has1 = suf1[j];\n   if (i != 0) has1 -= (suf1[i - 1] * po1[j - i + 1]) % M1;\n   has1 += M1;\n   has1 %= M1;\n   return {has, has1};\n }\n int main() {\n   po[0] = 1;\n   po1[0] = 1;\n   for (int i = 1; i <= 5001; i++) {\n     po[i] = po[i - 1] * base;\n     po1[i] = po1[i - 1] * base1;\n     po[i] %= M;\n     po1[i] %= M1;\n   }\n   string s, t;\n   char c[100005];\n   scanf('%s', &c);\n   s = c;\n   int n = s.size();\n   t = s;\n   reverse(t.begin(), t.end());\n   int q;\n   scanf('%d', &q);\n   pr[0] = s[0] - 'a' + 1;\n   pr1[0] = s[0] - 'a' + 1;\n   suf[0] = t[0] - 'a' + 1;\n   suf1[0] = t[0] - 'a' + 1;\n   for (int i = 1; i < s.size(); i++) {\n     long long x = s[i] - 'a' + 1;\n     long long y = t[i] - 'a' + 1;\n     pr[i] = (pr[i - 1] * base + x) % M;\n     pr1[i] = (pr1[i - 1] * base1 + x) % M1;\n     suf[i] = (suf[i - 1] * base + y) % M;\n     suf1[i] = (suf1[i - 1] * base1 + y) % M1;\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = i; j < n; j++) {\n       pair<long long, long long> o = gethash(i, j);\n       pair<long long, long long> os = gethash1(n - 1 - j, n - 1 - i);\n       if (o.first == os.first && o.second == os.second) ans[i][j]++;\n       if (j != i) ans[i][j] += ans[i][j - 1];\n     }\n   }\n   for (int i = n - 1; i >= 0; i--) {\n     for (int j = i; j >= 0; j--) {\n       dp[j][i] = dp[j + 1][i] + ans[j][i];\n     }\n   }\n   int l, r;\n   while (q--) {\n     scanf('%d%d', &l, &r);\n     l--;\n     r--;\n     printf('%d\n', dp[l][r]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = (int)3e5 + 50;\n struct node {\n   int sum, suf;\n   void add(int val) {\n     sum += val;\n     suf = max(sum, 0);\n   }\n };\n node merge(node L, node R) {\n   return {L.sum + R.sum, max(R.sum + L.suf, R.suf)};\n }\n struct Tree {\n   node dat[4 * N];\n   void init(int n) { fill(dat, dat + 4 * n, node{0, 0}); }\n   void update(int pos, int x, int l, int r, int val) {\n     if (l == r) {\n       dat[x].add(val);\n       return;\n     }\n     int mid = (l + r) / 2;\n     if (pos <= mid)\n       update(pos, 2 * x + 1, l, mid, val);\n     else\n       update(pos, 2 * x + 2, mid + 1, r, val);\n     dat[x] = merge(dat[2 * x + 1], dat[2 * x + 2]);\n   }\n } tree;\n int n;\n int loc[N];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   cin >> n;\n   tree.init(n);\n   for (int i = 0; i < n; i++) {\n     int x;\n     cin >> x;\n     x--;\n     loc[x] = i;\n   }\n   int cur = n - 1;\n   for (int i = 0; i < n; i++) {\n     while (cur >= 0 && tree.dat[0].suf == 0) {\n       tree.update(loc[cur--], 0, 0, n - 1, 1);\n     }\n     cout << cur + 2 << ' ';\n     int q;\n     cin >> q;\n     q--;\n     tree.update(q, 0, 0, n - 1, -1);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long max(long long a, long long b) {\n   if (a > b)\n     return a;\n   else\n     return b;\n }\n long long min(long long a, long long b) {\n   if (a < b)\n     return a;\n   else\n     return b;\n }\n int32_t main() {\n   ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);\n   long long n;\n   cin >> n;\n   string s = '';\n   long long i = 0;\n   while (i < n) {\n     if (i < n) {\n       s += 'a';\n       i++;\n     }\n     if (i < n) {\n       s += 'a';\n       i++;\n     }\n     if (i < n) {\n       s += 'b';\n       i++;\n     }\n     if (i < n) {\n       s += 'b';\n       i++;\n     }\n   }\n   cout << s << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 105;\n int n, m, a[maxn][maxn];\n int sumr[maxn], sumc[maxn];\n bool ar[maxn], ac[maxn];\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n >> m;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++) cin >> a[i][j];\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) sumr[i] += a[i][j];\n   }\n   for (int j = 0; j < m; j++) {\n     for (int i = 0; i < n; i++) sumc[j] += a[i][j];\n   }\n   while (1) {\n     bool b = 0;\n     for (int i = 0; i < n; i++)\n       if (sumr[i] < 0) {\n         b = 1;\n         ar[i] ^= 1;\n         for (int j = 0; j < m; j++) sumc[j] -= 2 * a[i][j], a[i][j] = -a[i][j];\n         sumr[i] *= -1;\n       }\n     for (int j = 0; j < m; j++)\n       if (sumc[j] < 0) {\n         b = 1;\n         ac[j] ^= 1;\n         for (int i = 0; i < n; i++) sumr[i] -= 2 * a[i][j], a[i][j] = -a[i][j];\n         sumc[j] *= -1;\n       }\n     if (!b) break;\n   }\n   vector<int> vr, vc;\n   for (int i = 0; i < n; i++)\n     if (ar[i]) vr.push_back(i);\n   for (int i = 0; i < m; i++)\n     if (ac[i]) vc.push_back(i);\n   cout << vr.size() << ' ';\n   for (int i : vr) cout << i + 1 << ' ';\n   cout << '\n';\n   cout << vc.size() << ' ';\n   for (int i : vc) cout << i + 1 << ' ';\n   cout << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int x1, y1;\n   cin >> x1 >> y1;\n   int x2, y2;\n   cin >> x2 >> y2;\n   int ans = 0x3f3f3f3f;\n   for (int i = -1; i <= 1; i++) {\n     for (int j = -1; j <= 1; j++) {\n       if (i == 0 && j == 0) {\n         continue;\n       }\n       ans = min(ans, abs(x1 - (x2 + i)) + abs(y1 - (y2 + j)));\n     }\n   }\n   cout << 2 * ans + 8;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n, m, a, b, t;\n   while (scanf('%d%d%d%d', &n, &m, &a, &b) != EOF) {\n     if (b == n) b = (n - 1) / m * m + m;\n     a--;\n     b--;\n     if (a > b)\n       while (1)\n         ;\n     if (a / m == b / m || m == 1)\n       t = 1;\n     else if (a % m == 0) {\n       if (b % m == m - 1)\n         t = 1;\n       else\n         t = 2;\n     } else {\n       if (b / m - a / m == 1)\n         t = 2;\n       else if (b % m == m - 1)\n         t = 2;\n       else if ((b - a + 1) % m == 0)\n         t = 2;\n       else\n         t = 3;\n     }\n     printf('%d\n', t);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int a[1000][7], i, j, m = 0, n;\n   string ar;\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> ar;\n     for (j = 0; j < 7; j++) {\n       a[i][j] = ar[j] - 48;\n     }\n   }\n   for (j = 0; j < 7; j++) {\n     long long int l = 0;\n     for (i = 0; i < n; i++) {\n       if (a[i][j] == 1) {\n         l++;\n       }\n     }\n     if (l > m) {\n       m = l;\n     }\n   }\n   cout << m << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int Set(int N, int pos) { return N |= (1LL << pos); }\n int Reset(int N, int pos) { return N &= ~(1LL << pos); }\n bool Check(int N, int pos) { return N & (1LL << pos); }\n int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}, dy[] = {1, -1, 0, 0, 1, -1, -1, 1};\n template <class T>\n void cmin(T &a, T b) {\n   if (b < a) a = b;\n }\n template <class T>\n void cmax(T &a, T b) {\n   if (b > a) a = b;\n }\n template <class T>\n int len(const T &c) {\n   return (int)c.size();\n }\n template <class T>\n int len(char c[]) {\n   return (int)strlen(c);\n }\n string itos(long n) {\n   string s;\n   while (n) {\n     s += (n % 10 + 48);\n     n /= 10;\n   }\n   reverse(s.begin(), s.end());\n   return s;\n }\n long stoi(string s) {\n   long n = 0;\n   for (int i(0), _n(len(s)); i < _n; ++i) n = n * 10 + (s[i] - 48);\n   return n;\n }\n long long n, ar[200005], arr[200005], m, a, p, b, aa, bb, mx = 0;\n pair<int, int> fun(long d) {\n   p = upper_bound(ar, ar + n, d) - ar;\n   a = (p * 2 + (n - p) * 3);\n   p = upper_bound(arr, arr + m, d) - arr;\n   b = (p * 2 + (m - p) * 3);\n   return make_pair(a, b);\n }\n int main() {\n   mx = -100000000000000000LL;\n   cin >> n;\n   for (int i(0), _n(n); i < _n; ++i) cin >> ar[i];\n   cin >> m;\n   for (int i(0), _n(m); i < _n; ++i) cin >> arr[i];\n   sort(ar, ar + n);\n   sort(arr, arr + m);\n   aa = n * 3;\n   bb = m * 3;\n   mx = aa - bb;\n   pair<int, int> pr;\n   pr = fun(ar[0] - 1);\n   a = pr.first;\n   b = pr.second;\n   if (a - b > mx) {\n     mx = a - b;\n     aa = a;\n     bb = b;\n   } else if (a - b == mx && a > aa) {\n     aa = a;\n     bb = b;\n   }\n   for (int i(0), _n(n); i < _n; ++i) {\n     pr = fun(ar[i]);\n     a = pr.first;\n     b = pr.second;\n     if (a - b > mx) {\n       mx = a - b;\n       aa = a;\n       bb = b;\n     } else if (a - b == mx && a > aa) {\n       aa = a;\n       bb = b;\n     }\n   }\n   for (int i(0), _n(m); i < _n; ++i) {\n     pr = fun(arr[i]);\n     a = pr.first;\n     b = pr.second;\n     if (a - b > mx) {\n       mx = a - b;\n       aa = a;\n       bb = b;\n     } else if (a - b == mx && a > aa) {\n       aa = a;\n       bb = b;\n     }\n   }\n   pr = fun(ar[n - 1] + 1);\n   a = pr.first;\n   b = pr.second;\n   if (a - b > mx) {\n     mx = a - b;\n     aa = a;\n     bb = b;\n   } else if (a - b == mx && a > aa) {\n     aa = a;\n     bb = b;\n   }\n   cout << aa << ':' << bb;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int getResult(long long y) {\n   printf('%lld\n', y);\n   fflush(stdout);\n   int vd;\n   scanf('%d', &vd);\n   if (vd <= 0) exit(0);\n   vd--;\n   return vd;\n }\n bool solve(vector<long long> a) {\n   int maxIndex = 0;\n   for (int i = 1; i < 3; i++)\n     if (a[i] > a[maxIndex]) maxIndex = i;\n   int minIndex = 0;\n   for (int i = 1; i < 3; i++)\n     if (a[i] < a[minIndex]) minIndex = i;\n   int middle = 3 - maxIndex - minIndex;\n   long long w = 2 * a[maxIndex] - a[minIndex] - a[middle];\n   int r = getResult(w);\n   if (r == maxIndex) {\n     a[maxIndex] += w;\n     return solve(a);\n   } else {\n     int otherone = 3 - maxIndex - r;\n     long long w2 = a[maxIndex] - a[otherone];\n     int r2 = getResult(w2);\n     return r2 == 0;\n   }\n }\n int main() {\n   vector<long long> a(3);\n   for (int i = 0; i < 3; i++) scanf('%lld', &a[i]);\n   printf('First\n');\n   fflush(stdout);\n   solve(a);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double EPS = 1e-8;\n const int INFI = 1000 * 1000 * 1000;\n const long long INFL = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;\n const int MX_N = 1000;\n int N;\n string s, t;\n string strs[] = {'abc', 'acb', 'bac', 'bca', 'cab', 'cba'};\n int nstrs = 6;\n int main() {\n   cin >> N;\n   cin >> s >> t;\n   int dobc = 0;\n   cout << 'YES' << endl;\n   if (s[0] == s[1]) ++dobc;\n   if (t[0] == t[1]) ++dobc;\n   if (N == 1 || !dobc) {\n     for (int i = 0; i < nstrs; ++i) {\n       string s1 = strs[i].substr(0, 2);\n       string s2 = strs[i].substr(1, 2);\n       if (s == s1 || s == s2 || t == s1 || t == s2) continue;\n       for (int j = 0; j < 3; ++j)\n         for (int k = 0; k < N; ++k) cout << strs[i][j];\n       putchar('\n');\n       return 0;\n     }\n   } else {\n     for (int i = 0; i < nstrs; ++i) {\n       bool pass = true;\n       string ap = strs[i] + strs[i];\n       for (int j = 0; j < ap.size() - 1 && pass; ++j) {\n         string sb = ap.substr(j, 2);\n         if (s == sb || t == sb) pass = false;\n       }\n       if (!pass) continue;\n       for (int j = 0; j < N; ++j) cout << strs[i];\n       cout << endl;\n       break;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[200000];\n long long INF = 1e12;\n inline bool comp_bit(int x, int y) { return !!(x & y); }\n inline int binsearch(int l, int r, int depth) {\n   return (upper_bound(a + l, a + r, 1 << depth, comp_bit) - a);\n }\n long long connect(int depth, int l1, int r1, int l2, int r2) {\n   if (l1 == r1 || l2 == r2) return INF;\n   if (a[l1] == a[r1 - 1] && a[l2] == a[r2 - 1]) return a[l1] ^ a[l2];\n   int mid1 = binsearch(l1, r1, depth), mid2 = binsearch(l2, r2, depth);\n   if (mid1 == l1 && mid2 == r2 || mid1 == r1 && mid2 == l2)\n     return connect(depth - 1, l1, r1, l2, r2);\n   else\n     return min(connect(depth - 1, l1, mid1, l2, mid2),\n                connect(depth - 1, mid1, r1, mid2, r2));\n }\n long long solve(int depth, int l, int r) {\n   if (!depth) return (a[l] ^ a[r - 1]) & 1;\n   int mid = binsearch(l, r, depth);\n   if (mid == l || mid == r)\n     return solve(depth - 1, l, r);\n   else\n     return connect(depth - 1, l, mid, mid, r) + solve(depth - 1, l, mid) +\n            solve(depth - 1, mid, r);\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 0; i < n; ++i) scanf('%d', &a[i]);\n   sort(a, a + n);\n   printf('%lld', solve(29, 0, n));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct tim {\n   int begin, end;\n } t[200005];\n int cmp(tim a, tim b) {\n   if (a.begin != b.begin) return a.begin < b.begin;\n   return a.end < b.end;\n }\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> t[i].begin >> t[i].end;\n   sort(t + 1, t + n + 1, cmp);\n   t[0].end = -1;\n   int p[3] = {0};\n   int i;\n   for (i = 1; i <= n; i++) {\n     if (t[p[1]].end < t[i].begin) {\n       p[1] = i;\n       continue;\n     }\n     if (t[p[2]].end < t[i].begin) {\n       p[2] = i;\n       continue;\n     }\n     break;\n   }\n   if (i > n)\n     cout << 'YES';\n   else\n     cout << 'NO';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dx[] = {0, 0, -1, 1};\n int dy[] = {-1, 1, 0, 0};\n const int mod = 1000000007;\n const int INF = 1000000010;\n int n;\n char S[5020];\n int L[5010];\n int C[5010];\n int RV;\n pair<int, int> RM;\n int lookup[5010];\n int val[5010][15];\n int hp[5010][5010];\n int H[13][(1 << 13) + 3];\n void kmr() {\n   for (int i = (0); i < (n); ++i) H[0][i] = S[i] - '0';\n   pair<pair<int, int>, int> T[n];\n   for (int s = (0); s < (12); ++s) {\n     int d = (1 << s);\n     for (int i = (0); i < (n); ++i)\n       T[i] = make_pair(pair<int, int>(H[s][i], i + d < n ? H[s][i + d] : 0), i);\n     sort(T, T + n);\n     d = 0;\n     for (int i = (0); i < (n); ++i) {\n       if (i && T[i - 1].first != T[i].first) ++d;\n       H[s + 1][T[i].second] = d;\n     }\n   }\n }\n bool eq(pair<int, int> a, pair<int, int> b) {\n   if (a.second - a.first != b.second - b.first) return 0;\n   return hp[a.first][a.second] == hp[b.first][b.second];\n }\n int cmp_d;\n bool cmp(pair<int, int> a, pair<int, int> b) {\n   int ha = hp[a.first][a.second];\n   int hb = hp[b.first][b.second];\n   if (ha == hb) return a.first < b.first;\n   return ha < hb;\n }\n int diff(pair<int, int> a, pair<int, int> b) {\n   if (max(a.second - a.first, b.second - b.first) > 12) {\n     if (!eq(pair<int, int>(a.first, a.second - 12),\n             pair<int, int>(b.first, b.second - 12)))\n       return INF;\n     a.first = a.second - 12;\n     b.first = b.second - 12;\n   }\n   return val[a.first][a.second - a.first] - val[b.first][b.second - b.first];\n }\n vector<pair<int, pair<int, int> > > P;\n pair<int, pair<int, int> > prep(pair<int, int> p) {\n   return make_pair(hp[p.first][p.second], p);\n }\n int main() {\n   scanf('%s', S);\n   n = strlen(S);\n   for (int i = (1); i < (n + 1); ++i) {\n     int d = 0;\n     while ((1 << (d + 1)) < i) ++d;\n     lookup[i] = d;\n   }\n   for (int i = (0); i < (n); ++i) {\n     val[i][0] = 0;\n     for (int d = (1); d < (14); ++d)\n       val[i][d] = val[i][d - 1] * 2 + S[i + d - 1] - '0';\n   }\n   kmr();\n   for (int i = (0); i < (n); ++i)\n     for (int j = (i + 1); j < (n + 1); ++j)\n       hp[i][j] = (H[lookup[j - i]][i] << 16) +\n                  H[lookup[j - i]][j - (1 << lookup[j - i])];\n   for (int d = (1); d < (n + 1); ++d) {\n     int m = P.size();\n     for (int i = (0); i < (n + 1 - d); ++i)\n       if (S[i] == '1') P.push_back(prep(pair<int, int>(i, i + d)));\n     sort(P.begin() + m, P.end());\n   }\n   C[0] = 1;\n   for (int i = (1); i < (n + 1); ++i) L[i] = INF;\n   RV = INF;\n   for (pair<int, pair<int, int> > p_ : P) {\n     pair<int, int> p = p_.second;\n     if (L[p.first] == INF) continue;\n     C[p.second] = (C[p.second] + C[p.first]) % mod;\n     L[p.second] = min(L[p.second], L[p.first] + 1);\n     if (p.second == n) {\n       if (RV == INF) {\n         RV = L[n];\n         RM = p;\n       } else {\n         if (diff(p, RM) < RV - L[n]) {\n           RM = p;\n           RV = L[n];\n         }\n       }\n     }\n   }\n   printf('%d\n', C[n]);\n   int r = 0;\n   for (int i = (RM.first); i < (RM.second); ++i) r = (2 * r + S[i] - '0') % mod;\n   r = (r + RV) % mod;\n   printf('%d\n', r);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int c[210];\n int pre[210][210];\n int precnt[210];\n int cnt[210] = {0};\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 0; i < (n); i++) {\n     scanf('%d', c + i);\n     c[i] %= 3;\n   }\n   for (int i = 0; i < (n); i++)\n     for (int j = 0; j < (n); j++) pre[i][j] = 0;\n   for (int i = 0; i < (n); i++) {\n     scanf('%d', precnt + i);\n     int t;\n     for (int j = 0; j < (precnt[i]); j++) {\n       scanf('%d', &t);\n       pre[i][t - 1] = 1;\n     }\n   }\n   int mintime = 1000100;\n   for (int p = 0; p < (3); p++) {\n     int pos = p, time = 0, done = 0;\n     for (int i = 0; i < (n); i++) cnt[i] = 0;\n     while (done < n) {\n       queue<int> Q;\n       for (int i = 0; i < (n); i++)\n         if (precnt[i] == cnt[i] && c[i] == pos) Q.push(i);\n       while (!Q.empty()) {\n         int part = Q.front();\n         Q.pop();\n         done++;\n         time++;\n         cnt[part]++;\n         for (int i = 0; i < (n); i++)\n           if (pre[i][part] == 1) {\n             cnt[i]++;\n             if (cnt[i] == precnt[i] && c[i] == pos) Q.push(i);\n           }\n       }\n       pos = (pos + 1) % 3;\n       time++;\n     }\n     time--;\n     if (time < mintime) mintime = time;\n   }\n   printf('%d\n', mintime);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int a, int b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n bool isPrime(long long n) {\n   long long c;\n   if (n <= 1) return false;\n   c = sqrt(n);\n   for (int i = 2; i <= c; i++)\n     if (n % i == 0) return false;\n   return true;\n }\n int D(long long n) {\n   int count = 0;\n   while (n != 0) {\n     n = n / 10;\n     ++count;\n   }\n   return count;\n }\n const long long N = 2e5 + 7;\n long long l, k, d, tr, n, m, sum, mini, maxi, a, b, c, x, y;\n long long t[5007];\n set<int> vis;\n vector<int> v;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   for (cin >> tr; tr--;) {\n     cin >> n;\n     mini = 0;\n     cin >> t[0];\n     for (int i = 1; i < n; i++) {\n       cin >> t[i];\n       if (t[i] != t[i - 1]) {\n         a = i;\n         c = t[i];\n         b = i - 1;\n         mini++;\n       }\n     }\n     if (mini) {\n       cout << 'YES' << endl;\n       for (int i = 0; i < n; i++) {\n         if (i != a) {\n           if (t[i] != c) {\n             cout << i + 1 << ' ' << a + 1 << endl;\n           } else {\n             cout << i + 1 << ' ' << b + 1 << endl;\n           }\n         }\n       }\n     } else {\n       cout << 'NO' << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 3e5 + 5, LOG = 19, off = 1 << 19;\n pair<int, int> t[LOG][2 * off];\n void upd(int x, pair<int, int> p, int lg) {\n   for (x += off; x; x /= 2) {\n     t[lg][x].first = min(t[lg][x].first, p.first);\n     t[lg][x].second = max(t[lg][x].second, p.second);\n   }\n }\n pair<int, int> get(int x, int lo, int hi, int a, int b, int lg) {\n   if (lo >= a && hi <= b) {\n     return t[lg][x];\n   }\n   if (lo >= b || hi <= a) {\n     return {off, 0};\n   }\n   int mid = (lo + hi) >> 1;\n   pair<int, int> lson = get(x * 2, lo, mid, a, b, lg);\n   pair<int, int> rson = get(x * 2 + 1, mid, hi, a, b, lg);\n   return pair<int, int>(min(lson.first, rson.first),\n                         max(lson.second, rson.second));\n }\n int r[MAXN];\n pair<int, int> par[MAXN][LOG];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; ++i) {\n     cin >> r[i];\n   }\n   if (n == 1) {\n     cout << 0;\n     return 0;\n   }\n   for (int i = 0; i < 2 * off; ++i)\n     for (int lg = 0; lg < LOG; ++lg) {\n       t[lg][i].first = off;\n     }\n   for (int i = 0; i < n; ++i)\n     for (int j = 0; j < 3; ++j) {\n       par[i + j * n][0].first = max(0, i + j * n - r[i]);\n       par[i + j * n][0].second = min(3 * n - 1, i + j * n + r[i]);\n       upd(i + j * n, par[i + j * n][0], 0);\n     }\n   for (int lg = 1; lg < LOG; ++lg) {\n     for (int i = n; i < 2 * n; ++i) {\n       par[i][lg] = get(1, 0, off, par[i][lg - 1].first,\n                        par[i][lg - 1].second + 1, lg - 1);\n     }\n     for (int i = 0; i < n; ++i) {\n       par[i][lg].first = max(0, par[i + n][lg].first - n);\n       par[i][lg].second = min(3 * n - 1, par[i + n][lg].second - n);\n     }\n     for (int i = 2 * n; i < 3 * n; ++i) {\n       par[i][lg].first = max(0, par[i - n][lg].first + n);\n       par[i][lg].second = min(3 * n - 1, par[i - n][lg].second + n);\n     }\n     for (int i = 0; i < 3 * n; ++i) {\n       upd(i, par[i][lg], lg);\n     }\n   }\n   for (int j = 0; j < n; ++j) {\n     int i = n + j;\n     int lo = i, hi = i, sol = 0;\n     for (int lg = LOG - 1; lg >= 0; --lg) {\n       pair<int, int> res = get(1, 0, off, lo, hi + 1, lg);\n       if (res.second - res.first + 1 < n) {\n         lo = res.first;\n         hi = res.second;\n         sol += (1 << lg);\n       }\n     }\n     cout << sol + 1 << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #pragma comment(linker, '/STACK:255000000')\n bool firstout = 1;\n template <class T>\n T &minn(T &a, T b) {\n   if (b < a) a = b;\n   return a;\n }\n template <class T>\n T &maxx(T &a, T b) {\n   if (a < b) a = b;\n   return a;\n }\n int &madd(int &a, int b) {\n   a += b;\n   if (a >= 1000000009) a -= 1000000009;\n   return a;\n }\n int &msub(int &a, int b) {\n   a -= b;\n   if (a < 0) a += 1000000009;\n   return a;\n }\n int &mmult(int &a, int b) { return a = (long long)a * b % 1000000009; }\n int mdiv(long long a, long long b, long long m) {\n   a = (a % m + m) % m;\n   b = (b % m + m) % m;\n   if (a % b == 0) return a / b;\n   return (a + m * mdiv(-a, m, b)) / b;\n }\n int n, m;\n int A[201234];\n int B[201234];\n int R[201234];\n int RR[201234];\n int P[201234];\n vector<int> O[201234];\n vector<int> OO[201234];\n void fnd(int *R) {\n   int i, j, k;\n   for (i = (0); i < (n); ++i) P[B[i]] = i;\n   for (i = (0); i < (2 * n); ++i) OO[i].clear(), O[i].clear();\n   for (i = (0); i < (n); ++i) {\n     j = P[A[i]];\n     j = (i - j + n) % n;\n     O[j].push_back(-j);\n     OO[j + n - i].push_back(-j);\n   }\n   for (i = (0); i < (n); ++i) R[i] = 1012345678;\n   multiset<int> s;\n   s.clear();\n   for (i = (0); i < (2 * n); ++i) {\n     for (k = (0); k < (O[i].size()); ++k) s.insert(O[i][k]);\n     for (k = (0); k < (OO[i].size()); ++k) s.erase(s.find(OO[i][k]));\n     if (s.size()) minn(R[i % n], *s.begin() + i);\n   }\n }\n int main() {\n   int i, j, k;\n   char c;\n   int a, d;\n   int ts;\n   for (ts = 1; scanf('%'\n                      'd',\n                      &(n)) > 0;\n        ++ts) {\n     for (i = (0); i < (n); ++i)\n       scanf(\n           '%'\n           'd',\n           &(A[i])),\n           --A[i];\n     for (i = (0); i < (n); ++i)\n       scanf(\n           '%'\n           'd',\n           &(B[i])),\n           --B[i];\n     fnd(R);\n     reverse(A, A + n);\n     reverse(B, B + n);\n     fnd(RR);\n     int res = 0;\n     for (i = (0); i < (n); ++i)\n       printf(\n           '%'\n           'd',\n           (min(RR[i], R[(n - i) % n]))),\n           printf('\n'), firstout = 1;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<double, int> a;\n double b[200007];\n inline long long int read() {\n   long long int x = 0, f = 1;\n   char ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();\n   return x * f;\n }\n inline void writ(int x) {\n   if (x < 0) putchar('-'), x = -x;\n   if (x > 9) writ(x / 10);\n   putchar(x % 10 + '0');\n }\n inline void write(int x) {\n   writ(x);\n   putchar(' ');\n }\n int main() {\n   a.clear();\n   int n = read(), x, y, z;\n   for (int i = 1; i <= n; ++i)\n     x = read(), y = read(), z = read(), b[i] = (double)(x + y) / z, ++a[b[i]];\n   for (int i = 1; i <= n; ++i) write(a[b[i]]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n unsigned long long int n, m, l;\n unsigned long long int r, k, nn;\n template <class T>\n inline T min(T a, T b) {\n   return ((a < b) ? a : b);\n }\n char frac[9][500][500];\n string p[500];\n char isfrac(char a, char b, char c, char d) {\n   char mx = max(max(a, b), max(c, d));\n   return (\n       (((mx & 8) ? (a == mx) : (a == 0)) && ((mx & 4) ? (b == mx) : (b == 0)) &&\n        ((mx & 2) ? (c == mx) : (c == 0)) && ((mx & 1) ? (d == mx) : (d == 0)))\n           ? mx\n           : -1);\n }\n int main(int argc, char** argv) {\n   cin >> n >> m;\n   for (int i = 0; i < n; ++i) {\n     cin >> p[i];\n   }\n   char f = 0;\n   for (int i = 0; i < (n - 1); ++i) {\n     for (int j = 0; j < (m - 1); ++j) {\n       f = 0;\n       if (p[i][j] == '.') {\n         f += 8;\n       }\n       if (p[i][j + 1] == '.') {\n         f += 4;\n       }\n       if (p[i + 1][j] == '.') {\n         f += 2;\n       }\n       if (p[i + 1][j + 1] == '.') {\n         f += 1;\n       }\n       frac[0][i][j] = f;\n     }\n   }\n   int cnt = 0;\n   int l = 1;\n   int pw = 2;\n   while (((2 * pw) <= n) && ((2 * pw) <= m)) {\n     for (int i = 0; i <= (n - 2 * pw); ++i) {\n       for (int j = 0; j <= (m - 2 * pw); ++j) {\n         frac[l][i][j] =\n             isfrac(frac[l - 1][i][j], frac[l - 1][i][j + pw],\n                    frac[l - 1][i + pw][j], frac[l - 1][i + pw][j + pw]);\n         if (frac[l][i][j] >= 0) {\n           cnt++;\n         }\n       }\n     }\n     ++l;\n     pw *= 2;\n   }\n   cout << cnt;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bitset<4001> g[4001];\n int main() {\n   int n, m;\n   cin >> n >> m;\n   vector<pair<int, int> > v;\n   for (int i = 0; i < m; i++) {\n     int a, b;\n     cin >> a >> b;\n     a--;\n     b--;\n     g[a][b] = 1;\n     g[b][a] = 1;\n     v.push_back(pair<int, int>(a, b));\n   }\n   int minx = 100000000;\n   bool was = 0;\n   for (int i = 0; i < v.size(); i++) {\n     int a = v[i].first;\n     int b = v[i].second;\n     for (int j = 0; j < n; j++) {\n       if (g[a][j] && g[b][j]) {\n         minx = min(minx, (int)(g[a].count() + g[b].count() + g[j].count()) - 6);\n         was = true;\n       }\n     }\n   }\n   if (was)\n     cout << minx;\n   else\n     cout << -1;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1e9 + 7;\n const int N = 1e5 + 4;\n const long long MOD = 998244353;\n bool ans[2 * N];\n long long POW(long long base, long long exponent) {\n   long long result = 1;\n   while (exponent > 0) {\n     if (exponent % 2 == 1) result = (result * base) % MOD;\n     exponent = exponent >> 1;\n     base = (base * base) % MOD;\n   }\n   return result;\n }\n long long Inv(long long x) { return POW(x, MOD - 2); }\n void BFS(int s, vector<int> &d, vector<int> edge[]) {\n   d[s] = 0;\n   queue<int> q;\n   q.push(s);\n   while (!q.empty()) {\n     int v = q.front();\n     q.pop();\n     for (auto to : edge[v]) {\n       if (d[to] == (int)1e9) {\n         d[to] = d[v] + 1;\n         q.push(to);\n       }\n     }\n   }\n }\n int main() {\n   std::ios::sync_with_stdio(false);\n   cin.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     int a[n];\n     for (int i = 0; i < n; i++) cin >> a[i];\n     int l = 0, r = n - 1, ls = 0, rs = 0, al = 0, b = 0, mv = 0;\n     while (l <= r) {\n       if (mv & 1) {\n         rs = 0;\n         while (rs <= ls and r >= l) rs += a[r--];\n         b += rs;\n         mv++;\n       } else {\n         ls = 0;\n         while (ls <= rs and l <= r) ls += a[l++];\n         al += ls;\n         mv++;\n       }\n     }\n     cout << mv << ' ' << al << ' ' << b << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dis[75][1 << 18];\n bool mark[75][1 << 18];\n int n, m, A, B;\n vector<pair<int, int> > ve[75];\n struct zzt {\n   pair<int, int> to;\n   int di;\n };\n bool operator<(zzt aa, zzt bb) { return aa.di > bb.di; }\n priority_queue<zzt> q;\n int fa[75];\n int gf(int x) { return fa[x] == x ? x : fa[x] = gf(fa[x]); }\n int sz[75];\n void merge(int x, int y) {\n   x = gf(x);\n   y = gf(y);\n   if (x != y) fa[x] = y, sz[y] += sz[x];\n }\n int mk[75], mkid;\n int ozt(int x) { return mk[x] ? (1 << (mk[x] - 1)) : 0; }\n int main() {\n   scanf('%d%d%d%d', &n, &m, &A, &B);\n   for (int i = 1; i <= n; i++) fa[i] = i, sz[i] = 1;\n   for (int i = 1; i <= m; i++) {\n     int x, y, z;\n     scanf('%d%d%d', &x, &y, &z);\n     ve[x].push_back(pair<int, int>(y, z));\n     ve[y].push_back(pair<int, int>(x, z));\n     if (z == A) merge(x, y);\n   }\n   mkid = 0;\n   for (int i = 1; i <= n; i++) {\n     if ((!mk[i]) && sz[gf(i)] > 3) {\n       ++mkid;\n       for (int j = i; j <= n; j++) {\n         if (gf(j) == gf(i)) mk[j] = mkid;\n       }\n     }\n   }\n   q.push((zzt){pair<int, int>(1, ozt(1)), 0});\n   memset(dis, 0x3f, sizeof dis);\n   dis[1][ozt(1)] = 0;\n   while (q.size()) {\n     int x = q.top().to.first;\n     int zt = q.top().to.second;\n     q.pop();\n     if (mark[x][zt]) continue;\n     mark[x][zt] = 1;\n     for (auto p : ve[x]) {\n       int y = p.first;\n       int le = p.second;\n       if (le == A) {\n         if (dis[y][zt] > dis[x][zt] + le) {\n           dis[y][zt] = dis[x][zt] + le;\n           q.push((zzt){pair<int, int>(y, zt), dis[y][zt]});\n         }\n       } else if (gf(y) != gf(x) && (ozt(y) & zt) == 0) {\n         if (dis[y][zt | ozt(y)] > dis[x][zt] + le) {\n           dis[y][zt | ozt(y)] = dis[x][zt] + le;\n           q.push((zzt){pair<int, int>(y, zt | ozt(y)), dis[y][zt | ozt(y)]});\n         }\n       }\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     int ans = 0x3f3f3f3f;\n     for (int j = 0; j <= (1 << mkid) - 1; j++) {\n       ans = min(ans, dis[i][j]);\n     }\n     cout << ans << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long i, j, k, l, m, n, t, x, y;\n   cin >> n;\n   if (n % 2 == 0)\n     cout << n + 4 << ' ' << 4 << endl;\n   else\n     cout << n + 9 << ' ' << 9 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline bool is_prime(int n) {\n   for (int i = 2; i * i <= n; ++i)\n     if (n % i == 0) return 0;\n   return 1;\n }\n inline int Exp(int a, int p, int mod) {\n   int res = 1;\n   while (p) {\n     if (p & 1) res = (long long)res * a % mod;\n     p >>= 1;\n     a = (long long)a * a % mod;\n   }\n   return res;\n }\n inline int get_root(int n) {\n   for (int i = 2; i < n; ++i) {\n     if (Exp(i, n - 1, n) != 1) continue;\n     bool ok = 1;\n     for (int j = 1; j < n - 1; ++j)\n       if (Exp(i, j, n) == 1) {\n         ok = 0;\n         break;\n       }\n     if (ok) return i;\n   }\n   return -1;\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   if (n == 1) {\n     puts('YES');\n     puts('1');\n     return 0;\n   }\n   if (n == 4) {\n     puts('YES');\n     puts('1');\n     puts('3');\n     puts('2');\n     puts('4');\n     return 0;\n   }\n   if (n == 2) {\n     puts('YES');\n     puts('1 2');\n     return 0;\n   }\n   if (is_prime(n)) {\n     puts('YES');\n     int g = get_root(n);\n     printf('%d\n', Exp(g, n - 1, n));\n     for (int i = 1; i <= n - 2; ++i) {\n       if (i & 1)\n         printf('%d\n', Exp(g, i, n));\n       else\n         printf('%d\n', Exp(g, n - 1 - i, n));\n     }\n     printf('%d\n', n);\n   } else\n     puts('NO');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char str[105];\n int main() {\n   int n;\n   scanf('%d', &n);\n   scanf('%s', str);\n   vector<int> g;\n   int sum = 0;\n   for (int i = 0; i < n; i++) {\n     if (str[i] == 'B') {\n       sum++;\n     } else {\n       if (sum) g.push_back(sum);\n       sum = 0;\n     }\n   }\n   if (sum) g.push_back(sum);\n   printf('%d\n', g.size());\n   for (int i = 0; i < g.size(); i++) {\n     printf('%d ', g[i]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int T;\n   scanf('%d', &T);\n   while (T--) {\n     long long s, n, k;\n     scanf('%lld%lld%lld', &s, &n, &k);\n     if (s < k)\n       printf('NO\n');\n     else if (s == k)\n       printf('YES\n');\n     else {\n       long long left_sum = s - n;\n       long long extra_sum = (n / k) * k;\n       if (left_sum < extra_sum)\n         printf('YES\n');\n       else\n         printf('NO\n');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n long long gcd(long long a, long long b) {\n   if (a == 0 || b == 0) return (a + b);\n   if (a > b) return (gcd(a % b, b));\n   return (gcd(a, b % a));\n }\n long long lcm(long long a, long long b) { return ((a * b / gcd(a, b))); }\n int sqr(int x) { return (x * x); }\n void out() {\n   puts('NO');\n   exit(0);\n }\n using namespace std;\n int n;\n int p[100008];\n int main() {\n   cin >> n;\n   for (int i = (int)(1); i < (int)(n + 1); ++i) p[i] = i;\n   if (n % 2 == 1) {\n     cout << '-1\n';\n     return 0;\n   }\n   for (int i = (int)(1); i < (int)(n + 1); ++i) {\n     swap(p[i], p[i + 1]);\n     i++;\n   }\n   for (int i = (int)(n); i >= (int)(1); --i) cout << i << ' ';\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = 1e5 + 5;\n const int K = 655;\n const int mod = 998244353;\n int T;\n int n, a[N];\n int q[K], v[K], w[K], top = 0;\n int q2[K], v2[K], w2[K], top2 = 0;\n int MOD(int x) { return x >= mod ? x - mod : x; }\n int u(int x, int y) { return (x + y - 1) / y; }\n int main() {\n   scanf('%d', &T);\n   while (T--) {\n     scanf('%d', &n);\n     for (int i = 1; i <= n; ++i) scanf('%d', &a[i]);\n     q[top = 1] = a[n], v[1] = 0, w[1] = 1;\n     int ans = 0;\n     for (int i = n - 1; i >= 1; --i) {\n       top2 = 0;\n       for (int l = 1, r, j = 0; l <= a[i]; l = r + 1) {\n         r = a[i] / (a[i] / l);\n         q2[++top2] = a[i] / l;\n         v2[top2] = 0;\n         w2[top2] = (l == 1);\n         if (i == 1) {\n           int tmp = 1;\n         }\n         while (j < top && u(a[i], q[j + 1]) >= l && u(a[i], q[j + 1]) <= r) {\n           ++j;\n           v2[top2] = MOD(v2[top2] + MOD(v[j] + (long long)(u(a[i], q[j]) - 1) *\n                                                    w[j] % mod));\n           w2[top2] = w2[top2] + w[j];\n         }\n       }\n       for (int j = 1; j <= top2; ++j) {\n         q[j] = q2[j];\n         v[j] = v2[j];\n         w[j] = w2[j];\n       }\n       top = top2;\n       for (int j = 1; j <= top; ++j) ans = MOD(ans + v[j]);\n     }\n     printf('%d\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m, min, max, i, t, f = 0;\n   cin >> n >> m;\n   cin >> min;\n   max = min;\n   for (i = 1; i < n; i++) {\n     cin >> t;\n     if (t > max)\n       max = t;\n     else if (t < min)\n       min = t;\n   }\n   if (2 * min > max) max = 2 * min;\n   for (i = 0; i < m; i++) {\n     cin >> t;\n     if (t <= max) f = 1;\n   }\n   if (f == 1)\n     cout << '-1\n';\n   else\n     cout << max << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline void read(T& x) {\n   char c = getchar();\n   bool f = false;\n   for (x = 0; !isdigit(c); c = getchar()) {\n     if (c == '-') {\n       f = true;\n     }\n   }\n   for (; isdigit(c); c = getchar()) {\n     x = x * 10 + c - '0';\n   }\n   if (f) {\n     x = -x;\n   }\n }\n template <typename T, typename... U>\n inline void read(T& x, U&... y) {\n   read(x), read(y...);\n }\n const int N = 5e1 + 10;\n const double eps = 1e-6;\n int n;\n int ID[N];\n double K;\n double A[N], B[N], F[N][N];\n double V(int a) { return A[a] - K * B[a]; }\n bool cmp(int a, int b) { return A[a] == A[b] ? V(a) > V(b) : A[a] > A[b]; }\n int main() {\n   read(n);\n   for (int i = 1; i <= n; ++i) scanf('%lf', &A[i]);\n   for (int i = 1; i <= n; ++i) scanf('%lf', &B[i]), ID[i] = i;\n   double L = 0.01, R = 5e9, res = 233;\n   while (R - L >= eps) {\n     double mid = (L + R) / 2.0;\n     K = mid;\n     sort(ID + 1, ID + n + 1, cmp);\n     for (int i = 0; i <= n; ++i)\n       for (int j = 0; j <= n; ++j) F[i][j] = 1e18;\n     F[0][0] = 0;\n     int cnt = 0;\n     for (int i = 1; i <= n; ++i) {\n       ++cnt;\n       double sum = V(ID[i]);\n       int p = i;\n       while (p != n && A[ID[p + 1]] == A[ID[i]]) sum += V(ID[++p]);\n       double g = 0;\n       int s = p - i + 1;\n       for (int j = 0; j <= s; ++j) {\n         if (j) g += V(ID[i + j - 1]);\n         for (int k = 0; k <= i - 1; ++k)\n           if (j <= k) {\n             F[cnt][k - j + s - j] =\n                 min(F[cnt][k - j + s - j], F[cnt - 1][k] + sum - g);\n           }\n       }\n       i = p;\n     }\n     double ANS = 1e18;\n     for (int i = 0; i <= n; ++i) ANS = min(ANS, F[cnt][i]);\n     if (ANS <= eps)\n       res = mid, R = mid - eps;\n     else\n       L = mid + eps;\n   }\n   printf('%lld\n', (long long)(res * 100000 + 99) / 100);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int Maxn = 200005;\n struct M {\n   int val, pos;\n };\n M a[Maxn], b[Maxn];\n int idx[Maxn], idy[Maxn], Nx[Maxn], Ny[Maxn];\n int read() {\n   int sum = 0, t = 1;\n   char c = getchar();\n   while (c < '0' || c > '9') {\n     if (c == '-') t = -1;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') {\n     sum = sum * 10 + c - '0';\n     c = getchar();\n   }\n   return sum * t;\n }\n bool cmp(M x, M y) {\n   return (x.val < y.val || (x.val == y.val && b[x.pos].val < b[y.pos].val));\n }\n long long C2(long long x) { return 1ll * x * (x - 1) / 2; }\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; ++i) {\n     a[i].val = read(), b[i].val = read();\n     a[i].pos = b[i].pos = i;\n   }\n   sort(a + 1, a + n + 1, cmp);\n   int cnt = 0, same = 1;\n   long long res = 0;\n   a[0].val = b[0].val = -0x3f3f3f3f;\n   cnt = 0;\n   for (int i = 1; i <= n; ++i) {\n     if (a[i].val != a[i - 1].val)\n       cnt++, res += C2(same), same = 1;\n     else {\n       if (b[a[i].pos].val == b[a[i - 1].pos].val)\n         same++;\n       else\n         res += C2(same), same = 1;\n     }\n     idx[a[i].pos] = cnt;\n   }\n   res += C2(same);\n   sort(b + 1, b + n + 1, cmp);\n   cnt = 0;\n   for (int i = 1; i <= n; ++i) {\n     if (b[i].val != b[i - 1].val) cnt++;\n     idy[b[i].pos] = cnt;\n   }\n   for (int i = 1; i <= n; ++i) {\n     Nx[idx[i]]++;\n     Ny[idy[i]]++;\n   }\n   long long ans = 0;\n   for (int i = 1; i <= n; ++i) {\n     ans += C2(Nx[i]) + C2(Ny[i]);\n   }\n   ans -= res;\n   printf('%lld', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, count1 = 0, count2 = 0, sum = 0;\n   scanf('%d', &n);\n   vector<pair<int, int> > v1;\n   vector<pair<int, int> > 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<pair<int, int> >::iterator it1 = v1.begin();\n   vector<pair<int, int> >::iterator it2 = v2.begin();\n   vector<pair<int, int> >::iterator it3 = v1.end();\n   vector<pair<int, int> >::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 <bits/stdc++.h>\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<pair<long long, pair<int, int> > > V, Ans;\n struct MY_QUEUE {\n   deque<pair<int, int> > Q;\n   inline void reset() { Q.clear(); }\n   inline void push(int val, int mark) {\n     pair<int, int> 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 <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <typename T>\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<int> merge(const vector<int>& a, const vector<int>& b,\n                   bool want_mx = true) {\n   int s1 = a.size(), s2 = b.size();\n   int sz = min(s1 + s2, byben_size);\n   vector<int> 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<int> t[1 << 18];\n int sz = 1 << 17;\n int a[maxN];\n vector<int> 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<int> get(int v, bool want_mx) {\n   vector<int> 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<int>();\n   for (int i = 1; i <= n; ++i) {\n     a[i] = getint<int>();\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 <bits/stdc++.h>\n using namespace std;\n const int max_n = 303333, inf = 1000111222;\n int n, x, y;\n pair<int, int> 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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void prime(long long int n, set<long long int> &s) {\n   if (n % 2 == 0) {\n     s.insert(2);\n     n /= 2;\n   }\n   while (n % 2 == 0) {\n     n /= 2;\n   }\n   for (int i = 3; i <= sqrt(n); i += 2) {\n     if (n % i == 0) {\n       s.insert(i);\n       n /= i;\n     }\n     while (n % i == 0) {\n       n /= i;\n     }\n   }\n   if (n > 2) s.insert(n);\n }\n int main() {\n   long long int n;\n   cin >> n;\n   set<long long int> s;\n   prime(n, s);\n   if (s.size() == 1)\n     cout << *(s.begin()) << endl;\n   else\n     cout << 1 << endl;\n   return (0);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline T BigMod(T b, T p, T m) {\n   if (p == 0) return 1;\n   if (p % 2 == 0) {\n     T s = BigMod(b, p / 2, m);\n     return ((s % m) * (s % m)) % m;\n   }\n   return ((b % m) * (BigMod(b, p - 1, m) % m)) % m;\n }\n template <typename T>\n inline T ModInv(T b, T m) {\n   return BigMod(b, m - 2, m);\n }\n template <typename T>\n inline T Bigmod(T b, T p, T m) {\n   if (p == 0)\n     return 1;\n   else if (!(p & 1))\n     return (Bigmod(b, p / 2, m) * Bigmod(b, p / 2, m)) % m;\n   else\n     return ((b % m) * Bigmod(b, p - 1, m)) % m;\n }\n template <typename T>\n inline T gcd(T a, T b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n template <typename T>\n inline T lcm(T a, T b) {\n   if (a < 0) return lcm(-a, b);\n   if (b < 0) return lcm(a, -b);\n   return a * (b / gcd(a, b));\n }\n template <typename T>\n inline T euclide(T a, T b, T &x, T &y) {\n   if (a < 0) {\n     T d = euclide(-a, b, x, y);\n     x = -x;\n     return d;\n   }\n   if (b < 0) {\n     T d = euclide(a, -b, x, y);\n     y = -y;\n     return d;\n   }\n   if (b == 0) {\n     x = 1;\n     y = 0;\n     return a;\n   } else {\n     T d = euclide(b, a % b, x, y);\n     T t = x;\n     x = y;\n     y = t - (a / b) * y;\n     return d;\n   }\n }\n template <typename T>\n inline T Dis(T x1, T y1, T x2, T y2) {\n   return sqrt((((x1 - x2) * (x1 - x2)) + ((y1 - y2) * (y1 - y2))));\n }\n template <typename T>\n inline T Angle(T x1, T y1, T x2, T y2) {\n   return atan(double(y1 - y2) / double(x1 - x2));\n }\n template <typename T>\n inline T DIFF(T a, T b) {\n   T d = a - b;\n   if (d < (T)0)\n     return -d;\n   else\n     return d;\n }\n template <typename T>\n inline T ABS(T a) {\n   if (a < 0)\n     return -a;\n   else\n     return a;\n }\n template <typename T>\n inline long long isLeft(T a, T b, T c) {\n   return (a.x - b.x) * (b.y - c.y) - (b.x - c.x) * (a.y - b.y);\n }\n template <typename T>\n inline void _in(T &x) {\n   register int c = getchar();\n   x = 0;\n   bool neg = 0;\n   for (; ((c<48 | c> 57) && c != '-'); c = getchar())\n     ;\n   if (c == '-') {\n     neg = 1;\n     c = getchar();\n   }\n   for (; c > 47 && c < 58; c = getchar()) {\n     x = (x << 1) + (x << 3) + c - 48;\n   }\n   if (neg) x = -x;\n }\n template <typename T>\n inline bool isLeapYear(T N) {\n   if (N % 4)\n     return 0;\n   else if (N % 100)\n     return 1;\n   else if (N % 400)\n     return 0;\n   else\n     return 1;\n }\n template <typename T>\n inline T Set(T N, T pos) {\n   T A = 1;\n   return N = N | (A << pos);\n }\n template <typename T>\n inline T Reset(T N, T pos) {\n   T A = 1;\n   return N = N & ~(A << pos);\n }\n template <typename T>\n inline bool Check(T N, T pos) {\n   T A = 1;\n   return (bool)(N & (A << pos));\n }\n template <class T, class X>\n inline T togglebit(T a, X i) {\n   T t = 1;\n   return (a ^ (t << i));\n }\n template <class T, class X>\n inline T toInt(T &sm, X s) {\n   stringstream ss(s);\n   ss >> sm;\n   return sm;\n }\n template <typename T>\n inline int cdigittoint(T ch) {\n   return ch - '0';\n }\n template <typename T>\n inline bool isVowel(T ch) {\n   ch = toupper(ch);\n   if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')\n     return true;\n   return false;\n }\n template <typename T>\n inline bool isConst(T ch) {\n   if (isalpha(ch) && !isVowel(ch)) return true;\n   return false;\n }\n inline double DEG(double x) { return (180.0 * x) / (2 * acos(0.0)); }\n inline double RAD(double x) { return (x * (double)2 * acos(0.0)) / (180.0); }\n int main() {\n   long long b1 = ({\n     long long a;\n     _in(a);\n     a;\n   }),\n             q = ({\n               long long a;\n               _in(a);\n               a;\n             }),\n             l = ({\n               long long a;\n               _in(a);\n               a;\n             }),\n             m = ({\n               long long a;\n               _in(a);\n               a;\n             });\n   map<long long, bool> A;\n   for (long long i = 1; i <= m; i++)\n     A[({\n       long long a;\n       _in(a);\n       a;\n     })] = true;\n   if (abs(b1) > l) {\n     printf('0\n');\n     return 0;\n   }\n   if (q == 0 || q == 1 || q == -1) {\n     if (q == 0) {\n       if (A[b1]) {\n         if (A[0] == 0)\n           printf('inf\n');\n         else\n           printf('0\n');\n       } else {\n         if (A[0] == 0)\n           printf('inf\n');\n         else {\n           if (abs(b1) <= l)\n             printf('1\n');\n           else\n             printf('0\n');\n         }\n       }\n     } else if (q == 1) {\n       if (A[b1])\n         printf('0\n');\n       else {\n         if (abs(b1) <= l)\n           printf('inf\n');\n         else\n           printf('0\n');\n       }\n     } else {\n       if (A[-b1] == 1 && A[b1] == 1)\n         printf('0\n');\n       else if (A[-b1] == 1 || A[b1] == 1) {\n         if (abs(b1) <= l)\n           printf('inf\n');\n         else\n           printf('0\n');\n       } else {\n         if (abs(b1) <= l)\n           printf('inf\n');\n         else\n           printf('0\n');\n       }\n     }\n   } else {\n     if (b1 == 0) {\n       if (A[b1] == 0)\n         printf('inf\n');\n       else\n         printf('0\n');\n       return 0;\n     }\n     long long count = 0;\n     while (true) {\n       if (A[b1] == 0 && abs(b1) <= l) count++;\n       b1 *= q;\n       if (abs(b1) > l) break;\n     }\n     printf('%lld\n', count);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bitset<64> f1[3610], f2[3610];\n int n, m;\n map<int, vector<int>> mp1, mp2;\n int y[66], y2[66];\n set<int> s;\n vector<int> res;\n int main() {\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++) cin >> y[i], y[i] *= 2, mp1[y[i]].push_back(i);\n   for (int i = 1; i <= m; i++)\n     cin >> y2[i], y2[i] *= 2, mp2[y2[i]].push_back(i);\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) res.push_back((y[i] + y2[j]) / 2);\n   sort(res.begin(), res.end());\n   res.erase(unique(res.begin(), res.end()), res.end());\n   for (int i = 0; i < res.size(); i++) {\n     int k = res[i];\n     for (int j = 1; j <= m; j++) {\n       int d = 2 * k - y2[j];\n       if (mp1[d].size())\n         for (auto xx : mp1[d]) f1[i].set(xx, 1);\n     }\n   }\n   for (int i = 0; i < res.size(); i++) {\n     int k = res[i];\n     for (int j = 1; j <= n; j++) {\n       int d = 2 * k - y[j];\n       if (mp2[d].size())\n         for (auto xx : mp2[d]) f2[i].set(xx, 1);\n     }\n   }\n   int ans = 0;\n   for (int i = 0; i < res.size(); i++)\n     for (int j = 0; j < res.size(); j++) {\n       int tmp = (f1[i] | f1[j]).count() + (f2[i] | f2[j]).count();\n       ans = max(ans, tmp);\n     }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     long long int n, m, i, j, zero = 0, neg = 0, tot = 0, val = INT_MIN,\n                               val2 = INT_MAX;\n     cin >> n >> m;\n     long long int b[n][m];\n     for (i = 0; i < n; i++) {\n       for (j = 0; j < m; j++) {\n         cin >> b[i][j];\n         if (b[i][j] < 0) {\n           neg++;\n           if (neg == 1)\n             val = b[i][j];\n           else if (val < b[i][j])\n             val = b[i][j];\n         } else if (b[i][j] == 0)\n           zero++;\n         else\n           val2 = min(val2, b[i][j]);\n         tot += abs(b[i][j]);\n       }\n     }\n     if (neg % 2 == 0 || zero != 0)\n       cout << tot << endl;\n     else {\n       cout << tot + 2 * max(val, -val2) << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 50 + 5;\n int n, dp[N][N][N][N];\n char g[N][N];\n int dfs(int x, int y, int h, int w) {\n   if (dp[x][y][h][w] != -1) return dp[x][y][h][w];\n   if (h == 1 && w == 1) return dp[x][y][h][w] = g[x][y] == '#';\n   if (h == 0 || w == 0) return dp[x][y][h][w] = 0;\n   dp[x][y][h][w] = max(h, w);\n   for (int i = 0; i <= h; ++i) {\n     dp[x][y][h][w] =\n         min(dp[x][y][h][w], dfs(x, y, i, w) + dfs(x + i, y, h - i, w));\n   }\n   for (int j = 0; j <= w; ++j) {\n     dp[x][y][h][w] =\n         min(dp[x][y][h][w], dfs(x, y, h, j) + dfs(x, y + j, h, w - j));\n   }\n   return dp[x][y][h][w];\n }\n int main() {\n   memset(dp, -1, sizeof(dp));\n   cin >> n;\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= n; ++j) {\n       cin >> g[i][j];\n     }\n   }\n   printf('%d', dfs(1, 1, n, n));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 100010;\n const int inf = 0x3f3f3f3f;\n int n, m;\n int mi[maxn], cnt[maxn];\n int main() {\n   cin >> n >> m;\n   memset(mi, 0x3f, sizeof(mi));\n   for (int i = 1; i <= m; i++) {\n     int x, y;\n     cin >> x >> y;\n     mi[x] = min(mi[x], (y - x + n) % n);\n     cnt[x]++;\n   }\n   for (int i = 1; i <= n; i++) {\n     long long ans = 0;\n     for (int j = 1; j <= n; j++)\n       if (cnt[j])\n         ans = max(ans, (j - i + n) % n + (long long)n * (cnt[j] - 1) + mi[j]);\n     cout << ans << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n void pv(T a, T b) {\n   for (T i = a; i != b; ++i) cout << *i << ' ';\n   cout << endl;\n }\n template <class T>\n void chmin(T &t, const T &f) {\n   if (t > f) t = f;\n }\n template <class T>\n void chmax(T &t, const T &f) {\n   if (t < f) t = f;\n }\n int in() {\n   int x;\n   scanf('%d', &x);\n   return x;\n }\n int N, M;\n int X[1000010], Y[1000010];\n int bitN;\n int bit[2100010];\n void bitAdd(int pos, int val) {\n   for (int x = pos; x <= bitN; x += x & -x) bit[x] += val;\n }\n int bitLowerBound(int w) {\n   if (w <= 0) return 0;\n   int x = 0;\n   for (int k = bitN; k > 0; k /= 2) {\n     if (x + k <= bitN && bit[x + k] < w) {\n       w -= bit[x + k];\n       x += k;\n     }\n   }\n   return x + 1;\n }\n int perm[1000010];\n int ids[2000010];\n bool used[1000010];\n bool solve() {\n   for (bitN = 2; bitN < M + N + 5; bitN <<= 1)\n     ;\n   memset(bit, 0, sizeof(bit));\n   memset(perm, ~0, sizeof(perm));\n   memset(ids, ~0, sizeof(ids));\n   for (int j = 1; j <= N; ++j) {\n     bitAdd(M + j, +1);\n     ids[M + j] = j;\n   }\n   for (int i = 0; i < M; ++i) {\n     const int pos = bitLowerBound(Y[i]);\n     const int j = ids[pos];\n     if (!~perm[j]) {\n       perm[j] = X[i];\n     }\n     if (perm[j] != X[i]) {\n       return false;\n     }\n     bitAdd(pos, -1);\n     bitAdd(M - i, +1);\n     ids[pos] = -1;\n     ids[M - i] = j;\n   }\n   memset(used, 0, sizeof(used));\n   for (int j = 1; j <= N; ++j)\n     if (~perm[j]) {\n       if (used[perm[j]]) {\n         return false;\n       }\n       used[perm[j]] = true;\n     }\n   int k = 1;\n   for (int j = 1; j <= N; ++j)\n     if (!~perm[j]) {\n       for (; used[k]; ++k)\n         ;\n       perm[j] = k;\n       used[k] = true;\n     }\n   return true;\n }\n int main() {\n   for (; ~scanf('%d%d', &N, &M);) {\n     for (int i = 0; i < M; ++i) {\n       X[i] = in();\n       Y[i] = in();\n     }\n     bool res = solve();\n     if (res) {\n       for (int j = 1; j <= N; ++j) {\n         if (j > 1) printf(' ');\n         printf('%d', perm[j]);\n       }\n       puts('');\n     } else {\n       puts('-1');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MN = 70010;\n vector<int> vs[MN];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   vector<string> vs(n);\n   for (int i = 0; i < n; i++) cin >> vs[i];\n   vector<string> ans(n);\n   for (int len = 1; len < 10; len++) {\n     map<string, set<int> > mapper;\n     for (int i = 0; i < n; i++)\n       for (int j = 0; j + len - 1 < 9; j++)\n         mapper[vs[i].substr(j, len)].insert(i);\n     for (auto &curr : mapper)\n       if (((int)curr.second.size()) == 1) {\n         int id = *curr.second.begin();\n         if (ans[id] == '') ans[id] = curr.first;\n       }\n   }\n   for (int i = 0; i < n; i++) cout << ans[i] << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline void remax(T& A, T B) {\n   if (A < B) A = B;\n }\n template <class T>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long> 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 <bits/stdc++.h>\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<<' '<<P<<endl\n #define endl '\n'\n  \n using namespace std;\n  \n typedef long long ll;\n  \n int main() {\n   testCase {\n   	int n;\n   	cin>>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 <bits/stdc++.h>\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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = (int)2e6 + 10;\n vector<int> a[N];\n vector<int> pos[N];\n string ans;\n int n;\n string s[N];\n int m;\n vector<int> cur;\n int cnt[N];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   memset(cnt, 0, sizeof(cnt));\n   m = 0;\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> s[i];\n     int len = s[i].length();\n     int k;\n     cin >> k;\n     while (k--) {\n       int p;\n       cin >> p;\n       p--;\n       m = max(m, p + len);\n       a[p].push_back(i);\n       a[p + len].push_back(-i);\n       pos[i].push_back(p);\n     }\n   }\n   ans.resize(m);\n   for (int i = 0; i < m; i++) {\n     for (int x : a[i]) {\n       if (x > 0) {\n         cur.push_back(x);\n         cnt[x]++;\n       } else {\n         cnt[-x]--;\n       }\n     }\n     while (!cur.empty() && cnt[cur.back()] == 0) cur.pop_back();\n     if (cur.empty())\n       ans[i] = 'a';\n     else {\n       int id = cur.back();\n       auto it = upper_bound(pos[id].begin(), pos[id].end(), i);\n       it--;\n       int p = *it;\n       if (i - p >= (int)s[id].length()) continue;\n       ans[i] = s[id][i - p];\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a, b, c;\n   while (cin >> a >> b >> c) {\n     long long l = 0, r = 100000000;\n     while (l <= r) {\n       long long t = (l + r) / 2;\n       long long w = b * t;\n       long long d = b * t;\n       bool ok = true;\n       while (d < a * c) {\n         if (w < a) {\n           ok = false;\n           break;\n         }\n         w -= a;\n         w += b;\n         d += b;\n       }\n       if (ok)\n         r = t - 1;\n       else\n         l = t + 1;\n     }\n     cout << l - 1 << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int read() {\n   int x = 0;\n   char ch = getchar();\n   while (ch < '0' || ch > '9') ch = getchar();\n   while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();\n   return x;\n }\n vector<pair<int, int> > v[1000000 + 5];\n int s[1000000 / 5], num = 0, last[1000000 + 5], vis[1000000 + 5],\n                     la[1000000 + 5], lastans = 0, n, q, mx, a[1000000 + 5],\n                     rt[1000000 + 5], cnt = 0, inv[1000000 + 5],\n                     Ans[1000000 + 5];\n struct Tree {\n   int l, r, x;\n } T[1000000 * 4 + 5];\n bool b[1000000 + 5];\n int Build(int l, int r) {\n   int x = ++cnt;\n   T[x].x = 1;\n   if (l != r) {\n     int mid = l + r >> 1;\n     T[x].l = Build(l, mid);\n     T[x].r = Build(mid + 1, r);\n   }\n   return x;\n }\n void Modify(int x, int l, int r, int lt, int rt, int v) {\n   if (l == lt && r == rt) {\n     T[x].x = 1LL * T[x].x * v % 1000000007;\n     return;\n   }\n   int mid = lt + rt >> 1;\n   if (r <= mid)\n     Modify(T[x].l, l, r, lt, mid, v);\n   else if (l > mid)\n     Modify(T[x].r, l, r, mid + 1, rt, v);\n   else\n     Modify(T[x].l, l, mid, lt, mid, v),\n         Modify(T[x].r, mid + 1, r, mid + 1, rt, v);\n }\n void Query(int x, int k, int lt, int rt) {\n   lastans = 1LL * lastans * T[x].x % 1000000007;\n   if (lt == rt) return;\n   int mid = lt + rt >> 1;\n   if (k <= mid)\n     Query(T[x].l, k, lt, mid);\n   else\n     Query(T[x].r, k, mid + 1, rt);\n }\n int main() {\n   n = read();\n   inv[0] = inv[1] = 1;\n   for (int i = 1; i <= n; ++i) mx = max(mx, a[i] = read());\n   q = read();\n   for (register int i = 2; i <= mx; ++i) {\n     inv[i] =\n         1LL * (1000000007 - 1000000007 / i) * inv[1000000007 % i] % 1000000007;\n     if (!b[i]) s[++num] = i, last[i] = i;\n     for (int j = 1; s[j] * i <= mx; ++j) {\n       b[s[j] * i] = 1;\n       last[s[j] * i] = s[j];\n       if (i % s[j] == 0) break;\n     }\n   }\n   rt[0] = Build(1, n);\n   for (int i = 1; i <= q; ++i) {\n     int l = read(), r = read();\n     v[r].push_back(make_pair(l, i));\n   }\n   for (register int i = 1; i <= n; ++i) {\n     Modify(rt[i] = rt[i - 1], 1, i, 1, n, a[i]);\n     for (int t = a[i]; t > 1; t /= last[t])\n       if (vis[last[t]] != i) {\n         vis[last[t]] = i;\n         Modify(rt[i], la[last[t]] + 1, i, 1, n,\n                1LL * inv[last[t]] * (last[t] - 1) % 1000000007);\n         la[last[t]] = i;\n       }\n     for (int j = 0; j < v[i].size(); ++j)\n       lastans = 1, Query(rt[i], v[i][j].first, 1, n),\n       Ans[v[i][j].second] = lastans;\n   }\n   for (int i = 1; i <= q; ++i) printf('%d\n', Ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using LL = long long;\n const LL MOD = 998244353;\n string s;\n LL cal(int x) {\n   if (x < 10 || x > 18) return 0;\n   return 9 - (x - 10);\n }\n struct SegmentTree {\n   struct Node {\n     int L, R, l, r;\n     LL v[2][2];\n   };\n   vector<Node> N;\n   int p;\n   vector<int> rt;\n   int n;\n   inline void init(int _n) {\n     n = _n;\n     N.resize(n * 4);\n     p = 1;\n     rt.clear();\n     rt.push_back(build(0, n));\n   }\n   inline int copy(Node u) { return N[p] = u, p++; }\n   int build(int L, int R) {\n     int u = copy({L, R}), M = (L + R) >> 1;\n     ;\n     if (R - L == 1)\n       return N[u].v[0][0] = s[L] - '0' + 1, N[u].v[0][1] = 1, N[u].v[1][0] = 1,\n              N[u].v[1][1] = 0, u;\n     return pull(u, build(L, M), build(M, R));\n   }\n   inline int push(int u) { return u; }\n   inline int pull(int u, int l, int r) {\n     if (!l || !r) return l ? l : r;\n     push(N[u].l = l);\n     push(N[u].r = r);\n     for (int i = 0; i < 2; i++) {\n       for (int j = 0; j < 2; j++) {\n         N[u].v[i][j] =\n             (N[l].v[i][0] * N[r].v[0][j] +\n              N[l].v[i][1] * N[r].v[1][j] % MOD *\n                  cal((s[N[l].R - 1] - '0') * 10 + (s[N[r].L] - '0'))) %\n             MOD;\n       }\n     }\n     return u;\n   }\n   int m(int L, int R, int u, int v) {\n     if (!u || R <= N[u].L || N[u].R <= L) return u;\n     push(u);\n     if (L <= N[u].L && N[u].R <= R) return N[u].v[0][0] = v + 1, u;\n     return pull(u, m(L, R, N[u].l, v), m(L, R, N[u].r, v));\n   }\n   int q(int L, int R, int u) {\n     if (!u || R <= N[u].L || N[u].R <= L) return 0;\n     if (L <= N[u].L && N[u].R <= R) return u;\n     push(u);\n     return pull(copy(N[u]), q(L, R, N[u].l), q(L, R, N[u].r));\n   }\n   inline void modify(int L, int R, int ver, int v) {\n     rt[ver] = m(L, R, rt[ver], v);\n   }\n   inline Node& query(int L, int R, int ver) {\n     p = 2 * n + 1;\n     return N[q(L, R, rt[ver])];\n   }\n } solver;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int n, q;\n   cin >> n >> q;\n   cin >> s;\n   solver.init(n);\n   while (q--) {\n     int x, d;\n     cin >> x >> d;\n     x--;\n     s[x] = '0' + d;\n     solver.modify(x, x + 1, 0, d);\n     auto v = solver.query(0, n, 0).v;\n     cout << v[0][0] << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> av;\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = max(1, n - 100); i <= n; i++) {\n     int j = i, ans = i;\n     while (j) {\n       ans += j % 10;\n       j /= 10;\n     }\n     if (ans == n) av.push_back(i);\n   }\n   int avs = av.size();\n   printf('%d\n', avs);\n   for (int i = 0; i < avs; i++) {\n     printf('%d\n', av[i]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n #pragma GCC optimize('Ofast')\n using namespace std;\n long long int n, res[200005], cnt = 0, ans[200005];\n vector<long long int> g[200005];\n vector<long long int> v[200005];\n map<long long int, long long int> c;\n queue<long long int> q;\n void dfs1(long long int node, long long int color) {\n   c[node] = color;\n   for (auto it : g[node]) {\n     if (!c[it]) {\n       dfs1(it, color % 2 + 1);\n     }\n   }\n }\n void dfs2(long long int node, long long int p) {\n   for (auto it : g[node]) {\n     if (it != p) {\n       dfs2(it, node);\n     }\n   }\n   for (auto it : g[node]) {\n     if (c[it] != c[node] && res[it] == 0 && res[node] == 0) {\n       cnt++;\n       res[it] = cnt;\n       res[node] = cnt;\n       q.push(it);\n       q.push(node);\n     }\n   }\n }\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   cin >> n;\n   for (long long int i = 1; i < n; i++) {\n     long long int x, y;\n     cin >> x >> y;\n     g[x].push_back(y);\n     g[y].push_back(x);\n   }\n   dfs1(1, 1);\n   dfs2(1, 1);\n   while (!q.empty()) {\n     long long int x = q.front();\n     q.pop();\n     for (auto it : g[x]) {\n       if (res[it] == 0) {\n         res[it] = res[x];\n         q.push(it);\n       }\n     }\n   }\n   for (long long int i = 1; i <= n; i++) {\n     v[res[i]].push_back(i);\n   }\n   long long int mn = 0;\n   for (long long int i = 1; i <= cnt; i++) {\n     mn += (v[i].size() - 1) * 2;\n     for (long long int j = 0; j < v[i].size(); j++) {\n       ans[v[i][j]] = v[i][(j + 1) % v[i].size()];\n     }\n   }\n   cout << mn << '\n';\n   for (long long int i = 1; i <= n; i++) {\n     cout << ans[i] << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int block_size = 320;\n const long long mod = 1e9 + 7;\n const long long inf = 1e9 + 7;\n const long double eps = 1e-9;\n const double PI = atan(1) * 4;\n template <typename T>\n inline int sign(const T &a) {\n   if (a < 0) return -1;\n   if (a > 0) return 1;\n   return 0;\n }\n string to_string(string s) { return ''' + s + '''; }\n string to_string(const char *s) { return to_string((string)s); }\n string to_string(bool b) { return (b ? 'true' : 'false'); }\n template <typename A, typename B>\n string to_string(pair<A, B> p) {\n   return '(' + to_string(p.first) + ', ' + to_string(p.second) + ')';\n }\n template <typename A>\n string to_string(A v) {\n   bool first = true;\n   string res = '{';\n   for (const auto &x : v) {\n     if (!first) {\n       res += ', ';\n     }\n     first = false;\n     res += to_string(x);\n   }\n   res += '}';\n   return res;\n }\n void debug_out() { cerr << endl; }\n template <typename Head, typename... Tail>\n void debug_out(Head H, Tail... T) {\n   cerr << ' ' << to_string(H);\n   debug_out(T...);\n }\n template <typename T, typename S>\n inline bool upmin(T &a, const S &b) {\n   return a > b ? a = b, 1 : 0;\n }\n template <typename T, typename S>\n inline bool upmax(T &a, const S &b) {\n   return a < b ? a = b, 1 : 0;\n }\n template <typename T>\n inline void in(T &x) {\n   x = 0;\n   T f = 1;\n   char ch = getchar();\n   while (!isdigit(ch)) {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (isdigit(ch)) {\n     x = x * 10 + ch - '0';\n     ch = getchar();\n   }\n   x *= f;\n }\n long long twop(int x) { return 1LL << x; }\n template <typename A, typename B>\n inline void in(A &x, B &y) {\n   in(x);\n   in(y);\n }\n template <typename A, typename B, typename C>\n inline void in(A &x, B &y, C &z) {\n   in(x);\n   in(y);\n   in(z);\n }\n template <typename A, typename B, typename C, typename D>\n inline void in(A &x, B &y, C &z, D &d) {\n   in(x);\n   in(y);\n   in(z);\n   in(d);\n }\n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }\n namespace SOLVE {\n int n, q;\n string s;\n int nxt[100010][26];\n int dp[255][255][255];\n vector<int> word[3];\n void solve(int i, int j, int k) {\n   dp[i][j][k] = inf;\n   if (i and dp[i - 1][j][k] <= n)\n     upmin(dp[i][j][k], nxt[dp[i - 1][j][k]][word[0][i]]);\n   if (j and dp[i][j - 1][k] <= n)\n     upmin(dp[i][j][k], nxt[dp[i][j - 1][k]][word[1][j]]);\n   if (k and dp[i][j][k - 1] <= n)\n     upmin(dp[i][j][k], nxt[dp[i][j][k - 1]][word[2][k]]);\n }\n void main() {\n   cin >> n >> q >> s;\n   for (long long i = 0; i < n; i++) s[i] -= 'a';\n   s = ' ' + s;\n   for (long long i = 0; i < 26; i++) nxt[n][i] = inf;\n   for (long long i = n - 1; i >= 0; i--) {\n     for (long long j = 0; j < 26; j++) nxt[i][j] = nxt[i + 1][j];\n     nxt[i][s[i + 1]] = i + 1;\n   }\n   for (long long i = 0; i < 3; i++) word[i].push_back(0);\n   dp[0][0][0] = 0;\n   while (q--) {\n     string op;\n     cin >> op;\n     int id;\n     cin >> id;\n     id--;\n     if (op == '+') {\n       string sss;\n       cin >> sss;\n       int ch = sss[0] - 'a';\n       word[id].push_back(ch);\n       if (id == 0) {\n         for (long long b = 0; b < ((int)word[1].size()); b++) {\n           for (long long c = 0; c < ((int)word[2].size()); c++) {\n             solve(((int)word[0].size()) - 1, b, c);\n           }\n         }\n       }\n       if (id == 1) {\n         for (long long b = 0; b < ((int)word[0].size()); b++) {\n           for (long long c = 0; c < ((int)word[2].size()); c++) {\n             solve(b, ((int)word[1].size()) - 1, c);\n           }\n         }\n       }\n       if (id == 2) {\n         for (long long b = 0; b < ((int)word[0].size()); b++) {\n           for (long long c = 0; c < ((int)word[1].size()); c++) {\n             solve(b, c, ((int)word[2].size()) - 1);\n           }\n         }\n       }\n     } else {\n       word[id].pop_back();\n     }\n     cout << ((dp[((int)word[0].size()) - 1][((int)word[1].size()) - 1]\n                 [((int)word[2].size()) - 1] <= n)\n                  ? 'YES'\n                  : 'NO')\n          << endl;\n   }\n }\n }  // namespace SOLVE\n signed main() {\n   int t;\n   t = 1;\n   while (t--) {\n     SOLVE::main();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int t;\n   cin >> t;\n   while (t--) {\n     long long int n;\n     cin >> n;\n     long long int a[n];\n     long long int sum = 0;\n     for (int i = 0; i < n; i++) {\n       cin >> a[i];\n       if (!(i & 1)) sum += a[i];\n     }\n     long long int best = 0;\n     long long int cur = 0;\n     long long int z, z1;\n     if (n & 1)\n       z = n - 1;\n     else\n       z = n;\n     for (int i = 0; i < z; i += 2) {\n       cur = max(0ll, cur + a[i + 1] - a[i]);\n       best = max(cur, best);\n     }\n     cur = 0;\n     if (!(n & 1))\n       z1 = n - 1;\n     else\n       z1 = n;\n     for (int i = 1; i < z1; i += 2) {\n       cur = max(0ll, cur + a[i] - a[i + 1]);\n       best = max(cur, best);\n     }\n     cout << sum + best << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 35000 + 10;\n const int MAXK = 55;\n int tree[MAXN << 2], info[MAXN << 2];\n int dp[MAXK][MAXN];\n int nums[MAXN];\n int pre[MAXN], cur[MAXN];\n void build(int node, int start, int end, int i) {\n   if (start == end) {\n     tree[node] = dp[i][start - 1];\n     info[node] = 0;\n     return;\n   }\n   int mid = (start + end) >> 1;\n   build((node << 1), start, mid, i);\n   build(((node << 1) | 1), mid + 1, end, i);\n   tree[node] = max(tree[(node << 1)], tree[((node << 1) | 1)]);\n   info[node] = 0;\n }\n void update(int node, int start, int end, int i, int j, int val) {\n   if (end < i || j < start) return;\n   if (i <= start && end <= j) {\n     tree[node] += val;\n     info[node] += val;\n     return;\n   }\n   int mid = (start + end) >> 1;\n   if (info[node] != 0) {\n     update((node << 1), start, mid, start, mid, info[node]);\n     update(((node << 1) | 1), mid + 1, end, mid + 1, end, info[node]);\n     info[node] = 0;\n   }\n   update((node << 1), start, mid, i, j, val);\n   update(((node << 1) | 1), mid + 1, end, i, j, val);\n   tree[node] = max(tree[(node << 1)], tree[((node << 1) | 1)]);\n }\n int query(int node, int start, int end, int i, int j) {\n   if (end < i || j < start) return INT_MIN;\n   if (i <= start && end <= j) {\n     return tree[node];\n   }\n   int mid = (start + end) >> 1;\n   if (info[node] != 0) {\n     update((node << 1), start, mid, start, mid, info[node]);\n     update(((node << 1) | 1), mid + 1, end, mid + 1, end, info[node]);\n     info[node] = 0;\n   }\n   return max(query((node << 1), start, mid, i, j),\n              query(((node << 1) | 1), mid + 1, end, i, j));\n }\n int main() {\n   int n, k;\n   cin >> n >> k;\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &nums[i]);\n     pre[i] = cur[nums[i]];\n     cur[nums[i]] = i;\n   }\n   for (int i = 1; i <= k; i++) {\n     build(1, 1, n, i - 1);\n     for (int j = i; j <= n; j++) {\n       update(1, 1, n, pre[j] + 1, j, 1);\n       dp[i][j] = query(1, 1, n, 1, j);\n     }\n   }\n   cout << dp[k][n] << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n typedef struct {\n   int x;\n   int y;\n   long long z;\n   long long o;\n } H;\n long long b, g, i, j, k, sz, t, p[200040], w[200040];\n int pv[200040];\n H e[400005];\n int C(H a, H b) { return a.x < b.x; }\n void BP(void);\n void S(void);\n long long dfs(int v);\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   for (cin >> t; t--;) {\n     S();\n     BP();\n     k++;\n     for (i = 0; i++ < k;) {\n       if (w[i] < 2 && !p[e[pv[i]].y]) {\n         dfs(pv[i]);\n         p[e[pv[i]].y] = 1;\n       }\n     }\n     for (b = g = i = 0; i < sz; i++) {\n       if (!e[i].o) {\n         if (w[e[i].y] < 2)\n           e[i].o = 1;\n         else\n           e[i].o = k - 1;\n       }\n       if (e[i].o * 2 < k || e[i].o * 2 == k && e[i].x < e[i].y) {\n         g += e[i].o % 2 * e[i].z;\n         b += e[i].o * e[i].z;\n       }\n     }\n     cout << g << ' ' << b << '\n';\n     for (i = 0; i++ < k + 1;) p[i] = pv[i] = w[i] = 0;\n     for (i = 0; i < sz + 1; i++) e[i].o = 0;\n   }\n }\n void BP(void) {\n   for (int i = 0; ++i < sz;) {\n     if (e[i].x > e[i - 1].x) {\n       for (int j = e[i - 1].x; j++ < e[i].x;) {\n         pv[j] = i;\n       }\n     }\n   }\n   for (int j = e[sz - 1].x; j++ < k + 2;) pv[j] = sz;\n }\n void S(void) {\n   cin >> k;\n   k = 2 * k - 1;\n   for (int i = 0; i < k; i++) {\n     cin >> e[i].x >> e[i].y >> e[i].z;\n     e[i + k].x = e[i].y;\n     e[i + k].y = e[i].x;\n     e[i + k].z = e[i].z;\n     w[e[i].x]++;\n     w[e[i].y]++;\n   }\n   sz = 2 * k;\n   sort(e, e + sz, C);\n }\n long long dfs(int v) {\n   long long s = 0;\n   if (e[v].o) return e[v].o;\n   for (int i = pv[e[v].y]; i < pv[e[v].y + 1]; i++) {\n     if (e[i].y != e[v].x) s += dfs(i);\n   }\n   return e[v].o = s + 1;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a, b;\n   cin >> a >> b;\n   if ((a >= 0 && b < 0) || (a < 0 && b >= 0)) {\n     cout << '-1';\n     return 0;\n   }\n   if (a == 0 && b == 0) {\n     cout << '-1';\n     return 0;\n   }\n   if (a < 0 && b < 0) {\n     cout << '-1';\n     return 0;\n   }\n   if (b == 0 && a > 0) {\n     cout << '-1';\n     return 0;\n   }\n   if (a == b) {\n     cout << a;\n     return 0;\n   }\n   if (a > 0 && b > 0) {\n     if (b > a) {\n       cout << '-1';\n       return 0;\n     } else {\n       int k1 = (a - b) / (2 * b);\n       double x1 = (double)(a - b) / (2 * k1);\n       int k2 = (a + b) / (2 * b);\n       double x2 = (double)(a + b) / (2 * k2);\n       cout << setprecision(10) << min(x1, x2);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int fr[301][301];\n   int al[301];\n   int i, j, n;\n   cin >> n;\n   for (i = 1; i <= n; ++i)\n     for (j = 1; j <= n; ++j) cin >> fr[i][j];\n   for (i = 1; i <= n; ++i) cin >> al[i];\n   int k, best[301], best_time[301], cur;\n   for (j = 1; j <= n; ++j) {\n     best[j] = 301;\n     best_time[j] = 301;\n     for (i = 1; i <= n; ++i) {\n       if (j == 1 && i == 1) continue;\n       for (k = 1; k <= n; ++k)\n         if (al[k] <= i && al[k] != j) {\n           cur = al[k];\n           break;\n         }\n       for (k = 1; k <= n; ++k) {\n         if (cur == fr[j][k]) {\n           if (k < best[j]) {\n             best[j] = k;\n             best_time[j] = i;\n           }\n           break;\n         }\n       }\n     }\n   }\n   for (i = 1; i <= n; ++i) cout << best_time[i] << '\t';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int x = 0, xi = INT_MIN, q = 0;\n   vector<int> v;\n   for (int i = 0; i < n; i++) {\n     int y;\n     cin >> y;\n     q = x;\n     v.push_back(y);\n     xi = max(x, v[i]);\n     if (x != q) x = i;\n   }\n   long long ans = 0;\n   for (int i = 0; i < n; i++) {\n     int z = (abs(x - i) + i + x) * 2;\n     ans += (z * v[i]);\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int min(int _a, int _b) { return _a < _b ? _a : _b; }\n inline int max(int _a, int _b) { return _a > _b ? _a : _b; }\n template <class _T>\n inline void rd(_T &_a) {\n   int _f = 0, _ch = getchar();\n   _a = 0;\n   while (_ch < '0' || _ch > '9') {\n     if (_ch == '-') _f = 1;\n     _ch = getchar();\n   }\n   while (_ch >= '0' && _ch <= '9') _a = _a * 10 + _ch - '0', _ch = getchar();\n   if (_f) _a = -_a;\n }\n const int inf = 0x3f3f3f3f;\n const double eps = 1e-8;\n const int mod = 1e9 + 7, N = 15;\n int mp[N][N], f[N][N], ct[N], n, m, k, ans;\n void dfs(int x, int y) {\n   if (y > m) x++, y = 1;\n   if (x > n) {\n     ans++;\n     ans %= mod;\n     return;\n   }\n   int st = f[x - 1][y] | f[x][y - 1], pre, d = -1;\n   if (n + m - x - y + 1 > k - __builtin_popcount(st)) return;\n   for (int i = 1; i <= k; i++)\n     if (!(st >> i - 1 & 1) && (!mp[x][y] || mp[x][y] == i)) {\n       f[x][y] = st | (1 << i - 1);\n       ct[i]++;\n       if (ct[i] == 1) {\n         if (~d)\n           ans += d;\n         else {\n           pre = ans;\n           dfs(x, y + 1);\n           d = ans - pre;\n         }\n       } else\n         dfs(x, y + 1);\n       ans %= mod;\n       ct[i]--;\n     }\n }\n int main() {\n   rd(n);\n   rd(m);\n   rd(k);\n   if (n + m - 1 > k) return puts('0'), 0;\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) {\n       rd(mp[i][j]);\n       if (mp[i][j]) ct[mp[i][j]]++;\n     }\n   dfs(1, 1);\n   printf('%d', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a, b, n, m;\n int A[100010], B[100010], L[100010];\n double dis(int a, int b, int c, int d) {\n   return sqrt(\n       double((a - c + 0.0) * (a - c + 0.0) + (b - d + 0.0) * (b - d + 0.0)));\n }\n double getK(int y) { return 1.0 * y * a / (b * 1.0); }\n int find(double xx) {\n   int x = xx;\n   return upper_bound(A, A + n, x) - A;\n }\n int main() {\n   int ll, rr, id;\n   double ans = 0, tmp;\n   scanf('%d%d%d%d', &n, &m, &a, &b);\n   for (int i = 0; i < n; i++) scanf('%d', A + i);\n   for (int i = 0; i < m; i++) scanf('%d', B + i);\n   for (int i = 0; i < m; i++) scanf('%d', L + i);\n   ll = rr = 0;\n   ans = dis(0, 0, a, A[0]) + dis(a, A[0], b, B[0]) + L[0];\n   for (int i = 0; i < m; i++) {\n     double k = getK(B[i]);\n     id = find(k);\n     id = max(0, id - 2);\n     for (int j = id; j < n && j <= id + 4; j++) {\n       tmp = dis(0, 0, a, A[j]) + dis(a, A[j], b, B[i]) + 1.0 * L[i];\n       if (tmp < ans) ans = tmp, ll = j, rr = i;\n     }\n   }\n   printf('%d %d\n', ll + 1, rr + 1);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int base(long long int n, long long int k) {\n   string res = '';\n   long long int temp = 0, i;\n   while (n >= k) {\n     res += to_string(n % k);\n     n /= k;\n   }\n   res += to_string(n);\n   reverse(res.begin(), res.end());\n   for (i = 0; i < res.length(); i++) {\n     temp = temp * 10 + (res[i] - '0');\n   }\n   return temp;\n }\n int main() {\n   long long int n, i, j, flag = 0;\n   cin >> n;\n   flag = 9;\n   for (i = 1; i <= n - 1; i++) {\n     for (j = 1; j <= n - 1; j++) {\n       cout << base(i * j, n) << ' ';\n     }\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXM = 2e5 + 3, MAXN = 2e5 + 3, MAXQ = 2e5 + 3, MAXC = 2e5 + 3,\n           ADD = 1 << 18;\n int n, m, q;\n int edge_from[MAXM << 1], edge_to[MAXM << 1], edge_nex[MAXM << 1];\n int cntm = 1, head[MAXN];\n void link(int from, int to) {\n   edge_from[++cntm] = from;\n   edge_to[cntm] = to;\n   edge_nex[cntm] = head[from];\n   head[from] = cntm;\n }\n bool isb[MAXM << 1];\n int edge1_to[MAXC << 1], edge1_nex[MAXC << 1];\n int cntm1 = 0, head1[MAXC];\n void link1(int from, int to) {\n   edge1_to[++cntm1] = to;\n   edge1_nex[cntm1] = head1[from];\n   head1[from] = cntm1;\n }\n int dfn[MAXN], low[MAXN], cntd = 0;\n void tarjan(int now, int fa) {\n   low[now] = dfn[now] = ++cntd;\n   for (int i = head[now]; i; i = edge_nex[i]) {\n     if ((i ^ 1) == fa) continue;\n     if (!dfn[edge_to[i]]) {\n       tarjan(edge_to[i], i);\n       if (low[edge_to[i]] > low[now]) {\n         isb[i] = isb[i ^ 1] = 1;\n       } else {\n         low[now] = low[edge_to[i]];\n       }\n     } else {\n       low[now] = min(low[now], low[edge_to[i]]);\n     }\n   }\n }\n int col[MAXN], cntc = 0, Fa[MAXC][23], Deep[MAXC], cntd1 = 0;\n void dfs(int now) {\n   col[now] = cntc;\n   for (int i = head[now]; i; i = edge_nex[i])\n     if (!col[edge_to[i]] && !isb[i]) dfs(edge_to[i]);\n }\n void dfs2(int now) {\n   for (int i = head1[now]; i; i = edge1_nex[i]) {\n     if (!Deep[edge1_to[i]] && edge1_to[i] != Fa[now][0]) {\n       Fa[edge1_to[i]][0] = now;\n       Deep[edge1_to[i]] = Deep[now] + 1;\n       dfs2(edge1_to[i]);\n     }\n   }\n }\n long long val1[MAXN];\n long long sum1;\n bool Arr[MAXN];\n int ans = 1;\n void dfs3(int now) {\n   if (!ans) return;\n   Arr[now] = 1;\n   long long in1 = sum1;\n   sum1 += val1[now];\n   for (int i = head1[now]; i; i = edge1_nex[i])\n     if (!Arr[edge1_to[i]] && ans) dfs3(edge1_to[i]);\n   in1 = sum1 - in1;\n   if ((in1 >> 18) && in1 - ((in1 >> 18) << 18)) ans = 0;\n }\n inline int lca(register int A, register int B) {\n   if (Deep[A] < Deep[B]) swap(A, B);\n   for (int i = 17; i >= 0; i--) {\n     if (Deep[Fa[A][i]] >= Deep[B]) A = Fa[A][i];\n   }\n   if (A == B) return A;\n   for (int i = 17; i >= 0; i--) {\n     if (Fa[A][i] != Fa[B][i]) {\n       A = Fa[A][i];\n       B = Fa[B][i];\n     }\n   }\n   if (Fa[A][0] == Fa[B][0] && Fa[A][0] != 0) return Fa[A][0];\n   return -1;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> n >> m >> q;\n   for (int i = 1, U, V; i <= m; i++) {\n     cin >> U >> V;\n     link(U, V);\n     link(V, U);\n   }\n   for (int i = 1; i <= n; i++)\n     if (!dfn[i]) tarjan(i, 0);\n   for (int i = 1; i <= n; i++)\n     if (!col[i]) {\n       cntc++;\n       dfs(i);\n     }\n   for (int i = 2; i <= cntm; i++)\n     if (isb[i]) link1(col[edge_from[i]], col[edge_to[i]]);\n   for (int i = 1; i <= cntc; i++)\n     if (!Deep[i]) {\n       Deep[i] = 1;\n       dfs2(i);\n     }\n   for (int i = 1; i <= 17; i++)\n     for (int j = 1; j <= cntc; j++) Fa[j][i] = Fa[Fa[j][i - 1]][i - 1];\n   for (int i = 1, i2, i3, i4; i <= q; i++) {\n     cin >> i2 >> i3;\n     i2 = col[i2];\n     i3 = col[i3];\n     if (i2 == i3) continue;\n     i4 = lca(i2, i3);\n     if (i4 == -1) {\n       ans = 0;\n       break;\n     }\n     val1[i2] += 1;\n     val1[i4] -= 1;\n     val1[i3] += ADD;\n     val1[i4] -= ADD;\n   }\n   for (int i = 1; i <= cntc; i++)\n     if (!Arr[i]) dfs3(i);\n   if (ans)\n     cout << 'Yes';\n   else\n     cout << 'No';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int adj[205][205];\n int rgraph[205][205];\n int n, m;\n int parent[205];\n bool visited[205];\n int a[105];\n int b[105];\n bool bfs(int s, int t) {\n   memset(visited, 0, sizeof(visited));\n   queue<int> q;\n   q.push(s);\n   visited[s] = true;\n   parent[s] = -1;\n   while (!q.empty()) {\n     int u = q.front();\n     q.pop();\n     for (int i = 0; i <= 2 * n + 1; i++) {\n       if (!visited[i] && rgraph[u][i] > 0) {\n         q.push(i);\n         parent[i] = u;\n         visited[i] = true;\n       }\n     }\n   }\n   return visited[t] == true;\n }\n int solve(int s, int t) {\n   for (int i = 0; i <= 2 * n + 1; i++) {\n     for (int j = 0; j <= 2 * n + 1; j++) {\n       rgraph[i][j] = adj[i][j];\n     }\n   }\n   int max_flow = 0;\n   while (bfs(0, 2 * n + 1)) {\n     int path = 2000000000;\n     for (int i = t; i != s; i = parent[i]) {\n       int u = parent[i];\n       path = min(path, rgraph[u][i]);\n     }\n     for (int i = t; i != s; i = parent[i]) {\n       int u = parent[i];\n       rgraph[u][i] -= path;\n       rgraph[i][u] += path;\n     }\n     max_flow += path;\n   }\n   return max_flow;\n }\n int main() {\n   cin >> n >> m;\n   int suma = 0, sumb = 0;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n     adj[0][i] = a[i];\n     suma += a[i];\n   }\n   for (int i = 1; i <= n; i++) {\n     cin >> b[i];\n     adj[n + i][2 * n + 1] = b[i];\n     sumb += b[i];\n     adj[i][n + i] = 1000000;\n   }\n   for (int i = 0; i < m; i++) {\n     int c, d;\n     cin >> c >> d;\n     adj[c][n + d] = 1000000;\n     adj[d][n + c] = 1000000;\n   }\n   int ans = solve(0, 2 * n + 1);\n   if (ans == suma && ans == sumb) {\n     printf('YES\n');\n     for (int i = 1; i <= n; i++) {\n       for (int j = 1; j <= n; j++) {\n         if (rgraph[i][n + j] != 0)\n           printf('%d ', 1000000 - rgraph[i][n + j]);\n         else\n           printf('%d ', rgraph[i][n + j]);\n       }\n       printf('\n');\n     }\n   } else {\n     printf('NO\n');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long t;\n   t = 1;\n   for (long long test = 1; test <= t; test++) {\n     long long n;\n     cin >> n;\n     vector<long long> a;\n     for (long long i = 0; i <= n - 1; i++) {\n       long long x;\n       cin >> x;\n       if (x != 0) a.push_back(x);\n     }\n     long long bits[61] = {0};\n     n = a.size();\n     for (long long i = 0; i <= n - 1; i++) {\n       long long temp = a[i];\n       long long j = 0;\n       while (temp > 0) {\n         if (temp & 1) bits[j]++;\n         temp = temp >> 1;\n         j++;\n       }\n     }\n     for (long long i = 0; i <= 60; i++)\n       if (bits[i] >= 3) {\n         cout << 3;\n         exit(0);\n       }\n     long long cyclec = -1;\n     vector<vector<long long>> adj(n);\n     for (long long i = 0; i < n; i++)\n       for (long long j = i + 1; j < n; j++)\n         if ((a[i] & a[j]) != 0) {\n           adj[i].push_back(j);\n           adj[j].push_back(i);\n         }\n     for (long long i = 0; i <= n - 1; i++)\n       if (adj[i].size() != 0) {\n         vector<long long> dis(n, -1);\n         vector<long long> par(n, -1);\n         queue<long long> q;\n         q.push(i);\n         dis[i] = 0;\n         par[i] = -1;\n         while (!q.empty()) {\n           auto x = q.front();\n           q.pop();\n           for (auto y : adj[x])\n             if (dis[y] == -1) {\n               dis[y] = 1 + dis[x];\n               par[y] = x;\n               q.push(y);\n             } else if (y != par[x]) {\n               if (cyclec == -1)\n                 cyclec = (dis[y] + dis[x] + 1);\n               else\n                 cyclec = min(cyclec, dis[y] + dis[x] + 1);\n             }\n         }\n       }\n     cout << cyclec;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 200001;\n std::vector<long long> g[N];\n long long s[N];\n long long h[N];\n long long a[N] = {0};\n bool visited[N] = {false};\n void dfs1(long long n, long long parent, long long depth) {\n   h[n] = depth;\n   for (long long v : g[n]) {\n     if (v != parent) {\n       dfs1(v, n, depth + 1);\n     }\n   }\n }\n void dfs2(long long n, long long parent) {\n   if (h[n] % 2 == 0) {\n     for (long long v : g[n]) {\n       if (v != parent) {\n         a[n] = s[v] - s[parent];\n       }\n     }\n     for (long long v : g[n]) {\n       if (v != parent) {\n         a[n] = min(s[v] - s[parent], a[n]);\n       }\n     }\n     s[n] = a[n] + s[parent];\n   } else {\n     a[n] = s[n] - s[parent];\n   }\n   for (long long v : g[n]) {\n     if (v != parent) {\n       dfs2(v, n);\n     }\n   }\n }\n int main() {\n   long long n;\n   cin >> n;\n   for (long long i = 2; i <= n; i++) {\n     long long parent;\n     cin >> parent;\n     g[parent].push_back(i);\n     g[i].push_back(parent);\n   }\n   for (long long i = 1; i <= n; i++) {\n     cin >> s[i];\n   }\n   dfs1(1, -1, 1);\n   a[1] = s[1];\n   dfs2(1, n + 1);\n   long long sum = 0;\n   for (long long i = 1; i <= n; i++) {\n     if (a[i] < 0) {\n       cout << '-1' << endl;\n       return 0;\n     }\n     sum += a[i];\n   }\n   cout << sum << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n template <typename C>\n int sz(const C &c) {\n   return c.size();\n }\n using namespace std;\n int main() {\n   iostream::sync_with_stdio(false);\n   int64_t n;\n   cin >> n;\n   int k;\n   cin >> k;\n   int64_t maxV = 0;\n   int maxI = 1;\n   int64_t maxC = 0;\n   for (int i = 1; i <= k; ++i) {\n     int64_t a;\n     cin >> a;\n     if (a * (n / a) > maxV) {\n       maxV = a * (n / a);\n       maxI = i;\n       maxC = n / a;\n     }\n   }\n   cout << maxI << ' ' << maxC << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[10], rest[10];\n int n, res = 1e9, pre[10], tmp, size[10], flag = 0;\n vector<int> ve[10];\n map<long long, long long> mp;\n int count(long long x) {\n   if (mp[x]) return mp[x];\n   long long tmp = x;\n   long long res = 0;\n   for (long long i = 2; i * i <= x; i++) {\n     if (x % i == 0) {\n       while (x % i == 0) {\n         x /= i;\n         res++;\n       }\n     }\n   }\n   if (x > 1) res++;\n   return mp[tmp] = res;\n }\n bool prime(long long x) {\n   if (x == 2 || x == 3) return true;\n   for (long long i = 2; i * i <= x; i++)\n     if (x % i == 0) return false;\n   return true;\n }\n int isprime[10] = {0};\n void cal(int now) {\n   tmp++;\n   if (size[now] == 0) {\n     if (!isprime[now]) tmp += count(a[now]);\n     return;\n   }\n   if (now) {\n     if (rest[now]) tmp += count(rest[now]);\n   }\n   for (int i = 0; i < size[now]; i++) {\n     cal(ve[now][i]);\n     if (flag) return;\n   }\n }\n void dfs(int pos) {\n   if (pos == n + 1) {\n     tmp = 0;\n     flag = 0;\n     for (int i = 0; i <= n; i++) {\n       ve[i].clear();\n       size[i] = 0;\n     }\n     for (int i = 1; i <= n; i++) {\n       size[pre[i]]++;\n       ve[pre[i]].push_back(i);\n     }\n     cal(0);\n     if (size[0] == 1) {\n       tmp -= 1;\n     }\n     if (flag) tmp = 1e9;\n     if (tmp < res) {\n       res = tmp;\n     }\n     return;\n   }\n   for (int i = 0; i < pos; i++) {\n     if (i && rest[i] % a[pos]) continue;\n     rest[i] = rest[i] / a[pos];\n     pre[pos] = i;\n     dfs(pos + 1);\n     rest[i] *= a[pos];\n   }\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) scanf('%lld', a + i);\n   sort(a + 1, a + n + 1, greater<long long>());\n   for (int i = 1; i <= n; i++) {\n     rest[i] = a[i];\n     if (prime(a[i])) isprime[i] = 1;\n   }\n   dfs(1);\n   printf('%d\n', res);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, INF = 2e9;\n vector<vector<int>> value;\n void shift_column(int j, int k) {\n   vector<int> res(n);\n   for (int i = 0; i < n; i++) res[(i - k + n) % n] = value[i][j];\n   for (int i = 0; i < n; i++) value[i][j] = res[i];\n }\n void run() {\n   cin >> n >> m;\n   value.resize(n, vector<int>(m));\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       cin >> value[i][j];\n     }\n   }\n   int ans = 0;\n   for (int j = 0; j < m; j++) {\n     map<int, int> pos;\n     vector<int> cnt(n);\n     for (int i = 0; i < n; i++) pos[1 + j + i * m] = i;\n     for (int i = 0; i < n; i++) {\n       if (pos.find(value[i][j]) == pos.end()) continue;\n       int shift = (i - pos[value[i][j]] + n) % n;\n       cnt[shift]++;\n     }\n     auto best_shift =\n         distance(cnt.begin(), max_element(cnt.begin(), cnt.end()));\n     shift_column(j, best_shift);\n     int best_add = INF;\n     for (int i = 0; i < n; i++) best_add = min(best_add, n - cnt[i] + i);\n     ans += best_add;\n   }\n   cout << ans;\n }\n signed main() {\n   cout.setf(ios::fixed);\n   cout.precision(10);\n   cin.tie(0);\n   cout.tie(0);\n   ios::sync_with_stdio(0);\n   run();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, a[300100], b[300100], pos[300100];\n vector<pair<int, int> > ans;\n inline void ws(int xx, int yy) { ans.push_back(make_pair(xx, yy)); }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &a[i]);\n     pos[a[i]] = i;\n   }\n   if (a[1] != 1) {\n     int p = pos[1];\n     int x = a[1];\n     if (p - 1 >= n / 2) {\n       ws(1, p);\n       a[1] = 1;\n       pos[1] = 1;\n       pos[x] = p;\n       a[p] = x;\n     } else if (n - p >= n / 2) {\n       ws(p, n);\n       ws(1, n);\n       ws(p, n);\n       a[1] = 1;\n       pos[1] = 1;\n       pos[x] = p;\n       a[p] = x;\n     }\n   }\n   if (a[n] != n) {\n     int p = pos[n];\n     int x = a[1];\n     int z = a[n];\n     if (p - 1 >= n / 2) {\n       ws(1, p);\n       ws(1, n);\n       ws(1, p);\n       a[p] = z;\n       pos[z] = p;\n       pos[n] = n;\n       a[n] = n;\n     } else if (n - p >= n / 2) {\n       ws(p, n);\n       a[p] = z;\n       pos[z] = p;\n       pos[n] = n;\n       a[n] = n;\n     }\n   }\n   for (int i = 2; i < n; ++i) {\n     if (pos[i] == i) continue;\n     int p = pos[i];\n     int x = a[1];\n     int y = a[i];\n     int z = a[n];\n     if (p - 1 >= n / 2 && i - 1 >= n / 2) {\n       ws(1, p);\n       ws(1, i);\n       ws(1, p);\n       swap(a[i], a[pos[i]]);\n       pos[y] = p;\n       pos[i] = i;\n     } else if (p - 1 >= n / 2 && n - i >= n / 2) {\n       ws(1, p);\n       ws(1, n);\n       ws(i, n);\n       ws(1, n);\n       ws(1, p);\n       swap(a[i], a[p]);\n       pos[y] = p;\n       pos[i] = i;\n     } else if (n - p >= n / 2 && i - 1 >= n / 2) {\n       ws(p, n);\n       ws(1, n);\n       ws(1, i);\n       ws(1, n);\n       ws(p, n);\n       swap(a[i], a[p]);\n       pos[y] = p;\n       pos[i] = i;\n     } else if (n - p >= n / 2 && n - i >= n / 2) {\n       ws(p, n);\n       ws(i, n);\n       ws(p, n);\n       swap(a[i], a[p]);\n       pos[y] = p;\n       pos[i] = i;\n     }\n   }\n   printf('%d\n', ans.size());\n   for (int i = 0; i < ans.size(); ++i) {\n     printf('%d %d\n', ans[i].first, ans[i].second);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC optimize('no-stack-protector')\n #pragma GCC optimize('unroll-loops')\n #pragma GCC target('sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native')\n #pragma GCC optimize('fast-math')\n using namespace std;\n inline void ForSpeed() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n }\n const int MAXN = int(1e5 + 5);\n const int inf = 1e9 + 7;\n const int MOD = 998244353;\n const long long INF = (1e18 + 7);\n long long b, k, a[MAXN];\n int main() {\n   ForSpeed();\n   cin >> b >> k;\n   for (int i = 0; i < k; i++) {\n     cin >> a[i];\n   }\n   if (k == 1) {\n     if (a[0] % 2 != 0 && b % 2 != 0) {\n       cout << 'odd';\n       return 0;\n     }\n   }\n   if (b % 2 == 0 && a[k - 1] % 2 == 0) {\n     cout << 'even';\n     return 0;\n   } else if (b % 2 == 0 && a[k - 1] % 2 != 0) {\n     cout << 'odd';\n     return 0;\n   }\n   long long ch = 0;\n   if (a[0] % 2 == 0) {\n     ch = 1;\n   }\n   for (int i = 1; i < k - 1; i++) {\n     if (ch == 0 && a[i] % 2 != 0) {\n       ch = 1;\n     } else if (ch == 1 && a[i] % 2 == 0) {\n       continue;\n     } else {\n       ch = 0;\n     }\n   }\n   if (ch == 1 && a[k - 1] % 2 == 0) {\n     cout << 'even';\n   } else if (ch == 0 && a[k - 1] % 2 != 0) {\n     cout << 'even';\n   } else {\n     cout << 'odd';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod =  1000000007;\n const int LIM = 100005;\n #define int long long\n #define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)\n #define mem(a,b) memset(a,b,sizeof(a))\n #define all(a) a.begin() , a.end()\n #define pii pair<int,int>\n #define vi vector<int>\n #define endl '\n'\n #define pb push_back\n #define sp <<' '<<\n #define ss second\n #define ff first\n int power(int x, int n){\n     int res = 1;\n     while(n){\n           if(n&1){\n                 res = res * x % mod;\n           }\n           x = x * x % mod;\n           n>>=1;\n     }\n     return (res%mod);\n }\n /*bool prime[1000006];\n void sieve(int n)\n {\n       memset(prime, true, sizeof(prime));\n       int rootn = (int)sqrt(n);\n       for (int p = 2; p <= rootn; p++)\n             if(prime[p] == true)\n                   for(int i = p*p; i <= n; i += p)\n                         prime[i] = false;\n       prime[1] = 0;\n \n }*/\n /*\n int fac[300005];\n int ncr(int n,int r)\n {\n       return fac[n]*((power(fac[n-r], mod-2)*power(fac[r], mod-2))%mod)%mod;\n }\n */\n bool check(int a[],int n)\n {\n 	for(int i=1;i<n;i++)\n 	{\n 		if(a[i]<a[i-1])return false;\n 	}\n 	return true;\n }\n \n int32_t main()\n {\n   IOS;\n   int tt=1,n,x,k,y,z,i,j;\n   cin>>tt;\n   while(tt--){\n     cin>>n>>x;\n 		int a[n];\n 		for(int i=0;i<n;i++)\n 		{\n 			cin>>a[i];\n 		}\n 		int ans=0;\n 		for(int i=0;i<=n;i++)\n 		{\n 			if(check(a,n))break;\n 			ans++;\n 			for(int j=0;j<n;j++)\n 			{\n 				if(a[j]>x)\n 				{\n 					swap(a[j],x);\n 					break;\n 				}\n 			}\n 		}\n 		if(check(a,n))cout<<ans<<endl;\n 		else cout<<-1<<endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool debug = 0;\n int n, m, k;\n int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\n string direc = 'RDLU';\n long long ln, lk, lm;\n void etp(bool f = 0) {\n   puts(f ? 'YES' : 'NO');\n   exit(0);\n }\n void addmod(int &x, int y, int mod = 1000000007) {\n   assert(y >= 0);\n   x += y;\n   if (x >= mod) x -= mod;\n   assert(x >= 0 && x < mod);\n }\n void et() {\n   puts('-1');\n   exit(0);\n }\n long long fastPow(long long x, long long y, int mod = 1000000007) {\n   long long ans = 1;\n   while (y > 0) {\n     if (y & 1) ans = (x * ans) % mod;\n     x = x * x % mod;\n     y >>= 1;\n   }\n   return ans;\n }\n long long gcd1(long long x, long long y) {\n   long long z = y;\n   while (x % y != 0) {\n     z = x % y;\n     x = y;\n     y = z;\n   }\n   return z;\n }\n int h, u[100005], dp[100005];\n vector<int> mp[100005];\n set<pair<int, int> > cs;\n void add(int x, int y) {\n   if (cs.count({x, y})) return;\n   cs.insert({x, y});\n   mp[x].push_back(y);\n }\n int dfn[100005], sta[100005], low[100005], color, ii, cnt, belong[100005];\n bool ins[100005];\n int sz[100005];\n void tarjan(int x) {\n   dfn[x] = low[x] = ++ii;\n   sta[++cnt] = x;\n   ins[x] = 1;\n   for (auto child : mp[x]) {\n     if (!dfn[child]) {\n       tarjan(child);\n       low[x] = min(low[x], low[child]);\n     } else if (ins[child]) {\n       low[x] = min(low[x], dfn[child]);\n     }\n   }\n   if (dfn[x] == low[x]) {\n     ++color;\n     int t;\n     do {\n       t = sta[cnt];\n       cnt--;\n       ins[t] = 0;\n       belong[t] = color;\n       sz[color]++;\n     } while (dfn[t] != low[t]);\n   }\n }\n bool del[100005];\n void fmain(int ID) {\n   scanf('%d%d%d', &n, &m, &h);\n   for (int(i) = 1; (i) <= (int)(n); (i)++) {\n     scanf('%d', u + i);\n   }\n   for (int(i) = 1; (i) <= (int)(m); (i)++) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     if ((u[x] + 1) % h == u[y]) add(x, y);\n     if ((u[y] + 1) % h == u[x]) add(y, x);\n   }\n   for (int(i) = 1; (i) <= (int)(n); (i)++)\n     if (belong[i] == 0) tarjan(i);\n   for (auto p : cs) {\n     int x = belong[p.first], y = belong[p.second];\n     if (x == y) continue;\n     del[x] = 1;\n   }\n   int ans = -1;\n   for (int(i) = 1; (i) <= (int)(color); (i)++)\n     if (!del[i]) {\n       if (ans == -1 || sz[ans] > sz[i]) ans = i;\n     }\n   printf('%d\n', sz[ans]);\n   for (int(i) = 1; (i) <= (int)(n); (i)++)\n     if (belong[i] == ans) printf('%d ', i);\n }\n int main() {\n   int t = 1;\n   for (int(i) = 1; (i) <= (int)(t); (i)++) {\n     fmain(i);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 10, V = 1e5;\n inline int read() {\n   register int x = 0, f = 0;\n   register char c = getchar();\n   while (c < '0' || c > '9') f |= c == '-', c = getchar();\n   while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0', c = getchar();\n   return f ? -x : x;\n }\n int n, tot, top;\n struct point {\n   int x, y;\n } p[N * 10], s[N * 10];\n point operator-(const point &A, const point &B) {\n   return (point){A.x - B.x, A.y - B.y};\n }\n inline void add(int x, int y) {\n   p[++tot].x = x;\n   p[tot].y = y;\n }\n inline double accross(point A, point B) {\n   return (double)A.x * B.y - (double)A.y * B.x;\n }\n inline double dis(point A, point B) {\n   return (double)(A.x - B.x) * (A.x - B.x) + (double)(A.y - B.y) * (A.y - B.y);\n }\n inline bool cmp1(const point &A, const point &B) {\n   return A.x == B.x ? A.y < B.y : A.x < B.x;\n }\n inline bool cmp2(const point &A, const point &B) {\n   return A.x == B.x && A.y == B.y;\n }\n inline bool cmp3(const point &A, const point &B) {\n   double res = accross(A - p[1], B - p[1]);\n   if (res > 0)\n     return true;\n   else if (res == 0 && dis(A, p[1]) < dis(B, p[1]))\n     return true;\n   return false;\n }\n void Get_TB() {\n   for (int i = 2; i <= tot; ++i)\n     if (p[1].y > p[i].y || (p[1].y == p[i].y && p[1].x > p[i].x))\n       swap(p[i], p[1]);\n   sort(p + 2, p + tot + 1, cmp3);\n   s[1] = p[1];\n   s[2] = p[2];\n   top = 2;\n   for (int i = 3; i <= tot; ++i) {\n     while (top > 1 && accross(p[i] - s[top - 1], s[top] - s[top - 1]) >= 0)\n       top--;\n     s[++top] = p[i];\n   }\n   return;\n }\n inline double len(point &A) {\n   return sqrt((double)A.x * A.x + (double)A.y * A.y);\n }\n double calc(point A, point B, point C) {\n   point x = A - B, y = C - B, z = C - A;\n   double res = len(x) * len(y) * len(z) / (accross(y, x) * 2);\n   return res;\n }\n int main() {\n   n = read();\n   for (int i = 1; i <= n; ++i) {\n     int x = read(), y = read(), v = read();\n     if (x < v)\n       add(0, min(V, y + v - x)), add(0, max(0, y - v + x));\n     else\n       add(x - v, y);\n     if (y < v)\n       add(max(0, x - v + y), 0), add(min(V, x + v - y), 0);\n     else\n       add(x, y - v);\n     if (x + v > V)\n       add(V, min(V, y + x + v - V)), add(V, max(0, y - x - v + V));\n     else\n       add(x + v, y);\n     if (y + v > V)\n       add(min(V, x + y + v - V), V), add(max(0, x - y - v + V), V);\n     else\n       add(x, y + v);\n   }\n   sort(p + 1, p + 1 + tot, cmp1);\n   tot = unique(p + 1, p + 1 + tot, cmp2) - p - 1;\n   Get_TB();\n   int id = 0;\n   double ans = -1e9, tmp;\n   s[0] = s[top];\n   s[top + 1] = s[1];\n   for (int i = 1; i <= top; ++i) {\n     point a = s[i - 1], b = s[i], c = s[i + 1];\n     if ((tmp = calc(a, b, c)) > ans) ans = tmp, id = i;\n   }\n   cout << s[id - 1].x << ' ' << s[id - 1].y << '\n';\n   cout << s[id].x << ' ' << s[id].y << '\n';\n   cout << s[id + 1].x << ' ' << s[id + 1].y << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void init() { freopen('input.txt', 'r', stdin); }\n int abs(int x) {\n   if (x < 0) {\n     return -x;\n   }\n   return x;\n }\n int main() {\n   int n, m, x1, y1, x2, y2;\n   cin >> n >> m >> x1 >> y1 >> x2 >> y2;\n   n = abs(x1 - x2) + 1;\n   m = abs(y1 - y2) + 1;\n   if ((n >= 6) || (m >= 6)) {\n     cout << 'Second';\n     return 0;\n   }\n   if ((n <= 4) && (m <= 4)) {\n     cout << 'First';\n     return 0;\n   }\n   if (((n == 5) || (n == 4)) && ((m == 5) || (m == 4))) {\n     cout << 'Second';\n     return 0;\n   }\n   cout << 'First' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(long long a, int b) {\n   if (a < b) {\n     return gcd(b, a);\n   }\n   if (b == 0) {\n     return a;\n   }\n   return gcd(b, a % b);\n }\n class Triplet {\n  public:\n   long long gcd;\n   long long x;\n   long long y;\n };\n Triplet gcdExtendedEuclid(int a, int b) {\n   if (b == 0) {\n     Triplet myAns;\n     myAns.gcd = a;\n     myAns.x = 1;\n     myAns.y = 0;\n     return myAns;\n   }\n   Triplet smallAns = gcdExtendedEuclid(b, a % b);\n   Triplet myAns;\n   myAns.gcd = smallAns.gcd;\n   myAns.x = smallAns.y;\n   myAns.y = (smallAns.x - ((a / b) * (smallAns.y)));\n   return myAns;\n }\n long long modInverse(int A, int M) {\n   Triplet ans = gcdExtendedEuclid(A, M);\n   return ans.x;\n }\n bool check(vector<long long>& v1, long long val, long long h) {\n   long long ans = 0;\n   for (long long i = 0; i < v1.size(); i++) {\n     ans += v1[i] / val;\n     if (v1[i] % val != 0) {\n       ans += 1;\n     }\n   }\n   if (ans > h) {\n     return false;\n   }\n   return true;\n }\n void multiply(long long A[2][2], long long M[2][2]) {\n   long long firstValue = (A[0][0] * M[0][0] + A[0][1] * M[1][0]) % 1000000007;\n   long long secondValue = (A[0][0] * M[0][1] + A[0][1] * M[1][1]) % 1000000007;\n   long long thirdValue = (A[1][0] * M[0][0] + A[1][1] * M[1][0]) % 1000000007;\n   long long fourthValue = (A[1][0] * M[0][1] + A[1][1] * M[1][1]) % 1000000007;\n   A[0][0] = firstValue;\n   A[0][1] = secondValue;\n   A[1][0] = thirdValue;\n   A[1][1] = fourthValue;\n   return;\n }\n void getpow(long long A[2][2], long long n) {\n   if (n == 0 || n == 1) {\n     return;\n   }\n   getpow(A, n / 2);\n   multiply(A, A);\n   if (n % 2 != 0) {\n     long long first[2][2] = {{1, 1}, {1, 0}};\n     multiply(A, first);\n   }\n   return;\n }\n long long getpow1(long long n, long long m, long long b) {\n   if (m == 0) {\n     return 1;\n   }\n   long long ans = getpow1(n, m / 2, b) % b;\n   ans = (ans * ans) % b;\n   if (m % 2 != 0) {\n     ans = ans * n % b;\n   }\n   return ans % b;\n }\n long long getfib(long long n) {\n   if (n == 0) {\n     return 0;\n   }\n   long long A[2][2] = {{1, 1}, {1, 0}};\n   getpow(A, n);\n   long long first[1][2];\n   first[0][0] = 0;\n   first[0][1] = 1;\n   long long ans = first[0][0] * A[0][0] + first[0][1] * A[1][0];\n   return ans % 1000000007;\n }\n vector<long long>* sieve() {\n   bool isprime[1000001];\n   for (long long i = 0; i < 1000001; i++) {\n     isprime[i] = true;\n   }\n   vector<long long>* primes = new vector<long long>();\n   for (long long i = 2; i < 1000001; i++) {\n     if (isprime[i] == true) {\n       for (long long j = 2 * i; j < 1000001; j += i) {\n         isprime[j] = false;\n       }\n     }\n   }\n   primes->push_back(2);\n   for (long long i = 3; i < 1000001; i++) {\n     if (isprime[i] == true) {\n       primes->push_back(i);\n     }\n   }\n   return primes;\n }\n long long getpow2(long long a, string& b, long long m) {\n   long long mod = 1000000007;\n   long long num = 1;\n   for (long long i = b.size() - 1; i >= 0; i--) {\n     if (b[i] == 1) {\n       num = (num * a) % m;\n     } else if (b[i] == 2) {\n       num = ((num * a) % m * a) % m;\n     }\n     a = ((a * a) % m * a) % m;\n   }\n   return num % m;\n }\n long long arr[5000001];\n long long res[1000001];\n long long res1[1000001];\n int main() {\n   long long k, n;\n   cin >> k >> n;\n   long long num = 0;\n   long long k1 = k;\n   while (k1 < n) {\n     k1 *= k;\n     num++;\n   }\n   if (k1 == n) {\n     cout << 'YES' << '\n';\n     cout << num;\n     return 0;\n   }\n   cout << 'NO' << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long long mod = (long long)1e9 + 7;\n const int maxn = (int)1e5 + 1;\n long long inf = 1LL << 60;\n using namespace std;\n inline void read(int &n) {\n   int x = 0, f = 1;\n   char ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') {\n     x = 10 * x + ch - '0';\n     ch = getchar();\n   }\n   n = x * f;\n }\n inline void read(long long &n) {\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 = 10ll * x + ch - '0';\n     ch = getchar();\n   }\n   n = x * f;\n }\n int a[20];\n int rule[20][20];\n long long dp[1 << 19][19];\n int bitCount(int n) {\n   int count = 0;\n   while (n) {\n     count++;\n     n &= (n - 1);\n   }\n   return count;\n }\n int main() {\n   setlocale(LC_ALL, 'Russian');\n   ios_base::sync_with_stdio(0);\n   int n, m, k;\n   cin >> n >> m >> k;\n   long long ans = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   for (int i = 0; i < k; i++) {\n     int u, v, d;\n     cin >> u >> v >> d;\n     u--, v--;\n     rule[u][v] = d;\n   }\n   for (int i = 0; i < n; i++) dp[1 << i][i] = a[i];\n   for (int mask = 0; mask < 1 << n; mask++) {\n     for (int i = 0; i < n; i++) {\n       if (mask & (1 << i)) {\n         for (int j = 0; j < n; j++) {\n           if (!(mask & (1 << j))) {\n             int nmask = mask | (1 << j);\n             dp[nmask][j] = max(dp[nmask][j], dp[mask][i] + a[j] + rule[i][j]);\n           }\n         }\n       }\n     }\n   }\n   for (int mask = 0; mask < 1 << n; mask++) {\n     for (int i = 0; i < n; i++) {\n       if (bitCount(mask) == m) {\n         ans = max(ans, dp[mask][i]);\n       }\n     }\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dp[2][300005], x[300005], y[300005];\n int n, k;\n int main() {\n   cin >> n >> k;\n   for (int i = 1; i <= n; i++) cin >> x[i];\n   for (int i = 1; i <= n; i++) cin >> y[i];\n   for (int i = 1; i <= n; i++) {\n     if (!(~dp[0][i - 1])) {\n       dp[0][i] = -1;\n       dp[1][i] = -1;\n       continue;\n     }\n     if (x[i] > y[i]) {\n       long long h = (long long)k * ((long long)y[i] + 1LL);\n       if (x[i] + dp[0][i - 1] > h) {\n         dp[0][i] = -1;\n         dp[1][i] = -1;\n         continue;\n       }\n       dp[1][i] = 0;\n       h = (long long)k * (long long)y[i];\n       if (x[i] + dp[0][i - 1] <= h) {\n         dp[0][i] = 0;\n         continue;\n       } else\n         dp[0][i] = x[i] + dp[0][i - 1] - k * y[i];\n     }\n     if (y[i] > x[i]) {\n       long long h = (long long)k * ((long long)x[i] + 1LL);\n       if (y[i] + dp[1][i - 1] > h) {\n         dp[0][i] = -1;\n         dp[1][i] = -1;\n         continue;\n       }\n       dp[0][i] = 0;\n       h = (long long)k * (long long)x[i];\n       if (y[i] + dp[1][i - 1] <= h) {\n         dp[1][i] = 0;\n         continue;\n       } else\n         dp[1][i] = y[i] + dp[1][i - 1] - k * x[i];\n     }\n     if (x[i] == y[i]) {\n       if (x[i] == 1) {\n         if (max(dp[0][i - 1], dp[1][i - 1]) == k) {\n           dp[(dp[0][i - 1] > dp[1][i - 1] ? 1 : 0)][i] = 0;\n           dp[(dp[0][i - 1] > dp[1][i - 1] ? 0 : 1)][i] = 1;\n         } else\n           continue;\n       } else {\n         if (k == 1 && max(dp[0][i - 1], dp[1][i - 1]) == k) {\n           dp[(dp[0][i - 1] > dp[1][i - 1] ? 1 : 0)][i] = 0;\n           dp[(dp[0][i - 1] > dp[1][i - 1] ? 0 : 1)][i] = 1;\n         } else\n           continue;\n       }\n     }\n   }\n   if (~dp[0][n])\n     cout << 'YES';\n   else\n     cout << 'NO';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #pragma comment(linker, '/STACK:1024000000,1024000000')\n const double pi = acos(-1.0), eps = 1e-8;\n const int maxm = 1100000, inf = 0x3f3f3f3f;\n bool f[maxm];\n vector<int> v[maxm];\n int top, st[maxm];\n int a[maxm];\n void dfs(int x, int pre) {\n   f[x] = true;\n   int i;\n   a[x] ^= 1;\n   st[top++] = x;\n   for (i = 0; i < v[x].size(); i++) {\n     if (f[v[x][i]] == false) {\n       dfs(v[x][i], x);\n       st[top++] = x;\n       a[x] ^= 1;\n     }\n   }\n   if (a[x] != 0 && pre != -1) {\n     st[top++] = pre;\n     a[pre] ^= 1;\n     st[top++] = x;\n     a[x] ^= 1;\n   }\n }\n int main() {\n   int n, m, i, x, y, begin;\n   while (scanf('%d%d', &n, &m) == 2) {\n     for (i = 1; i <= n; i++) v[i].clear();\n     while (m--) {\n       scanf('%d%d', &x, &y);\n       v[x].push_back(y);\n       v[y].push_back(x);\n     }\n     for (i = 1; i <= n; i++) {\n       scanf('%d', &a[i]);\n       f[i] = false;\n     }\n     top = 0;\n     for (i = 1; i <= n; i++) {\n       if (a[i] == 1) {\n         dfs(i, -1);\n         begin = i;\n         break;\n       }\n     }\n     if (i == n + 1) {\n       printf('0\n');\n       continue;\n     }\n     for (i = begin + 1; i <= n; i++) {\n       if (a[i] != 0) {\n         printf('-1\n');\n         break;\n       }\n     }\n     if (i <= n) continue;\n     if (a[begin] == 1)\n       begin = 1;\n     else\n       begin = 0;\n     printf('%d\n', top - begin);\n     for (i = begin; i < top; i++) {\n       printf('%d', st[i]);\n       if (i == top - 1)\n         printf('\n');\n       else\n         printf(' ');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX_N = 11111, MAX_M = 222222;\n class Flow_Algorithm {\n  public:\n   int g[MAX_M], nxt[MAX_M], flow[MAX_M], c[MAX_N], h[MAX_N], nm;\n   int d[MAX_N], q[MAX_N];\n   int S, T;\n   void addedge(int x, int y, int w) {\n     g[nm] = y;\n     nxt[nm] = c[x];\n     c[x] = nm;\n     flow[nm] = w;\n     nm++;\n   }\n   void add(int x, int y, int w) {\n     addedge(x, y, w);\n     addedge(y, x, 0);\n   }\n   bool bfs() {\n     memset(d, -1, sizeof d);\n     d[q[1] = S] = 0;\n     for (int l = 1, r = 1; l <= r; ++l) {\n       int i = q[l];\n       for (int k = c[i]; ~k; k = nxt[k]) {\n         int j = g[k];\n         if (!~d[j] && flow[k]) d[q[++r] = j] = d[i] + 1;\n       }\n     }\n     return d[T] != -1;\n   }\n   int dfs(int i, int now) {\n     if (!now) return 0;\n     if (i == T) return now;\n     int w = 0;\n     for (int &k = c[i]; ~k; k = nxt[k]) {\n       int j = g[k];\n       if (d[j] == d[i] + 1) {\n         int res;\n         if (flow[k] && ((res = dfs(j, min(now - w, flow[k]))) > 0)) {\n           flow[k] -= res;\n           flow[k ^ 1] += res;\n           w += res;\n           if (w == now) return w;\n         }\n       }\n     }\n     return w;\n   }\n   void sets(int _S, int _T) {\n     S = _S;\n     T = _T;\n     nm = 0;\n     memset(c, -1, sizeof c);\n   }\n   int Dinic() {\n     memcpy(h, c, sizeof h);\n     int ans = 0;\n     while (bfs()) {\n       ans += dfs(S, 1000000000);\n       memcpy(c, h, sizeof c);\n     }\n     return ans;\n   }\n } G;\n int A[55], B[55], C[55], L[55], R[55];\n int n, m;\n int nd[55][222];\n int calc(int i, int x) { return x * x * A[i] + x * B[i] + C[i]; }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = (1); i <= (n); ++i) scanf('%d%d%d', &A[i], &B[i], &C[i]);\n   for (int i = (1); i <= (n); ++i) scanf('%d%d', &L[i], &R[i]);\n   int tot = 0;\n   for (int i = (1); i <= (n); ++i)\n     for (int j = (L[i] - 1); j <= (R[i]); ++j) nd[i][j + 100] = ++tot;\n   int S = tot + 1, T = tot + 2;\n   G.sets(S, T);\n   for (int i = (1); i <= (n); ++i) {\n     G.add(S, nd[i][L[i] - 1 + 100], 1000000000);\n     for (int j = (L[i]); j <= (R[i]); ++j)\n       G.add(nd[i][j - 1 + 100], nd[i][j + 100], 20000000 - calc(i, j));\n     G.add(nd[i][R[i] + 100], T, 1000000000);\n   }\n   for (int i = (1); i <= (m); ++i) {\n     int u, v, d;\n     scanf('%d%d%d', &u, &v, &d);\n     for (int j = (L[u] - 1); j <= (R[u]); ++j) {\n       int p = j - d, pt = 0;\n       if (p < L[v])\n         pt = nd[v][L[v] - 1 + 100];\n       else\n         pt = nd[v][p + 100];\n       G.add(nd[u][j + 100], pt, 1000000000);\n     }\n   }\n   int ans = G.Dinic();\n   ans = n * 20000000 - ans;\n   printf('%d\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n constexpr int N = 2e5 + 3;\n vector<int> c[N];\n vector<int> e[N];\n int main() {\n   ios_base::sync_with_stdio(false);\n   int n, m, q;\n   cin >> n >> m >> q;\n   for (int it = 0; it < q; ++it) {\n     int r, C;\n     cin >> r >> C;\n     c[r].push_back(C);\n   }\n   for (int i = 1; i <= n; ++i) {\n     int esz = c[i].size();\n     for (int j = 1; j < esz; ++j) {\n       int prev = c[i][j - 1], now = c[i][j];\n       e[prev].push_back(now);\n       e[now].push_back(prev);\n     }\n   }\n   vector<int> vis(m + 1, 0);\n   int cc = 0;\n   for (int i = 1; i <= m; ++i) {\n     if (vis[i] == 0) {\n       ++cc;\n       function<void(int)> dfs = [&](int i) {\n         assert(i >= 1 && i <= m);\n         if (vis[i] != 0) {\n           assert(vis[i] == cc);\n           return;\n         }\n         vis[i] = cc;\n         for (int v : e[i]) {\n           dfs(v);\n         }\n       };\n       dfs(i);\n     }\n   }\n   int cnt_empty_r = 0;\n   for (int i = 1; i <= n; ++i) {\n     if (c[i].empty()) {\n       ++cnt_empty_r;\n     }\n   }\n   cout << cnt_empty_r + cc - 1 << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n static const int INF = 0x3f3f3f3f;\n static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;\n template <typename T>\n T mulmod(T a, T b, T m) {\n   long long int q =\n       (long long int)(((long double)a * (long double)b) / (long double)m);\n   long long int r = a * b - q * m;\n   if (r > m) r %= m;\n   if (r < 0) r += m;\n   return r;\n }\n template <typename T>\n T MOD(T a, T b) {\n   return (a < b ? a : a % b);\n }\n template <typename T>\n T expo(T e, T n) {\n   T x = 1, p = e;\n   while (n) {\n     if (n & 1) x = x * p;\n     p = p * p;\n     n >>= 1;\n   }\n   return x;\n }\n template <typename T>\n T power(T e, T n, T m) {\n   T x = 1, p = e;\n   while (n) {\n     if (n & 1) x = mulmod(x, p, m);\n     p = mulmod(p, p, m);\n     n >>= 1;\n   }\n   return x;\n }\n template <typename T>\n T gcd(T a, T b) {\n   if (a % b) return gcd(b, a % b);\n   return b;\n }\n template <typename T>\n T lcm(T a, T b) {\n   return (a * (b / gcd(a, b)));\n }\n template <typename T>\n T add(T a, T b, T Mod) {\n   a += b;\n   return (a >= Mod ? a - Mod : a);\n }\n template <typename T>\n T sub(T a, T b, T Mod) {\n   a -= b;\n   return (a < 0 ? a + Mod : a);\n }\n const int Mod = 1000000007;\n const int N = 100005;\n int MX = 1000001;\n int a[N];\n struct segmentTree {\n   int tree[6 * N];\n   int lazy[6 * N];\n   void modify(int node, int v) {\n     tree[node] += v;\n     lazy[node] += v;\n   }\n   void update(int node, int x, int y, int p, int q, int val) {\n     if (lazy[node]) {\n       modify(node << 1, lazy[node]);\n       modify(node << 1 | 1, lazy[node]);\n       lazy[node] = 0;\n     }\n     if (x >= p and y <= q) {\n       modify(node, val);\n       return;\n     }\n     int mid = x + y >> 1;\n     if (p <= mid) update(node << 1, x, mid, p, q, val);\n     if (q > mid) update(node << 1 | 1, mid + 1, y, p, q, val);\n     tree[node] = max(tree[node << 1], tree[node << 1 | 1]);\n   }\n   int query(int node, int x, int y) {\n     if (lazy[node]) {\n       modify(node << 1, lazy[node]);\n       modify(node << 1 | 1, lazy[node]);\n       lazy[node] = 0;\n     }\n     if (tree[node] <= 0) return -1;\n     if (x == y) return a[x];\n     int mid = x + y >> 1;\n     int ret = query(node << 1 | 1, mid + 1, y);\n     if (ret == -1) {\n       ret = query(node << 1, x, mid);\n     }\n     return ret;\n   }\n } T;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int m;\n   cin >> m;\n   for (int i = 0; i <= m - 1; i++) {\n     int p, t;\n     cin >> p >> t;\n     if (t == 0) {\n       T.update(1, 1, m, 1, p, -1);\n     } else {\n       int x;\n       cin >> x;\n       a[p] = x;\n       T.update(1, 1, m, 1, p, 1);\n     }\n     cout << T.query(1, 1, m) << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 100005;\n const long long M = 998244353;\n long long pow1(long long a, long long b) {\n   int res = 1;\n   while (b > 0) {\n     if (b & 1) {\n       res = (res * a) % M;\n     }\n     a = (a * a) % M;\n     b >>= 1;\n   }\n   return res % M;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long T;\n   T = 1;\n   cin >> T;\n   while (T--) {\n     long long n, m;\n     cin >> n >> m;\n     long long ans[n][m];\n     for (long long i = 0; i < n; i++) {\n       for (long long j = 0; j < m; j++) {\n         long long num;\n         cin >> num;\n         if (num % 2 != (i + j) % 2)\n           ans[i][j] = num + 1;\n         else\n           ans[i][j] = num;\n         cout << ans[i][j] << ' ';\n       }\n       cout << '\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n, k, i, j;\n   cin >> n >> k;\n   long long int x = 1;\n   long long int ans = n - 1;\n   for (i = 0; i < k; i++) {\n     vector<long long int> v;\n     long long int m;\n     cin >> m;\n     long long int t = -1;\n     for (j = 0; j < m; j++) {\n       long long int y;\n       cin >> y;\n       if (y == 1) t = j;\n       v.push_back(y);\n     }\n     if (t != -1) {\n       for (j = t + 1; j < m; j++) {\n         if (v[j] == v[j - 1] + 1)\n           x++;\n         else\n           break;\n       }\n     }\n     ans += m - 1;\n   }\n   cout << ans - (2 * (x - 1));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int num, hight, temp, width = 0;\n   cin >> num >> hight;\n   vector<int> v;\n   for (int i = 0; i < num; i++) {\n     cin >> temp;\n     v.push_back(temp);\n     if (v[i] > hight)\n       width += 2;\n     else\n       width++;\n   }\n   cout << width;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double pi = 2 * acos(0);\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int q;\n   cin >> q;\n   while (q--) {\n     int n, r;\n     cin >> n >> r;\n     set<int> s;\n     vector<int> v;\n     for (long long i = 0; i < n; i++) {\n       int a;\n       cin >> a;\n       s.insert(a);\n     }\n     for (auto u : s) v.push_back(u);\n     int cnt = 0;\n     for (int i = v.size() - 1; i >= 0; i--) {\n       if (v[i] - r * cnt > 0) cnt++;\n     }\n     cout << cnt << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100005;\n int n, a[N], b[N], posa[N], posb[N], dif[N], ans, ord[N], t1;\n multiset<int> rig, lef;\n int abss(const int i) { return i < 0 ? -i : i; }\n bool cmp(int i, int j) { return dif[i] < dif[j]; }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &a[i]);\n     posa[a[i]] = i;\n   }\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &b[i]);\n     posb[b[i]] = i;\n   }\n   ans = n;\n   for (int i = 1; i <= n; ++i) {\n     ans = min(ans, abss(posa[i] - posb[i]));\n     dif[i] = posb[i] - posa[i];\n     if (dif[i] > 0) {\n       rig.insert(dif[i]);\n     } else {\n       lef.insert(-dif[i]);\n     }\n     ord[i] = i;\n   }\n   sort(ord + 1, ord + 1 + n, cmp);\n   t1 = 1;\n   printf('%d\n', ans);\n   for (int i = 2; i <= n; ++i) {\n     lef.erase(lef.find(posa[b[i - 1]] - i + 1));\n     rig.insert(n - posa[b[i - 1]] + i - 1);\n     while (rig.size() > 0 && *rig.begin() - i + 1 == 0) {\n       rig.erase(rig.find(*rig.begin()));\n       lef.insert((int)(-i + 1));\n     }\n     ans = min(*lef.begin() + i - 1,\n               rig.size() > 0 ? *rig.begin() - i + 1 : n + 1);\n     printf('%d\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n const int MAX = 100005;\n const int MAX1 = 1005;\n const int MAX2 = 105;\n const int LEN = 105;\n const int BASE = 1000000000;\n const double EPS = 1e-7;\n const int MOD = 1000000007;\n long long pow(long long a, long long b) {\n   long long ans = 1;\n   while (b) {\n     if (b & 1) ans = (ans * a) % MOD;\n     b /= 2;\n     a = (a * a) % MOD;\n   }\n   return ans;\n }\n int main(void) {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ifstream in('');\n   ofstream out('');\n   clock_t begin = clock();\n   int q;\n   cin >> q;\n   while (q--) {\n     int n;\n     cin >> n;\n     int arr[MAX];\n     for (int i = (0); i < (n); ++i) {\n       cin >> arr[i];\n     }\n     sort(arr, arr + n);\n     cout << min(n - 2, arr[n - 2] - 1) << '\n';\n   }\n   clock_t end = clock();\n   double esecs = double(end - begin) / CLOCKS_PER_SEC;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline T S(T a) {\n   return a * a;\n }\n template <class T>\n inline string tostring(T a) {\n   ostringstream os('');\n   os << a;\n   return os.str();\n }\n template <typename T>\n inline long long tolong(T a) {\n   long long res;\n   istringstream os(a);\n   os >> res;\n   return res;\n }\n template <typename T>\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 <typename T>\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<int, int> mp;\n multiset<string>::iterator it;\n deque<char> 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 <bits/stdc++.h>\n const int inf = (1ll << 30) - 1;\n const int maxn = (int)1e5 + 10;\n using namespace std;\n int n;\n vector<int> g[100100];\n int a[100100];\n int in[100100];\n int out[100100];\n int dp[100100];\n map<int, int> 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<int, int>::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<int, int>::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<int> 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<pair<int, int> > 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<int>::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<int>::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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<bits/stdc++.h>\n #define fo(i, n) for(int i=0; i<n; i++)\n #define boost ios::sync_with_stdio(false); cin.tie(0)\n #define ll long long int\n using namespace std;\n \n int main()\n {   boost;\n     int t; cin>>t;\n     while(t--){\n         int n, max_freq = 0, i; cin>>n;\n         map<int, int> m;\n         for(i=0; i<n; i++){\n             int k; cin>>k;\n             max_freq = max(max_freq, ++m[k]);\n         }\n         cout<<max_freq<<'\n';\n     }\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 500001;\n int arr[N];\n vector<pair<int, int> > v[N];\n int ans[N], n, m;\n int bit[N];\n map<int, int> 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 <bits/stdc++.h>\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<pair<long long int, long long int> > v;\n   vector<long long int> 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 "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n namespace io {\n const int SI = 1 << 21 | 1;\n char IB[SI], *IS, *IT, OB[SI], *OS = OB, *OT = OS + SI - 1, c, ch[100];\n int f, t;\n inline void flush() { fwrite(OB, 1, OS - OB, stdout), OS = OB; }\n inline void pc(char x) {\n   *OS++ = x;\n   if (OS == OT) flush();\n }\n template <class I>\n inline void rd(I &x) {\n   for (f = 1, c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),\n                               IS == IT ? EOF : *IS++)\n                             : *IS++);\n        c < '0' || c > '9';\n        c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),\n                        IS == IT ? EOF : *IS++)\n                      : *IS++))\n     if (c == '-') f = -1;\n   for (x = 0; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + (c & 15),\n       c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),\n                       IS == IT ? EOF : *IS++)\n                     : *IS++))\n     ;\n   x *= f;\n }\n inline void rds(char *s, int &x) {\n   for (c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),\n                        IS == IT ? EOF : *IS++)\n                      : *IS++);\n        c < 33 || c > 126;\n        c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),\n                        IS == IT ? EOF : *IS++)\n                      : *IS++))\n     ;\n   for (x = 0; c >= 33 && c <= 126;\n        s[++x] = c, c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),\n                                    IS == IT ? EOF : *IS++)\n                                  : *IS++))\n     ;\n   s[x + 1] = '\0';\n }\n template <class I>\n inline void print(I x, char k = '\n') {\n   if (!x) pc('0');\n   if (x < 0) pc('-'), x = -x;\n   while (x) ch[++t] = x % 10 + '0', x /= 10;\n   while (t) pc(ch[t--]);\n   pc(k);\n }\n inline void prints(string s) {\n   int x = s.length();\n   while (t < x) pc(s[t++]);\n   pc('\n'), t = 0;\n }\n struct Flush {\n   ~Flush() { flush(); }\n } flusher;\n }  // namespace io\n using io::print;\n using io::prints;\n using io::rd;\n using io::rds;\n const int N = 3e5 + 7;\n int n, a[N], sx[N], tx, sn[N], tn;\n map<int, int> p;\n struct T {\n   int l, r, x, c, z;\n } t[N << 2];\n long long ans;\n void build(int p, int l, int r) {\n   t[p].l = l, t[p].r = r, t[p].c = r - l + 1;\n   if (l == r) return;\n   build((p << 1), l, ((t[p].l + t[p].r) >> 1)),\n       build(((p << 1) | 1), ((t[p].l + t[p].r) >> 1) + 1, r);\n }\n inline void add(int p, int x) { t[p].x += x, t[p].z += x; }\n void upd(int p, int l, int r, int x) {\n   if (t[p].l >= l && t[p].r <= r) return add(p, x);\n   if (t[p].z) add((p << 1), t[p].z), add(((p << 1) | 1), t[p].z), t[p].z = 0;\n   if (l <= ((t[p].l + t[p].r) >> 1)) upd((p << 1), l, r, x);\n   if (r > ((t[p].l + t[p].r) >> 1)) upd(((p << 1) | 1), l, r, x);\n   t[p].x = min(t[(p << 1)].x, t[((p << 1) | 1)].x);\n   t[p].c = (t[(p << 1)].x == t[p].x ? t[(p << 1)].c : 0) +\n            (t[((p << 1) | 1)].x == t[p].x ? t[((p << 1) | 1)].c : 0);\n }\n int main() {\n   rd(n);\n   for (int i = 1, x, y; i <= n; i++) rd(x), rd(y), a[x] = y;\n   build(1, 1, n);\n   for (int i = 1; i <= n; i++) {\n     while (tx && a[sx[tx]] < a[i])\n       upd(1, sx[tx - 1] + 1, sx[tx], -a[sx[tx]]), --tx;\n     while (tn && a[sn[tn]] > a[i])\n       upd(1, sn[tn - 1] + 1, sn[tn], a[sn[tn]]), --tn;\n     upd(1, p[a[i]] + 1, i, -1), p[a[i]] = sx[++tx] = sn[++tn] = i;\n     upd(1, sx[tx - 1] + 1, i, a[i]), upd(1, sn[tn - 1] + 1, i, -a[i]);\n     ans += t[1].c;\n   }\n   print(ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, m;\n int nt, kt, mt;\n int su[100004];\n long long sum = 0;\n double res;\n int main() {\n   scanf('%d%d%d', &n, &k, &m);\n   nt = n;\n   kt = k;\n   mt = m;\n   for (int i = 0; i < n; i++) {\n     scanf('%d', su + i);\n     sum += su[i];\n   }\n   res = 1.0 * sum / n;\n   sort(su, su + n);\n   long long ts = 0;\n   for (int i = 1; i <= n; i++) {\n     ts += su[n - i];\n     long long rm = m - n + i;\n     long long te = i;\n     long long tk = k;\n     if (rm < 0) {\n       continue;\n     }\n     res = max(res, (ts + min(rm, te * tk)) * 1.0 / te);\n   }\n   printf('%lf\n', res);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 2e5 + 100;\n const int MOD = 1e9 + 7;\n const int oo = 1e9 + 100;\n const long double EPS = 1e-9;\n const string DIRS = 'UDLR';\n int n, x, y;\n char str[MAXN];\n int acc[256][MAXN];\n int get(char ch, int fr, int to) {\n   if (to < fr) return 0;\n   return acc[ch][to] - acc[ch][fr - 1];\n }\n int main() {\n   while (scanf('%d %s %d %d', &n, str + 1, &x, &y) == 4) {\n     for (auto& e : DIRS) {\n       acc[e][0] = 0;\n       for (int i = 1; i <= n; ++i) {\n         acc[e][i] = acc[e][i - 1] + (str[i] == e);\n       }\n     }\n     int init_x = acc['R'][n] - acc['L'][n];\n     int init_y = acc['U'][n] - acc['D'][n];\n     if (init_x == x && init_y == y) {\n       puts('0');\n       continue;\n     }\n     if (abs(x) + abs(y) > n || (n - abs(x) - abs(y)) % 2 != 0) {\n       puts('-1');\n       continue;\n     }\n     int lo = 1, hi = n;\n     vector<int> aux(256);\n     while (lo <= hi) {\n       int mi = (lo + hi) >> 1;\n       bool ok = false;\n       for (int i = 1; i + mi - 1 <= n; ++i) {\n         for (auto& e : DIRS) aux[e] = get(e, 1, i - 1) + get(e, i + mi, n);\n         int xx = aux['R'] - aux['L'];\n         int yy = aux['U'] - aux['D'];\n         int rem = mi - (abs(x - xx) + abs(y - yy));\n         if (rem >= 0) ok = true;\n       }\n       if (ok)\n         hi = mi - 1;\n       else\n         lo = mi + 1;\n     }\n     printf('%d\n', lo);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[200010], b[200010];\n bool used[200010];\n int main() {\n   int n, k = 0, i, x;\n   scanf('%d', &n);\n   for (i = 1; i <= n; i++) scanf('%d', &a[i]);\n   for (i = 1; i <= n; i++) scanf('%d', &b[i]);\n   int ans = 1 - accumulate(b + 1, b + n + 1, 0) % 2;\n   for (i = 1; i <= n; i++)\n     if (!used[i]) {\n       used[i] = true;\n       x = a[i];\n       while (!used[x]) {\n         used[x] = true;\n         x = a[x];\n       }\n       k++;\n     }\n   if (k > 1) ans += k;\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, m, i, cnt = 0, sum = 0, ans = 0, x, j;\n   string s;\n   vector<string> v;\n   cin >> n >> m;\n   int a[m];\n   for (i = 0; i < n; i++) {\n     cin >> s;\n     v.push_back(s);\n   }\n   for (i = 0; i < m; i++) cin >> a[i];\n   for (i = 0; i < m; i++) {\n     int arr[5] = {0};\n     for (j = 0; j < n; j++) {\n       x = v[j][i] - 'A';\n       arr[x]++;\n     }\n     sort(arr, arr + 5);\n     ans += arr[4] * a[i];\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void chekarre(int* arr, int n) {\n   cout << '[';\n   for (int i = 0; i < n; i++) cout << arr[i] << ' ';\n   cout << ']' << endl;\n }\n bool comp(int i, int j) { return (i > j); }\n int a[2000007];\n int main() {\n   int n;\n   long long sum = 0;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   sort(a, a + n);\n   reverse(a, a + n);\n   while (n) {\n     for (int j = 0; j < n; j++) {\n       sum += a[j];\n     }\n     n = n / 4;\n   }\n   cout << sum << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a, b;\n int ans, nn;\n char x[100010];\n int change(int t) {\n   int rtn = 0, bit = 1;\n   while (t) {\n     rtn += (t % 10) * bit;\n     bit *= ans;\n     t /= 10;\n   }\n   return rtn;\n }\n int main() {\n   scanf('%d%d', &a, &b);\n   int aa = a, bb = b;\n   while (aa) {\n     ans = max(ans, aa % 10);\n     aa /= 10;\n   }\n   while (bb) {\n     ans = max(ans, bb % 10);\n     bb /= 10;\n   }\n   ans += 1;\n   a = change(a);\n   b = change(b);\n   a += b;\n   while (a) {\n     x[nn++] = a % ans + '0';\n     a /= ans;\n   }\n   printf('%d', nn);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long OO = 1e8;\n const double EPS = (1e-7);\n int dcmp(double x, double y) { return fabs(x - y) <= EPS ? 0 : x < y ? -1 : 1; }\n const int N = 100;\n bool adjMatrixBool[N][N];\n int adjMatrix[N][N];\n vector<int> adjMatrixAll[N][N];\n map<pair<int, int>, int> adjMatrixMap;\n vector<vector<int> > adjList1;\n vector<vector<pair<int, int> > > adjList2;\n vector<bool> visited;\n bool valid(int i, int j) { return 1; }\n char arr[303][303], x, b;\n bool prime(long long n) {\n   long long i;\n   for (i = 2; i <= sqrt(n); i++) {\n     if (n % i == 0) return false;\n   }\n   return true;\n }\n long long gcd(long long a, long long b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); }\n int main() {\n   ios_base::sync_with_stdio(false);\n   long long n;\n   cin >> n;\n   string s;\n   cin >> s;\n   long long arr[n];\n   for (int i = 0; i < n; i++) {\n     cin >> arr[i];\n   }\n   long long ans = INT_MAX;\n   for (int i = 0; i < n - 1; i++) {\n     if (s[i] == 'R' and s[i + 1] == 'L')\n       ans = min(ans, abs((arr[i + 1] - arr[i]) / 2));\n   }\n   if (ans == INT_MAX)\n     cout << '-1' << endl;\n   else\n     cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double PI = acos(-1.0);\n const long long INF = 1000 * 1000 * 1000 + 7;\n const long long LINF = INF * (long long)INF;\n const int MOD = 1000 * 1000 * 1000 + 7;\n const int MAX = 10000 + 47;\n long long F[MAX];\n vector<int> R;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int s, k;\n   cin >> s >> k;\n   int p = 0;\n   F[0] = 1;\n   for (int i = (1); i < (MAX); i++) {\n     for (int j = (max(0, i - k)); j < (i); j++) {\n       F[i] += F[j];\n     }\n     if (F[i] > s) {\n       p = i;\n       break;\n     }\n   }\n   for (int i = (p)-1; i >= (0); i--) {\n     if (s >= F[i]) {\n       s -= F[i];\n       R.push_back(F[i]);\n     }\n   }\n   if ((int)R.size() == 1) R.push_back(0);\n   cout << (int)R.size() << endl;\n   for (int i = (0); i < ((int)R.size()); i++) {\n     cout << R[i] << ' ';\n   }\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double eps = 1e-9;\n const double PI = acos(-1.0);\n const long long int mod = 1e9 + 7;\n const int MAXN = 1e6 + 5;\n void cp() {\n   long long int n, i, k;\n   cin >> n >> k;\n   long long int a[n], sum = 0;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   sort(a, a + n);\n   for (i = 1; i < n; i++) {\n     if (a[i] < k) {\n       sum += (k - a[i]) / a[0];\n     }\n   }\n   cout << sum;\n   cout << '\n';\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   int t;\n   t = 1;\n   cin >> t;\n   while (t--) {\n     cp();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = INT_MAX;\n const long long INFL = LLONG_MAX;\n int dx[] = {1, -1, 0, 0};\n int dy[] = {0, 0, 1, -1};\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   int n, k;\n   cin >> n >> k;\n   int p = 2 * n + 1;\n   int a[p + 2];\n   for (int i = 1; i <= p; i++) cin >> a[i];\n   a[0] = -INF;\n   a[p + 1] = +INF;\n   for (int i = 1; i <= p && k > 0; i++)\n     if (i % 2 == 0 && a[i] > a[i - 1] && a[i] > a[i + 1] &&\n         a[i] - a[i - 1] > 1 && a[i] - a[i + 1] > 1) {\n       k--;\n       a[i]--;\n     }\n   for (int i = 1; i <= p; i++) cout << a[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[300005];\n long long c[300005] = {0};\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   int n;\n   cin >> n;\n   int i;\n   for (i = 1; i <= n - 1; i++) cin >> a[i];\n   long long m = 0;\n   long long r = 0;\n   for (i = 1; i <= n - 1; i++) {\n     r += a[i];\n     m = min(m, r);\n   }\n   m = abs(m) + 1;\n   long long y = m;\n   if (m > n || c[m]) {\n     cout << -1;\n     return 0;\n   }\n   c[m] = 1;\n   for (i = 1; i <= n - 1; i++) {\n     m += a[i];\n     if (m > n || c[m]) {\n       cout << -1;\n       return 0;\n     }\n     c[m] = 1;\n   }\n   cout << y << ' ';\n   for (i = 1; i <= n - 1; i++) {\n     y += a[i];\n     cout << y << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int myrand(int m) { return (rand() * (1 << 15) + rand()) % m; }\n int main() {\n   srand(time(0));\n   int n, ind, x;\n   cin >> n >> ind >> x;\n   --ind;\n   vector<int> left(n);\n   vector<bool> vis(n, 0);\n   for (int i = 0; i < n; ++i) left[i] = i;\n   vis[ind] = 1;\n   random_shuffle(left.begin(), left.end());\n   int best = -1;\n   for (int i = 0; i < min(1000, n); ++i) {\n     int v, ii = left[i];\n     cout << '? ' << ii + 1 << '\n';\n     fflush(stdout);\n     cin >> v >> ii;\n     if (v < x && v > best) {\n       ind = left[i];\n       best = max(best, v);\n     }\n   }\n   if (ind < 0) {\n     cout << '! -1\n';\n     fflush(stdout);\n     return 0;\n   }\n   int itt, LIM = 999;\n   for (itt = 0; itt < LIM; ++itt) {\n     cout << '? ' << ind + 1 << '\n';\n     fflush(stdout);\n     int v;\n     cin >> v >> ind;\n     --ind;\n     if (v >= x) {\n       best = v;\n       break;\n     }\n     if (ind < 0) break;\n   }\n   if (itt == LIM) {\n     int j = 1;\n     while (1) {\n       j = j + 1;\n     }\n   }\n   cout << '! ' << ((best < x) ? -1 : best) << '\n';\n   fflush(stdout);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool done1[33][2][2], done2[33][2][2], done3[33][2][2];\n long long memo1[33][2][2], memo2[33][2][2], memo3[33][2][2];\n long long lim;\n int n;\n long long dp1(int, int, int);\n long long dp2(int, int, int);\n long long dp3(int, int, int);\n long long dp1(int i, int s1, int s2) {\n   if (done1[i][s1][s2]) return memo1[i][s1][s2];\n   done1[i][s1][s2] = true;\n   long long &ret = memo1[i][s1][s2] = 0;\n   int hd = (((lim) >> (n - 1 - i)) & 1), rr = (((lim) >> (i)) & 1);\n   if (i * 2 + 1 == n) {\n     if (!s1)\n       ret = 1;\n     else if (s2)\n       ret = hd != 0;\n     else {\n       ret = 1;\n     }\n   } else if (i * 2 == n) {\n     if (s1 && s2)\n       ret = 0;\n     else\n       ret++;\n   } else {\n     ret += dp2(i + 1, s1 && hd == 0, 0 > rr || (0 == rr && s2));\n     ret += dp3(i + 1, s1 && hd == 0, 1 > rr || (1 == rr && s2));\n   }\n   return ret;\n }\n long long dp2(int i, int s1, int s2) {\n   if (done2[i][s1][s2]) return memo2[i][s1][s2];\n   done2[i][s1][s2] = true;\n   long long &ret = memo2[i][s1][s2] = 0;\n   int hd = (((lim) >> (n - 1 - i)) & 1), rr = (((lim) >> (i)) & 1);\n   if (i * 2 + 1 == n) {\n     if (!s1)\n       ret = 2;\n     else if (s2)\n       ret = hd != 0;\n     else {\n       ret = hd + 1;\n     }\n   } else if (i * 2 == n) {\n     if (s1 && s2)\n       ret = 0;\n     else\n       ret++;\n   } else {\n     for (int x = 0; x <= (s1 ? hd : 1); x++)\n       ret += dp2(i + 1, s1 && hd == x, x > rr || (x == rr && s2));\n     int ns1 = s1 && hd == 0, ns2 = 1 > rr || (1 == rr && s2);\n     if (!ns1)\n       ret += 1LL << (n - 2 * (i + 1));\n     else\n       ret += ((lim >> (i + 1)) & ((1LL << (n - 2 * (i + 1))) - 1)) + 1;\n     if (ns1 && ns2) ret--;\n   }\n   return ret;\n }\n long long dp3(int i, int s1, int s2) {\n   if (done3[i][s1][s2]) return memo3[i][s1][s2];\n   done3[i][s1][s2] = true;\n   long long &ret = memo3[i][s1][s2] = 0;\n   int hd = (((lim) >> (n - 1 - i)) & 1), rr = (((lim) >> (i)) & 1);\n   if (i * 2 + 1 == n) {\n     if (!s1)\n       ret = 1;\n     else if (s2)\n       ret = hd != 0;\n     else {\n       ret = 1;\n     }\n   } else if (i * 2 == n) {\n     if (s1 && s2)\n       ret = 0;\n     else\n       ret++;\n   } else {\n     ret += dp3(i + 1, s1 && hd == 0, 1 > rr || (1 == rr && s2));\n     if (!s1 || hd == 1)\n       ret += dp3(i + 1, s1 && hd == 1, 0 > rr || (0 == rr && s2));\n     int ns1 = s1 && hd == 0, ns2 = 0 > rr || (0 == rr && s2);\n     if (!ns1)\n       ret += 1LL << (n - 2 * (i + 1));\n     else\n       ret += ((lim >> (i + 1)) & ((1LL << (n - 2 * (i + 1))) - 1)) + 1;\n     if (ns1 && ns2) ret--;\n   }\n   return ret;\n }\n void output(long long x, int n) {\n   for (int i = 0; i < n; i++) cout << (((x) >> (n - i - 1)) & 1);\n   cout << '\n';\n }\n long long work(long long LIM) {\n   lim = LIM;\n   memset(done1, 0, sizeof(done1));\n   memset(done2, 0, sizeof(done2));\n   memset(done3, 0, sizeof(done3));\n   return dp1(0, 1, 0);\n }\n int main() {\n   long long rank;\n   cin >> n >> rank;\n   rank++;\n   long long lb = 0, rb = (1LL << n) - 1;\n   for (long long mid = (lb + rb) / 2; lb < rb - 1; mid = (lb + rb) / 2) {\n     if (work(mid) >= rank)\n       rb = mid;\n     else\n       lb = mid;\n   }\n   if (work(rb) == rank)\n     output(rb, n);\n   else\n     printf('-1\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int32_t main() {\n   long long n;\n   cin >> n;\n   map<string, long long> count;\n   for (long long i = 0; i < n; i++) {\n     string s;\n     cin >> s;\n     count[s]++;\n   }\n   string s1 = 'a', s2 = 'a';\n   for (map<string, long long>::iterator it = count.begin(); it != count.end();\n        ++it) {\n     if (s1 == 'a')\n       s1 = (*it).first;\n     else\n       s2 = (*it).first;\n   }\n   if (count[s1] > count[s2])\n     cout << s1 << '\n';\n   else\n     cout << s2 << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int to(int x, int y) { return (x * 60) + (y); }\n long long int gcd(long long int a, long long int b) {\n   return b == 0 ? a : gcd(b, a % b);\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   int arr[n + 1];\n   for (int i = 1; i <= n; i++) cin >> arr[i];\n   int mx = 0, ans = 0;\n   for (int i = 1; i <= n; i++) {\n     if (arr[i] == i and mx <= i) {\n       ans++;\n       continue;\n     }\n     if (arr[i] == i) {\n       continue;\n     }\n     mx = max(arr[i], mx);\n   }\n   cout << ans;\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int N;\n char s[507][507];\n int rX[] = {-1, 0, 1, 0};\n int rY[] = {0, -1, 0, 1};\n int spoj[507][507];\n int rozm[1000007];\n int akt[1000007];\n int terRozm;\n int wyn;\n void dfs(int y, int x, int num) {\n   spoj[y][x] = num;\n   terRozm++;\n   for (int i = 0; i < 4; i++) {\n     int nx = x + rX[i], ny = y + rY[i];\n     if (nx >= 1 && nx <= N && ny >= 1 && ny <= N) {\n       if (s[ny][nx] == '.' && spoj[ny][nx] == 0) dfs(ny, nx, num);\n     }\n   }\n }\n void dolicz(int y1, int x1, int y2, int x2, bool kk = false) {\n   for (int y = y1; y <= y2; y++) {\n     if (y < 1 || y > N) continue;\n     for (int x = x1; x <= x2; x++) {\n       if (x < 1 || x > N) continue;\n       if (s[y][x] == '.') {\n         int sp = spoj[y][x];\n         akt[sp]++;\n         if (akt[sp] == 1) wyn += rozm[sp];\n       } else if (kk) {\n         wyn++;\n       }\n     }\n   }\n }\n void odejmij(int y1, int x1, int y2, int x2, bool kk = false) {\n   for (int y = y1; y <= y2; y++) {\n     if (y < 1 || y > N) continue;\n     for (int x = x1; x <= x2; x++) {\n       if (x < 1 || x > N) continue;\n       if (s[y][x] == '.') {\n         int sp = spoj[y][x];\n         akt[sp]--;\n         if (akt[sp] == 0) wyn -= rozm[sp];\n       } else if (kk) {\n         wyn--;\n       }\n     }\n   }\n }\n int main() {\n   int K;\n   scanf('%d%d', &N, &K);\n   for (int i = 1; i <= N; i++) scanf('%s', s[i] + 1);\n   int ileSpoj = 0;\n   for (int i = 1; i <= N; i++)\n     for (int w = 1; w <= N; w++)\n       if (s[i][w] == '.' && spoj[i][w] == 0) {\n         terRozm = 0;\n         dfs(i, w, ++ileSpoj);\n         rozm[ileSpoj] = terRozm;\n       }\n   int maxi = 0;\n   for (int i = 1; i <= N - K + 1; i++) {\n     dolicz(i, 1, i + K - 1, K, true);\n     dolicz(i - 1, 1, i - 1, K);\n     dolicz(i + K, 1, i + K, K);\n     dolicz(i, 0, i + K - 1, 0);\n     dolicz(i, K + 1, i + K - 1, K + 1);\n     maxi = std::max(wyn, maxi);\n     for (int x = 2; x <= N + 2; x++) {\n       odejmij(i, x - 2, i + K - 1, x - 2);\n       odejmij(i, x - 1, i + K - 1, x - 1, true);\n       dolicz(i, x - 1, i + K - 1, x - 1);\n       odejmij(i, x + K - 1, i + K - 1, x + K - 1);\n       dolicz(i, x + K - 1, i + K - 1, x + K - 1, true);\n       dolicz(i, x + K, i + K - 1, x + K);\n       odejmij(i - 1, x - 1, i - 1, x - 1);\n       dolicz(i - 1, x + K - 1, i - 1, x + K - 1);\n       odejmij(i + K, x - 1, i + K, x - 1);\n       dolicz(i + K, x + K - 1, i + K, x + K - 1);\n       maxi = std::max(wyn, maxi);\n     }\n   }\n   printf('%d', maxi);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, x, c, a[200001], tin[200001], tout[200001], sz[200001], seg[524288];\n string s;\n bool lazy[524288];\n vector<int> G[200001];\n void dfs(int i) {\n   tin[i] = ++c;\n   ++sz[i];\n   for (int j : G[i]) {\n     dfs(j);\n     sz[i] += sz[j];\n   }\n   tout[i] = c;\n }\n void upd(int l, int r, int s = 1, int e = n, int i = 1) {\n   if (lazy[i]) {\n     seg[i] = (e - s + 1) - seg[i];\n     if (s != e) {\n       lazy[2 * i] ^= 1;\n       lazy[2 * i + 1] ^= 1;\n     }\n     lazy[i] = 0;\n   }\n   if (s > r || e < l) return;\n   if (s >= l && e <= r) {\n     seg[i] = (e - s + 1) - seg[i];\n     if (s != e) {\n       lazy[2 * i] ^= 1;\n       lazy[2 * i + 1] ^= 1;\n     }\n     return;\n   }\n   int mid = (s + e) / 2;\n   upd(l, r, s, mid, 2 * i);\n   upd(l, r, mid + 1, e, 2 * i + 1);\n   seg[i] = seg[2 * i] + seg[2 * i + 1];\n }\n int que(int l, int r, int s = 1, int e = n, int i = 1) {\n   if (lazy[i]) {\n     seg[i] = (e - s + 1) - seg[i];\n     if (s != e) {\n       lazy[2 * i] ^= 1;\n       lazy[2 * i + 1] ^= 1;\n     }\n     lazy[i] = 0;\n   }\n   if (s > r || e < l) return 0;\n   if (s >= l && e <= r) return seg[i];\n   int mid = (s + e) / 2;\n   return que(l, r, s, mid, 2 * i) + que(l, r, mid + 1, e, 2 * i + 1);\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n;\n   for (int i = 2; i <= n; ++i) {\n     cin >> x;\n     G[x].push_back(i);\n   }\n   for (int i = 1; i <= n; ++i) cin >> a[i];\n   dfs(1);\n   for (int i = 1; i <= n; ++i)\n     if (a[i]) upd(tin[i], tin[i]);\n   cin >> m;\n   while (m--) {\n     cin >> s >> x;\n     if (s == 'pow')\n       upd(tin[x], tout[x]);\n     else\n       cout << que(tin[x], tout[x]) << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1e8 + 1;\n vector<vector<int> > adj;\n vector<bool> visited;\n int contadorNodos = 0;\n void DFS(int nodo) {\n   contadorNodos++;\n   for (auto it : adj[nodo]) {\n     DFS(it);\n   }\n }\n void letras(string &s) {\n   for (int i = 0; i < s.size(); i++) {\n     s[i] = tolower(s[i]);\n   }\n }\n int main() {\n   int n;\n   cin >> n;\n   map<string, int> m;\n   adj.resize(205);\n   visited.resize(205, false);\n   int j = 1;\n   for (int i = 0; i < n; i++) {\n     string a, b, c;\n     cin >> a >> b >> c;\n     letras(a);\n     letras(c);\n     if (m[a] == 0) {\n       m[a] = j;\n       j++;\n     }\n     if (m[c] == 0) {\n       m[c] = j;\n       j++;\n     }\n     adj[m[a]].push_back(m[c]);\n   }\n   int res = 0;\n   for (int i = 1; i < j; i++) {\n     contadorNodos = 0;\n     DFS(i);\n     res = max(res, contadorNodos);\n   }\n   cout << res << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const bool online_judge = true;\n const long long inf = 1LL << 60;\n long long toInt(string s) {\n   long long res;\n   stringstream ss;\n   ss << s;\n   ss >> res;\n   return res;\n }\n string toString(long long n) {\n   stringstream ss;\n   ss << n;\n   return ss.str();\n }\n long long w, h;\n vector<string> f;\n typedef struct {\n   long long x;\n   long long y;\n   long long dp;\n   long long cp;\n } state;\n state memo[55][55][5][5];\n long long dx[4] = {0, 1, 0, -1};\n long long dy[4] = {-1, 0, 1, 0};\n long long ex[4] = {-1, 0, 1, 0};\n long long ey[4] = {0, -1, 0, 1};\n state solve(long long y, long long x, long long dp, long long cp) {\n   if (memo[y][x][dp][cp].x != -1) return memo[y][x][dp][cp];\n   state ans;\n   long long nx = x + dx[dp];\n   long long ny = y + dy[dp];\n   long long mx = x + ex[(dp + (cp ? 2 : 0)) % 4];\n   long long my = y + ey[(dp + (cp ? 2 : 0)) % 4];\n   if (f[ny][nx] == f[y][x]) {\n     ans = solve(ny, nx, dp, cp);\n   } else if (f[my][mx] == f[y][x]) {\n     ans = solve(my, mx, dp, cp);\n   } else {\n     char c = f[ny][nx];\n     if (c == '0') {\n       if (cp == 0) {\n         ans.y = y;\n         ans.x = x;\n         ans.dp = dp;\n         ans.cp = 1;\n       } else {\n         ans.y = y;\n         ans.x = x;\n         ans.dp = (dp + 1) % 4;\n         ans.cp = 0;\n       }\n     } else {\n       ans.x = nx;\n       ans.y = ny;\n       ans.dp = dp;\n       ans.cp = cp;\n     }\n   }\n   memo[y][x][dp][cp] = ans;\n   return ans;\n }\n void run() {\n   long long m, n;\n   cin >> m >> n;\n   for (long long _ = 0; _ < m; _++) {\n     string tmp;\n     cin >> tmp;\n     f.push_back(tmp);\n   }\n   w = f[0].size();\n   h = m;\n   for (long long i = 0; i < m; i++) {\n     f[i] = '0' + f[i] + '0';\n   }\n   f.insert(f.begin(), string(w + 2, '0'));\n   f.push_back(string(w + 2, '0'));\n   for (long long i = 1; i <= h; i++) {\n     for (long long j = 1; j <= w; j++) {\n       for (long long dp = 0; dp <= 3; dp++) {\n         for (long long cp = 0; cp <= 1; cp++) {\n           memo[i][j][dp][cp].x = -1;\n         }\n       }\n     }\n   }\n   for (long long i = 1; i <= h; i++) {\n     for (long long j = 1; j <= w; j++) {\n       for (long long dp = 0; dp <= 3; dp++) {\n         for (long long cp = 0; cp <= 1; cp++) {\n           solve(i, j, dp, cp);\n         }\n       }\n     }\n   }\n   long long x = 1, y = 1, dp = 1, cp = 0;\n   while (n--) {\n     state next = memo[y][x][dp][cp];\n     x = next.x;\n     y = next.y;\n     dp = next.dp;\n     cp = next.cp;\n   }\n   cout << f[y][x] << endl;\n }\n int main(int argc, char *argv[]) {\n   run();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 2e5 + 100;\n struct node {\n   int flag, a, b;\n   long long sum;\n } t[maxn * 8];\n int a[maxn], cnt[maxn * 2], js[maxn * 2];\n void pushdown(int x, int l, int r) {\n   if (t[x].flag) {\n     int num = t[x].flag;\n     t[2 * x].sum += num * l;\n     t[2 * x + 1].sum += num * r;\n     t[2 * x].flag += num;\n     t[2 * x + 1].flag += num;\n     t[x].flag = 0;\n   }\n }\n int ask(int x, int l, int r, int pos) {\n   int mid;\n   if (l == r) {\n     return t[x].sum;\n   }\n   mid = (l + r) / 2;\n   pushdown(x, mid - l + 1, r - mid);\n   if (pos <= mid)\n     return ask(2 * x, l, mid, pos);\n   else\n     return ask(2 * x + 1, mid + 1, r, pos);\n }\n void add(int x, int l, int r, int ql, int qr, int val) {\n   int mid;\n   if (ql == l && qr == r) {\n     t[x].flag += val;\n     t[x].sum += (qr - ql + 1);\n     return;\n   }\n   mid = (l + r) / 2;\n   pushdown(x, mid - l + 1, r - mid);\n   if (qr <= mid) {\n     add(2 * x, l, mid, ql, qr, val);\n   } else {\n     if (ql > mid)\n       add(2 * x + 1, mid + 1, r, ql, qr, val);\n     else {\n       add(2 * x, l, mid, ql, mid, val);\n       add(2 * x + 1, mid + 1, r, mid + 1, qr, val);\n     }\n   }\n   t[x].sum = t[2 * x].sum + t[2 * x + 1].sum;\n }\n void build(int x, int l, int r) {\n   int mid;\n   t[x].flag = 0;\n   t[x].sum = 0;\n   if (l == r) {\n     return;\n   }\n   mid = (l + r) / 2;\n   build(2 * x, l, mid);\n   build(2 * x + 1, mid + 1, r);\n }\n int top;\n node s[maxn];\n int cmp(node a, node b) { return a.sum < b.sum; }\n int main() {\n   node e;\n   int T, n, flag, ans, k, up;\n   scanf('%d', &T);\n   while (T--) {\n     scanf('%d%d', &n, &k);\n     for (int i = 1; i <= 2 * k; i++) {\n       cnt[i] = 0;\n       js[i] = 0;\n     }\n     build(1, 1, k * 2);\n     for (int i = 1; i <= n; i++) {\n       scanf('%d', &a[i]);\n     }\n     if (n == 2) {\n       printf('0\n');\n       continue;\n     }\n     top = 0;\n     if (n % 2)\n       up = n / 2 + 1;\n     else\n       up = n / 2;\n     for (int i = 1; i <= up; i++) {\n       e.a = a[i];\n       e.b = a[n - i + 1];\n       if (e.a > e.b) swap(e.a, e.b);\n       e.sum = e.a + e.b;\n       s[++top] = e;\n       js[e.sum]++;\n     }\n     sort(s + 1, s + top + 1, cmp);\n     int last = 0;\n     ans = n;\n     for (int i = 1; i <= top; i++) {\n       e = s[i];\n       if (e.sum == last) {\n         add(1, 1, 2 * k, e.a + 1, e.b + k, 1);\n         continue;\n       }\n       cnt[e.sum] += n / 2 - js[e.sum] + i - 1 - ask(1, 1, 2 * k, e.sum);\n       add(1, 1, 2 * k, e.a + 1, e.b + k, 1);\n       last = e.sum;\n     }\n     for (int i = 1; i <= top / 2; i++) {\n       swap(s[i], s[top - i + 1]);\n     }\n     build(1, 1, k * 2);\n     last = 0;\n     ans = n;\n     for (int i = 1; i <= top; i++) {\n       e = s[i];\n       if (e.sum == last) {\n         add(1, 1, 2 * k, e.a + 1, e.b + k, 1);\n         continue;\n       }\n       cnt[e.sum] += i - 1 - ask(1, 1, 2 * k, e.sum);\n       ans = min(ans, cnt[e.sum]);\n       add(1, 1, 2 * k, e.a + 1, e.b + k, 1);\n       last = e.sum;\n     }\n     for (int i = 1; i <= 2 * k; i++) {\n       if (js[i]) continue;\n       ans = min(ans, n - ask(1, 1, 2 * k, i));\n     }\n     printf('%d\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, a[100001], b[100001];\n vector<long long> v[100001];\n signed main() {\n   cin >> n;\n   long long i;\n   for (i = 1; i < n + 1; i++) {\n     cin >> a[i];\n     v[a[i]].push_back(i);\n   }\n   bool ok = 1;\n   long long clr = 1;\n   for (i = 0; i < 100001; i++) {\n     if (!v[i].empty()) {\n       long long k = v[i].size();\n       long long j;\n       if (k % (n - i) != 0) {\n         ok = 0;\n         break;\n       }\n       long long t = k / (n - i);\n       long long temp = 1;\n       j = 0;\n       while (temp <= t) {\n         while (j < temp * (n - i)) {\n           b[v[i][j]] = clr;\n           j++;\n         }\n         clr++;\n         temp++;\n       }\n     }\n   }\n   if (ok) {\n     cout << 'Possible\n';\n     for (i = 1; i < n + 1; i++) cout << b[i] << ' ';\n   } else\n     cout << 'Impossible';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n bool uin(T &a, T b) {\n   return a > b ? (a = b, true) : false;\n }\n template <class T>\n bool uax(T &a, T b) {\n   return a < b ? (a = b, true) : false;\n }\n const long long maxn = 1000001, mod = 1e9 + 7;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   int ar[n];\n   map<int, int> mapp;\n   for (long long i = 0; i < (long long)(n); ++i) {\n     cin >> ar[i];\n     mapp[ar[i]] = i;\n   }\n   set<int> s;\n   s.insert(-1);\n   s.insert(n);\n   int ans = 0;\n   for (int i = n; i >= 1; i--) {\n     int idx = mapp[i];\n     auto it = s.lower_bound(idx);\n     auto iit = s.upper_bound(idx);\n     if (it != s.begin()) it--;\n     int a = *it + 1;\n     int b = *iit - 1;\n     if (idx - a < b - idx) {\n       for (long long j = (long long)(a); j <= (long long)(idx - 1); ++j) {\n         int acha = mapp[i - ar[j]];\n         if (acha > idx && acha <= b) {\n           ans++;\n         }\n       }\n     } else {\n       for (long long j = (long long)(idx + 1); j <= (long long)(b); ++j) {\n         int acha = mapp[i - ar[j]];\n         if (acha < idx && acha >= a) {\n           ans++;\n         }\n       }\n     }\n     s.insert(mapp[i]);\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Trie {\n   Trie *nx[2];\n   int cnt;\n   Trie() {\n     nx[0] = nx[1] = nullptr;\n     cnt = 0;\n   }\n };\n Trie *root;\n void ins(long long x) {\n   Trie *now = root;\n   for (int bit = 45; bit >= 0; --bit) {\n     int p = (x >> bit) & 1LL;\n     if (now->nx[p] == nullptr) now->nx[p] = new Trie();\n     now = now->nx[p];\n     now->cnt++;\n   }\n }\n long long query(long long x) {\n   Trie *now = root;\n   long long ret = 0LL;\n   for (int bit = 45; bit >= 0; --bit) {\n     int p = (x >> bit) & 1LL;\n     p ^= 1;\n     if (now->nx[p] != nullptr && now->nx[p]->cnt > 0) {\n       ret += 1LL << bit;\n       now = now->nx[p];\n     } else {\n       now = now->nx[p ^ 1];\n     }\n     if (now == nullptr || now->cnt == 0) break;\n   }\n   return ret;\n }\n const int MXSZ = 1e5;\n int n;\n long long a[MXSZ + 5];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   root = new Trie();\n   cin >> n;\n   long long curr = 0LL;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n     curr ^= a[i];\n     ins(curr);\n   }\n   long long mx = 0LL;\n   mx = max(mx, query(0));\n   curr = 0LL;\n   for (int i = n; i >= 1; --i) {\n     curr ^= a[i];\n     mx = max(mx, query(curr));\n   }\n   cout << mx << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int b[5000];\n int f[5000];\n int main() {\n   scanf(' %d', &n);\n   for (int i = 0; i < (int)(n); i++) scanf(' %d', b + i);\n   for (int i = 0; i < (int)(n); i++) b[i]--;\n   for (int i = 0; i < n; i++) {\n     int c[5000] = {};\n     pair<int, int> best = make_pair(0, 0);\n     for (int j = i; j < n; j++) {\n       c[b[j]]++;\n       best = max(best, make_pair(c[b[j]], -b[j]));\n       f[-best.second]++;\n     }\n   }\n   for (int i = 0; i < (int)(n); i++) printf('%d ', f[i]);\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n int t;\n int main() {\n   cin >> t;\n   while (t--) {\n     int n, m;\n     bool nope = false;\n     cin >> n >> m;\n     for (int i = 0; i != n; i++) {\n       for (int j = 0; j != m; j++) {\n         ll a;\n         cin >> a;\n         if ((a > 4 && 0 < j < m - 1 && 0 < i < n - 1) || (a > 3 && j == 0) ||\n             (a > 3 && j == m - 1) || (a > 3 && i == 0) ||\n             (a > 3 && i == n - 1) || (a > 2 && j == 0 && i == 0) ||\n             (a > 2 && j == 0 && i == n - 1) ||\n             (a > 2 && j == m - 1 && i == n - 1) ||\n             (a > 2 && j == m - 1 && i == 0)) {\n           nope = true;\n         }\n       }\n     }\n     if (nope) cout << 'NO' << endl;\n     if (!nope) {\n       cout << 'YES\n';\n       for (int i = 0; i != n; i++) {\n         for (int j = 0; j != m; j++) {\n           if ((i == 0 && j == 0) || (i == 0 && j == m - 1) ||\n               (i == n - 1 && j == 0) || (i == n - 1 && j == m - 1)) {\n             cout << 2 << ' ';\n           } else if ((0 < i < n - 1 && j == 0) ||\n                      (0 < i < n - 1 && j == m - 1) ||\n                      (i == 0 && 0 < j < m - 1) ||\n                      (i == n - 1 && 0 < j < m - 1)) {\n             cout << 3 << ' ';\n           } else {\n             cout << 4 << ' ';\n           }\n         }\n         cout << '\n';\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using LL = long long;\n const int maxn = 3000010;\n int n, b;\n int pre[maxn], vis[maxn];\n vector<int> prime;\n struct init {\n   init() {\n     memset(pre, 0, sizeof pre);\n     prime.clear();\n     for (int i = 2; i < maxn; i++) {\n       if (pre[i] == 0) {\n         pre[i] = i;\n         prime.emplace_back(i);\n       }\n       for (int j = 0; j < prime.size() && i * prime[j] < maxn; j++) {\n         if (prime[j] > pre[i]) break;\n         pre[i * prime[j]] = prime[j];\n       }\n     }\n   }\n } init_;\n bool ok(int x) {\n   if (x == 1) return 0;\n   return pre[x] == 0;\n }\n signed main() {\n   while (cin >> n) {\n     memset(vis, 0, sizeof vis);\n     for (int i = 1; i <= 2 * n; i++) {\n       scanf('%d', &b);\n       vis[b]++;\n     }\n     for (int i = maxn - 1; i > 1; i--) {\n       if (pre[i] == i) continue;\n       while (vis[i] > 0) {\n         printf('%d ', i);\n         vis[i]--;\n         vis[i / pre[i]]--;\n       }\n     }\n     for (int i = 2; i < maxn; i++) {\n       while (vis[i] > 0) {\n         printf('%d ', i);\n         vis[i]--;\n         vis[prime[i - 1]]--;\n       }\n     }\n     printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(0), cin.tie(0);\n   string s;\n   cin >> s;\n   sort(s.begin(), s.end());\n   reverse(s.begin(), s.end());\n   cout << s[0];\n   for (long long int(i) = (1); (i) < (s.length()); (i)++) {\n     if (s[i] == s[i - 1])\n       cout << s[i];\n     else\n       break;\n   }\n   cout << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     if ((i * (i + 1)) / 2 == n) {\n       cout << 'YES' << endl;\n       return 0;\n     }\n     if ((i * (i + 1)) / 2 > n) {\n       cout << 'NO' << endl;\n       return 0;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool KT(long long k, long long n) {\n   long long take = 0, cur = n;\n   while (cur > 0) {\n     long long temp = min(k, cur);\n     take += temp;\n     cur -= temp;\n     cur -= cur / 10;\n   }\n   if (take * 2 >= n) return true;\n   return false;\n }\n int main() {\n   long long n;\n   cin >> n;\n   long long left = 1, right = n, res = 0;\n   while (left <= right) {\n     long long mid = (left + right) / 2;\n     if (KT(mid, n)) {\n       res = mid;\n       right = mid - 1;\n     } else {\n       left = mid + 1;\n     }\n   }\n   cout << res;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct in {\n   int x, y;\n } a[300000];\n int get(int prex, int prey, int x, int y, int k) {\n   int num, ans = 100000000;\n   if (prex <= k) {\n     num = (prex + x + k - 1) / k - 1;\n     if (y == num)\n       ans = prex + x - num * k;\n     else if (y > num && y <= (long long)x * k)\n       ans = 1;\n   }\n   if (prey <= k) {\n     num = (x + k - 1) / k - 1;\n     if (y == num)\n       ans = min(ans, x - num * k);\n     else if (y > num && y - k + prey <= (long long)(x - 1) * k)\n       ans = 1;\n   }\n   return ans;\n }\n int main() {\n   int N, K, pre0 = 0, pre1 = 0, next0, next1;\n   scanf('%d%d', &N, &K);\n   for (int i = 1; i <= N; i++) scanf('%d', &a[i].x);\n   for (int i = 1; i <= N; i++) scanf('%d', &a[i].y);\n   for (int i = 1; i <= N; i++) {\n     next0 = get(pre0, pre1, a[i].x, a[i].y, K);\n     next1 = get(pre1, pre0, a[i].y, a[i].x, K);\n     pre0 = next0;\n     pre1 = next1;\n   }\n   if (pre0 <= K || pre1 <= K)\n     puts('YES');\n   else\n     puts('NO');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n float a1(float x, float y, float z) {\n   if (x >= 1.0)\n     return z * log(y) + log(log(x));\n   else if (x < 1.0 && y < 1.0 && z < 1.0)\n     return z * log(y) + log(log(1 / x));\n   else\n     return 0.0 / 0.0;\n }\n float a2(float x, float y, float z) {\n   if (x >= 1.0)\n     return log(z) + log(y) + log(log(x));\n   else if (x < 1.0 && y < 1.0 && z < 1.0)\n     return log(z) + log(y) + log(log(1 / x));\n   else\n     return 0.0 / 0.0;\n }\n int main() {\n   float x, y, z;\n   scanf('%f %f %f', &x, &y, &z);\n   float a[12];\n   char pat[12][10] = {'x^y^z\0', 'x^z^y\0', '(x^y)^z\0', '(x^z)^y\0',\n                       'y^x^z\0', 'y^z^x\0', '(y^x)^z\0', '(y^z)^x\0',\n                       'z^x^y\0', 'z^y^x\0', '(z^x)^y\0', '(z^y)^x\0'};\n   a[0] = a1(x, y, z);\n   a[1] = a1(x, z, y);\n   a[2] = a2(x, y, z);\n   a[3] = a2(x, z, y);\n   a[4] = a1(y, x, z);\n   a[5] = a1(y, z, x);\n   a[6] = a2(y, x, z);\n   a[7] = a2(y, z, x);\n   a[8] = a1(z, x, y);\n   a[9] = a1(z, y, x);\n   a[10] = a2(z, x, y);\n   a[11] = a2(z, y, x);\n   float ans;\n   int pos, i;\n   if (x >= 1.0) {\n     ans = a[0];\n     pos = 0;\n   } else if (y >= 1.0) {\n     ans = a[4];\n     pos = 4;\n   } else {\n     ans = a[8];\n     pos = 8;\n   }\n   if (x < 1 && y < 1 && z < 1) {\n     for (i = 11; i >= 0; --i) {\n       if (a[i] <= ans) {\n         ans = a[i];\n         pos = i;\n       }\n     }\n   } else {\n     for (i = 11; i >= 0; --i) {\n       if (a[i] >= ans) {\n         ans = a[i];\n         pos = i;\n       }\n     }\n   }\n   printf('%s', pat[pos]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> vi;\n void primefact(int n) {\n   while (n % 2 == 0) {\n     vi.push_back(2);\n     n /= 2;\n   }\n   int i = 3;\n   while (i <= n) {\n     while (n % i == 0) {\n       vi.push_back(i);\n       n /= i;\n     }\n     i += 2;\n   }\n   if (n > 2) vi.push_back(n);\n }\n int main() {\n   int n, k, last = 1, i;\n   cin >> n >> k;\n   primefact(n);\n   if (k > vi.size())\n     cout << '-1' << endl;\n   else {\n     for (i = 0; i < k - 1; i++) cout << vi[i] << ' ';\n     for (i = k - 1; i < vi.size(); i++) last *= vi[i];\n     cout << last;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 200005;\n const long long INF = 1e9;\n const long long MOD = 1000000007;\n int prevs[20];\n int main() {\n   ios ::sync_with_stdio(0);\n   cin.tie(0);\n   int n, q;\n   cin >> n >> q;\n   int arr[n];\n   for (int i = 0; i < n; i++) cin >> arr[i];\n   int ar[n][20];\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < 20; j++) ar[i][j] = n + 3;\n   for (int i = n - 1; i >= 0; i--) {\n     int x = 1;\n     for (int j = 0; j < 20; j++) {\n       if ((x << j) & arr[i]) {\n         ar[i][j] = i;\n         if (prevs[j] != 0)\n           for (int k = 0; k < 20; k++)\n             ar[i][k] = min(ar[i][k], ar[prevs[j]][k]);\n         prevs[j] = i;\n       }\n     }\n   }\n   while (q--) {\n     int x, y;\n     cin >> x >> y;\n     x--, y--;\n     if (!arr[x] || !arr[y]) {\n       cout << 'Fou' << endl;\n       continue;\n     }\n     int p = 1;\n     int l = 0;\n     for (int j = 0; j < 20; j++)\n       if (p << j & arr[y])\n         if (ar[x][j] <= y) {\n           l = 1;\n           continue;\n         }\n     if (l == 1)\n       cout << 'Shi' << endl;\n     else\n       cout << 'Fou' << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n char s[1000005];\n int main() {\n   int i, j, l, r, p = 0;\n   scanf('%s', s);\n   n = strlen(s);\n   for (j = 0; j < n && s[j] != '.'; j++)\n     ;\n   if (j == n) {\n     s[n] = '.';\n     n++;\n   }\n   for (i = 0; i < n && s[i] == '0'; i++)\n     ;\n   if (i == j) {\n     for (; i < n - 1 && s[i + 1] == '0'; i++) swap(s[i], s[i + 1]), p--;\n     if (i == n - 1) {\n       printf('0\n');\n       return 0;\n     }\n     swap(s[i], s[i + 1]), p--;\n     for (r = n - 1; s[r] == '0'; r--)\n       ;\n     if (s[r] == '.') r--;\n     for (; i <= r; i++) printf('%c', s[i]);\n     if (p != 0) printf('E%d\n', p);\n   } else {\n     for (; j > i + 1; j--) swap(s[j], s[j - 1]), p++;\n     for (r = n - 1; s[r] == '0'; r--)\n       ;\n     if (s[r] == '.') r--;\n     for (; i <= r; i++) printf('%c', s[i]);\n     if (p != 0) printf('E%d\n', p);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int Maxn = 1000 + 10;\n const int INF = 0x7f7f7f7f;\n const double eps = 1e-10;\n const double pi = acos(-1.0);\n inline int realcmp(double a, double b) {\n   return (a > b + eps) ? 1 : ((a + eps < b) ? -1 : 0);\n }\n int main() {\n   double hh, mm;\n   ios::sync_with_stdio(0);\n   scanf('%lf:%lf', &hh, &mm);\n   hh += mm / 60;\n   while (realcmp(hh, 12) >= 0) hh -= 12;\n   printf('%.9lf ', 30.0 * hh);\n   printf('%.9lf\n', 6.0 * mm);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n struct point {\n   long x;\n   long y;\n   long z;\n };\n const long maxn = 5001;\n const double inf = 2000000000;\n const double eps = 1.0e-8;\n point a[maxn];\n double nnew, min;\n long n, q, choice1, choice2;\n double d[maxn];\n double sqr(double x) { return (x * x); }\n double dist(point a, point b) {\n   return (pow(sqr(a.x - b.x) + sqr(a.y - b.y) + sqr(a.z - b.z), 0.5));\n }\n int main() {\n   scanf('%ld', &n);\n   for (q = 1; q <= n; q++) scanf('%ld%ld%ld', &a[q].x, &a[q].y, &a[q].z);\n   min = inf;\n   for (long h = 2; h <= n; h++) d[h] = dist(a[1], a[h]);\n   for (choice1 = 2; choice1 <= n; choice1++)\n     for (choice2 = choice1 + 1; choice2 <= n; choice2++) {\n       nnew = (d[choice1] + d[choice2] + dist(a[choice1], a[choice2])) / 2;\n       if (min - nnew > eps) min = nnew;\n     }\n   printf('%0.8lf', min);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, x, i, y, ans = 0, q;\n   scanf('%d%d', &n, &x);\n   y = int(sqrt(x));\n   if (n < y) y = n;\n   for (i = 1; i <= y; i++) {\n     if (x % i == 0) {\n       q = x / i;\n       if (q <= n) {\n         if (i == q)\n           ans++;\n         else\n           ans += 2;\n       }\n     }\n   }\n   if (x == 1)\n     printf('%d\n', 1);\n   else\n     printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mx = 1e9;\n struct Data {\n   int p1, p2, p3, p4;\n   Data(int a = mx, int b = mx, int c = mx, int d = mx) {\n     p1 = a, p2 = b, p3 = c, p4 = d;\n   }\n };\n inline Data UN(Data a, Data b) {\n   Data c;\n   c.p1 = min(a.p1 + b.p1, a.p2 + b.p3), c.p2 = min(a.p1 + b.p2, a.p2 + b.p4);\n   c.p3 = min(a.p3 + b.p1, a.p4 + b.p3), c.p4 = min(a.p3 + b.p2, a.p4 + b.p4);\n   c.p1 = min(c.p1, mx), c.p2 = min(c.p2, mx), c.p3 = min(c.p3, mx),\n   c.p4 = min(c.p4, mx);\n   return c;\n }\n struct node {\n   int l, r;\n   Data s;\n } T[200010 << 2];\n char G[3][200010];\n void build(int rt, int l, int r) {\n   T[rt].l = l, T[rt].r = r;\n   int mid = (l + r) >> 1;\n   if (l == r) {\n     if (G[1][l] == '.') T[rt].s.p1 = 1;\n     if (G[2][l] == '.') T[rt].s.p4 = 1;\n     if (G[1][l] == '.' && G[2][l] == '.') T[rt].s.p2 = T[rt].s.p3 = 2;\n     return;\n   }\n   build(rt << 1, l, mid), build(rt << 1 | 1, mid + 1, r);\n   T[rt].s = UN(T[rt << 1].s, T[rt << 1 | 1].s);\n }\n Data query(int rt, int start, int end) {\n   int l = T[rt].l, r = T[rt].r, mid = (l + r) >> 1;\n   if (start <= l && r <= end) return T[rt].s;\n   if (end <= mid) return query(rt << 1, start, end);\n   if (start > mid) return query(rt << 1 | 1, start, end);\n   return UN(query(rt << 1, start, end), query(rt << 1 | 1, start, end));\n }\n int main() {\n   int n, q;\n   scanf('%d%d', &n, &q);\n   scanf('%s%s', G[1] + 1, G[2] + 1);\n   build(1, 1, n);\n   while (q--) {\n     int a, b;\n     scanf('%d%d', &a, &b);\n     int l = a > n ? a - n : a, r = b > n ? b - n : b, res;\n     if (l > r) swap(l, r), swap(a, b);\n     Data tmp = query(1, l, r);\n     if (a <= n && b <= n) res = tmp.p1;\n     if (a <= n && b > n) res = tmp.p2;\n     if (a > n && b <= n) res = tmp.p3;\n     if (a > n && b > n) res = tmp.p4;\n     if (res < 1e8)\n       printf('%d\n', res - 1);\n     else\n       printf('-1\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long t, x, y, a, b;\n   scanf('%lld', &t);\n   while (t--) {\n     scanf('%lld %lld %lld %lld', &x, &y, &a, &b);\n     bool yes = false;\n     int i = 0;\n     int tens = 1000000;\n     while (x <= y) {\n       if (x == y) {\n         yes = true;\n         break;\n       }\n       while (x + a * tens > y - b * tens && tens > 1) tens /= 10;\n       x += tens * a;\n       y -= tens * b;\n       i += tens;\n     }\n     printf('%d\n', yes ? i : -1);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n mt19937 rnd(228);\n const int N = 404;\n int mod;\n int fact[N], d0[N], d[N], d2[N][N];\n int main() {\n   int qq;\n   cin >> qq >> mod;\n   fact[0] = 1;\n   for (int i = 1; i < N; ++i) fact[i] = (1LL * fact[i - 1] * i) % mod;\n   d[1] = 1;\n   d0[1] = 1;\n   for (int n = 2; n < N; ++n) {\n     d0[n] = fact[n];\n     for (int k = 1; k < n; ++k)\n       d0[n] = (d0[n] - 1LL * d0[k] * fact[n - k]) % mod;\n     if (d0[n] < 0) d0[n] += mod;\n   }\n   d2[0][0] = 1;\n   for (int n = 1; n < N; ++n) {\n     d2[n][1] = fact[n];\n     for (int k = 2; k <= n; ++k)\n       for (int x = 1; x < n; ++x)\n         d2[n][k] = (d2[n][k] + 1LL * fact[x] * d2[n - x][k - 1]) % mod;\n   }\n   for (int n = 2; n < N; ++n) {\n     int dz = 0;\n     for (int x = 1; x < n - 1; ++x)\n       for (int y = x; y < n - 1; ++y) {\n         int c = fact[y - x + 1];\n         c = (1LL * c * d0[x]) % mod;\n         c = (1LL * c * d0[n - y - 1]) % mod;\n         dz += c;\n         if (dz >= mod) dz -= mod;\n       }\n     dz = (dz * 2) % mod;\n     int cd = fact[n];\n     cd = (cd - dz + mod) % mod;\n     for (int k = 3; k < n; ++k) {\n       cd = (cd - 1LL * d2[n][k] * d[k]) % mod;\n     }\n     if (n != 2) {\n       for (int x = 1; x < n; ++x) cd = (cd - 1LL * d0[x] * d0[n - x]) % mod;\n       for (int x = 1; x < n; ++x) cd = (cd - 1LL * d0[x] * d0[n - x]) % mod;\n     }\n     cd = (cd + mod) % mod;\n     d[n] = cd;\n   }\n   while (qq--) {\n     int x;\n     cin >> x;\n     cout << d[x] << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2020;\n vector<tuple<int, int, int> > edges;\n vector<int> g[N];\n vector<int> back_edge[N];\n bool global;\n int num[N], low[N], low2[N], cnt, pai[N], pw[N], aux[N], prev_pai[N],\n     prev_pw[N], sobe[N], prev_sobe[N];\n int edg_used, edg_u, edg_v, edg_w;\n void dfs(int u) {\n   num[u] = low[u] = ++cnt;\n   bool flag = false;\n   for (auto w : g[u]) {\n     int x, v, p;\n     tie(x, v, p) = edges[w];\n     if (v == u) swap(v, x);\n     if (edg_used == w) continue;\n     if (!num[v]) {\n       pai[v] = u;\n       pw[v] = p;\n       sobe[v] = w;\n       dfs(v);\n       low[u] = min(low[u], low[v]);\n     } else if (flag or pai[u] != v) {\n       low[u] = min(low[u], num[v]);\n       if (!global and num[u] > num[v]) back_edge[u].push_back(w);\n     } else if (pai[u] == v)\n       flag = true;\n   }\n }\n int main(void) {\n   int n, m;\n   scanf('%d %d', &n, &m);\n   int s, t;\n   scanf('%d %d', &s, &t);\n   for (int i = 0; i < m; i++) {\n     int u, v, w;\n     scanf('%d %d %d', &u, &v, &w);\n     g[u].push_back(i);\n     g[v].push_back(i);\n     edges.emplace_back(u, v, w);\n   }\n   edg_used = -1;\n   dfs(s);\n   global = true;\n   int S = s;\n   if (!low[t]) {\n     printf('0\n0\n');\n     return 0;\n   }\n   int ans = 0x3f3f3f3f;\n   int edg;\n   int v = t;\n   while (v != s) {\n     int u = pai[v];\n     if (low[v] > num[u]) {\n       if (pw[v] < ans) edg = sobe[v];\n       ans = min(ans, pw[v]);\n     }\n     v = u;\n   }\n   int dupla = INT_MAX;\n   int x, y;\n   for (int i = 1; i <= n; i++) {\n     if (back_edge[i].empty()) continue;\n     int k = 0, ans = 0x3f3f3f3f;\n     for (int j = 0; j < back_edge[i].size(); j++) {\n       int e = back_edge[i][j];\n       int x, v, p;\n       tie(x, v, p) = edges[e];\n       if (v == i) swap(v, x);\n       if (num[v] < ans) k = j;\n     }\n     vector<int> c[5];\n     cnt = 0;\n     for (int j = 1; j <= n; j++) {\n       c[0].push_back(num[j]);\n       c[1].push_back(low[j]);\n       c[2].push_back(pai[j]);\n       c[3].push_back(pw[j]);\n       c[4].push_back(sobe[j]);\n       num[j] = low[j] = 0;\n     }\n     tie(edg_u, edg_v, edg_w) = edges[back_edge[i][k]];\n     edg_used = back_edge[i][k];\n     dfs(s);\n     ans = 0x3f3f3f3f;\n     int v = t, edg;\n     while (v != s) {\n       int u = pai[v];\n       if (low[v] > num[u]) {\n         if (pw[v] < ans) edg = sobe[v];\n         ans = min(ans, pw[v]);\n       }\n       v = u;\n     }\n     if (ans != 0x3f3f3f3f and ans + edg_w < dupla) {\n       dupla = ans + edg_w;\n       x = back_edge[i][k];\n       y = edg;\n     }\n     for (int j = 1; j <= n; j++) {\n       num[j] = c[0][j - 1];\n       low[j] = c[1][j - 1];\n       pai[j] = c[2][j - 1];\n       pw[j] = c[3][j - 1];\n       sobe[j] = c[4][j - 1];\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     prev_pai[i] = pai[i];\n     prev_pw[i] = pw[i];\n     prev_sobe[i] = sobe[i];\n   }\n   for (int i = 1; i <= n; i++) {\n     if (i == s) continue;\n     cnt = 0;\n     for (int j = 1; j <= n; j++) num[j] = low[j] = 0;\n     tie(edg_u, edg_v, edg_w) = edges[prev_sobe[i]];\n     edg_used = prev_sobe[i];\n     dfs(s);\n     if (!low[t]) continue;\n     int ans = 0x3f3f3f3f, v = t, edg;\n     while (v != s) {\n       int u = pai[v];\n       if (low[v] > num[u]) {\n         if (pw[v] < ans) edg = sobe[v];\n         ans = min(ans, pw[v]);\n       }\n       v = u;\n     }\n     if (ans != 0x3f3f3f3f and ans + edg_w < dupla) {\n       dupla = ans + edg_w;\n       x = prev_sobe[i];\n       y = edg;\n     }\n   }\n   if (ans == 0x3f3f3f3f and dupla == INT_MAX) {\n     printf('-1\n');\n   } else if (ans < dupla and ans != 0x3f3f3f3f)\n     printf('%d\n1\n%d\n', ans, edg + 1);\n   else\n     printf('%d\n2\n%d %d\n', dupla, x + 1, y + 1);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int i, j, k;\n   j = (n * 2) - 1;\n   cout << j << ' '\n        << '2';\n   cout << endl << '1  2';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 5;\n vector<pair<int, int> > adj[N];\n int ans[N];\n int off[N];\n int lvl[N], anc[N][25];\n int n, a, b, k;\n void dfs(int u = 0, int par = 0, int l = 0) {\n   lvl[u] = l;\n   anc[u][0] = par;\n   for (auto nxt : adj[u])\n     if (nxt.first != par) dfs(nxt.first, u, l + 1);\n }\n void buildLCA() {\n   int lg = ceil(log2(n));\n   for (int j = 1; j < lg; j++)\n     for (int i = 0; i < n; i++) anc[i][j] = anc[anc[i][j - 1]][j - 1];\n }\n int LCA(int i, int j) {\n   int lg = ceil(log2(n));\n   int st = lg;\n   if (lvl[i] > lvl[j]) swap(i, j);\n   int cur = lvl[j];\n   for (; st >= 0; st--)\n     if (cur - (1 << st) >= lvl[i]) cur -= (1 << st), j = anc[j][st];\n   if (i == j) return 2 * i - j;\n   cur = lvl[i];\n   for (st = lg; st >= 0; st--)\n     if (anc[i][st] != anc[j][st])\n       cur -= (1 << st), i = anc[i][st], j = anc[j][st];\n   return anc[i][0];\n }\n int solve(int u = 0, int par = 0) {\n   int cnt = off[u];\n   for (auto nxt : adj[u]) {\n     if (par == nxt.first) continue;\n     int x = solve(nxt.first, u);\n     ans[nxt.second] = x;\n     cnt += x;\n   }\n   return cnt;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n - 1; i++) {\n     scanf('%d%d', &a, &b);\n     a--, b--;\n     adj[a].push_back({b, i});\n     adj[b].push_back({a, i});\n   }\n   dfs();\n   buildLCA();\n   scanf('%d', &k);\n   for (int i = 0; i < k; i++) {\n     scanf('%d%d', &a, &b);\n     a--, b--;\n     off[a]++, off[b]++;\n     off[LCA(a, b)] -= 2;\n   }\n   solve();\n   for (int i = 0; i < n - 1; i++) printf('%d%c', ans[i], ' \n'[i == n - 2]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n using namespace std;\n struct Point {\n   int x, y, type, index;\n } num[20005];\n int ans[10005];\n Point c;\n bool cmp(Point a, Point b) {\n   return (a.x - c.x) * (b.y - c.y) - (a.y - c.y) * (b.x - c.x) > 0;\n }\n bool cmp2(Point a, Point b) { return (a.x < b.x) || (a.x == b.x && a.y < b.y); }\n void f(int l, int r) {\n   if (l >= r) return;\n   int i;\n   swap(num[l], num[min_element(num + l, num + r + 1, cmp2) - num]);\n   for (i = l + 1; i <= r; i++) {\n     num[i].x -= num[l].x;\n     num[i].y -= num[l].y;\n   }\n   num[l].x = num[l].y = 0;\n   c = num[l];\n   sort(num + l + 1, num + r + 1, cmp);\n   int pre = num[l].type, minv = 1000000000, id = -1;\n   for (i = l + 1; i <= r; i++) {\n     pre += num[i].type;\n     if (!pre && num[i].type != num[l].type && max(i - l - 1, r - i) < minv) {\n       minv = max(i - l - 1, r - i);\n       id = i;\n     }\n   }\n   if (num[l].type == 1)\n     ans[num[id].index] = num[l].index;\n   else\n     ans[num[l].index] = num[id].index;\n   f(l + 1, id - 1);\n   f(id + 1, r);\n }\n int main() {\n   int i, n;\n   scanf('%d', &n);\n   for (i = 0; i < n; i++) {\n     scanf('%d%d', &num[i].x, &num[i].y);\n     num[i].type = -1;\n     num[i].index = i + 1;\n   }\n   for (i = 0; i < n; i++) {\n     scanf('%d%d', &num[n + i].x, &num[n + i].y);\n     num[n + i].type = 1;\n     num[n + i].index = i + 1;\n   }\n   f(0, 2 * n - 1);\n   for (i = 1; i <= n; i++) printf('%d\n', ans[i]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mn = 201000, inf = 1 << 30;\n struct node {\n   int x, y;\n } pt[mn], sub[mn];\n struct point {\n   int k, x, y, r;\n } e[mn * 2];\n int s1[mn * 2], s2[mn * 2];\n int xs[mn * 2], dis[mn], sa[mn], L;\n int n, m, i, j, step, lo, hi, mid;\n bool cmp(node a, node b) { return a.x < b.x || (a.x == b.x && a.y < b.y); }\n bool cmp1(point a, point b) { return a.x < b.x || (a.x == b.x && a.k < b.k); }\n bool subway(int i, int j) { return dis[i] > dis[j]; }\n struct tree {\n   int tt, rt[mn], s[mn * 20], le[mn * 20], ri[mn * 20];\n   int get(const int &p, int l, int r, int x, int y) {\n     if (x <= l && y >= r) return s[p];\n     int m = (l + r) / 2, res = 0;\n     if (x <= m) res += get(le[p], l, m, x, y);\n     if (y > m) res += get(ri[p], m + 1, r, x, y);\n     return res;\n   }\n   void add(const int &t, int &p, int l, int r, int k) {\n     s[p = ++tt] = s[t] + 1;\n     if (l == r) return;\n     int m = (l + r) / 2;\n     if (k <= m)\n       add(le[t], le[p], l, m, k), ri[p] = ri[t];\n     else\n       add(ri[t], ri[p], m + 1, r, k), le[p] = le[t];\n   }\n   void ins(int i, int v) { add(rt[i - 1], rt[i], 1, L, v); }\n   int query(int x, int y, int l, int r) {\n     if (x > y || l > r || x > m) return 0;\n     return get(rt[y], 1, L, l, r) - get(rt[x - 1], 1, L, l, r);\n   }\n } T;\n point eva(int k, int x, int y, int r) {\n   point res;\n   res.k = k, res.x = x, res.y = y, res.r = r;\n   return res;\n }\n void cross(int &l, int &r, int &x, int &y, int i, int t) {\n   l = max(l, pt[i].x - t), x = max(x, pt[i].y - t);\n   r = min(r, pt[i].x + t), y = min(y, pt[i].y + t);\n }\n void add(int *s, int p, int v) {\n   for (; p <= L; p += p & (-p)) s[p] = max(s[p], v);\n }\n int query(int *s, int p) {\n   int res = -inf;\n   for (; p; p -= p & (-p)) res = max(res, s[p]);\n   return res;\n }\n void get(point p) {\n   int y = lower_bound(xs + 1, xs + 1 + L, p.y) - xs;\n   if (p.k == 0)\n     add(s1, y, p.x + p.y), add(s2, L - y + 1, p.x - p.y);\n   else {\n     int t1 = p.x + p.y - query(s1, y), t2 = p.x - p.y - query(s2, L - y + 1);\n     dis[p.r] = min(dis[p.r], min(t1, t2));\n   }\n }\n void ugly(node &p) {\n   int X = p.x - p.y, Y = p.x + p.y;\n   p.x = X, p.y = Y;\n }\n void nearest() {\n   int i, tt = 0;\n   for (i = 1; i <= n; ++i) xs[++L] = pt[i].y;\n   for (i = 1; i <= m; ++i) xs[++L] = sub[i].y;\n   sort(xs + 1, xs + 1 + L);\n   L = unique(xs + 1, xs + 1 + L) - xs - 1;\n   for (i = 1; i <= n; ++i) e[++tt] = eva(1, pt[i].x, pt[i].y, i);\n   for (i = 1; i <= m; ++i) e[++tt] = eva(0, sub[i].x, sub[i].y, i);\n   sort(e + 1, e + 1 + tt, cmp1);\n   fill(dis + 1, dis + 1 + n, inf);\n   fill(s1 + 1, s1 + L + 1, -inf), fill(s2 + 1, s2 + 1 + L, -inf);\n   for (i = 1; i <= tt; ++i) get(e[i]);\n   for (i = 1; i <= tt; ++i) e[i].x = -e[i].x;\n   sort(e + 1, e + 1 + tt, cmp1);\n   fill(s1 + 1, s1 + L + 1, -inf), fill(s2 + 1, s2 + 1 + L, -inf);\n   for (i = 1; i <= tt; ++i) get(e[i]);\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (i = 1; i <= n; ++i) scanf('%d%d', &pt[i].x, &pt[i].y);\n   for (i = 1; i <= m; ++i) scanf('%d%d', &sub[i].x, &sub[i].y);\n   nearest();\n   for (i = 1; i <= n; ++i) ugly(pt[i]);\n   for (i = 1; i <= m; ++i) ugly(sub[i]);\n   sort(sub + 1, sub + 1 + m, cmp);\n   L = 0;\n   for (i = 1; i <= n; ++i) xs[++L] = pt[i].y;\n   for (i = 1; i <= m; ++i) xs[++L] = sub[i].y;\n   sort(xs + 1, xs + 1 + L), L = unique(xs + 1, xs + 1 + L) - xs - 1;\n   for (i = 1; i <= m; ++i)\n     T.ins(i, lower_bound(xs + 1, xs + 1 + L, sub[i].y) - xs);\n   for (i = 1; i <= n; ++i) sa[i] = i;\n   sort(sa + 1, sa + 1 + n, subway);\n   lo = 0, hi = dis[sa[1]];\n   int mix, mxx, miy, mxy, ct, l, r, x, y;\n   node su;\n   while (lo < hi) {\n     int mid = (lo + hi) / 2;\n     mix = miy = -inf, mxx = mxy = inf;\n     for (i = 1; i <= n; ++i) {\n       if (dis[sa[i]] > mid)\n         cross(mix, mxx, miy, mxy, sa[i], mid);\n       else {\n         ct = mid - dis[sa[i]];\n         su.y = -inf, su.x = mix - ct;\n         l = lower_bound(sub + 1, sub + 1 + m, su, cmp) - sub;\n         su.y = inf, su.x = mxx + ct;\n         r = lower_bound(sub + 1, sub + 1 + m, su, cmp) - sub - 1;\n         x = lower_bound(xs + 1, xs + 1 + L, miy - ct) - xs,\n         y = lower_bound(xs + 1, xs + 1 + L, mxy + ct + 1) - xs - 1;\n         if (T.query(l, r, x, y))\n           break;\n         else\n           cross(mix, mxx, miy, mxy, sa[i], mid);\n       }\n       if (mix > mxx || miy > mxy) break;\n     }\n     if (mix <= mxx && miy <= mxy)\n       hi = mid;\n     else\n       lo = mid + 1;\n   }\n   printf('%d\n', lo);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T, typename U>\n inline void smin(T &a, U b) {\n   if (a > b) a = b;\n }\n template <typename T, typename U>\n inline void smax(T &a, U b) {\n   if (a < b) a = b;\n }\n inline void gn(long long &first) {\n   int sg = 1;\n   char c;\n   while (((c = getchar()) < '0' || c > '9') && c != '-')\n     ;\n   c == '-' ? (sg = -1, first = 0) : (first = c - '0');\n   while ((c = getchar()) >= '0' && c <= '9') first = first * 10 + c - '0';\n   first *= sg;\n }\n inline void gn(int &first) {\n   long long t;\n   gn(t);\n   first = t;\n }\n inline void gn(unsigned long long &first) {\n   long long t;\n   gn(t);\n   first = t;\n }\n inline void gn(double &first) {\n   double t;\n   scanf('%lf', &t);\n   first = t;\n }\n inline void gn(long double &first) {\n   double t;\n   scanf('%lf', &t);\n   first = t;\n }\n int power(int a, int b, int m, int ans = 1) {\n   for (; b; b >>= 1, a = 1LL * a * a % m)\n     if (b & 1) ans = 1LL * ans * a % m;\n   return ans;\n }\n int N, M, E, W;\n int dis[101000];\n queue<int> Q;\n int pre[101000], edg[101000][3], cnt[101000], val[101000];\n map<pair<int, int>, int> state, flag;\n vector<int> adj[101000];\n int len = 0x3f3f3f3f, tot;\n void Dijk(int s) {\n   memset(dis, 0x3f, sizeof(dis));\n   Q.push(s);\n   dis[s] = 0;\n   cnt[s] = 0;\n   val[s] = W;\n   while (!Q.empty()) {\n     int u = Q.front();\n     Q.pop();\n     for (int i = 0; i < adj[u].size(); i++) {\n       int v = adj[u][i], k;\n       if (!state[pair<int, int>(u, v)])\n         k = val[u] + 1;\n       else\n         k = val[u] - 1;\n       if (dis[v] > dis[u] + 1) {\n         dis[v] = dis[u] + 1;\n         pre[v] = u;\n         val[v] = k;\n         Q.push(v);\n       } else if (dis[v] == dis[u] + 1 && val[v] > k) {\n         val[v] = k;\n         pre[v] = u;\n         Q.push(v);\n       }\n     }\n   }\n }\n int main() {\n   int u, v, w;\n   scanf('%d%d', &N, &M);\n   for (int i = 0; i < M; i++) {\n     scanf('%d%d%d', &u, &v, &w);\n     adj[u].push_back(v);\n     adj[v].push_back(u);\n     state[pair<int, int>(u, v)] = w;\n     state[pair<int, int>(v, u)] = w;\n     edg[i][0] = u;\n     edg[i][1] = v;\n     edg[i][2] = w;\n     W += w;\n   }\n   Dijk(1);\n   u = N;\n   while (u != 1) {\n     flag[pair<int, int>(u, pre[u])] = 1;\n     flag[pair<int, int>(pre[u], u)] = 1;\n     u = pre[u];\n   }\n   tot = 0;\n   for (int i = 0; i < M; i++) {\n     u = edg[i][0];\n     v = edg[i][1];\n     w = edg[i][2];\n     if (!flag[pair<int, int>(u, v)] && w == 1)\n       tot++;\n     else if (flag[pair<int, int>(u, v)] && w == 0)\n       tot++;\n   }\n   printf('%d\n', tot);\n   for (int i = 0; i < M; i++) {\n     u = edg[i][0];\n     v = edg[i][1];\n     w = edg[i][2];\n     if (!flag[pair<int, int>(u, v)] && w == 1) {\n       printf('%d %d 0\n', u, v);\n     } else if (flag[pair<int, int>(u, v)] && w == 0) {\n       printf('%d %d 1\n', u, v);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 35005;\n struct Node {\n   int l, r;\n   int lazy;\n   int Max;\n } node[maxn << 2];\n int n, k;\n int a[maxn];\n int pre[maxn];\n int dp[maxn];\n void push_down(int root) {\n   node[root << 1].lazy += node[root].lazy;\n   node[root << 1 | 1].lazy += node[root].lazy;\n   node[root << 1].Max += node[root].lazy;\n   node[root << 1 | 1].Max += node[root].lazy;\n   node[root].lazy = false;\n }\n void push_up(int root) {\n   node[root].Max = max(node[root << 1].Max, node[root << 1 | 1].Max);\n }\n void build(int l, int r, int root) {\n   node[root].l = l, node[root].r = r;\n   node[root].lazy = 0;\n   if (l == r) {\n     node[root].Max = dp[l];\n     return;\n   }\n   int mid = (l + r) >> 1;\n   build(l, mid, root << 1);\n   build(mid + 1, r, root << 1 | 1);\n   push_up(root);\n }\n void update(int l, int r, int root) {\n   if (node[root].l >= l && node[root].r <= r) {\n     node[root].lazy += 1;\n     node[root].Max += 1;\n     return;\n   }\n   if (node[root].lazy) push_down(root);\n   int mid = (node[root].l + node[root].r) >> 1;\n   if (l <= mid) update(l, r, root << 1);\n   if (r > mid) update(l, r, root << 1 | 1);\n   push_up(root);\n }\n int query(int l, int r, int root) {\n   if (node[root].l >= l && node[root].r <= r) {\n     return node[root].Max;\n   }\n   if (node[root].lazy) push_down(root);\n   int t1 = 0, t2 = 0;\n   int mid = (node[root].l + node[root].r) >> 1;\n   if (l <= mid) t1 = query(l, r, root << 1);\n   if (r > mid) t2 = query(l, r, root << 1 | 1);\n   push_up(root);\n   if (t1 > t2) return t1;\n   return t2;\n }\n int main() {\n   scanf('%d%d', &n, &k);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]);\n   memset(dp, 0, sizeof(dp));\n   for (int i = 1; i <= k; i++) {\n     build(0, n, 1);\n     for (int j = 0; j < maxn; j++) pre[j] = 0;\n     for (int j = 1; j <= n; j++) {\n       update(pre[a[j]], j - 1, 1);\n       pre[a[j]] = j;\n       dp[j] = query(0, j - 1, 1);\n     }\n   }\n   printf('%d\n', dp[n]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void small(long long m, long long s) {\n   vector<long long> v;\n   long long p = (s % 9 == 0) ? s / 9 - 1 : s / 9;\n   for (long long i = 0; i < p; i++) {\n     v.push_back(9);\n     s -= 9;\n   }\n   if (m - p == 1) {\n     v.push_back(s);\n   }\n   if (m - p >= 2) {\n     s--;\n     v.push_back(s);\n     for (long long i = 0; i < m - p - 2; i++) {\n       v.push_back(0);\n     }\n     v.push_back(1);\n   }\n   for (long long i = v.size() - 1; i >= 0; i--) {\n     cout << v[i];\n   }\n   cout << ' ';\n }\n void great(long long m, long long s) {\n   vector<long long> v;\n   long long k = s / 9;\n   for (long long i = 0; i < k; i++) {\n     v.push_back(9);\n     s -= 9;\n   }\n   if (s > 0) {\n     v.push_back(s);\n     k++;\n   }\n   for (long long i = 0; i < m - k; i++) {\n     v.push_back(0);\n   }\n   for (long long i = 0; i < v.size(); i++) {\n     cout << v[i];\n   }\n }\n int main() {\n   long long m, s, h;\n   string k;\n   vector<int> v;\n   cin >> m >> s;\n   if (s % 9 == 0) {\n     long long t = 0;\n     if (m == 1 && s == 0) {\n       cout << '0 '\n            << '0';\n       t = 1;\n     }\n     if (t == 0) {\n       if (m < s / 9 || s == 0) {\n         cout << '-1 '\n              << '-1';\n       } else {\n         small(m, s);\n         great(m, s);\n       }\n     }\n   } else if (s % 9 != 0) {\n     long long t = 0;\n     if (m == 1 && s == 0) {\n       cout << '0 '\n            << '0';\n       t = 1;\n     }\n     if (t == 0) {\n       if (m < s / 9 + 1 || s == 0) {\n         cout << '-1 '\n              << '-1';\n       } else {\n         small(m, s);\n         great(m, s);\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int mod = 1e9 + 7;\n long long int inf = 1e9 + 7;\n void solve() {\n   long long int n;\n   cin >> n;\n   if (n <= 2) {\n     cout << '-1' << endl;\n   } else {\n     long long int i;\n     for (i = n; i >= 1; i--) {\n       cout << i << ' ';\n     }\n     cout << endl;\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long int t = 1;\n   while (t--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   string s, t;\n   cin >> s >> t;\n   int cost = 0;\n   for (int i = 0; i < n;) {\n     if (s[i] != t[i]) {\n       if (i + 1 < n && s[i] != s[i + 1] && s[i + 1] != t[i + 1]) {\n         i += 2;\n       } else {\n         i++;\n       }\n       cost++;\n     } else {\n       i++;\n     }\n   }\n   cout << cost << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long read() {\n   long long x = 0, f = 1;\n   char ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') {\n     x = x * 10 + (ch ^ 48);\n     ch = getchar();\n   }\n   return x * f;\n }\n const long long N = 100010;\n struct edge {\n   long long v, nxt;\n } e[N << 1];\n long long head[N], cnt, n, x, y, a[N], dp[N][2], f[N], g[N], h[N];\n inline void add(long long u, long long v) {\n   e[++cnt].v = v;\n   e[cnt].nxt = head[u];\n   head[u] = cnt;\n }\n inline void dfs(long long u, long long fa) {\n   dp[u][0] = dp[u][1] = f[u] = g[u] = a[u];\n   h[u] = 0;\n   for (long long i = head[u]; i; i = e[i].nxt) {\n     long long v = e[i].v;\n     if (v == fa) continue;\n     dfs(v, u);\n     dp[u][0] = max(dp[u][0], max(dp[v][0], dp[u][1] + dp[v][1]));\n     dp[u][0] = max(dp[u][0], max(f[u] + g[v], f[v] + g[u]));\n     dp[u][1] = max(dp[u][1], max(dp[v][1], f[u] + f[v]));\n     g[u] = max(g[u], a[u] + g[v]);\n     g[u] = max(g[u], max(f[u] + dp[v][1], f[v] + a[u] + h[u]));\n     h[u] = max(h[u], dp[v][1]);\n     f[u] = max(f[u], f[v] + a[u]);\n   }\n }\n inline void mian() {\n   n = read();\n   for (long long i = 1; i <= n; ++i) a[i] = read();\n   for (long long i = 1; i <= n - 1; ++i) {\n     x = read();\n     y = read();\n     add(x, y);\n     add(y, x);\n   }\n   dfs(1, 0);\n   printf('%lld\n', dp[1][0]);\n }\n signed main() {\n   long long qwq = 1;\n   while (qwq--) mian();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     string s;\n     string t;\n     cin >> s >> t;\n     int ans = 1;\n     int last = INT_MIN;\n     vector<int> v[26];\n     int dp[2][26];\n     for (int i = 0; i < s.length(); i++) {\n       v[s[i] - 'a'].push_back(i);\n     }\n     for (int i = 0; i < 26; i++) {\n       dp[0][i] = v[i].size();\n       dp[1][i] = 0;\n     }\n     for (int i = 0; i < t.length(); i++) {\n       if (v[t[i] - 'a'].empty()) {\n         ans = -1;\n         break;\n       } else {\n         int temp = dp[1][t[i] - 'a'];\n         vector<int>::iterator lower, l;\n         l = v[t[i] - 'a'].begin() + temp;\n         lower = lower_bound(l, v[t[i] - 'a'].end(), last);\n         if (lower - v[t[i] - 'a'].begin() == dp[0][t[i] - 'a']) {\n           ans++;\n           last = v[t[i] - 'a'][0];\n           for (int j = 0; j < 26; j++) dp[1][j] = 0;\n           dp[1][t[i] - 'a'] = 1;\n         } else {\n           last = v[t[i] - 'a'][lower - v[t[i] - 'a'].begin()];\n           dp[1][t[i] - 'a'] = lower - v[t[i] - 'a'].begin() + 1;\n         }\n       }\n     }\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s;\n stack<long long> num;\n stack<char> fuhao;\n vector<int> pos;\n void calc() {\n   char cc = fuhao.top();\n   fuhao.pop();\n   long long a = num.top();\n   num.pop();\n   long long b = num.top();\n   num.pop();\n   long long ans;\n   if (cc == '*')\n     ans = a * b;\n   else\n     ans = a + b;\n   num.push(ans);\n }\n long long solve(string p) {\n   int len = p.length();\n   for (int i = 0; i < len; i++) {\n     if (p[i] >= '0' && p[i] <= '9') {\n       num.push(p[i] - '0');\n     } else if (p[i] == '(') {\n       fuhao.push(p[i]);\n     } else if (p[i] == ')') {\n       while (fuhao.top() != '(') calc();\n       fuhao.pop();\n     } else if (p[i] == '*') {\n       fuhao.push(p[i]);\n     } else if (p[i] == '+') {\n       while (!fuhao.empty() && fuhao.top() == '*') {\n         calc();\n       }\n       fuhao.push(p[i]);\n     }\n   }\n   while (!fuhao.empty()) calc();\n   long long ans = num.top();\n   return ans;\n }\n int main() {\n   cin >> s;\n   int len = s.length();\n   pos.push_back(-1);\n   for (int i = 1; i < len; i += 2)\n     if (s[i] == '*') pos.push_back(i);\n   pos.push_back(len);\n   long long ans = 0;\n   for (int i = 0; i < pos.size() - 1; i++) {\n     for (int j = i + 1; j < pos.size(); j++) {\n       string temp = s;\n       temp.insert(pos[i] + 1, 1, '(');\n       temp.insert(pos[j] + 1, 1, ')');\n       ans = max(ans, solve(temp));\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dx[4] = {1, 0, -1, 0};\n int dy[4] = {0, 1, 0, -1};\n long long n, m, k;\n long long arr[300001];\n long long arr2[300001];\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int t;\n   cin >> t;\n   cin.ignore();\n   for (int test_case = 0; test_case < t; ++test_case) {\n     int flg = 0;\n     long long ans1 = 0, ans2 = 0;\n     string ans[3] = {'NO', 'YES', 'R'};\n     string s1, s2 = '';\n     cin >> n >> k;\n     for (int i = 0; i < n; ++i) {\n       cin >> arr[i];\n     }\n     int i;\n     long long mn = 10000000000;\n     long long mx = 0;\n     for (i = 0; i < n; ++i) {\n       if (mn < arr[i]) {\n         if (mn != 10000000000) {\n           ans1 += mx - mn;\n           mx = 0;\n           mn = 10000000000;\n         }\n       }\n       mx = max(mx, arr[i]);\n       mn = min(mn, arr[i]);\n     }\n     ans1 += mx;\n     cout << ans1;\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = int(1e6 + 3);\n vector<vector<int> > v;\n char second[600000];\n int n, m;\n int main() {\n   scanf('%d%d\n', &n, &m);\n   v.resize(n);\n   for (int i = 0; i < n; ++i) {\n     gets(second);\n     v[i].resize(m);\n     for (int j = 0; j < m; ++j) {\n       v[i][j] = (second[j] == '.') ? -1 : second[j] - '0';\n     }\n   }\n   int res = 1;\n   for (int i = 0; i < n; ++i) {\n     int dir = -1;\n     for (int j = 0; j < m; ++j)\n       if (v[i][j] != -1) {\n         dir = (v[i][j] > 2) ? 1 : 0;\n         if (j & 1) dir = 1 - dir;\n         break;\n       }\n     if (dir != -1) {\n       for (int j = 0; j < m; ++j)\n         if (v[i][j] != -1) {\n           int d2 = (v[i][j] > 2) ? 1 : 0;\n           if (j & 1) d2 = 1 - d2;\n           if (dir != d2) res = 0;\n         }\n     } else if (dir == -1)\n       res = (res * 2) % mod;\n   }\n   for (int j = 0; j < m; ++j) {\n     int dir = -1;\n     for (int i = 0; i < n; ++i)\n       if (v[i][j] != -1) {\n         dir = (v[i][j] > 1 && v[i][j] < 4) ? 1 : 0;\n         if (i & 1) dir = 1 - dir;\n         break;\n       }\n     if (dir != -1) {\n       for (int i = 0; i < n; ++i)\n         if (v[i][j] != -1) {\n           int d2 = (v[i][j] > 1 && v[i][j] < 4) ? 1 : 0;\n           if (i & 1) d2 = 1 - d2;\n           if (dir != d2) res = 0;\n         }\n     } else if (dir == -1)\n       res = (res * 2) % mod;\n   }\n   printf('%d\n', res);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int maxn = 1e5 + 5;\n using namespace std;\n int a[maxn];\n int vis[maxn];\n int step[maxn * 2];\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &a[i]);\n     int temp = a[i];\n     int step1 = 0, step2 = 0, step3 = 0;\n     while (temp < maxn) {\n       step1++;\n       vis[temp]++;\n       temp = temp << 1;\n       step[temp] += step1;\n     }\n     while (a[i] >= 1) {\n       if (a[i] & 1 && a[i] != 1) {\n         int temp1 = a[i] = a[i] >> 1;\n         step2++;\n         step3 = step2;\n         vis[temp1]++;\n         step[temp1] += step3;\n         while (temp1 < maxn) {\n           step3++;\n           temp1 = temp1 << 1;\n           vis[temp1]++;\n           step[temp1] += step3;\n         }\n       } else {\n         step2++;\n         a[i] = a[i] >> 1;\n         vis[a[i]]++;\n         step[a[i]] += step2;\n       }\n     }\n   }\n   int ans = 1e9;\n   for (int i = 1; i < maxn; i++) {\n     if (vis[i] == n) {\n       ans = min(step[i], ans);\n     }\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename Arg1>\n void __f(const char* name, Arg1&& arg1) {\n   cerr << name << ' : ' << arg1 << std::endl;\n }\n template <typename Arg1, typename... Args>\n void __f(const char* names, Arg1&& arg1, Args&&... args) {\n   const char* comma = strchr(names + 1, ',');\n   cerr.write(names, comma - names) << ' : ' << arg1 << ' | ';\n   __f(comma + 1, args...);\n }\n const int mod = int(1e9) + 7;\n const int N = int(1e6) + 7;\n long long int two[N];\n void pre() {\n   two[0] = 1;\n   for (int i = (int)1; i < (int)N; i++) {\n     two[i] = (two[i - 1] * 2) % mod;\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   pre();\n   string s;\n   cin >> s;\n   int cnt = 0;\n   long long int ans = 0;\n   for (int i = (int)0; i < (int)(int)(s.size()); i++) {\n     if (s[i] == 'b') {\n       ans = (ans + (two[cnt] - 1)) % mod;\n       continue;\n     }\n     cnt++;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double PI =\n     3.14159265358979323846264338327950288419716939937510582097494459230;\n void swaps(char *x, char *y) {\n   char temp;\n   temp = *x;\n   *x = *y;\n   *y = temp;\n }\n void swapi(int *a, int *b) {\n   int temp;\n   temp = *a;\n   *a = *b;\n   *b = temp;\n }\n unsigned long long gcd(unsigned long long a, unsigned long long b) {\n   if (a == 0) return b;\n   if (b == 0) return a;\n   if (a == 1 || b == 1) return 1;\n   if (a == b) return a;\n   if (a > b)\n     return gcd(b, a % b);\n   else\n     return gcd(a, b % a);\n }\n long long Tree[4000010];\n int V[4000010];\n int N;\n int Time;\n int Outtime[4000010];\n int Intime[4000010];\n int Lvl[4000010];\n int maxval;\n bool vis[4000010];\n std::vector<std::vector<int> > Edge(2000010);\n void Add(int idx, int val) {\n   for (int i = idx; i <= maxval; i += (i & -i)) Tree[i] += val;\n }\n long long Query(int idx) {\n   long long S = 0;\n   for (int i = idx; i > 0; i -= (i & -i)) S += Tree[i];\n   return S;\n }\n void dfs(int idx) {\n   vis[idx] = true;\n   Intime[idx] = ++Time;\n   vis[idx] = true;\n   for (int i = 0; i < Edge[idx].size(); i++) {\n     if (vis[Edge[idx][i]]) continue;\n     Lvl[Edge[idx][i]] = Lvl[idx] + 1;\n     dfs(Edge[idx][i]);\n   }\n   Outtime[idx] = ++Time;\n }\n int main() {\n   int Cases = 1;\n   for (int Case = 0; Case < Cases; Case++) {\n     int u, v, opt, node, Q;\n     cin >> N >> Q;\n     for (int i = 1; i <= N; i++) cin >> V[i];\n     for (int i = 0; i < N - 1; i++) {\n       cin >> u >> v;\n       Edge[u].push_back(v);\n       Edge[v].push_back(u);\n     }\n     dfs(1);\n     maxval = Outtime[1];\n     for (int i = 0; i < Q; i++) {\n       cin >> opt;\n       opt -= 1;\n       if (opt == 0) {\n         cin >> node >> v;\n         if (Lvl[node] % 2) {\n           Add(Intime[node], -v);\n           Add(Outtime[node], v);\n         } else {\n           Add(Intime[node], v);\n           Add(Outtime[node], -v);\n         }\n       } else {\n         cin >> node;\n         if (Lvl[node] % 2)\n           cout << V[node] - Query(Intime[node]) << endl;\n         else\n           cout << V[node] + Query(Intime[node]) << endl;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n long long int binpow(long long int a, long long int b) {\n   if (b == 0) return 1;\n   long long int res = binpow(a, b / 2);\n   if (b % 2)\n     return res * res * a;\n   else\n     return res * res;\n }\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     vector<int> v(n, 0);\n     for (int i = 0; i < v.size(); i++) cin >> v[i];\n     sort(v.begin(), v.end(), greater<int>());\n     for (int i = 0; i < n; i++) cout << v[i] << ' ';\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long LLINF = 1e18;\n const int INF = 1e9;\n const int MOD = 20101009;\n const int HMOD = 999959;\n const int VMOD = 5000000;\n const int MAXN = 1e5 + 10;\n const int MAXM = 5e5 + 10;\n const int INV = 10050505;\n const long long LLINV = 1e18;\n const double eps = 1e-3;\n int dirx[5] = {0, -1, 1, 0, 0}, diry[5] = {0, 0, 0, -1, 1};\n int n, d, m;\n int cnt1, cnt2;\n long long a[MAXN], b[MAXN];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   scanf('%d%d%d', &n, &d, &m);\n   for (int i = 1, x; i <= n; ++i) {\n     scanf('%d', &x);\n     if (x <= m)\n       a[++cnt1] = x;\n     else\n       b[++cnt2] = x;\n   }\n   sort(a + 1, a + 1 + cnt1, greater<int>());\n   sort(b + 1, b + 1 + cnt2, greater<int>());\n   if (cnt2 == 0) {\n     long long sum = 0;\n     for (int i = 1; i <= n; ++i) sum += a[i];\n     printf('%lld\n', sum);\n     return 0;\n   }\n   for (int i = 1; i <= cnt1; ++i) a[i] = a[i - 1] + a[i];\n   for (int i = 1; i <= cnt2; ++i) b[i] = b[i - 1] + b[i];\n   long long ans = 0;\n   for (int i = 1; i <= cnt2; ++i) {\n     long long tmp = (long long)(i - 1) * d;\n     long long oth = n - i;\n     long long ned = cnt1 - (max(0LL, tmp - (cnt2 - i)));\n     if (oth >= tmp) ans = max(ans, b[i] + a[ned]);\n   }\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int h, m;\n   char c;\n   cin >> h >> c >> m;\n   while (1 > 0) {\n     m++;\n     h += (m / 60);\n     m %= 60;\n     h %= 24;\n     if (h / 10 == m % 10 && h % 10 == m / 10) break;\n   }\n   cout << h / 10 << h % 10 << ':' << m / 10 << m % 10;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, q;\n int tt;\n int ss = n + m;\n int fa[400005];\n bool vis[500005];\n int ans;\n int find(int x) {\n   if (fa[x] == x) return x;\n   return fa[x] = find(fa[x]);\n }\n int main() {\n   scanf('%d%d%d', &n, &m, &q);\n   for (int i = 1; i <= n + m; i++) {\n     fa[i] = i;\n   }\n   for (int i = 1; i <= q; i++) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     fa[find(x)] = find(n + y);\n   }\n   for (int i = 1; i <= n + m; i++) {\n     if (!vis[find(i)]) {\n       vis[fa[i]] = 1;\n       ans++;\n     }\n   }\n   cout << ans - 1;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   long long ans = 0;\n   for (int i = (0); i < (n); ++i) {\n     long long t, T, x, cost;\n     cin >> t >> T >> x >> cost;\n     if (t >= T) {\n       ans += cost + m * x;\n       continue;\n     }\n     long long aux1 = cost;\n     if (m > (T - t)) aux1 += m * x;\n     long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1;\n     aux2 *= cost;\n     ans += min(aux1, aux2);\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long modulo(long long base, long long exponent, long long modulus);\n long long choose(long long n, long long k);\n long long inverse(long long a, long long m);\n void build();\n void fileio();\n long long ncr(long long n, long long r);\n const int nax = 1e6 + 10;\n const int LG = log2(nax) + 1;\n vector<long long> fact(nax);\n int32_t main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long t;\n   cin >> t;\n   while (t--) {\n     long long n;\n     cin >> n;\n     string s;\n     cin >> s;\n     long long ans = n;\n     for (long long i = 0; i < n; i++) {\n       if (s[i] == '1') {\n         ans = max(ans, 2 * (i + 1));\n         ans = max(ans, 2 * (n - i));\n       }\n     }\n     cout << ans << '\n';\n   }\n   return 0;\n }\n long long ncr(long long n, long long r) {\n   if (r > n || r < 0 || n < 0) return 0;\n   long long ans = fact[n];\n   long long temp = (fact[n - r] * fact[r]) % 1000000007;\n   ans = (ans * inverse(temp, 1000000007)) % 1000000007;\n   return ans;\n }\n void fileio() {\n   freopen('input.txt', 'r', stdin);\n   freopen('output.txt', 'w', stdout);\n }\n void build() {\n   fact[0] = 1;\n   for (long long i = 1; i < nax; i++) fact[i] = (fact[i - 1] * i) % 1000000007;\n }\n long long modulo(long long base, long long exponent, long long modulus) {\n   if (modulus == 1) return 0;\n   long long result = 1;\n   base = base % modulus;\n   while (exponent > 0) {\n     if (exponent % 2 == 1) {\n       result = (result * base) % modulus;\n     }\n     exponent = exponent >> 1;\n     base = (base * base) % modulus;\n   }\n   return result;\n }\n long long choose(long long n, long long k) {\n   if (k == 0) return 1;\n   return (n * choose(n - 1, k - 1)) / k;\n }\n void EE(long long a, long long b, long long &co1, long long &co2) {\n   if (a % b == 0) {\n     co1 = 0;\n     co2 = 1;\n     return;\n   }\n   EE(b, a % b, co1, co2);\n   long long temp = co1;\n   co1 = co2;\n   co2 = temp - co2 * (a / b);\n }\n long long inverse(long long a, long long m) {\n   long long x, y;\n   EE(a, m, x, y);\n   if (x < 0) x += m;\n   return x;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void fastio() {\n   cin.tie(nullptr);\n   cin.sync_with_stdio(false);\n }\n using LL = long long;\n using LD = long double;\n const LL MOD = 1e9 + 7;\n const LL INF = LLONG_MAX;\n const LL N = 2e5 + 1;\n int main() {\n   fastio();\n   LL n;\n   cin >> n;\n   vector<LL> a(n);\n   for (auto &e : a) {\n     cin >> e;\n   }\n   vector<LL> ans(n, 0);\n   sort(a.begin(), a.end(), greater<LL>());\n   LL p = 0;\n   for (LL i = 0; i < n; i += 2) {\n     ans[i] = a[p++];\n   }\n   for (LL i = 0; i < n; ++i) {\n     if (ans[i] == 0) {\n       ans[i] = a[p++];\n     }\n   }\n   cout << (n - 1) / 2 << '\n';\n   for (auto &e : ans) {\n     cout << e << ' ';\n   }\n   cout << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int q, n, sum, a;\n   cin >> q;\n   while (q--) {\n     sum = 0;\n     cin >> n;\n     for (int i = 0; i < n; i++) {\n       cin >> a;\n       sum += a;\n     }\n     cout << (sum + n - 1) / n << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 5000 + 20;\n const int maxn = 1e5 + 20;\n const int mod = 998244353;\n int cnt, head[maxn], pos[maxn];\n long long ksm(long long a, long long b) {\n   long long res = 1;\n   while (b) {\n     if (b & 1) res = (res * a) % mod;\n     b >>= 1, a = a * a % mod;\n   }\n   return res % mod;\n }\n void read(int &v) {\n   int k = 1;\n   v = 0;\n   int c = getchar();\n   while (c < '0' || c > '9') {\n     if (c == '-') k = 0;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9')\n     v = (v << 3) + (v << 1) + (c - 48), c = getchar();\n   if (k == 0) v = -v;\n }\n int d[maxn], dp[maxn], a[maxn], same[maxn];\n int main() {\n   int n, q;\n   read(n), read(q);\n   for (int i = 1; i <= n; i++) {\n     read(a[i]);\n     if (a[i] == a[i - 1]) same[i] = same[i - 1] + 1;\n     if (a[i] >= a[i - 1])\n       d[i] = 0;\n     else\n       d[i] = 1;\n   }\n   dp[0] = 0;\n   for (int i = 1; i <= n; i++) dp[i] = dp[i - 1] + d[i];\n   while (q--) {\n     int l, r;\n     read(l), read(r);\n     if (dp[r] - dp[l] == 0)\n       puts('Yes');\n     else if (dp[r] - dp[l] == r - l)\n       puts('Yes');\n     else {\n       int x = dp[r] - dp[l];\n       r = r - same[r];\n       if (dp[r] - dp[r - x] == x)\n         puts('Yes');\n       else\n         puts('No');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int query(int x, int y) {\n   if (x == -1) return 0;\n   cout << 1 << ' ' << x << ' ' << y << endl;\n   string ret;\n   cin >> ret;\n   return ('TAK' == ret);\n }\n int get(int l, int r) {\n   if (l > r) return -1;\n   while (l < r) {\n     int m = (l + r) >> 1;\n     if (query(m, m + 1)) {\n       r = m;\n     } else {\n       l = m + 1;\n     }\n   }\n   return l;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int n, k;\n   cin >> n >> k;\n   int x = get(1, n);\n   int y = get(1, x - 1);\n   if (!query(y, x)) y = get(x + 1, n);\n   cout << 2 << ' ' << x << ' ' << y << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, d, done[300005] = {0};\n vector<int> graph[300005];\n map<pair<int, int>, int> edge;\n set<int> p;\n void go() {\n   queue<pair<int, int> > q;\n   for (auto it : p) q.push({it, 0});\n   while (!q.empty()) {\n     int x = q.front().first, P = q.front().second;\n     q.pop();\n     if (done[x]) continue;\n     done[x] = 1;\n     for (auto it : graph[x]) {\n       if (done[it] && it != P)\n         printf('%d ', edge[{min(x, it), max(x, it)}]);\n       else if (it != P)\n         q.push({it, x});\n     }\n   }\n }\n int main() {\n   scanf('%d', &n);\n   scanf('%d', &k);\n   scanf('%d', &d);\n   for (__typeof(k) i = 0 - (0 > k); i != k - (0 > k); i += 1 - 2 * (0 > k)) {\n     int x;\n     scanf('%d', &x);\n     p.insert(x);\n   }\n   for (__typeof(n - 1) i = 0 - (0 > n - 1); i != n - 1 - (0 > n - 1);\n        i += 1 - 2 * (0 > n - 1)) {\n     int u, v;\n     scanf('%d', &u);\n     scanf('%d', &v);\n     graph[u].push_back(v);\n     graph[v].push_back(u);\n     edge[{min(u, v), max(u, v)}] = i + 1;\n   }\n   printf('%d\n', (int)p.size() - 1);\n   go();\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n const int N = 88;\n const int M = 100100;\n int dp[N][M][2];\n pair<int, int> a[N];\n int n, m;\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < n; i++) scanf('%d%d', &a[i].first, &a[i].second);\n   sort(a, a + n);\n   for (int i = 0; i <= n; i++)\n     for (int j = 0; j <= m; j++)\n       for (int f = 0; f < 2; f++) dp[i][j][f] = M;\n   dp[0][0][1] = 0;\n   for (int i = 0; i < n; i++) {\n     for (int x = 0; x <= m; x++)\n       dp[i + 1][x][0] = min(dp[i + 1][x][0], min(dp[i][x][0], dp[i][x][1]));\n     for (int x = 0; x <= m; x++) {\n       int r = a[i].first - x - 1;\n       r = max(r, x - a[i].first);\n       r = max(r, a[i].second);\n       int y = min(m, a[i].first + r);\n       dp[i + 1][y][1] =\n           min(dp[i + 1][y][1], min(dp[i][x][0], dp[i][x][1]) + r - a[i].second);\n     }\n     for (int x = 1; x <= m; x++)\n       dp[i + 1][x][1] = min(dp[i + 1][x][1], dp[i + 1][x - 1][1] + 1);\n   }\n   printf('%d\n', min(dp[n][m][0], dp[n][m][1]));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a[200010];\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]);\n   sort(a + 1, a + n + 1);\n   int p = 2e9 + 7, ans = 0;\n   for (int i = 1; i < n; i++) p = min(p, a[i + 1] - a[i]);\n   for (int i = 1; i < n; i++) ans += (a[i + 1] - a[i] == p);\n   return printf('%d %d', p, ans), 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long long mod = 1000000007;\n const long long Inf = 1e9;\n using namespace std;\n bool valid(string s) {\n   for (int i = 0; i < s.length(); ++i) {\n     if (s[i] == ' ' || s[i] == '#') {\n       if (s[i] == '#') return true;\n     } else\n       return false;\n   }\n   return false;\n }\n string wtSpace(string s) {\n   string res = '';\n   for (int i = 0; i < s.length(); ++i) {\n     if (s[i] != ' ') res += s[i];\n   }\n   return res;\n }\n int main() {\n   int n, a, d;\n   scanf('%d %d %d', &n, &a, &d);\n   vector<double> ans(n);\n   for (int i = 0; i < n; i++) {\n     int t, v;\n     scanf('%d %d', &t, &v);\n     double time = pow(2 * d / (double)a, 0.5);\n     double time2 = v / (double)a;\n     if (time <= time2)\n       ans[i] = t + time;\n     else {\n       double x = a * pow(time2, 2) / 2.0;\n       ans[i] = t + time2 + (d - x) / (double)v;\n     }\n   }\n   for (int i = 0; i < n - 1; i++) {\n     if (ans[i + 1] < ans[i]) ans[i + 1] = ans[i];\n     printf('%.6f\n', ans[i]);\n   }\n   printf('%.6f\n', ans[n - 1]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T, typename U>\n inline void smin(T &a, U b) {\n   if (a > b) a = b;\n }\n template <typename T, typename U>\n inline void smax(T &a, U b) {\n   if (a < b) a = b;\n }\n template <class T>\n inline void gn(T &first) {\n   char c, sg = 0;\n   while (c = getchar(), (c > '9' || c < '0') && c != '-')\n     ;\n   for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';\n        c = getchar())\n     first = (first << 1) + (first << 3) + c - '0';\n   if (sg) first = -first;\n }\n template <class T, class T1>\n inline void gn(T &first, T1 &second) {\n   gn(first);\n   gn(second);\n }\n template <class T, class T1, class T2>\n inline void gn(T &first, T1 &second, T2 &z) {\n   gn(first);\n   gn(second);\n   gn(z);\n }\n template <class T>\n inline void print(T first) {\n   if (first < 0) {\n     putchar('-');\n     return print(-first);\n   }\n   if (first < 10) {\n     putchar('0' + first);\n     return;\n   }\n   print(first / 10);\n   putchar(first % 10 + '0');\n }\n template <class T>\n inline void printsp(T first) {\n   print(first);\n   putchar(' ');\n }\n template <class T>\n inline void println(T first) {\n   print(first);\n   putchar('\n');\n }\n template <class T, class U>\n inline void print(T first, U second) {\n   printsp(first);\n   println(second);\n }\n template <class T, class U, class V>\n inline void print(T first, U second, V z) {\n   printsp(first);\n   printsp(second);\n   println(z);\n }\n int power(int a, int b, int m, int ans = 1) {\n   for (; b; b >>= 1, a = 1LL * a * a % m)\n     if (b & 1) ans = 1LL * ans * a % m;\n   return ans;\n }\n const int B = 2222222;\n int n, u, cnt[B << 1], flag[B];\n long long s[B << 1], first, second;\n long long calc(int p) {\n   long long ans = 0;\n   int r = max(1, p - (int)(first / second));\n   for (int t = 0; t + p < B; t += p) {\n     ans += second * ((long long)(cnt[t + p - 1] - cnt[t + r - 1]) * (t + p) -\n                      s[t + p - 1] + s[t + r - 1]);\n     ans += first * (cnt[t + r - 1] - cnt[t]);\n   }\n   return ans;\n }\n void solve_B() {\n   gn(n, first, second);\n   for (int i = 0; i < n; i++) {\n     gn(u);\n     s[u] += u;\n     cnt[u]++;\n   }\n   for (int i = 1; i < B; i++) s[i] += s[i - 1], cnt[i] += cnt[i - 1];\n   long long ans = n * first;\n   for (int i = 2; i < B; i++)\n     if (!flag[i]) {\n       smin(ans, calc(i));\n       if ((long long)i * i >= B) continue;\n       for (int j = i * i; j < B; j += i) flag[j] = 1;\n     }\n   println(ans);\n   exit(0);\n }\n int main() {\n   solve_B();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   for (int ii = 0; ii < t; ii++) {\n     int n;\n     cin >> n;\n     bool A[52];\n     char Aa[52][52];\n     for (int i = 0; i < n; i++) {\n       char t;\n       cin >> t;\n       if (t == '1')\n         A[i] = 0;\n       else\n         A[i] = 1;\n     }\n     int k = 0;\n     int t = -1;\n     for (int i = n - 1; i >= 0; i--) {\n       if (A[i] == 0) {\n         k++;\n       } else {\n         t = i;\n       }\n     }\n     if (n - k > 2 || n - k == 0)\n       cout << 'YES' << endl;\n     else {\n       cout << 'NO' << endl;\n       continue;\n     }\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < n; j++) {\n         Aa[i][j] = '=';\n       }\n     }\n     for (int i = 0; i < n; i++) Aa[i][i] = 'X';\n     int c1 = t;\n     if (n - k > 2) {\n       for (int i = t + 1; i < n; i++) {\n         if (A[i] == 1) {\n           Aa[c1][i] = '+';\n           Aa[i][c1] = '-';\n           c1 = i;\n         }\n       }\n       Aa[c1][t] = '+';\n       Aa[t][c1] = '-';\n     }\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < n; j++) {\n         cout << Aa[i][j];\n       }\n       cout << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long T;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> T;\n   int a, b, c, d;\n   while (T--) {\n     cin >> a >> b >> c >> d;\n     bool ok = 0;\n     if (a == c) {\n       if (d + b == a) ok = 1;\n     }\n     if (a == d) {\n       if (c + b == a) ok = 1;\n     }\n     if (b == c) {\n       if (a + d == b) ok = 1;\n     }\n     if (b == d) {\n       if (a + c == b) ok = 1;\n     }\n     if (ok)\n       cout << 'Yes\n';\n     else\n       cout << 'No\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> adjc[100005];\n vector<int> cadj[100005];\n struct edge {\n   int u, v, c;\n };\n class dsu {\n  public:\n   dsu(vector<int> vert) : vert(vert) {\n     n = vert.size();\n     par.resize(n);\n     iota(par.begin(), par.end(), 0);\n   }\n   int root(int u) {\n     if (par[u] == u) {\n       return u;\n     }\n     return (par[u] = root(par[u]));\n   }\n   void merge(int u, int v) {\n     int ui = lower_bound(vert.begin(), vert.end(), u) - vert.begin();\n     int vi = lower_bound(vert.begin(), vert.end(), v) - vert.begin();\n     int ru = root(ui), rv = root(vi);\n     if (ru != rv) {\n       if (rand() % 2) {\n         swap(ru, rv);\n       }\n       par[ru] = rv;\n     }\n   }\n   bool ced(int u, int v) {\n     int ui = lower_bound(vert.begin(), vert.end(), u) - vert.begin();\n     int vi = lower_bound(vert.begin(), vert.end(), v) - vert.begin();\n     if ((ui == n || (vert[ui] != u)) || (vi == n || (vert[vi] != v))) return 0;\n     return (root(ui) == root(vi));\n   }\n   int n;\n   vector<int> vert, par;\n };\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int n, m;\n   cin >> n >> m;\n   vector<edge> e;\n   for (int i = 0; i < m; i++) {\n     int u, v, c;\n     cin >> u >> v >> c;\n     e.push_back({u, v, c});\n     cadj[c].push_back(u);\n     cadj[c].push_back(v);\n     adjc[u].push_back(c);\n     adjc[v].push_back(c);\n   }\n   for (int i = 1; i <= n; i++) {\n     sort(adjc[i].begin(), adjc[i].end());\n     adjc[i].resize(unique(adjc[i].begin(), adjc[i].end()) - adjc[i].begin());\n   }\n   vector<dsu> cdsu;\n   for (int i = 1; i <= m; i++) {\n     sort(cadj[i].begin(), cadj[i].end());\n     cadj[i].resize(unique(cadj[i].begin(), cadj[i].end()) - cadj[i].begin());\n     cdsu.emplace_back(cadj[i]);\n   }\n   for (edge ed : e) {\n     cdsu[ed.c - 1].merge(ed.u, ed.v);\n   }\n   map<pair<int, int>, int> dp;\n   int q;\n   cin >> q;\n   while (q--) {\n     int u, v;\n     cin >> u >> v;\n     if (adjc[u].size() > adjc[v].size()) {\n       swap(u, v);\n     }\n     if (dp.find({u, v}) != dp.end()) {\n       cout << dp[{u, v}] << endl;\n       continue;\n     }\n     int ans = 0;\n     for (auto c : adjc[u]) {\n       ans += cdsu[c - 1].ced(u, v);\n     }\n     cout << ans << endl;\n     dp[{u, v}] = ans;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 20 + 5;\n const long long INF = 3e9;\n const char *cc = '0123456789abcdef';\n int c[maxn][maxn], used[maxn];\n long long dp[maxn][maxn];\n char s[maxn];\n long long solve(int t, int m, bool flag) {\n   memset(dp[0], 0, sizeof(dp[0]));\n   if (flag) {\n     for (int i = 0; i < m; ++i) {\n       for (int j = 0; j + used[0] <= t && j + i + 1 <= m; ++j) {\n         dp[0][i + j] = min(INF, dp[0][i + j] + c[m - i - 1][j]);\n       }\n     }\n   } else\n     for (int i = 0; i + used[0] <= t && i <= m; ++i) dp[0][i] = c[m][i];\n   for (int i = 1; i < 16; ++i) {\n     memset(dp[i], 0, sizeof(dp[i]));\n     for (int j = 0; j <= m; ++j) {\n       if (!dp[i - 1][j]) continue;\n       for (int k = 0; k + used[i] <= t && k + j <= m; ++k) {\n         dp[i][j + k] = min(INF, dp[i][j + k] + dp[i - 1][j] * c[m - j][k]);\n       }\n     }\n   }\n   return dp[15][m];\n }\n int main() {\n   for (int i = 0; i < maxn; ++i) {\n     c[i][0] = c[i][i] = 1;\n     for (int j = 1; j < i; ++j) c[i][j] = c[i - 1][j - 1] + c[i - 1][j];\n   }\n   int k, t;\n   cin >> k >> t;\n   bool flag = true;\n   for (int i = 0; i < 20; ++i) {\n     long long sum = 0;\n     for (int j = 0; j < 16; ++j) {\n       if (used[j] >= t) continue;\n       if (!flag || j != 0) ++used[j];\n       long long tmp = solve(t, 20 - i - 1, flag && j == 0);\n       sum += tmp;\n       if (sum >= k) {\n         s[i] = cc[j];\n         k -= sum - tmp;\n         if (j > 0) flag = false;\n         break;\n       }\n       if (!flag || j != 0) --used[j];\n     }\n   }\n   s[20] = 0;\n   int p = 0;\n   while (s[p] == '0') ++p;\n   cout << s + p << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<pair<int, int> > inc[100010];\n priority_queue<pair<double, int> > Q;\n long long A[100010];\n int N, M, K;\n vector<pair<int, int> > mul;\n int sel[100010];\n int typ[100010];\n void compute() {\n   int k;\n   while (M-- && !(Q.empty() && mul.empty())) {\n     k = Q.empty() ? -1 : Q.top().second;\n     if (mul.empty() || (k >= 0 && Q.top().first >= mul.back().first)) {\n       A[k] += inc[k].back().first;\n       sel[inc[k].back().second] = 1;\n       inc[k].pop_back();\n       Q.pop();\n       if (!inc[k].empty())\n         Q.push(make_pair((A[k] + inc[k].back().first) / (1.0 * A[k]), k));\n       continue;\n     }\n     sel[mul.back().second] = 1;\n     mul.pop_back();\n   }\n }\n pair<int, int> typ1[100010];\n int main() {\n   int i, b, t;\n   cin >> K >> N >> M;\n   for (i = 0; i < K; ++i) cin >> A[i];\n   for (int idx = 0; idx < N; ++idx) {\n     cin >> t >> i >> b;\n     typ[idx] = t;\n     if (t == 3) {\n       mul.push_back(make_pair(b, idx));\n       continue;\n     }\n     --i;\n     if (t == 1) {\n       typ1[i] = max(typ1[i], make_pair(b - (int)A[i], idx));\n       continue;\n     }\n     inc[i].push_back(make_pair(b, idx));\n   }\n   for (i = 0; i < K; ++i) {\n     if (!typ1[i].first) continue;\n     inc[i].push_back(typ1[i]);\n   }\n   sort(mul.begin(), mul.end());\n   for (i = 0; i < K; ++i) {\n     if (inc[i].empty()) continue;\n     sort(inc[i].begin(), inc[i].end());\n     Q.push(make_pair((A[i] + inc[i].back().first) / (1.0 * A[i]), i));\n   }\n   compute();\n   cout << accumulate(sel, sel + N, 0) << '\n';\n   for (i = 0; i < N; ++i) {\n     if (!sel[i] || typ[i] > 1) continue;\n     cout << i + 1 << ' ';\n   }\n   for (i = 0; i < N; ++i) {\n     if (!sel[i] || typ[i] != 2) continue;\n     cout << i + 1 << ' ';\n   }\n   for (i = 0; i < N; ++i) {\n     if (!sel[i] || typ[i] < 3) continue;\n     cout << i + 1 << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char a[102];\n char b[102];\n char c[102];\n int main() {\n   gets(a);\n   gets(b);\n   int l = strlen(a);\n   int i;\n   for (i = l - 1; i >= 0; i--) {\n     if (a[i] == 'z') {\n       a[i] = 'a';\n     } else {\n       a[i] = a[i] + 1;\n       break;\n     }\n   }\n   if (!strcmp(a, b))\n     cout << 'No such string';\n   else\n     cout << a;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 500005;\n int a[N];\n int main() {\n   int n;\n   while (scanf('%d', &n) != EOF) {\n     memset(a, 0, sizeof(a));\n     for (int i = 0; i < n; i++) {\n       scanf('%d', &a[i]);\n     }\n     sort(a, a + n);\n     int mid = (n - 1) / 2;\n     int big = n - 1;\n     int small = mid;\n     int ok = 0;\n     while (big > mid && small >= 0) {\n       if (a[small] * 2 <= a[big]) {\n         ok++;\n         small--;\n         big--;\n       } else {\n         small--;\n       }\n     }\n     printf('%d\n', n - ok);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, sol;\n multiset<int> S;\n multiset<int>::iterator p;\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     int val;\n     scanf('%d', &val);\n     S.insert(val);\n   }\n   long long s = 0;\n   for (int i = 1; i <= n; i++) {\n     p = S.lower_bound(s);\n     if (p == S.end()) break;\n     if (*p < s) p++;\n     sol++;\n     s += *p;\n     S.erase(p);\n   }\n   printf('%d\n', sol);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long bz = -10000000000;\n long long t[50001], ll[50001], rr[50001], dd[50001];\n long long tu[50001];\n int main() {\n   long long n, m;\n   cin >> n >> m;\n   for (long long a = 1; a <= n; a++) tu[a] = bz;\n   for (long long a = 1; a <= m; a++) cin >> t[a] >> ll[a] >> rr[a] >> dd[a];\n   for (long long a = 1; a <= m; a++) {\n     if (t[a] == 1) {\n       for (long long b = ll[a]; b <= rr[a]; b++) {\n         if (tu[b] == bz)\n           continue;\n         else\n           tu[b] += dd[a];\n       }\n     } else {\n       long long jc = 1;\n       for (long long b = ll[a]; b <= rr[a]; b++) {\n         if (tu[b] == bz) {\n           tu[b] = dd[a];\n           jc = 0;\n         } else {\n           if (tu[b] >= dd[a]) {\n             tu[b] = dd[a];\n             jc = 0;\n           }\n         }\n       }\n       if (jc) {\n         cout << 'NO';\n         return 0;\n       }\n     }\n   }\n   for (long long a = 1; a <= n; a++)\n     if (tu[a] == bz) tu[a] = 0;\n   for (long long a = m; a >= 1; a--) {\n     if (t[a] == 2) {\n       long long jc = 1;\n       for (long long b = ll[a]; b <= rr[a]; b++) {\n         if (tu[b] == dd[a]) jc = 0;\n       }\n       if (jc) {\n         cout << 'NO';\n         return 0;\n       }\n       continue;\n     }\n     for (long long b = ll[a]; b <= rr[a]; b++)\n       if (tu[a] != bz) tu[b] -= dd[a];\n   }\n   cout << 'YES' << endl;\n   long long jc = 0;\n   for (long long a = 1; a <= n; a++) {\n     if (tu[a] == bz) tu[a] = 0;\n     if (!jc) {\n       cout << tu[a];\n       jc = 1;\n     } else {\n       cout << ' ' << tu[a];\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n const int N = 4040;\n using namespace std;\n int n, m;\n int l[N], s[N];\n int cost[N];\n int inf = -1e9;\n int d[N][N];\n int f[N][N];\n vector<int> v[N];\n vector<int> pos[N];\n vector<int> fut[N][14];\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++) cin >> l[i];\n   for (int i = 1; i <= n; i++) cin >> s[i];\n   reverse(l + 1, l + n + 1);\n   reverse(s + 1, s + n + 1);\n   for (int i = 1; i <= n + m; i++) cin >> cost[i];\n   for (int i = 1; i <= n; i++) v[l[i]].push_back(i);\n   for (int i = 0; i < N; i++)\n     for (int j = 0; j < N; j++) d[i][j] = inf;\n   for (int i = 1; i <= n + m; i++) {\n     for (int j = 0; j < 13; j++) {\n       fut[i][j].resize((1 << 13 - j));\n       while (fut[i][j].size() >= N - 4) fut[i][j].pop_back();\n       for (auto &x : fut[i][j]) x = inf;\n     }\n   }\n   for (int i = 0; i < N; i++) {\n     for (int j = 1; j <= n + m; j++) {\n       f[i][j] = cost[j];\n       for (int h = 0; h < 13; h++) {\n         if (i & (1 << h))\n           f[i][j] += cost[j + h + 1];\n         else\n           break;\n       }\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= l[i]; j++) {\n       int dif = min(12, l[i] - j);\n       for (int p = 0; p < fut[j][dif].size(); p++) {\n         d[p + 1][i] = max(d[p + 1][i], fut[j][dif][p] + f[p][l[i]] - s[i]);\n       }\n     }\n     d[1][i] = max(d[1][i], cost[l[i]] - s[i]);\n     for (int j = 0; j < N; j++) {\n       int nj = j, x = l[i];\n       for (int h = 0; h < 13; h++) {\n         fut[x][h][nj] = max(fut[x][h][nj], d[j][i]);\n         nj >>= 1;\n       }\n     }\n   }\n   int res = 0;\n   for (int i = 0; i < N; i++) {\n     for (int j = 1; j <= n; j++) {\n       res = max(res, d[i][j]);\n     }\n   }\n   cout << res << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int XpowerY(long long int x, long long int y, long long int m) {\n   long long int ans = 1;\n   x = x % m;\n   while (y > 0) {\n     if (y % 2 == 1) ans = (ans * x) % m;\n     x = ((x % m) * (x % m)) % m;\n     y = y >> 1;\n   }\n   return ans % m;\n }\n vector<long long int> gr[100023];\n long long int s[100023], val[100023];\n long long int fl, minP;\n long long int dfs(long long int node, long long int prev, long long int lev) {\n   long long int mx = 1e12;\n   if (lev % 2 == 0) {\n     for (int i = 0; i < gr[node].size(); i++) {\n       if (s[gr[node][i]] < prev) fl = 1;\n       mx = min(mx, s[gr[node][i]] - prev);\n     };\n     val[node] = mx;\n     if (gr[node].size() == 0) val[node] = 0;\n   }\n   for (int i = 0; i < gr[node].size(); i++) {\n     val[gr[node][i]] = s[gr[node][i]] - mx - prev;\n     long long int temp;\n     if (lev % 2 == 0)\n       temp = prev + val[node];\n     else\n       temp = s[node];\n     dfs(gr[node][i], temp, lev + 1);\n   }\n   return 0;\n }\n int main() {\n   long long int n, x;\n   cin >> n;\n   for (long long int i = 0; i < n - 1; i++) {\n     cin >> x;\n     gr[x].push_back(i + 2);\n   }\n   for (long long int i = 1; i <= n; i++) cin >> s[i];\n   dfs(1, -1, 1);\n   val[1] = s[1];\n   if (fl) return cout << -1 << endl, 0;\n   for (long long int i = 0; i < n; i++) {\n     ;\n     minP += val[i + 1];\n   }\n   cout << minP << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int ALPHA = 26 + 1;\n struct Trie {\n   Trie() { nodes.resize(2); }\n   struct Node {\n     Node() { memset(next, 0, sizeof(next)); }\n     int next[ALPHA];\n     int finish = -1;\n   };\n   int alloc() {\n     nodes.push_back(Node());\n     return nodes.size() - 1;\n   }\n   void addWord(const string& s, int id) {\n     int v = root;\n     for (char c : s) {\n       c = tolower(c) - 'a';\n       if (!nodes[v].next[c]) {\n         int x = alloc();\n         nodes[v].next[c] = x;\n       }\n       v = nodes[v].next[c];\n     }\n     nodes[v].finish = id;\n   }\n   vector<Node> nodes;\n   const int root = 1;\n };\n int n;\n string ciph;\n int m;\n Trie trie;\n vector<int> solved;\n vector<int> toTake;\n bool solve(int pos) {\n   if (pos == n) {\n     return true;\n   }\n   if (solved[pos] == -1) {\n     solved[pos] = false;\n     int v = trie.root;\n     int i = pos;\n     while (i < ciph.length() && trie.nodes[v].next[ciph[i] - 'a']) {\n       v = trie.nodes[v].next[ciph[i] - 'a'];\n       ++i;\n       if (trie.nodes[v].finish != -1) {\n         if (solve(i)) {\n           solved[pos] = true;\n           toTake[pos] = trie.nodes[v].finish;\n         }\n       }\n     }\n   }\n   return solved[pos];\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> n;\n   solved.resize(n, -1);\n   toTake.resize(n, -1);\n   cin >> ciph;\n   cin >> m;\n   vector<string> words(m);\n   for (int i = 0; i < m; ++i) {\n     cin >> words[i];\n     trie.addWord(words[i], i);\n   }\n   reverse(ciph.begin(), ciph.end());\n   solve(0);\n   vector<int> ans;\n   if (solved[0] == 1) {\n     int pos = 0;\n     while (pos != n) {\n       int id = toTake[pos];\n       ans.push_back(id);\n       pos += words[id].length();\n     }\n   } else {\n     assert(false);\n   }\n   reverse(ans.begin(), ans.end());\n   for (int i = 0; i < ans.size(); ++i) {\n     if (i != 0) {\n       cout << ' ';\n     }\n     cout << words[ans[i]];\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long x, y, m, cnt = 0;\n int main() {\n   scanf('%lld%lld%lld', &x, &y, &m);\n   if (x >= m || y >= m) {\n     printf('0');\n     return 0;\n   }\n   if (x <= 0 && y <= 0) {\n     printf('-1');\n     return 0;\n   }\n   while (x < m && y < m) {\n     if (x > y) swap(x, y);\n     if (x + y <= 0) {\n       cnt += abs(x) / y;\n       x = x + (abs(x) - abs(x) % y);\n     } else {\n       x += y;\n       cnt++;\n       ;\n     }\n   }\n   printf('%lld', cnt);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/STACK:256000000')\n using namespace std;\n const int maxN = 2000;\n const int S_CNT = 9;\n const int M_CNT = 25;\n const int DIST = 60 * 60;\n int n, m;\n int a[maxN][maxN];\n int t[maxN][maxN];\n int used[maxN][maxN];\n int rc[maxN][maxN];\n int is_in(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; }\n int get(int x, int y) {\n   int cnt = 0;\n   for (int i = x - 2; i <= x + 2; ++i) {\n     for (int j = y - 2; j <= y + 2; ++j) {\n       if (is_in(i, j)) {\n         cnt += a[i][j];\n       }\n     }\n   }\n   return cnt;\n }\n pair<int, int> choose_max(int x, int y) {\n   pair<int, int> res = make_pair(-1, -1);\n   int rs = -1;\n   for (int i = x - 2; i <= x + 2; ++i) {\n     for (int j = y - 2; j <= y + 2; ++j) {\n       if (is_in(i, j)) {\n         if (t[i][j] > rs) {\n           rs = t[i][j];\n           res = make_pair(i, j);\n         }\n       }\n     }\n   }\n   return res;\n }\n void change_used(int x, int y, int num) {\n   for (int i = x - 2; i <= x + 2; ++i) {\n     for (int j = y - 2; j <= y + 2; ++j) {\n       if (is_in(i, j)) {\n         used[i][j] = num;\n       }\n     }\n   }\n }\n int dist(pair<int, int> a, pair<int, int> b) {\n   return (a.first - b.first) * (a.first - b.first) +\n          (a.second - b.second) * (a.second - b.second);\n }\n pair<int, int> choose_long(int cx, int cy, int x, int y, int step) {\n   pair<int, int> res = make_pair(cx, cy);\n   int rs = -1;\n   for (int i = cx - 2; i <= cx + 2; ++i) {\n     for (int j = cy - 2; j <= cy + 2; ++j) {\n       if (is_in(i, j) && a[i][j] && used[i][j] != step) {\n         if (dist(make_pair(i, j), make_pair(x, y)) > rs) {\n           rs = dist(make_pair(i, j), make_pair(x, y));\n           res = make_pair(i, j);\n         }\n       }\n     }\n   }\n   return res;\n }\n void dfs(int x, int y, int color) {\n   if (rc[x][y] != 0) return;\n   rc[x][y] = color;\n   if (is_in(x + 1, y) && a[x + 1][y]) dfs(x + 1, y, color);\n   if (is_in(x - 1, y) && a[x - 1][y]) dfs(x - 1, y, color);\n   if (is_in(x, y + 1) && a[x][y + 1]) dfs(x, y + 1, color);\n   if (is_in(x, y - 1) && a[x][y - 1]) dfs(x, y - 1, color);\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < m; ++j) {\n       scanf('%d', &a[i][j]);\n     }\n   }\n   int c_col = 0;\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < m; ++j) {\n       if (a[i][j] && !rc[i][j]) {\n         ++c_col;\n         dfs(i, j, c_col);\n       }\n     }\n   }\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < m; ++j) {\n       if (a[i][j]) {\n         t[i][j] = get(i, j);\n       }\n     }\n   }\n   vector<pair<int, int> > cur;\n   int step = 1;\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < m; ++j) {\n       if (a[i][j] && !used[i][j] && t[i][j] == S_CNT) {\n         ++step;\n         int cx = i, cy = j;\n         change_used(cx, cy, step);\n         cur.push_back(make_pair(cx, cy));\n       }\n     }\n   }\n   vector<int> col(cur.size(), 0);\n   for (int i = 0; i < col.size(); ++i) {\n     col[i] = rc[cur[i].first][cur[i].second];\n   }\n   map<int, int> res;\n   for (int i = 0; i < col.size(); ++i) {\n     ++res[col[i]];\n   }\n   cout << res.size() << endl;\n   vector<int> ans;\n   for (map<int, int>::iterator it = res.begin(); it != res.end(); ++it) {\n     ans.push_back(it->second);\n   }\n   sort(ans.begin(), ans.end());\n   for (int i = 0; i < ans.size(); ++i) {\n     cout << ans[i] << ' ';\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n char Src[1000001], Dst[1000001];\n int main() {\n   int i, j, Cnts, Cntd, Lens, Lend;\n   scanf('%s %s', Src, Dst);\n   if (strlen(Src) != strlen(Dst)) {\n     puts('NO');\n     return 0;\n   }\n   if (strcmp(Src, Dst) == 0) {\n     puts('YES');\n     return 0;\n   }\n   if (strlen(Src) == 1) {\n     puts(Src[0] == Dst[0] ? 'YES' : 'NO');\n     return 0;\n   }\n   for (i = 0; Src[i] != '\0'; ++i) {\n     if (Src[i] == '1') {\n       break;\n     }\n   }\n   for (j = 0; Dst[j] != '\0'; ++j) {\n     if (Dst[j] == '1') {\n       break;\n     }\n   }\n   puts(Src[i] == '1' && Dst[j] == '1' ? 'YES' : 'NO');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T, class L>\n bool smax(T &x, L y) {\n   return x < y ? (x = y, 1) : 0;\n }\n template <class T, class L>\n bool smin(T &x, L y) {\n   return y < x ? (x = y, 1) : 0;\n }\n const int maxn = 5e5 + 17;\n list<int> a;\n list<int>::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<int>::iterator &i, list<int>::iterator &j) { return *i < *j; });\n   long long ans = 0, dam = 0;\n   for_each(per, per + max(0, n - 2), [&](list<int>::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 <bits/stdc++.h>\n int main() {\n   int t;\n   scanf('%d', &t);\n   while (t--) {\n     int n;\n     scanf('%d', &n);\n     std::vector<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n template <int mod>\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 <class type>\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 <class type>\n   friend modulo operator+(const modulo &a, const type &b) {\n     return modulo(a) += b;\n   }\n   template <class type>\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 <class type>\n   friend modulo operator-(const modulo &a, const type &b) {\n     return modulo(a) -= b;\n   }\n   template <class type>\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 <class type>\n   friend modulo operator*(const modulo &a, const type &b) {\n     return modulo(a) *= b;\n   }\n   template <class type>\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 <class type>\n   friend modulo operator/(const modulo &a, const type &b) {\n     return modulo(a) /= b;\n   }\n   template <class type>\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<mod> f[2][nsz + 5], g[nsz + 5], S[nsz + 5][nsz + 5], ans[nsz + 5];\n modulo<mod> 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<mod> 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 <bits/stdc++.h>\n using namespace std;\n int n, m;\n vector<int> prices[1010];\n int allp[1010];\n int all;\n int margin_price;\n int above_cnt[1010], margin_cnt[1010], cnt[1010];\n double f[1010][1010], g[1010][1010];\n double comb[1010][1010];\n int main() {\n   comb[1][0] = comb[1][1] = 1;\n   for (int i = 2; i <= 1000; i++) {\n     comb[i][0] = comb[i][i] = 1;\n     for (int j = 1; j < i; j++)\n       comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1];\n   }\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= m; i++) {\n     int k;\n     scanf('%d', &k);\n     while (k--) {\n       int v;\n       scanf('%d', &v);\n       prices[i].push_back(v);\n       allp[++all] = v;\n     }\n   }\n   sort(allp + 1, allp + all + 1);\n   reverse(allp + 1, allp + all + 1);\n   margin_price = allp[n];\n   int need_margin = 0;\n   for (int i = 1; i <= n; i++)\n     if (allp[i] == margin_price) need_margin++;\n   for (int i = 1; i <= m; i++) {\n     for (int p : prices[i]) {\n       if (p > margin_price)\n         above_cnt[i]++;\n       else if (p == margin_price)\n         margin_cnt[i]++;\n       cnt[i]++;\n     }\n   }\n   f[0][0] = 1;\n   g[0][0] = 1;\n   for (int i = 1; i <= m; i++) {\n     for (int j = 0; j <= need_margin; j++) {\n       if (margin_cnt[i] == 0) {\n         f[i][j] += f[i - 1][j] / comb[cnt[i]][above_cnt[i]];\n         g[i][j] += g[i - 1][j];\n       } else if (margin_cnt[i] == 1) {\n         f[i][j] += f[i - 1][j] / comb[cnt[i]][above_cnt[i]];\n         g[i][j] += g[i - 1][j];\n         f[i][j + 1] += f[i - 1][j] / comb[cnt[i]][above_cnt[i] + 1];\n         g[i][j + 1] += g[i - 1][j];\n       } else {\n         assert(false);\n       }\n     }\n   }\n   printf('%.15f\n', f[m][need_margin] / g[m][need_margin]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int INF = 1000000005;\n long long INFF = 1000000000000000005LL;\n int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};\n int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};\n double pi = 3.1415926536;\n int MOD = 1e9 + 7;\n long long power(long long x, long long n) {\n   long long res = 1;\n   while (n > 0) {\n     if (n & 1) res = res * x;\n     x = (x * x);\n     n /= 2;\n   }\n   return res;\n }\n bool ok(int n, long long d) {\n   long long sum = (n * (n + 1) / 2);\n   if (sum < d) return false;\n   return (d % 2 == sum % 2);\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie();\n   cout.tie();\n   int t;\n   cin >> t;\n   while (t--) {\n     int a, b;\n     cin >> a >> b;\n     int i = 0;\n     while (!ok(i, abs(a - b))) i++;\n     cout << i << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n void input() {\n   int n;\n   cin >> n;\n   vector<int> 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 <bits/stdc++.h>\n using namespace std;\n int an[101][21][21], n, k, md = 1e9 + 7, t[21][21];\n vector<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   int x, y;\n   cin >> x >> y;\n   if (((x < y) ? x : y) % 2)\n     cout << 'Akshat';\n   else\n     cout << 'Malvika';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int P = 10, N = 1e5 + 10;\n int inverse(int a, int m) {\n   int m0 = m, t, q;\n   int x0 = 0, x1 = 1;\n   if (m == 1) return 0;\n   while (a > 1) {\n     q = a / m;\n     t = m;\n     m = a % m, a = t;\n     t = x0;\n     x0 = x1 - q * x0;\n     x1 = t;\n   }\n   if (x1 < 0) x1 += m0;\n   return x1;\n }\n int fact[N], ifact[N], pot[N][P];\n vector<int> primes(int n) {\n   vector<int> ans;\n   for (int d = 2; d * d <= n; d++)\n     if (n % d == 0) {\n       ans.push_back(d);\n       while (n % d == 0) {\n         n /= d;\n       }\n     }\n   if (n > 1) ans.push_back(n);\n   return ans;\n }\n int mod;\n vector<int> p;\n int expomod(long long int a, long long int e) {\n   int ans = 1;\n   while (e) {\n     if (e & 1) ans = ans * a % mod;\n     e /= 2;\n     a = a * a % mod;\n   }\n   return ans;\n }\n int comb(int m, int n) {\n   int ans = (long long int)fact[m] * ifact[n] % mod * ifact[m - n] % mod;\n   for (int i = 0; i < (int)(((int)(p).size())); i++) {\n     int pp = pot[m][i] - pot[n][i] - pot[m - n][i];\n     if (pp) ans = (long long int)ans * expomod(p[i], pp) % mod;\n   }\n   return ans;\n }\n int go(int n, int bal) {\n   long long int ans = 0;\n   for (int x = 0, y = bal; x + y <= n; x++, y++) {\n     ans += (long long int)comb(n, x) * comb(n - x, y) % mod;\n     if (ans >= mod) ans -= mod;\n   }\n   return ans;\n }\n int main() {\n   int n, l, r;\n   cin >> n >> mod >> l >> r;\n   p = primes(mod);\n   fact[0] = ifact[0] = 1;\n   for (int i = 1; i <= n; i++) {\n     int d = -1;\n     for (int j = 0; j < (int)(((int)(p).size())); j++)\n       if (i % p[j] == 0) {\n         d = j;\n         break;\n       }\n     if (d == -1)\n       fact[i] = i;\n     else {\n       fact[i] = fact[i / p[d]];\n       for (int j = 0; j < (int)(((int)(p).size())); j++)\n         pot[i][j] = pot[i / p[d]][j] + (j == d);\n     }\n     ifact[i] = inverse(fact[i], mod);\n   }\n   for (int i = 0; i < (int)(n); i++) {\n     fact[i + 1] = (long long int)fact[i] * fact[i + 1] % mod;\n     ifact[i + 1] = (long long int)ifact[i] * ifact[i + 1] % mod;\n     for (int j = 0; j < (int)(((int)(p).size())); j++)\n       pot[i + 1][j] += pot[i][j];\n   }\n   long long int ans = 0;\n   for (int i = 0; i < (int)(2); i++) {\n     ans += go(n, l + i);\n     ans -= go(n, r + 1 + i);\n   }\n   ans %= mod;\n   if (ans < 0) ans += mod;\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[101][101];\n int main() {\n   long long n, m;\n   cin >> n >> m;\n   long long mn = min(m, n);\n   cout << mn + 1 << endl;\n   for (long long i = 0; i <= mn; i++)\n     cout << i << ' ' << (mn - i) % (mn + 1) << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char _;\n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }\n long long fpow(long long b, long long exp, long long mod) {\n   if (exp == 0) return 1;\n   long long t = fpow(b, exp / 2, mod);\n   if (exp & 1) return t * t % mod * b % mod;\n   return t * t % mod;\n }\n int num_boxes, req, start, vals[55], dp[55][2005];\n char type[55];\n int solve(int box, int sum) {\n   if (sum >= req) return 0;\n   if (dp[box][sum] != -1) return dp[box][sum];\n   int res = INT_MAX;\n   for (int i = 1; i <= num_boxes; i++)\n     if (vals[i] > vals[box] && type[i] != type[box])\n       if (solve(i, sum + vals[i]) != INT_MAX)\n         res = min(res, abs(i - box) + solve(i, sum + vals[i]));\n   return dp[box][sum] = res;\n }\n int main() {\n   scanf('%d %d %d', &num_boxes, &start, &req);\n   for (int i = 1; i <= num_boxes; i++) scanf(' %d', &vals[i]);\n   for (int i = 1; i <= num_boxes; i++) scanf(' %c', &type[i]);\n   memset(dp, -1, sizeof dp);\n   int res = solve(start, vals[start]);\n   for (int i = 1; i <= num_boxes; i++)\n     if (solve(i, vals[i]) != INT_MAX)\n       res = min(res, abs(i - start) + solve(i, vals[i]));\n   printf('%d\n', (res == INT_MAX ? -1 : res));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n void maxE(T& a, const T& b) {\n   a = max(a, b);\n }\n template <typename T>\n void minE(T& a, const T& b) {\n   a = min(a, b);\n }\n template <typename T>\n ostream& operator<<(ostream& out, const vector<T>& t_) {\n   out << '[';\n   for (auto i : t_) out << i << ', ';\n   out << ']';\n   return out;\n }\n template <typename S, typename T>\n ostream& operator<<(ostream& out, const pair<S, T>& 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<int, int> 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<pair<int, int> > 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 <bits/stdc++.h>\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<pair<long long, long long> > 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<long long, long long> x, pair<long long, long long> y) {\n   return in[x.first] > in[y.first];\n }\n struct node {\n   long long siz, sum;\n   priority_queue<long long> 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<long long> 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<pair<long long, long long> > 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int maxn = 100005;\n int n, s;\n long long a[maxn], b[maxn], c[maxn];\n vector<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n long long n, m, k, x = 1;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n >> k;\n   m = k * (5 + (n - 1) * 6);\n   cout << m << endl;\n   while (n--) {\n     cout << x * k << ' ' << (x + 1) * k << ' ' << (x + 2) * k << ' '\n          << (x + 4) * k << endl;\n     x += 6;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 3e5 + 5;\n const long double PI = 3.1415926535;\n const long double eps = 1e-07;\n const long long INF = 1e18;\n const int inf = 1e9;\n const long long M = 305;\n const string IO[2]{'NO\n', 'YES\n'};\n const string io[2]{'No\n', 'Yes\n'};\n struct STree {\n   int start;\n   vector<int> t;\n   STree(int n) {\n     start = 1;\n     while (start < n) start *= 2;\n     t = vector<int>(2 * start, inf);\n   }\n   int min(int v, int l, int r, int ql, int qr) {\n     if (l > qr || r < ql) return inf;\n     if (l >= ql && r <= qr) return t[v];\n     int c = (l + r) / 2;\n     return std::min(min(2 * v, l, c, ql, qr), min(2 * v + 1, c + 1, r, ql, qr));\n   }\n   void upd(int v, int l, int r, int p, int x) {\n     if (l > p || r < p) return;\n     if (l == r) {\n       t[v] = x;\n       return;\n     }\n     int c = (l + r) / 2;\n     upd(2 * v, l, c, p, x);\n     upd(2 * v + 1, c + 1, r, p, x);\n     t[v] = std::min(t[2 * v], t[2 * v + 1]);\n   }\n };\n void solve() {\n   int m;\n   cin >> m;\n   vector<int> x(m);\n   for (int i = 0; i < m; ++i) cin >> x[i];\n   sort(x.begin(), x.end());\n   auto last = unique(x.begin(), x.end());\n   x.erase(last, x.end());\n   m = x.size();\n   int a, b;\n   cin >> b >> a;\n   int n = b - a + 1;\n   STree st = STree(n);\n   int start = st.start;\n   vector<int> maxx(n, 1);\n   for (auto& nx : x) {\n     int fa = ((a - 1) / nx) * nx + nx;\n     for (int i = fa; i <= b; i += nx) maxx[i - a] = max(maxx[i - a], nx - 1);\n   }\n   st.upd(1, 0, start - 1, n - 1, 0);\n   for (int i = b - 1; i >= a; --i) {\n     int x = i - a;\n     int cw = maxx[x];\n     int ans = 1 + st.min(1, 0, start - 1, x + 1, x + cw);\n     st.upd(1, 0, start - 1, x, ans);\n   }\n   cout << st.min(1, 0, start - 1, 0, 0) << '\n';\n }\n signed main() {\n   ios::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   int t = 1;\n   while (t--) solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   vector<string> a(n);\n   for (int i = 0; i < n; ++i) cin >> a[i];\n   for (int j = 0; j < m; ++j) {\n     vector<int> indx;\n     for (int i = 0; i < n; ++i) {\n       if (a[i][j] == '#') indx.push_back(i);\n     }\n     for (int i = 1; i < indx.size(); ++i) {\n       if (a[indx[i]] != a[indx[0]]) {\n         cout << 'No';\n         return 0;\n       }\n     }\n   }\n   cout << 'Yes';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 2 * 1e5 + 100;\n vector<int> Prime;\n int main() {\n   Prime.clear();\n   int n, k;\n   scanf('%d%d', &n, &k);\n   int flag = 1;\n   for (int i = 2; flag && i <= n; i++) {\n     if (n % i == 0) {\n       while (n % i == 0) {\n         Prime.push_back(i);\n         n /= i;\n       }\n       if (n == 1) {\n         flag = 0;\n       }\n       if (n < i && n > 1) {\n         flag = 0;\n         Prime.push_back(n);\n       }\n     }\n   }\n   if (Prime.size() < k) {\n     cout << -1 << endl;\n   } else {\n     for (int i = 0; i < k - 1; i++) {\n       cout << Prime[i] << ' ';\n     }\n     int ans = 1;\n     for (int i = k - 1; i < Prime.size(); i++) {\n       ans *= Prime[i];\n     }\n     if (ans != 1) {\n       cout << ans << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n struct SegTree {\n   int sz;\n   vector<int> 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<pair<int, int>> tph, thp;\n void plant(int p, int h) {\n   vector<pair<int, int>> 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<pair<int, int>> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> child[]) {\n   map<int, int> v1, v2, d1, d2;\n   stack<int> 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<int, int>::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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long int>());\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 <bits/stdc++.h>\n using namespace std;\n const int N = 20, S = (1 << 16) + 10, V = 2048;\n bitset<V> dp[S];\n int a[N], id[N];\n priority_queue<pair<int, int> > 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<int, int> x = q.top();\n     q.pop();\n     pair<int, int> y = q.top();\n     q.pop();\n     printf('%d %d\n', x.second, y.second);\n     int v = x.second + y.second, u = 0;\n     while (v % k == 0) v /= k, ++u;\n     q.push(make_pair(-(-x.first + u), v));\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/stack:200000000')\n #pragma GCC optimize('Ofast')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native')\n using namespace std;\n long long n, k, s, h[200005];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n >> k >> s;\n   h[0] = 1;\n   if (k * (n - 1) < s || k > s) {\n     cout << 'NO';\n     return 0;\n   }\n   long long t = s / k, z = s % k;\n   for (long long i = 1; i <= z; i++) {\n     if (h[i - 1] + t + 1 <= n) {\n       h[i] = h[i - 1] + t + 1;\n     } else\n       h[i] = h[i - 1] - t - 1;\n   }\n   for (long long i = z + 1; i <= k; i++) {\n     if (h[i - 1] + t <= n) {\n       h[i] = h[i - 1] + t;\n     } else\n       h[i] = h[i - 1] - t;\n   }\n   cout << 'YES\n';\n   for (long long i = 1; i <= k; i++) cout << h[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 0x3f3f3f3f;\n inline int Read() {\n   int x = 0, f = 1;\n   char c = getchar();\n   while (c > '9' || c < '0') {\n     if (c == '-') f = -1;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') {\n     x = x * 10 + c - '0';\n     c = getchar();\n   }\n   return x * f;\n }\n struct EDGE {\n   int from, to, w, next;\n } E[400005];\n int n, m;\n int HEAD[200005];\n int dep[200005], CENT;\n int pa[200005][50], maxx[200005][50];\n void ADD(int from, int to, int w) {\n   E[CENT].from = from;\n   E[CENT].to = to;\n   E[CENT].w = w;\n   E[CENT].next = HEAD[from];\n   HEAD[from] = CENT++;\n }\n void DFS(int u, int f) {\n   pa[u][0] = f;\n   for (int i = HEAD[u]; i != -1; i = E[i].next) {\n     int to = E[i].to;\n     if (to != f) {\n       dep[to] = dep[u] + 1;\n       maxx[to][0] = E[i].w;\n       DFS(to, u);\n     }\n   }\n }\n int maxh;\n void deal() {\n   int j;\n   for (j = 1; (1 << j) < n; j++)\n     for (int i = 1; i <= n; i++) {\n       int t = pa[i][j - 1];\n       pa[i][j] = pa[pa[i][j - 1]][j - 1];\n       maxx[i][j] = max(maxx[i][j - 1], maxx[t][j - 1]);\n     }\n   maxh = j - 1;\n }\n int swim(int x, int k, int &ma) {\n   ma = 0;\n   for (int i = 0; i <= maxh; i++) {\n     if (k >> i & 1) {\n       ma = max(ma, maxx[x][i]);\n       x = pa[x][i];\n     }\n   }\n   return x;\n }\n int LCA(int x, int y) {\n   if (dep[x] > dep[y]) swap(x, y);\n   int ans = 0;\n   y = swim(y, dep[y] - dep[x], ans);\n   if (x == y) return ans;\n   for (int i = maxh; i >= 0; i--) {\n     if (pa[x][i] != pa[y][i]) {\n       ans = max(ans, max(maxx[x][i], maxx[y][i]));\n       x = pa[x][i], y = pa[y][i];\n     }\n   }\n   return max(ans, max(maxx[x][0], maxx[y][0]));\n }\n const int N = 200005;\n struct edge {\n   int from, to, w, next;\n   int ty;\n   bool operator<(const edge a) const { return w < a.w; }\n };\n int pre[N], head[N];\n int cnt;\n edge e[200005 + 5];\n void add(int from, int to, int w) {\n   e[cnt].from = from;\n   e[cnt].to = to;\n   e[cnt].w = w;\n   e[cnt].next = head[from];\n   e[cnt].ty = 0;\n   head[from] = cnt++;\n }\n int find(int x) {\n   if (x == pre[x]) return x;\n   return pre[x] = find(pre[x]);\n }\n void Kruskal() {\n   for (int i = 1; i <= n; ++i) pre[i] = i;\n   sort(e, e + cnt);\n   for (int i = 0; i < cnt; ++i) {\n     int u = find(e[i].from);\n     int v = find(e[i].to);\n     if (u != v) {\n       pre[u] = v;\n       ADD(e[i].from, e[i].to, e[i].w);\n       ADD(e[i].to, e[i].from, e[i].w);\n       e[i].ty = 1;\n     }\n   }\n }\n int main() {\n   while (scanf('%d %d', &n, &m) != EOF) {\n     CENT = cnt = 0;\n     for (int i = 1; i <= n; i++) head[i] = HEAD[i] = -1;\n     for (int i = 1; i <= m; i++) {\n       int u = Read(), v = Read(), w = Read();\n       add(u, v, w);\n     }\n     Kruskal();\n     DFS(1, -1);\n     deal();\n     int ans = 0;\n     for (int i = 0; i < cnt; i++) {\n       if (!e[i].ty) {\n         int u = e[i].from, v = e[i].to;\n         int minn = LCA(u, v);\n         if (minn == e[i].w) ans++;\n       }\n     }\n     printf('%d\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n pair<long long, long long> a[200005];\n signed main() {\n   long long n, j;\n   cin >> n >> j;\n   j %= 2 * n;\n   long long x0, y0;\n   cin >> x0 >> y0;\n   for (long long i = 0; i < n; i++) {\n     cin >> a[i].first >> a[i].second;\n   }\n   for (long long i = 1; i <= j; i++) {\n     x0 = 2 * a[(i - 1) % n].first - x0;\n     y0 = 2 * a[(i - 1) % n].second - y0;\n   }\n   cout << x0 << ' ' << y0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(nullptr);\n   int T;\n   cin >> T;\n   while (T--) {\n     long long x, y;\n     cin >> x >> y;\n     if (y % x == 0LL) {\n       cout << x << '\n';\n     } else if (x > y) {\n       cout << x + y << '\n';\n     } else {\n       cout << (y / x) * x + (y - (y / x) * x) / 2 << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn=1e5+10;\n \n int a[maxn];\n int f[maxn];\n int n,m,gcnt,ans;\n \n int main()\n {\n 	scanf('%d',&n);\n 	for (int i=1;i<=n;i++) scanf('%d',&a[i]),f[i]=n+1;\n 	gcnt=1;\n 	for (int i=2,prevmin=0;i<=n;i++)\n 	{\n 		if (a[i-1]!=a[i]) gcnt++;\n 		f[a[i-1]]=min(f[a[i]]-1+(a[i-1]==a[i]),prevmin);\n 		prevmin=min(prevmin,f[a[i-1]]);\n 	}\n 	ans=n;\n 	for (int i=0;i<=n;i++) ans=min(ans,f[i]+gcnt);\n 	printf('%d\n',ans);\n }\n \n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s[2005];\n const int mod = 1e9 + 7;\n int n, k, t[2005];\n int a[2005][2005], b[2005][2005];\n int mp(const int &a, const int &b) { return (int)(1ll * a * b % mod); }\n int add(const int &a, const int &b) { return (a + b) % mod; }\n int main() {\n   scanf('%d %d %s', &n, &k, s);\n   int i, j, u, v, d, e;\n   for (i = 0; i < n; i++) t[i + 1] = s[i] - 'a';\n   for (i = 0; i <= n + 1; i++) a[i][0] = 1;\n   for (i = n; i > 0; i--) {\n     v = n - i;\n     for (j = 0; j <= k; j++) {\n       b[i][j] = add(b[i + 1][j], mp(t[i], a[i + 1][j]));\n       a[i][j] = add(a[i][j], b[i][j]);\n       for (u = 0; u <= v / 2; u++) {\n         e = j - (v - u + 1) * (u + 1);\n         if (e < 0) break;\n         if (2 * u == v)\n           a[i][j] = add(mp(25 - t[i + u], a[i + u + 1][e]), a[i][j]);\n         else {\n           a[i][j] = add(mp(25 - t[i + u], a[i + u + 1][e]), a[i][j]);\n           a[i][j] = add(mp(25 - t[i + v - u], a[i + v - u + 1][e]), a[i][j]);\n         }\n       }\n     }\n   }\n   printf('%d\n', a[1][k]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool isPrime(int n) {\n   if (n <= 1) return false;\n   if (n <= 3) return true;\n   if (n % 2 == 0 || n % 3 == 0) return false;\n   for (int i = 5; i * i <= n; i = i + 6)\n     if (n % i == 0 || n % (i + 2) == 0) return false;\n   return true;\n }\n int nextPrime(int N) {\n   if (N <= 1) return 2;\n   int prime = N;\n   bool found = false;\n   while (!found) {\n     prime++;\n     if (isPrime(prime)) found = true;\n   }\n   return prime;\n }\n long long int powerexp(long long int x, long long int n) {\n   long long int result = 1;\n   while (n) {\n     if (n & 1) result = result * x % 1000000007;\n     n = n / 2;\n     x = x * x % 1000000007;\n   }\n   return result;\n }\n int gcd(int a, int b) {\n   if (a == 0) return b;\n   if (b == 0) return a;\n   if (a == b) return a;\n   if (a > b) return gcd(a - b, b);\n   return gcd(a, b - a);\n }\n int largest_divisor(long long int n) {\n   long long int i;\n   for (i = n / 2; i >= 1; i--) {\n     if (n % i == 0) {\n       return i;\n     }\n   }\n   return 0;\n }\n bool checkPalindrome(string str) {\n   int n = str.length();\n   int count = 0;\n   for (int i = 0; i < n / 2; ++i)\n     if (str[i] != str[n - i - 1]) ++count;\n   return (count <= 1);\n }\n bool countDivisors(long long int n) {\n   int cnt = 0;\n   for (int i = 3; i <= sqrt(n); i = i + 2) {\n     if (n % i == 0) {\n       return true;\n     }\n   }\n   return false;\n }\n long long int factorial(long long int n) {\n   if (n == 0) return 0;\n   return n * factorial(n - 1);\n }\n long long int lcm(long long int a, long long int b) {\n   return (a / gcd(a, b)) * b;\n }\n void fastIO() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n }\n int main() {\n   long long int t = 1;\n   while (t--) {\n     long long int n;\n     cin >> n;\n     long long int a[n];\n     long long int z = 0, p = 0, neg = 0;\n     long long int res = 0;\n     for (long long int i = 0; i < n; i++) {\n       cin >> a[i];\n       if (a[i] == 0) {\n         res++;\n         z++;\n       } else if (a[i] > 0) {\n         res = res + (a[i] - 1);\n         p++;\n       } else {\n         res = res + (-1 - a[i]);\n         neg++;\n       }\n     }\n     if (neg % 2 == 1 && z == 0) {\n       res += 2;\n     }\n     cout << res << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = (int)2e9;\n int main() {\n   int k, n, m, q;\n   cin >> k >> n >> m >> q;\n   map<string, map<string, int>> rec;\n   vector<string> art(n);\n   map<int, map<string, int>> b;\n   for (int(i) = (int)(0); (i) < (int)n; ++(i)) cin >> art[i];\n   sort(art.begin(), art.end());\n   string s;\n   getline(cin, s);\n   for (int(i) = (int)(0); (i) < (int)m; ++(i)) {\n     getline(cin, s);\n     int p = s.find(':');\n     string ar = s.substr(0, p);\n     s = s.substr(p + 2, s.size());\n     s += ', ';\n     while (s != '') {\n       p = s.find(' ');\n       string t = s.substr(0, p);\n       s = s.substr(p + 1, s.size());\n       p = s.find(',');\n       string t2 = s.substr(0, p);\n       s = s.substr(p + 2, s.size());\n       int col = atoi(t2.c_str());\n       rec[ar][t] = col;\n     }\n   }\n   for (int(i) = (int)(0); (i) < (int)q; ++(i)) {\n     int t;\n     cin >> t;\n     string st;\n     cin >> st;\n     b[t][st]++;\n     for (map<string, map<string, int>>::iterator it1 = rec.begin();\n          it1 != rec.end(); ++it1) {\n       bool ok = true;\n       for (map<string, int>::iterator it2 = it1->second.begin();\n            it2 != it1->second.end(); ++it2) {\n         if (b[t].find(it2->first) == b[t].end() ||\n             b[t][it2->first] < it2->second) {\n           ok = false;\n           break;\n         }\n       }\n       if (ok) {\n         for (map<string, int>::iterator it2 = it1->second.begin();\n              it2 != it1->second.end(); ++it2) {\n           b[t][it2->first] -= it2->second;\n           if (b[t][it2->first] == 0) b[t].erase(it2->first);\n         }\n         b[t][it1->first]++;\n         break;\n       }\n     }\n   }\n   for (int(i) = (int)(1); (i) < (int)k + 1; ++(i)) {\n     cout << b[i].size() << '\n';\n     for (map<string, int>::iterator it = b[i].begin(); it != b[i].end(); ++it)\n       if (it->second) cout << it->first << ' ' << it->second << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mx = 3005;\n const int N = 100005;\n int n, a[mx][mx], b[mx][mx], ans[N];\n pair<int, int> t[N];\n inline int check(int lx, int rx, int ly, int ry) {\n   int cnt = b[rx][ry];\n   if (lx) cnt -= b[lx - 1][ry];\n   if (ly) cnt -= b[rx][ly - 1];\n   if (lx && ly) cnt += b[lx - 1][ly - 1];\n   int need = (rx - lx + 1) * (ry - ly + 1);\n   if (cnt != need) return -1;\n   if (ly)\n     if (a[rx][ly] == a[rx][ly - 1]) return -1;\n   if (lx)\n     if (a[lx][ry] == a[lx - 1][ry]) return -1;\n   for (int i = lx; i <= rx; i++)\n     if (a[i][ry] == a[i][ry + 1]) return false;\n   for (int i = ly; i <= ry; i++)\n     if (a[rx][i] == a[rx + 1][i]) return false;\n   return true;\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int q = (0); q <= ((n)-1); q++) {\n     int x1, y1, x2, y2;\n     scanf('%d%d%d%d', &x1, &y1, &x2, &y2);\n     for (int i = x1; i < x2; i++)\n       for (int j = y1; j < y2; j++) a[i][j] = q + 1, b[i][j] = 1;\n     t[q] = make_pair(x1, y1);\n   }\n   for (int i = (0); i <= ((mx)-1); i++)\n     for (int j = (0); j <= ((mx)-1); j++) {\n       if (i - 1 >= 0) b[i][j] += b[i - 1][j];\n       if (j - 1 >= 0) b[i][j] += b[i][j - 1];\n       if (i - 1 >= 0 && j - 1 >= 0) b[i][j] -= b[i - 1][j - 1];\n     }\n   random_shuffle(t, t + n);\n   for (int q = (0); q <= ((n)-1); q++) {\n     int si = t[q].first, sj = t[q].second;\n     int ei = si, ej = sj;\n     while (ei < mx && ej < mx) {\n       int ch = check(si, ei, sj, ej);\n       if (ch == -1) break;\n       if (ch == 1) {\n         for (int i = si; i <= ei; i++)\n           for (int j = sj; j <= ej; j++) ans[a[i][j]] = 1;\n         vector<int> res;\n         for (int i = 0; i < N; i++)\n           if (ans[i]) res.push_back(i);\n         printf('YES %d\n', (int)((res).end() - (res).begin()));\n         for (int i = (0); i <= (((int)((res).end() - (res).begin())) - 1);\n              i++) {\n           if (i) printf(' ');\n           printf('%d', res[i]);\n         }\n         puts('');\n         exit(0);\n       }\n       ei++;\n       ej++;\n     }\n   }\n   puts('NO');\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n using namespace std;\n \n #ifndef ONLINE_JUDGE\n   #include 'Mohit.h'\n #endif\n \n typedef long long ll;\n typedef long double ld;\n #define endl '\n'\n #define rep(i,n)  for(ll i = 0; i < (n); ++i)\n #define repA(i, a, n)  for(ll i = a; i <= (n); ++i)\n #define repD(i, a, n)  for(ll i = a; i >= (n); --i)\n #define trav(a, x) for(auto& a : x)\n #define all(x) x.begin(), x.end()\n #define ff first\n #define ss second\n #define pb push_back\n typedef vector<ll> vll;\n typedef vector<pair<ll,ll>> vpl;\n const ld PI = 4*atan((ld)1);\n const ll INF = 1e18;\n const ll mod = 1e9+7;\n \n int main()\n {\n     ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);\n     ll tt=1;\n         cin >> tt;\n     repA(qq,1,tt){\n         ll n; cin >> n;\n         vll a(n);\n         rep(i,n){\n             cin >> a[i];\n         }\n \n         ll ans = INF;\n         ll s1=a[0],s2=0,c1=1,c2=0;\n         ll m1=a[0],m2=INF;\n \n         repA(i,1,n-1){\n             if(i&1){\n                 m2 = min(m2,a[i]); s2 += a[i];\n                 ll t1 = (s2-m2)+(n-(c2))*m2;\n                 ll t2 = (s1-m1)+(n-(c1-1))*m1;\n                 ans = min(ans,t1+t2);\n                 c2++;\n             }else{\n                 m1 = min(m1,a[i]); s1 += a[i];\n                 ll t1 = (s1-m1)+(n-(c1))*m1;\n                 ll t2 = (s2-m2)+(n-(c2-1))*m2;\n                 ans = min(ans,t1+t2);\n                 c1++;\n             }\n         }\n \n         cout << ans << endl;\n     }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve() {\n   long long n, z = 0;\n   cin >> n;\n   long long a[n], b[n];\n   for (long long i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   for (long long i = 0; i < n; i++) {\n     cin >> b[i];\n   }\n   vector<long long> neg, pos;\n   for (long long i = 0; i < n; i++) {\n     if (a[i] == b[i]) z++;\n     if ((a[i] - b[i]) >= 0)\n       pos.push_back(a[i] - b[i]);\n     else\n       neg.push_back(b[i] - a[i]);\n   }\n   if (!pos.empty()) sort(pos.begin(), pos.end());\n   if (!neg.empty()) sort(neg.begin(), neg.end());\n   long long ans = 0, cnt = 0, j = (long long)neg.size() - 1,\n             k = (long long)pos.size() - 1;\n   ans += (k * (k + 1)) / 2;\n   ans -= (z * (z - 1)) / 2;\n   while (j >= 0 && !pos.empty()) {\n     if (k >= 0 && neg[j] < pos[k]) {\n       cnt++;\n       k--;\n     } else {\n       ans += cnt;\n       j--;\n     }\n   }\n   cout << ans << endl;\n   return;\n }\n int main() {\n   long long t;\n   t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 1e5 + 10;\n int a[MAXN];\n bool mark[MAXN];\n void add(int v, int u) {\n   while (mark[u] == false) {\n     cout << v << ' ' << u << endl;\n     mark[u] = true;\n     v = a[v];\n     u = a[u];\n   }\n }\n int dfs(int x) {\n   int ret = 1;\n   mark[x] = true;\n   if (mark[a[x]] == false) ret += dfs(a[x]);\n   return ret;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> a[i];\n   for (int i = 1; i <= n; i++)\n     if (a[i] == i) {\n       cout << 'YES' << endl;\n       for (int j = 1; j <= n; j++)\n         if (j != i) cout << i << ' ' << j << endl;\n       return 0;\n     }\n   int p = -1;\n   for (int i = 1; i <= n; i++)\n     if (mark[i] == false) {\n       int x = dfs(i);\n       if (x % 2) {\n         cout << 'NO' << endl;\n         return 0;\n       } else if (x == 2)\n         p = i;\n     }\n   if (p == -1) {\n     cout << 'NO' << endl;\n     return 0;\n   }\n   fill(mark, mark + MAXN, false);\n   cout << 'YES' << endl;\n   cout << p << ' ' << a[p] << endl;\n   mark[p] = mark[a[p]] = true;\n   for (int i = 1; i <= n; i++)\n     if (!mark[i]) add(p, i);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void task();\n int main() {\n   srand(time(0));\n   task();\n   return 0;\n }\n const int INF = 0x3f3f3f3f;\n const int N = 1e6 + 10;\n const int M = 1e7 + 100;\n const int OLOLO = 0xFFFFFFFF;\n int n, k;\n long long int cnt[N];\n set<int> vals;\n long long int ans;\n vector<int> masks;\n void task() {\n   cin >> n >> k;\n   for (int i = 0; i < n; ++i) {\n     int a;\n     cin >> a;\n     ++cnt[a];\n     vals.insert(a);\n   }\n   for (int i = 0; i < (1 << 14); ++i) {\n     if (__builtin_popcount(i) == k) {\n       masks.push_back(i);\n     }\n   }\n   for (int val : vals) {\n     for (int mask : masks) {\n       int result = val & (mask ^ OLOLO);\n       result |= (val ^ OLOLO) & mask;\n       if (result < N) {\n         if (val == result) {\n           ans += cnt[val] * (cnt[val] - 1);\n         } else {\n           ans += cnt[val] * cnt[result];\n         }\n       }\n     }\n   }\n   cout << ans / 2;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int mx = 0, a = 0, n;\n   string s;\n   cin >> n;\n   while (cin >> s) {\n     for (char c : s)\n       if (isupper(c)) a++;\n     mx = max(mx, a), a = 0;\n   }\n   cout << mx << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline void ckmax(T& x, T y) {\n   x = (y > x ? y : x);\n }\n template <typename T>\n inline void ckmin(T& x, T y) {\n   x = (y < x ? y : x);\n }\n namespace Fread {\n const int SIZE = 1 << 21;\n char buf[SIZE], *S, *T;\n inline char getchar() {\n   if (S == T) {\n     T = (S = buf) + fread(buf, 1, SIZE, stdin);\n     if (S == T) return EOF;\n   }\n   return *S++;\n }\n }  // namespace Fread\n namespace Fwrite {\n const int SIZE = 1 << 21;\n char buf[SIZE], *S = buf, *T = buf + SIZE;\n inline void flush() {\n   fwrite(buf, 1, S - buf, stdout);\n   S = buf;\n }\n inline void putchar(char c) {\n   *S++ = c;\n   if (S == T) flush();\n }\n struct NTR {\n   ~NTR() { flush(); }\n } ztr;\n }  // namespace Fwrite\n namespace Fastio {\n struct Reader {\n   template <typename T>\n   Reader& operator>>(T& x) {\n     char c = Fread ::getchar();\n     T f = 1;\n     while (c < '0' || c > '9') {\n       if (c == '-') f = -1;\n       c = Fread ::getchar();\n     }\n     x = 0;\n     while (c >= '0' && c <= '9') {\n       x = x * 10 + (c - '0');\n       c = Fread ::getchar();\n     }\n     x *= f;\n     return *this;\n   }\n   Reader& operator>>(char& c) {\n     c = Fread ::getchar();\n     while (c == '\n' || c == ' ') c = Fread ::getchar();\n     return *this;\n   }\n   Reader& operator>>(char* str) {\n     int len = 0;\n     char c = Fread ::getchar();\n     while (c == '\n' || c == ' ') c = Fread ::getchar();\n     while (c != '\n' && c != ' ') {\n       str[len++] = c;\n       c = Fread ::getchar();\n     }\n     str[len] = '\0';\n     return *this;\n   }\n   Reader() {}\n } cin;\n const char endl = '\n';\n struct Writer {\n   template <typename T>\n   Writer& operator<<(T x) {\n     if (x == 0) {\n       Fwrite ::putchar('0');\n       return *this;\n     }\n     if (x < 0) {\n       Fwrite ::putchar('-');\n       x = -x;\n     }\n     static int sta[45];\n     int top = 0;\n     while (x) {\n       sta[++top] = x % 10;\n       x /= 10;\n     }\n     while (top) {\n       Fwrite ::putchar(sta[top] + '0');\n       --top;\n     }\n     return *this;\n   }\n   Writer& operator<<(char c) {\n     Fwrite ::putchar(c);\n     return *this;\n   }\n   Writer& operator<<(char* str) {\n     int cur = 0;\n     while (str[cur]) Fwrite ::putchar(str[cur++]);\n     return *this;\n   }\n   Writer& operator<<(const char* str) {\n     int cur = 0;\n     while (str[cur]) Fwrite ::putchar(str[cur++]);\n     return *this;\n   }\n   Writer() {}\n } cout;\n }  // namespace Fastio\n const int MAXN = 1e5;\n const int MOD = 1e9 + 7;\n inline int mod1(int x) { return x < MOD ? x : x - MOD; }\n inline int mod2(int x) { return x < 0 ? x + MOD : x; }\n inline void add(int& x, int y) { x = mod1(x + y); }\n inline void sub(int& x, int y) { x = mod2(x - y); }\n int n, goal, a[MAXN + 5];\n int pw2[MAXN + 5];\n int dp[MAXN + 5][2][2][2];\n inline int calc0(int i, int have_1) {\n   if (have_1) assert(i);\n   return have_1 ? pw2[i - 1] : pw2[i];\n }\n inline int calc1(int i, int have_1) {\n   if (have_1) assert(i);\n   return have_1 ? pw2[i - 1] : 0;\n }\n int main() {\n   Fastio ::cin >> n >> goal;\n   for (int i = 1; i <= n; ++i) {\n     Fastio ::cin >> a[i];\n   }\n   pw2[0] = 1;\n   for (int i = 1; i <= n; ++i) pw2[i] = pw2[i - 1] * 2 % MOD;\n   dp[0][0][0][0] = 1;\n   for (int i = 1; i <= n; ++i) {\n     for (int have_r1 = 0; have_r1 <= 1; ++have_r1) {\n       for (int have_b1 = 0; have_b1 <= 1; ++have_b1) {\n         for (int s = 0; s <= 1; ++s)\n           if (dp[i - 1][have_r1][have_b1][s]) {\n             if (a[i] != 1) {\n               add(dp[i][have_r1][have_b1][s],\n                   (long long)dp[i - 1][have_r1][have_b1][s] *\n                       calc1(i - 1, have_b1) % MOD);\n               add(dp[i][have_r1 | 1][have_b1][s ^ 1],\n                   (long long)dp[i - 1][have_r1][have_b1][s] *\n                       calc0(i - 1, have_b1) % MOD);\n             }\n             if (a[i] != 0) {\n               add(dp[i][have_r1][have_b1][s],\n                   (long long)dp[i - 1][have_r1][have_b1][s] *\n                       calc1(i - 1, have_r1) % MOD);\n               add(dp[i][have_r1][have_b1 | 1][s ^ 1],\n                   (long long)dp[i - 1][have_r1][have_b1][s] *\n                       calc0(i - 1, have_r1) % MOD);\n             }\n           }\n       }\n     }\n   }\n   int ans = 0;\n   for (int have_r1 = 0; have_r1 <= 1; ++have_r1) {\n     for (int have_b1 = 0; have_b1 <= 1; ++have_b1) {\n       add(ans, dp[n][have_r1][have_b1][goal]);\n     }\n   }\n   Fastio ::cout << ans << Fastio ::endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool debug = 0;\n int n, m, k;\n int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\n long long ln, lk, lm;\n int x[105], y[105], r[105];\n string vs[2];\n void add(int id, int i, int x) {\n   string str = '(((1-abs((t-';\n   str += to_string(i);\n   str += ')))+abs((abs((t-';\n   str += to_string(i);\n   str += '))-1)))*';\n   str += to_string(x);\n   str += ')';\n   if (vs[id] == '')\n     vs[id] = str;\n   else {\n     vs[id] = '(' + vs[id] + '+' + str + ')';\n   }\n }\n void fmain() {\n   scanf('%d', &n);\n   for (int(i) = 0; (i) < (int)(2); (i)++) vs[i] = '';\n   for (int(i) = 0; (i) < (int)(n); (i)++) {\n     scanf('%d%d%d', x + i, y + i, r + i);\n     add(0, i + 1, x[i] / 2);\n     add(1, i + 1, y[i] / 2);\n   }\n   for (int(i) = 0; (i) < (int)(2); (i)++) cout << vs[i] << endl;\n }\n int main() {\n   fmain();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int bit(int x, int i) { return (x >> i) & 1; }\n inline int two(int x) { return 1 << x; }\n int n, s[110], m, team[110], dp[20][1 << 20];\n char op[110];\n bool vis[20][1 << 20];\n int go(int mi, int ban) {\n   if (mi == m) return 0;\n   int &ret = dp[mi][ban];\n   if (vis[mi][ban]) return ret;\n   vis[mi][ban] = 1;\n   ret = -514514514;\n   for (int i = 0; i < (int)(n); i++)\n     if (!bit(ban, i)) {\n       int now = go(mi + 1, ban | two(i));\n       int str = (op[mi] == 'p' ? s[i] : 0);\n       if (mi + 1 < m && team[mi + 1] != team[mi])\n         now = str - now;\n       else\n         now = str + now;\n       ret = max(ret, now);\n     }\n   return ret;\n }\n int main() {\n   scanf('%d', &(n));\n   for (int i = 0; i < (int)(n); i++) scanf('%d', &(s[i]));\n   scanf('%d', &(m));\n   for (int i = 0; i < (int)(m); i++) scanf(' %c %d', op + i, team + i);\n   sort(s, s + n, greater<int>());\n   n = m;\n   int ans = go(0, 0);\n   if (team[0] == 2) ans *= -1;\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a[3], ans;\n   cin >> a[0] >> a[1] >> a[2];\n   sort(a, a + 3);\n   ans = (a[1] - a[0]) + (a[2] - a[1]);\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, numero;\n   cin >> n;\n   if (n < 10)\n     cout << n;\n   else {\n     n -= 9;\n     if (n < 181) {\n       if (n % 2 == 0) {\n         n /= 2;\n         n -= 1;\n         n %= 10;\n         cout << n;\n       } else {\n         n = (n + 1) / 2;\n         cout << ((n - 1) / 10) + 1;\n       }\n     } else {\n       n -= 180;\n       numero = ((n - 1) / 3) + 1;\n       numero += 99;\n       n = n % 3;\n       switch (n) {\n         case 0:\n           cout << numero % 10;\n           break;\n         case 1:\n           cout << numero / 100;\n           break;\n         default:\n           cout << (numero % 100) / 10;\n           break;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, p[3000], k, m = 0, c;\n int main() {\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> p[i];\n   for (int i = 1; i <= n; i++) {\n     k = p[i];\n     c = 1;\n     while (k > 0) {\n       c++;\n       k = p[k];\n     }\n     m = max(c, m);\n   }\n   cout << m;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   char st[200010];\n   cin >> n >> st;\n   queue<int> d, r;\n   for (int i = 0; i < n; i++) {\n     if (st[i] == 'D')\n       d.push(i);\n     else\n       r.push(i);\n   }\n   while (!r.empty() && !d.empty()) {\n     int R = r.front(), D = d.front();\n     if (R < D) {\n       r.pop();\n       d.pop();\n       r.push(n + R);\n     } else {\n       d.pop();\n       r.pop();\n       d.push(n + D);\n     }\n   }\n   if (!r.empty())\n     cout << 'R' << endl;\n   else\n     cout << 'D' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long w, h;\n   cin >> w >> h;\n   long long res = 0;\n   if (w == 1 || h == 1) {\n     cout << '0' << endl;\n     return 0;\n   }\n   for (long long i = 1; i < h; i++) {\n     for (long long j = 1; j < w; j++) res += min(i, h - i) * min(j, w - j);\n   }\n   cout << res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   ;\n   long long n, k;\n   cin >> n >> k;\n   priority_queue<long long, vector<long long>, greater<long long>> priq;\n   long long cur = 0, co = 0;\n   map<long long, long long> ma;\n   while (n > 0) {\n     if (n % 2) {\n       ma[cur]++;\n       co++;\n     }\n     n /= 2;\n     cur++;\n   }\n   if (co > k) {\n     cout << 'No' << endl;\n     return 0;\n   }\n   for (long long i = 63; i >= -63; i--) {\n     long long temp = ma[i] + co;\n     if (temp <= k) {\n       co += ma[i];\n       ma[i - 1] += (2 * ma[i]);\n       ma[i] = 0;\n     } else {\n       break;\n     }\n   }\n   for (long long i = 63; i >= -63; i--)\n     for (long long j = 0; j < ma[i]; j++) {\n       priq.push(i);\n     }\n   while (priq.size() < k) {\n     long long x = priq.top();\n     priq.pop();\n     priq.push(x - 1);\n     priq.push(x - 1);\n   }\n   vector<long long> ans;\n   cout << 'Yes' << endl;\n   while (!priq.empty()) {\n     long long x = priq.top();\n     ans.push_back(x);\n     priq.pop();\n   }\n   sort(ans.begin(), ans.end(), greater<long long>());\n   for (long long i = 0; i < ans.size(); i++) cout << ans[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string start[1791791];\n string fin[1791791];\n pair<int, int> diffs[1791791];\n int is_in(string a, string b) {\n   string s = a + '#' + b;\n   int n = (int)s.length();\n   vector<int> pi(n);\n   for (int i = 1; i < n; ++i) {\n     int j = pi[i - 1];\n     while (j > 0 && s[i] != s[j]) j = pi[j - 1];\n     if (s[i] == s[j]) ++j;\n     pi[i] = j;\n   }\n   for (int i = (int)a.length(); i < pi.size(); ++i) {\n     if (pi[i] == a.length()) {\n       return i - 2 * (int)a.length();\n     }\n   }\n   return -1;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; ++i) {\n     cin >> start[i];\n   }\n   for (int i = 0; i < n; ++i) {\n     cin >> fin[i];\n   }\n   for (int i = 0; i < n; ++i) {\n     int first_diff = -1;\n     for (int ii = 0; ii < start[i].length(); ++ii) {\n       if (start[i][ii] != fin[i][ii]) {\n         first_diff = ii;\n         break;\n       }\n     }\n     int last_diff = -1;\n     for (int ii = 0; ii < start[i].length(); ++ii) {\n       if (start[i][ii] != fin[i][ii]) {\n         last_diff = ii;\n       }\n     }\n     diffs[i] = {first_diff, last_diff};\n   }\n   int one_with_diff = -1;\n   for (int i = 0; i < n; ++i) {\n     if (diffs[i].first != -1) {\n       one_with_diff = i;\n       break;\n     }\n   }\n   for (int i = 0; i < n; ++i) {\n     if (diffs[i].first != -1 && diffs[one_with_diff].first != -1 &&\n         i != one_with_diff) {\n       if (diffs[i].second - diffs[i].first !=\n           diffs[one_with_diff].second - diffs[one_with_diff].first) {\n         cout << 'NO';\n         return 0;\n       }\n       for (int ii = 0; ii <= diffs[i].second - diffs[i].first; ++ii) {\n         if (start[i][diffs[i].first + ii] !=\n                 start[one_with_diff][diffs[one_with_diff].first + ii] ||\n             fin[i][diffs[i].first + ii] !=\n                 fin[one_with_diff][diffs[one_with_diff].first + ii]) {\n           cout << 'NO';\n           return 0;\n         }\n       }\n     }\n   }\n   int same_pref_len = 0;\n   for (int pref_len = 1;; ++pref_len) {\n     char pref = '#';\n     bool ok = 1;\n     for (int i = 0; i < n; ++i) {\n       if (diffs[i].first != -1) {\n         if (diffs[i].first < pref_len) {\n           ok = 0;\n           break;\n         }\n         if (pref == '#') {\n           pref = start[i][diffs[i].first - pref_len];\n         } else {\n           if (pref != start[i][diffs[i].first - pref_len]) {\n             ok = 0;\n             break;\n           }\n         }\n       }\n     }\n     if (!ok) {\n       break;\n     }\n     same_pref_len += 1;\n   }\n   int same_suff_len = 0;\n   for (int suff_len = 1;; ++suff_len) {\n     char suff = '#';\n     bool ok = 1;\n     for (int i = 0; i < n; ++i) {\n       if (diffs[i].first != -1) {\n         if (diffs[i].second + suff_len >= start[i].length()) {\n           ok = 0;\n           break;\n         }\n         if (suff == '#') {\n           suff = start[i][diffs[i].second + suff_len];\n         } else {\n           if (suff != start[i][diffs[i].second + suff_len]) {\n             ok = 0;\n             break;\n           }\n         }\n       }\n     }\n     if (!ok) {\n       break;\n     }\n     same_suff_len += 1;\n   }\n   string from, to;\n   for (int i = 0; i < n; ++i) {\n     if (diffs[i].first != -1) {\n       from = '';\n       for (int j = diffs[i].first - same_pref_len;\n            j <= diffs[i].second + same_suff_len; ++j) {\n         from += start[i][j];\n       }\n       to = '';\n       for (int j = diffs[i].first - same_pref_len;\n            j <= diffs[i].second + same_suff_len; ++j) {\n         to += fin[i][j];\n       }\n       break;\n     }\n   }\n   for (int i = 0; i < n; ++i) {\n     if (diffs[i].first == -1) {\n       if (is_in(from, start[i]) != -1) {\n         cout << 'NO';\n         return 0;\n       }\n     } else {\n       if (is_in(from, start[i]) != diffs[i].first - same_pref_len) {\n         cout << 'NO';\n         return 0;\n       }\n     }\n   }\n   cout << 'YES' << endl;\n   cout << from << endl;\n   cout << to << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n int dist[10010], DD[30][30];\n int s[10010];\n vector<int> all;\n vector<int> a;\n queue<int> q;\n int dp[1 << 20];\n int n;\n void calc(int x) {\n   memset(dist, -1, sizeof(dist));\n   q.push(x), dist[x] = 0;\n   while (!q.empty()) {\n     int x = q.front();\n     q.pop();\n     for (int i = 0; i < all.size(); i++) {\n       int del = all[i];\n       if (x - del > 0 && dist[x - del] == -1) {\n         dist[x - del] = dist[x] + 1;\n         q.push(x - del);\n       }\n       if (x + del <= n + 1 && dist[x + del] == -1) {\n         dist[x + del] = dist[x] + 1;\n         q.push(x + del);\n       }\n     }\n   }\n }\n void chmin(int &x, int y) { x = min(x, y); }\n int main() {\n   int k, l;\n   scanf('%d%d%d', &n, &k, &l);\n   for (int i = 0; i < k; i++) {\n     int x;\n     scanf('%d', &x);\n     s[x] = 1;\n   }\n   while (l--) {\n     int x;\n     scanf('%d', &x);\n     all.push_back(x);\n   }\n   for (int i = n + 1; i >= 1; i--) {\n     s[i] ^= s[i - 1];\n   }\n   for (int i = 1; i <= n + 1; i++) {\n     if (s[i]) a.push_back(i);\n   }\n   for (int i = 0; i < a.size(); i++) {\n     int x = a[i];\n     calc(x);\n     for (int j = 0; j < a.size(); j++) {\n       DD[i][j] = dist[a[j]];\n     }\n   }\n   int N = a.size();\n   memset(dp, 0x3f, sizeof(dp));\n   dp[0] = 0;\n   for (int mask = 0; mask < (1 << N) - 1; mask++) {\n     if (dp[mask] == INF) continue;\n     int x = 0;\n     while (mask >> x & 1) x++;\n     for (int y = x + 1; y < N; y++) {\n       if (mask >> y & 1) continue;\n       if (DD[x][y] == -1) continue;\n       chmin(dp[mask | 1 << x | 1 << y], dp[mask] + DD[x][y]);\n     }\n   }\n   printf('%d\n', dp[(1 << N) - 1] == INF ? -1 : dp[(1 << N) - 1]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct debugger {\n   template <typename T>\n   debugger& operator,(const T& v) {\n     cerr << v << ' ';\n     return *this;\n   }\n } dbg;\n int inf = (1 << 20);\n int dp[(1 << 21) + 10];\n void F(int x, int y) {\n   x += inf;\n   y += inf;\n   dp[x]++;\n   if (x == y) return;\n   dp[y]++;\n   while (x / 2 != y / 2) {\n     if (x % 2 == 0) dp[x + 1]++;\n     if (y % 2 == 1) dp[y - 1]++;\n     x /= 2;\n     y /= 2;\n   }\n   return;\n }\n int ar[400010];\n int n, k;\n int func(int x) {\n   int sm = 0;\n   x += inf;\n   while (x > 1) {\n     sm += dp[x];\n     x /= 2;\n   }\n   return sm;\n }\n int chk(int x) {\n   int sm = 0;\n   for (int i = x; i <= ar[n - 1]; i += x) sm += func(i);\n   if (sm == n) return 1;\n   return 0;\n }\n int main() {\n   cin >> n >> k;\n   for (int i = (0), _n = (n); i < _n; i++) cin >> ar[i];\n   sort(ar, ar + n);\n   if (ar[0] <= k) {\n     cout << ar[0] << endl;\n     return 0;\n   }\n   for (int i = (0), _n = (n); i < _n; i++) F(ar[i] - k, ar[i]);\n   int rs = k;\n   for (int i = (2), _n = (ar[0]); i <= _n; i++)\n     if (chk(i)) rs = i;\n   cout << rs << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t, n, i, j, k, tmp;\n   int a, b, c;\n   cin >> a >> b >> c;\n   int p;\n   if ((c - b + a) % 2 != 0) {\n     printf('Impossible\n');\n     return 0;\n   }\n   p = (c - b + a) / 2;\n   int count1 = 0;\n   if (p == 0) {\n     count1++;\n   }\n   if (a - p == 0) {\n     count1++;\n   }\n   if (b - (a - p) == 0) {\n     count1++;\n   }\n   if (p >= 0 && a - p >= 0 && b - (a - p) >= 0 && count1 <= 1) {\n     cout << a - p << ' ' << b - (a - p) << ' ' << p << endl;\n   } else {\n     printf('Impossible\n');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int n, k;\n   cin >> n >> k;\n   map<int, int> m;\n   int c[7000][2];\n   int a[n + 1];\n   int b[n + 1];\n   int mx;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n     m[a[i]]++;\n     mx = max(mx, m[a[i]]);\n   }\n   if (mx > k) {\n     cout << 'NO' << endl;\n     return 0;\n   }\n   int x = 0;\n   for (auto i : m) {\n     c[i.first][0] = x;\n     x = x + i.second;\n   }\n   cout << 'YES' << endl;\n   for (int i = 0; i < n; i++) {\n     cout << (c[a[i]][0] % k) + 1 << ' ';\n     c[a[i]][0]++;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   double n, m, a, b, x = 1000000, y;\n   cin >> n >> m;\n   while (n--) {\n     cin >> a >> b;\n     y = a / b;\n     x = min(x, y);\n   }\n   printf('%.8lf\n', m * x);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long bigmod(long long p, long long e, long long M) {\n   long long ret = 1;\n   for (; e > 0; e >>= 1) {\n     if (e & 1) ret = (ret * p) % M;\n     p = (p * p) % M;\n   }\n   return ret;\n }\n long long extended(long long a, long long b, long long &x, long long &y) {\n   a = abs(a);\n   b = abs(b);\n   long long g, x1, y1;\n   if (!b) {\n     x = 1;\n     y = 0;\n     g = a;\n     return g;\n   }\n   g = extended(b, a % b, x1, y1);\n   x = y1;\n   y = x1 - (a / b) * y1;\n   return g;\n }\n long long modinverse(long long a, long long M) { return bigmod(a, M - 2, M); }\n long long bpow(long long p, long long e) {\n   long long ret = 1;\n   for (; e > 0; e >>= 1) {\n     if (e & 1) ret = (ret * p);\n     p = (p * p);\n   }\n   return ret;\n }\n int toInt(string s) {\n   int sm;\n   stringstream ss(s);\n   ss >> sm;\n   return sm;\n }\n int toLlint(string s) {\n   long long int sm;\n   stringstream ss(s);\n   ss >> sm;\n   return sm;\n }\n string convertInt(long long number) {\n   if (number == 0) return '0';\n   string temp = '';\n   string returnvalue = '';\n   while (number > 0) {\n     temp += number % 10 + 48;\n     number /= 10;\n   }\n   for (int i = 0; i < temp.length(); i++)\n     returnvalue += temp[temp.length() - i - 1];\n   return returnvalue;\n }\n long long ncr[1001][1001];\n void NCR() {\n   for (int i = 1; i <= 1000; i++) {\n     ncr[i][i] = 1;\n     ncr[i][0] = 1;\n     for (int r = 1; r < i; r++) {\n       ncr[i][r] = (ncr[i - 1][r] + ncr[i - 1][r - 1]) % 1000000007;\n     }\n   }\n }\n vector<int> vec[100009];\n long long n;\n long long dp[100005][2], ar[100009];\n void dfs(int V, int pv) {\n   dp[V][0] = 1 - ar[V];\n   dp[V][1] = ar[V];\n   for (int i = 0; i < vec[V].size(); i++) {\n     long long old[2];\n     memset(old, 0, sizeof(old));\n     int v = vec[V][i];\n     if (v == pv) continue;\n     old[0] = dp[V][0];\n     old[1] = dp[V][1];\n     dp[V][0] = dp[V][1] = 0;\n     dfs(v, V);\n     dp[V][0] += (old[0] * dp[v][1]) % 1000000007;\n     dp[V][1] += (old[1] * dp[v][1]) % 1000000007;\n     dp[V][1] += (old[1] * dp[v][0]) % 1000000007;\n     dp[V][1] += (old[0] * dp[v][1]) % 1000000007;\n     dp[V][0] += (old[0] * dp[v][0]) % 1000000007;\n   }\n }\n int main() {\n   cin >> n;\n   for (int i = 1; i < n; i++) {\n     int v;\n     cin >> v;\n     vec[i].push_back(v);\n     vec[v].push_back(i);\n   }\n   for (int i = 0; i < n; i++) {\n     int val;\n     cin >> val;\n     ar[i] = val;\n   }\n   dfs(0, -1);\n   cout << dp[0][1] % 1000000007 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> prim;\n const int N = 1e5 + 9;\n int n, dp[10000], a[N];\n bool v[100000];\n int pos[100000];\n void pre() {\n   for (int i = 2; i < 100000; i++)\n     if (!v[i]) {\n       prim.push_back(i);\n       pos[i] = prim.size() - 1;\n       int k = i << 1;\n       while (k < 100000) v[k] = 1, k += i;\n     }\n }\n int main() {\n   pre();\n   int ans = 1;\n   cin >> n;\n   for (int i = 1, now; i <= n; i++) {\n     cin >> now;\n     int org = now;\n     int tmp = 0;\n     for (int j = 0; j < 100; j++)\n       if (now % prim[j] == 0) {\n         while (now % prim[j] == 0) now /= prim[j];\n         tmp = max(tmp, dp[j] + 1);\n       }\n     if (now > 1) tmp = max(tmp, dp[pos[now]] + 1);\n     for (int j = 0; j < 100; j++)\n       if (org % prim[j] == 0) {\n         while (org % prim[j] == 0) org /= prim[j];\n         dp[j] = tmp;\n       }\n     if (org > 1) dp[pos[now]] = tmp;\n     ans = max(ans, tmp);\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int power(long long int a, long long int b) {\n   long long int res = 1;\n   a %= 1000000007;\n   assert(b >= 0);\n   for (; b; b >>= 1) {\n     if (b & 1) res = res * a % 1000000007;\n     a = a * a % 1000000007;\n   }\n   return res;\n }\n long long int modInverse(long long int a) { return power(a, 1000000007 - 2); }\n const int N = 500023;\n bool vis[N];\n vector<int> adj[N];\n void solve() {\n   long long int n, m;\n   cin >> n >> m;\n   string s;\n   cin >> s;\n   s = '&' + s;\n   map<long long int, long long int> repeat;\n   for (long long int i = 0; i < m; i++) {\n     long long int c;\n     cin >> c;\n     repeat[c]++;\n   }\n   long long int cnt[28] = {0};\n   long long int final[28] = {0};\n   for (int i = 1; i <= n; i++) {\n     cnt[s[i] - 'a']++;\n     final[s[i] - 'a']++;\n     for (int j = 0; j < 26; j++) {\n       final[j] += (cnt[j] * repeat[i]);\n     }\n   }\n   for (int i = 0; i < 26; i++) {\n     cout << final[i] << ' ';\n   }\n   cout << '\n';\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int T = 1;\n   cin >> T;\n   int t = 0;\n   while (t++ < T) {\n     solve();\n   }\n   cerr << 'Time : ' << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC\n        << 'ms\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long double EPS = 1e-9;\n long double Dis(long long a, long long Y, long long b, long long YY) {\n   return sqrt((long double)(b - a) * (b - a) + (Y - YY) * (Y - YY));\n }\n struct PT {\n   long long ID;\n   long double len, Y;\n   PT(long long _ID, long double _Y) {\n     ID = _ID;\n     Y = _Y;\n   }\n   bool operator<(const PT &a) const { return (Y < a.Y); }\n };\n vector<PT> A, B;\n void BinSearch(vector<PT> &C, long double val, long long &low, long long &up) {\n   long long i, med;\n   up = C.size() - 1;\n   low = 0;\n   if (val >= C[up].Y) {\n     low = max(up - 1, low);\n     return;\n   }\n   if (val <= C[low].Y) {\n     up = min(low + 1, up);\n     return;\n   }\n   while ((up - low) > 1) {\n     med = (up + low) / 2;\n     if (C[med].Y < val)\n       low = med;\n     else\n       up = med;\n   }\n }\n int main() {\n   long long i, n, m, a, b, temp;\n   cin >> n >> m >> a >> b;\n   for (i = 0; i < n; i++) {\n     cin >> temp;\n     A.push_back(PT(i + 1, temp));\n     A[i].len = Dis(0, 0, a, temp);\n   }\n   for (i = 0; i < m; i++) {\n     cin >> temp;\n     B.push_back(PT(i + 1, temp));\n   }\n   for (i = 0; i < m; i++) {\n     cin >> temp;\n     B[i].len = temp;\n   }\n   sort(A.begin(), A.end());\n   sort(B.begin(), B.end());\n   long long ind1, ind2;\n   long double ans, tmp1, tmp2, mini, tt;\n   long long l, u;\n   ans = 1e18;\n   for (i = 0; i < m; i++) {\n     tt = ((long double)a * B[i].Y) / ((long double)(b));\n     BinSearch(A, tt, l, u);\n     tmp1 = Dis(a, A[u].Y, b, B[i].Y) + A[u].len;\n     tmp2 = Dis(a, A[l].Y, b, B[i].Y) + A[l].len;\n     mini = min(tmp1, tmp2);\n     if (ans > (B[i].len + mini)) {\n       if ((tmp1 < tmp2))\n         ind1 = A[u].ID, ans = B[i].len + tmp1;\n       else\n         ind1 = A[l].ID, ans = B[i].len + tmp2;\n       ind2 = B[i].ID;\n     }\n   }\n   cout << ind1 << ' ' << ind2 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 4000 + 10, MOD = (int)1e9 + 9;\n int n, m, b, w, f[MAXN][MAXN];\n int main() {\n   cin >> n >> w >> b;\n   m = max(b, w);\n   f[0][0] = 1;\n   for (int i = 1; i <= m; ++i) {\n     for (int j = 1; j <= i; ++j)\n       f[i][j] = ((long long)f[i - 1][j] * (j + i - 1) +\n                  (long long)f[i - 1][j - 1] * j) %\n                 MOD;\n   }\n   int Tohka = 0;\n   for (int i = 1; i <= min(b, n - 2); ++i)\n     Tohka = ((long long)Tohka +\n              (long long)f[w][n - i] * f[b][i] % MOD * (n - i - 1)) %\n             MOD;\n   cout << Tohka << endl;\n   fclose(stdin);\n   fclose(stdout);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline void read(long long &x) {\n   long long f = 1;\n   x = 0;\n   char c = getchar();\n   while (c < '0' || c > '9') {\n     if (c == '-') f = -1;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') {\n     x = x * 10 + c - '0';\n     c = getchar();\n   }\n   x *= f;\n }\n long long fa[200005][21], lg[2 * 200005], deep[200005], dis[200005], w[200005],\n     t[200005], h[200005], head, n, ans[200005];\n struct yyy {\n   long long to, z, w;\n   inline void add(long long x, long long y, long long W) {\n     to = y;\n     z = h[x];\n     h[x] = head;\n     w = W;\n   }\n } a[200005 * 2];\n inline void dfs2(long long x, long long pre) {\n   register long long i;\n   deep[x] = deep[pre] + 1;\n   fa[x][0] = pre;\n   for (i = 1; i <= lg[deep[x]]; i++) fa[x][i] = fa[fa[x][i - 1]][i - 1];\n   for (i = h[x]; i; i = a[i].z)\n     if (a[i].to != pre) dis[a[i].to] = dis[x] + a[i].w, dfs2(a[i].to, x);\n }\n inline void dfs(long long x, long long pre) {\n   register long long i;\n   for (i = h[x]; i; i = a[i].z)\n     if (a[i].to ^ pre) {\n       dfs(a[i].to, x);\n       t[x] += t[a[i].to];\n     }\n }\n inline void init() {\n   register long long i, j, k;\n   for (j = 1, k = 1; j <= n; j <<= 1, k++)\n     for (i = j; i < j * 2; i++) lg[i] = k;\n   dfs2(1, 0);\n }\n signed main() {\n   register long long i, j, x, y;\n   read(n);\n   for (i = 1; i <= n; i++) read(w[i]);\n   for (i = 2; i <= n; i++) {\n     read(x);\n     read(y);\n     a[++head].add(i, x, y);\n     a[++head].add(x, i, y);\n   }\n   init();\n   for (i = 2; i <= n; i++) {\n     x = i;\n     for (j = lg[deep[i]]; j >= 0; j--)\n       if (fa[x][j] && dis[i] - dis[fa[x][j]] <= w[i]) x = fa[x][j];\n     t[fa[x][0]]--;\n     t[fa[i][0]]++;\n   }\n   dfs(1, 0);\n   for (i = 1; i <= n; i++) printf('%lld ', t[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, x, a[200000];\n long long bs(long long xx, long long yy, long long k) {\n   long long m = (xx + yy) / 2;\n   if (yy - xx <= 1) return xx;\n   if (a[m] <= k)\n     return bs(m, yy, k);\n   else\n     return bs(xx, m, k);\n }\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   sort(a, a + n);\n   x = 1;\n   for (int j = 0; j < 31; j++) {\n     for (int i = 0; i < n; i++) {\n       if (a[bs(0, n, a[i] - x)] == a[i] - x &&\n           a[bs(0, n, a[i] + x)] == a[i] + x) {\n         return cout << 3 << endl\n                     << a[i] - x << ' ' << a[i] << ' ' << a[i] + x,\n                0;\n       }\n     }\n     x *= 2;\n   }\n   x = 1;\n   for (int j = 0; j < 31; j++) {\n     for (int i = 0; i < n; i++) {\n       if (a[bs(0, n, a[i] - x)] == a[i] - x) {\n         return cout << 2 << endl << a[i] - x << ' ' << a[i], 0;\n       }\n     }\n     x *= 2;\n   }\n   cout << 1 << endl << a[0];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void fastIo() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n }\n int main() {\n   fastIo();\n   int q;\n   cin >> q;\n   while (q--) {\n     int n;\n     cin >> n;\n     string s;\n     cin >> s;\n     if (n == 1) {\n       cout << 'NO' << endl;\n     } else if (n == 2) {\n       if (s[0] >= s[1])\n         cout << 'NO' << endl;\n       else {\n         cout << 'YES' << endl;\n         cout << '2' << endl;\n         cout << s[0] << ' ' << s[1] << endl;\n       }\n     } else {\n       cout << 'YES' << endl;\n       cout << '2' << endl;\n       cout << s[0] << ' ';\n       for (int i = 1; i < n; i++) cout << s[i];\n       cout << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     string s1, s2;\n     cin >> s1 >> s2;\n     bool poss = true;\n     int change[20][20];\n     memset(change, 0, sizeof(change));\n     for (int i = 0; i < n; i++) {\n       if (s1[i] > s2[i])\n         poss = false;\n       else {\n         if (s1[i] != s2[i]) {\n           change[s1[i] - 97][s2[i] - 97]++;\n         }\n       }\n     }\n     if (!poss) {\n       cout << -1 << endl;\n       continue;\n     }\n     int steps = 0;\n     for (int i = 0; i < 19; i++) {\n       int x = -1;\n       for (int j = 1; j < 20; j++) {\n         if (change[i][j] > 0) {\n           steps++;\n           x = j;\n           break;\n         }\n       }\n       if (x != -1) {\n         for (int j = x + 1; j <= 20; j++) {\n           change[x][j] += change[i][j];\n         }\n       }\n     }\n     cout << steps << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int inf = 1e9;\n const double eps = 1e-9;\n const int mod = 1e9 + 7;\n using namespace std;\n int mypow(int x, int y) {\n   int res = 1;\n   for (; y >= 1; y >>= 1) {\n     if (y & 1) res = (1ll * res * x) % mod;\n     x = (1ll * x * x) % mod;\n   }\n   return res;\n }\n int32_t main() {\n   long long n;\n   int k;\n   cin >> n >> k;\n   vector<long long> p;\n   vector<int> al;\n   long long x = n;\n   for (long long i = 2; i * i <= x; ++i) {\n     if (!(x % i)) {\n       p.push_back(i);\n       al.push_back(0);\n     }\n     int c = 0;\n     while (!(x % i)) {\n       al[al.size() - 1]++;\n       x /= i;\n     }\n   }\n   if (x != 1) {\n     p.push_back(x);\n     al.push_back(1);\n   }\n   int ans = 1;\n   for (int o = 0; o < p.size(); ++o) {\n     vector<vector<int>> dp(k + 1, vector<int>(al[o] + 1, 0));\n     dp[0][al[o]] = 1;\n     for (int i = 1; i <= k; ++i) {\n       for (int j = 0; j <= al[o]; ++j) {\n         int s = (1ll * dp[i - 1][j] * mypow(j + 1, mod - 2)) % mod;\n         for (int h = 0; h <= j; ++h) {\n           dp[i][h] = (dp[i][h] + s) % mod;\n         }\n       }\n     }\n     int l = 0;\n     int r = 1;\n     for (int j = 0; j <= al[o]; ++j) {\n       l = (l + (1ll * dp[k][j] * r) % mod) % mod;\n       r = (1ll * r * (p[o] % mod)) % mod;\n     }\n     ans = (1ll * ans * l) % mod;\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n bool local = false;\n using namespace std;\n template <class T>\n string toString(T x) {\n   ostringstream sout;\n   sout << x;\n   return sout.str();\n }\n template <class T>\n void print(T v) {\n   cout << ((int)(v).size()) << '\n';\n   for (auto x : v) cout << x << ' ';\n   cout << '\n';\n };\n template <class T1, class T2>\n ostream &operator<<(ostream &o, pair<T1, T2> x) {\n   return o << x.first << ' ' << x.second;\n }\n template <class T1, class T2>\n istream &operator>>(istream &o, pair<T1, T2> &x) {\n   return o >> x.first >> x.second;\n }\n template <class T1, class T2>\n pair<T1, T2> operator+(pair<T1, T2> a, pair<T1, T2> b) {\n   a.first += b.first;\n   a.second += b.second;\n   return a;\n }\n template <class T1, class T2>\n pair<T1, T2> operator-(pair<T1, T2> a, pair<T1, T2> b) {\n   a.first -= b.first;\n   a.second -= b.second;\n   return a;\n }\n template <class T1, class T2>\n void operator+=(pair<T1, T2> &a, pair<T1, T2> b) {\n   a.first += b.first;\n   a.second += b.second;\n }\n template <class T1, class T2>\n void operator-=(pair<T1, T2> &a, pair<T1, T2> b) {\n   a.first -= b.first;\n   a.second -= b.second;\n }\n int nint() {\n   int x;\n   cin >> x;\n   return x;\n }\n double getTime() { return clock() / (double)CLOCKS_PER_SEC; };\n mt19937 rnd(0);\n int rand(int n) { return rnd() % n; }\n int rand(int l, int r) { return rnd() % (r - l + 1) + l; }\n const int mod = 1000000000 + 7;\n void initIO() {\n   if (local) {\n     freopen('input.txt', 'r', stdin);\n     srand((int)time(0));\n     rnd.seed((int)time(0));\n   } else {\n   }\n   {\n     ios::sync_with_stdio(0);\n     cin.tie(0);\n     cout.tie(0);\n   };\n }\n int m;\n int n;\n vector<pair<int, int> > v;\n vector<int> v1, v2;\n const int K = 19;\n bool f(pair<int, int> a, pair<int, int> b) {\n   if (a.first != b.first) return a.first < b.first;\n   return a.second > b.second;\n }\n vector<pair<int, int> > update(vector<pair<int, int> > v) {\n   vector<pair<int, int> > ans;\n   ans.emplace_back(v[0]);\n   for (int i = 1; i < ((int)(v).size()); i++) {\n     pair<int, int> x = ans.back();\n     pair<int, int> y = v[i];\n     if (y.second <= x.second) continue;\n     ans.emplace_back(y);\n   }\n   return ans;\n }\n int get(int x) {\n   int p = upper_bound(v1.begin(), v1.end(), x) - v1.begin() - 1;\n   if (p == -1) return -1;\n   return p;\n }\n int ne[K + 1][200500];\n void calc() {\n   for (int i = 0; i < (n); i++) ne[0][i] = i;\n   for (int t = 1; t < K; t++) {\n     for (int i = 0; i < (n); i++) {\n       int x = v2[ne[t - 1][i]];\n       int id = get(x);\n       x = ne[t - 1][id];\n       ne[t][i] = x;\n     }\n   }\n }\n int getans(int x, int y) {\n   int p = get(x);\n   if (p == -1) return -1;\n   int ans = 1;\n   for (int i = K - 1; i > 0; i--) {\n     while (1) {\n       int np = ne[i][p];\n       if (p == np) break;\n       if (v2[np] < y) {\n         p = np;\n         ans += (1 << i) - 1;\n       } else\n         break;\n     }\n   }\n   if (v2[p] < y) {\n     p = ne[1][p];\n     ans++;\n   }\n   if (v[p].second < y) return -1;\n   return ans;\n }\n int main() {\n   initIO();\n   cin >> n >> m;\n   for (int i = 0; i < (n); i++) {\n     int l, r;\n     cin >> l >> r;\n     v.emplace_back(l, r);\n   }\n   sort(v.begin(), v.end(), f);\n   v = update(v);\n   n = ((int)(v).size());\n   for (int i = 0; i < (n); i++) {\n     v1.emplace_back(v[i].first);\n     v2.emplace_back(v[i].second);\n   };\n   ;\n   ;\n   ;\n   calc();\n   for (int i = 0; i < (m); i++) {\n     int l, r;\n     cin >> l >> r;\n     cout << getans(l, r) << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<long long, map<long long, long long, greater<long long>>> comp;\n map<long long, long long, greater<long long>> Add(long long x) {\n   if (x == 0) return {};\n   if (comp.count(x)) return comp[x];\n   long long choose = (x - 1) / 2;\n   long long diff = min(choose + 1, x - choose);\n   map<long long, long long, greater<long long>> ret = {{diff, 1}};\n   for (long long xp : {choose, x - choose - 1})\n     for (auto p : Add(xp)) ret[p.first] += p.second;\n   return comp[x] = ret;\n }\n long long Solve(long long x, long long seek, long long& cnt) {\n   long long choose = (x - 1) / 2;\n   long long diff = min(choose + 1, x - choose);\n   if (diff == seek) {\n     return choose + cnt;\n   }\n   long long ret = 0;\n   for (long long xp : {choose, x - choose - 1}) {\n     long long now = Add(xp)[seek];\n     if (now > cnt) {\n       return ret + Solve(xp, seek, cnt);\n     }\n     cnt -= now;\n     ret += choose + 1;\n   }\n   assert(false);\n }\n int32_t main() {\n   long long n, k;\n   cin >> n >> k;\n   if (k == 1) {\n     cout << 1 << endl;\n     return 0;\n   }\n   if (k == 2) {\n     cout << n << endl;\n     return 0;\n   }\n   n -= 2;\n   k -= 3;\n   for (auto p : Add(n)) {\n     if (p.second > k) {\n       cout << 2 + Solve(n, p.first, k) << endl;\n       return 0;\n     }\n     k -= p.second;\n   }\n   assert(false);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n void smax(T &a, T b) {\n   if (a < b) a = b;\n }\n const double EPS = 1e-9;\n vector<pair<pair<int, int>, int> > adj[100000 + 10];\n long long totSum;\n pair<pair<int, int>, int> edges[100000 + 10];\n int belows[100000 + 10];\n int n;\n pair<long long, int> f(int u, int jad) {\n   long long sum = 0;\n   int cnts = 0;\n   for (int i = 0; i < ((int)(adj[u]).size()); ++i) {\n     int v = adj[u][i].first.first;\n     int cost = adj[u][i].first.second;\n     int edge = adj[u][i].second;\n     if (v == jad) {\n       continue;\n     }\n     pair<long long, int> temp = f(v, u);\n     int cnt = temp.second;\n     long long belowSum = temp.first + (long long)cost * cnt;\n     belows[edge] = cnt;\n     totSum += cnt * sum;\n     totSum += cnts * belowSum;\n     sum += belowSum;\n     cnts += cnt;\n   }\n   cnts++;\n   totSum += sum;\n   return make_pair(sum, cnts);\n }\n inline long long getDollarBabe(long long temp) { return temp * (n - temp); }\n int main(int argc, char const *argv[]) {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n;\n   for (int i = 0; i < n - 1; ++i) {\n     int u, v, len;\n     cin >> u >> v >> len;\n     if (u > v) {\n       swap(u, v);\n     }\n     u--;\n     v--;\n     adj[u].push_back(make_pair(make_pair(v, len), i));\n     adj[v].push_back(make_pair(make_pair(u, len), i));\n     edges[i] = make_pair(make_pair(u, v), len);\n   }\n   totSum = 0;\n   f(0, -1);\n   int q;\n   cin >> q;\n   while (q--) {\n     int r, w;\n     cin >> r >> w;\n     r--;\n     int temp = belows[r];\n     totSum -= (edges[r].second - w) * getDollarBabe(temp);\n     edges[r].second = w;\n     cout << fixed << setprecision(8)\n          << (double)totSum * 6 / ((long long)(n) * (n - 1)) << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1000000007;\n int main() {\n   int n, m;\n   scanf('%d %d', &n, &m);\n   string S;\n   set<int> H[n];\n   set<int> V[m];\n   for (int i = 0; i < (n); i++) {\n     cin >> S;\n     for (int j = 0; j < (m); j++)\n       if (S[j] != '.') {\n         int t = S[j] - '0';\n         int h = (t <= 2);\n         int v = (t == 1 || t == 4);\n         H[i].insert((h + j) % 2);\n         V[j].insert((v + i) % 2);\n       }\n   }\n   bool good = true;\n   int cnt = m + n;\n   for (int i = 0; i < (n); i++) {\n     if (H[i].size() > 1)\n       good = 0;\n     else if (H[i].size())\n       --cnt;\n   }\n   for (int j = 0; j < (m); j++) {\n     if (V[j].size() > 1)\n       good = 0;\n     else if (V[j].size())\n       --cnt;\n   }\n   if (good) {\n     int ans = 1;\n     for (int i = 0; i < (cnt); i++) {\n       ans += ans;\n       ans %= 1000003;\n     }\n     cout << ans << endl;\n   } else\n     cout << 0 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n;\n   cin >> n;\n   cin.ignore();\n   while (n--) {\n     string str1, str2;\n     getline(cin, str1);\n     getline(cin, str2);\n     bool test = true;\n     long long j = 0, i = 0;\n     char last_ch = str1[0];\n     while (j < str2.size() && i < str1.size()) {\n       if (str2[j] == str1[i])\n         last_ch = str1[i], i++, j++;\n       else if (str2[j] == last_ch) {\n         while (str2[j] == last_ch) j++;\n       } else {\n         test = false;\n         break;\n       }\n     }\n     while (j < str2.size()) {\n       if (str2[j] != last_ch) {\n         test = false;\n         break;\n       }\n       j++;\n     }\n     if (!test) {\n       cout << 'NO' << endl;\n       continue;\n     }\n     if (i < str1.size()) {\n       cout << 'NO' << endl;\n       continue;\n     }\n     cout << 'YES' << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int II() {\n   int q;\n   scanf('%d', &q);\n   return q;\n }\n void solve() {\n   long long N, M;\n   cin >> N >> M;\n   long long ar[N + 10], br[N + 10], cr[N + 10];\n   for (long long i = 1; i <= N; i++) {\n     cin >> ar[i] >> br[i] >> cr[i];\n   }\n   long long mi = M, mx = M;\n   ar[0] = 0;\n   for (long long i = 1; i <= N; i++) {\n     long long q = ar[i] - ar[i - 1];\n     mi = max(mi - q, br[i]);\n     mx = min(mx + q, cr[i]);\n     if (mi > cr[i] or mx < br[i]) {\n       cout << 'NO' << endl;\n       return;\n     }\n   }\n   cout << 'YES' << endl;\n }\n int32_t main() {\n   long long tt;\n   cin >> tt;\n   long long cas = 1;\n   while (tt--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void winter_is_coming() {\n   std::ios_base::sync_with_stdio(0);\n   cin.tie(NULL);\n   cout.tie(NULL);\n }\n int main() {\n   void winter_is_coming();\n   long long a, b, dis, dis2, ans = 0;\n   cin >> a >> b;\n   dis = abs(a - b);\n   dis2 = dis / 2;\n   dis = dis - dis2;\n   ans = (dis * (dis + 1) / 2) + (dis2 * (dis2 + 1) / 2);\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, fa[100010], siz[100010];\n double ans;\n int getfa(int w) { return (w == fa[w]) ? w : fa[w] = getfa(fa[w]); }\n struct edg {\n   int nx, ny, val;\n   bool operator<(const edg& e) const { return val > e.val; }\n } a[100010];\n int main() {\n   cin >> n >> m;\n   int b[100010];\n   long long tot = 0;\n   for (int i = 1; i <= n; i++) cin >> b[i];\n   for (int i = 0; i < m; i++) {\n     int x, y;\n     cin >> x >> y;\n     a[i] = (edg){x, y, min(b[x], b[y])};\n   }\n   sort(a, a + m);\n   for (int i = 1; i <= n; i++) fa[i] = i;\n   for (int i = 1; i <= n; i++) siz[i] = 1;\n   for (int i = 0; i < m; i++)\n     if (getfa(a[i].nx) ^ getfa(a[i].ny)) {\n       int x = a[i].nx, y = a[i].ny;\n       tot += (long long)a[i].val * siz[fa[x]] * siz[fa[y]];\n       siz[fa[x]] += siz[fa[y]];\n       fa[fa[y]] = fa[x];\n     }\n   ans = tot;\n   tot = (long long)n * (n - 1) / 2;\n   ans /= tot;\n   printf('%.06lf', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, G[1005][1005], ans = 1000000000;\n char str[1005][1005];\n bool vis[1005][1005];\n int dfs(int x, int y, int wx, int wy) {\n   vis[x][y] = true;\n   if ((G[x + wx - 1][y + wy] - G[x - 1][y + wy] - G[x + wx - 1][y + 1 - 1] +\n        G[x - 1][y + 1 - 1]) == wx * wy)\n     return wx + dfs(x, y + 1, wx, wy);\n   if ((G[x + wx][y + wy - 1] - G[x + 1 - 1][y + wy - 1] - G[x + wx][y - 1] +\n        G[x + 1 - 1][y - 1]) == wx * wy)\n     return wy + dfs(x + 1, y, wx, wy);\n   return 0;\n }\n int main() {\n   memset(vis, false, sizeof(vis));\n   scanf('%d%d\n', &n, &m);\n   int flag = 0, px, py;\n   for (int i = 1; i <= n; i++) scanf('%s', str[i] + 1);\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) {\n       if (str[i][j] == 'X') {\n         if (!flag) {\n           flag = 1;\n           px = i;\n           py = j;\n         }\n         G[i][j] = G[i - 1][j] + G[i][j - 1] - G[i - 1][j - 1] + 1;\n       } else\n         G[i][j] = G[i - 1][j] + G[i][j - 1] - G[i - 1][j - 1];\n     }\n   int tmp, wx, wy;\n   for (tmp = px; str[tmp][py] == 'X'; tmp++)\n     ;\n   wx = tmp - px;\n   for (int i = py; str[px][i] == 'X'; i++)\n     if (dfs(px, py, wx, i - py + 1) + wx * (i - py + 1) == G[n][m])\n       ans = min(ans, wx * (i - py + 1));\n   for (tmp = py; str[px][tmp] == 'X'; tmp++)\n     ;\n   wy = tmp - py;\n   for (int i = px; str[i][py] == 'X'; i++)\n     if (dfs(px, py, i - px + 1, wy) + (i - px + 1) * wy == G[n][m])\n       ans = min(ans, (i - px + 1) * wy);\n   if (ans <= n * m)\n     printf('%d\n', ans);\n   else\n     printf('-1\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   unsigned long long n;\n   unsigned long long a[100050];\n   unsigned long long b[200050];\n   scanf('%lld', &n);\n   for (int i = 0; i < n / 2; i++) scanf('%lld', &a[i]);\n   b[0] = 0;\n   b[n - 1] = a[0];\n   for (int i = 1; i < n / 2; i++) {\n     b[n - 1 - i] = min(b[n - i], a[i] - b[i - 1]);\n     b[i] = a[i] - b[n - 1 - i];\n   }\n   for (int i = 0; i < n; i++) printf('%lld ', b[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int arr[100] = {0}, con = 0, d = 0;\n   ;\n   string x;\n   cin >> x;\n   for (int i = 0; i < x.size(); i++) {\n     if (x[i] == '+') {\n       for (int j = 0; j < con; j++) {\n         arr[d] += (x[i - j - 1] - 48) * pow(10, j);\n       }\n       d++;\n       con = 0;\n     } else\n       con++;\n   }\n   for (int j = 0; j < con; j++) {\n     arr[d] += (x[x.size() - j - 1] - 48) * pow(10, j);\n   }\n   sort(arr, arr + d + 1);\n   for (int j = 0; j <= d; j++) {\n     if (j == d)\n       cout << arr[j];\n     else\n       cout << arr[j] << '+';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   long long t;\n   cin >> t;\n   while (t--) {\n     vector<vector<long long> > a(2);\n     vector<long long> ans;\n     long long n;\n     string b;\n     cin >> n >> b;\n     long long cou = 1;\n     for (char c : b) {\n       long long x = c - '0';\n       if (a[x].size() == 0) a[x].push_back(cou++);\n       ans.push_back(a[x].back());\n       a[!x].push_back(a[x].back());\n       a[x].pop_back();\n     }\n     cout << cou - 1 << '\n';\n     for (long long i : ans) cout << i << ' ';\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int comp(long long a, long long b) { return a > b; }\n long long arr[100000], cdf[100000];\n int main() {\n   int i, m;\n   long long k, n;\n   cin >> n;\n   cin >> arr[0];\n   for (i = 1; i < n; i++) {\n     cin >> arr[i];\n   }\n   sort(arr, arr + n, comp);\n   cdf[0] = arr[0];\n   for (i = 1; i < n; i++) {\n     cdf[i] = arr[i] + cdf[i - 1];\n   }\n   cin >> m;\n   long long rrr = 0;\n   for (i = 1; i < n; i++) {\n     rrr += arr[i] * i;\n   }\n   int ll;\n   for (ll = 0; ll < m; ll++) {\n     cin >> k;\n     long long sum = 0LL;\n     if (k == 1)\n       cout << rrr << ' ';\n     else {\n       int mm;\n       long long as, t = 1;\n       for (as = 1, mm = 1; as < n; as = as + t, mm++) {\n         t *= k;\n         sum += (cdf[min(as + t - 1, n - 1)] - cdf[as - 1]) * mm;\n       }\n       cout << sum << ' ';\n     }\n   }\n   cout << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n namespace red {\n inline long long read() {\n   long long x = 0;\n   char ch, f = 1;\n   for (ch = getchar(); (ch < '0' || ch > '9') && ch != '-'; ch = getchar())\n     ;\n   if (ch == '-') f = 0, ch = getchar();\n   while (ch >= '0' && ch <= '9') {\n     x = (x << 1) + (x << 3) + ch - '0';\n     ch = getchar();\n   }\n   return f ? x : -x;\n }\n const long long N = 1e6 + 10, inf = 1e9 + 7, base = 131, mod = 1e9 + 7;\n long long n, m, t, ret;\n char a[N], b[N], s[N];\n long long nxt[N], f[N], g[N];\n long long pw[N], ha[N], hs[N];\n inline void prepare(char *a, long long *f) {\n   long long len = max(n, m);\n   for (long long i = pw[0] = 1; i <= len; ++i) pw[i] = pw[i - 1] * base % mod;\n   for (long long i = 1; i <= n; ++i) ha[i] = (ha[i - 1] * base + a[i]) % mod;\n   for (long long i = 1; i <= m; ++i) hs[i] = (hs[i - 1] * base + s[i]) % mod;\n   for (long long i = 1; i <= n; ++i) {\n     long long l = i, r = n;\n     while (l <= r) {\n       long long t1 = (ha[((l + r) >> 1)] -\n                       ha[i - 1] * pw[((l + r) >> 1) - i + 1] % mod + mod) %\n                      mod;\n       long long t2 = hs[((l + r) >> 1) - i + 1];\n       if (t1 == t2)\n         f[i] = ((l + r) >> 1) - i + 1, l = ((l + r) >> 1) + 1;\n       else\n         r = ((l + r) >> 1) - 1;\n     }\n     f[i] = min(f[i], m - 1);\n   }\n }\n struct BIT {\n   long long tr[N];\n   BIT() { memset(tr, 0, sizeof(tr)); }\n   inline void update(long long p, long long k) {\n     for (p++; p < N; p += p & (-p)) tr[p] += k;\n   }\n   inline long long query(long long p) {\n     long long ret = 0;\n     for (p++; p; p -= p & (-p)) ret += tr[p];\n     return ret;\n   }\n } bit[2];\n inline void main() {\n   n = read(), m = read();\n   scanf('%s%s%s', a + 1, b + 1, s + 1);\n   prepare(a, f);\n   reverse(s + 1, s + m + 1);\n   reverse(b + 1, b + n + 1);\n   prepare(b, g);\n   reverse(g + 1, g + n + 1);\n   for (long long i = n; i; --i) {\n     bit[0].update(g[i], 1);\n     bit[1].update(g[i], g[i]);\n     if (i + m - 1 <= n) {\n       bit[0].update(g[i + m - 1], -1);\n       bit[1].update(g[i + m - 1], -g[i + m - 1]);\n     }\n     if (!f[i]) continue;\n     long long v = m - f[i];\n     ret += bit[1].query(m) - bit[1].query(v - 1);\n     ret -= (bit[0].query(m) - bit[0].query(v - 1)) * (v - 1);\n   }\n   printf('%lld\n', ret);\n }\n }  // namespace red\n signed main() {\n   red::main();\n   return 0;\n }\n "}
+{"func_code_string": "#include <algorithm>\n #include <cassert>\n #include <iostream>\n #include <queue>\n #include <vector>\n using namespace std;\n \n typedef long long ll;\n typedef pair<int, int> Pii;\n typedef vector<Pii> VPii;\n typedef vector<int> Vi;\n typedef vector<Vi> VVi;\n typedef vector<ll> Vll;\n typedef vector<Vll> VVll;\n \n const ll INF = 1000000000000000000LL;\n \n Vi toposort(const VVi& g) {\n     int n = g.size();\n     Vi deg(n);\n     for (auto& others : g) {\n         for (int other : others) {\n             ++deg[other];\n         }\n     }\n \n     queue<int> q;\n     for (int i = 0; i < n; ++i) {\n         if (deg[i] == 0) {\n             q.push(i);\n         }\n     }\n \n     Vi result;\n     while (!q.empty()) {\n         int x = q.front();\n         q.pop();\n \n         result.push_back(x);\n \n         for (int other : g[x]) {\n             if (--deg[other] == 0) {\n                 q.push(other);\n             }\n         }\n     }\n     return result;\n }\n \n Vi findPath(int start, const VVi& rg, Vi& target, const VVi& ban) {\n     int n = rg.size();\n     VVi prev(2, Vi(n, -1));\n     prev[0][start] = start;\n \n     queue<Pii> q;\n     q.push(make_pair(0, start));\n \n     int finish = -1;\n \n     while (!q.empty()) {\n         int d = q.front().first;\n         int x = q.front().second;\n         q.pop();\n \n         if (d == 0) {\n             if (ban[0][x] == 1) {\n                 continue;\n             }\n             for (int y : rg[x]) {\n                 if (ban[1][y] == 1) {\n                     continue;\n                 }\n                 if (target[y] != x && prev[1][y] == -1) {\n                     prev[1][y] = x;\n                     q.push(make_pair(1, y));\n                 }\n             }\n         } else {\n             int y = target[x];\n             if (y == -1) {\n                 finish = x;\n                 break;\n             }\n \n             if (prev[0][y] == -1) {\n                 prev[0][y] = x;\n                 q.push(make_pair(0, y));\n             }\n         }\n     }\n     \n     if (finish == -1) {\n         return Vi();\n     }\n \n     Vi path;\n     for (int d = 1, x = finish; x != start; x = prev[d][x], d = 1 - d) {\n         path.push_back(x);\n     }\n     path.push_back(start);\n     reverse(path.begin(), path.end());\n     return path;\n }\n \n int minSeeds(const VVi& g, const VVi& rg, const VVi& ban) {\n     int n = g.size();\n     int seeds = 0;\n     Vi target(n, -1);\n     Vi order = toposort(g);\n     for (int x : order) {\n         auto path = findPath(x, rg, target, ban);\n         if (path.empty()) {\n             ++seeds;\n         }\n         assert(path.size() % 2 == 0);\n         for (int i = 0; i + 1 < path.size(); i += 2) {\n             int a = path[i];\n             int b = path[i + 1];\n             target[b] = a;\n         }\n     }\n     return seeds;\n }\n \n Pii nextBan(int currentSeeds, const VVi& g, const VVi& rg, VVi ban) {\n     int n = g.size();\n     for (int d = 0; d < 2; ++d) {\n         for (int x = 0; x < n; ++x) {\n             if (ban[d][x] == 1) {\n                 continue;\n             }\n             ban[d][x] = 1;\n             int t = minSeeds(g, rg, ban);\n             if (t == currentSeeds + 1) {\n                 return make_pair(d, x);\n             }\n             ban[d][x] = 0;\n         }\n     }\n     assert(false);\n }\n \n VPii optimalSequence(const VVi& g, const VVi& rg) {\n     int n = g.size();\n     VVi ban(2, Vi(n, 0));\n \n     int m = minSeeds(g, rg, ban);\n     VPii result;\n     \n     for (int i = 0; i < n - m; ++i) {\n         auto t = nextBan(m + i, g, rg, ban);\n         result.push_back(t);\n         ban[t.first][t.second] = 1;\n     }\n \n     return result;\n }\n \n Vi optimalPattern(int initial, int n, VPii& cost) {\n     int k = cost.size();\n     VVll dp(k + 1, Vll(n + 1));\n     VVi next(k + 1, Vi(n + 1));\n     for (int r = k - 1; r >= 0; --r) {\n         for (int s = initial; s <= n; ++s) {\n             ll bestScore = 0;\n             int bestT = -1;\n             for (int t = max(s, r + 2); t <= n; ++t) {\n                 int c = t - s;\n                 ll score = max(0LL, cost[r].first - ll(c) * cost[r].second) + dp[r + 1][t];\n                 if (bestT == -1 || score > bestScore) {\n                     bestT = t;\n                     bestScore = score;\n                 }\n             }\n             dp[r][s] = bestScore;\n             next[r][s] = bestT;\n         }\n     }\n \n     Vi pattern;\n     for (int r = 0, s = initial; r < k; s = next[r][s], ++r) {\n         pattern.push_back(next[r][s] - s);\n     }\n     return pattern;\n }\n \n int main() {\n     int n, m, k;\n     cin >> n >> m >> k;\n \n     VVi g(n), rg(n);\n     for (int i = 0; i < m; ++i) {\n         int x, y;\n         cin >> x >> y;\n         --x; --y;\n         g[x].push_back(y);\n         rg[y].push_back(x);\n     }\n \n     VPii cost(k);\n     for (int i = 0; i < k; ++i) {\n         cin >> cost[i].first >> cost[i].second;\n     }\n \n     auto seq = optimalSequence(g, rg);\n     int initial = n - seq.size();\n \n     auto patt = optimalPattern(initial, n, cost);\n \n     Vi solution;\n     int used = 0;\n     for (int p : patt) {\n         for (int i = 0; i < p; ++i) {\n             auto s = seq[used++];\n             int sign = s.first == 0 ? -1 : 1;\n             solution.push_back(sign * (s.second + 1));\n         }\n         solution.push_back(0);\n     }\n \n     cout << solution.size() << endl;\n     for (int i = 0; i < solution.size(); ++i) {\n         if (i != 0) {\n             cout << ' ';\n         }\n         cout << solution[i];\n     }\n     cout << endl;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n template <typename T>\n inline void SWAP(T &a, T &b) {\n   T tmp = a;\n   a = b;\n   b = tmp;\n }\n template <typename T>\n inline T ABS(const T &val) {\n   return val < 0 ? -val : val;\n }\n template <typename T>\n inline T MAX(const T &a, const T &b) {\n   return a > b ? a : b;\n }\n template <typename T>\n inline T MIN(const T &a, const T &b) {\n   return a < b ? a : b;\n }\n template <typename T>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int, int> 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 <bits/stdc++.h>\n using namespace std;\n template <typename T1, typename T2>\n inline void chkmin(T1 &x, T2 y) {\n   if (x > y) x = y;\n }\n template <typename T1, typename T2>\n inline void chkmax(T1 &x, T2 y) {\n   if (x < y) x = y;\n }\n inline int readChar();\n template <class T = int>\n inline T readInt();\n template <class T>\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 <class T>\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 <class T>\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 <bits/stdc++.h>\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<int> 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<int> 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 <bits/stdc++.h>\n using namespace std;\n FILE *in;\n FILE *out;\n int n, m, k;\n char a[64][64];\n int blocks[64][64];\n int cell[64 * 64][2];\n int dyn[64 * 64][4][2];\n int dir[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};\n void fill(int row, int col, int color) {\n   blocks[row][col] = color;\n   for (int i = 0; i < 4; i++) {\n     int nrow = row + dir[i][0];\n     if (nrow < 0 || nrow >= n) continue;\n     int ncol = col + dir[i][1];\n     if (ncol < 0 || ncol >= m) continue;\n     if (a[row][col] == a[nrow][ncol] && blocks[nrow][ncol] == -1)\n       fill(nrow, ncol, color);\n   }\n }\n void getBlocks() {\n   int nextColor = 0;\n   memset(blocks, -1, sizeof(blocks));\n   for (int i = 0; i < n; i++) {\n     for (int c = 0; c < m; c++) {\n       if (a[i][c] != '0' && blocks[i][c] == -1) {\n         fill(i, c, nextColor);\n         cell[nextColor][0] = i;\n         cell[nextColor][1] = c;\n         nextColor++;\n       }\n     }\n   }\n }\n int main(void) {\n   in = stdin;\n   out = stdout;\n   fscanf(in, '%d %d', &n, &k);\n   for (int i = 0; i < n; i++) fscanf(in, '%s', a[i]);\n   m = (int)strlen(a[0]);\n   getBlocks();\n   memset(dyn, -1, sizeof(dyn));\n   int rem = k, cur = 0;\n   int bp = 0, dp = 1, cp = 0;\n   int foundCycle = 0;\n   while (rem) {\n     rem--;\n     cur++;\n     if (!foundCycle && dyn[bp][dp][cp] != -1) {\n       foundCycle = 1;\n       rem %= (cur - dyn[bp][dp][cp]);\n     }\n     dyn[bp][dp][cp] = cur;\n     int row = cell[bp][0], col = cell[bp][1];\n     while (1) {\n       int nrow = row + dir[dp][0];\n       if (nrow < 0 || nrow >= n) break;\n       int ncol = col + dir[dp][1];\n       if (ncol < 0 || ncol >= m) break;\n       if (a[nrow][ncol] != a[row][col]) break;\n       row = nrow;\n       col = ncol;\n     }\n     int dd = (cp ? ((dp + 1) % 4) : ((dp + 3) % 4));\n     while (1) {\n       int nrow = row + dir[dd][0];\n       if (nrow < 0 || nrow >= n) break;\n       int ncol = col + dir[dd][1];\n       if (ncol < 0 || ncol >= m) break;\n       if (a[nrow][ncol] != a[row][col]) break;\n       row = nrow;\n       col = ncol;\n     }\n     int nrow = row + dir[dp][0];\n     int ncol = col + dir[dp][1];\n     if (nrow >= 0 && nrow < n && ncol >= 0 && ncol < m &&\n         a[nrow][ncol] != '0') {\n       bp = blocks[nrow][ncol];\n       continue;\n     }\n     if (cp == 0)\n       cp = 1;\n     else {\n       cp = 0;\n       dp = (dp + 1) % 4;\n     }\n   }\n   fprintf(out, '%c\n', a[cell[bp][0]][cell[bp][1]]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 55, M = 105, T = 20005, K = 20;\n const double S = 1e5, inf = 1e9, PI = acos(-1);\n template <class T>\n void read(T &x) {\n   int sgn = 1;\n   char ch;\n   x = 0;\n   for (ch = getchar(); (ch < '0' || ch > '9') && ch != '-'; ch = getchar())\n     ;\n   if (ch == '-') ch = getchar(), sgn = -1;\n   for (; '0' <= ch && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';\n   x *= sgn;\n }\n template <class T>\n void write(T x) {\n   if (x < 0)\n     putchar('-'), write(-x);\n   else if (x < 10)\n     putchar(x + '0');\n   else\n     write(x / 10), putchar(x % 10 + '0');\n }\n int n, m, t;\n double c, cost[M], dist[N], f[N][T], val[M][T];\n complex<double> w[K][T << 3];\n struct node {\n   int id, to;\n   vector<double> vec;\n };\n vector<node> g[N];\n vector<int> h[N];\n queue<int> q;\n bool vis[N];\n void spfa() {\n   for (int i = 1; i <= n; i++) dist[i] = inf, vis[i] = false;\n   dist[n] = true, q.push(n), dist[n] = 0.0;\n   while (!q.empty()) {\n     int u = q.front();\n     for (int i = 0; i < g[u].size(); i++) {\n       int v = g[u][i].to;\n       if (dist[v] > dist[u] + cost[g[u][i].id]) {\n         dist[v] = dist[u] + cost[g[u][i].id];\n         if (!vis[v]) vis[v] = true, q.push(v);\n       }\n     }\n     q.pop(), vis[u] = false;\n   }\n }\n void init() {\n   for (int i = 1, j = 0; i <= (t + 2 << 3); i <<= 1, j++) {\n     for (int k = 0; k <= i; k++)\n       w[j][k] = complex<double>(cos(2.0 * k * PI / i), sin(2.0 * k * PI / i));\n   }\n }\n int bitrev[T << 3];\n void dft(complex<double> *x, int len, int ty) {\n   bitrev[0] = 0;\n   for (int i = 1; i < len; i++) {\n     bitrev[i] = bitrev[i >> 1] >> 1;\n     if (i & 1) bitrev[i] |= (len >> 1);\n   }\n   for (int i = 0; i < len; i++) {\n     if (bitrev[i] < i) swap(x[bitrev[i]], x[i]);\n   }\n   for (int i = 1, label = 1; i < len; i <<= 1, label++) {\n     for (int j = 0; j < len; j += (i << 1)) {\n       for (int k = 0; k < i; k++) {\n         complex<double> u = x[j + k], v = x[j + k + i];\n         complex<double> r = ty > 0 ? w[label][k] : w[label][(i << 1) - k];\n         x[j + k] = u + r * v, x[j + k + i] = u - r * v;\n       }\n     }\n   }\n   if (ty < 0) {\n     for (int i = 0; i < len; i++) x[i] /= len;\n   }\n }\n complex<double> tmp1[T << 3], tmp2[T << 3], tmp[T << 3];\n void solve(int l, int r) {\n   int mid = l + r >> 1;\n   if (l < r) {\n     solve(mid + 1, r);\n     int l1 = r - mid, l2 = r - l, len = 1;\n     while (len <= l1 + l2) len <<= 1;\n     for (int i = 1; i <= n; i++) {\n       if (r - l <= 1000) {\n         for (int j = 0; j < g[i].size(); j++) {\n           for (int k = l; k <= mid; k++) {\n             for (int T = mid + 1 - k; T <= r - k; T++)\n               val[g[i][j].id][k] += g[i][j].vec[T] * f[i][k + T];\n           }\n         }\n         continue;\n       }\n       for (int j = 0; j < len; j++) tmp1[j] = complex<double>(0.0, 0.0);\n       for (int j = 0; j < r - mid; j++)\n         tmp1[j] = complex<double>(f[i][mid + 1 + j], 0.0);\n       dft(tmp1, len, 1);\n       for (int j = 0; j < g[i].size(); j++) {\n         for (int k = 0; k < len; k++) tmp2[k] = complex<double>(0.0, 0.0);\n         for (int k = 0; k <= l2; k++)\n           tmp2[k] = complex<double>(g[i][j].vec[l2 - k], 0.0);\n         dft(tmp2, len, 1);\n         for (int k = 0; k < len; k++) tmp[k] = tmp1[k] * tmp2[k];\n         dft(tmp, len, -1);\n         for (int k = l; k <= mid; k++)\n           val[g[i][j].id][k] += tmp[k + l2 - mid - 1].real();\n       }\n     }\n     solve(l, mid);\n   } else {\n     for (int i = 1; i <= n; i++) {\n       for (int j = 0; j < h[i].size(); j++)\n         f[i][mid] = min(f[i][mid], val[h[i][j]][mid] + cost[h[i][j]]);\n     }\n   }\n }\n int main() {\n   read(n), read(m), read(t);\n   scanf('%lf', &c);\n   for (int i = 1; i <= m; i++) {\n     int u, v;\n     vector<double> vec(t + 1);\n     read(u), read(v);\n     scanf('%lf', &cost[i]);\n     for (int j = 1; j <= t; j++) {\n       int x;\n       read(x);\n       vec[j] = x / S;\n     }\n     node x = {i, u, vec};\n     g[v].push_back(x), h[u].push_back(i);\n   }\n   spfa();\n   for (int i = 1; i <= n; i++) f[i][t + 1] = dist[i] + c;\n   for (int i = 1; i <= n; i++) {\n     for (int j = 0; j <= t; j++) f[i][j] = (i == n) ? 0.0 : inf;\n   }\n   for (int i = 1; i <= m; i++) {\n     for (int j = 0; j <= t; j++) val[i][j] = 0.0;\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = 0; j < g[i].size(); j++) {\n       double x = 0.0;\n       for (int k = 0; k <= t; k++)\n         val[g[i][j].id][k] += x * f[i][t + 1], x += g[i][j].vec[t - k];\n     }\n   }\n   init();\n   solve(0, t);\n   printf('%lf\n', f[1][0]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n mt19937 prng(chrono::steady_clock::now().time_since_epoch().count());\n void testCase(int caseno) {\n   int n, k, a, b;\n   cin >> n >> k;\n   multiset<int> aa;\n   multiset<int> bb;\n   int sum = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> a;\n     sum += a;\n     aa.insert(a);\n   }\n   for (int i = 0; i < n; i++) {\n     cin >> b;\n     bb.insert(b);\n   }\n   for (int i : aa) {\n   }\n   for (int i : bb) {\n   }\n   int it = 0;\n   while (*(aa.begin()) < *(--bb.end()) && it < k) {\n     it++;\n     sum -= *(aa.begin());\n     sum += *(--bb.end());\n     aa.insert(*(--bb.end()));\n     bb.insert(*(aa.begin()));\n     auto ita = aa.begin();\n     auto itb = --bb.end();\n     aa.erase(ita);\n     bb.erase(itb);\n   }\n   cout << sum << endl;\n }\n int main() {\n   int t;\n   cin >> t;\n   for (int i = 0; i < t; i++) {\n     testCase(i + 1);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const double g = 9.8;\n using namespace std;\n const long long mod = 998244353;\n long long quick(long long prea, long long bbb) {\n   long long res = 1;\n   while (bbb) {\n     if (bbb & 1) res = res * prea % mod;\n     prea = prea * prea % mod;\n     bbb >>= 1;\n   }\n   return res;\n }\n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }\n pair<int, int> pp;\n const int w = 2e5 + 5;\n long long a[w];\n stack<long long> s;\n int main() {\n   long long k, m, n, t, i, j;\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> m;\n     if (s.empty())\n       s.push(m);\n     else {\n       if (abs(m - s.top()) % 2 == 0)\n         s.pop();\n       else\n         s.push(m);\n     }\n   }\n   if (s.size() > 1)\n     cout << 'NO' << endl;\n   else\n     cout << 'YES' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long int a, b, r;\n   cin >> a >> b >> r;\n   if (2 * r <= min(a, b))\n     cout << 'First';\n   else\n     cout << 'Second';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   int a[m];\n   for (int i = 0; i < m; i++) {\n     cin >> a[i];\n     if (a[i] > n - i) {\n       cout << -1 << endl;\n       return 0;\n     }\n   }\n   long long suf_sum[m + 1];\n   suf_sum[m] = 0;\n   for (int i = m - 1; i >= 0; i--) {\n     suf_sum[i] = suf_sum[i + 1] + a[i];\n   }\n   if (suf_sum[0] < n) {\n     cout << -1 << endl;\n     return 0;\n   }\n   for (int i = 0; i < m; i++) {\n     cout << max((long long)i + 1, n - suf_sum[i] + 1) << ' ';\n   }\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 5, mod = 998244353;\n int inv[N], fac[N];\n int ksm(int b, int n) {\n   int res = 1;\n   while (n) {\n     if (n & 1) res = 1ll * res * b % mod;\n     b = 1ll * b * b % mod;\n     n >>= 1;\n   }\n   return res;\n }\n void init(int n) {\n   fac[0] = 1;\n   for (int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % mod;\n   inv[n] = ksm(fac[n], mod - 2);\n   for (int i = n - 1; i >= 0; --i) inv[i] = 1ll * (i + 1) * inv[i + 1] % mod;\n }\n int C(int n, int m) {\n   if (n < m || n < 0 || m < 0) return 0;\n   return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;\n }\n int calc(int n, int m, int lim) {\n   if (n == 0) return 1;\n   if (n < 0) return 0;\n   int ans = 0;\n   for (int i = 0; i <= m; ++i) {\n     int tmp = 1ll * C(n - lim * i + m - 1, m - 1) * C(m, i) % mod;\n     if (i & 1)\n       ans = (ans + mod - tmp) % mod;\n     else\n       ans = (ans + tmp) % mod;\n   }\n   return ans;\n }\n signed main() {\n   int p, s, r, ans = 0;\n   cin >> p >> s >> r;\n   init(1e5);\n   for (int i = r; i <= s; ++i)\n     for (int j = 1; j <= p; ++j) {\n       if (i * j + (p - j) * (i - 1) < s) continue;\n       int tmp = 1ll * calc(s - j * i, p - j, i) * C(p - 1, j - 1) % mod;\n       ans = (ans + 1ll * tmp * ksm(j, mod - 2)) % mod;\n     }\n   cout << 1ll * ans * ksm(C(s - r + p - 1, p - 1), mod - 2) % mod;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n const int MOD = 1e9 + 7;\n int main() {\n   cin.tie(0)->sync_with_stdio(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     string s;\n     cin >> s;\n     vector<int> r;\n     for (string t : {'twone', 'one', 'two'}) {\n       for (size_t pos = 0; (pos = s.find(t, pos)) != string::npos;) {\n         s[pos + t.length() / 2] = '?';\n         r.push_back(pos + t.length() / 2);\n       }\n     }\n     cout << r.size() << endl;\n     for (auto rr : r) cout << rr + 1 << ' ';\n     cout << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int x[2001], y[2001];\n int p[2001], mn[2001];\n int k[2001], c[2001];\n bool used[2001][2001];\n unsigned long long dst[2001][2001];\n unsigned long long dist(int i, int j) {\n   return (unsigned long long)(k[i] + k[j]) *\n          (unsigned long long)(abs(x[i] - x[j]) + abs(y[i] - y[j]));\n }\n void init() {\n   for (int i = 0; i < n; i++) {\n     p[i] = i;\n     mn[i] = c[i];\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = i + 1; j < n; j++) {\n       dst[i][j] = dist(i, j);\n       dst[j][i] = dst[i][j];\n     }\n   }\n }\n struct vertex {\n   unsigned long long len;\n   int x, y;\n   vertex(){};\n   vertex(unsigned long long _len, int _x, int _y) {\n     len = _len;\n     x = _x;\n     y = _y;\n   }\n   bool operator<(vertex b) { return len < b.len; }\n };\n bool operator<(const vertex& a, const vertex& b) { return a.len < b.len; }\n multiset<vertex> s;\n int get_anc(int x) {\n   if (x == p[x]) return x;\n   return p[x] = get_anc(p[x]);\n }\n void unite(int x, int y) {\n   x = get_anc(x);\n   y = get_anc(y);\n   if (x == y) return;\n   if (x < y) swap(x, y);\n   p[x] = y;\n   mn[y] = min(mn[x], mn[y]);\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> x[i] >> y[i];\n   }\n   for (int i = 0; i < n; i++) cin >> c[i];\n   for (int i = 0; i < n; i++) cin >> k[i];\n   init();\n   for (int i = 0; i < n; i++) {\n     for (int j = i + 1; j < n; j++) {\n       s.insert(vertex(dst[i][j], i, j));\n     }\n   }\n   unsigned long long ans = 0;\n   int conn = 0;\n   while (!s.empty()) {\n     vertex cur = *s.begin();\n     s.erase(s.begin());\n     unsigned long long curlen = cur.len;\n     int curx = cur.x, cury = cur.y;\n     if (get_anc(curx) == get_anc(cury)) continue;\n     if (curlen + min(mn[get_anc(curx)], mn[get_anc(cury)]) >\n         mn[get_anc(curx)] + mn[get_anc(cury)])\n       continue;\n     unite(curx, cury);\n     ans += curlen;\n     used[curx][cury] = used[cury][curx] = 1;\n     conn++;\n   }\n   vector<int> way;\n   for (int i = 0; i < n; i++) {\n     int x = get_anc(i);\n     if (c[i] == mn[x]) {\n       ans += c[i];\n       mn[i] = -1;\n       way.push_back(i + 1);\n     }\n   }\n   cout << ans << endl;\n   cout << way.size() << endl;\n   for (int i = 0; i < way.size(); i++) cout << way[i] << ' ';\n   cout << endl;\n   cout << conn << endl;\n   for (int i = 0; i < n; i++) {\n     for (int j = i + 1; j < n; j++) {\n       if (used[i][j]) cout << i + 1 << ' ' << j + 1 << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<vector<int> > g;\n vector<char> u;\n vector<int> 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<vector<pair<int, pair<int, int> > > > g(\n       n, vector<pair<int, pair<int, int> > >());\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<pair<int, pair<int, int> > > s, t;\n       s = g[i];\n       t = g[j];\n       vector<int> 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 <bits/stdc++.h>\n using namespace std;\n bool sortinrev(const pair<long long, long long> &a,\n                const pair<long long, long long> &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<long long, long long> mp;\n   for (long long i = 0; i < n; i++) {\n     cin >> a[i];\n     mp[a[i]] = i;\n   }\n   long long p = 1;\n   long long end = n;\n   while (end != 0) {\n     long long k = mp[p];\n     for (long long i = k; i < end; i++) {\n       if (a[i] != p) {\n         cout << 'No'\n              << '\n';\n         return;\n       }\n       p++;\n     }\n     end = k;\n   }\n   cout << 'Yes'\n        << '\n';\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long t = 1;\n   cin >> t;\n   while (t--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<pair<int, int>> q;\n int n;\n void op(int i, int j) { q.push_back({i, j}); }\n void f(int l, int r) {\n   if (l >= r) return;\n   int len = (r - l + 1);\n   if (len % 2 == 0) {\n     int m = (l + r) / 2;\n     f(l, m);\n     f(m + 1, r);\n     for (int j = 0; j < len / 2; j++) op(l + j, l + len / 2 + j);\n   } else {\n     r--;\n     int m = (l + r) / 2;\n     f(l, m);\n     f(m + 1, r);\n     for (int j = 0; j < len / 2; j++) op(l + j, l + len / 2 + j);\n     r++;\n     for (int j = l; j < r; j++) op(j, r);\n   }\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n;\n   int k = log2(n);\n   k = (1 << k);\n   f(1, k);\n   f(n - k + 1, n);\n   cout << (int)q.size() << '\n';\n   for (auto &it : q) cout << it.first << ' ' << it.second << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n long long n, i, k, j, t, b;\n char a[2500];\n bool s;\n using namespace std;\n int main() {\n   k = 0;\n   cin >> n;\n   for (i = 1; i <= n; i++) {\n     cin >> a[i];\n     if (a[i] == 'H') k++;\n   }\n   b = n - k;\n   for (i = n + 1; i <= 2 * n; i++) a[i] = a[i - n];\n   for (i = 1; i <= 2 * n; i++)\n     if (i + k <= 2 * n) {\n       t = 0;\n       for (j = i; j < i + k; j++)\n         if (a[j] != 'H') t++;\n       if (t < b) b = t;\n     }\n   cout << b << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n;\n   cin >> n;\n   cout << ((n % 2) ? 'black' : 'white\n1 2\n') << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int i, n, m, ans, x, l, r, tot, a[1000005], b[1000005], last[1000005],\n     to[1000005], Next[1000005], q[1000005], y;\n inline void add(int x, int y) {\n   Next[++tot] = last[x];\n   last[x] = tot;\n   to[tot] = y;\n }\n inline bool check(int x) {\n   for (int i = 1; i <= n; i++) a[i] = b[i];\n   a[x]--;\n   int rr = r, ll = l;\n   q[++r] = x;\n   while (l < r) {\n     int k = q[++l];\n     for (int i = last[k]; i; i = Next[i]) {\n       a[to[i]]--;\n       if (!a[to[i]]) q[++r] = to[i];\n     }\n   }\n   if (r == n) return true;\n   r = rr, l = ll;\n   return false;\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (i = 1; i <= m; i++) scanf('%d%d', &x, &y), b[y]++, add(x, y);\n   for (i = 1; i <= n; i++)\n     if (b[i] == 0) q[++r] = i;\n   while (l < r) {\n     int k = q[++l];\n     for (int i = last[k]; i; i = Next[i]) {\n       b[to[i]]--;\n       if (!b[to[i]]) q[++r] = to[i];\n     }\n   }\n   if (r == n) return puts('YES'), 0;\n   for (i = 1; i <= n; i++) {\n     if (b[i] == 1) {\n       if (check(i)) return puts('YES'), 0;\n     }\n   }\n   puts('NO');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<long long> v, ext;\n long long f[20];\n bool vis[20];\n bool chck(long long j) {\n   while (j) {\n     if (j % 10 != 4 && j % 10 != 7) break;\n     j /= 10;\n   }\n   return j == 0;\n }\n int main() {\n   long long i, n, k, st, sum, j, pre, sz, ans;\n   f[0] = 1;\n   for (i = 1; i <= 13; i++) f[i] = f[i - 1] * i;\n   cin >> n >> k;\n   if (n <= 13 && k > f[n]) {\n     cout << -1 << endl;\n     return 0;\n   }\n   for (i = 1; f[i] < k; i++)\n     ;\n   st = n - i + 1;\n   sum = k;\n   for (j = 1; j <= i; j++) {\n     for (k = st; k <= n; k++) {\n       if (!vis[k - st]) {\n         if (sum - f[i - j] > 0) {\n           sum -= f[i - j];\n         } else {\n           ext.push_back(k);\n           vis[k - st] = 1;\n           break;\n         }\n       }\n     }\n   }\n   queue<long long> q;\n   q.push(4);\n   q.push(7);\n   v.push_back(4);\n   v.push_back(7);\n   while (!q.empty()) {\n     pre = q.front();\n     q.pop();\n     if (pre * 10 + 4 <= 5000000000LL) {\n       q.push(pre * 10 + 4);\n       q.push(pre * 10 + 7);\n       v.push_back(pre * 10 + 4);\n       v.push_back(pre * 10 + 7);\n     }\n   }\n   sz = v.size();\n   ans = 0;\n   for (i = 0; i < sz && v[i] < st; i++) ans++;\n   for (i = st; i <= n; i++) {\n     if (chck(i)) {\n       if (chck(ext[i - st])) ans++;\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n typedef struct val {\n   long int val, ind;\n } va;\n int cmp(const void *a, const void *b) {\n   va ka = *(va *)a;\n   va kb = *(va *)b;\n   if (ka.val > kb.val)\n     return -1;\n   else\n     return 1;\n }\n int a[2009][2009];\n int main() {\n   va v[2009], ba[2009];\n   long int n, m, t1, t2, i, j, ans = 0;\n   scanf('%ld %ld', &n, &m);\n   for (i = 0; i < n; i++) {\n     scanf('%ld', &v[i].val);\n     v[i].ind = i + 1;\n     ba[i] = v[i];\n   }\n   for (i = 0; i < m; i++) {\n     scanf('%ld %ld', &t1, &t2);\n     a[t1][t2] = 1;\n     a[t2][t1] = 1;\n   }\n   qsort(v, n, sizeof(va), cmp);\n   for (i = 0; i < n; i++)\n     for (j = 1; j <= n; j++)\n       if (a[v[i].ind][j]) {\n         a[v[i].ind][j] = 0;\n         a[j][v[i].ind] = 0;\n         ans += ba[j - 1].val;\n       }\n   printf('%ld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int A[1000];\n void quicksort(int l, int r) {\n   int b = l;\n   if (r - l < 1) {\n     return;\n   }\n   for (int i = l; i < r; ++i) {\n     if (A[i] < A[r]) {\n       swap(A[i], A[b]);\n       b = b + 1;\n     }\n   }\n   swap(A[r], A[b]);\n   quicksort(l, b - 1);\n   quicksort(b + 1, r);\n }\n int main() {\n   int r;\n   cin >> r;\n   for (int i = 0; i < r; ++i) {\n     cin >> A[i];\n   }\n   quicksort(0, r - 1);\n   if (r % 2 > 0) {\n     cout << A[(r / 2)];\n   } else {\n     cout << min(A[r / 2], A[r / 2 - 1]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int inp() {\n   char c = getchar();\n   while (c < '0' || c > '9') c = getchar();\n   int sum = 0;\n   while (c >= '0' && c <= '9') {\n     sum = sum * 10 + c - '0';\n     c = getchar();\n   }\n   return sum;\n }\n struct SEG_Tree {\n   struct SEG {\n     int l;\n     int r;\n     int min;\n     long long sum;\n     long long ans;\n     int lazy;\n     long long lazy2;\n   } t[5000010];\n   void push_up(int cur) {\n     t[cur].min = std::min(t[((cur) << 1)].min, t[((cur) << 1 | 1)].min);\n     t[cur].sum = 0;\n     if (t[cur].min == t[((cur) << 1)].min) t[cur].sum += t[((cur) << 1)].sum;\n     if (t[cur].min == t[((cur) << 1 | 1)].min)\n       t[cur].sum += t[((cur) << 1 | 1)].sum;\n   }\n   void push_down(int cur) {\n     t[((cur) << 1)].min += t[cur].lazy;\n     t[((cur) << 1 | 1)].min += t[cur].lazy;\n     t[((cur) << 1)].lazy += t[cur].lazy;\n     t[((cur) << 1 | 1)].lazy += t[cur].lazy;\n     t[cur].lazy = 0;\n     if (t[cur].min == t[((cur) << 1)].min) {\n       t[((cur) << 1)].ans += t[((cur) << 1)].sum * t[cur].lazy2;\n       t[((cur) << 1)].lazy2 += t[cur].lazy2;\n     }\n     if (t[cur].min == t[((cur) << 1 | 1)].min) {\n       t[((cur) << 1 | 1)].ans += t[((cur) << 1 | 1)].sum * t[cur].lazy2;\n       t[((cur) << 1 | 1)].lazy2 += t[cur].lazy2;\n     }\n     t[cur].lazy2 = 0;\n   }\n   void build(int cur, int l, int r) {\n     t[cur].l = l;\n     t[cur].r = r;\n     if (l == r) {\n       t[cur].min = l;\n       t[cur].sum = 1;\n       return;\n     }\n     int mid = (l + r) >> 1;\n     build(((cur) << 1), l, mid);\n     build(((cur) << 1 | 1), mid + 1, r);\n     push_up(cur);\n   }\n   void modify(int cur, int l, int r, int c) {\n     if (t[cur].l > r || t[cur].r < l) return;\n     if (t[cur].l >= l && t[cur].r <= r) {\n       t[cur].min += c;\n       t[cur].lazy += c;\n       return;\n     }\n     push_down(cur);\n     modify(((cur) << 1), l, r, c);\n     modify(((cur) << 1 | 1), l, r, c);\n     push_up(cur);\n   }\n   long long query(int cur, int l, int r) {\n     if (t[cur].l > r || t[cur].r < l) return 0;\n     if (t[cur].l >= l && t[cur].r <= r) return t[cur].ans;\n     push_down(cur);\n     return query(((cur) << 1), l, r) + query(((cur) << 1 | 1), l, r);\n   }\n } t;\n std::vector<std::pair<int, int> > vec[1200010];\n long long ans[1200010];\n int a[1200010], s1[1200010], s2[1200000];\n signed main() {\n   int n = inp();\n   for (int i = 1; i <= n; i++) a[i] = inp();\n   int q = inp();\n   for (int i = 1; i <= q; i++) {\n     int l = inp();\n     int r = inp();\n     vec[r].push_back(std::make_pair(l, i));\n   }\n   int top1 = 0, top2 = 0;\n   t.build(1, 1, n);\n   for (int i = 1; i <= n; i++) {\n     t.modify(1, 1, n, -1);\n     while (top1 && a[s1[top1]] > a[i]) {\n       t.modify(1, s1[top1 - 1] + 1, s1[top1], a[s1[top1]] - a[i]);\n       top1--;\n     }\n     s1[++top1] = i;\n     while (top2 && a[s2[top2]] < a[i]) {\n       t.modify(1, s2[top2 - 1] + 1, s2[top2], a[i] - a[s2[top2]]);\n       top2--;\n     }\n     s2[++top2] = i;\n     t.t[1].ans += t.t[1].sum;\n     t.t[1].lazy2++;\n     for (int j = 0; j < vec[i].size(); j++)\n       ans[vec[i][j].second] = t.query(1, vec[i][j].first, i);\n   }\n   for (int i = 1; i <= q; i++) printf('%lld\n', ans[i]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dp[105][200005];\n int main() {\n   int n, k;\n   cin >> n >> k;\n   int a[n + 1], b[n + 1];\n   for (int i = 1; i <= n; i++) cin >> a[i];\n   for (int i = 1; i <= n; i++) cin >> b[i];\n   int off = 1000 * n;\n   for (int i = 0; i < 105; i++)\n     for (int j = 0; j < 200005; j++) dp[i][j] = -INT_MAX;\n   dp[0][off] = 0;\n   for (int curr = 1; curr <= n; curr++) {\n     int bl = a[curr] - b[curr] * k;\n     for (int bal = off; bal >= -off; bal--) {\n       dp[curr][bal + off] =\n           max(dp[curr - 1][bal + off], dp[curr - 1][bal - bl + off] + a[curr]);\n     }\n   }\n   cout << (dp[n][off] ? dp[n][off] : -1) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename A>\n string to_string(A* ptr) {\n   stringstream ss;\n   ss << '0x' << std::setw(16) << std::setfill('0') << std::hex\n      << (uint64_t)(uintptr_t)ptr;\n   return ss.str();\n }\n string to_string(char c) { return ((string) ''' + c) + '''; }\n template <typename A, typename B>\n string to_string(pair<A, B> p);\n template <typename A, typename B, typename C>\n string to_string(tuple<A, B, C> p);\n template <typename A, typename B, typename C, typename D>\n string to_string(tuple<A, B, C, D> p);\n string to_string(const string& s) { return ''' + s + '''; }\n string to_string(const char* s) { return to_string((string)s); }\n string to_string(bool b) { return (b ? 'true' : 'false'); }\n string to_string(vector<bool> v) {\n   bool first = true;\n   string res = '{';\n   for (int i = 0; i < static_cast<int>(v.size()); i++) {\n     if (!first) {\n       res += ', ';\n     }\n     first = false;\n     res += to_string(v[i]);\n   }\n   res += '}';\n   return res;\n }\n template <size_t N>\n string to_string(bitset<N> v) {\n   string res = '';\n   for (size_t i = 0; i < N; i++) {\n     res += static_cast<char>('0' + v[i]);\n   }\n   return res;\n }\n template <typename A>\n string to_string(A v) {\n   bool first = true;\n   string res = '{';\n   for (const auto& x : v) {\n     if (!first) {\n       res += ', ';\n     }\n     first = false;\n     res += to_string(x);\n   }\n   res += '}';\n   return res;\n }\n template <typename A, typename B>\n string to_string(pair<A, B> p) {\n   return '(' + to_string(p.first) + ', ' + to_string(p.second) + ')';\n }\n template <typename A, typename B, typename C>\n string to_string(tuple<A, B, C> p) {\n   return '(' + to_string(get<0>(p)) + ', ' + to_string(get<1>(p)) + ', ' +\n          to_string(get<2>(p)) + ')';\n }\n template <typename A, typename B, typename C, typename D>\n string to_string(tuple<A, B, C, D> p) {\n   return '(' + to_string(get<0>(p)) + ', ' + to_string(get<1>(p)) + ', ' +\n          to_string(get<2>(p)) + ', ' + to_string(get<3>(p)) + ')';\n }\n void debug_out() { cerr << endl; }\n template <typename Head, typename... Tail>\n void debug_out(Head H, Tail... T) {\n   cerr << ' ' << to_string(H);\n   debug_out(T...);\n }\n int n, k, m;\n void add(int& A, int B) {\n   A += B;\n   if (A >= m) A -= m;\n }\n const int MAXN = 1009;\n const int MAXK = 109;\n int dp[MAXN][MAXK][2][2];\n long long solve() {\n   add(dp[0][0][0][0], 1);\n   for (int cnt_digits = 0, pow10 = 1; cnt_digits < n;\n        cnt_digits++, pow10 = (10 * pow10) % k) {\n     for (int rem_x = 0; rem_x < k; rem_x++) {\n       for (int had_nonzero_y = 0; had_nonzero_y <= 1; had_nonzero_y++) {\n         for (int x_is_nonzero = 0; x_is_nonzero <= 1; x_is_nonzero++) {\n           if (dp[cnt_digits][rem_x][had_nonzero_y][x_is_nonzero] == 0) continue;\n           for (int lead_digit = 0; lead_digit <= 9; lead_digit++) {\n             int new_rem_x = (pow10 * lead_digit + rem_x) % k;\n             int new_x_is_nonzero = x_is_nonzero || (lead_digit != 0);\n             int new_had_nonzero_y =\n                 had_nonzero_y || (new_rem_x == 0 && new_x_is_nonzero);\n             42;\n             42;\n             add(dp[cnt_digits + 1][new_rem_x][new_had_nonzero_y]\n                   [new_x_is_nonzero],\n                 dp[cnt_digits][rem_x][had_nonzero_y][x_is_nonzero]);\n           }\n           42;\n           42;\n         }\n       }\n     }\n   }\n   int result = 0;\n   int result_sub = 0;\n   for (int rem_x = 0; rem_x < k; rem_x++) {\n     add(result, dp[n][rem_x][1][1]);\n     add(result_sub, dp[n - 1][rem_x][1][1]);\n   }\n   int answer = (result - result_sub + m) % m;\n   return answer;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   int TT;\n   TT = 1;\n   for (int ttt = 0; ttt < TT; ttt++) {\n     cin >> n >> k >> m;\n     cout << solve() << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s, t, x;\n vector<int> lcp;\n vector<bool> match;\n constexpr int mxn = int(2e5) + 10;\n int dp[mxn][3];\n int pref[mxn];\n const int mod = 1e9 + 7;\n int ans(int start) {\n   if (dp[start][2] != -1) return dp[start][2];\n   if (start >= x.size()) return dp[start][0] = dp[start][1] = dp[start][2] = 0;\n   if (match[start]) {\n     dp[start][0] = dp[start][1] = 0;\n     int st = start + t.size() - 1;\n     int end = x.size() - 1;\n     int cnt = end - st + 1;\n     ans(st + 1);\n     dp[start][0] += cnt;\n     dp[start][0] %= mod;\n     dp[start][0] += pref[st + 1];\n     dp[start][0] %= mod;\n     dp[start][1] += ans(start + 1);\n     dp[start][1] %= mod;\n     dp[start][2] = (dp[start][0] + dp[start][1]) % mod;\n     pref[start] = pref[start + 1] + dp[start][2];\n     pref[start] %= mod;\n     return dp[start][2];\n   }\n   int curr = start;\n   while (curr < x.size() and not match[curr]) {\n     curr++;\n   }\n   ans(curr);\n   for (int i = curr - 1; i >= start; i--) {\n     dp[i][0] = dp[curr][0];\n     dp[i][1] = dp[i + 1][2];\n     dp[i][2] = dp[i][0] + dp[i][1];\n     dp[i][2] %= mod;\n     pref[i] = pref[i + 1] + dp[i][2];\n     pref[i] %= mod;\n   }\n   return dp[start][2];\n }\n void solve() {\n   cin >> s >> t;\n   x = t + '#' + s;\n   lcp = vector<int>(x.size());\n   match = vector<bool>(x.size());\n   lcp[0] = 0;\n   for (int i = 1; i < x.size(); i++) {\n     int j = lcp[i - 1];\n     while (j > 0 and x[j] != x[i]) j = lcp[j - 1];\n     if (x[j] == x[i]) j++;\n     lcp[i] = j;\n     if (lcp[i] == t.size()) {\n       match[i - t.size() + 1] = true;\n     }\n   }\n   cout << ans(t.size() + 1);\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   memset(dp, -1, sizeof(dp));\n   memset(pref, 0, sizeof(pref));\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int fun(long long int x, long long int y, long long int p) {\n   long long int s = x / p;\n   if (x % p) s++;\n   long long int e = y / p;\n   return e - s + 1;\n }\n void solve() {\n   long long int n, p;\n   cin >> n >> p;\n   vector<pair<long long int, long long int> > A(n);\n   for (int i = 0; i < n; i++) cin >> A[i].first >> A[i].second;\n   double ans = 0;\n   for (int i = 0; i < n; i++) {\n     long long int f = i, s = (i + 1 + n) % n;\n     long long int s1 = A[f].second - A[f].first + 1,\n                   s2 = A[s].second - A[s].first + 1;\n     long long int a = fun(A[f].first, A[f].second, p);\n     long long int b = fun(A[s].first, A[s].second, p);\n     double up = (s1 - a) * 1.0 * (s2 - b);\n     double d = s1 * 1.0 * s2 * 1.0;\n     up = (up * 1.0) / (d * 1.0);\n     double pro = 1.0 - 1.0 * up;\n     ans = ans * 1.0 + pro * 2000.0;\n   }\n   printf('%f\n', ans);\n }\n int main() {\n   long long int t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, q, sm, mx, x, y, ans;\n char a[509][509];\n int rr[509];\n int main() {\n   scanf('%d%d%d', &n, &m, &q);\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) scanf(' %c', &a[i][j]);\n   for (int i = 1; i <= n; i++) {\n     sm = 0, mx = 0;\n     for (int j = 1; j <= m; j++) {\n       if (a[i][j] == '1')\n         sm++;\n       else\n         mx = max(mx, sm), sm = 0;\n     }\n     mx = max(mx, sm);\n     rr[i] = mx;\n   }\n   for (int i = 1; i <= q; i++) {\n     scanf('%d%d', &x, &y), sm = 0, ans = 0, mx = 0;\n     a[x][y] = char(('1' - a[x][y]) + '0');\n     for (int j = 1; j <= m; j++) {\n       if (a[x][j] == '1')\n         sm++;\n       else\n         mx = max(mx, sm), sm = 0;\n     }\n     mx = max(mx, sm);\n     rr[x] = mx;\n     for (int j = 1; j <= n; j++) ans = max(ans, rr[j]);\n     printf('%d\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long long INF = 1000 * 1000 * 1000 + 47;\n const long long LINF = INF * (long long)INF;\n using namespace std;\n const int mod = 1000 * 1000 * 1000 + 9;\n const int MAX = 100005;\n pair<int, int> pts[MAX];\n int n, k;\n struct node {\n   int x, y, l, r;\n   int dp0, dp1;\n   node() { l = r = -1; }\n   node(pair<int, int> pt) {\n     l = r = -1;\n     x = pt.first, y = pt.second;\n     dp1 = 1;\n     dp0 = 0;\n   }\n };\n node treap[MAX];\n int getDp0(int u) {\n   if (u == -1) return 0;\n   return treap[u].dp0;\n }\n int getDp1(int u) {\n   if (u == -1) return 0;\n   return treap[u].dp1;\n }\n void upd(int root) {\n   if (root == -1) return;\n   treap[root].dp1 = 1 + getDp0(treap[root].l) + getDp0(treap[root].r);\n   treap[root].dp0 = max(treap[root].dp1 - 1,\n                         max(getDp0(treap[root].l) + getDp1(treap[root].r),\n                             getDp1(treap[root].l) + getDp0(treap[root].r)));\n }\n int merge(int l, int r) {\n   if (l == -1) return r;\n   if (r == -1) return l;\n   int root;\n   if (treap[l].y > treap[r].y) {\n     root = l;\n     treap[l].r = merge(treap[l].r, r);\n   } else {\n     root = r;\n     treap[r].l = merge(l, treap[r].l);\n   }\n   upd(root);\n   return root;\n }\n pair<int, int> split(int root, int x) {\n   if (root == -1) return {-1, -1};\n   pair<int, int> res;\n   if (treap[root].x <= x) {\n     res = split(treap[root].r, x);\n     treap[root].r = res.first;\n     res = {root, res.second};\n   } else {\n     res = split(treap[root].l, x);\n     treap[root].l = res.second;\n     res = {res.first, root};\n   }\n   upd(res.first);\n   upd(res.second);\n   return res;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   int root = -1;\n   cin >> n >> k;\n   for (int i = 0; i < k; i++) {\n     cin >> pts[i].first >> pts[i].second;\n   }\n   int a, b, c, d;\n   cin >> a >> b >> c >> d;\n   for (int i = k; i < n; i++) {\n     pts[i].first = ((a * (long long)pts[i - 1].first) + b) % mod;\n     pts[i].second = ((c * (long long)pts[i - 1].second) + d) % mod;\n   }\n   sort(pts, pts + n);\n   for (int i = 0; i < n; i++) {\n     treap[i] = node(pts[i]);\n     root = merge(root, i);\n   }\n   int q;\n   cin >> q;\n   while (q--) {\n     int l, r;\n     cin >> l >> r;\n     auto roots = split(root, l - 1);\n     auto roots2 = split(roots.second, r);\n     cout << ((roots2.first == -1) ? 0 : treap[roots2.first].dp0) << endl;\n     root = merge(roots.first, merge(roots2.first, roots2.second));\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 100000 + 10;\n int main() {\n   long long n;\n   cin >> n;\n   if (n % 2 == 0) {\n     cout << 1ll * n / 2;\n     return 0;\n   }\n   bool flag = true;\n   for (int i = 3; i <= sqrt(n); i += 2) {\n     if (n % i == 0) {\n       cout << 1ll * (n - i) / 2 + 1;\n       return 0;\n     }\n   }\n   cout << '1';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 2005, maxm = 4000005;\n const double pi = 3.141592653589793;\n const int dx[] = {-1, -1, -1, 0, 1, 1, 1, 0};\n const int dy[] = {-1, 0, 1, 1, 1, 0, -1, -1};\n int s[maxn][maxn], v[maxn][maxn], f[maxn][maxn];\n int qx[maxm], qy[maxm];\n int n, cir, rec;\n double dis(double x, double y) { return sqrt(x * x + y * y); }\n int main() {\n   int i, j, k, a, b, x, y, h, t, tx, ty;\n   double sumx, sumy, maxd, mind;\n   scanf('%d', &n);\n   for (i = 1; i <= n; ++i)\n     for (j = 1; j <= n; ++j) {\n       scanf('%d', &x);\n       if (x == 0) continue;\n       for (a = -2; a <= 2; ++a)\n         for (b = -2; b <= 2; ++b)\n           if (i + a > 0 && i + a <= n && j + b > 0 && j + b <= n)\n             ++s[i + a][j + b];\n     }\n   for (i = 1; i <= n; ++i)\n     for (j = 1; j <= n; ++j) {\n       s[i][j] = s[i][j] > 15 ? 1 : 0;\n       v[i][j] = s[i][j];\n     }\n   for (i = 1; i <= n; ++i)\n     for (j = 1; j <= n; ++j) {\n       if (s[i][j] == 0) continue;\n       sumx = 0;\n       sumy = 0;\n       h = 1;\n       t = 1;\n       qx[h] = i;\n       qy[h] = j;\n       for (; h <= t; ++h) {\n         a = qx[h];\n         b = qy[h];\n         sumx += a;\n         sumy += b;\n         for (k = 0; k < 8; ++k) {\n           x = a + dx[k];\n           y = b + dy[k];\n           if (v[x][y] == 0) ++f[a][b];\n           if (s[x][y] == 1) {\n             ++t;\n             qx[t] = x;\n             qy[t] = y;\n             s[x][y] = 0;\n           }\n         }\n       }\n       if (t < 125) continue;\n       tx = round(sumx / t);\n       ty = round(sumy / t);\n       maxd = 0;\n       for (k = 1; k <= t; ++k) maxd = max(maxd, dis(tx - qx[k], ty - qy[k]));\n       if (t < 2.5 * maxd * maxd)\n         ++rec;\n       else\n         ++cir;\n     }\n   printf('%d %d\n', cir, rec);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int N;\n int A[20];\n void Work1() { printf('%d\n%d\n', A[0], A[0]); }\n void Work2() { printf('%d\n%d %d\n%d %d\n', A[0] * 2, A[0], A[0], A[0], A[0]); }\n void Work3() {\n   int i, i00, i01, i02, i11, i21, i20, i22, i10, i12;\n   int sum = 0;\n   for (i = 0; i < 9; ++i) {\n     sum += A[i];\n   }\n   sum /= 3;\n   for (i00 = 0; i00 < 9; ++i00) {\n     swap(A[0], A[i00]);\n     for (i01 = 1; i01 < 9; ++i01) {\n       swap(A[1], A[i01]);\n       for (i02 = 2; i02 < 9; ++i02) {\n         if (A[0] + A[1] + A[i02] != sum) continue;\n         swap(A[2], A[i02]);\n         for (i11 = 3; i11 < 9; ++i11) {\n           swap(A[3], A[i11]);\n           for (i21 = 4; i21 < 9; ++i21) {\n             if (A[1] + A[3] + A[i21] != sum) continue;\n             swap(A[4], A[i21]);\n             for (i20 = 5; i20 < 9; ++i20) {\n               if (A[2] + A[3] + A[i20] != sum) continue;\n               swap(A[5], A[i20]);\n               for (i22 = 6; i22 < 9; ++i22) {\n                 if (A[0] + A[3] + A[i22] != sum) continue;\n                 if (A[5] + A[4] + A[i22] != sum) continue;\n                 swap(A[6], A[i22]);\n                 for (i10 = 7; i10 < 9; ++i10) {\n                   if (A[0] + A[i10] + A[5] != sum) continue;\n                   swap(A[7], A[i10]);\n                   for (i12 = 8; i12 < 9; ++i12) {\n                     if (A[7] + A[3] + A[i12] != sum) continue;\n                     if (A[2] + A[i12] + A[6] != sum) continue;\n                     printf('%d\n', sum);\n                     printf('%d %d %d\n', A[0], A[1], A[2]);\n                     printf('%d %d %d\n', A[7], A[3], A[8]);\n                     printf('%d %d %d\n', A[5], A[4], A[6]);\n                     return;\n                   }\n                   swap(A[7], A[i10]);\n                   break;\n                 }\n                 swap(A[6], A[i22]);\n                 break;\n               }\n               swap(A[5], A[i20]);\n               break;\n             }\n             swap(A[4], A[i21]);\n             break;\n           }\n           swap(A[3], A[i11]);\n         }\n         swap(A[2], A[i02]);\n         break;\n       }\n       swap(A[1], A[i01]);\n     }\n     swap(A[0], A[i00]);\n   }\n }\n void Work4() {\n   int j, i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14, i15;\n   int sum = 0;\n   for (j = 0; j < 16; ++j) {\n     sum += A[j];\n   }\n   sum /= 4;\n   for (i0 = 0; i0 < 16; ++i0) {\n     swap(A[0], A[i0]);\n     for (i1 = 1; i1 < 16; ++i1) {\n       swap(A[1], A[i1]);\n       for (i2 = 2; i2 < 16; ++i2) {\n         swap(A[2], A[i2]);\n         for (i3 = 3; i3 < 16; ++i3) {\n           if (A[0] + A[1] + A[2] + A[i3] != sum) continue;\n           swap(A[3], A[i3]);\n           for (i4 = 4; i4 < 16; ++i4) {\n             swap(A[4], A[i4]);\n             for (i5 = 5; i5 < 16; ++i5) {\n               swap(A[5], A[i5]);\n               for (i6 = 6; i6 < 16; ++i6) {\n                 if (A[0] + A[4] + A[5] + A[i6] != sum) continue;\n                 swap(A[6], A[i6]);\n                 for (i7 = 7; i7 < 16; ++i7) {\n                   swap(A[7], A[i7]);\n                   for (i8 = 8; i8 < 16; ++i8) {\n                     if (A[2] + A[7] + A[5] + A[i8] != sum) continue;\n                     swap(A[8], A[i8]);\n                     for (i9 = 9; i9 < 16; ++i9) {\n                       swap(A[9], A[i9]);\n                       for (i10 = 10; i10 < 16; ++i10) {\n                         if (A[1] + A[4] + A[9] + A[i10] != sum) continue;\n                         swap(A[10], A[i10]);\n                         for (i11 = 11; i11 < 16; ++i11) {\n                           if (A[3] + A[7] + A[9] + A[i11] != sum) continue;\n                           swap(A[11], A[i11]);\n                           for (i12 = 12; i12 < 16; ++i12) {\n                             swap(A[12], A[i12]);\n                             for (i13 = 13; i13 < 16; ++i13) {\n                               if (A[0] + A[12] + A[i13] + A[11] != sum)\n                                 continue;\n                               swap(A[13], A[i13]);\n                               for (i14 = 14; i14 < 16; ++i14) {\n                                 if (A[12] + A[4] + A[7] + A[14] != sum)\n                                   continue;\n                                 swap(A[14], A[i14]);\n                                 for (i15 = 15; i15 < 16; ++i15) {\n                                   if (A[3] + A[14] + A[i15] + A[6] != sum)\n                                     continue;\n                                   if (A[13] + A[9] + A[5] + A[i15] != sum)\n                                     continue;\n                                   printf('%d\n', sum);\n                                   printf('%d %d %d %d\n', A[0], A[1], A[2],\n                                          A[3]);\n                                   printf('%d %d %d %d\n', A[12], A[4], A[7],\n                                          A[14]);\n                                   printf('%d %d %d %d\n', A[13], A[9], A[5],\n                                          A[15]);\n                                   printf('%d %d %d %d\n', A[11], A[10], A[8],\n                                          A[6]);\n                                   return;\n                                 }\n                                 swap(A[14], A[i14]);\n                                 break;\n                               }\n                               swap(A[13], A[i13]);\n                               break;\n                             }\n                             swap(A[12], A[i12]);\n                           }\n                           swap(A[11], A[i11]);\n                           break;\n                         }\n                         swap(A[10], A[i10]);\n                         break;\n                       }\n                       swap(A[9], A[i9]);\n                     }\n                     swap(A[8], A[i8]);\n                     break;\n                   }\n                   swap(A[7], A[i7]);\n                 }\n                 swap(A[6], A[i6]);\n                 break;\n               }\n               swap(A[5], A[i5]);\n             }\n             swap(A[4], A[i4]);\n           }\n           swap(A[3], A[i3]);\n           break;\n         }\n         swap(A[2], A[i2]);\n       }\n       swap(A[1], A[i1]);\n     }\n     swap(A[0], A[i0]);\n   }\n }\n int main() {\n   int i;\n   scanf('%d', &N);\n   for (i = 0; i < N * N; ++i) {\n     scanf('%d', &A[i]);\n   }\n   if (N == 1)\n     Work1();\n   else if (N == 2)\n     Work2();\n   else if (N == 3)\n     Work3();\n   else if (N == 4)\n     Work4();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1000000;\n int T, tot, prod, mn[1000010];\n bool solved[10000][11];\n bitset<1000> b[10000][11];\n vector<int> V, prime;\n unordered_map<int, int> id;\n int main() {\n   scanf('%d', &T);\n   for (int i = 2; i <= N; i++)\n     if (!mn[i]) {\n       if (prime.size() < 1000) prime.push_back(i);\n       for (int j = i; j <= N; j += i) mn[j] = i;\n     }\n   auto get = [&](long long x) {\n     V.clear();\n     int lst = 50;\n     while (x > 1) {\n       int c = 0, t = x <= N ? mn[x] : 0;\n       if (!t) {\n         for (int i = lst; ~i; i--) {\n           if (!(x % prime[i])) {\n             t = prime[i], lst = i;\n             break;\n           }\n         }\n       }\n       while (!(x % t)) x /= t, c++;\n       V.push_back(c);\n     }\n     sort(V.begin(), V.end(), greater<int>());\n     int z = prod = 1;\n     for (int i = 0; i < V.size(); i++) {\n       prod *= V[i] + 1;\n       for (int j = 0; j < V[i]; j++) z *= prime[i];\n     }\n     return z;\n   };\n   for (int i = 1; i <= N; i++) {\n     if (i == get(i)) id[i] = ++tot;\n   }\n   function<void(int, int)> solve = [&](int x, int step) {\n     int y = get(x);\n     if (prod >= 1000) return;\n     if (!id.count(x)) id[x] = ++tot;\n     int $ = id[x];\n     if (solved[$][step]) return;\n     solved[$][step] = 1;\n     if (!step) {\n       b[$][step][prod] = 1;\n       return;\n     }\n     vector<int> V2 = V;\n     for (int i = 0; i < V2.size(); i++) {\n       int v = get(x / prime[i]);\n       solve(v, step - 1), b[$][step] |= b[id[v]][step - 1];\n       v = get(1LL * x * prime[i]);\n       if (v <= N * 100) solve(v, step - 1), b[$][step] |= b[id[v]][step - 1];\n     }\n     int v = get(1LL * x * prime[V2.size()]);\n     if (v <= N * 100) solve(v, step - 1), b[$][step] |= b[id[v]][step - 1];\n   };\n   for (int i = 1; i <= N; i++)\n     if (id[i]) {\n       for (int j = 0; j <= 10; j++) solve(i, j);\n     }\n   while (T--) {\n     int x, y, ans = INT_MAX;\n     scanf('%d %d', &x, &y);\n     x = get(x), y = get(y);\n     for (int i = 0; i <= 10; i++) {\n       for (int j = 0; j <= 10; j++)\n         if (i + j < ans) {\n           if ((b[id[x]][i] & b[id[y]][j]).any()) ans = min(ans, i + j);\n         }\n     }\n     assert(ans <= 10);\n     printf('%d\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[100005][2];\n int dp[100005][3];\n enum direction {\n   n,\n   l,\n   r,\n };\n int main() {\n   int N;\n   cin >> N;\n   for (size_t i = 1; i <= N; i++) {\n     cin >> a[i][0] >> a[i][1];\n     dp[i][n] = dp[i][l] = dp[i][r] = 0;\n   }\n   a[0][0] = -1e18;\n   a[0][1] = 0;\n   dp[0][l] = dp[0][r] = dp[0][n] = 0;\n   a[N + 1][0] = 1e18;\n   a[N + 1][1] = 0;\n   for (size_t i = 0; i <= N; i++) {\n     if (a[i + 1][0] - a[i][0] > a[i + 1][1] + a[i][1]) {\n       dp[i + 1][l] = 1 + max(max(dp[i][l], dp[i][r]), dp[i][n]);\n       dp[i + 1][n] = max(max(dp[i][l], dp[i][r]), dp[i][n]);\n     } else if (a[i + 1][0] - a[i][0] > a[i + 1][1]) {\n       dp[i + 1][l] = 1 + max(dp[i][l], dp[i][n]);\n       dp[i + 1][n] = max(dp[i][l], max(dp[i][n], dp[i][r]));\n     }\n     if (a[i + 2][0] - a[i + 1][0] > a[i + 2][1] + a[i + 1][1]) {\n       dp[i + 1][r] = 1 + max(max(dp[i][l], dp[i][r]), dp[i][n]);\n       dp[i + 1][n] = max(max(dp[i][l], dp[i][r]), dp[i][n]);\n     } else if (a[i + 2][0] - a[i + 1][0] > a[i + 1][1]) {\n       dp[i + 1][r] = 1 + max(dp[i][r], max(dp[i][n], dp[i][l]));\n       dp[i + 1][n] = max(max(dp[i][n], dp[i][r]), dp[i][l]);\n     }\n     if (!(a[i + 2][0] - a[i + 1][0] > a[i + 1][1]) &&\n         !(a[i + 1][0] - a[i][0] > a[i + 1][1])) {\n       dp[i + 1][n] = max(max(dp[i][l], dp[i][r]), dp[i][n]);\n     }\n   }\n   cout << max(max(dp[N][1], dp[N][0]), dp[N][2]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1e9 + 7;\n const long long inf = 0x3f3f3f3f;\n const long long llinf = 1e18;\n const long long nax = 0;\n int n, m;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie();\n   cout.tie();\n   cin >> n >> m;\n   vector<int> a(n + 5), b(m + 5);\n   int maks1 = 0, mins1 = inf, mins2 = inf;\n   for (int i = 0; i < n; ++i) {\n     cin >> a[i];\n     maks1 = max(maks1, a[i]);\n     mins1 = min(mins1, a[i]);\n   }\n   for (int i = 0; i < m; ++i) {\n     cin >> b[i];\n     mins2 = min(mins2, b[i]);\n   }\n   if (max(mins1 * 2, maks1) < mins2) {\n     cout << max(mins1 * 2, maks1) << '\n';\n   } else\n     cout << '-1' << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[3];\n int main() {\n   cin >> a[0] >> a[1] >> a[2];\n   sort(a + 0, a + 3);\n   int res = 0;\n   while ((a[0] + a[1]) <= a[2]) {\n     a[0]++;\n     res++;\n   }\n   cout << res;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n #include<algorithm>\n using namespace std;\n  \n #define ll long long\n #define ld long double\n  \n #define rep(i,a,b) for(ll i=a;i<b;i++)\n #define repb(i,a,b) for(ll i=a;i>=b;i--)\n  \n #define err() cout<<'=================================='<<endl;\n #define errA(A) for(auto i:A)   cout<<i<<' ';cout<<endl;\n #define err1(a) cout<<#a<<' '<<a<<endl\n #define err2(a,b) cout<<#a<<' '<<a<<' '<<#b<<' '<<b<<endl\n #define err3(a,b,c) cout<<#a<<' '<<a<<' '<<#b<<' '<<b<<' '<<#c<<' '<<c<<endl\n #define err4(a,b,c,d) cout<<#a<<' '<<a<<' '<<#b<<' '<<b<<' '<<#c<<' '<<c<<' '<<#d<<' '<<d<<endl\n  \n #define pb push_back\n #define all(A)  A.begin(),A.end()\n #define allr(A)    A.rbegin(),A.rend()\n #define ft first\n #define sd second\n  \n #define pll pair<ll,ll>\n #define V vector<ll>\n #define S set<ll>\n #define VV vector<V>\n #define Vpll vector<pll>\n #define VVpll vector<Vpll>\n  \n #define endl '\n'\n  \n const ll logN = 20;\n const ll N=100005;\n const ll M = 1000000007;\n const ll M2=998244353 ;\n const ll INF = 1e12;\n #define PI 3.14159265\n #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)\n ll pow1(ll a,ll b){\n     ll res=1;\n     while(b>0){\n         if(b&1){\n         	res=(res*a)%M;\n 		}\n         a=(a*a)%M;\n         b>>=1;\n     }\n     return res%M;\n }\n \n map<ll,ll>mp;\n V a;\n ll n;\n void recur(ll depth,ll ind1=0, ll ind2=n-1 )\n {\n     if(ind1>ind2)return;\n     ll mx_ind;\n     ll mx=LLONG_MIN;\n     rep(i,ind1,ind2+1)\n     {\n         if(a[i]>mx)\n         {\n             mx=a[i];\n             mx_ind=i;\n         }\n     }\n     mp[mx_ind]=depth;\n     recur(depth+1,ind1,mx_ind-1);\n     recur(depth+1,mx_ind+1,ind2);\n     return;\n }\n \n \n int main()\n {\n     fast;\n \n     #ifndef ONLINE_JUDGE\n     freopen('../input.txt', 'r', stdin);\n     freopen('../output.txt', 'w', stdout);\n     #endif\n     \n     ll T=1;\n     cin>>T;\n     while(T--)\n     {\n         cin>>n;\n         a=V(n);\n         rep(i,0,n)cin>>a[i];\n         recur(0);\n         for(auto it:mp)\n         cout<<it.sd<<' ';\n         cout<<endl;\n         mp.clear();\n     }\n \n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n void _R(T &x) {\n   cin >> x;\n }\n void _R(int &x) { scanf('%d', &x); }\n void _R(long long &x) { scanf('%lld', &x); }\n void _R(double &x) { scanf('%lf', &x); }\n void _R(char &x) { scanf(' %c', &x); }\n void _R(char *x) { scanf('%s', x); }\n void R() {}\n template <class T, class... U>\n void R(T &head, U &...tail) {\n   _R(head);\n   R(tail...);\n }\n template <class T>\n void _W(const T &x) {\n   cout << x;\n }\n void _W(const int &x) { printf('%d', x); }\n void _W(const long long &x) { printf('%lld', x); }\n void _W(const double &x) { printf('%.16f', x); }\n void _W(const char &x) { putchar(x); }\n void _W(const char *x) { printf('%s', x); }\n template <class T, class U>\n void _W(const pair<T, U> &x) {\n   _W(x.first);\n   putchar(' ');\n   _W(x.second);\n }\n template <class T>\n void _W(const vector<T> &x) {\n   for (auto i = x.begin(); i != x.end(); _W(*i++))\n     if (i != x.cbegin()) putchar(' ');\n }\n void W() {}\n template <class T, class... U>\n void W(const T &head, const U &...tail) {\n   _W(head);\n   putchar(sizeof...(tail) ? ' ' : '\n');\n   W(tail...);\n }\n int MOD = 1e9 + 7;\n void ADD(long long &x, long long v) {\n   x = (x + v) % MOD;\n   if (x < 0) x += MOD;\n }\n const int SIZE = 1e6 + 10;\n int cnt[101][26];\n char an[101];\n pair<pair<int, int>, pair<char, char>> e[10000];\n int en;\n void query(int l, int r) {\n   W('?', l, r);\n   fflush(stdout);\n   int num = (r - l + 1);\n   memset((cnt), 0, sizeof((cnt)));\n   for (int i = (1); i <= (num * (num + 1) / 2); ++i) {\n     string s;\n     R(s);\n     if (((int)(s).size()) <= (num + 1) / 2) {\n       for (char c : s) {\n         cnt[((int)(s).size())][c - 'a']++;\n       }\n     }\n   }\n   int m = (num + 1) / 2;\n   for (int i = m - 1; i >= 1; i--) {\n     for (int j = 0; j < (26); ++j) cnt[i + 1][j] -= cnt[i][j];\n   }\n   for (int i = 1; i < m; i++) {\n     for (int j = 0; j < (26); ++j) cnt[i][j] -= cnt[i + 1][j];\n   }\n   string ret;\n   for (int i = (1); i <= (m); ++i) {\n     for (int j = 0; j < (26); ++j) {\n       if (cnt[i][j]) {\n         cnt[i][j]--;\n         ret += 'a' + j;\n         break;\n       }\n     }\n   }\n   for (int i = m; i >= 1; i--) {\n     for (int j = 0; j < (26); ++j) {\n       if (cnt[i][j]) {\n         cnt[i][j]--;\n         ret += 'a' + j;\n         break;\n       }\n     }\n   }\n   int ll = 0, rr = num - 1;\n   while (ll <= rr) {\n     if (ll == rr) {\n       an[l] = ret[ll];\n     } else {\n       e[en++] = make_pair(make_pair(l, r), make_pair(ret[ll], ret[rr]));\n     }\n     ll++;\n     rr--;\n     l++;\n     r--;\n   }\n }\n int main() {\n   int n;\n   R(n);\n   if (n == 1) {\n     query(1, 1);\n   } else if (n % 2 == 0) {\n     query(1, n - 1);\n     query(n / 2, n - 1);\n     query(n / 2, n);\n   } else {\n     query(1, n);\n     query(1, n / 2);\n     query(1, n / 2 + 1);\n   }\n   for (int i = 0; i < (1000); ++i) {\n     for (int j = 0; j < (en); ++j) {\n       if (an[e[j].first.first]) {\n         an[e[j].first.second] = (int)e[j].second.second +\n                                 (int)e[j].second.first - an[e[j].first.first];\n       }\n       if (an[e[j].first.second]) {\n         an[e[j].first.first] = (int)e[j].second.second +\n                                (int)e[j].second.first - an[e[j].first.second];\n       }\n     }\n   }\n   W('!', string(an + 1));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n void MACRO_VAR_Scan(T& t) {\n   cin >> t;\n }\n template <typename First, typename... Rest>\n void MACRO_VAR_Scan(First& first, Rest&... rest) {\n   cin >> first;\n   MACRO_VAR_Scan(rest...);\n }\n template <typename T>\n void MACRO_VEC_ROW_Init(int n, T& t) {\n   t.resize(n);\n }\n template <typename First, typename... Rest>\n void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {\n   first.resize(n);\n   MACRO_VEC_ROW_Init(n, rest...);\n }\n template <typename T>\n void MACRO_VEC_ROW_Scan(int p, T& t) {\n   cin >> t[p];\n }\n template <typename First, typename... Rest>\n void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {\n   cin >> first[p];\n   MACRO_VEC_ROW_Scan(p, rest...);\n }\n void _main();\n signed main() {\n   cin.tie(0);\n   ios::sync_with_stdio(false);\n   _main();\n }\n inline long long toInt(std::string s) {\n   long long v;\n   std::istringstream sin(s);\n   sin >> v;\n   return v;\n }\n template <class T>\n inline string toString(T x) {\n   ostringstream sout;\n   sout << x;\n   return sout.str();\n }\n template <class T>\n inline T sqr(T x) {\n   return x * x;\n }\n template <typename A, typename B>\n inline void chmin(A& a, B b) {\n   if (a > b) a = b;\n }\n template <typename A, typename B>\n inline void chmax(A& a, B b) {\n   if (a < b) a = b;\n }\n long long qp(long long a, long long b) {\n   long long ans = 1ll;\n   do {\n     if (b & 1) ans = 1ll * ans * a;\n     a = 1ll * a * a;\n   } while (b >>= 1);\n   return ans;\n }\n long long qpmod(long long a, long long b, long long mo) {\n   long long ans = 1ll;\n   do {\n     if (b & 1) ans = 1ll * ans * a % mo;\n     a = 1ll * a * a % mo;\n   } while (b >>= 1);\n   return ans;\n }\n inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }\n inline bool valid(int x, int h) { return 0 <= x && x < h; }\n const double EPS = 1e-8;\n const double PI = acos(-1.0);\n const int INF = (int)(1e9) + 7;\n const long long MOD = (long long)(1e9) + 7;\n const long long MOD2 = (long long)(1e18) + 9;\n const long long INF2 = (long long)(1e18);\n const long long INTMAX = (0x7FFFFFFFL);\n const long long LLMAX = (0x7FFFFFFFFFFFFFFFL);\n const int N4 = (int)1e4 + 10;\n const int N5 = (int)1e5 + 10;\n const int N9 = (int)1e9;\n int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\n int dy[8] = {0, 1, 0, -1, -1, -1, 1, 1};\n struct uf_tree {\n   std::vector<int> parent;\n   int __size;\n   uf_tree(int size_) : parent(size_, -1), __size(size_) {}\n   void unite(int x, int y) {\n     if ((x = find(x)) != (y = find(y))) {\n       if (parent[y] < parent[x]) std::swap(x, y);\n       parent[x] += parent[y];\n       parent[y] = x;\n       __size--;\n     }\n   }\n   bool is_same(int x, int y) { return find(x) == find(y); }\n   int find(int x) { return parent[x] < 0 ? x : parent[x] = find(parent[x]); }\n   int size(int x) { return -parent[find(x)]; }\n   int size() { return __size; }\n };\n long long digitsum(long long x) {\n   long long dig;\n   long long summ = 0;\n   while (x) {\n     dig = x % 10;\n     summ = summ + dig;\n     x = x / 10;\n   }\n   return summ;\n }\n long long ret, cnt, cur, ans, f;\n void an(long long x, long long y) { cout << x << ' ' << y << endl; }\n void _main() {\n   long long n, m, k;\n   MACRO_VAR_Scan(n, m, k);\n   ;\n   if (k < n) {\n     an(k + 1, 1);\n     return;\n   }\n   long long ok = 0, ng = n / 2;\n   while (ng - ok > 1) {\n     long long mi = (ng + ok) / 2;\n     if (n + mi * 2 * (m - 1) <= k)\n       ok = mi;\n     else\n       ng = mi;\n   }\n   k -= n - 1 + ok * 2 * (m - 1);\n   int x = n - ok * 2, y = 2;\n   if (k <= m - 1) {\n     an(x, k + 1);\n     return;\n   } else {\n     an(x - 1, m - (k - (m - 1)) + 1);\n     return;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MX = 300300;\n int t, n, m, i, k[MX], c[MX];\n long long r;\n int main() {\n   cin >> t;\n   while (t--) {\n     int n, x, sum = 0, ctr = 0;\n     cin >> n >> x;\n     int arr[n];\n     for (int i = 0; i < n; i++) {\n       cin >> arr[i];\n       sum += arr[i];\n       ctr += (arr[i] == x);\n     }\n     if (ctr == n)\n       cout << 0 << '\n';\n     else if (ctr >= 1 || sum == n * x)\n       cout << 1 << '\n';\n     else\n       cout << 2 << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int a, b;\n   scanf('%d%d', &a, &b);\n   int c = 0;\n   while (b) {\n     c *= 10;\n     c += b % 10;\n     b /= 10;\n   }\n   printf('%d\n', c + a);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int read() {\n   int x = 0, fu = 0;\n   char ch = getchar();\n   for (; ch < 48 || ch > 57; ch = getchar()) fu |= (ch == '-');\n   for (; ch > 47 && ch < 58; ch = getchar()) x = x * 10 + ch - '0';\n   return fu ? -x : x;\n }\n int n, mx = -1000000000, mn = 1000000000, ans = 1, tmp, no;\n set<int> s;\n char S[20];\n int main() {\n   for (n = read(), s.insert(mx), s.insert(mn); n--;) {\n     scanf('%s', S), tmp = read();\n     if (S[1] == 'D')\n       s.insert(tmp), no += (tmp > mx && tmp < mn);\n     else {\n       if (tmp < mx || tmp > mn) return puts('0'), 0;\n       ans = (tmp > mx && tmp < mn) ? (ans << 1) % 1000000007 : ans;\n       s.erase(tmp), no = 0;\n       set<int>::iterator it = s.lower_bound(tmp);\n       mn = *it, --it, mx = *it;\n     }\n   }\n   printf('%d\n', (int)(1LL * ans * (no + 1) % 1000000007));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   char a[111][111];\n   for (long long i = 1; i <= 3; i++)\n     for (long long j = 1; j <= 3; j++) cin >> a[i][j];\n   if (a[1][1] == a[3][3] && a[3][2] == a[1][2] && a[3][1] == a[1][3] &&\n       a[2][3] == a[2][1])\n     cout << 'YES';\n   else\n     cout << 'NO';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int tree[500000];\n int a[100000], pos[100001];\n void update(int node, int l, int r, int pos, int u) {\n   if (l == r) {\n     tree[node] += u;\n     return;\n   }\n   int mid = (l + r) / 2;\n   if (pos <= mid)\n     update(2 * node, l, mid, pos, u);\n   else\n     update(2 * node + 1, mid + 1, r, pos, u);\n   tree[node] = tree[2 * node] + tree[2 * node + 1];\n }\n int query(int node, int l, int r, int ql, int qr) {\n   if (ql > r || qr < l) return 0;\n   if (ql <= l && qr >= r) return tree[node];\n   int mid = (l + r) / 2;\n   return query(2 * node, l, mid, ql, qr) +\n          query(2 * node + 1, mid + 1, r, ql, qr);\n }\n int main() {\n   int i, j, k;\n   int n, res = 0;\n   scanf('%d', &n);\n   for (i = 0; i < n; i++) scanf('%d', &a[i]);\n   for (i = 0; i < n; i++) {\n     scanf('%d', &j);\n     pos[j] = i;\n   }\n   for (i = 0; i < n; i++) {\n     if (query(1, 0, n, pos[a[i]] + 1, n)) res++;\n     update(1, 0, n, pos[a[i]], 1);\n   }\n   printf('%d', res);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n int ans;\n int a[400050];\n int back[400050];\n vector<int> edge[400050];\n int main() {\n   ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++) cin >> a[i];\n   for (int i = 1, u, v; i <= m; i++) {\n     cin >> u >> v;\n     edge[v].push_back(u);\n   }\n   for (auto iter : edge[a[n]]) back[iter]++;\n   for (int i = n - 1; i >= 1; i--) {\n     if (back[a[i]] == n - i - ans)\n       ans++;\n     else {\n       for (auto iter : edge[a[i]]) back[iter]++;\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n pair<int, int> p;\n void sort() {\n   int temp = 0;\n   if (p.first < p.second) {\n     temp = p.first;\n     p.first = p.second;\n     p.second = temp;\n   }\n }\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     int op = 0;\n     cin >> p.first >> p.second;\n     if (p.first == p.second)\n       op = 1;\n     else {\n       if (p.first % p.second == 0)\n         op = p.first / p.second;\n       else {\n         while (p.first % p.second != 0) {\n           sort();\n           op += p.first / p.second;\n           p.first = p.first % p.second;\n         }\n       }\n     }\n     cout << op << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n, a, b, finish1 = INFINITY, finish2 = INFINITY, start1 = 0,\n                      start2 = 0, mx = 0;\n   scanf('%lld', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%lld %lld', &a, &b);\n     start2 = max(start2, a);\n     finish1 = min(finish1, b);\n   }\n   scanf('%lld', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%lld %lld', &a, &b);\n     start1 = max(start1, a);\n     finish2 = min(finish2, b);\n   }\n   mx = max(mx, start1 - finish1);\n   mx = max(mx, start2 - finish2);\n   if (mx <= 0)\n     printf('0\n');\n   else\n     printf('%lld\n', mx);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int x[100001] = {0};\n int main() {\n   int i, n;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &x[i]);\n   }\n   int sum = 0;\n   int cn = 0;\n   for (i = 0; i < n; i++) {\n     sum = sum + x[i] - x[i + 1];\n     if (sum < 0) {\n       do {\n         cn++;\n         sum++;\n       } while (sum < 0);\n     }\n   }\n   printf('%d', cn);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n, m;\n   scanf('%d%d', &n, &m);\n   int a[n], b[m], i, j;\n   for (i = 0; i < n; i++) scanf('%d', &a[i]);\n   for (i = 0; i < m; i++) scanf('%d', &b[i]);\n   for (i = 0; i < n; i++) {\n     for (j = 0; j < m; j++) {\n       if (b[j] == a[i]) printf('%d ', a[i]);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n const ll mod = 1e9 + 7;\n const int maxn = 1e5 + 5, maxa = 71, lim = 1 << 19;\n ll ev[maxn], od[maxn], dp[2][lim];\n int n, a, f[lim], comp[maxa];\n vector<int> p;\n int calc_msk(int x) {\n   int msk = 0, b = 1;\n   for (int y : p) {\n     while (x % (y * y) == 0) x /= y * y;\n     msk = (x % y == 0) * b + msk;\n     b *= 2;\n   }\n   return msk;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   for (int i = (2); i < (maxa); i++)\n     for (int j = i + i; j < maxa; j += i) comp[j] = 1;\n   for (int i = (2); i < (maxa); i++)\n     if (!comp[i]) p.push_back(i);\n   ev[0] = ev[1] = 1;\n   for (int i = (2); i < (maxn); i++) ev[i] = ev[i - 1] * 2 % mod;\n   od[0] = 0;\n   od[1] = 1;\n   for (int i = (2); i < (maxn); i++) od[i] = od[i - 1] * 2 % mod;\n   cin >> n;\n   for (int i = (0); i < (n); i++) {\n     cin >> a;\n     f[calc_msk(a)]++;\n   }\n   dp[0][0] = 1;\n   for (int i = (1); i < (maxa); i++) {\n     int x = calc_msk(i);\n     for (int msk = (0); msk < (lim); msk++)\n       dp[i & 1][msk] =\n           (dp[i & 1 ^ 1][msk] * ev[f[x]] + dp[i & 1 ^ 1][msk ^ x] * od[f[x]]) %\n           mod;\n     f[x] = 0;\n   }\n   cout << (dp[maxa & 1 ^ 1][0] + mod - 1) % mod << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int M = 100000 + 10;\n int leaf[M];\n vector<int> adj[M];\n int childnum[M];\n void dfs(int cur, int par) {\n   for (int i = 0; i < adj[cur].size(); i++) {\n     int nxt = adj[cur][i];\n     if (nxt != par) {\n       childnum[cur]++;\n       dfs(nxt, cur);\n     }\n   }\n }\n bool ok = true;\n long long int coef[M];\n long long int thres = 1e16 + 10;\n void dfs1(int cur, int par) {\n   coef[cur] = childnum[par] * coef[par];\n   if (coef[cur] > thres) {\n     ok = false;\n     return;\n   }\n   for (int i = 0; i < adj[cur].size(); i++) {\n     int nxt = adj[cur][i];\n     if (nxt != par) {\n       dfs1(nxt, cur);\n     }\n   }\n }\n vector<int> leafnode;\n long long int gcd(long long int x, long long int y) {\n   return y == 0 ? x : gcd(y, x % y);\n }\n int main() {\n   int n;\n   cin >> n;\n   long long int s = 0;\n   for (int i = 1; i <= n; i++) {\n     cin >> leaf[i];\n     s = s + leaf[i];\n   }\n   for (int i = 0; i < n - 1; i++) {\n     int u, v;\n     cin >> u >> v;\n     adj[u].push_back(v);\n     adj[v].push_back(u);\n   }\n   for (int i = 2; i <= n; i++) {\n     if (adj[i].size() == 1) {\n       leafnode.push_back(i);\n     }\n   }\n   dfs(1, 0);\n   coef[0] = 1;\n   childnum[0] = 1;\n   dfs1(1, 0);\n   long long int minv = -1;\n   for (int i = 0; i < leafnode.size(); i++) {\n     int curleaf = leafnode[i];\n     long long int x = leaf[curleaf];\n     long long int k = coef[curleaf];\n     long long int v = k * x;\n     if (minv == -1) {\n       minv = v;\n     } else {\n       minv = min(minv, v);\n     }\n   }\n   if (!ok) {\n     cout << s << endl;\n   } else {\n     long long int lcm = 1;\n     for (int i = 0; i < leafnode.size(); i++) {\n       int curleaf = leafnode[i];\n       long long int k = coef[curleaf];\n       long long int d = gcd(lcm, k);\n       lcm = lcm * k / d;\n       if (lcm > minv) {\n         ok = false;\n         break;\n       }\n     }\n     if (!ok) {\n       cout << s << endl;\n     } else {\n       lcm = minv / lcm * lcm;\n       long long int ans = 0;\n       for (int i = 0; i < leafnode.size(); i++) {\n         int curleaf = leafnode[i];\n         long long int k = coef[curleaf];\n         long long int x = lcm / k;\n         long long int val = leaf[curleaf] - x;\n         ans = ans + val;\n       }\n       cout << ans << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int m, n;\n   cin >> m >> n;\n   cout << ((m % 2) ? m * (n / 2) + (n % 2) * (m / 2)\n                    : n * (m / 2) + (m % 2) * (n / 2));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n long long a[300000];\n int main() {\n   while (cin >> n) {\n     for (int i = 0; i < n; i++) cin >> a[i];\n     sort(a, a + n);\n     long long ans = 0;\n     for (int i = 0; i < n; i++) {\n       int x = (i == n - 1 ? -1 : 0);\n       ans += (x + i + 2) * a[i];\n     }\n     cout << ans << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool check(const string &str) {\n   vector<string> vec{'ABSINTH', 'BEER',    'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM',\n                      'SAKE',    'TEQUILA', 'VODKA',  'WHISKEY',   'WINE'};\n   for (int i = 0; i < (int)vec.size(); ++i) {\n     if (str == vec[i]) return true;\n   }\n   return false;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   int cnt = 0;\n   for (int i = 0; i < n; ++i) {\n     string str;\n     cin >> str;\n     if (isdigit(str[0])) {\n       int num = stoi(str);\n       if (num < 18) ++cnt;\n     } else {\n       if (check(str)) ++cnt;\n     }\n   }\n   cout << cnt << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n, m;\n     cin >> n >> m;\n     vector<vector<int> > a(n), b(m);\n     for (int i = 0; i < n; i++) {\n       a[i].resize(m);\n       for (int j = 0; j < m; j++) cin >> a[i][j];\n     }\n     for (int j = 0; j < m; j++) {\n       b[j].resize(n);\n       for (int i = 0; i < n; i++) cin >> b[j][i];\n     }\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < m; j++) {\n         if (a[i][0] == b[j][0]) {\n           swap(a[0], a[i]);\n           swap(b[0], b[j]);\n           break;\n         }\n       }\n     }\n     for (int j = 0; j < n; j++) {\n       for (int i = 0; i < n; i++) {\n         if (a[i][0] == b[0][j]) {\n           for (auto x : a[i]) cout << x << ' ';\n           cout << '\n';\n           break;\n         }\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int yy[100005], id;\n int n, m;\n int st[100005 * 4], lz[100005 * 4];\n int a[100005];\n int l[305], r[305];\n inline void pu(int rt) { st[rt] = max(st[2 * rt + 1], st[2 * rt + 2]); }\n void pd(int rt, int l, int r, int m) {\n   if (lz[rt]) {\n     int t = lz[rt];\n     lz[2 * rt + 1] += t;\n     lz[2 * rt + 2] += t;\n     st[2 * rt + 1] += t;\n     st[2 * rt + 2] += t;\n     lz[rt] = 0;\n   }\n }\n void build(int rt, int l, int r) {\n   lz[rt] = 0;\n   if (l == r) {\n     st[rt] = a[l];\n     return;\n   }\n   int mid = (l + r) / 2;\n   build(2 * rt + 1, l, mid);\n   build(2 * rt + 2, mid + 1, r);\n   pu(rt);\n }\n void ud(int rt, int l, int r, int ul, int ur, int dt) {\n   if (l > ur || r < ul) return;\n   if (ul <= l && r <= ur) {\n     lz[rt] += dt;\n     st[rt] += dt;\n     return;\n   }\n   int mid = (l + r) / 2;\n   pd(rt, l, r, mid);\n   ud(2 * rt + 1, l, mid, ul, ur, dt), ud(2 * rt + 2, mid + 1, r, ul, ur, dt);\n   pu(rt);\n }\n int query(int rt, int l, int r, int ql, int qr) {\n   if (l > qr || r < ql) return -(0x3f3f3f3f);\n   if (ql <= l && r <= qr) return st[rt];\n   int mid = (l + r) / 2;\n   pd(rt, l, r, mid);\n   return max(query(2 * rt + 1, l, mid, ql, qr),\n              query(2 * rt + 2, mid + 1, r, ql, qr));\n }\n void init() {}\n int main() {\n   cin >> n >> m;\n   int ans = -(0x3f3f3f3f), p = -1;\n   int mmx = -(0x3f3f3f3f), mmn = (0x3f3f3f3f);\n   for (int i = (1); i <= (n); i++) {\n     scanf('%d', a + i);\n     mmx = max(a[i], mmx), mmn = min(a[i], mmn);\n   }\n   if (m == 0) {\n     printf('%d\n0', mmx - mmn);\n     return 0;\n   }\n   for (int i = (0); i < (m); i++) scanf('%d%d', l + i, r + i);\n   build(0, 1, n);\n   for (int i = (1); i <= (n); i++) {\n     for (int j = (0); j < (m); j++) {\n       if (l[j] == i) {\n         ud(0, 1, n, l[j], r[j], -1);\n       } else if (i - 1 == r[j]) {\n         ud(0, 1, n, l[j], r[j], 1);\n       }\n     }\n     int mx = query(0, 1, n, 1, n);\n     int nowmin = query(0, 1, n, i, i);\n     if (mx - nowmin > ans) {\n       ans = mx - nowmin;\n       p = i;\n     }\n   }\n   for (int i = (0); i < (m); i++) {\n     if (p >= l[i] && p <= r[i]) {\n       yy[id++] = i + 1;\n     }\n   }\n   printf('%d\n%d\n', ans, id);\n   for (int i = (0); i < (id); i++) printf('%d ', yy[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 10;\n const int INF = 2147000000;\n int n, k;\n int a[maxn][maxn];\n int b[maxn], vis[maxn];\n int ans = INF;\n int make(int num) {\n   int res = 0;\n   for (int i = 1; i <= k; i++) {\n     int c = b[i];\n     res = res * 10 + a[num][c];\n   }\n   return res;\n }\n void solve() {\n   int Max = -INF, Min = INF;\n   for (int i = 1; i <= n; i++) {\n     int res = make(i);\n     Max = max(Max, res);\n     Min = min(Min, res);\n   }\n   ans = min(ans, Max - Min);\n }\n void dfs(int cur) {\n   if (cur == k + 1) {\n     solve();\n     return;\n   }\n   for (int i = 1; i <= k; i++) {\n     if (!vis[i]) {\n       vis[i] = 1;\n       b[cur] = i;\n       dfs(cur + 1);\n       vis[i] = 0;\n     }\n   }\n }\n int main() {\n   scanf('%d%d', &n, &k);\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= k; j++) {\n       char c;\n       scanf(' %c', &c);\n       a[i][j] = c - '0';\n     }\n   }\n   memset(vis, 0, sizeof(vis));\n   dfs(1);\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int m, n, arr[2000][2000], temp[2000][2000];\n char ctrl(int i) {\n   for (int j = 1; j <= n; j++)\n     if (arr[i][j] and arr[i][j] != temp[i][j]) return 0;\n   return 1;\n }\n char solve(int a, int b, int c, int d, int ttt = 0) {\n   if (ttt) ttt = 3;\n   for (int i = 1; i <= m; i++) {\n     if (i & 1) {\n       for (int j = 1; j <= n; j++)\n         if (j & 1)\n           temp[i][j] = a;\n         else\n           temp[i][j] = b;\n       if (ctrl(i)) continue;\n       for (int j = 1; j <= n; j++)\n         if (j & 1)\n           temp[i][j] = b;\n         else\n           temp[i][j] = a;\n       if (ctrl(i)) continue;\n       return 0;\n     } else {\n       for (int j = 1; j <= n; j++)\n         if (j & 1)\n           temp[i][j] = c;\n         else\n           temp[i][j] = d;\n       if (ctrl(i)) continue;\n       for (int j = 1; j <= n; j++)\n         if (j & 1)\n           temp[i][j] = d;\n         else\n           temp[i][j] = c;\n       if (ctrl(i)) continue;\n       return 0;\n     }\n   }\n   while (ttt--) {\n     for (int i = 1; i <= m; i++)\n       for (int j = 1; j <= n; j++) arr[j][m - i + 1] = temp[i][j];\n     swap(m, n);\n     for (int i = 1; i <= m; i++)\n       for (int j = 1; j <= n; j++) temp[i][j] = arr[i][j];\n   }\n   for (int i = 1; i <= m; i++) {\n     for (int j = 1; j <= n; j++) cout << temp[i][j];\n     cout << endl;\n   }\n   return 1;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin >> m >> n;\n   char c;\n   for (int i = 1; i <= m; i++)\n     for (int j = 1; j <= n; j++) {\n       cin >> c;\n       arr[i][j] = c - '0';\n     }\n   if (solve(1, 2, 3, 4)) return 0;\n   if (solve(1, 3, 2, 4)) return 0;\n   if (solve(1, 4, 2, 3)) return 0;\n   if (solve(2, 3, 1, 4)) return 0;\n   if (solve(2, 4, 1, 3)) return 0;\n   if (solve(3, 4, 1, 2)) return 0;\n   for (int i = 1; i <= m; i++)\n     for (int j = 1; j <= n; j++) temp[j][m - i + 1] = arr[i][j];\n   swap(m, n);\n   for (int i = 1; i <= m; i++)\n     for (int j = 1; j <= n; j++) arr[i][j] = temp[i][j];\n   if (solve(1, 2, 3, 4, 1)) return 0;\n   if (solve(1, 3, 2, 4, 1)) return 0;\n   if (solve(1, 4, 2, 3, 1)) return 0;\n   if (solve(2, 3, 1, 4, 1)) return 0;\n   if (solve(2, 4, 1, 3, 1)) return 0;\n   if (solve(3, 4, 1, 2, 1)) return 0;\n   cout << 0 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Data {\n   int r, c, v;\n   bool operator<(const Data &r) const { return v < r.v; }\n };\n vector<vector<int> > mat, ans;\n Data sorteds[1001000];\n int mR[1001000], mC[1001000];\n map<pair<int, int>, vector<int> > mr, mc;\n void recursiveFix(int rr, int cc) {\n   vector<int> &vv = mr[pair<int, int>(rr, mat[rr][cc])];\n   vector<int> t = vv;\n   for (int j = int(0); j < int(vv.size()); j++) {\n     ans[rr][vv[j]] = ans[rr][cc];\n   }\n   vv.clear();\n   vector<int> &vv2 = mc[pair<int, int>(cc, mat[rr][cc])];\n   vector<int> t2 = vv2;\n   for (int j = int(0); j < int(vv2.size()); j++) {\n     ans[vv2[j]][cc] = ans[rr][cc];\n   }\n   vv2.clear();\n   for (int j = int(0); j < int(t2.size()); j++) recursiveFix(t2[j], cc);\n   for (int j = int(0); j < int(t.size()); j++) recursiveFix(rr, t[j]);\n }\n int main() {\n   int N, M;\n   while (scanf('%d %d', &N, &M) != EOF) {\n     int c = 0;\n     vector<int> t(M + 1);\n     mr.clear(), mc.clear();\n     mat.clear();\n     ans.clear();\n     mat.push_back(t);\n     ans.push_back(t);\n     for (int i = int(1); i < int(N + 1); i++) {\n       mat.push_back(t);\n       ans.push_back(t);\n       for (int j = int(1); j < int(M + 1); j++) {\n         scanf('%d', &mat[i][j]);\n         sorteds[c++] = Data{i, j, mat[i][j]};\n         ans[i][j] = 1;\n         mr[pair<int, int>(i, mat[i][j])].push_back(j);\n         mc[pair<int, int>(j, mat[i][j])].push_back(i);\n       }\n     }\n     sort(sorteds, sorteds + c);\n     memset(mR, 0, sizeof(mR));\n     memset(mC, 0, sizeof(mC));\n     int prev = -1;\n     priority_queue<Data> q;\n     for (int i = int(0); i < int(c); i++) {\n       if (prev != sorteds[i].v) {\n         while (!q.empty()) {\n           int rr = q.top().r, cc = q.top().c;\n           recursiveFix(rr, cc);\n           q.pop();\n         }\n       }\n       int r = sorteds[i].r, c = sorteds[i].c;\n       ans[r][c] = 0;\n       if (mat[r][mR[r]] == mat[r][c])\n         ans[r][c] = max(ans[r][c], ans[r][mR[r]]);\n       else\n         ans[r][c] = max(ans[r][c], ans[r][mR[r]] + 1);\n       if (mat[mC[c]][c] == mat[r][c])\n         ans[r][c] = max(ans[r][c], ans[mC[c]][c]);\n       else\n         ans[r][c] = max(ans[r][c], ans[mC[c]][c] + 1);\n       q.push(Data{r, c, ans[r][c]});\n       mR[r] = c;\n       mC[c] = r;\n       prev = sorteds[i].v;\n     }\n     while (!q.empty()) {\n       int rr = q.top().r, cc = q.top().c;\n       recursiveFix(rr, cc);\n       q.pop();\n     }\n     for (int i = int(0); i < int(N); i++) {\n       for (int j = int(0); j < int(M); j++)\n         printf('%d%c', ans[i + 1][j + 1], ' \n'[j == M - 1]);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct EDGE {\n   EDGE(int _v, int _cap, int _edgeidx) : v(_v), cap(_cap), edgeidx(_edgeidx) {}\n   int v;\n   int cap;\n   int edgeidx;\n };\n int DEBUG = 0;\n const int MAXN = 200001;\n vector<EDGE> edge[MAXN];\n int in[MAXN], total[MAXN], dir[MAXN];\n int mark[MAXN];\n int main(int argc, char **argv) {\n   DEBUG = (argc >= 2) ? atoi(argv[1]) : 0;\n   int n, m;\n   cin >> n >> m;\n   memset(total, 0, sizeof(total));\n   memset(in, 0, sizeof(in));\n   memset(mark, 0, sizeof(mark));\n   for (int i = 1; i <= m; i++) {\n     int a, b, c;\n     cin >> a >> b >> c;\n     edge[a].push_back(EDGE(b, c, i));\n     edge[b].push_back(EDGE(a, c, -i));\n     total[a] += c;\n     total[b] += c;\n   }\n   if (DEBUG) {\n     for (int i = 1; i <= m; i++) {\n       printf('total[%d]= %d ', i, total[i]);\n     }\n     printf('\n');\n   }\n   queue<int> que;\n   mark[1] = 1;\n   que.push(1);\n   while (!que.empty()) {\n     int u = que.front();\n     que.pop();\n     mark[u] = 1;\n     if (DEBUG) {\n       printf('\nu= %d\n', u);\n     }\n     for (int i = 0; i < edge[u].size(); i++) {\n       int edgeidx = edge[u][i].edgeidx;\n       int v = edge[u][i].v;\n       int cap = edge[u][i].cap;\n       if (DEBUG) {\n         printf('u= %d, v= %d, edgeidx= %d, cap= %d, mark[%d]= %d\n', u, v,\n                edgeidx, cap, v, mark[v]);\n       }\n       if (mark[v] == 0) {\n         in[v] += cap;\n         if (total[v] == 2 * in[v] && v != n) {\n           if (DEBUG) {\n             printf('que.push(%d)\n', v);\n           }\n           que.push(v);\n         }\n         dir[abs(edgeidx)] = ((edgeidx < 0) ? 1 : 0);\n       }\n     }\n     if (DEBUG) {\n       printf('que.size()= %d\n', que.size());\n     }\n   }\n   for (int i = 1; i <= m; i++) {\n     cout << dir[i] << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double eps = 1.0e-8;\n const int maxn = 1e6 + 10;\n const int maxm = 300;\n const int turn[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};\n long long mod = 1e9 + 7;\n vector<int> tree[10005];\n int ans[10005];\n int anser = 0;\n void dfs(int x, int pre, int c) {\n   int cur = c;\n   if (c != ans[x]) {\n     anser++, cur = ans[x];\n   }\n   int len = tree[x].size();\n   for (int i = 0; i < len; i++) {\n     int to = tree[x][i];\n     if (to == pre) {\n       continue;\n     }\n     dfs(to, x, cur);\n   }\n }\n int main() {\n   int n;\n   int now;\n   cin >> n;\n   for (int i = 2; i <= n; i++) {\n     cin >> now;\n     tree[now].push_back(i);\n     tree[i].push_back(now);\n   }\n   for (int i = 1; i <= n; i++) {\n     cin >> ans[i];\n   }\n   dfs(1, 0, 0);\n   cout << anser << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n clock_t t = clock();\n namespace my_std {\n using namespace std;\n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n template <typename T>\n inline T rnd(T l, T r) {\n   return uniform_int_distribution<T>(l, r)(rng);\n }\n template <typename T>\n inline bool chkmax(T &x, T y) {\n   return x < y ? x = y, 1 : 0;\n }\n template <typename T>\n inline bool chkmin(T &x, T y) {\n   return x > y ? x = y, 1 : 0;\n }\n template <typename T>\n inline void read(T &t) {\n   t = 0;\n   char f = 0, ch = getchar();\n   double d = 0.1;\n   while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();\n   while (ch <= '9' && ch >= '0') t = t * 10 + ch - 48, ch = getchar();\n   if (ch == '.') {\n     ch = getchar();\n     while (ch <= '9' && ch >= '0') t += d * (ch ^ 48), d *= 0.1, ch = getchar();\n   }\n   t = (f ? -t : t);\n }\n template <typename T, typename... Args>\n inline void read(T &t, Args &...args) {\n   read(t);\n   read(args...);\n }\n char __sr[1 << 21], __z[20];\n int __C = -1, __zz = 0;\n inline void Ot() { fwrite(__sr, 1, __C + 1, stdout), __C = -1; }\n inline void print(register int x) {\n   if (__C > 1 << 20) Ot();\n   if (x < 0) __sr[++__C] = '-', x = -x;\n   while (__z[++__zz] = x % 10 + 48, x /= 10)\n     ;\n   while (__sr[++__C] = __z[__zz], --__zz)\n     ;\n   __sr[++__C] = '\n';\n }\n void file() {}\n inline void chktime() {}\n long long ksm(long long x, int y) {\n   long long ret = 1;\n   for (; y; y >>= 1, x = x * x)\n     if (y & 1) ret = ret * x;\n   return ret;\n }\n }  // namespace my_std\n using namespace my_std;\n int n;\n int a[505050];\n namespace BIT {\n int tr[505050];\n void add(int x, int w) {\n   ++x;\n   x = n - x + 2;\n   while (x <= n + 1) chkmax(tr[x], w), x += x & -x;\n }\n int query(int x) {\n   ++x;\n   x = n - x + 2;\n   int res = -1e9;\n   while (x) chkmax(res, tr[x]), x -= x & -x;\n   return res;\n }\n void clear() {\n   for (int i = (1); i <= (n + 1); i++) tr[i] = -1e9;\n }\n }  // namespace BIT\n struct hh {\n   int k;\n   long long b;\n   int l, r;\n   const int q(long long x) const {\n     x = x * k + b;\n     return max(1ll * l, min(x, 1ll * r));\n   }\n   const hh operator+(const hh &x) const {\n     hh res;\n     res.k = k * x.k, res.b = b * x.k + x.b;\n     long long L = x.q(l), R = x.q(r);\n     if (L > R) swap(L, R);\n     res.l = L, res.r = R;\n     return res;\n   }\n };\n struct hhh {\n   hh a, b;\n   int tp;\n   const hhh operator+(const hhh &x) {\n     return tp ? (hhh){a + x.b, b + x.a, x.tp ^ 1}\n               : (hhh){a + x.a, b + x.b, x.tp};\n   }\n   pair<long long, long long> q(long long l, long long r) {\n     return tp ? make_pair(b.q(r), a.q(l)) : make_pair(a.q(l), b.q(r));\n   }\n };\n hhh tr[505050 << 2];\n void pushup(int k) { tr[k] = tr[k << 1 | 1] + tr[k << 1]; }\n void build(int k, int l, int r) {\n   if (l == r)\n     return tr[k] =\n                (hhh){(hh){-1, a[l], 0, a[l] - 1}, (hh){-1, a[l], 1, a[l]}, 1},\n            void();\n   int mid = (l + r) >> 1;\n   build(k << 1, l, mid), build(k << 1 | 1, mid + 1, r), pushup(k);\n }\n int query(int k, int l, int r, int x, long long &L, long long &R) {\n   if (r <= x) {\n     pair<long long, long long> xx = tr[k].q(L, R);\n     if (xx.first <= xx.second) return tie(L, R) = xx, l;\n     if (l == r) return L = R = -1, l + 1;\n     int mid = (l + r) >> 1;\n     int res = query(k << 1 | 1, mid + 1, r, x, L, R);\n     return L == -1 ? res : query(k << 1, l, mid, x, L, R);\n   }\n   int mid = (l + r) >> 1;\n   if (x <= mid) return query(k << 1, l, mid, x, L, R);\n   int res = query(k << 1 | 1, mid + 1, r, x, L, R);\n   return L == -1 ? res : query(k << 1, l, mid, x, L, R);\n }\n int qL(int x, long long l, long long r) { return query(1, 1, n, x, l, r); }\n int dp[505050];\n namespace Q2 {\n long long dB;\n int tp;\n map<long long, int> w;\n multiset<int> s;\n void clear() {\n   dB = 0, tp = 1;\n   w.clear(), s.clear();\n }\n void insert(long long B, int W) {\n   B = (B - dB) * tp;\n   if (w.find(B) == w.end())\n     w[B] = W, s.insert(W);\n   else if (w[B] < W)\n     s.erase(s.find(w[B])), s.insert(W), w[B] = W;\n }\n void maintain(long long a) {\n   tp *= -1, dB = a - dB;\n   for (auto it = w.begin(); it != w.end();) {\n     long long b = it->first * tp + dB;\n     if (b < 1 || b >= a)\n       s.erase(s.find(it->second)), w.erase(it++);\n     else\n       break;\n   }\n   int c = 0;\n   for (auto it = w.rbegin(); it != w.rend();) {\n     long long b = it->first * tp + dB;\n     if (b < 1 || b >= a)\n       s.erase(s.find(it->second)), it++, c++;\n     else\n       break;\n   }\n   while (c--) w.erase(prev(w.end()));\n }\n void add(long long B) {\n   B = (B - dB) * tp;\n   auto it = w.find(B);\n   if (it == w.end()) return;\n   s.erase(s.find(it->second)), s.insert(it->second + 1);\n   ++w[B];\n }\n int mx() { return s.size() ? *(s.rbegin()) : -1e9; }\n }  // namespace Q2\n void work() {\n   read(n);\n   for (int i = (1); i <= (n); i++) read(a[i]);\n   BIT::clear();\n   Q2::clear();\n   BIT::add(0, 0);\n   build(1, 1, n);\n   for (int i = (1); i <= (n); i++) {\n     int p = qL(i, 1, a[i] - 1);\n     dp[i] = BIT::query(p - 1) + i - 1;\n     Q2::maintain(a[i]);\n     if (a[i] % 2 == 0) Q2::add(a[i] / 2);\n     chkmax(dp[i], Q2::mx() + i - 1);\n     if (a[i] % 2 == 0) {\n       p = qL(i, a[i] / 2, a[i] / 2);\n       int w = BIT::query(p - 1) + 1;\n       chkmax(dp[i], w + i - 1);\n       Q2::insert(a[i] / 2, w);\n     }\n     BIT::add(i, dp[i] - i);\n   }\n   print(n + n - dp[n]);\n }\n int main() {\n   file();\n   int T;\n   read(T);\n   while (T--) work();\n   Ot();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long int hell = 1000000007;\n void solve() {\n   long long int n, m;\n   cin >> n >> m;\n   vector<long long int> used(3 * n + 5, 0);\n   vector<long long int> mx;\n   long long int ctr = 1;\n   for (long long int i = 1; i <= m; i++) {\n     long long int u, v;\n     cin >> u >> v;\n     if (!used[u] and !used[v]) {\n       mx.push_back(i);\n       used[u] = used[v] = 1;\n     }\n   }\n   if ((long long int)((mx).size()) >= n) {\n     cout << 'Matching\n';\n     for (long long int i = 0; i < n; i++) cout << mx[i] << ' ';\n     cout << '\n';\n   } else {\n     cout << 'IndSet\n';\n     long long int ctr = n;\n     for (long long int i = 1; i <= 3 * n; i++) {\n       if (!used[i]) {\n         cout << i << ' ';\n         ctr--;\n       }\n       if (!ctr) break;\n     }\n     cout << '\n';\n   }\n }\n int32_t main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long int t;\n   cin >> t;\n   for (long long int i = 0; i < t; i++) solve();\n   cerr << 'Time elapsed : ' << clock() * 1000.0 / CLOCKS_PER_SEC << 'ms'\n        << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n vector<long long> S;\n vector<int> N, L, R;\n vector<bool> E;\n pair<long long, pair<int, int>> merge(int l, int r, int mid,\n                                       pair<long long, pair<int, int>> L,\n                                       pair<long long, pair<int, int>> R) {\n   int ll = L.second.first, lr = L.second.second;\n   int rl = R.second.first, rr = R.second.second;\n   long long ls = L.first, rs = R.first;\n   long long sum = ls + rs;\n   int lw = ll, rw = rr;\n   int lLength = mid - l + 1, rLength = r - (mid + 1) + 1;\n   if (lr && rl && N[mid + 1] >= N[mid]) {\n     if (ll == lLength) lw += rl;\n     if (rr == rLength) rw += lr;\n     if (ll != lLength && rl != rLength)\n       sum += (long long)(lr + rl) * (lr + rl - 1) / 2;\n   } else {\n     if (ll != lLength) sum += (long long)(lr) * (lr - 1) / 2;\n     if (rr != rLength) sum += (long long)(rl) * (rl - 1) / 2;\n   }\n   return {sum, {lw, rw}};\n }\n pair<long long, pair<int, int>> getVal(int lq, int rq, int l = 0, int r = n - 1,\n                                        int index = 0) {\n   if (l == r) return {0, {1, 1}};\n   if (lq == l && rq == r && E[index]) return {S[index], {L[index], R[index]}};\n   int mid = (l + r) >> 1;\n   if (rq <= mid) {\n     return getVal(lq, rq, l, mid, 2 * index + 1);\n   } else if (lq > mid) {\n     return getVal(lq, rq, mid + 1, r, 2 * index + 2);\n   }\n   auto lv = getVal(lq, mid, l, mid, 2 * index + 1);\n   auto rv = getVal(mid + 1, rq, mid + 1, r, 2 * index + 2);\n   auto ret = merge(lq, rq, mid, lv, rv);\n   if (l == lq && r == rq) {\n     E[index] = true;\n     S[index] = ret.first, L[index] = ret.second.first,\n     R[index] = ret.second.second;\n   }\n   return ret;\n }\n void update(int lq, int rq, int l = 0, int r = n - 1, int index = 0) {\n   if (l == r) return;\n   E[index] = false;\n   int mid = (l + r) >> 1;\n   if (rq <= mid) {\n     return update(lq, rq, l, mid, 2 * index + 1);\n   } else if (lq > mid) {\n     return update(lq, rq, mid + 1, r, 2 * index + 2);\n   }\n   update(lq, mid, l, mid, 2 * index + 1);\n   update(mid + 1, rq, mid + 1, r, 2 * index + 2);\n   return;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int q;\n   cin >> n >> q;\n   N = vector<int>(n);\n   S = vector<long long>(4 * n + 1);\n   L = R = vector<int>(4 * n + 1);\n   E = vector<bool>(4 * n + 1, false);\n   for (auto &it : N) cin >> it;\n   int cmd, x, y;\n   for (int qq = 0; qq < q; qq++) {\n     cin >> cmd >> x >> y;\n     if (cmd == 1) {\n       N[x - 1] = y;\n       update(x - 1, x - 1);\n     } else {\n       x--, y--;\n       auto res = getVal(x, y);\n       auto sum = res.first;\n       int l = res.second.first, r = res.second.second;\n       if (l == (y - x + 1))\n         sum += (long long)(l) * (l - 1) / 2;\n       else\n         sum += ((long long)(l) * (l - 1) + (long long)(r) * (r - 1)) / 2;\n       sum += (y - x + 1);\n       cout << sum << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 505;\n int n, in[N], out[N], w[N], s[N], v[N];\n vector<int> st[N << 1];\n int f1[N][N << 1], f2[N][N << 1];\n int dfs(int x, int S) {\n   if (S < 0) return 0;\n   if (~f1[x][S]) return f1[x][S];\n   f2[x][out[x] + 1] = 0;\n   for (int i = out[x]; i >= in[x]; i--) {\n     f2[x][i] = f2[x][i + 1];\n     for (int j = 0; j < st[i].size(); j++) {\n       int p = st[i][j];\n       if (out[p] > out[x] || p == x) continue;\n       f2[x][i] = max(f2[x][i], dfs(p, min(S - w[p], s[p])) + f2[x][out[p]]);\n     }\n   }\n   return f1[x][S] = f2[x][in[x]] + v[x];\n }\n int main() {\n   int S;\n   scanf('%d%d', &n, &S);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d%d%d%d%d', &in[i], &out[i], &w[i], &s[i], &v[i]);\n     st[in[i]].push_back(i);\n   }\n   memset(f1, -1, sizeof f1);\n   in[0] = 0;\n   out[0] = 2 * n + 1;\n   printf('%d\n', dfs(0, S));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void fr(int &a, bool f = 0, char ch = getchar()) {\n   for (a = 0; ch < '0' || ch > '9'; ch = getchar()) ch == '-' ? f = 1 : 0;\n   for (; ch >= '0' && ch <= '9'; ch = getchar()) a = a * 10 + ch - '0';\n   a = f ? -a : a;\n }\n int fr() {\n   int a;\n   return fr(a), a;\n }\n const int N = 12;\n int arr[(1 << N) + 10], a[(1 << N) + 10], ans[(1 << N) + 10], p[(1 << N) + 10];\n int tmp[(1 << N) + 10];\n bool visval[(1 << N) + 10], vispos[(1 << N) + 10];\n struct OI {\n   int RP, score;\n } CSPS2021, NOIP2021;\n int main() {\n   CSPS2021.RP++, CSPS2021.score++, NOIP2021.RP++, NOIP2021.score++, 392699;\n   srand(time(0));\n   int n = fr(), xsum = 0, tot = 1 << n;\n   for (int i = 0; i < (1 << n); i++) fr(a[i]), xsum ^= a[i], arr[i] = i;\n   if (xsum) return puts('Fou'), 0;\n   puts('Shi');\n   for (int i = 0; i < (1 << n); i++) {\n     int pos = rand() % tot, arrpos = arr[pos];\n     if (pos != tot - 1) arr[pos] = arr[tot - 1];\n     tot--, tmp[0] = 0;\n     bool flag = 0;\n     for (int j = 0; j < (1 << n); j++)\n       if (vispos[j] == 0 && visval[arrpos ^ a[j]] == 0) {\n         flag = visval[arrpos ^ a[j]] = vispos[j] = 1, ans[j] = arrpos,\n         p[arrpos ^ a[j]] = j;\n         break;\n       } else if (vispos[j] == 0)\n         tmp[++tmp[0]] = j;\n     if (flag == 0) {\n       int j = tmp[rand() % tmp[0] + 1];\n       vispos[p[arrpos ^ a[j]]] = 0;\n       arr[tot++] = ans[p[arrpos ^ a[j]]], ans[j] = arrpos;\n       vispos[j] = 1;\n       visval[ans[j] ^ a[j]] = 1;\n       p[ans[j] ^ a[j]] = j;\n       i--;\n     }\n   }\n   for (int i = 0; i < (1 << n); i++) printf('%d ', ans[i] ^ a[i]);\n   puts('');\n   for (int i = 0; i < (1 << n); i++) printf('%d ', ans[i]);\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int ans[2020], cnt = 0, k;\n int main() {\n   cin >> k;\n   k++;\n   ans[++cnt] = -1;\n   while (k >= 1e6 - 1) {\n     k -= 1e6 - 1;\n     ans[++cnt] = 1e6 - 1 + 1;\n   }\n   ans[++cnt] = k + 1;\n   cout << cnt << endl;\n   for (int i = 1; i <= cnt; i++) cout << ans[i] << ' ';\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long f = 0, j, q = 1, i, n;\n   while (q--) {\n     long long y, k = 1, x, M, s;\n     cin >> n >> M >> s >> f;\n     unordered_map<int, pair<int, int> > m;\n     for (i = 0; i < M; i++) {\n       long long X, Y, Z;\n       cin >> X >> Y >> Z;\n       m.insert(make_pair(X, make_pair(Y, Z)));\n     }\n     if (s < f) {\n       while (s != f) {\n         if (m.count(k)) {\n           if ((s >= m[k].first && s <= m[k].second) ||\n               (s + 1 >= m[k].first && s + 1 <= m[k].second))\n             cout << 'X';\n           else {\n             cout << 'R';\n             s++;\n           }\n         } else {\n           cout << 'R';\n           s++;\n         }\n         k++;\n       }\n     } else {\n       while (s != f) {\n         if (m.count(k)) {\n           if ((s >= m[k].first && s <= m[k].second) ||\n               (s - 1 >= m[k].first && s - 1 <= m[k].second))\n             cout << 'X';\n           else {\n             cout << 'L';\n             s--;\n           }\n         } else {\n           cout << 'L';\n           s--;\n         }\n         k++;\n       }\n     }\n     cout << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string ch1, ch2, ch3;\n   getline(cin, ch1);\n   getline(cin, ch2);\n   for (int s = 0; s < ch1.size(); s++) {\n     if (ch1[s] != ch2[s]) {\n       ch3 += '1';\n     } else {\n       ch3 += '0';\n     }\n   }\n   cout << ch3 << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   long long n, k;\n   cin >> n >> k;\n   long long l = 0;\n   long long r = n;\n   while (l != r) {\n     long long mid = (l + r) / 2;\n     if (mid * (mid + 1) / 2 - (n - mid) < k)\n       l = mid + 1;\n     else\n       r = mid;\n   }\n   cout << n - l;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Solve {\n   bool mark[(int)(3e5 + 10)];\n   vector<pair<int, int>> ed[(int)(3e5 + 10)];\n   vector<int> mtch;\n   int n, m, T;\n   void go() {\n     T = 0;\n     input();\n     find_mx_match();\n     if (T >= 2 * n)\n       prnt_match();\n     else\n       prnt_ind();\n   }\n   void input() {\n     cin >> n >> m;\n     for (int i = 0; i < m; i++) {\n       int u, v;\n       cin >> u >> v;\n       u--, v--;\n       ed[u].push_back({v, i + 1});\n       ed[v].push_back({u, i + 1});\n     }\n   }\n   void find_mx_match() {\n     for (int i = 0; i < 3 * n; i++) {\n       if (mark[i]) continue;\n       for (auto x : ed[i]) {\n         if (mark[x.first]) continue;\n         mark[x.first] = mark[i] = true;\n         mtch.push_back(x.second);\n         T += 2;\n         break;\n       }\n     }\n   }\n   void prnt_match() {\n     cout << 'Matching\n';\n     int I = 0;\n     for (auto x : mtch) {\n       if (I == n) break;\n       cout << x << ' ';\n       I++;\n     }\n     cout << endl;\n   }\n   void prnt_ind() {\n     cout << 'IndSet\n';\n     for (int I = 0, J = 0; I < 3 * n && J < n; I++) {\n       if (!mark[I]) {\n         cout << I + 1 << ' ';\n         J++;\n       }\n     }\n     cout << endl;\n   }\n   void clear() {\n     T = 0;\n     for (int i = 0; i < 3 * n; i++) mark[i] = false;\n     for (int i = 0; i < 3 * n; i++) ed[i].clear();\n     n = -1, m = -1;\n     mtch.clear();\n   }\n } S;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL), cout.tie(NULL);\n   int T;\n   cin >> T;\n   while (T--) {\n     S.go();\n     S.clear();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   ;\n   long long t;\n   cin >> t;\n   while (t--) {\n     long long n, x, m, i, flag = 0, a, b, l, r, sum = 2, ones = 0, zero = 0,\n                           output = 0, j;\n     vector<pair<long long, long long> > v;\n     cin >> n >> m;\n     long long arr[n + 1][m + 1];\n     for (i = 1; i <= n; i++) {\n       for (j = 1; j <= m; j++) {\n         cin >> arr[i][j];\n       }\n     }\n     a = 0;\n     sum = 2;\n     flag = 0;\n     while (flag == 0) {\n       for (i = 1; i <= n; i++) {\n         for (j = 1; j <= m; j++) {\n           if ((i + j == sum) || (i + j == n + m - a))\n             v.push_back(make_pair(i, j));\n         }\n       }\n       while (v.size() > 0) {\n         i = v[v.size() - 1].first;\n         j = v[v.size() - 1].second;\n         if (arr[i][j] == 0)\n           zero++;\n         else\n           ones++;\n         v.pop_back();\n       }\n       output = output + min(zero, ones);\n       zero = 0;\n       ones = 0;\n       a++;\n       sum++;\n       if (sum == n + m - a)\n         break;\n       else if (sum > (n + m - a))\n         break;\n     }\n     cout << output << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int t;\n   cin >> t;\n   while (t--) {\n     long long int c, m, x;\n     cin >> c >> m >> x;\n     long long int y = c + m + x;\n     y = y / 3;\n     long long int ans = 0;\n     if (c >= 1 && m >= 1) {\n       long long int v = min(c, m);\n       ans = min(v, y);\n     }\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Edge {\n   int t, next;\n   Edge() {}\n   Edge(int a, int b) : t(a), next(b) {}\n };\n Edge e[200005];\n int head[100005];\n vector<int> g[100005];\n queue<int> bel[100005];\n int d[100005], scc_cnt;\n namespace Graph {\n int dfn[100005], low[100005], dfs_cnt;\n int st[100005], top;\n bool in[100005];\n int id[100005];\n void dfs(int x) {\n   dfn[x] = low[x] = ++dfs_cnt;\n   st[++top] = x;\n   in[x] = 1;\n   for (int i = head[x]; i; i = e[i].next) {\n     int u = e[i].t;\n     if (!dfn[u]) {\n       dfs(u);\n       low[x] = min(low[x], low[u]);\n     } else if (in[u])\n       low[x] = min(low[x], dfn[u]);\n   }\n   if (low[x] >= dfn[x]) {\n     scc_cnt++;\n     int t;\n     do {\n       t = st[top--];\n       in[t] = 0;\n       id[t] = scc_cnt;\n       bel[scc_cnt].push(t);\n     } while (t != x);\n   }\n }\n void build(int n) {\n   for (int i = 1; i <= n; i++)\n     if (!dfn[i]) dfs(i);\n   for (int i = 1; i <= n; i++)\n     for (int j = head[i]; j; j = e[j].next)\n       if (id[i] != id[e[j].t]) {\n         int u = id[i], v = id[e[j].t];\n         g[u].push_back(v);\n         d[v]++;\n       }\n }\n }  // namespace Graph\n bool ask(int x, int y) {\n   printf('? %d %d\n', x, y);\n   fflush(stdout);\n   scanf('%d', &x);\n   return x;\n }\n queue<int> q;\n void erase(int x) {\n   for (int i = 0; i < g[x].size(); i++) {\n     int u = g[x][i];\n     d[u]--;\n     if (!d[u]) q.push(u);\n   }\n }\n int solve(int n) {\n   int ans = 0;\n   for (int i = 1; i <= scc_cnt; i++)\n     if (!d[i]) {\n       if (!ans)\n         ans = bel[i].front();\n       else\n         q.push(i);\n     }\n   while (!q.empty()) {\n     int t = q.front(), x = bel[t].front();\n     if (ask(ans, x)) {\n       bel[t].pop();\n       if (!bel[t].size()) {\n         erase(t);\n         q.pop();\n       }\n     } else {\n       int p = Graph::id[ans];\n       bel[p].pop();\n       if (!bel[p].size())\n         erase(p);\n       else\n         q.push(p);\n       ans = x;\n       q.pop();\n     }\n   }\n   return ans;\n }\n int main() {\n   int n, m;\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= m; i++) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     e[i] = Edge(y, head[x]);\n     head[x] = i;\n   }\n   Graph::build(n);\n   printf('! %d\n', solve(n));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int d[66000], s[66000];\n int que[66000];\n bool f[66000];\n int n, m;\n vector<pair<int, int> > res;\n int biton(int x, int k) { return (x | (1 << k)); }\n int Minus(int x, int y) {\n   int z = 0;\n   for (int i = 0; i < 17; i++) {\n     int u = ((x >> i) & 1);\n     int v = ((y >> i) & 1);\n     if (u != v) z = biton(z, i);\n   }\n   return z;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> d[i] >> s[i];\n   for (int i = 0; i < n; i++)\n     if (d[i] == 1) {\n       f[i] = true;\n       m++;\n       que[m] = i;\n     }\n   while (m > 0) {\n     int u = que[m];\n     if (d[u] == 0) {\n       m--;\n       continue;\n     }\n     int v = s[u];\n     res.push_back(make_pair(u, v));\n     s[v] = Minus(s[v], u);\n     d[v]--;\n     m--;\n     if (d[v] == 1 && f[v] == false) {\n       f[v] = true;\n       m++;\n       que[m] = v;\n     }\n   }\n   cout << res.size() << '\n';\n   for (int i = 0; i < res.size(); i++)\n     cout << res[i].first << ' ' << res[i].second << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[200005];\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     memset(a, 0, sizeof(a));\n     int n;\n     cin >> n;\n     for (int i = 0; i < n; i++) {\n       cin >> a[i];\n     }\n     sort(a, a + n);\n     if (a[0] != a[n - 1]) {\n       printf('1\n');\n     } else {\n       printf('%d\n', n);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void _fill_int(int* p, int val, int rep) {\n   int i;\n   for (i = 0; i < rep; i++) p[i] = val;\n }\n signed long long GETi() {\n   signed long long i;\n   scanf('%lld', &i);\n   return i;\n }\n int N, M;\n int A[10000], B[10000];\n int T[4][10000];\n void solve() {\n   int f, i, j, k, l, x, y;\n   cin >> N >> M;\n   for (i = 0; i < N; i++) A[i] = 1 << 29;\n   for (i = 0; i < M; i++) {\n     cin >> T[0][i] >> T[1][i] >> T[2][i] >> T[3][i];\n     T[1][i]--;\n     T[2][i]--;\n   }\n   for (i = M - 1; i >= 0; i--) {\n     if (T[0][i] == 1) {\n       for (j = T[1][i]; j <= T[2][i]; j++) A[j] -= T[3][i];\n     } else {\n       for (j = T[1][i]; j <= T[2][i]; j++) A[j] = min(A[j], T[3][i]);\n     }\n   }\n   int ng = 0;\n   memmove(B, A, sizeof(A));\n   for (i = 0; i < M; i++) {\n     int y = -1 << 29;\n     if (T[0][i] == 1)\n       for (j = T[1][i]; j <= T[2][i]; j++) B[j] += T[3][i];\n     else {\n       for (j = T[1][i]; j <= T[2][i]; j++) y = max(y, B[j]);\n       if (y != T[3][i]) ng = 1;\n     }\n   }\n   if (ng)\n     (void)printf('NO\n');\n   else {\n     (void)printf('YES\n');\n     for (i = 0; i < N; i++) (void)printf('%d ', A[i]);\n     (void)printf('\n');\n   }\n }\n int main(int argc, char** argv) {\n   if (argc > 1) freopen(argv[1], 'r', stdin);\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, t;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> t;\n   while (t--) {\n     cin >> n;\n     if (n == 1) {\n       cout << '-1' << endl;\n       continue;\n     }\n     string ans = '2';\n     for (int i = 1; i < n; i++) ans += '3';\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n struct city_t : array<bitset<99>, 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 <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline void smin(T &a, T b) {\n   if (a > b) a = b;\n }\n template <class T>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n vector<int> 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<int>::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<int> v;\n   v.push(i);\n   while (!v.empty()) {\n     int to = v.front();\n     v.pop();\n     for (vector<int>::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 <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC optimize('unroll-loops')\n int main() {\n   std::ios::sync_with_stdio(false);\n   std::cin.tie(nullptr);\n   int n, k;\n   std::cin >> n >> k;\n   int64_t s1 = 0;\n   int s2 = 0;\n   for (int i = 0; i < k; ++i) {\n     int a, b;\n     std::cin >> a >> b;\n     s1 += b;\n     s2 = (s2 + 1ll * a * b) % n;\n   }\n   if (s1 > n) {\n     std::cout << -1 << '\n';\n   } else if (s1 < n) {\n     std::cout << 1 << '\n';\n   } else if (1ll * n * (n - 1) / 2 % n == s2) {\n     std::cout << 1 << '\n';\n   } else {\n     std::cout << -1 << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   vector<int> a(26), a2(26), a3(26);\n   string s1, s2, s3;\n   char ss1[100001], ss2[100001], ss3[100001];\n   scanf('%s%s%s', ss1, ss2, ss3);\n   s1 = ss1;\n   s2 = ss2;\n   s3 = ss3;\n   for (int i = 0; i < s1.size(); i++) a[s1[i] - 'a']++;\n   for (int i = 0; i < s2.size(); i++) a2[s2[i] - 'a']++;\n   for (int i = 0; i < s3.size(); i++) a3[s3[i] - 'a']++;\n   int max1 = 0, max2 = 0;\n   int ma2 = 100000;\n   for (int i = 0; i < 26; i++)\n     if (a2[i]) ma2 = min(ma2, a[i] / a2[i]);\n   for (int i = 0; i <= ma2; i++) {\n     int r = 100000;\n     for (int j = 0; j < 26; j++)\n       if (a3[j]) r = min(r, (a[j] - i * a2[j]) / a3[j]);\n     if (r + i > max1 + max2) max1 = i, max2 = r;\n   }\n   for (int i = 0; i < max1; i++) printf('%s', ss2);\n   for (int i = 0; i < max2; i++) printf('%s', ss3);\n   for (int i = 0; i < 26; i++) a[i] -= (a2[i] * max1 + a3[i] * max2);\n   for (int i = 0; i < 26; i++) {\n     while (a[i] > 0) {\n       printf('%c', i + 'a');\n       a[i]--;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 501;\n int dp[N][N][2];\n char a[N][N];\n const int MOD = 1e9 + 7;\n void add(int &a, int b) {\n   a += b;\n   if (a >= MOD) a -= MOD;\n   if (a < 0) a += MOD;\n }\n int mul(int a, int b) { return (long long)a * b % MOD; }\n int power(int a, int b) {\n   int ans = 1;\n   while (b > 0) {\n     if (b & 1) ans = mul(ans, a);\n     a = mul(a, a);\n     b >>= 1;\n   }\n   return ans;\n }\n int main() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++) {\n     cin >> (a[i] + 1);\n   }\n   for (int x2 = 1; x2 <= n; x2++) {\n     for (int x1 = n; x1 >= 1; x1--) {\n       for (int y1 = m; y1 >= 1; y1--) {\n         int x2cc = x2 % 2;\n         int y2 = n + m - x2 - x1 - y1 + 2;\n         dp[x1][y1][x2cc] = 0;\n         if (x1 > x2 || y1 > y2) continue;\n         if (y2 < 1 || y2 > m) continue;\n         if (x1 == x2 && y1 == y2) {\n           dp[x1][y1][x2cc] = 1;\n           continue;\n         }\n         if ((x2 == x1 + 1 && y1 == y2) || (x1 == x2 && y2 == y1 + 1))\n           if (a[x1][y1] == a[x2][y2]) {\n             dp[x1][y1][x2cc] = 1;\n             continue;\n           }\n         if (x1 < n) {\n           if (x2 > 1)\n             if (a[x1 + 1][y1] == a[x2 - 1][y2])\n               add(dp[x1][y1][x2cc], dp[x1 + 1][y1][!x2cc]);\n           if (y2 > 1)\n             if (a[x1 + 1][y1] == a[x2][y2 - 1])\n               add(dp[x1][y1][x2cc], dp[x1 + 1][y1][x2cc]);\n         }\n         if (y1 < m) {\n           if (x2 > 1)\n             if (a[x1][y1 + 1] == a[x2 - 1][y2])\n               add(dp[x1][y1][x2cc], dp[x1][y1 + 1][!x2cc]);\n           if (y2 > 1)\n             if (a[x1][y1 + 1] == a[x2][y2 - 1])\n               add(dp[x1][y1][x2cc], dp[x1][y1 + 1][x2cc]);\n         }\n       }\n     }\n   }\n   if (a[1][1] != a[n][m]) dp[1][1][n % 2] = 0;\n   cout << dp[1][1][n % 2] << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t, n, x, y, good, bad;\n   scanf('%d', &t);\n   while (t--) {\n     scanf('%d%d%d', &n, &x, &y);\n     bad = min(n, x + y - 1);\n     if (x + y <= n)\n       good = 1;\n     else\n       good = min(n, x + y - n + 1);\n     printf('%d %d\n', good, bad);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int gcd(long long int a, long long int b) {\n   return b ? gcd(b, a % b) : a;\n }\n long long int lcm(long long int a, long long int b) {\n   return a * b / gcd(a, b);\n }\n int n, m, cnt[11][11], a[22], b[22], tr[11], mx;\n void bktk(int i) {\n   if (i == n + 1) {\n     int ans = 0;\n     memset(cnt, 0, sizeof(cnt));\n     for (int j = 1; j <= m; j++)\n       cnt[min(tr[a[j]], tr[b[j]])][max(tr[b[j]], tr[a[j]])]++;\n     for (int j = 1; j <= 6; j++)\n       for (int k = 1; k <= 6; k++)\n         if (cnt[j][k]) ans++;\n     mx = max(ans, mx);\n     return;\n   }\n   for (int j = 1; j <= 6; j++) {\n     tr[i] = j;\n     bktk(i + 1);\n   }\n }\n int main() {\n   cin >> n >> m;\n   if (n < 7) {\n     cout << m << endl;\n     return 0;\n   }\n   for (int i = 1; i <= m; i++) cin >> a[i] >> b[i];\n   bktk(1);\n   cout << mx << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long q;\n   cin >> q;\n   if (q == 1) {\n     cout << '1\n0\n';\n     return 0;\n   }\n   long long a = -1, b = -1;\n   for (long long d = 2; d * d <= q; d++) {\n     if (q % d) continue;\n     a = d;\n     b = q / d;\n     break;\n   }\n   if (a == -1) {\n     cout << '1\n0\n';\n     return 0;\n   }\n   for (long long d = 2; d * d <= b; d++) {\n     if (b % d) continue;\n     cout << '1\n' << a * d << '\n';\n     return 0;\n   }\n   cout << '2\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n using namespace std;\n const int MAX = 5e5 + 10;\n const long long MAX2 = 11;\n const long long MOD = 1000000007;\n const long long MOD2 = 1000000006;\n const long long INF = 2e18;\n const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};\n const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0};\n const double pi = acos(-1);\n const double EPS = 1e-9;\n const int block = 2000;\n long long n, k, ans;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n >> k;\n   ans = 1;\n   for (int i = 2; i <= k; ++i) ans = (ans * k) % MOD;\n   n -= k;\n   for (int i = 1; i <= n; ++i) ans = (ans * n) % MOD;\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void main0();\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   main0();\n   return 0;\n }\n const int dx[8] = {0, 1, -1, 0, 1, 1, -1, -1};\n const int dy[8] = {1, 0, 0, -1, 1, -1, -1, 1};\n const int N = 2e3 + 1;\n const int INF = 0x3f3f3f3f;\n const long long INFF = 0x3f3f3f3f3f3f3f3f;\n const int mod = 998244353;\n const double eps = 1e-6;\n const double Pi = acos(-1.0);\n mt19937 rnd(\n     (unsigned int)chrono::steady_clock::now().time_since_epoch().count());\n int n, m;\n char a[N][N];\n int ans[N][N];\n int vis[N][N], step;\n int incyc, cyclen;\n pair<int, int> cycp;\n void dfs(int x, int y) {\n   vis[x][y] = ++step;\n   int xt = x;\n   int yt = y;\n   if (a[x][y] == 'U')\n     xt--;\n   else if (a[x][y] == 'D')\n     xt++;\n   else if (a[x][y] == 'L')\n     yt--;\n   else\n     yt++;\n   if ((1 > xt) || (xt > n) || (1 > yt) || (yt > m)) {\n     vis[x][y] = 0;\n     ans[x][y] = 1;\n     return;\n   }\n   if (vis[xt][yt]) {\n     incyc = 1;\n     cyclen = vis[x][y] - vis[xt][yt] + 1;\n     vis[xt][yt] = 0;\n     vis[x][y] = 0;\n     ans[x][y] = cyclen;\n     return;\n   }\n   if (ans[xt][yt] == 0) {\n     dfs(xt, yt);\n   }\n   if (incyc)\n     ans[x][y] = cyclen;\n   else\n     ans[x][y] = ans[xt][yt] + 1;\n   if (vis[x][y] == 0) incyc = 0;\n   vis[x][y] = 0;\n }\n void main0() {\n   int T;\n   cin >> T;\n   while (T--) {\n     cin >> n >> m;\n     for (int i = 1; i <= n; ++i) {\n       for (int j = 1; j <= m; ++j) {\n         ans[i][j] = vis[i][j] = 0;\n       }\n     }\n     for (int i = 1; i <= n; ++i) {\n       cin >> a[i] + 1;\n     }\n     for (int i = 1; i <= n; ++i) {\n       for (int j = 1; j <= m; ++j) {\n         if (ans[i][j]) continue;\n         step = 0;\n         dfs(i, j);\n       }\n     }\n     pair<int, int> pos = {1, 1};\n     for (int i = 1; i <= n; ++i) {\n       for (int j = 1; j <= m; ++j) {\n         if (ans[i][j] > ans[pos.first][pos.second]) pos = {i, j};\n       }\n     }\n     cout << pos.first << ' ' << pos.second << ' ' << ans[pos.first][pos.second]\n          << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = int(1e5 + 5);\n vector<int> g[N];\n int cnt[N];\n void dfs(int v, int depth = 0) {\n   cnt[depth]++;\n   for (int to : g[v]) {\n     dfs(to, depth + 1);\n   }\n }\n int main() {\n   ios::sync_with_stdio(0);\n   int n;\n   cin >> n;\n   for (int i = 2; i <= n; i++) {\n     int p;\n     cin >> p;\n     g[p].push_back(i);\n   }\n   dfs(1);\n   int res = 0;\n   for (int i = 0; i <= n; i++) {\n     res += cnt[i] % 2;\n   }\n   cout << res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int ans[110000], add[110000];\n int n, m, a, cnt, me;\n char temp[3];\n int main() {\n   while (~scanf('%d%d', &n, &m)) {\n     for (int i = 1; i <= n; i++) ans[i] = 1, add[i] = 0;\n     ;\n     cnt = 0;\n     me = 0;\n     for (int i = 1; i <= m; i++) {\n       scanf('%s%d', temp, &a);\n       if (*temp == '+') {\n         if (!me || (me == a))\n           me = a;\n         else\n           ans[a] = 0;\n         add[a] = 1;\n         if (a != me && !add[me]) ans[me] = 0;\n         cnt++;\n       } else {\n         if (!me) me = a;\n         if (a != me && add[a] == 0) {\n           ans[me] = 0;\n           me = a;\n         }\n         if (add[a]) {\n           add[a] = 0;\n           cnt--;\n         }\n         if (cnt) ans[a] = 0;\n       }\n     }\n     int tt = 0;\n     bool fi = true;\n     for (int i = 1; i <= n; i++)\n       if (ans[i]) tt++;\n     printf('%d\n', tt);\n     for (int i = 1; i <= n; i++) {\n       if (ans[i]) {\n         if (!fi) printf(' ');\n         printf('%d', i);\n         if (fi) fi = false;\n       }\n     }\n     printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string str[1009];\n   int n, m;\n   while (cin >> n >> m) {\n     for (int i = 0; i < n; i++) cin >> str[i];\n     int ret = 0, cury = 0;\n     for (int i = 0; i < n; i++) {\n       int right = cury;\n       if (i % 2 == 0) {\n         for (int j = 0; j < m; j++)\n           if (str[i][j] == 'W') right = j;\n         int right1 = cury;\n         if (i < n - 1)\n           for (int j = 0; j < m; j++)\n             if (str[i + 1][j] == 'W') right1 = j;\n         right = max(right, right1);\n         ret += (right - cury);\n         cury = right;\n       } else {\n         int left = cury, left1 = cury;\n         for (int j = m - 1; j >= 0; j--)\n           if (str[i][j] == 'W') left = j;\n         if (i < n - 1)\n           for (int j = m - 1; j >= 0; j--)\n             if (str[i + 1][j] == 'W') left1 = j;\n         left = min(left, left1);\n         ret += (cury - left);\n         cury = left;\n       }\n     }\n     int row = 0;\n     for (int i = 0; i < n; i++)\n       for (int j = 0; j < m; j++)\n         if (str[i][j] == 'W') row = i;\n     ret += row;\n     cout << ret << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dis[3];\n int n;\n int main() {\n   scanf('%d', &n);\n   scanf('%d %d %d', &dis[0], &dis[1], &dis[2]);\n   int ans = 0;\n   n--;\n   int idx = 0;\n   while (n--) {\n     if (dis[idx] < dis[(idx + 1) % 3]) {\n       ans += dis[idx];\n       idx = (idx + 2) % 3;\n     } else {\n       ans += dis[(idx + 1) % 3];\n       idx = (idx + 1) % 3;\n     }\n   }\n   printf('%d\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxl = 1000 * 100 + 5;\n int n, k;\n string s;\n int dis[30][maxl];\n int main() {\n   cin >> n >> k >> s;\n   memset(dis, -1, sizeof dis);\n   for (int i = 0; i < 27; i++) {\n     queue<int> q;\n     for (int j = 0; j < k; j++)\n       if (s[j] == (char)(i + 'a')) {\n         q.push(j);\n         dis[i][j] = 0;\n       }\n     while (!q.empty()) {\n       int index = q.front();\n       q.pop();\n       if (index != 0)\n         if (dis[i][index - 1] == -1) {\n           dis[i][index - 1] = dis[i][index] + 1;\n           q.push(index - 1);\n         }\n       if (index != maxl - 1)\n         if (dis[i][index + 1] == -1) {\n           dis[i][index + 1] = dis[i][index] + 1;\n           q.push(index + 1);\n         }\n     }\n   }\n   for (int j = 0; j < n; j++) {\n     string tmp;\n     cin >> tmp;\n     long long int ans = 0;\n     for (int i = 0; i < tmp.size(); i++)\n       ans += (dis[tmp[i] - 'a'][i] == -1 ? tmp.size() : dis[tmp[i] - 'a'][i]);\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     string s(200, 'a');\n     cout << s << endl;\n     for (int i = 0; i < n; i++) {\n       int u;\n       cin >> u;\n       s[u] = s[u] == 'a' ? 'b' : 'a';\n       cout << s << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<vector<long long>> gr;\n vector<bool> used;\n vector<long long> tin, up;\n const long long Nmax = 400000;\n long long p[Nmax];\n long long sz[Nmax];\n long long timer = 0;\n long long diametr(long long u, vector<vector<long long>> gr) {\n   queue<long long> q;\n   long long n = (long long)(gr.size());\n   vector<long long> h(n + 1, -1);\n   q.push(u);\n   h[u] = 0;\n   long long ml = u;\n   while (!q.empty()) {\n     long long v = q.front();\n     q.pop();\n     for (long long x : gr[v]) {\n       if (h[x] == -1) {\n         h[x] = h[v] + 1;\n         if (h[x] > h[ml]) ml = x;\n         q.push(x);\n       }\n     }\n   }\n   vector<long long> prev(n + 1, -1);\n   h.assign(n + 1, -1);\n   q.push(ml);\n   h[ml] = 0;\n   long long ms = ml;\n   prev[ml] = ml;\n   while (!q.empty()) {\n     long long v = q.front();\n     q.pop();\n     for (long long x : gr[v]) {\n       if (prev[x] == -1) {\n         h[x] = h[v] + 1;\n         prev[x] = v;\n         if (h[x] > h[ms]) ms = x;\n         q.push(x);\n       }\n     }\n   }\n   vector<long long> res;\n   while (prev[ms] != ms) {\n     res.push_back(ms);\n     ms = prev[ms];\n   }\n   res.push_back(ms);\n   reverse((res).begin(), (res).end());\n   return (long long)(res.size()) - 1;\n }\n long long find(long long x) {\n   if (p[x] != x) {\n     p[x] = find(p[x]);\n   }\n   return p[x];\n }\n void merge(long long x, long long y) {\n   x = find(x);\n   y = find(y);\n   p[y] = x;\n }\n void restart(long long N) {\n   for (long long i = 0; i < N; ++i) {\n     sz[i] = 1;\n     p[i] = i;\n   }\n }\n vector<pair<long long, long long>> most;\n void dfs(long long u, long long p) {\n   used[u] = true;\n   tin[u] = timer++;\n   up[u] = tin[u];\n   for (long long v : gr[u]) {\n     if (used[v] && v != p) up[u] = min(up[u], tin[v]);\n     if (!used[v]) {\n       dfs(v, u);\n       up[u] = min(up[u], up[v]);\n       if (tin[u] < up[v]) {\n         most.emplace_back(u, v);\n       } else {\n         merge(u, v);\n       }\n     }\n   }\n }\n void solve() {\n   long long n, m;\n   cin >> n >> m;\n   gr.resize(n);\n   tin.assign(n, 0);\n   up.assign(n, 0);\n   used.assign(n, 0);\n   restart(n);\n   for (long long i = (0); i < (m); ++i) {\n     long long u, v;\n     cin >> u >> v;\n     u--;\n     --v;\n     gr[u].push_back(v);\n     gr[v].push_back(u);\n   }\n   dfs(0, -1);\n   vector<vector<long long>> gr2(n);\n   if (most.empty()) {\n     cout << 0;\n     return;\n   }\n   for (long long i = (0); i < ((long long)(most.size())); ++i) {\n     long long u = most[i].first, v = most[i].second;\n     u = find(u);\n     v = find(v);\n     gr2[u].push_back(v);\n     gr2[v].push_back(u);\n   }\n   long long v = most[0].first;\n   v = find(v);\n   cout << diametr(v, gr2);\n }\n signed main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   long long t;\n   t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n #pragma GCC target('sse4')\n using namespace std;\n using ll = long long;\n using vi = vector<int>;\n using pii = pair<int, int>;\n const int MX = 1e5 + 10;\n template <typename T>\n istream &operator>>(istream &is, vector<T> &v) {\n   for (auto i = begin(v); i != end(v); i++) is >> *i;\n   return is;\n }\n template <typename T>\n ostream &operator<<(ostream &os, const vector<T> &v) {\n   for (auto i = begin(v); i != end(v); i++)\n     os << *i << (i == end(v) - 1 ? '\n' : ' ');\n   return os;\n }\n template <typename T>\n inline void rd(T &s) {\n   s = 0;\n   T t = 1, k = getchar();\n   for (; k < '0' || k > '9'; k = getchar())\n     if (k == '-') t = -1;\n   for (; k >= '0' && k <= '9'; k = getchar())\n     s = (s << 1) + (s << 3) + (k ^ 48);\n   s *= t;\n }\n ll n, m, t;\n char a[1111][1111];\n ll b[1111][1111];\n ll dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};\n void solve() {\n   cin >> n >> m >> t;\n   for (register ll i = 1, ilen = (ll)(n); i <= ilen; ++i) cin >> (a[i] + 1);\n   queue<pii> q;\n   for (register ll i = 1, ilen = (ll)(n); i <= ilen; ++i)\n     for (register ll j = 1, jlen = (ll)(m); j <= jlen; ++j) {\n       if (a[i][j] == a[i + 1][j] || a[i][j] == a[i - 1][j] ||\n           a[i][j] == a[i][j + 1] || a[i][j] == a[i][j - 1])\n         b[i][j] = 1, q.push(make_pair(i, j));\n       else\n         b[i][j] = 2e18;\n     }\n   while (q.size()) {\n     ll x = q.front().first, y = q.front().second;\n     q.pop();\n     for (register ll i = 0, ilen = (ll)(4); i < ilen; ++i) {\n       ll nx = x + dx[i], ny = y + dy[i];\n       if (nx >= 1 && nx <= n && ny >= 1 && ny <= m) {\n         if (b[x][y] + 1 < b[nx][ny]) q.push(make_pair(nx, ny));\n         b[nx][ny] = min(b[nx][ny], b[x][y] + 1);\n       }\n     }\n   }\n   while (t--) {\n     ll x, y, p;\n     cin >> x >> y >> p;\n     if (p >= b[x][y] && (p - b[x][y]) % 2 == 0) {\n       if (a[x][y] == '1')\n         cout << '0' << '\n';\n       else\n         cout << '1' << '\n';\n     } else\n       cout << a[x][y] << '\n';\n   }\n }\n signed main() {\n   ll T = 1;\n   while (T--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = (int)1e6 + 5;\n void compute() {\n   int n, m;\n   scanf('%d %d', &n, &m);\n   vector<int> v(n);\n   for (int i = 0; i < n; ++i) scanf('%d', &v[i]);\n   vector<pair<int, int> > seg(m);\n   vector<vector<int> > lf(n), rg(n);\n   for (int i = 0; i < m; ++i) {\n     scanf('%d%d', &seg[i].first, &seg[i].second);\n     --seg[i].first;\n     --seg[i].second;\n     lf[seg[i].second].push_back(seg[i].first);\n     rg[seg[i].first].push_back(seg[i].second);\n   }\n   vector<int> add(n, 0);\n   vector<int> ansv(n, -inf);\n   int mn = v[0];\n   for (int i = 0; i < n; ++i) {\n     ansv[i] = max(ansv[i], v[i] - mn);\n     for (auto l : lf[i]) {\n       for (int j = l; j <= i; ++j) {\n         --add[j];\n         mn = min(mn, v[j] + add[j]);\n       }\n     }\n     mn = min(mn, v[i] + add[i]);\n   }\n   add = vector<int>(n, 0);\n   mn = v[n - 1];\n   for (int i = n - 1; i >= 0; --i) {\n     ansv[i] = max(ansv[i], v[i] - mn);\n     for (auto r : rg[i]) {\n       for (int j = i; j <= r; ++j) {\n         --add[j];\n         mn = min(mn, v[j] + add[j]);\n       }\n     }\n     mn = min(mn, v[i] + add[i]);\n   }\n   int res = *max_element(ansv.begin(), ansv.end());\n   vector<int> res2;\n   for (int i = 0; i < n; ++i) {\n     if (ansv[i] == res) {\n       for (int j = 0; j < m; ++j) {\n         if (!(seg[j].first <= i && seg[j].second >= i)) res2.push_back(j + 1);\n       }\n       break;\n     }\n   }\n   printf('%d\n%d\n', res, (int)res2.size());\n   for (auto i : res2) printf('%d ', i);\n   printf('\n');\n }\n int main() {\n   compute();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n, k;\n   bool odd = false, even = false;\n   cin >> n >> k;\n   if (n & 1) {\n     if (k > (n / 2 + 1)) {\n       even = true;\n       k -= (n / 2 + 1);\n     } else\n       odd = true;\n   } else {\n     if (k > n / 2) {\n       even = true;\n       k -= (n / 2);\n     } else\n       odd = true;\n   }\n   if (odd)\n     cout << 2 * k - 1 << endl;\n   else\n     cout << 2 * k << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize(3)\n using namespace std;\n bool Finish_read;\n template <class T>\n inline void read(T &x) {\n   Finish_read = 0;\n   x = 0;\n   int f = 1;\n   char ch = getchar();\n   while (!isdigit(ch)) {\n     if (ch == '-') f = -1;\n     if (ch == EOF) return;\n     ch = getchar();\n   }\n   while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();\n   x *= f;\n   Finish_read = 1;\n }\n template <class T>\n inline void print(T x) {\n   if (x / 10 != 0) print(x / 10);\n   putchar(x % 10 + '0');\n }\n template <class T>\n inline void writeln(T x) {\n   if (x < 0) putchar('-');\n   x = abs(x);\n   print(x);\n   putchar('\n');\n }\n template <class T>\n inline void write(T x) {\n   if (x < 0) putchar('-');\n   x = abs(x);\n   print(x);\n }\n const int maxn = 100005, maxnode = 16500005;\n int mx, my, mz, n, m, k, lx, rx, ly, ry, lz, rz, cnt, lc[maxnode], rc[maxnode],\n     lv[maxnode], rv[maxnode], rt[maxn << 2];\n inline bool Open(int x, int y, int z) {\n   return lx <= x && x <= rx && ly <= y && y <= ry && lz <= z && z <= rz;\n }\n inline void update(int &o, int l, int r, int y, int z) {\n   if (!o) o = ++cnt, rv[o] = mz + 1;\n   if (lz <= z) rv[o] = min(rv[o], z);\n   if (z <= rz) lv[o] = max(lv[o], z);\n   if (l == r) return;\n   int mid = (l + r) >> 1;\n   if (y <= mid)\n     update(lc[o], l, mid, y, z);\n   else\n     update(rc[o], mid + 1, r, y, z);\n }\n inline void modify(int o, int l, int r, int x, int y, int z) {\n   update(rt[o], 1, my, y, z);\n   if (l == r) return;\n   int mid = (l + r) >> 1;\n   if (x <= mid)\n     modify(o << 1, l, mid, x, y, z);\n   else\n     modify(o << 1 | 1, mid + 1, r, x, y, z);\n }\n inline bool getans(int o, int l, int r, int yl, int yr, int zl, int zr) {\n   if (!o) return 1;\n   if (yl <= l && r <= yr) return lv[o] < zl && zr < rv[o];\n   bool res = 1;\n   int mid = (l + r) >> 1;\n   if (yl <= mid) res &= getans(lc[o], l, mid, yl, yr, zl, zr);\n   if (yr > mid) res &= getans(rc[o], mid + 1, r, yl, yr, zl, zr);\n   return res;\n }\n inline bool query(int o, int l, int r, int xl, int xr, int yl, int yr, int zl,\n                   int zr) {\n   if (xl <= l && r <= xr) return getans(rt[o], 1, my, yl, yr, zl, zr);\n   bool res = 1;\n   int mid = (l + r) >> 1;\n   if (xl <= mid) res &= query(o << 1, l, mid, xl, xr, yl, yr, zl, zr);\n   if (xr > mid) res &= query(o << 1 | 1, mid + 1, r, xl, xr, yl, yr, zl, zr);\n   return res;\n }\n inline void solve(int x, int y, int z) {\n   if (Open(x, y, z)) return (void)puts('OPEN');\n   if (query(1, 1, mx, min(lx, x), max(rx, x), min(ly, y), max(ry, y),\n             min(lz, z), max(rz, z)))\n     return (void)puts('UNKNOWN');\n   return (void)puts('CLOSED');\n }\n int main() {\n   read(mx), read(my), read(mz), read(n), read(m), read(k);\n   lx = mx, ly = my, lz = mz;\n   for (int i = 1, x, y, z; i <= n; ++i) {\n     read(x), read(y), read(z);\n     lx = min(lx, x), rx = max(rx, x);\n     ly = min(ly, y), ry = max(ry, y);\n     lz = min(lz, z), rz = max(rz, z);\n   }\n   for (int i = 1, x, y, z; i <= m; ++i) {\n     read(x), read(y), read(z);\n     if (Open(x, y, z)) return 0 * puts('INCORRECT');\n     modify(1, 1, mx, x, y, z);\n   }\n   puts('CORRECT');\n   for (int i = 1, x, y, z; i <= k; ++i)\n     read(x), read(y), read(z), solve(x, y, z);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[(200020)], b[(200020)], close[100][2];\n set<pair<long long, long long> > vis;\n signed main() {\n   long long n;\n   cin >> n;\n   for (long long i = 1; i <= n; i++) scanf('%lld', &a[i]);\n   for (long long i = 1; i <= n; i++) b[i] = b[i - 1] + a[i];\n   long long ans = 0;\n   for (long long i = 1; i <= n; i++) {\n     if (i >= 3)\n       for (long long k = 0; k < 30; k++)\n         if (!(a[i] & (1 << k))) {\n           if (close[k][0] && i - close[k][0] > 1) {\n             if ((a[i] ^ a[close[k][0]]) == b[i - 1] - b[close[k][0]]) {\n               if (vis.find(make_pair(close[k][0], i)) != vis.end()) continue;\n               ans++;\n               vis.insert(make_pair(close[k][0], i));\n             }\n           }\n           if (close[k][1] && i - close[k][1] > 1) {\n             if ((a[i] ^ a[close[k][1]]) == b[i - 1] - b[close[k][1]]) {\n               if (vis.find(make_pair(close[k][1], i)) != vis.end()) continue;\n               ans++;\n               vis.insert(make_pair(close[k][1], i));\n             }\n           }\n         }\n     for (long long k = 0; k < 30; k++) {\n       if (a[i] & (1 << k)) {\n         close[k][1] = close[k][0];\n         close[k][0] = i;\n       }\n     }\n   }\n   memset(close, 0, sizeof(close));\n   for (long long i = n; i >= 1; i--) {\n     if (n - i + 1 >= 3)\n       for (long long k = 0; k < 30; k++)\n         if (!(a[i] & (1 << k))) {\n           if (close[k][0] && close[k][0] - i > 1) {\n             if ((a[i] ^ a[close[k][0]]) == b[close[k][0] - 1] - b[i]) {\n               if (vis.find(make_pair(i, close[k][0])) != vis.end()) continue;\n               ans++;\n               vis.insert(make_pair(i, close[k][0]));\n             }\n           }\n           if (close[k][1] && close[k][1] - i > 1) {\n             if ((a[i] ^ a[close[k][1]]) == b[close[k][1] - 1] - b[i]) {\n               if (vis.find(make_pair(i, close[k][1])) != vis.end()) continue;\n               ans++;\n               vis.insert(make_pair(i, close[k][1]));\n             }\n           }\n         }\n     for (long long k = 0; k < 30; k++) {\n       if (a[i] & (1 << k)) {\n         close[k][1] = close[k][0];\n         close[k][0] = i;\n       }\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, s, i, j, k, a, b, w, l1, l2, c, rt, lw;\n double v[109][109], t[109][109], tp, tc, p1, p2, t1, t2;\n int main() {\n   cin >> n >> s;\n   for (i = 0; i < n; i++) {\n     cin >> k;\n     for (j = 0; j < k; j++) cin >> v[i][j] >> t[i][j];\n     t[i][k] = 9999999.0;\n   }\n   for (i = 0; i < n; i++) {\n     for (j = i + 1; j < n; j++) {\n       p1 = p2 = 0.0;\n       w = lw = c = 0;\n       t1 = t[i][0];\n       t2 = t[j][0];\n       for (l1 = l2 = 0;;) {\n         a = b = 0;\n         if (t1 > t2) {\n           tc = t2;\n           b = 1;\n         } else {\n           if (t1 < t2) {\n             tc = t1;\n             a = 1;\n           } else {\n             tc = t1;\n             a = b = 1;\n           }\n         }\n         t1 -= tc;\n         t2 -= tc;\n         p1 += v[i][l1] * tc;\n         p2 += v[j][l2] * tc;\n         if (w == 0) {\n           if (p1 > p2) {\n             w = 1;\n             if (lw == 2) c++;\n           }\n           if (p1 < p2) {\n             w = 2;\n             if (lw == 1) c++;\n           }\n         } else {\n           if (w == 1) {\n             if (p1 < p2) {\n               c++;\n               w = 2;\n             }\n             if (p1 == p2) lw = 1, w = 0;\n           } else {\n             if (p1 > p2) {\n               c++;\n               w = 1;\n             }\n             if (p1 == p2) lw = 2, w = 0;\n           }\n         }\n         if (a == 1) {\n           l1++;\n           t1 = t[i][l1];\n         }\n         if (b == 1) {\n           l2++;\n           t2 = t[j][l2];\n         }\n         if (p1 >= s || p2 >= s) break;\n       }\n       rt += c;\n     }\n   }\n   cout << rt;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main(void) {\n   double a, v, l, d, w, t = 0;\n   scanf('%lf%lf%lf%lf%lf', &a, &v, &l, &d, &w);\n   if (2 * a * d <= w * w || w >= v) {\n     if (l * a * 2 >= v * v) {\n       t += v / a;\n       t += (l - v * v / (2 * a)) / v;\n     } else {\n       t += sqrt(2 * l / a);\n     }\n   } else if (2 * a * d >= 2 * v * v - w * w) {\n     t += v / a;\n     t += (v - w) / a;\n     t += (d - (2 * v * v - w * w) / (2 * a)) / v;\n     if (2 * a * (l - d) > v * v - w * w) {\n       t += (v - w) / a;\n       t += (l - d - (v * v - w * w) / (2 * a)) / v;\n     } else {\n       t += sqrt(2 * (l - d) / a + w * w / (a * a)) - w / a;\n     }\n   } else {\n     t += (sqrt(a * d + w * w / 2) + sqrt(a * d + w * w / 2) - w) / a;\n     if (2 * a * (l - d) > v * v - w * w) {\n       t += (v - w) / a;\n       t += (l - d - (v * v - w * w) / (2 * a)) / v;\n     } else {\n       t += sqrt(2 * (l - d) / a + w * w / (a * a)) - w / a;\n     }\n   }\n   printf('%f\n', t);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int t;\n   scanf('%d', &t);\n   while (t--) {\n     long long int n, k;\n     scanf('%lld %lld', &n, &k);\n     long long int ans = 0;\n     ans += (n / k) * k;\n     if (n - ans > k / 2)\n       ans += k / 2;\n     else\n       ans = n;\n     printf('%lld\n', ans);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 105;\n int freq[N];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < m; i++) {\n     int type;\n     cin >> type;\n     freq[type]++;\n   }\n   int start = 1, end = 100;\n   while (start <= end) {\n     int mid = (start + end) >> 1;\n     int persons = 0;\n     for (int types = 1; types <= 100; types++) {\n       persons += (freq[types] / mid);\n     }\n     if (persons >= n)\n       start = mid + 1;\n     else\n       end = mid - 1;\n   }\n   cout << end << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long TC = 1;\n   while (TC--) {\n     long long n;\n     cin >> n;\n     vector<long long> a(n);\n     for (long long i = 0; i < n; i++) cin >> a[i];\n     long long lcnt = 1, rcnt = 1;\n     for (long long i = 1; i < n; i++) {\n       if (a[i] > a[i - 1])\n         lcnt++;\n       else\n         break;\n     }\n     for (long long i = n - 1 - 1; i >= 0; i--) {\n       if (a[i] > a[i + 1])\n         rcnt++;\n       else\n         break;\n     }\n     if ((a[0] >= a[n - 1] && lcnt % 2) || (a[0] <= a[n - 1] && rcnt % 2)) {\n       cout << 'Alice\n';\n       continue;\n     } else if (lcnt % 2 == 0 && rcnt % 2 == 0) {\n       cout << 'Bob\n';\n     } else {\n       cout << 'Alice\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 100005;\n const double eps = 1.0e-8;\n const double pi = acos(-1.0);\n complex<double> p[MAXN], P;\n double cross(complex<double> a, complex<double> b) {\n   return (conj(a) * b).imag();\n }\n double check(complex<double> a, complex<double> b) {\n   double l = 0, r = 1;\n   complex<double> v = b - a;\n   for (int i = 0; i < 50; i++) {\n     double mid = (l + r) * 0.5;\n     double midd = (mid + r) * 0.5;\n     complex<double> x = a + v * mid, y = a + v * midd;\n     if (abs(P - x) + eps < abs(P - y)) {\n       r = midd;\n     } else {\n       l = mid;\n     }\n   }\n   return abs(P - (a + v * l));\n }\n int main() {\n   int n;\n   cin >> n;\n   int x, y;\n   cin >> x >> y;\n   P = complex<double>(x, y);\n   for (int i = 0; i < n; i++) {\n     scanf('%d %d', &x, &y);\n     p[i] = complex<double>(x, y);\n   }\n   p[n] = p[0];\n   double r1 = 1.0e20, r2 = 0;\n   for (int i = 0; i < n; i++) {\n     r1 = min(r1, check(p[i], p[i + 1]));\n     r2 = max(r2, abs(P - p[i]));\n   }\n   printf('%.10f\n', pi * (r2 * r2 - r1 * r1));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 100000;\n int f[MAXN + 5];\n int main() {\n   memset(f, 0, sizeof(f));\n   int m = 0, a = 0, r0 = 0, b = 0, ans = 1;\n   cin >> a >> b >> m >> r0;\n   f[r0] = 1;\n   for (int i = 2;; ++i) {\n     r0 = (a * r0 + b) % m;\n     ++ans;\n     if (f[r0] != 0) {\n       ans = ans - f[r0];\n       break;\n     }\n     f[r0] = ans;\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int n, m, count = 0;\n   cin >> n >> m;\n   int x = min(n, m);\n   n = n - x;\n   m = m - x;\n   int rest = (n / 2) + (m / 2);\n   cout << x << ' ' << rest << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     unordered_map<char, int> mp;\n     int n;\n     cin >> n;\n     string arr[n];\n     for (int i = 0; i < n; i++) {\n       cin >> arr[i];\n       for (auto c : arr[i]) {\n         mp[c]++;\n       }\n     }\n     bool ok = true;\n     for (auto p : mp) {\n       if (p.second % n != 0) {\n         ok = false;\n         break;\n       }\n     }\n     cout << ((ok) ? 'YES\n' : 'NO\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int a, b, c, l;\n   cin >> a >> b >> c >> l;\n   long long int Total = (l + 1) * (l + 2) * (l + 3) / 6;\n   for (long long int la = 0; la <= l; la++) {\n     long long int mini = min(a - b - c + la, l - la);\n     if (mini < 0) continue;\n     long long int wrong = (mini + 1) * (mini + 2) / 2;\n     Total -= wrong;\n   }\n   for (long long int lb = 0; lb <= l; lb++) {\n     long long int mini = min(b - a - c + lb, l - lb);\n     if (mini < 0) continue;\n     long long int wrong = (mini + 1) * (mini + 2) / 2;\n     Total -= wrong;\n   }\n   for (long long int lc = 0; lc <= l; lc++) {\n     long long int mini = min(c - b - a + lc, l - lc);\n     if (mini < 0) continue;\n     long long int wrong = (mini + 1) * (mini + 2) / 2;\n     Total -= wrong;\n   }\n   cout << Total << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n \n const int MAX = 1 << 20;\n bitset<MAX> dpgl, mv, dp[20];\n map<char, int> to;\n char rv[20];\n int cnt[20], le[20], ri[20], n, A, B, b;\n \n void solve(int ms) {\n     int L = 1e9, R = -1, tot = 0;\n     vector<int> tr, chr, oth;\n     for(int i = 0; i < b; i++) {\n         if(ms & (1 << i)) {\n             L = min(L, le[i]);\n             R = max(R, ri[i]);\n             tot += cnt[i];\n             chr.push_back(i);\n             if(dp[i][ms ^ (1 << i)])\n                 dp[i][ms] = dpgl[ms] = 1;\n         }\n         else\n             oth.push_back(i);\n     }\n \n     if(tot >= ((R - L + 1) * A + B - 1) / B)\n         mv[ms] = 1;\n \n     if(oth.empty())\n         return;\n \n     sort(chr.begin(), chr.end(), [&](int a, int b){ return le[a] < le[b]; });\n     int cms = 0;\n     for(auto c : chr) {\n         cms |= (1 << c);\n         if(mv[cms] && dpgl[cms] && dp[oth[0]][ms ^ cms]) {\n             for(auto tc : oth)\n                 dp[tc][ms] = 1;\n             return;\n         }\n     }\n }\n \n int main() {\n     ios_base::sync_with_stdio(false);\n     cin.tie(0);\n \n     cin >> n >> A >> B;\n     string s;\n     cin >> s;\n \n     for(auto &c : s) {\n         if(!to.count(c)) {\n             rv[b] = c;\n             to[c] = b++;\n         }\n     }\n \n     for(int i = 0; i < s.size(); i++) {\n         cnt[to[s[i]]]++;\n         ri[to[s[i]]] = i;\n     }\n     for(int i = s.size() - 1; i >= 0; i--)\n         le[to[s[i]]] = i;\n \n     dpgl[0] = mv[0] = 1;\n     for(int i = 0; i < b; i++) {\n         dp[i][0] = dp[i][1 << i] = 1;\n         dpgl[1 << i] = 1;\n     }\n \n     for(int i = 1; i < (1 << b); i++)\n         solve(i);\n \n     vector<char> ans;\n \n     for(int i = 0; i < b; i++)\n         if(dp[i][(1 << b) - 1])\n             ans.push_back(rv[i]);\n \n     sort(ans.begin(), ans.end());\n \n     cout << ans.size();\n     for(auto &c : ans)\n         cout << ' ' << c;\n     cout << '\n';\n \n     /*for(int i = 0; i < (1 << b); i++) {\n         for(int j = 0; j < b; j++)\n             cout << bitset<4>(i) << ' ' << j << ' ' << dp[j][i] << '\n';\n     }\n \n     cout << '\n';*/\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1e9+7, M = (1e9+7), MAXN = 1 * 2e5;\n int A[MAXN], C[MAXN];\n \n \n \n int64_t modpow(int64_t a, int64_t b) {\n     int64_t res = 1;\n     for(; b; b >>= 1) {\n         if(b&1)\n             res=res*a%M;\n         a=a*a%M;\n     }\n     return res;\n }\n void solve() {\n     const int MOD = M;\n     int N, M;\n     cin >> N >> M;\n     vector<string> G(N);\n     for(int i = 0; i < N; i++)\n         cin >> G[i];\n \n     int cnt = 0;\n     for(int i = 0; i < N; i++)\n         cnt += count(G[i].begin(), G[i].end(), '#');\n     cerr << 'Count: ' << cnt << endl;\n     int64_t x = modpow(2, cnt);\n     if(cnt == N * M) {\n         cout << (x - 1 + MOD) % MOD << endl;\n     } else {\n         cout << modpow(2, cnt) << endl;\n     }\n }\n int main() {\n     cin.tie(0)->sync_with_stdio(0);\n     int T; cin >> T;\n \n     while(T--) {\n         solve();\n     }\n }\n "}
+{"func_code_string": "\n #include <iostream>\n #include <fstream>\n #include <vector>\n #include <algorithm>\n #include <cmath>\n #include <iomanip>\n #include <cstring>\n \n std::ifstream fin('input.txt');\n std::ofstream fout('output.txt');\n \n int main(){\n     std::ios_base::sync_with_stdio(false);\n     std::cin.tie(NULL);\n     std::cout.tie(NULL);\n     std::cout << std::setprecision(6) << std::fixed << '\n';\n     int Q;\n     std::cin >> Q;\n     while(Q --){\n         int n, m;\n         std::cin >> n >> m;\n         int x[n], pos;\n         long double ans = 0;\n         for(int i=0; i<n; i++) std::cin >> x[i];\n \n         for(pos=n-1; pos>=0 and x[pos] == pos+1; pos--);\n \n         if(pos == -1) ans = 1;\n \n         while(m --){\n             int p;\n             long double prob;\n             std::cin >> p >> prob; p--;\n             if(p >= pos){\n                 ans = 1.0 - (1.0 - ans) * (1.0 - prob);\n             }\n         }\n         std::cout << ans << '\n';\n     }\n \n     return 0;\n \n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100010;\n long long int A[N];\n vector<int> g[N];\n long long int dfs(int x, int p) {\n   A[x] = 1;\n   for (int i = 0; i < g[x].size(); ++i) {\n     int y = g[x][i];\n     if (y == p) continue;\n     A[x] += dfs(y, x);\n   }\n   return A[x];\n }\n long double E[N];\n void solve(int x, int p) {\n   long long int n = (long long int)g[x].size();\n   for (int i = 0; i < g[x].size(); ++i) {\n     int y = g[x][i];\n     if (y == p) continue;\n     E[y] = E[x] + 1;\n     long double med = (A[x] - 1 - A[y]) / (long double)(n - 1);\n     if (g[x].size() != 1) {\n       E[y] += (med * (n - 1)) / (2.0);\n     }\n     solve(y, x);\n   }\n }\n int main(void) {\n   ios::sync_with_stdio(false);\n   int n;\n   cin >> n;\n   for (int i = 2; i <= n; ++i) {\n     int x;\n     cin >> x;\n     g[x].push_back(i);\n     g[i].push_back(x);\n   }\n   E[1] = 1.0;\n   dfs(1, -1);\n   solve(1, -1);\n   cout.precision(10);\n   for (int i = 1; i <= n; ++i) {\n     cout << fixed << E[i] << ' ';\n   }\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 1200;\n int x, y;\n bool run() {\n   bool fox = true;\n   while (1) {\n     if (fox) {\n       if (x == 0) {\n         if (y >= 22) {\n           y -= 22;\n         } else {\n           return false;\n         }\n       } else if (x == 1) {\n         if (y >= 12) {\n           y -= 12;\n         } else {\n           return false;\n         }\n       } else {\n         if (y >= 2) {\n           x -= 2;\n           y -= 2;\n         } else {\n           return false;\n         }\n       }\n     } else {\n       if (y >= 22) {\n         y -= 22;\n       } else if (y >= 12) {\n         y -= 12;\n         if (x == 0) {\n           return true;\n         } else {\n           x--;\n         }\n       } else if (y >= 2) {\n         y -= 2;\n         if (x < 2) {\n           return true;\n         } else {\n           x -= 2;\n         }\n       } else {\n         return true;\n       }\n     }\n     fox ^= 1;\n   }\n   return false;\n }\n int main() {\n   scanf('%d%d', &x, &y);\n   if (run()) {\n     puts('Ciel');\n   } else {\n     puts('Hanako');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<int, long long> 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<long long> 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 <bits/stdc++.h>\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<bits/stdc++.h>\n #include<string.h>\n #define int long long\n #include<vector>\n #define rep(i,a,b)        for(int i=a;i<b;i++)\n #define pb                push_back\n #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);\n using namespace std;\n const int N=2e5+5;\n  \n vector<int> 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 <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   int m;\n   int k;\n   vector<vector<int> > A;\n   cin >> n >> m >> k;\n   for (int i = 0; i < n; i++) {\n     vector<int> 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<int> 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 <bits/stdc++.h>\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<item> S[maxh];\n map<int, int> 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<item>::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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int N, K;\n long double ans, s;\n int R[1000010], data[100010];\n int v[1000010], c[1000010];\n int STv[20][1000010], STc[20][1000010];\n int calcv(int l, int r) {\n   int delta = r - l + 1;\n   int t = log(delta) / log(2);\n   return max(STv[t][l], STv[t][r - (1 << t) + 1]);\n }\n int calcc(int l, int r) {\n   int delta = r - l + 1;\n   int t = log(delta) / log(2);\n   return min(STc[t][l], STc[t][r - (1 << t) + 1]);\n }\n int main() {\n   scanf('%d%d', &N, &K);\n   for (int i = 1; i <= N; i++) scanf('%d', &v[i]), v[i] *= 100;\n   for (int i = 1; i <= N; i++) scanf('%d', &c[i]);\n   for (int i = 1; i <= N; i++) STv[0][i] = v[i], STc[0][i] = c[i];\n   for (int step = 1; step <= 19; step++)\n     for (int i = 1; i <= N; i++) {\n       STv[step][i] = STv[step - 1][i];\n       STc[step][i] = STc[step - 1][i];\n       int x = i + (1 << (step - 1));\n       if (x <= N) {\n         STv[step][i] = max(STv[step][i], STv[step - 1][x]);\n         STc[step][i] = min(STc[step][i], STc[step - 1][x]);\n       }\n     }\n   R[0] = 1;\n   for (int l = 1; l <= N; l++) {\n     R[l] = R[l - 1];\n     for (int r = max(R[l - 1], l); r <= N; r++)\n       if (calcv(l, r) <= calcc(l, r))\n         R[l] = r;\n       else\n         break;\n   }\n   for (int l = 1; l <= N; l++) {\n     if (R[l] < N && min(calcv(l, R[l]), calcc(l, R[l])) <\n                         min(calcv(l, R[l] + 1), calcc(l, R[l] + 1)))\n       R[l]++;\n     data[l] = min(calcv(l, R[l]), calcc(l, R[l]));\n   }\n   sort(data + 1, data + N + 1);\n   s = double(K) / (N - K + 1);\n   for (int l = 1; l + K - 1 <= N; l++) {\n     s = s / (N - l + 1) * (N - K - l + 2);\n     ans = ans + data[l] * s;\n   }\n   printf('%.15lf', double(ans));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int i;\n   char a[1000];\n   gets(a);\n   for (i = 0; i < strlen(a); i++) {\n     printf('%c', a[i]);\n   }\n   for (i = strlen(a) - 1; i >= 0; i--) {\n     printf('%c', a[i]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 42, K = 11;\n int n, k, cnt, mark[N], nw[K];\n vector<long long> v[K], mask[K];\n void do_it(long long u, int x) {\n   for (int i = 0; i < nw[x] + 1; i++) {\n     int cnt = i + __builtin_popcountll(u & mask[x].back());\n     v[x + 1].push_back((u & (1ll << n) - 1 - mask[x].back()) | mask[x][cnt]);\n   }\n }\n int main() {\n   cin >> n >> k;\n   for (int i = 0; i < k; i++) {\n     int x, u;\n     long long msk = 0;\n     mask[i].push_back(0);\n     cin >> x;\n     for (int j = 0; j < x; j++) {\n       cin >> u;\n       u--;\n       msk |= (1ll << u);\n       mask[i].push_back(msk);\n       if (!mark[u]) {\n         cnt++;\n         nw[i]++;\n         mark[u] = 1;\n       }\n     }\n   }\n   v[0].push_back(0);\n   for (int i = 0; i < k; i++) {\n     for (int j = 0; j < v[i].size(); j++) {\n       do_it(v[i][j], i);\n     }\n   }\n   if (n != cnt && n > 1) return cout << 'REJECTED' << endl, 0;\n   for (int i = 0; i < v[k].size(); i++) {\n     int cnt = __builtin_popcountll(v[k][i]);\n     if ((1ll << cnt) - 1 != v[k][i]) return cout << 'REJECTED' << endl, 0;\n   }\n   cout << 'ACCEPTED' << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long PRIME = 1000000007;\n long long n, m, k;\n long long maxm = (long long)(-10e13);\n long long a[100005][6];\n long long max_in_range[100005][6][20];\n long long ans[6];\n long long times(long long length) {\n   long long cnt = 0;\n   while (length >= 2) {\n     length /= 2;\n     cnt++;\n   }\n   return cnt;\n }\n void calculate(long long index, long long length) {\n   long long t = times(length);\n   for (long long d = 1; d <= m; d++) {\n     ans[d] = max(max_in_range[index][d][t],\n                  max_in_range[index + length - (1 << t)][d][t]);\n   }\n }\n long long query(long long index, long long length) {\n   long long t = times(length);\n   long long sum = 0;\n   for (long long d = 1; d <= m; d++) {\n     sum += max(max_in_range[index][d][t],\n                max_in_range[index + length - (1 << t)][d][t]);\n   }\n   return sum;\n }\n long long search(long long index, long long startlength, long long endlength) {\n   if (startlength == endlength) {\n     return startlength;\n   }\n   if (endlength - startlength == 1) {\n     if (query(index, endlength) <= k) {\n       return endlength;\n     }\n     return startlength;\n   }\n   long long mid = (startlength + endlength) / 2;\n   long long val = query(index, mid);\n   if (val > k) {\n     return search(index, startlength, mid - 1);\n   } else {\n     return search(index, mid, endlength);\n   }\n }\n void solve() {\n   cin >> n >> m >> k;\n   for (long long i = 1; i <= n; i++) {\n     for (long long j = 1; j <= m; j++) {\n       cin >> a[i][j];\n     }\n   }\n   long long maxallowed = 0;\n   for (long long p = 0; p < 20; p++) {\n     for (long long i = 1; i <= n; i++) {\n       long long sum = 0;\n       for (long long d = 1; d <= m; d++) {\n         if (p == 0) {\n           max_in_range[i][d][p] = a[i][d];\n         } else if (i + (1 << p) - 1 > n) {\n           max_in_range[i][d][p] = (long long)(10e13);\n         } else {\n           max_in_range[i][d][p] =\n               max(max_in_range[i][d][p - 1],\n                   max_in_range[i + (1 << (p - 1))][d][p - 1]);\n         }\n         sum += max_in_range[i][d][p];\n       }\n       if (sum <= k) {\n         maxallowed = p;\n       }\n     }\n   }\n   for (long long i = 1; i <= n; i++) {\n     long long sum = 0;\n     for (long long d = 1; d <= m; d++) {\n       sum += max_in_range[i][d][maxallowed];\n     }\n     if (sum > k) {\n       continue;\n     } else {\n       long long l = search(i, (1 << maxallowed), (1 << (maxallowed + 1)) - 1);\n       if (l >= maxm) {\n         calculate(i, l);\n         maxm = l;\n       }\n     }\n   }\n   for (long long d = 1; d <= m; d++) {\n     cout << ans[d] << ' ';\n   }\n }\n signed main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int max(long long int a, long long int b) {\n   if (a >= b)\n     return a;\n   else\n     return b;\n }\n long long int min(long long int a, long long int b) {\n   if (a >= b)\n     return b;\n   else\n     return a;\n }\n long long int diff(long long int a, long long int b) {\n   if (a >= b)\n     return a - b;\n   else\n     return b - a;\n }\n long long int mod(long long int a) {\n   if (a >= 0)\n     return a;\n   else\n     return -a;\n }\n void pairsort(int a[], int b[], int n) {\n   pair<int, int> pairt[n];\n   for (int i = 0; i < n; i++) {\n     pairt[i].first = a[i];\n     pairt[i].second = b[i];\n   }\n   sort(pairt, pairt + n);\n   for (int i = 0; i < n; i++) {\n     a[i] = pairt[i].first;\n     b[i] = pairt[i].second;\n   }\n }\n int gcd(int a, int b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   char c;\n   cin >> c;\n   string s1, s2;\n   char s[9] = {'6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A'};\n   cin >> s1 >> s2;\n   int ind1, ind2;\n   if (s1[1] == s2[1]) {\n     for (int i = 0; i < 9; i++)\n       if (s[i] == s1[0]) ind1 = i;\n     for (int i = 0; i < 9; i++)\n       if (s[i] == s2[0]) ind2 = i;\n     if (ind1 > ind2)\n       cout << 'YES';\n     else\n       cout << 'NO';\n   } else {\n     if (s1[1] == c)\n       cout << 'YES';\n     else\n       cout << 'NO';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct p {\n   int x, y, z;\n };\n int c[102][102][102] = {0};\n bool ck(int x, int y, int z) {\n   if (!c[x][y][z]) return false;\n   if (c[x - 1][y][z] && c[x + 1][y][z]) return true;\n   if (c[x][y - 1][z] && c[x][y + 1][z]) return true;\n   if (c[x][y][z - 1] && c[x][y][z + 1]) return true;\n   if (c[x - 1][y][z] && c[x][y + 1][z] && !c[x - 1][y + 1][z]) return true;\n   if (c[x - 1][y][z] && c[x][y][z + 1] && !c[x - 1][y][z + 1]) return true;\n   if (c[x][y - 1][z] && c[x + 1][y][z] && !c[x + 1][y - 1][z]) return true;\n   if (c[x][y - 1][z] && c[x][y][z + 1] && !c[x][y - 1][z + 1]) return true;\n   if (c[x][y][z - 1] && c[x + 1][y][z] && !c[x + 1][y][z - 1]) return true;\n   if (c[x][y][z - 1] && c[x][y + 1][z] && !c[x][y + 1][z - 1]) return true;\n   return false;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(nullptr);\n   int n, m, k;\n   cin >> n >> m >> k;\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= m; ++j) {\n       string r;\n       cin >> r;\n       for (int l = 1; l <= k; ++l) c[i][j][l] = r[l - 1] == '1' ? 1 : 0;\n     }\n   }\n   int ans = 0;\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= m; ++j) {\n       for (int l = 1; l <= k; ++l) {\n         if (ck(i, j, l)) ans++;\n       }\n     }\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int BIT = (1 << 17), M = 110, N = 25;\n int n, m, cnt[BIT], a[M];\n long long f[BIT][N], b[N], p[N], year;\n void solve(int x) {\n   memset(f, 0, sizeof(f));\n   f[0][0] = 1;\n   int maxb = (1 << n);\n   for (int i = 0; i < maxb; i++) {\n     for (int j = 0; j <= n; j++) {\n       int y = cnt[i] + 1;\n       if (b[y]) {\n         if ((a[b[y]] & i) != a[b[y]]) continue;\n         if ((1 << (b[y] - 1) & i) == (1 << b[y] - 1)) continue;\n         f[i | (1 << b[y] - 1)][j] += f[i][j];\n       } else {\n         for (int k = 1; k <= n; k++) {\n           if (!(i & (1 << k - 1))) {\n             if ((a[k] & i) != a[k]) continue;\n             if (k == x)\n               f[i | (1 << k - 1)][y] += f[i][j];\n             else\n               f[i | (1 << k - 1)][j] += f[i][j];\n           }\n         }\n       }\n     }\n   }\n }\n int main() {\n   scanf('%d%lld%d', &n, &year, &m);\n   year -= 2000;\n   for (int i = 1; i < BIT; i++) cnt[i] = cnt[i ^ (i & (-i))] + 1;\n   for (int i = 1; i <= m; i++) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     a[y] |= (1 << x - 1);\n   }\n   for (int i = 1; i <= n; i++) {\n     solve(i);\n     long long sum = 0;\n     for (int j = 1; j <= n; j++) {\n       if (!b[j] && sum + f[(1 << n) - 1][j] >= year) {\n         b[j] = i;\n         p[i] = j;\n         year -= sum;\n         break;\n       }\n       sum += f[(1 << n) - 1][j];\n     }\n     if (!p[i]) {\n       puts('The times have changed');\n       return 0;\n     }\n   }\n   for (int i = 1; i <= n; i++) printf('%lld ', p[i]);\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n multiset<int> all[40];\n long long s[40];\n int getpos(int x) {\n   int ret = 0;\n   while ((1 << ret) < x) ret++;\n   return ret;\n }\n void check() {\n   long long tot = 0LL;\n   int ret = 0;\n   for (int i = 0; i <= 31; i++) {\n     ret += all[i].size();\n     ret -= (all[i].size() && *(all[i].begin()) > 2 * tot);\n     tot += s[i];\n   }\n   cout << ret << '\n';\n }\n int main() {\n   int q;\n   cin >> q;\n   while (q--) {\n     string op;\n     int x;\n     cin >> op >> x;\n     int id = getpos(x);\n     if (op == '+') {\n       s[id] += x;\n       all[id].insert(x);\n     } else {\n       s[id] -= x;\n       all[id].erase(all[id].find(x));\n     }\n     check();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, c, r[200001], u, v, i, t, k;\n vector<long long> graph[200001], ans;\n bool dfs(long long x, long long p) {\n   long long s = 0;\n   for (auto i : graph[x])\n     if (i != p) s += dfs(i, x);\n   if (r[x] && !s) ans.push_back(x);\n   return s + (long long)(r[x] && r[p]);\n }\n int main() {\n   cin >> n;\n   for (i = 0; i < n - 1; i++) {\n     cin >> u >> v >> t, graph[u].push_back(v), graph[v].push_back(u);\n     if (t == 2) r[u] = 1, r[v] = 1;\n   }\n   dfs(1, 0);\n   for (cout << ans.size() << endl, i = 0; i < ans.size(); i++)\n     cout << ans[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int n0 = 1003, m = 1e5, mod = 998244353;\n int n, k, a[n0], dp[2][n0], b[n0];\n int calc(int gap) {\n   for (int i = 1; i <= n; i++)\n     b[i] = upper_bound(a + 1, a + n + 1, a[i] - gap) - a - 1;\n   memset(&dp, 0, sizeof(dp));\n   for (int j = 0; j <= n; j++) dp[0][j] = 1;\n   for (int i = 1; i <= k; i++) {\n     dp[i & 1][0] = 0;\n     for (int j = 1; j <= n; j++) {\n       int &x = dp[i & 1][j];\n       x = dp[i & 1][j - 1] + dp[(i - 1) & 1][b[j]];\n       x = (x >= mod) ? (x - mod) : x;\n     }\n   }\n   return dp[k & 1][n];\n }\n int main() {\n   ios_base::sync_with_stdio(0), cin.tie(0);\n   cin >> n >> k;\n   for (int i = 1; i <= n; i++) cin >> a[i];\n   sort(a + 1, a + n + 1);\n   int res = 0;\n   for (int gap = 1; gap <= m / (k - 1); gap++) {\n     res += calc(gap);\n     if (res >= mod) res -= mod;\n   }\n   cout << res;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Room {\n   int length, width, height, total_length;\n } room[500];\n struct Wallpaper {\n   int length, width, price;\n } wallpaper[500];\n int main() {\n   int n, m, i, j, ans, tmp, price, ret;\n   cin >> n;\n   for (i = 0; i < n; ++i) {\n     cin >> room[i].length >> room[i].width >> room[i].height;\n     room[i].total_length = 2 * (room[i].length + room[i].width);\n   }\n   cin >> m;\n   for (i = 0; i < m; ++i)\n     cin >> wallpaper[i].length >> wallpaper[i].width >> wallpaper[i].price;\n   for (ret = i = 0; i < n; ++i) {\n     for (price = 500 * 500 * 500, ans = j = 0; j < m; ++j) {\n       tmp = wallpaper[j].length / room[i].height;\n       tmp *= wallpaper[j].width;\n       if (tmp == 0) continue;\n       ans = (room[i].total_length / tmp +\n              (room[i].total_length % tmp == 0 ? 0 : 1)) *\n             wallpaper[j].price;\n       price = min(price, ans);\n     }\n     ret += price;\n   }\n   cout << ret << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   if (n == 1)\n     cout << 1;\n   else if (abs(n - m) > abs(m - 1)) {\n     cout << m + 1;\n   } else {\n     cout << m - 1;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n, a, b, diff;\n   cin >> n >> a >> b;\n   vector<long long int> v;\n   long long int arr[n];\n   for (long long int i = 0; i < n; i++) {\n     cin >> arr[i];\n     v.push_back(arr[i]);\n   }\n   sort(v.begin(), v.end());\n   diff = v[n - a] - v[b - 1];\n   if (diff < 0) {\n     cout << '0' << endl;\n   } else {\n     cout << diff << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, q, k;\n vector<int> v[1000010];\n int lastans = 0, res[1000010];\n void dfs(int np, int fath, int val) {\n   res[np] = val;\n   for (auto &x : v[np]) {\n     if (x == fath) continue;\n     dfs(x, np, min(val, x));\n   }\n }\n int main() {\n   scanf('%d%d', &n, &q);\n   for (int i = 1, ti, tj; i < n; i++) {\n     scanf('%d%d', &ti, &tj);\n     v[ti].push_back(tj);\n     v[tj].push_back(ti);\n   }\n   int a, b;\n   scanf('%d%d', &a, &b);\n   b = b % n + 1;\n   dfs(b, 0, b);\n   lastans = 0;\n   k = b;\n   for (int i = 2, ti, tj; i <= q; i++) {\n     scanf('%d%d', &ti, &tj);\n     tj = (tj + lastans) % n + 1;\n     if (ti == 1)\n       k = min(k, res[tj]);\n     else\n       printf('%d\n', lastans = min(k, res[tj]));\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[100];\n long long b[100];\n vector<long long> pos[101];\n int main() {\n   long long i, j, k, l, m, n, t;\n   scanf('%lld', &n);\n   scanf('%lld', &k);\n   for (i = 0; i < n; i++) {\n     scanf('%lld', &a[i]);\n     pos[a[i]].push_back(i);\n   }\n   long long sum = 0, count = 0;\n   long long flag = 0;\n   for (i = 1; i <= 100; i++) {\n     for (j = 0; j < pos[i].size(); j++) {\n       sum = sum + a[pos[i][j]];\n       if (sum > k) {\n         flag = 1;\n         break;\n       }\n       b[count++] = pos[i][j];\n     }\n     if (flag == 1) break;\n   }\n   cout << count << endl;\n   for (j = 0; j < count; j++) cout << b[j] + 1 << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};\n int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};\n template <class T>\n inline T biton(T n, T pos) {\n   return n | ((T)1 << pos);\n }\n template <class T>\n inline T bitoff(T n, T pos) {\n   return n & ~((T)1 << pos);\n }\n template <class T>\n inline T ison(T n, T pos) {\n   return (bool)(n & ((T)1 << pos));\n }\n template <class T>\n inline T gcd(T a, T b) {\n   while (b) {\n     a %= b;\n     swap(a, b);\n   }\n   return a;\n }\n template <typename T>\n string NumberToString(T Number) {\n   ostringstream second;\n   second << Number;\n   return second.str();\n }\n inline int nxt() {\n   int aaa;\n   scanf('%d', &aaa);\n   return aaa;\n }\n inline long long int lxt() {\n   long long int aaa;\n   scanf('%lld', &aaa);\n   return aaa;\n }\n inline double dxt() {\n   double aaa;\n   scanf('%lf', &aaa);\n   return aaa;\n }\n template <class T>\n inline T bigmod(T p, T e, T m) {\n   T ret = 1;\n   for (; e > 0; e >>= 1) {\n     if (e & 1) ret = (ret * p) % m;\n     p = (p * p) % m;\n   }\n   return (T)ret;\n }\n int ar[1000010];\n long long F(long long int limit, long long int a, long long int b) {\n   if (limit < a) return 1LL;\n   long long int sum = 1LL;\n   long long int x = 0;\n   while (true) {\n     if (x + a > limit) break;\n     long long int temp = (limit - x) / a;\n     sum += temp;\n     long long int r = (a * temp) + x;\n     if (r - b < 0) break;\n     temp = (r + b - 1) / b;\n     temp--;\n     sum += temp;\n     r -= temp * b;\n     x = r;\n     if (x % a == 0) break;\n   }\n   return sum;\n }\n long long int get(long long int st, long long int len) {\n   long long int sum = (len * len + len) / 2LL;\n   sum *= st;\n   return sum;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   long long n, a, b;\n   cin >> n >> a >> b;\n   long long limit = min(a + b - 2, n);\n   long long sum = 0;\n   for (long long i = 0; i <= limit; i++) {\n     sum += F(i, a, b);\n   }\n   limit++;\n   long long int gc = gcd(a, b);\n   while (limit <= n) {\n     if (limit % gc == 0) break;\n     sum += (limit / gc) + 1;\n     limit++;\n   }\n   long long int upperLimit = n;\n   while (upperLimit >= limit) {\n     sum += (upperLimit / gc) + 1;\n     if (upperLimit % gc == 0) break;\n     upperLimit--;\n   }\n   if (upperLimit > limit) {\n     long long int diff = (upperLimit - limit);\n     sum += diff;\n     diff /= gc;\n     long long int chunk = limit * diff + get(gc, diff - 1);\n     sum += chunk;\n   }\n   cout << sum << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, A[2005], DP[2005];\n inline int ok(int X) {\n   memset(DP, 0, sizeof(DP));\n   int i, j;\n   long long l1, r1, l2, r2;\n   for (i = 1; i <= n; i++) DP[i] = i - 1;\n   for (i = 2; i <= n; i++)\n     if (abs(A[i] - A[i - 1]) <= X)\n       DP[i] = 0;\n     else\n       break;\n   for (i = 1; i <= n; i++)\n     for (j = i + 1; j <= n; j++) {\n       l1 = (long long)A[i] - (long long)X * (j - i - 1);\n       r1 = (long long)A[i] + (long long)X * (j - i - 1);\n       l2 = A[j] - X;\n       r2 = A[j] + X;\n       if (!(l2 > r1 || l1 > r2)) DP[j] = min(DP[j], DP[i] + j - i - 1);\n     }\n   for (i = 1; i <= n; i++)\n     if (DP[i] + n - i <= k) return 1;\n   return 0;\n }\n int cbin() {\n   int i, step = (1 << 30);\n   for (i = -1; step; step >>= 1)\n     if (!ok(i + step)) i += step;\n   return ++i;\n }\n int main() {\n   scanf('%d%d', &n, &k);\n   int i;\n   for (i = 1; i <= n; i++) scanf('%d', &A[i]);\n   printf('%d\n', cbin());\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int N;\n int A[100005];\n int G[100005];\n int m;\n int main() {\n   scanf('%d', &N);\n   for (int i = 0; i < N; ++i) scanf('%d', &A[i]);\n   for (int i = 0; i < N; ++i) {\n     if (i < N / 2) {\n       if (A[i] - i >= 1) ++G[A[i] - i];\n     } else {\n       if (A[i] - (N - i - 1) >= 1) ++G[A[i] - (N - i - 1)];\n     }\n   }\n   m = 0;\n   for (int i = 0; i <= 1e5; ++i)\n     if (G[i] >= m) m = G[i];\n   printf('%d', N - m);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int size = 1007;\n const long long modulo = 1000000007;\n const long long oo = 1e18;\n const double EPS = 1e-13;\n const double PI = acos(-1.0);\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int n, m;\n   cin >> n >> m;\n   vector<vector<int> > g(n);\n   vector<long long> cost(n), v(n);\n   for (int i = 0; i < n; i++) cin >> v[i];\n   while (m--) {\n     int a, b;\n     cin >> a >> b;\n     --a;\n     --b;\n     cost[a] += v[b];\n     cost[b] += v[a];\n     g[a].push_back(b);\n     g[b].push_back(a);\n   }\n   vector<bool> was(n, false);\n   long long ans = 0;\n   for (int h = 0; h < n; h++) {\n     int ver = -1;\n     for (int i = 0; i < n; i++)\n       if (!was[i] && (ver < 0 || v[ver] < v[i])) ver = i;\n     was[ver] = true;\n     ans += cost[ver];\n     for (int i = 0; i < g[ver].size(); i++) {\n       int to = g[ver][i];\n       if (!was[to]) {\n         cost[ver] -= v[to];\n         cost[to] -= v[ver];\n       }\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int test, a, sum = 0, wait = 0, counter = 0;\n   priority_queue<int, vector<int>, greater<int> > q;\n   queue<int> qqq;\n   cin >> test;\n   int num = test;\n   while (test--) {\n     cin >> a;\n     sum += a;\n     q.push(a);\n     qqq.push(a);\n   }\n   while (!q.empty()) {\n     int serve = q.top();\n     if (serve >= wait)\n       counter++;\n     else {\n       q.pop();\n       continue;\n     }\n     wait += serve;\n     q.pop();\n   }\n   cout << counter << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 3010;\n const int M = 11;\n const int INF = 1 << 30;\n const double EPS = 1e-8;\n const int MOD = 1000000007LL;\n int n, tot[N];\n vector<int> edge[N], edge2[N];\n int dfs(int u, int fa) {\n   int num = 0, sz;\n   sz = edge[u].size();\n   for (int i = 0; i < sz; i++) {\n     int v = edge[u][i];\n     if (v == fa) {\n       continue;\n     }\n     num += dfs(v, u);\n   }\n   sz = edge2[u].size();\n   for (int i = 0; i < sz; i++) {\n     int v = edge2[u][i];\n     if (v == fa) {\n       continue;\n     }\n     num += dfs(v, u) + 1;\n   }\n   return num;\n }\n void init() {\n   memset(tot, 0, sizeof(tot));\n   for (int i = 0; i < n; i++) {\n     edge[i].clear();\n     edge2[i].clear();\n   }\n   for (int i = 1; i < n; i++) {\n     int u, v;\n     scanf('%d %d', &u, &v);\n     u--, v--;\n     edge[u].push_back(v);\n     edge2[v].push_back(u);\n   }\n   for (int u = 0; u < n; u++) {\n     int sz;\n     sz = edge[u].size();\n     for (int i = 0; i < sz; i++) {\n       int v = edge[u][i];\n       int num = dfs(v, u);\n       tot[u] += num;\n     }\n     sz = edge2[u].size();\n     for (int i = 0; i < sz; i++) {\n       int v = edge2[u][i];\n       int num = dfs(v, u) + 1;\n       tot[u] += num;\n     }\n   }\n }\n int dfs2(int u, int fa) {\n   int sz, ret = tot[u];\n   sz = edge[u].size();\n   for (int i = 0; i < sz; i++) {\n     int v = edge[u][i];\n     if (v == fa) {\n       continue;\n     }\n     ret = min(ret, dfs2(v, u));\n   }\n   sz = edge2[u].size();\n   for (int i = 0; i < sz; i++) {\n     int v = edge2[u][i];\n     if (v == fa) {\n       continue;\n     }\n     ret = min(ret, dfs2(v, u));\n   }\n   return ret;\n }\n void solve() {\n   int ans = INF;\n   for (int i = 0; i < n; i++) {\n     ans = min(ans, tot[i]);\n   }\n   for (int i = 0; i < n; i++) {\n     vector<int> p;\n     int sz;\n     sz = edge[i].size();\n     for (int j = 0; j < sz; j++) {\n       int v = edge[i][j];\n       p.push_back(dfs2(v, i));\n     }\n     sz = edge2[i].size();\n     for (int j = 0; j < sz; j++) {\n       int v = edge2[i][j];\n       p.push_back(dfs2(v, i));\n     }\n     if (p.size() <= 1) {\n       continue;\n     }\n     sort(p.begin(), p.end());\n     int tmp = p[0] + p[1] - tot[i];\n     ans = min(ans, tmp);\n   }\n   cout << ans << endl;\n }\n int main() {\n   while (cin >> n) {\n     init();\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #define rep(i,a,b) for(int i = (a); i < b; ++i)\n #define rrep(i,a,b) for(int i = (b); i --> (a);)\n #define trav(x, v) for(auto &x : v)\n #define all(v) (v).begin(),(v).end()\n #define sz(v) (int)(v).size()\n \n bool que_big(int s, string x){\n 	cout << s+1 << ' ' << x << endl;\n 	string res;\n 	cin >> res;\n 	return res == 'yes';\n }\n \n int main(){\n 	int n = 200, b = 200;\n 	cin >> n >> b;\n \n 	vector<string> ub(n, string(b, '1'));\n 	string lb(b, '0');\n 	deque<int> ko;\n 	rep(i,0,n) ko.push_back(i);\n 	string nxt = string(b, '1');\n 	nxt[0] = '0';\n 	while(true){\n 		int s = ko.front();\n 		if(ub[s] < lb){\n 			ko.pop_front();\n 			continue;\n 		}\n 		if(ub[s] == lb){\n 			cout << 0 << ' ' << lb << endl;\n 			return 0;\n 		}\n 		if(que_big(s, nxt)){\n 			lb = nxt;\n 			rrep(i,0,b){\n 				if(lb[i]=='0'){\n 					lb[i] = '1';\n 					nxt[i] = '1';\n 					break;\n 				} else {\n 					lb[i] = '0';\n 				}\n 			}\n 		} else {\n 			ub[s] = nxt;\n 			ko.pop_front();\n 			ko.push_back(s);\n 			rep(i,0,b) if(nxt[i] > lb[i]){\n 				nxt[i] = '0';\n 				break;\n 			}\n 		}\n 	}\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n inline long long read() {\n   long long x = 0, f = 1;\n   char c = getchar();\n   for (; c > '9' || c < '0'; c = getchar()) {\n     if (c == '-') f = -1;\n   }\n   for (; c >= '0' && c <= '9'; c = getchar()) {\n     x = x * 10 + c - '0';\n   }\n   return x * f;\n }\n int dp[18][(1 << 18)][2][2];\n bool fan[200005];\n inline void work() {\n   int n = read(), k = read();\n   for (int i = 1; i <= k; i++) {\n     int x = read();\n     fan[x] = 1;\n   }\n   memset(dp, -0x3f, sizeof dp);\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= (1 << n); j += (1 << i)) {\n       if (i == 1) {\n         dp[i][j][fan[j]][fan[j + 1]] = (fan[j] | fan[j + 1]);\n         dp[i][j][fan[j + 1]][fan[j]] = (fan[j] | fan[j + 1]);\n       } else {\n         for (int x1 = 0; x1 < 2; x1++) {\n           for (int x2 = 0; x2 < 2; x2++) {\n             for (int y1 = 0; y1 < 2; y1++) {\n               for (int y2 = 0; y2 < 2; y2++) {\n                 int tmp =\n                     dp[i - 1][j][x1][y1] + dp[i - 1][j + (1 << i - 1)][x2][y2];\n                 if (x1 | x2) tmp++;\n                 if (y1 | y2) tmp++;\n                 dp[i][j][x1][x2] = std::max(dp[i][j][x1][x2], tmp + (x2 | y1));\n                 dp[i][j][x1][x2] = std::max(dp[i][j][x1][x2], tmp + (x2 | y2));\n                 dp[i][j][x1][y1] = std::max(dp[i][j][x1][y1], tmp + (y1 | x2));\n                 dp[i][j][x1][y2] = std::max(dp[i][j][x1][y2], tmp + (y2 | x2));\n                 dp[i][j][x2][x1] = std::max(dp[i][j][x2][x1], tmp + (x1 | y1));\n                 dp[i][j][x2][x1] = std::max(dp[i][j][x2][x1], tmp + (x1 | y2));\n                 dp[i][j][x2][y1] = std::max(dp[i][j][x2][y1], tmp + (y1 | x1));\n                 dp[i][j][x2][y2] = std::max(dp[i][j][x2][y2], tmp + (y2 | x1));\n               }\n             }\n           }\n         }\n       }\n     }\n   }\n   int ans = -0x3f3f3f3f;\n   ans = std::max(ans, dp[n][1][1][1] + 1);\n   ans = std::max(ans, dp[n][1][0][1] + 1);\n   ans = std::max(ans, dp[n][1][1][0] + 1);\n   ans = std::max(ans, dp[n][1][0][0]);\n   printf('%d\n', ans);\n }\n int main() {\n   work();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int con = 0;\n vector<pair<long long int, long long int> > v;\n long long int t[5000][5001];\n vector<vector<pair<long long int, long long int> > > ans(5001);\n bool istrue[5001];\n vector<long long int> a[5001];\n long long int dis[5001];\n int n;\n int ppp = 0;\n queue<int> q;\n void bfs(int src) {\n   q.push(src);\n   istrue[src] = true;\n   dis[src] = 0;\n   while (!q.empty()) {\n     int p = q.front();\n     q.pop();\n     ans[con].push_back({(dis[p] + 1) % 2, p});\n     for (auto u : a[p]) {\n       if (!istrue[u]) {\n         dis[u] = dis[p] + 1;\n         if (dis[u] % 2)\n           v[con].second++;\n         else\n           v[con].first++;\n         istrue[u] = true;\n         q.push(u);\n       } else {\n         if (dis[u] % 2 == dis[p] % 2) {\n           cout << 'NO'\n                << '\n';\n           ppp = 1;\n           return;\n         }\n       }\n     }\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int tt = 1;\n   while (tt--) {\n     long long int m;\n     cin >> n >> m;\n     long long int n1, n2, n3;\n     cin >> n1 >> n2 >> n3;\n     for (int i = 0; i < m; i++) {\n       int x, y;\n       cin >> x >> y;\n       a[x].push_back(y);\n       a[y].push_back(x);\n     }\n     for (int i = 1; i <= n; i++) {\n       if (!istrue[i]) {\n         v.push_back({1, 0});\n         bfs(i);\n         con++;\n       }\n       if (ppp == 1) return 0;\n     }\n     memset(t, -1, sizeof(t));\n     if (v[0].first <= n2) t[0][v[0].first] = 0;\n     if (v[0].second <= n2) t[0][v[0].second] = 0;\n     for (int i = 1; i <= (long long int)v.size() - 1; i++) {\n       for (int j = 0; j < n2 + 1; j++) {\n         long long int vv = j - v[i].first;\n         if (vv >= 0 && t[i - 1][vv] != -1) t[i][j] = vv;\n         vv = j - v[i].second;\n         if (vv >= 0 && t[i - 1][vv] != -1) t[i][j] = vv;\n       }\n     }\n     char ss[n + 1];\n     if (t[(long long int)v.size() - 1][n2] == -1)\n       cout << 'NO'\n            << '\n';\n     else {\n       cout << 'YES'\n            << '\n';\n       long long int i = (long long int)v.size() - 1, ind = n2;\n       while (i != -1) {\n         long long int pp = ind - t[i][ind], kk = 0;\n         if (v[i].first == pp) kk = 1;\n         for (auto u : ans[i]) {\n           if (u.first == kk)\n             ss[u.second] = '2';\n           else\n             ss[u.second] = '1';\n         }\n         ind = t[i][ind];\n         i--;\n       }\n       for (int j = 1; j <= n; j++) {\n         if (ss[j] == '1') {\n           if (n1 == 0)\n             ss[j] = '3';\n           else\n             n1--;\n         }\n         cout << ss[j];\n       }\n       cout << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < m; ++j) {\n       int k;\n       cin >> k;\n       if (k % 2 != (i + j) % 2) k++;\n       cout << k << ' ';\n     }\n     cout << endl;\n   }\n }\n int main() {\n   int n;\n   cin >> n;\n   while (n--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MXN = 5e4 + 5;\n const int INF = 1e9;\n const long long P = 29;\n const long long MOD = 1e9 + 7;\n int t;\n int main() {\n   srand(time(0));\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cout << fixed << setprecision(10);\n   cin >> t;\n   while (t--) {\n     int n, x1, x2, x3;\n     cin >> n;\n     cin >> x1 >> x2;\n     for (int i = 2; i < n; i++) {\n       cin >> x3;\n     }\n     if (x1 + x2 <= x3)\n       cout << 1 << ' ' << 2 << ' ' << n << '\n';\n     else\n       cout << -1 << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int read() {\n   int x = 0, flag = 1;\n   char c = getchar();\n   while ((c > '9' || c < '0') && c != '-') c = getchar();\n   if (c == '-') flag = 0, c = getchar();\n   while (c <= '9' && c >= '0') {\n     x = (x << 3) + (x << 1) + c - '0';\n     c = getchar();\n   }\n   return flag ? x : -x;\n }\n const int maxn = 2005;\n int f[maxn][maxn];\n char s[maxn][maxn];\n int main() {\n   int n = read(), m = read();\n   for (int i = (1); i <= (int)(n); i++) scanf('%s', s[i] + 1);\n   for (int i = (1); i <= (int)(2); i++)\n     for (int j = (1); j <= (int)(m); j++) f[i][j] = 1;\n   for (int i = (3); i <= (int)(n); i++)\n     for (int j = (1); j <= (int)(m); j++) {\n       if (j == 1 || j == m) {\n         f[i][j] = 1;\n         continue;\n       }\n       if (s[i][j] != s[i - 1][j - 1] || s[i][j] != s[i - 1][j] ||\n           s[i][j] != s[i - 1][j + 1] || s[i][j] != s[i - 2][j]) {\n         f[i][j] = 1;\n         continue;\n       }\n       int x = 100000;\n       x = min(x, f[i - 1][j - 1]);\n       x = min(x, f[i - 1][j]);\n       x = min(x, f[i - 1][j + 1]);\n       x = min(x, f[i - 2][j]);\n       f[i][j] = x + 1;\n     }\n   long long ans = 0;\n   for (int i = (1); i <= (int)(n); i++)\n     for (int j = (1); j <= (int)(m); j++) ans += f[i][j];\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename S, typename T>\n ostream& operator<<(ostream& out, pair<S, T> const& p) {\n   out << '(' << p.first << ', ' << p.second << ')';\n   return out;\n }\n template <typename T>\n ostream& operator<<(ostream& out, vector<T> const& v) {\n   long long l = v.size();\n   for (long long i = 0; i < l - 1; i++) out << v[i] << ' ';\n   if (l > 0) out << v[l - 1];\n   return out;\n }\n template <typename T>\n void trace(const char* name, T&& arg1) {\n   cout << name << ' : ' << arg1 << '\n';\n }\n template <typename T, typename... Args>\n void trace(const char* names, T&& arg1, Args&&... args) {\n   const char* comma = strchr(names + 1, ',');\n   cout.write(names, comma - names) << ' : ' << arg1 << ' | ';\n   trace(comma + 1, args...);\n }\n const long long N = 3e5 + 100;\n long long MOD;\n long long power(long long x, long long t) {\n   long long ans = 1;\n   while (t > 0) {\n     if (t & 1) ans = 1LL * ans * x % MOD;\n     x = 1LL * x * x % MOD;\n     t >>= 1;\n   }\n   return ans;\n }\n inline long long sub(long long a, long long b) {\n   a %= MOD;\n   b %= MOD;\n   a = ((a - b) % MOD + MOD) % MOD;\n   return a;\n }\n inline long long add(long long a, long long b) {\n   a %= MOD;\n   b %= MOD;\n   a = (a + b) % MOD;\n   return a;\n }\n inline long long mul(long long a, long long b) {\n   a %= MOD;\n   b %= MOD;\n   a = (a * b) % MOD;\n   return a;\n }\n inline long long inv(long long a) {\n   a = a % MOD;\n   a = power(a, MOD - 2);\n   return a;\n }\n long long a[N], n, k;\n map<long long, long long> cnt;\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   cin >> n >> MOD >> k;\n   for (long long i = 1; i <= n; i++) {\n     long long temp;\n     cin >> temp;\n     long long kk = power(temp, 4);\n     long long k2 = mul(k, temp);\n     kk = sub(kk, k2);\n     cnt[kk]++;\n   }\n   long long ans = 0;\n   auto c2 = [](long long a) -> long long { return ((a * (a - 1)) / 2); };\n   for (auto i : cnt) {\n     ans += c2(i.second);\n   }\n   cout << ans << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n bool sortmahstyle(const pair<int, int> &a, const pair<int, int> &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 <bits/stdc++.h>\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<long long int> a(n), b(n);\n   set<long long int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int N = 100010;\n const int M = 310;\n int n, m, s, e0, E;\n pair<int, int> dp[N][M];\n int a[N];\n vector<int> elAtB[N];\n inline int findj(int j0, int val) {\n   if (j0 >= m) return -1;\n   vector<int> &v = elAtB[val];\n   if (v.size() == 0) return -1;\n   vector<int>::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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<pair<long long, long long>> 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<long long, long long> 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<long long, long long> p = dq.front();\n         dq.pop_front();\n         long long amt = min(p.second, right);\n         if (r - p.first > t * d) return false;\n         p.second -= amt;\n         right -= amt;\n         if (p.second > 0) dq.push_front(p);\n       }\n       r--;\n     }\n     t++;\n   }\n   return true;\n }\n signed main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n >> d >> b;\n   for (long long i = 1; i <= n; i++) cin >> a[i];\n   long long l = 0;\n   long long r = n;\n   while (r - l > 3) {\n     long long mid = (r - l) / 2 + l;\n     if (f(mid))\n       r = mid;\n     else\n       l = mid;\n   }\n   for (long long i = l; i <= r; i++) {\n     if (f(i)) {\n       cout << i << '\n';\n       break;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #pragma GCC optimize('O3')\n #pragma GCC target('avx')\n #pragma GCC optimize('Ofast')\n #pragma GCC optimize('unroll-loops')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native')\n const int MOD = 1000000007;\n const int INF = 1000000009;\n const int MAXN = 1000005;\n vector<string> split(const string& s, char c) {\n   vector<string> v;\n   stringstream ss(s);\n   string x;\n   while (getline(ss, x, c)) v.emplace_back(x);\n   return move(v);\n }\n template <typename T, typename... Args>\n inline string arrStr(T arr, int n) {\n   stringstream s;\n   s << '[';\n   for (int i = 0; i < n - 1; i++) s << arr[i] << ',';\n   s << arr[n - 1] << ']';\n   return s.str();\n }\n bool is_prime(long long n) {\n   if (n < 2) return false;\n   for (long long x = 2; x * x <= n; x++) {\n     if (n % x == 0) return false;\n   }\n   return true;\n }\n vector<long long> get_prime_factors(long long n) {\n   vector<long long> f;\n   for (long long x = 2; x * x <= n; x++) {\n     while (n % x == 0) {\n       f.push_back(x);\n       n /= x;\n     }\n   }\n   if (n > 1) f.push_back(n);\n   return f;\n }\n long long fpow(long long x, long long n) {\n   long long res = 1;\n   while (n) {\n     if (n & 1) {\n       res = (1LL * res * x) % MOD;\n     }\n     x = (1LL * x * x) % MOD;\n     n >>= 1;\n   }\n   return (res % MOD);\n }\n vector<long long> fac, inv;\n void create_fac(long long n = MAXN) {\n   fac.resize(n + 5);\n   inv.resize(n + 5);\n   fac[0] = 1;\n   inv[0] = fpow(fac[0], MOD - 2);\n   for (long long i = 1; i <= n; i++) {\n     fac[i] = (fac[i - 1] % MOD * i % MOD) % MOD;\n     inv[i] = fpow(fac[i], MOD - 2);\n   }\n }\n long long binomial_coefficient(long long n, long long r) {\n   long long res = 1;\n   res = (res * (fac[n] % MOD)) % MOD;\n   res = (res * (inv[r] % MOD)) % MOD;\n   res = (res * (inv[n - r] % MOD)) % MOD;\n   return res;\n }\n long long gcd(long long a, long long b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }\n long long sceil(long long a, long long b) { return (a + b - 1) / b; }\n vector<long long> lp;\n vector<long long> pr;\n void sieve(long long n = MAXN) {\n   lp.resize(n + 1);\n   pr.clear();\n   for (long long i = 2; i <= n; ++i) {\n     if (lp[i] == 0) {\n       lp[i] = i;\n       pr.push_back(i);\n     }\n     for (long long j = 0;\n          j < (long long)pr.size() && pr[j] <= lp[i] && i * pr[j] <= n; ++j)\n       lp[i * pr[j]] = pr[j];\n   }\n }\n long long extended_euclidean(long long a, long long b, long long& x,\n                              long long& y) {\n   if (b == 0) {\n     x = 1;\n     y = 0;\n     return a;\n   }\n   long long x1, y1;\n   long long d = extended_euclidean(b, a % b, x1, y1);\n   x = y1;\n   y = x1 - y1 * (a / b);\n   return d;\n }\n int mod_inv(long long a, long long m) {\n   long long x, y;\n   long long g = extended_euclidean(a, m, x, y);\n   if (g != 1) {\n     return -1;\n   } else {\n     x = (x % m + m) % m;\n     return x;\n   }\n }\n long long solution() {\n   long long n, k;\n   cin >> n >> k;\n   string s;\n   cin >> s;\n   long long ans = 0;\n   if (k <= n) ans = k;\n   vector<long long> f(26, 0);\n   for (auto c : s) {\n     f[c - 'a']++;\n   }\n   long long MX = *max_element(f.begin(), f.end());\n   vector<long long> v(MX, 0);\n   for (int times = MX; times > 0; times--) {\n     for (int i = 0; i < 26; i++) {\n       v[times - 1] += f[i] / times;\n     }\n   }\n   reverse(v.begin(), v.end());\n   42;\n   for (long long i = 1; i <= k && i <= n; i++) {\n     if (k % i == 0) {\n       long long times = MX - (lower_bound(v.begin(), v.end(), i) - v.begin());\n       42;\n       42;\n       ans = max(ans, times * i);\n     }\n   }\n   return ans;\n }\n int main() {\n   ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n   int tt = 1;\n   cin >> tt;\n   while (tt--) {\n     cout << solution() << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int iinf = 1e9 + 10;\n const long long inf = 1ll << 60;\n const long long mod = 1e9 + 7;\n void GG() {\n   cout << '0\n';\n   exit(0);\n }\n long long mpow(long long a, long long n, long long mo = mod) {\n   long long re = 1;\n   while (n > 0) {\n     if (n & 1) re = re * a % mo;\n     a = a * a % mo;\n     n >>= 1;\n   }\n   return re;\n }\n long long inv(long long b, long long mo = mod) {\n   if (b == 1) return b;\n   return (mo - mo / b) * inv(mo % b, mo) % mo;\n }\n const int maxn = 1e6 + 5;\n long long dp[2003][22];\n long long fac[200006], ifac[200006];\n inline long long CC(int a, int b) {\n   a = a + b;\n   return fac[a] * ifac[b] % mod * ifac[a - b] % mod;\n }\n int R[2003], C[2003];\n signed main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   ;\n   fac[0] = ifac[0] = 1;\n   for (int i = 1; i <= 200006; ++i) {\n     fac[i] = fac[i - 1] * i % mod;\n     ifac[i] = inv(fac[i]);\n   }\n   int n, m, k, second;\n   cin >> n >> m >> k >> second;\n   vector<pair<int, int> > v;\n   v.push_back({1, 1});\n   v.push_back({n, m});\n   for (int i = 0; i < k; ++i) {\n     int r, c;\n     cin >> r >> c;\n     v.push_back({r, c});\n   }\n   sort(v.begin(), v.end());\n   for (int i = 1; i <= (int)v.size() - 1; ++i) {\n     R[i] = v[i].first, C[i] = v[i].second;\n     dp[i][0] = CC(R[i] - 1, C[i] - 1);\n     for (int fk = 0; fk < 21; ++fk) {\n       for (int j = 1; j <= i - 1; ++j) {\n         if (R[j] <= R[i] && C[j] <= C[i]) {\n           dp[i][fk] -= dp[j][fk] * CC(R[i] - R[j], C[i] - C[j]) % mod;\n           if (dp[i][fk] < 0) dp[i][fk] += mod;\n           dp[i][fk + 1] += dp[j][fk] * CC(R[i] - R[j], C[i] - C[j]) % mod;\n           if (dp[i][fk + 1] >= mod) dp[i][fk + 1] -= mod;\n         }\n       }\n     }\n   }\n   long long re = 0;\n   for (int fk = 0; fk < 22; ++fk) {\n     re += dp[(int)v.size() - 1][fk] * second % mod;\n     second = (second + 1) / 2;\n   }\n   cout << re * inv(CC(n - 1, m - 1)) % mod << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct lem {\n   long long m;\n   long long v;\n   int id;\n   bool operator<(const lem& other) const {\n     if (m > other.m) return true;\n     if (m < other.m) return false;\n     if (v > other.v) return true;\n     if (v < other.v) return false;\n     return id > other.id;\n   }\n };\n int N, K, H;\n lem L[100010];\n int asst[100010];\n int tempa[100010];\n bool solve(long double t) {\n   memset(tempa, 0, sizeof(tempa));\n   int start = 0;\n   for (int k = K; k >= 1; k--) {\n     bool found = false;\n     for (int i = (start); i <= (N - 1); i++) {\n       long double time =\n           ((long double)k) / ((long double)L[i].v) * ((long double)H);\n       if (time <= t) {\n         found = true;\n         tempa[k] = i;\n         start = i + 1;\n         break;\n       }\n     }\n     if (!found) return false;\n   }\n   return true;\n }\n int main() {\n   cin >> N >> K >> H;\n   for (int i = 0; i < N; i++) cin >> L[i].m;\n   for (int i = 0; i < N; i++) cin >> L[i].v;\n   for (int i = 0; i < N; i++) L[i].id = i + 1;\n   sort(L, L + N);\n   long double low = 0.l;\n   long double high = 1000000000.l;\n   int times = 100;\n   while (times--) {\n     long double t = (low + high) / 2.l;\n     if (solve(t)) {\n       for (int i = (1); i <= (K); i++) asst[i] = tempa[i];\n       high = t;\n     } else {\n       low = t;\n     }\n   }\n   for (int k = (1); k <= (K); k++) {\n     if (k > 1) cout << ' ';\n     cout << L[asst[k]].id;\n   }\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 20;\n const int inf = 1e9;\n int dp[maxn][maxn][maxn];\n int vis[maxn][maxn][maxn];\n int path[maxn][maxn][maxn];\n int n, a, b;\n int h[maxn];\n int dfs(int i, int cur, int pre) {\n   cur = cur < 0 ? 0 : cur;\n   pre = pre < 0 ? 0 : pre;\n   if (i == n) {\n     if (cur == 0)\n       return 0;\n     else\n       return inf;\n   }\n   if (vis[i][cur][pre]) return dp[i][cur][pre];\n   vis[i][cur][pre] = 1;\n   int &ans = dp[i][cur][pre];\n   ans = inf;\n   int lb = (pre + b - 1) / b,\n       hb = max(lb, max((cur + a - 1) / a, (h[i + 1] + b) / b));\n   int p;\n   for (int j = lb; j <= hb; j++) {\n     int tmp = j + dfs(i + 1, h[i + 1] + 1 - j * b, cur - j * a);\n     if (ans > tmp) {\n       ans = tmp;\n       path[i][cur][pre] = j;\n     }\n   }\n   return ans;\n }\n void print(int i, int cur, int pre) {\n   cur = cur < 0 ? 0 : cur;\n   pre = pre < 0 ? 0 : pre;\n   if (i == n) return;\n   int tmp = path[i][cur][pre], cnt = tmp;\n   while (cnt--) printf('%d ', i);\n   print(i + 1, h[i + 1] + 1 - tmp * b, cur - tmp * a);\n }\n int main() {\n   cin >> n >> a >> b;\n   for (int i = 1; i <= n; i++) cin >> h[i];\n   memset(vis, 0, sizeof(vis));\n   int ans = dfs(2, h[2] + 1, h[1] + 1);\n   cout << ans << '\n';\n   print(2, h[2] + 1, h[1] + 1);\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s, s1, s2, s3;\n int sa[300010][20], lcp[300010], rnk[300010], root[300010], cnt[300010][4],\n     col[300010], n;\n pair<pair<int, int>, int> q[300010];\n pair<int, pair<int, int> > lcp_pair[300010];\n vector<long long> ansvec;\n long long ans, mod = 1e9 + 7;\n int get(int x) { return root[x] = (x == root[x] ? x : get(root[x])); }\n void merge(int x, int y) {\n   root[y] = x;\n   ans -= (1LL * cnt[y][1] * cnt[y][2] * cnt[y][3]) % mod +\n          (1LL * cnt[x][1] * cnt[x][2] * cnt[x][3]) % mod;\n   while (ans < 0) ans += mod;\n   for (int i = 1; i <= 3; ++i) cnt[x][i] += cnt[y][i];\n   ans = (ans + 1LL * cnt[x][1] * cnt[x][2] * cnt[x][3]) % mod;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> s1 >> s2 >> s3;\n   n = min(s1.size(), min(s2.size(), s3.size()));\n   s = s1 + '1' + s2 + '2' + s3;\n   for (int i = 0; i < s1.size(); ++i) col[i] = 1;\n   for (int i = s1.size() + 1; i < s1.size() + 1 + s2.size(); ++i) col[i] = 2;\n   for (int i = s.size() - s3.size(); i < s.size(); ++i) col[i] = 3;\n   for (int i = 0; i < s.size(); ++i) sa[i][0] = s[i];\n   for (int i = 1; i < 20; ++i) {\n     for (int j = 0; j < s.size(); ++j)\n       if (j + (1 << i - 1) < s.size())\n         q[j] =\n             make_pair(make_pair(sa[j][i - 1], sa[j + (1 << i - 1)][i - 1]), j);\n       else\n         q[j] = make_pair(make_pair(sa[j][i - 1], -1), j);\n     sort(q, q + s.size());\n     int cnt = 0;\n     for (int j = 0; j < s.size(); ++j) {\n       if (j && q[j].first != q[j - 1].first) ++cnt;\n       sa[q[j].second][i] = cnt;\n     }\n   }\n   for (int i = 0; i < s.size(); ++i) {\n     rnk[sa[i][19]] = i;\n     root[i] = i;\n     cnt[i][col[i]] = 1;\n   }\n   int cnt = 0, index, ii = 0;\n   for (int i = 0; i < s.size(); ++i) {\n     index = sa[i][19];\n     if (index == s.size() - 1) {\n       cnt = 0;\n       continue;\n     }\n     while (i + cnt < s.size() && rnk[index + 1] + cnt < s.size() &&\n            s[i + cnt] == s[rnk[index + 1] + cnt])\n       ++cnt;\n     lcp[i] = cnt;\n     lcp_pair[ii] = make_pair(lcp[i], make_pair(i, rnk[index + 1]));\n     if (cnt) --cnt;\n     ++ii;\n   }\n   sort(lcp_pair, lcp_pair + s.size() - 1);\n   reverse(lcp_pair, lcp_pair + s.size() - 1);\n   for (int i = n, j = 0; i >= 1; --i) {\n     int x, y;\n     while (j < s.size() - 1 && lcp_pair[j].first >= i) {\n       x = get(lcp_pair[j].second.first);\n       y = get(lcp_pair[j].second.second);\n       merge(x, y);\n       ++j;\n     }\n     ansvec.push_back(ans);\n   }\n   for (int i = ansvec.size() - 1; i >= 0; --i) cout << ansvec[i] << ' ';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<string> v;\n string s;\n const int N = 1000001;\n int n;\n long long d, arr[N];\n unsigned long long gcd(long long x, long long y) {\n   if (y == 0) {\n     return x;\n   }\n   return gcd(y, x % y);\n }\n void gen(long long ind, string t) {\n   if (ind == s.size()) {\n     if (t.size() == 3) v.push_back(t);\n     return;\n   }\n   gen(ind + 1, t + s[ind]);\n   gen(ind + 1, t);\n }\n long long check() {\n   long long res = 0;\n   for (long long i = 0; i < v.size(); ++i) {\n     if (((v[i][v[i].size() - 1] - '0') - (v[i][0] - '0')) <= d) {\n       res++;\n     }\n   }\n   return res;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int n, l, r;\n   bool lie = 0;\n   cin >> n >> l >> r;\n   int v[n], s[n];\n   for (int i = 1; i <= n; ++i) {\n     cin >> v[i];\n   }\n   for (int i = 1; i <= n; ++i) {\n     cin >> s[i];\n   }\n   for (int i = 1; i < l; ++i) {\n     if (v[i] != s[i]) {\n       lie = 1;\n       break;\n     }\n   }\n   if (!lie) {\n     for (int i = r + 1; i <= n; ++i) {\n       if (v[i] != s[i]) {\n         lie = 1;\n         break;\n       }\n     }\n   }\n   if (lie) {\n     cout << 'LIE\n';\n   } else {\n     cout << 'TRUTH\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1 + 9e6;\n const int inf = 0x3f3f3f;\n vector<bool> dp[24];\n int n;\n int a[23];\n vector<pair<int, int> > pre[23];\n int ans;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie();\n   cout.tie();\n   cin >> n;\n   for (int i = 0; i < n; ++i) {\n     cin >> a[i];\n   }\n   for (int i = 0; i < 24; i++) dp[i].resize(1 << n);\n   for (int i = 1; i < n; ++i) {\n     for (int j = 0; j < i; ++j) {\n       for (int k = j; k < i; ++k) {\n         if (a[j] + a[k] == a[i]) {\n           pre[i].push_back({j, k});\n         }\n       }\n     }\n   }\n   dp[0][0] = 0;\n   dp[0][1] = 1;\n   for (int i = 0; i < n - 1; ++i) {\n     for (int mask = 0; mask < (1 << n); ++mask) {\n       if (dp[i][mask]) {\n         for (int j = 0; j < pre[i + 1].size(); ++j) {\n           int u = pre[i + 1][j].first;\n           int v = pre[i + 1][j].second;\n           if (((mask >> u) & 1) && ((mask >> v) & 1)) {\n             int bit = mask + (1 << (i + 1));\n             dp[i + 1][bit] = 1;\n             for (int k = 0; k < i + 1; ++k) {\n               if (((bit >> k) & 1)) {\n                 dp[i + 1][bit ^ (1 << k)] = 1;\n               }\n             }\n           }\n         }\n       }\n     }\n   }\n   ans = inf;\n   for (int mask = 0; mask < (1 << n); ++mask) {\n     if (dp[n - 1][mask]) {\n       ans = min(ans, (int)(__builtin_popcount(mask)));\n     }\n   }\n   if (ans == inf)\n     cout << -1;\n   else\n     cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string onezero(int n) {\n   string s = '1';\n   for (int i = 1; i < n; ++i) {\n     s += '0';\n   }\n   return s;\n }\n string findSum(string str1, string str2) {\n   if (str1.length() > str2.length()) swap(str1, str2);\n   string str = '';\n   int n1 = str1.length(), n2 = str2.length();\n   reverse(str1.begin(), str1.end());\n   reverse(str2.begin(), str2.end());\n   int carry = 0;\n   for (int i = 0; i < n1; i++) {\n     int sum = ((str1[i] - '0') + (str2[i] - '0') + carry);\n     str.push_back(sum % 10 + '0');\n     carry = sum / 10;\n   }\n   for (int i = n1; i < n2; i++) {\n     int sum = ((str2[i] - '0') + carry);\n     str.push_back(sum % 10 + '0');\n     carry = sum / 10;\n   }\n   if (carry) str.push_back(carry + '0');\n   reverse(str.begin(), str.end());\n   return str;\n }\n int main() {\n   ios_base::sync_with_stdio(NULL);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int l;\n   string s, ans;\n   cin >> l >> s;\n   if (s.size() % l != 0) {\n     string zero = onezero(l);\n     for (int i = 0; i < s.size() / l + 1; ++i) {\n       ans += zero;\n     }\n   } else {\n     string temp = s.substr(0, l);\n     for (int i = 0; i < s.size() / l; ++i) {\n       ans += temp;\n     }\n     if (ans <= s) {\n       ans = '';\n       temp = findSum(temp, '1');\n       if (temp.size() != l) {\n         temp = onezero(l);\n         ans = onezero(l);\n       }\n       for (int i = 0; i < s.size() / l; ++i) {\n         ans += temp;\n       }\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long int N = 1e5 + 1;\n long long int n, m, i, j, l, k, x, y, a, b, cnt[3], sum[3];\n void solve() {\n   string s;\n   cin >> s;\n   long long int n = s.length();\n   long long int lst = 0, maxi = -1;\n   long long int val = 0;\n   for (long long int i = 0; i < n; i++) {\n     if (s[i] == 'L') {\n       val++;\n     } else {\n       maxi = max(maxi, val);\n       val = 0;\n     }\n   }\n   maxi = max(maxi, val);\n   cout << maxi + 1 << '\n';\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long int t;\n   cin >> t;\n   while (t--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[1010], d[1010];\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n     d[a[i]]++;\n   }\n   int mx = 0, mxi = 0;\n   for (int i = 1; i <= n; i++) {\n     if (d[a[i]] > mx) mx = d[a[i]];\n     if (d[a[i]] != 0) {\n       mxi++;\n       d[a[i]] = 0;\n     }\n   }\n   cout << mx << ' ' << mxi;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s;\n   cin >> s;\n   long long answer = 0;\n   for (int i = s.length() - 1; i > 0; i--) {\n     string temp = s.substr(i - 1, 2);\n     if (stoi(temp) % 4 == 0) {\n       answer += i;\n     }\n   }\n   for (int i = 0; i < s.length(); i++) {\n     if (stoi(s.substr(i, 1)) % 4 == 0) {\n       answer++;\n     }\n   }\n   cout << answer;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int c[1005];\n int a[12] = {0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292};\n int main() {\n   long long n;\n   while (cin >> n) {\n     if (n <= 11) {\n       cout << a[n] << endl;\n     } else {\n       long long m;\n       m = a[11] + (n - 11) * 49;\n       cout << m << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int read() {\n   int ret = 0, flag = 1;\n   char c = getchar();\n   while (c < '0' || c > '9') {\n     if (c == '-') flag = -1;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') ret = ret * 10 + (c ^ '0'), c = getchar();\n   return flag * ret;\n }\n struct use {\n   int x, dis;\n };\n const int N = 5e3 + 5;\n int T, n, d;\n vector<int> edge[N];\n int dad[N];\n int build(int x, int dis) {\n   int sum = 0;\n   if ((x << 1) <= n) {\n     edge[x].push_back(x << 1);\n     sum += dis + 1;\n     sum += build(x << 1, dis + 1);\n   }\n   if ((x << 1 | 1) <= n) {\n     edge[x].push_back(x << 1 | 1);\n     sum += dis + 1;\n     sum += build(x << 1 | 1, dis + 1);\n   }\n   return sum;\n }\n void bfs() {\n   queue<use> q;\n   q.push({1, 0});\n   int now = 0;\n   vector<int> p1, p2;\n   while (q.empty() == 0) {\n     int x = q.front().x, dis = q.front().dis;\n     q.pop();\n     if (now != dis) {\n       now = dis, p1.clear(), p2.clear();\n     }\n     for (auto it = edge[x].begin(); it != edge[x].end(); it++) {\n       int y = *it;\n       if (edge[y].size() == 0) {\n         p1.push_back(y);\n         if (p2.size()) {\n           edge[p2[0]].push_back(y);\n           edge[x].erase(it);\n           return;\n         }\n       }\n       if (edge[y].size() != 2) p2.push_back(y);\n       q.push({y, dis + 1});\n     }\n   }\n }\n int main() {\n   T = read();\n   while (T--) {\n     n = read(), d = read();\n     for (int i = 1; i <= n; i++) edge[i].clear();\n     int mn = build(1, 0);\n     int mx = (n - 1) * n / 2;\n     if (!(mn <= d && d <= mx)) {\n       printf('NO\n');\n       continue;\n     }\n     int now = mn;\n     while (now < d) {\n       bfs();\n       now++;\n     }\n     for (int i = 1; i <= n; i++) {\n       for (int j = 0; j < edge[i].size(); j++) dad[edge[i][j]] = i;\n     }\n     printf('YES\n');\n     for (int i = 2; i <= n; i++) printf('%d ', dad[i]);\n     printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n double ans, m;\n int n;\n double binpow(double a, int b) {\n   if (b == 0)\n     return 1;\n   else if (b == 1)\n     return a;\n   else if (b % 2 == 0) {\n     double t = binpow(a, b / 2);\n     return t * t;\n   } else\n     return a * binpow(a, b - 1);\n }\n int main() {\n   cin >> m >> n;\n   for (double i = 1; i <= m; i++) {\n     ans += i * binpow(i / m, n) * (1 - binpow((i - 1) / i, n));\n   }\n   cout << fixed << setprecision(15) << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int i;\n   for (i = 0; i < 10; i++) {\n     printf('??%d>>%d??\n', i, i);\n   }\n   printf('??>>?\n');\n   for (i = 0; i < 9; i++) {\n     printf('%d?<>%d\n', i, i + 1);\n   }\n   printf('9?>>?0\n?<>1\n>>??\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   long long n;\n   cin >> n;\n   long long t = n;\n   vector<pair<int, int> > laptop;\n   for (int i = 0; i < n; i++) {\n     long long temp1, temp2;\n     cin >> temp1 >> temp2;\n     laptop.push_back(make_pair(temp1, temp2));\n   }\n   sort(laptop.begin(), laptop.end());\n   int cur = laptop[0].second;\n   for (int i = 1; i < n; ++i) {\n     if (cur > laptop[i].second) {\n       cout << 'Happy Alex\n';\n       return 0;\n     }\n     cur = laptop[i].second;\n   }\n   cout << 'Poor Alex\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e6 + 7, M = 1e9 + 7;\n vector<int> primes;\n bool isp[N];\n void sieve() {\n   fill(isp, isp + N, 1);\n   isp[0] = isp[1] = 0;\n   for (int i = 2; i * i < N; i++)\n     if (isp[i])\n       for (int j = i * i; j < N; j += i) isp[j] = 0;\n   for (int i = 2; i < N; i++)\n     if (isp[i]) primes.push_back(i);\n }\n vector<pair<int, int> > factorize(int x) {\n   vector<pair<int, int> > ans;\n   for (int i = 2; i * i <= x; i++) {\n     int cnt = 0;\n     while (x % i == 0) cnt++, x /= i;\n     if (cnt) ans.push_back(make_pair(i, cnt));\n   }\n   if (x > 1) ans.push_back(make_pair(x, 1));\n   return ans;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   long long ans = 1;\n   map<int, int> fac;\n   map<int, int> cnt;\n   vector<vector<pair<int, int> > > factors;\n   int pp[n];\n   for (int i = 0; i < n; i++) cin >> pp[i];\n   sort(pp, pp + n);\n   reverse(pp, pp + n);\n   for (int i = 1; i <= n; i++) {\n     int p = pp[i - 1];\n     if (fac.count(p) == 0) {\n       ans = (ans * p) % M;\n       fac[p] = 1;\n       cnt[p] = 1;\n       vector<pair<int, int> > v;\n       v.push_back(make_pair(p, 1));\n       factors.push_back(v);\n     } else {\n       vector<pair<int, int> > pf = factorize(p - 1);\n       factors.push_back(pf);\n       for (auto pr : pf) {\n         int p = pr.first;\n         int e = pr.second;\n         int dif = e - fac[p];\n         if (dif < 0) continue;\n         if (dif == 0) {\n           cnt[p]++;\n           continue;\n         }\n         fac[p] += dif;\n         cnt[p] = 1;\n         for (int i = 0; i < dif; i++) ans = (ans * p) % M;\n       }\n     }\n   }\n   for (auto pf : factors) {\n     bool found = true;\n     for (auto pr : pf) {\n       int p = pr.first;\n       int e = pr.second;\n       int mx = fac[p];\n       assert(e <= mx);\n       if (e == mx && cnt[p] == 1) {\n         found = false;\n         break;\n       }\n     }\n     if (found) {\n       ans++;\n       break;\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n unsigned long long n, k, b1, b2, b[200007], ans, dl, dll[200007], an[200007];\n map<unsigned long long, unsigned long long> a[11];\n int main() {\n   ios::sync_with_stdio(0);\n   cout.tie(0);\n   cin.tie(0);\n   cin >> n >> k;\n   for (unsigned long long i = 1; i <= n; i++) {\n     cin >> b[i];\n     b1 = b[i];\n     dl = 0;\n     while (b1 > 0) {\n       dl++;\n       b1 = b1 / 10;\n     }\n     dll[i] = dl;\n     b1 = b[i];\n     a[dl][b[i] % k]++;\n   }\n   for (unsigned long long i = 1; i <= n; i++) {\n     b1 = 1;\n     for (unsigned long long j = 1; j <= 10; j++) {\n       b1 *= 10;\n       b2 = b[i] * b1;\n       b2 %= k;\n       b2 = k - b2;\n       if (b2 == k) b2 = 0;\n       if (a[j].find(b2) != a[j].end()) {\n         ans += a[j][b2];\n         if (dll[i] == j && b2 == b[i] % k) ans--;\n       }\n     }\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = int(1e6) + 100;\n const long long inf = 1e6;\n int n, m;\n int a[maxn], cnt[maxn], b[maxn];\n void read() {\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; ++i) scanf('%d', &a[i]);\n   for (int i = 1; i <= n; ++i) b[i] = a[i];\n }\n long long POW(long long num, int times) {\n   long long ans = 1;\n   while (times) {\n     if (times & 1) ans = ans * num;\n     num = num * num;\n     if (ans >= inf) return inf;\n     if (num >= inf) num = inf;\n     times >>= 1;\n   }\n   return ans;\n }\n void solve() {\n   long long ans = 0;\n   for (int i = 1; i <= n; ++i) {\n     int num = a[i];\n     a[i] = 1;\n     long long inv = 1;\n     for (int j = 2; j * j <= num && num != 1; ++j)\n       if (num % j == 0) {\n         int k = 0;\n         int x = a[i];\n         while (num % j == 0) {\n           k++;\n           if (k == m) k = 0;\n           if (k == 0)\n             a[i] = x;\n           else\n             a[i] *= j;\n           num /= j;\n         }\n         int tmp = POW(j, (m - k) % m);\n         if (tmp == inf)\n           inv = inf;\n         else\n           inv *= tmp;\n         if (inv >= inf) inv = inf;\n       }\n     if (num != 1) a[i] *= num, inv *= POW(num, m - 1);\n     if (inv < inf) ans += cnt[inv];\n     ++cnt[a[i]];\n   }\n   printf('%lld\n', ans);\n }\n int main() {\n   read();\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MX = 300000;\n int n, arr[MX], bit[MX], ans = 0, lis;\n void update(int x, int V) {\n   while (x <= n) {\n     bit[x] = max(bit[x], V);\n     x += x & -x;\n   }\n }\n int get(int x) {\n   int ret = 0;\n   while (x > 0) {\n     ret = max(ret, bit[x]);\n     x -= x & -x;\n   }\n   return ret;\n }\n int main() {\n   scanf('%d', &n);\n   memset(bit, 0, sizeof(bit));\n   for (int j = 1; j <= n; j++) {\n     scanf('%d', &arr[j]);\n     lis = get(arr[j]) + 1;\n     update(arr[j] + 1, lis);\n     ans = max(ans, lis);\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n priority_queue<long long, std::vector<long long>, std::greater<long long> > pqs;\n queue<long long> q;\n stack<long long> sta;\n set<long long> st;\n set<long long>::iterator P;\n long long i, j, n, m, t, k, a, b, c, x, mx, mn;\n string s, s1;\n char z;\n vector<pair<long long, long long> > v;\n map<pair<long long, long long>, long long> mp, pm;\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);\n   int T = 1;\n   cin >> T;\n   while (T--) {\n     i = j = n = m = t = k = a = b = c = x = mx = mn = 0;\n     cin >> n >> m;\n     m += 2 * n;\n     for (i = 1; i <= n && m; i++)\n       for (j = i + 1; j <= n && m; j++) cout << i << ' ' << j << endl, m--;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Node {\n   Node *arr[26];\n   int state;\n   bool isEnd = false;\n   Node() {\n     for (int i = 0; i < 26; i++) arr[i] = nullptr;\n     isEnd = true;\n   }\n };\n void insert(const string &s, Node *root) {\n   Node *curr = root;\n   for (char c : s) {\n     if (curr->arr[c - 'a'] == nullptr) curr->arr[c - 'a'] = new Node();\n     curr = curr->arr[c - 'a'];\n   }\n   curr->isEnd = true;\n }\n int find_state(Node *curr, bool leaf = true) {\n   bool winning = false;\n   int cnt = 0;\n   for (int i = 0; i < 26; i++) {\n     if (curr->arr[i] != nullptr) {\n       cnt++;\n       if (find_state(curr->arr[i], leaf) == 0) winning = true;\n     }\n   }\n   if (cnt == 0) winning = leaf;\n   return curr->state = winning ? 1 : 0;\n }\n int main() {\n   int n, k;\n   cin >> n >> k;\n   Node *root = new Node();\n   for (int i = 0; i < n; i++) {\n     string s;\n     cin >> s;\n     insert(s, root);\n   }\n   int st1 = find_state(root, false);\n   if (k == 1) {\n     cout << (st1 == 1 ? 'First' : 'Second') << endl;\n   } else {\n     int st2 = find_state(root, true);\n     if (st2 == 1 && st1 == 1) {\n       cout << 'First' << endl;\n     } else if (st2 == 1 && st1 == 0) {\n       cout << 'Second' << endl;\n     } else if (st2 == 0 && st1 == 1) {\n       cout << (k % 2 == 0 ? 'Second' : 'First') << endl;\n     } else {\n       cout << 'Second' << endl << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[100005];\n int main() {\n   int n;\n   while (cin >> n) {\n     int ans = 0;\n     for (int i = 1; i < n; i++) {\n       int x, y;\n       cin >> x >> y;\n       ans += a[x] + a[y];\n       a[x]++, a[y]++;\n     }\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MOD = pow(10, 9) + 7;\n const long long MAX = LONG_LONG_MAX;\n void solve() {\n   int n;\n   cin >> n;\n   vector<string> a(n, '');\n   for (int i = 0; i < n; i += 1) cin >> a[i];\n   for (int i = 0; i < n; i += 1) {\n     for (int j = 0; j < n; j += 1) {\n       if (a[i][j] == '1') {\n         if (i == n - 1 || j == n - 1) {\n           continue;\n         }\n         if (a[i + 1][j] == '1' || a[i][j + 1] == '1') {\n           continue;\n         } else {\n           cout << 'NO';\n           return;\n         }\n       }\n     }\n   }\n   cout << 'YES';\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long t = 1;\n   cin >> t;\n   while (t > 0) {\n     solve();\n     t--;\n     cout << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int8_t sign(int a, int b, int &c, int x, int y) {\n   return a * 1LL * x + b * 1LL * y + c < 0LL ? -1 : 1;\n }\n void solve() {\n   int x, y, x1, y1;\n   cin >> x >> y >> x1 >> y1;\n   int16_t ans = 0;\n   int16_t n;\n   cin >> n;\n   for (int i = 0, u, v, c; i < n; i++) {\n     cin >> u >> v >> c;\n     ans += sign(u, v, c, x, y) != sign(u, v, c, x1, y1);\n   }\n   cout << ans;\n }\n int32_t main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int tkd = 1;\n   while (tkd-- > 0) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/STACK:64777216')\n using namespace std;\n template <class T>\n inline T sqr(T x) {\n   return x * x;\n }\n const double pi = acos(-1.0), eps = 1e-9;\n const int INF = 1000 * 1000 * 1000, MAXN = 1000005, MOD = 1000000007;\n const long long INFL = 1000000000000000000;\n long long n, m, cnt[MAXN][26];\n string x, y;\n void prepare(string s) {\n   if ((int)s.size() != 0) {\n     freopen((s + '.in').c_str(), 'r', stdin);\n     freopen((s + '.out').c_str(), 'w', stdout);\n   }\n }\n long long gcd(long long a, long long b) { return (b) ? gcd(b, a % b) : a; }\n long long lca(long long a, long long b) { return a / gcd(a, b) * b; }\n void get_data() { cin >> n >> m >> x >> y; }\n void solve() {\n   long long L = lca((int)x.size(), (int)y.size());\n   long long g = gcd((int)x.size(), (int)y.size());\n   long long ans = L;\n   for (int i = 0; i < (int)y.size(); ++i) cnt[i % g][y[i] - 'a']++;\n   for (int j = 0; j < (int)x.size(); ++j) ans -= cnt[j % g][x[j] - 'a'];\n   cout << ans * (n * (int)x.size() / L);\n }\n int main() {\n   prepare('');\n   get_data();\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s[2004], temp[2004], e[2004], c, cnt;\n int n;\n int q[27];\n void f(int x) {\n   cnt++;\n   if (cnt != n * 3)\n     printf('%d ', x);\n   else\n     printf('%d\n', x);\n   int i;\n   for (i = n - x + 1; i <= n; i++) temp[n - i + 1] = s[i];\n   for (i = 1; i < n - x + 1; i++) temp[i + x] = s[i];\n   for (i = 1; i <= n; i++) s[i] = temp[i];\n }\n int main() {\n   int t, i, j, k, x, l1, l2, flag, o;\n   scanf('%d', &t);\n   scanf('%s', s + 1);\n   scanf('%s', e + 1);\n   l1 = strlen(s + 1);\n   l2 = strlen(e + 1);\n   if (l1 != l2) {\n     printf('-1\n');\n     return 0;\n   }\n   memset(q, 0, sizeof(q));\n   for (i = 1; i <= l1; i++) {\n     q[s[i] - 'a']++;\n     q[e[i] - 'a']--;\n   }\n   flag = 1;\n   for (i = 0; i < 26; i++) {\n     if (q[i]) flag = 0;\n   }\n   if (flag == 0) {\n     printf('-1\n');\n     return 0;\n   }\n   n = l1;\n   printf('%d\n', n * 3);\n   cnt = 0;\n   for (o = 0; o < n; o++) {\n     f(n);\n     c = e[n - o];\n     for (i = n - o; i >= 0; i--) {\n       if (s[i] == c) break;\n     }\n     f(n - i);\n     f(1);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1e9 + 10, MAX = 7e5 + 1e4, MOD = 1e9 + 7, MAXL = 25;\n void OUT(long double o, int x) {\n   cout << fixed << setprecision(x) << o;\n   return;\n }\n long long sth[MAX], mah[MAX], reg[MAX], ti[MAX], en[MAX], he[MAX], hh[MAX],\n     pa[MAX];\n long long la[MAX];\n pair<pair<long long, long long>, long long> so[MAX];\n set<long long> st;\n map<long long, long long> mp;\n vector<pair<pair<long long, long long>, long long> > v[MAX];\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, m, ans = 0, bo, da, in;\n   bool inff = 0;\n   cin >> n >> m >> bo >> in >> da;\n   st.insert(0);\n   for (int i = 1; i <= n; i++) {\n     cin >> mah[i] >> sth[i] >> reg[i];\n     if (mah[i] <= da) inff = 1;\n     hh[i] = sth[i];\n     if (hh[i] <= da && (reg[i] != 0 && mah[i] > da)) {\n       st.insert((da - hh[i]) / reg[i]);\n       st.insert(((da - hh[i]) / reg[i]) + 1);\n     }\n   }\n   for (int i = 1; i <= m; i++) {\n     cin >> ti[i] >> en[i] >> he[i];\n     so[i] = {{ti[i], en[i]}, he[i]};\n   }\n   so[0].first.first = -1;\n   sort(so + 1, so + m + 1);\n   for (int i = 1; i <= m; i++) {\n     hh[so[i].first.second] = so[i].second;\n     st.insert(so[i].first.first);\n     st.insert(so[i].first.first - 1);\n     if (so[i].second <= da &&\n         (reg[so[i].first.second] != 0 && mah[so[i].first.second] > da)) {\n       st.insert(so[i].first.first +\n                 ((da - so[i].second) / reg[so[i].first.second]));\n       st.insert(1 + so[i].first.first +\n                 ((da - so[i].second) / reg[so[i].first.second]));\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     if (reg[i] == 0 && hh[i] <= da) inff = 1;\n   }\n   if (inff == 1 && in != 0) return cout << -1, 0;\n   long long cnt = 0, x = 0;\n   for (int u : st) {\n     mp[u] = cnt;\n     cnt++;\n   }\n   for (int i = 1; i <= n; i++) {\n     hh[i] = sth[i];\n     la[i] = -1;\n     if (hh[i] <= da)\n       x++;\n     else\n       la[i] = -2;\n     if (hh[i] <= da && (reg[i] != 0 && mah[i] > da)) {\n       pa[mp[1 + ((da - hh[i]) / reg[i])]]--;\n       la[i] = ((da - hh[i]) / reg[i]);\n     }\n   }\n   for (int i = 1; i <= m; i++) {\n     v[mp[ti[i]]].push_back({{ti[i], en[i]}, he[i]});\n   }\n   for (int u : st) {\n     for (pair<pair<long long, long long>, long long> w : v[mp[u]]) {\n       hh[w.first.second] = w.second;\n       if (la[w.first.second] == -1 || la[w.first.second] >= u) {\n         if (la[w.first.second] != -1) pa[mp[la[w.first.second] + 1]]++;\n         if (hh[w.first.second] > da)\n           x--;\n         else {\n           if ((reg[w.first.second] != 0 && mah[w.first.second] > da)) {\n             pa[mp[1 + u + ((da - hh[w.first.second]) / reg[w.first.second])]]--;\n             la[w.first.second] =\n                 u + ((da - hh[w.first.second]) / reg[w.first.second]);\n           }\n         }\n       } else {\n         if (hh[w.first.second] <= da) {\n           x++;\n           if (reg[w.first.second] > 0) {\n             pa[mp[u + 1 + ((da - hh[w.first.second]) / reg[w.first.second])]]--;\n             la[w.first.second] =\n                 u + ((da - hh[w.first.second]) / reg[w.first.second]);\n           } else\n             la[w.first.second] = -1;\n         }\n       }\n     }\n     x += pa[mp[u]];\n     ans = max(ans, (x * bo) + (x * in * u));\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n, k;\n   cin >> n >> k;\n   long long int res = 1;\n   if (k == 1) {\n     cout << n;\n   } else {\n     while (res <= n) res = (long long)(res * 2);\n     cout << res - 1;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double PI = acos(-1);\n const int inf = 99999999;\n int n;\n char c[20];\n int r[20];\n int b[20];\n int dp[1 << 16][123];\n int main() {\n   int n;\n   cin >> n;\n   int maxi = 0;\n   int ans1 = 0;\n   int ans2 = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> c[i] >> r[i] >> b[i];\n     maxi += i;\n     ans1 += r[i];\n     ans2 += b[i];\n   }\n   memset(dp, -1, sizeof(dp));\n   dp[0][0] = 0;\n   for (int i = 1; i < 1 << n; i++) {\n     for (int j = 0; j < n; j++) {\n       if (i >> j & 1) {\n         int R = 0;\n         int B = 0;\n         for (int k = 0; k < n; k++) {\n           if (k != j && i >> k & 1) {\n             R += c[k] == 'R';\n             B += c[k] == 'B';\n           }\n         }\n         R = min(R, r[j]);\n         B = min(B, b[j]);\n         for (int k = 0; k <= maxi; k++) {\n           if (dp[i ^ (1 << j)][k] != -1) {\n             dp[i][k + R] = max(dp[i][k + R], dp[i ^ (1 << j)][k] + B);\n           }\n         }\n       }\n     }\n   }\n   int ans = max(ans1, ans2);\n   for (int i = 0; i <= maxi; i++) {\n     if (dp[(1 << n) - 1][i] != -1) {\n       ans = min(ans, max(ans2 - dp[(1 << n) - 1][i], ans1 - i));\n     }\n   }\n   cout << ans + n;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n void output1(int n) {\n   for (int i = 0; i < n; ++i) {\n     printf('10');\n   }\n   printf('\n');\n }\n void output2(int m) {\n   --m;\n   for (int i = 0; i < m; ++i) {\n     printf('01');\n   }\n   printf('0\n');\n }\n void output3(int n, int m) {\n   if (n == m + 1) {\n     --n;\n     for (int i = 0; i < n; ++i) {\n       printf('10');\n     }\n     printf('1\n');\n     return;\n   }\n   int tmp = n - m - 1;\n   int up = m + 1;\n   up--;\n   for (int i = 0; i < up; ++i) {\n     printf('1');\n     if (tmp) {\n       printf('1');\n       --tmp;\n     }\n     printf('0');\n   }\n   printf('1');\n   if (tmp) {\n     printf('1');\n   }\n   printf('\n');\n }\n int main() {\n   int n, m;\n   while (scanf('%d%d', &m, &n) != EOF) {\n     if (m == n) {\n       output1(n);\n     } else if (m == n + 1) {\n       output2(m);\n     } else if (n > m && n <= 2 * m + 2) {\n       output3(n, m);\n     } else {\n       printf('-1\n');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n #pragma GCC target('sse4')\n const char nl = '\n';\n using namespace std;\n using ll = long long;\n using vi = vector<int>;\n using vl = vector<ll>;\n using pii = pair<int, int>;\n using pll = pair<ll, ll>;\n using str = string;\n str to_string(char c) { return str(1, c); }\n str to_string(bool b) { return b ? 'true' : 'false'; }\n str to_string(const char* second) { return (str)second; }\n str to_string(str second) { return second; }\n template <class A>\n str to_string(complex<A> c) {\n   stringstream ss;\n   ss << c;\n   return ss.str();\n }\n str to_string(vector<bool> v) {\n   str res = '{';\n   for (int i = 0; i < (int)v.size(); i++) res += char('0' + v[i]);\n   res += '}';\n   return res;\n }\n template <size_t SZ>\n str to_string(bitset<SZ> b) {\n   str res = '';\n   for (int i = 0; i < b.size(); i++) res += char('0' + b[i]);\n   return res;\n }\n template <class A, class B>\n str to_string(pair<A, B> p);\n template <class T>\n str to_string(T v) {\n   bool fst = 1;\n   str res = '{';\n   for (const auto& x : v) {\n     if (!fst) res += ', ';\n     fst = 0;\n     res += to_string(x);\n   }\n   res += '}';\n   return res;\n }\n template <class A, class B>\n str to_string(pair<A, B> p) {\n   return '(' + to_string(p.first) + ', ' + to_string(p.second) + ')';\n }\n void DBG() { cerr << ']' << endl; }\n template <class H, class... T>\n void DBG(H h, T... t) {\n   cerr << to_string(h);\n   if (sizeof...(t)) cerr << ', ';\n   DBG(t...);\n }\n string c;\n int n;\n int dp[26][26];\n signed main() {\n   cin.tie(nullptr);\n   ios_base::sync_with_stdio(false);\n   cin >> n;\n   for (int i = 0; i < 26; i++) {\n     for (int j = 0; j < 26; j++) {\n       dp[i][j] = -1e9;\n     }\n   }\n   int ans = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> c;\n     int m = c.length();\n     int a = c[0] - 'a';\n     int b = c[m - 1] - 'a';\n     for (int j = 0; j < 26; j++) {\n       dp[j][b] = max(dp[j][b], dp[j][a] + m);\n     }\n     dp[a][b] = max(dp[a][b], m);\n   }\n   for (int i = 0; i < 26; i++) {\n     ans = max(ans, dp[i][i]);\n   }\n   cout << ans << nl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 5100;\n const long long M = 15;\n const long long mod = 1e9 + 7;\n const long long MOD = 998244353;\n const long long P = 1336;\n const long double eps = 0.000000001;\n const long long inf = 1e9;\n mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());\n long long w[N], b[N], a[N], dp[N], u[N];\n vector<long long> nom[N];\n int32_t main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   srand(time(0));\n   long long n, k, V;\n   cin >> n >> k >> V;\n   long long sum = 0;\n   if (V == 0) {\n     cout << 'YES' << '\n';\n     cout << inf << ' 1 2';\n     return 0;\n   }\n   for (long long i = 0; i < n; i++) {\n     cin >> w[i];\n     sum += w[i];\n     b[i] = w[i] % k;\n     a[i] = w[i] - b[i];\n     if (a[i] > V) a[i] = V / k * k;\n   }\n   if (sum < V) {\n     cout << 'NO';\n     return 0;\n   }\n   dp[0] = 1;\n   for (long long i = 0; i < n; i++) {\n     for (long long j = k; j >= 0; j--) {\n       if (dp[j] != 1) continue;\n       long long per = (j + b[i]) % k;\n       if (per == 0) per = k;\n       if (dp[per]) continue;\n       dp[per] = 2;\n       for (auto to : nom[j]) {\n         nom[per].push_back(to);\n       }\n       nom[per].push_back(i);\n     }\n     for (long long j = k; j >= 0; j--) {\n       if (dp[j] == 2) dp[j] = 1;\n     }\n   }\n   for (long long i = 0; i < n; i++) {\n     long long need = (V - a[i]) % k;\n     if (need == 0) need = k;\n     if (!dp[need] && need != k) continue;\n     long long no = -1;\n     vector<pair<long long, pair<long long, long long> > > g;\n     for (long long j = 0; j < n; j++) {\n       u[j] = 0;\n     }\n     for (auto to : nom[need]) {\n       u[to] = 1;\n     }\n     if (u[i] == 0 && need != k) continue;\n     long long s = 0;\n     for (auto to : nom[need]) {\n       u[to] = 1;\n       if (to == i) {\n         s += w[i];\n         continue;\n       }\n       g.push_back({inf, {to, i}});\n       s += w[to];\n     }\n     long long e = -1;\n     for (long long j = 0; j < n; j++) {\n       if (u[j]) continue;\n       e = j;\n     }\n     if (s < V) {\n       need = (V - s) / k;\n       for (long long j = 0; j < n; j++) {\n         if (u[j] || j == e) continue;\n         long long c = w[j] / k;\n         if (w[j] % k) c++;\n         if (c) g.push_back({c, {j, e}});\n         w[e] += w[j];\n       }\n       long long c = w[e] / k;\n       if (c < need) continue;\n       g.push_back({need, {e, i}});\n     }\n     if (s > V) {\n       need = (s - V) / k;\n       if (i)\n         g.push_back({need, {i, 0}});\n       else\n         g.push_back({need, {i, 1}});\n     }\n     cout << 'YES' << '\n';\n     for (auto to : g) {\n       cout << to.first << ' ' << to.second.first + 1 << ' '\n            << to.second.second + 1 << '\n';\n     }\n     return 0;\n   }\n   cout << 'NO';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 500000 + 24;\n int a[MAX];\n int main() {\n   int n, m, ans, tmp, u, v, fc;\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &a[i]);\n   }\n   m = a[0];\n   ans = 0;\n   for (int i = 0; i < n; i++) {\n     while (i < n && a[i] == m) {\n       i++;\n     }\n     tmp = 0;\n     u = i;\n     if (m == 0) {\n       while (i + 1 < n && a[i] == 1 && a[i + 1] == 0) {\n         tmp++;\n         i += 2;\n       }\n     } else {\n       while (i + 1 < n && a[i] == 0 && a[i + 1] == 1) {\n         tmp++;\n         i += 2;\n       }\n     }\n     v = i;\n     ans = max(ans, tmp);\n     int j = u;\n     for (; j < v - tmp; j++) {\n       a[j] = m;\n     }\n     fc = (i < n) ? a[i] : a[n - 1];\n     for (; j < v; j++) {\n       a[j] = fc;\n     }\n     m = a[i];\n     i--;\n   }\n   printf('%d\n', ans);\n   for (int i = 0; i < n - 1; i++) {\n     printf('%d ', a[i]);\n   }\n   printf('%d\n', a[n - 1]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 2e5 + 10;\n int n, a[maxn], cnt[maxn], mx = 0, last[maxn * 2], ans = 0;\n void solve1(int x) {\n   for (int i = 1; i <= n; i++) last[n - i] = last[n + i] = -1;\n   last[n] = 0;\n   int cur = 0;\n   for (int i = 1; i <= n; i++) {\n     if (a[i] == x)\n       cur++;\n     else if (a[i] == mx)\n       cur--;\n     if (last[n + cur] == -1)\n       last[n + cur] = i;\n     else\n       ans = max(ans, i - last[n + cur]);\n   }\n }\n void solve2(int x) {\n   for (int i = 1; i <= n; i++) cnt[i] = 0;\n   int l = 1, equal = 0;\n   cnt[a[l]]++;\n   if (cnt[a[l]] == x) equal++;\n   for (int i = 2; i <= n; i++) {\n     cnt[a[i]]++;\n     if (cnt[a[i]] == x)\n       equal++;\n     else if (cnt[a[i]] > x) {\n       while (cnt[a[i]] > x) {\n         cnt[a[l]]--;\n         if (cnt[a[l]] == x - 1) equal--;\n         l++;\n       }\n     }\n     if (equal >= 2) ans = max(ans, i - l + 1);\n   }\n }\n int main() {\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n     cnt[a[i]]++;\n     mx = cnt[mx] < cnt[a[i]] ? a[i] : mx;\n   }\n   int limt = sqrt(n);\n   for (int i = 1; i <= n; i++)\n     if (cnt[i] >= limt && i != mx) solve1(i);\n   for (int i = 1; i < limt; i++) solve2(i);\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int arr[6];\n   for (int i = 0; i < 6; i++) {\n     cin >> arr[i];\n   }\n   sort(arr, arr + 6);\n   int tracker[10];\n   for (int i = 0; i < 10; i++) {\n     tracker[i] = 0;\n   }\n   for (int i = 0; i < 6; i++) {\n     tracker[arr[i]]++;\n   }\n   int legs = -1;\n   for (int i = 0; i < 10; i++) {\n     if (tracker[i] >= 4) {\n       legs = i;\n       break;\n     }\n   }\n   if (legs != -1) {\n     int head1 = -1, head2;\n     int taken[6];\n     int takenCounter = 0;\n     for (int i = 0; i < 6; i++) {\n       taken[i] = 0;\n     }\n     for (int i = 0; i < 6; i++) {\n       if (arr[i] == legs) {\n         taken[i] = 1;\n         takenCounter++;\n       }\n       if (takenCounter == 4) {\n         break;\n       }\n     }\n     for (int i = 0; i < 6; i++) {\n       if (taken[i] == 0) {\n         if (head1 == -1) {\n           head1 = arr[i];\n         } else {\n           head2 = arr[i];\n         }\n       }\n     }\n     if (head1 != head2) {\n       cout << 'Bear';\n     } else {\n       cout << 'Elephant';\n     }\n   } else {\n     cout << 'Alien';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s;\n int n, a, b, ans, nr1, nr0, minD;\n int main() {\n   cin >> n >> a >> b;\n   cin >> s;\n   a--;\n   b--;\n   minD = (int)1e8;\n   nr1 = (int)1e8;\n   nr0 = (int)1e8;\n   for (int i = 0; i < s.size(); i++) {\n     if (s[i] == s[a]) {\n       nr1 = i;\n       if (abs(nr1 - nr0) < minD) minD = abs(nr1 - nr0);\n     }\n     if (s[i] == s[b]) {\n       nr0 = i;\n       if (abs(nr0 - nr1) < minD) minD = abs(nr0 - nr1);\n     }\n   }\n   cout << minD;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n void minn(T& a, T b) {\n   if (a > b) a = b;\n }\n template <class T>\n void maxx(T& a, T b) {\n   if (a < b) a = b;\n }\n void debug() { return; }\n template <class H, class... T>\n void debug(H a, T... b) {\n   cerr << a;\n   debug(b...);\n }\n void is() { return; }\n template <class H, class... T>\n void is(H& a, T&... b) {\n   cin >> a;\n   is(b...);\n }\n void os() { return; }\n template <class H, class... T>\n void os(H a, T... b) {\n   cout << a;\n   os(b...);\n }\n const int mod = 1e9 + 7;\n const int N = 2e5 + 5;\n int n, q;\n int nx[N], pr[N], nx100[N];\n void sw(int x, int y) {\n   swap(nx[x], nx[y]);\n   pr[nx[x]] = x;\n   pr[nx[y]] = y;\n   int k = x;\n   for (int i = 1; i <= 100; i++) k = pr[k];\n   for (int i = 1; i <= 105; i++) {\n     nx100[k] = x;\n     x = nx[x];\n     k = nx[k];\n   }\n   k = y;\n   for (int i = 1; i <= 100; i++) k = pr[k];\n   for (int i = 1; i <= 105; i++) {\n     nx100[k] = y;\n     y = nx[y];\n     k = nx[k];\n   }\n }\n void solve() {\n   is(n, q);\n   for (int i = 1; i <= n; i++) {\n     is(nx[i]);\n     pr[nx[i]] = i;\n   }\n   for (int i = 1; i <= n; i++) {\n     int k = i;\n     for (int j = 1; j <= 100; j++) {\n       k = nx[k];\n     }\n     nx100[i] = k;\n   }\n   while (q--) {\n     int t, x, y;\n     is(t, x, y);\n     if (t == 2) {\n       int k = x;\n       while (y >= 100) {\n         y -= 100;\n         k = nx100[k];\n       }\n       while (y--) k = nx[k];\n       os(k, '\n');\n     } else {\n       sw(x, y);\n     }\n   }\n }\n signed main() {\n   ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   int T = 1;\n   while (T--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 5;\n const int mod = 1e9 + 7;\n int n, m, a[N], t[N], r[N], second[N];\n pair<int, int> T[2][N * 4];\n pair<int, int> get_max(int l, int r, int v = 1, int tl = 1, int tr = n) {\n   if (tl > r || tr < l) return make_pair(-mod, 0);\n   if (l <= tl && tr <= r) return T[0][v];\n   int tm = (tl + tr) / 2;\n   return max(get_max(l, r, v * 2, tl, tm),\n              get_max(l, r, v * 2 + 1, tm + 1, tr));\n }\n pair<int, int> get_min(int l, int r, int v = 1, int tl = 1, int tr = n) {\n   if (tl > r || tr < l) return make_pair(mod, 0);\n   if (l <= tl && tr <= r) return T[1][v];\n   int tm = (tl + tr) / 2;\n   return min(get_min(l, r, v * 2, tl, tm),\n              get_min(l, r, v * 2 + 1, tm + 1, tr));\n }\n void upd(int p, int v = 1, int tl = 1, int tr = n) {\n   if (tl == tr) {\n     T[0][v] = T[1][v] = make_pair(a[p], p);\n     return;\n   }\n   int tm = (tl + tr) / 2;\n   if (p <= tm)\n     upd(p, v * 2, tl, tm);\n   else\n     upd(p, v * 2 + 1, tm + 1, tr);\n   T[0][v] = max(T[0][v * 2], T[0][v * 2 + 1]);\n   T[1][v] = min(T[1][v * 2], T[1][v * 2 + 1]);\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n     upd(i);\n   }\n   for (int i = 1; i <= m; i++) cin >> t[i] >> r[i];\n   for (int i = m; i; i--) second[i] = max(second[i + 1], r[i]);\n   for (int i = 1; i <= m; i++) {\n     if (r[i] > second[i + 1]) {\n       if (t[i] == 1) {\n         for (int j = r[i]; j > second[i + 1]; j--) {\n           pair<int, int> x = get_max(1, j);\n           swap(a[x.second], a[j]);\n           upd(x.second);\n           upd(j);\n         }\n       } else {\n         for (int j = r[i]; j > second[i + 1]; j--) {\n           pair<int, int> x = get_min(1, j);\n           swap(a[x.second], a[j]);\n           upd(x.second);\n           upd(j);\n         }\n       }\n     }\n   }\n   for (int i = 1; i <= n; i++) cout << a[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MOD = 1e6 + 3;\n const int INFI = 1e9 * 2;\n const long long LINFI = 1e17;\n const double pi = acos(-1.0);\n const int N = 111;\n const int M = 222222;\n const int move[8][2] = {1, 0, -1, 0, 0, 1, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1};\n int a[N][N];\n int main() {\n   int n, m;\n   while (scanf('%d', &n) != EOF) {\n     for (int i = 0; i < n; i++)\n       for (int j = 0; j < n; j++) scanf('%d', &a[i][j]);\n     if (n == 1)\n       printf('%d\n', 0);\n     else {\n       for (int i = 0; i < n; i++) {\n         m = 0;\n         for (int j = 0; j < n; j++)\n           if (i != j) m |= a[i][j];\n         printf('%d ', m);\n       }\n       printf('\n');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize(2)\n using namespace std;\n const long long inff = 0x3f3f3f3f3f3f3f3f;\n const int N = 5e2 + 8;\n int n, kk, a[N], dp[2][N][N];\n int main() {\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n >> kk;\n   int qw = 0;\n   dp[qw ^ 1][0][0] = 1;\n   for (int i(1); i <= (n); ++i) {\n     scanf('%d', &a[i]);\n     for (int j(0); j <= (kk); ++j)\n       for (int k(0); k <= (kk); ++k) dp[qw][j][k] = dp[qw ^ 1][j][k];\n     for (int j(kk); j >= (a[i]); --j)\n       for (int k(kk); k >= (0); --k)\n         dp[qw][j][k] = max(dp[qw][j][k], dp[qw ^ 1][j - a[i]][k]);\n     for (int j(kk); j >= (a[i]); --j)\n       for (int k(kk); k >= (0); --k)\n         dp[qw][k][j] = max(dp[qw][k][j], dp[qw ^ 1][k][j - a[i]]);\n     qw ^= 1;\n   }\n   qw ^= 1;\n   int num = 0;\n   for (int i(0); i <= (kk); ++i)\n     if (dp[qw][i][kk - i]) num++;\n   cout << num << endl;\n   for (int i(0); i <= (kk); ++i)\n     if (dp[qw][i][kk - i]) printf('%d ', i);\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s1, s2, s3;\n int win(string s1, string s2) {\n   if (s1 == 'rock') {\n     if (s2 == 'rock') return 0;\n     if (s2 == 'scissors') return 1;\n     if (s2 == 'paper') return 2;\n   }\n   if (s1 == 'paper') {\n     if (s2 == 'rock') return 1;\n     if (s2 == 'scissors') return 2;\n     if (s2 == 'paper') return 0;\n   }\n   if (s1 == 'scissors') {\n     if (s2 == 'rock') return 2;\n     if (s2 == 'scissors') return 0;\n     if (s2 == 'paper') return 1;\n   }\n }\n int main() {\n   cin >> s1 >> s2 >> s3;\n   if (win(s1, s2) == 1 && win(s1, s3) == 1) {\n     cout << 'F';\n     return 0;\n   }\n   if (win(s2, s1) == 1 && win(s2, s3) == 1) {\n     cout << 'M';\n     return 0;\n   }\n   if (win(s3, s1) == 1 && win(s3, s2) == 1) {\n     cout << 'S';\n     return 0;\n   }\n   cout << '?';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, a[101];\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) scanf('%d', &a[i]);\n   sort(a, a + n);\n   int i = 1;\n   while (a[i] == a[i - 1] && i < n) i++;\n   if (i == n)\n     printf('NO\n');\n   else\n     printf('%d\n', a[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using namespace placeholders;\n template <class T>\n void mini(T &l, T r) {\n   l = min(l, r);\n }\n template <class T>\n void maxi(T &l, T r) {\n   l = max(l, r);\n }\n template <class TH>\n void _dbg(const char *sdbg, TH h) {\n   cerr << sdbg << '=' << h << '\n';\n }\n template <class TH, class... TA>\n void _dbg(const char *sdbg, TH h, TA... a) {\n   while (*sdbg != ',') cerr << *sdbg++;\n   cerr << '=' << h << ',';\n   _dbg(sdbg + 1, a...);\n }\n template <class T>\n ostream &operator<<(ostream &os, vector<T> v) {\n   os << '[';\n   for (auto vv : v) os << vv << ',';\n   return os << ']';\n }\n template <class L, class R>\n ostream &operator<<(ostream &os, pair<L, R> p) {\n   return os << '(' << p.first << ',' << p.second << ')';\n }\n using llint = long long;\n const int B = 1e9 + 7;\n int a[40][40];\n llint mem[40], cnt[40];\n void add(llint &a, llint b) {\n   a = (a + b) % B;\n   if (a < 0) a += B;\n }\n void init() {\n   mem[0] = 1;\n   cnt[0] = 1;\n   for (int i = 1; i < 40; ++i) {\n     int c = 1 << (i - 1);\n     cnt[i] = cnt[i - 1] * 4 % B;\n     add(mem[i], mem[i - 1] * 4 % B + 1ll * c * c % B * c % B * 2 % B);\n   }\n }\n llint calc(llint a, llint b) {\n   a %= B, b %= B;\n   return ((a + b) * (b - a + 1) / 2) % B;\n }\n pair<llint, llint> get(int x, int y, int k, int d) {\n   llint ret = 0;\n   int sz = 1 << d;\n   if (x < y) swap(x, y);\n   if (x <= 0 || y <= 0 || k <= 0) return make_pair(0, 0);\n   if (x >= sz) {\n     llint a = min(k, sz);\n     llint b = min(y, sz);\n     ret = calc(1, a) * b % B;\n     ;\n     return make_pair(b * calc(1, a) % B, b * a % B);\n   }\n   if (d == 0) return make_pair(1 <= k, 1 <= k);\n   int t = 1 << (d - 1);\n   auto t1 = get(x, y, k, d - 1);\n   auto t2 = get(x - t, y, k - t, d - 1);\n   auto t3 = get(y, y - t, k - t, d - 1);\n   auto t4 = get(x - t, y - t, k, d - 1);\n   ;\n   add(ret, t1.first);\n   add(ret, t2.first + t2.second * t % B);\n   add(ret, t3.first + t3.second * t % B);\n   add(ret, t4.first);\n   llint c = 0;\n   add(c, t1.second);\n   add(c, t2.second);\n   add(c, t3.second);\n   add(c, t4.second);\n   ;\n   return make_pair(ret, c);\n }\n llint go(int x1, int y1, int x2, int y2, int k) {\n   llint ret = 0;\n   add(ret, get(x2, y2, k, 30).first);\n   add(ret, -get(x1 - 1, y2, k, 30).first);\n   add(ret, -get(x2, y1 - 1, k, 30).first);\n   add(ret, get(x1 - 1, y1 - 1, k, 30).first);\n   return ret;\n }\n void run() {\n   init();\n   ;\n   int q;\n   scanf('%d', &q);\n   for (int i = 1; i <= q; ++i) {\n     int x1, y1, x2, y2, k;\n     scanf('%d%d%d%d%d', &x1, &y1, &x2, &y2, &k);\n     printf('%lld\n', go(x1, y1, x2, y2, k));\n   }\n }\n int main() {\n   run();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1e9 + 7;\n const long long up = 2e5 + 5;\n pair<int, int> pt[2005];\n inline bool cmp(const pair<int, int>& a, const pair<int, int>& b) {\n   if (a.first == b.first) return a.second < b.second;\n   return a.first < b.first;\n }\n long long fac[up], inv[up], facinv[up], facinv2[up];\n long long pow_mod(long long a, long long k) {\n   long long res = 1;\n   while (k) {\n     if (k & 1) res = (res * a) % mod;\n     a = (a * a) % mod;\n     k >>= 1;\n   }\n   return res;\n }\n void init() {\n   fac[0] = fac[1] = 1;\n   for (long long i = 2; i < up; ++i) fac[i] = fac[i - 1] * i % mod;\n   inv[1] = 1, facinv[0] = facinv[1] = 1;\n   facinv2[0] = facinv2[1] = 1;\n   for (long long i = 2; i < up; ++i) {\n     long long t = mod / i, k = mod % i;\n     inv[i] = i * t * t % mod * inv[k] % mod * inv[k] % mod;\n     facinv[i] = facinv[i - 1] * inv[i] % mod;\n   }\n }\n long long C(long long n, long long m) {\n   return fac[n] * facinv[n - m] % mod * facinv[m] % mod;\n }\n long long ans[2005];\n int main() {\n   init();\n   int h, w, k;\n   cin >> h >> w >> k;\n   for (long long i = 0; i < k; ++i) cin >> pt[i].first >> pt[i].second;\n   pt[k].first = h, pt[k].second = w;\n   ++k;\n   sort(pt, pt + k, cmp);\n   for (long long i = 0; i < k; ++i) {\n     ans[i] = C(pt[i].first + pt[i].second - 2, pt[i].first - 1);\n     for (long long j = 0; j < i; ++j) {\n       ans[i] -= ans[j] *\n                 C(pt[i].first - pt[j].first + pt[i].second - pt[j].second,\n                   pt[i].first - pt[j].first) %\n                 mod;\n       ans[i] = (ans[i] + mod) % mod;\n     }\n   }\n   cout << ans[k - 1] << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int big = ((long long int)1 << 30);\n const long long int mod = 1000000007;\n int main(void) {\n   int n, m, ans = 0, i, q, w, gen = 0;\n   vector<int> kaz;\n   vector<bool> uma;\n   scanf('%d %d', &n, &m);\n   m--;\n   kaz.resize(n);\n   uma.resize(n + 1);\n   for (i = 0; i < n; i++) {\n     scanf('%d', &q);\n     if (i == m && q != 0) {\n       ans++;\n       q = 0;\n     }\n     if (i != m && q == 0) {\n       q = n;\n     }\n     kaz[i] = q;\n     uma[q] = 1;\n   }\n   sort(kaz.begin(), kaz.end());\n   while (-1) {\n     for (; gen <= n; gen++) {\n       if (uma[gen] == 0) {\n         break;\n       }\n     }\n     if (kaz.back() <= gen) {\n       break;\n     }\n     ans++;\n     kaz.pop_back();\n     uma[gen] = 1;\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int INF_INT = 0x3f3f3f3f;\n const long long INF_LL = 0x7f7f7f7f;\n const int MOD = 1e9 + 7;\n const double eps = 1e-10;\n const double pi = acos(-1);\n using namespace std;\n const int N = 200200;\n int n, m, q;\n int u[N], v[N];\n struct Query {\n   int l, r, s, t, id;\n   Query(int l, int r, int s, int t, int id) : l(l), r(r), s(s), t(t), id(id) {}\n   Query() {}\n   bool operator<(const Query& rhs) const { return l > rhs.l; }\n };\n vector<Query> qs;\n int dp[1010][1010];\n int ans[N];\n int main(int argc, char const* argv[]) {\n   scanf('%d%d%d', &n, &m, &q);\n   for (int i = 1; i <= m; i++) scanf('%d%d', &u[i], &v[i]);\n   for (int i = 1; i <= q; i++) {\n     int l, r, s, t;\n     scanf('%d%d', &l, &r);\n     scanf('%d%d', &s, &t);\n     qs.emplace_back(l, r, s, t, i);\n   }\n   sort(qs.begin(), qs.end());\n   memset((dp), (INF_INT), sizeof(dp));\n   for (int i = 1; i <= n; i++) dp[i][i] = 0;\n   int cnt = 0;\n   for (int i = m; i >= 1; i--) {\n     dp[u[i]][v[i]] = dp[v[i]][u[i]] = i;\n     for (int j = 1; j <= n; j++) {\n       if (j != u[i]) dp[v[i]][j] = min(dp[v[i]][j], dp[u[i]][j]);\n       if (j != v[i]) dp[u[i]][j] = min(dp[u[i]][j], dp[v[i]][j]);\n     }\n     while (cnt < qs.size() && qs[cnt].l >= i) {\n       ans[qs[cnt].id] = dp[qs[cnt].s][qs[cnt].t] <= qs[cnt].r;\n       cnt++;\n     }\n   }\n   for (int i = 1; i <= q; i++) puts(ans[i] ? 'Yes' : 'No');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool deb = false;\n int n;\n vector<int> p, b;\n void init() {\n   if (!deb) return;\n   p.resize(n);\n   for (auto& x : p) cin >> x;\n   b.resize(n);\n   for (int i = 0; i < n; ++i) b[p[i]] = i;\n }\n int get(int i, int j) {\n   if (deb) return p[i] ^ b[j];\n   cout << '? ' << i << ' ' << j << endl;\n   int x;\n   cin >> x;\n   if (x == -1) exit(0);\n   return x;\n }\n void ans(int cnt, vector<int> p) {\n   cout << '!\n';\n   cout << cnt << endl;\n   for (int x : p) cout << x << ' ';\n   cout << endl;\n }\n int main() {\n   cin >> n;\n   init();\n   vector<int> a(n);\n   for (int i = 0; i < n; ++i) a[i] = get(0, i);\n   vector<int> x(n);\n   for (int i = 0; i < n; ++i) x[i] = get(i, 0);\n   int cnt = 0;\n   vector<int> pans;\n   for (int i = 0; i < n; ++i) {\n     vector<int> b(n);\n     for (int j = 0; j < n; ++j) b[j] = i ^ a[j];\n     vector<int> arr(n);\n     for (int i : b)\n       if (i < n) ++arr[i];\n     if (count(arr.begin(), arr.end(), 1) != n) continue;\n     vector<int> p(n);\n     for (int j = 0; j < n; ++j) p[b[j]] = j;\n     bool f = true;\n     for (int j = 0; j < n; ++j)\n       if ((p[j] ^ b[0]) != x[j]) f = false;\n     if (f) ++cnt, pans = p;\n   }\n   ans(cnt, pans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   int n, k;\n   while (cin >> n >> k) {\n     int r = n, l = 1;\n     cout << l;\n     l++;\n     for (int i = 1; i < k; i++)\n       if (i % 2) {\n         cout << ' ' << r;\n         r--;\n       } else {\n         cout << ' ' << l;\n         l++;\n       }\n     if (k % 2)\n       for (int i = k; i < n; i++, l++) cout << ' ' << l;\n     else\n       for (int i = k; i < n; i++, r--) cout << ' ' << r;\n     cout << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long m[1000005], n[1000005], w[1000005];\n int main() {\n   long long a, b, c;\n   char ch[10];\n   while ((scanf('%lld%lld%lld', &a, &b, &c)) != EOF) {\n     long long t;\n     scanf('%lld', &t);\n     long long p = 0, q = 0, r, sum1 = 0, sum2 = 0, f;\n     for (int i = 0; i < t; i++) {\n       scanf('%lld', &f);\n       scanf('%s', ch);\n       if (ch[0] == 'U')\n         m[p++] = f;\n       else\n         n[q++] = f;\n     }\n     sort(m, m + p);\n     sort(n, n + q);\n     long long i, j;\n     long long l = 0;\n     for (i = 0; i < a && i < p; i++) {\n       sum2 += m[i];\n       sum1++;\n     }\n     while (m[i]) {\n       w[l++] = m[i++];\n     }\n     for (i = 0; i < b && i < q; i++) {\n       sum2 += n[i];\n       sum1++;\n     }\n     while (n[i]) w[l++] = n[i++];\n     sort(w, w + l);\n     for (int i = 0; i < c && i < l; i++) {\n       sum2 += w[i];\n       sum1++;\n     }\n     printf('%lld %lld\n', sum1, sum2);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n char s[25][25];\n int c[25][25];\n int chs[1 << 21];\n int dp[1 << 21];\n vector<int> hv;\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < n; ++i) {\n     scanf('%s', s[i]);\n   }\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < m; ++j) {\n       scanf('%d', c[i] + j);\n     }\n   }\n   memset(chs, 0x3f, sizeof(chs));\n   for (int i = 0; i < n; ++i) {\n     hv.push_back(1 << i);\n     for (int j = 0; j < m; ++j) {\n       chs[1 << i] = min(chs[1 << i], c[i][j]);\n     }\n   }\n   for (int i = 0; i < m; ++i) {\n     for (int j = 0; j < 26; ++j) {\n       int num = 0, maxx = 0, sum = 0;\n       for (int k = 0; k < n; ++k) {\n         if (s[k][i] == j + 'a') {\n           num |= 1 << k;\n           maxx = max(maxx, c[k][i]);\n           sum += c[k][i];\n         }\n       }\n       if (!num) {\n         continue;\n       }\n       if (chs[num] == 0x3f3f3f3f) {\n         hv.push_back(num);\n       }\n       chs[num] = min(chs[num], sum - maxx);\n     }\n   }\n   memset(dp, 0x3f, sizeof(dp));\n   dp[0] = 0;\n   for (int i = 0; i < (1 << n) - 1; ++i) {\n     for (int j : hv) {\n       dp[i | j] = min(dp[i | j], dp[i] + chs[j]);\n     }\n   }\n   printf('%d\n', dp[(1 << n) - 1]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize(2)\n using namespace std;\n const long long mod = 998244353;\n const long long maxn = 3e5 + 10;\n long long p[2] = {1000000007, 998244353};\n long long seed[2] = {500000004, 500000004};\n int main() {\n   int x, a[6];\n   scanf('%d', &x);\n   for (int i = 0; i < 6; i++)\n     if (x & (1 << i))\n       a[i] = 1;\n     else\n       a[i] = 0;\n   swap(a[0], a[4]);\n   swap(a[2], a[3]);\n   int y = 0;\n   for (int i = 0; i < 6; i++)\n     if (a[i]) y += 1 << i;\n   printf('%d\n', y);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int n;\n long long int u;\n string s;\n int q;\n int count(long long int number) {\n   if (!number) return 0;\n   int result = 0;\n   while (number % 2 == 0) {\n     result++;\n     number >>= 1;\n   }\n   return result;\n }\n long long int solve(long long int start, string s) {\n   int tmp = count(n + 1) - 1;\n   for (int i = 0; i < s.size(); ++i) {\n     int zeros = count(start);\n     long long int total = ((long long int)1 << (zeros + 1)) - 1;\n     if (s[i] == 'U') {\n       if (zeros < tmp) {\n         long long int tmp_one = start + (total - 1) / 2 + 1;\n         long long int tmp_two = start - (total - 1) / 2 - 1;\n         if (count(tmp_one) == zeros + 1) {\n           start = tmp_one;\n         } else\n           start = tmp_two;\n       }\n     } else {\n       if (s[i] == 'L') {\n         if (zeros) {\n           long long int left = (total - 1) / 2;\n           start = start - left + ((left - 1) / 2);\n         }\n       } else {\n         if (s[i] == 'R') {\n           if (zeros) {\n             long long int right = (total - 1) / 2;\n             start = start + (right - 1) / 2 + 1;\n           }\n         }\n       }\n     }\n   }\n   return start;\n }\n int main() {\n   cin >> n >> q;\n   for (int i = 0; i < q; ++i) {\n     cin >> u >> s;\n     cout << solve(u, s) << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int boss = 2e5;\n map<int, int> used;\n queue<int> q;\n int n, k, c[2], a[boss + 10];\n int main() {\n   int i, answer = 0;\n   cin >> n >> k;\n   for (i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n     if (used[a[i]] || c[a[i] % 2] == n / 2)\n       q.push(i);\n     else\n       used[a[i]] = 1, c[a[i] % 2]++;\n   }\n   for (i = 1; i <= k && !q.empty(); i++) {\n     if (used[i]) continue;\n     if (c[i % 2] < n / 2) {\n       c[i % 2]++;\n       answer++;\n       a[q.front()] = i;\n       q.pop();\n     }\n   }\n   if (!q.empty())\n     return printf('-1'), 0;\n   else {\n     cout << answer << endl;\n     for (i = 1; i <= n; i++) printf('%d ', a[i]);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mx = 2e5 + 10;\n int main() {\n   int n, arr[mx], temp, z = 0;\n   queue<int> visit;\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &arr[i]);\n     if (arr[i] == 0) visit.push(i);\n   }\n   temp = visit.front();\n   visit.pop();\n   for (int i = 0; i < n; i++) {\n     if (arr[i] != 0) {\n       if (visit.size() > 0) {\n         if (abs(visit.front() - i) < abs(i - temp)) {\n           temp = visit.front();\n           visit.pop();\n         }\n       }\n       printf('%d', abs(i - temp));\n     } else {\n       if (i != n - 1) {\n         if (arr[i + 1] == 0) {\n           temp = visit.front();\n           visit.pop();\n         }\n       }\n       printf('0');\n     }\n     if (i != n - 1) printf(' ');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T> inline int len(const T &a) { return a.size(); }\n \n int main() {\n 	ios_base::sync_with_stdio(false);\n 	cin.tie(nullptr);\n 	int tc;\n 	cin >> tc;\n 	while (tc--) {\n 		int n, m;\n 		cin >> n >> m;\n 		vector<int> k(n);\n 		vector<int> c(m);\n 		for (auto &i : k) {\n 			cin >> i;\n 			--i;\n 		}\n 		for (auto &i : c) {\n 			cin >> i;\n 		}\n 		\n 		sort(k.rbegin(), k.rend());\n 		int ptr = 0;\n 		long long ans = 0;\n 		for (int i = 0; i < n; ++i) {\n 			if (ptr > k[i] || c[k[i]] == c[ptr]) {\n 				ans += c[k[i]];\n 			} else {\n 				ans += c[ptr++];\n 			}\n 		}\n 		\n 		cout << ans << '\n';\n 	}\n 	return 0;\n }\n \n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 610001;\n const long long inf = (long long)5e16;\n struct node {\n   long long val, id;\n };\n node a[N], b[N];\n bool cmp(node x, node y) {\n   if (x.val == y.val) return x.id < y.id;\n   return x.val < y.val;\n }\n long long n, m, ans[N], pos[N];\n signed main() {\n   scanf('%lld%lld', &m, &n);\n   for (long long i = 1; i <= n; i++) {\n     scanf('%lld', &a[i].val);\n     a[i].id = i;\n   }\n   for (long long i = n + 1; i <= n + n; i++) {\n     scanf('%lld', &b[i].val);\n     b[i].id = i - n;\n     b[i + n].val = b[i].val + m;\n     b[i + n].id = i - n;\n     b[i - n].val = b[i].val - m;\n     b[i - n].id = i - n;\n   }\n   sort(a + 1, a + n + 1, cmp);\n   sort(b + 1, b + 3 * n + 1, cmp);\n   for (long long i = 1, j = 1; i <= n; i++) {\n     while (a[i].val >= b[j].val && j <= 3 * n) j++;\n     ans[0] += a[i].val;\n     ans[j - i + 1] -= (a[i].val + a[i].val);\n   }\n   for (long long i = 1, j = 1; j <= 3 * n; j++) {\n     ans[max(j - n + 1, 0LL)] -= b[j].val;\n     while (b[j].val > a[i].val && i <= n) i++;\n     ans[j - i + 2] += b[j].val + b[j].val;\n     ans[j + 1] -= b[j].val;\n   }\n   long long sum = ans[0], id = 0, mi = inf;\n   for (long long i = 1; i <= 2 * n + 1; i++) {\n     sum += ans[i];\n     ans[i] += ans[i - 1];\n     if (mi > sum) {\n       mi = sum;\n       id = i;\n     }\n   }\n   cout << mi << endl;\n   for (long long i = 1; i <= n; i++) pos[a[i].id] = b[i + id - 1].id;\n   for (long long i = 1; i <= n; i++) printf('%d ', pos[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int k, n, a;\n int d[1001];\n bool vis[1001], flag;\n int main() {\n   scanf('%d%d', &n, &k);\n   int cut = 0;\n   for (int i = 2; i <= k; i++) {\n     if (k % i) continue;\n     int crt = 1;\n     while (k % i == 0) {\n       crt *= i;\n       k /= i;\n     }\n     d[cut++] = crt;\n   }\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &a);\n     for (int j = 0; j < cut; j++) {\n       if (a % d[j] == 0) {\n         vis[j] = true;\n       }\n     }\n   }\n   flag = true;\n   for (int j = 0; j < cut; j++) {\n     flag &= vis[j];\n   }\n   if (flag)\n     printf('Yes\n');\n   else\n     printf('No\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int dx[] = {0, 1, -1, 0, 0};\n const int dy[] = {0, 0, 0, 1, -1};\n struct MinCostMaxFlow {\n   int head[20010], total;\n   int next[1000010], aim[1000010], flow[1000010], cost[1000010];\n   int f[20010], from[20010], p[20010];\n   bool v[20010];\n   MinCostMaxFlow() : total(1) {}\n   void Add(int x, int y, int f, int c) {\n     next[++total] = head[x];\n     aim[total] = y;\n     flow[total] = f;\n     cost[total] = c;\n     head[x] = total;\n   }\n   void Insert(int x, int y, int f, int c) {\n     Add(x, y, f, c);\n     Add(y, x, 0, -c);\n   }\n   bool SPFA() {\n     static queue<int> q;\n     while (!q.empty()) q.pop();\n     memset(f, 0x3f, sizeof(f));\n     memset(v, false, sizeof(v));\n     f[0] = 0;\n     q.push(0);\n     while (!q.empty()) {\n       int x = q.front();\n       q.pop();\n       v[x] = false;\n       for (int i = head[x]; i; i = next[i])\n         if (flow[i] && f[aim[i]] > f[x] + cost[i]) {\n           f[aim[i]] = f[x] + cost[i];\n           if (!v[aim[i]]) v[aim[i]] = true, q.push(aim[i]);\n           from[aim[i]] = x;\n           p[aim[i]] = i;\n         }\n     }\n     return f[(20010 - 1)] != 0x3f3f3f3f;\n   }\n   int EdmondsKarp() {\n     int re = 0;\n     while (SPFA()) {\n       int max_flow = 0x3f3f3f3f;\n       for (int i = (20010 - 1); i != 0; i = from[i])\n         max_flow = ((max_flow) < (flow[p[i]]) ? (max_flow) : (flow[p[i]]));\n       for (int i = (20010 - 1); i != 0; i = from[i]) {\n         flow[p[i]] -= max_flow;\n         flow[p[i] ^ 1] += max_flow;\n       }\n       re += f[(20010 - 1)] * max_flow;\n     }\n     return re;\n   }\n } solver;\n int m, n;\n int src[110][110];\n int main() {\n   cin >> m >> n;\n   for (int i = 1; i <= m; ++i)\n     for (int j = 1; j <= n; ++j) scanf('%d', &src[i][j]);\n   for (int i = 1; i <= m; ++i)\n     for (int j = 1; j <= n; ++j) {\n       if (i + j & 1) {\n         solver.Insert(0, ((i - 1) * n + j), 1, 0);\n         for (int k = 1; k <= 4; ++k) {\n           int fx = i + dx[k], fy = j + dy[k];\n           if (!fx || !fy || fx > m || fy > n) continue;\n           solver.Insert(((i - 1) * n + j), ((fx - 1) * n + fy), 1,\n                         src[i][j] != src[fx][fy]);\n         }\n       } else\n         solver.Insert(((i - 1) * n + j), (20010 - 1), 1, 0);\n     }\n   cout << solver.EdmondsKarp() << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 2e5 + 51;\n struct BIT {\n   int x[MAXN];\n   inline void add(int pos, int val);\n   inline int query(int pos);\n };\n BIT bit;\n int n, tp, res, totd, r;\n int x[MAXN], d[MAXN], st[MAXN], f[MAXN], g[MAXN];\n long long int dsc[MAXN];\n inline int read() {\n   register int num = 0, neg = 1;\n   register char ch = getchar();\n   while (!isdigit(ch) && ch != '-') {\n     ch = getchar();\n   }\n   if (ch == '-') {\n     neg = -1;\n     ch = getchar();\n   }\n   while (isdigit(ch)) {\n     num = (num << 3) + (num << 1) + (ch - '0');\n     ch = getchar();\n   }\n   return num * neg;\n }\n inline void BIT::add(int pos, int val) {\n   for (; pos; pos -= pos & -pos) {\n     x[pos] = max(x[pos], val);\n   }\n }\n inline int BIT::query(int pos) {\n   int res = 0;\n   for (; pos <= totd; pos += pos & -pos) {\n     res = max(res, x[pos]);\n   }\n   return res;\n }\n int main() {\n   n = read();\n   for (register int i = 0; i <= n + 1; i++) {\n     x[i] = read();\n   }\n   for (register int i = 1; i <= n; i++) {\n     d[i] = read();\n   }\n   for (register int i = 1; i <= n; i++) {\n     while (tp && x[i] > (long long int)2 * d[st[tp]] + x[f[st[tp]]]) {\n       tp--;\n     }\n     f[i] = st[tp];\n     while (tp && (long long int)2 * d[i] + x[f[i]] >=\n                      (long long int)2 * d[st[tp]] + x[f[st[tp]]]) {\n       tp--;\n     }\n     st[++tp] = i;\n   }\n   st[tp = 0] = n + 1, res = x[n + 1];\n   for (register int i = n; i; i--) {\n     while (tp && x[i] < x[g[st[tp]]] - (long long int)2 * d[st[tp]]) {\n       tp--;\n     }\n     g[i] = st[tp];\n     while (tp && x[g[i]] - (long long int)2 * d[i] <=\n                      x[g[st[tp]]] - (long long int)2 * d[st[tp]]) {\n       tp--;\n     }\n     st[++tp] = i;\n   }\n   for (register int i = 1; i <= n; i++) {\n     if (x[g[i]] - x[f[i]] <= 2 * d[i]) {\n       return puts('0'), 0;\n     }\n   }\n   for (register int i = 1; i <= n; i++) {\n     res = min(res, x[g[i]] - x[f[i]]);\n     x[i] - x[f[i]] < (long long int)2 * d[i]\n         ? dsc[++totd] = (long long int)2 * d[i] + x[f[i]]\n         : 1;\n     f[i] == 0 && x[g[i]] - x[i] < (long long int)2 * d[i] ? res = min(res, x[i])\n                                                           : 1;\n     g[i] == n + 1 && x[i] - x[f[i]] < (long long int)2 * d[i]\n         ? res = min(res, x[n + 1] - x[i])\n         : 1;\n   }\n   sort(dsc + 1, dsc + totd + 1),\n       totd = unique(dsc + 1, dsc + totd + 1) - dsc - 1;\n   for (register int i = 1; i <= n; i++) {\n     if (x[g[i]] - x[i] < (long long int)2 * d[i]) {\n       r = lower_bound(dsc + 1, dsc + totd + 1,\n                       x[g[i]] - (long long int)2 * d[i]) -\n           dsc;\n       if (r = bit.query(r)) {\n         res = min(res, x[i] - r);\n       }\n     }\n     if (x[i] - x[f[i]] < (long long int)2 * d[i]) {\n       r = lower_bound(dsc + 1, dsc + totd + 1,\n                       x[f[i]] + (long long int)2 * d[i]) -\n           dsc;\n       bit.add(r, x[i]);\n     }\n   }\n   printf('%.1lf\n', res * 0.5);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int T, N, M;\n int A[300][300];\n int dx[4] = {0, 1, 0, -1};\n int dy[4] = {1, 0, -1, 0};\n int main() {\n   scanf('%d', &T);\n   for (; T--;) {\n     scanf('%d%d', &N, &M);\n     bool ok = true;\n     for (int i = 0; i < N; i++)\n       for (int j = 0; j < M; j++) {\n         scanf('%d', &A[i][j]);\n         int cnt = 0;\n         for (int r = 0; r < 4; r++) {\n           int x = i + dx[r], y = j + dy[r];\n           if (0 <= x && x < N && 0 <= y && y < M) cnt++;\n         }\n         if (A[i][j] > cnt)\n           ok = false;\n         else\n           A[i][j] = cnt;\n       }\n     if (ok) {\n       puts('YES');\n       for (int i = 0; i < N; i++) {\n         for (int j = 0; j < M; j++)\n           printf('%d%c', A[i][j], j + 1 == M ? '\n' : ' ');\n       }\n     } else\n       puts('NO');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n void solve() {\n   int n;\n   cin >> n;\n   vector<vector<int>> a(5, vector<int>(n));\n   for (int i = 0; i < n; i++) {\n     string s;\n     cin >> s;\n     vector<int> 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<int>());\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 <bits/stdc++.h>\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<long long> v, vv[5010];\n map<long long, long long> 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 <bits/stdc++.h>\n using namespace std;\n \n typedef long long ll;\n typedef pair<int, int> 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<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y);}\n template<class T, class U> void umax(T& x, const U& y){ x = max(x, (T)y);}\n template<class T, class U> void init(vector<T> &v, U x, size_t n) { v=vector<T>(n, (T)x); }\n template<class T, class U, typename... W> void init(vector<T> &v, U x, size_t n, W... m) { v=vector<T>(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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int MAX = 2e5;\n int arr[MAX];\n int main() {\n   int T;\n   cin >> T;\n   while (T--) {\n     int n;\n     cin >> n;\n     for (int i = 0; i < n; i++) {\n       int c;\n       cin >> c;\n       arr[c - 1] = i;\n     }\n     int l = arr[0], r = arr[0];\n     for (int i = 0; i < n; i++) {\n       if (arr[i] < l)\n         l = arr[i];\n       else if (arr[i] > r)\n         r = arr[i];\n       if (i == r - l)\n         cout << 1;\n       else\n         cout << 0;\n     }\n     cout << '\n';\n   }\n }\n "}
+{"func_code_string": "#include<iostream>\n #include<cstdio>\n #include<cmath>\n #include<algorithm>\n #include<string.h>\n #include<map>\n #include<vector>\n #include<string>\n using namespace std;\n const int maxN =  3e5+ 10;\n typedef long long int ll;\n #define mod 998244353\n ll dp[maxN];\n ll f[maxN];\n string c[maxN];\n int main()\n {\n \n     int n,m;\n     scanf('%d%d',&n,&m);\n     f[0]=1;\n     for(int i=1;i<=n*m;i++)\n     {\n         f[i]=f[i-1]*2%mod;\n     }\n     dp[0]=dp[1]=0;\n     for(int i=2;i<=max(n,m);i++)\n         dp[i]=(dp[i-1]+dp[i-2]*2%mod+f[i-2])%mod;\n \n     for(int i=1;i<=n;i++)\n         cin>>c[i];\n     ll sum=0;\n     for(int i=1;i<=n;i++)\n         for(int j=0;j<m;j++)\n             if(c[i][j]=='o') sum++;\n \n     //cout<<dp[4]<<endl;\n \n     ll ans=0;\n     for(int i=1;i<=n;i++)\n     {\n         for(int j=0;j<m;j++)\n         {\n             int num=0;\n             if(c[i][j]=='o')\n             {\n                 while(j<m&&c[i][j]=='o') j++,num++;\n                 //cout<<num<<endl;\n                 ans=(ans+dp[num]*f[sum-num])%mod;\n             }\n         }\n     }\n     for(int i=0;i<m;i++)\n     {\n         for(int j=1;j<=n;j++)\n         {\n             int num=0;\n             if(c[j][i]=='o')\n             {\n                 while(j<=n&&c[j][i]=='o') j++,num++;\n                 //cout<<num<<endl;\n                 ans=(ans+dp[num]*f[sum-num])%mod;\n             }\n         }\n     }\n     cout<<ans<<endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int mp[28];\n bool fl[28];\n int main() {\n   int n, k;\n   cin >> n >> k;\n   string s;\n   cin >> s;\n   memset(mp, 0, sizeof(mp));\n   for (int i = 0; i < s.size(); i++) {\n     mp[s[i] - 'a' + 1]++;\n   }\n   int cnt = 0;\n   int ans = 0;\n   for (int i = 1; i <= 26; i++) {\n     if (mp[i] != 0 && fl[i - 1] == 0) {\n       ans += i;\n       cnt++;\n       fl[i] = 1;\n     }\n     if (cnt >= k) break;\n   }\n   if (cnt == k)\n     cout << ans << endl;\n   else\n     cout << '-1' << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void upd(long long &x, long long y) { x += y; }\n struct node {\n   int nxt;\n   long long sta, v[10];\n   node() {\n     nxt = 0;\n     memset(v, 0, sizeof(v));\n   }\n };\n struct state {\n   vector<node> nodes;\n   int head[100007];\n   state() { memset(head, -1, sizeof(head)); }\n   size_t size() const { return nodes.size(); }\n   void sum() {\n     for (int i = 0; i < nodes.size(); i++)\n       for (int j = 1; j <= 9; j++) upd(nodes[i].v[j], nodes[i].v[j - 1]);\n   }\n   void update(int at, long long key, long long v) {\n     int tmp = key % 100007;\n     for (int i = head[tmp]; i != -1; i = nodes[i].nxt)\n       if (nodes[i].sta == key) {\n         upd(nodes[i].v[at], v);\n         return;\n       }\n     node now;\n     now.nxt = head[tmp];\n     head[tmp] = nodes.size();\n     now.v[at] = v;\n     now.sta = key;\n     nodes.push_back(now);\n   }\n   long long find(int at, long long key) {\n     int tmp = key % 100007;\n     for (int i = head[tmp]; i != -1; i = nodes[i].nxt)\n       if (nodes[i].sta == key) return nodes[i].v[at];\n     return 0;\n   }\n } f[11][20];\n long long c[2][20], bit[15];\n bitset<200> vis[15], pre[200], tmp;\n struct big {\n   int a[35], len;\n   void read() {\n     memset(a, 0, sizeof(a));\n     len = 0;\n     char ch = getchar();\n     for (; ch < '0' || ch > '9'; ch = getchar())\n       ;\n     for (; ch >= '0' && ch <= '9'; ch = getchar()) a[len++] = ch - 48;\n   }\n   long long mod() {\n     long long ans = 0;\n     for (int i = 0; i < len; i++)\n       ans = (10ll * ans + a[i]) % 1000000000000000007ll;\n     return ans;\n   }\n   void plus() {\n     a[len - 1]++;\n     for (int i = len - 1; i >= 1; i--) a[i - 1] += a[i] / 10, a[i] %= 10;\n     if (a[0] > 9) {\n       a[0] = 1;\n       for (int i = 1; i <= len; i++) a[i] = 0;\n       len++;\n     }\n   }\n } L, R;\n int sum[40], times = 0;\n void dfs(int dep, int cnt, int sum, long long msk) {\n   int mx = sum + (18 - cnt) * 9;\n   tmp = pre[mx >> 1];\n   if (sum >> 1) tmp ^= pre[(sum >> 1) - 1];\n   if ((vis[dep - 1] & tmp) == tmp) return;\n   if (dep == 10) {\n     for (int i = sum >> 1; i >= 0; i--)\n       if (vis[dep - 1][i]) {\n         int dif = sum - i - i;\n         if (dif > 1) {\n           ::sum[cnt]++;\n           f[dif][0].update(0, msk, 1);\n         }\n         break;\n       }\n     return;\n   }\n   vis[dep] = vis[dep - 1];\n   dfs(dep + 1, cnt, sum, msk);\n   for (; cnt < 18;) {\n     vis[dep] |= vis[dep] << dep;\n     dfs(dep + 1, ++cnt, sum += dep, msk += bit[dep]);\n   }\n }\n long long solve(int dif, big lim) {\n   long long ans = 0, msk = 0;\n   int len = lim.len;\n   state *F = f[dif];\n   for (int i = 0; i < len; i++)\n     if (len - i > 18) {\n       for (int j = 0; j < lim.a[i]; j++) ans += F[len - i - 1].find(9, msk);\n     } else if (lim.a[i]) {\n       ans += F[len - i].find(lim.a[i] - 1, msk);\n       msk += bit[lim.a[i]];\n     }\n   return ans;\n }\n long long solve2(big lim) {\n   int len = lim.len;\n   long long ans = 0;\n   int part = 0;\n   for (int i = 0; i < len; i++) {\n     int odd = lim.a[i] >> 1, even = lim.a[i] - odd;\n     ans += c[part][len - 1 - i] * odd + c[part ^ 1][len - 1 - i] * even;\n     part ^= lim.a[i] & 1;\n   }\n   return ans;\n }\n inline long long read() {\n   long long x = 0;\n   char ch = getchar();\n   for (; ch < '0' || ch > '9'; ch = getchar())\n     ;\n   for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 - 48 + ch;\n   return x;\n }\n int main() {\n   pre[0][0] = 1;\n   for (int i = 1; i <= 190; i++) pre[i] = pre[i - 1], pre[i][i] = 1;\n   c[0][0] = 1;\n   for (int i = 1; i <= 18; i++)\n     c[0][i] = c[1][i] =\n         5ll * (c[0][i - 1] + c[1][i - 1]) % 1000000000000000007ll;\n   bit[1] = 1;\n   for (int i = 2; i < 10; i++) bit[i] = bit[i - 1] << 5;\n   vis[0].set(0);\n   dfs(1, 0, 0, 0);\n   for (int i = 2; i < 10; i++) {\n     f[i][0].sum();\n     for (int j = 0; j < 18; j++) {\n       state &cur = f[i][j], &nxt = f[i][j + 1];\n       for (int id = 0, sz = cur.size(); id < sz; id++) {\n         int cnt = j;\n         long long way = cur.nodes[id].v[9];\n         long long msk = cur.nodes[id].sta, tmp = msk;\n         for (int k = 1; k < 10; k++, tmp >>= 5) {\n           int rem = tmp & 31;\n           if (!rem) continue;\n           cnt += rem;\n           nxt.update(k, msk - bit[k], way);\n         }\n         if (cnt < 18) nxt.update(0, msk, way);\n       }\n       nxt.sum();\n     }\n   }\n   int Q = read();\n   while (Q--) {\n     L.read();\n     R.read();\n     R.plus();\n     int k = read();\n     long long ans = R.mod() - L.mod();\n     if (!k) {\n       ans -= solve2(R) - solve2(L);\n       for (int i = 2; i < 10; i += 2) ans -= solve(i, R) - solve(i, L);\n     } else\n       for (int i = k + 1; i < 10; i++) ans -= solve(i, R) - solve(i, L);\n     printf('%lld\n', (ans % 1000000000000000007ll + 1000000000000000007ll) %\n                          1000000000000000007ll);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mod = 1000000007;\n vector<long long> v(100004);\n vector<long long> t(100004, 0);\n int n;\n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n int bsearch(int r, int key) {\n   int l = -1;\n   while (r - l > 1) {\n     int m = (r + l) / 2;\n     if (t[m] >= key) {\n       r = m;\n     } else {\n       l = m;\n     }\n   }\n   return r;\n }\n int longest() {\n   int length = 1;\n   t[0] = v[0];\n   for (int i = 1; i < n; ++i) {\n     if (v[i] < t[0])\n       t[0] = v[i];\n     else if (v[i] > t[length - 1]) {\n       t[length] = v[i];\n       length++;\n     } else {\n       t[bsearch(length - 1, v[i])] = v[i];\n     }\n   }\n   return length;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n;\n   for (int i = 0; i < n; ++i) {\n     cin >> v[i];\n   }\n   cout << longest();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<long long, long long> dd;\n map<long long, long long> tong;\n int main() {\n   long long n;\n   cin >> n;\n   string s;\n   cin >> s;\n   long long sum = 0;\n   for (long long i = 0; i < s.size(); i++) {\n     sum += (s[i] - '0');\n   }\n   for (long long i = 2; i <= s.size(); i++) {\n     if (sum % i == 0) {\n       long long tmp = sum / i, dem = 0;\n       long long sum1 = 0;\n       for (long long j = 0; j < s.size(); j++) {\n         sum1 += (s[j] - '0');\n         if (sum1 == tmp) {\n           sum1 = 0;\n           dem++;\n         }\n       }\n       if (dem == i) {\n         cout << 'YES';\n         return 0;\n       }\n     }\n   }\n   cout << 'NO';\n }\n "}
+{"func_code_string": "#include<iostream>\n #include<cstdio>\n #include<unordered_map>\n using namespace std;\n const int N=105;\n const int MOD=1000000007;\n int n,q;\n int c[N];\n int b[N];\n int sb[N],sc[N];\n int l,r;\n int solve(int x)\n {\n     static int f[N][N*N],g[N][N*N];\n     f[0][0]=g[0][0]=1;\n     for(int i=1;i<=n;i++)\n     {\n         for(int j=0;j<max(i*x+sb[i-1],0);j++)\n             f[i][j]=0;\n         for(int j=max(i*x+sb[i-1],0);j<=sc[i];j++)\n             f[i][j]=((long long)g[i-1][j-max(j-sc[i-1],0)]-(j-min(c[i],j)-1>=0?g[i-1][j-min(c[i],j)-1]:0)+MOD)%MOD;\n         g[i][0]=f[i][0];\n         for(int j=1;j<=sc[i];j++)\n             g[i][j]=(g[i][j-1]+f[i][j])%MOD;\n     }\n     int ans=0;\n     for(int j=0;j<=sc[n];j++)\n         ans=(ans+f[n][j])%MOD;\n     return ans;\n }\n unordered_map<int,int>res;\n int main()\n {\n     scanf('%d',&n);\n     for(int i=1;i<=n;i++)\n         scanf('%d',&c[i]);\n     for(int i=1;i<n;i++)\n         scanf('%d',&b[i]);\n     for(int i=1;i<n;i++)\n         sb[i]=sb[i-1]+b[i];\n     for(int i=1;i<n;i++)\n         sb[i]+=sb[i-1];\n     for(int i=1;i<=n;i++)\n         sc[i]=sc[i-1]+c[i];\n     r=(sc[n]-sb[n-1])/n;\n     for(int i=1;i<n;i++)\n         r=min(r,(sc[i]-sb[i-1])/i);\n     l=-sb[n-1]/n;\n     for(int i=1;i<n;i++)\n         l=min(l,sb[i-1]/i);\n     for(int i=l;i<=r;i++)\n         res[i]=solve(i);\n     int pw=1;\n     for(int i=1;i<=n;i++)\n         pw=1LL*pw*(c[i]+1)%MOD;\n     scanf('%d',&q);\n     while(q--)\n     {\n         int x;\n         scanf('%d',&x);\n         if(x<l) printf('%d\n',pw);\n         else if(x>r) printf('%d\n',0);\n         else printf('%d\n',res[x]);\n     }\n     return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int m = 1e9 + 7;\n int p = 31;\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);\n   ;\n   long long t = 1;\n   cin >> t;\n   while (t--) {\n     long long w, h;\n     cin >> w >> h;\n     long long k1, k2, k3, k4;\n     cin >> k1;\n     vector<long long> points_h1;\n     for (int i = 0; i < k1; i++) {\n       long long x;\n       cin >> x;\n       points_h1.push_back(x);\n     }\n     cin >> k2;\n     vector<long long> points_h2;\n     for (int i = 0; i < k2; i++) {\n       long long x;\n       cin >> x;\n       points_h2.push_back(x);\n     }\n     cin >> k3;\n     vector<long long> points_v1;\n     for (int i = 0; i < k3; i++) {\n       long long x;\n       cin >> x;\n       points_v1.push_back(x);\n     }\n     cin >> k4;\n     vector<long long> points_v2;\n     for (int i = 0; i < k4; i++) {\n       long long x;\n       cin >> x;\n       points_v2.push_back(x);\n     }\n     long long ans = max({w * (points_v1[points_v1.size() - 1] - points_v1[0]),\n                          w * (points_v2[points_v2.size() - 1] - points_v2[0]),\n                          h * (points_h1[points_h1.size() - 1] - points_h1[0]),\n                          h * (points_h2[points_h2.size() - 1] - points_h2[0])});\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n void read(T &x) {\n   int f = 0;\n   x = 0;\n   char ch = getchar();\n   for (; !isdigit(ch); ch = getchar()) f |= (ch == '-');\n   for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';\n   if (f) x = -x;\n }\n const int N = 200005;\n int a[N], b[N], c[N], ans[N], n, m, cnt, s;\n pair<pair<int, int>, int> x[N];\n int check(int lim) {\n   priority_queue<pair<int, int>, vector<pair<int, int> >,\n                  greater<pair<int, int> > >\n       Q;\n   int cost = 0, rem = 0, id = 0;\n   for (int i = (cnt); i >= (1); i--) {\n     if (x[i].second == 0) {\n       if (!rem) {\n         if (Q.empty()) return 0;\n         rem = lim, cost += Q.top().first, id = Q.top().second, Q.pop();\n         if (cost > s) return 0;\n       }\n       rem--, ans[-x[i].first.second] = id;\n     } else {\n       Q.push(make_pair(x[i].first.second, x[i].second));\n     }\n   }\n   return 1;\n }\n int main() {\n   read(n), read(m), read(s);\n   for (int i = (1); i <= (m); i++) {\n     read(a[i]);\n     x[++cnt] = make_pair(make_pair(a[i], -i), 0);\n   }\n   for (int i = (1); i <= (n); i++) {\n     read(b[i]);\n   }\n   for (int i = (1); i <= (n); i++) {\n     read(c[i]);\n     x[++cnt] = make_pair(make_pair(b[i], c[i]), i);\n   }\n   sort(x + 1, x + cnt + 1);\n   int l = 1, r = m + 1;\n   while (l < r) {\n     int mid = (l + r) >> 1;\n     if (check(mid))\n       r = mid;\n     else\n       l = mid + 1;\n   }\n   if (l == m + 1)\n     puts('NO');\n   else {\n     puts('YES');\n     check(l);\n     for (int i = (1); i <= (m); i++) {\n       printf('%d%c', ans[i], ' \n'[i == m]);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int arr[1001][1001];\n int main() {\n   int n, m, f1 = 0;\n   cin >> n >> m;\n   int cnt = m;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       if (i != j && arr[i][j] == 0) {\n         arr[i][j] = 1;\n         arr[j][i] = -1;\n         cnt--;\n       }\n       if (cnt == 0) break;\n     }\n     if (cnt > 0) {\n       f1 = 1;\n       break;\n     }\n     cnt = m;\n   }\n   if (f1 == 1)\n     cout << '-1' << endl;\n   else {\n     cout << n * m << endl;\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < n; j++)\n         if (arr[i][j] == 1) cout << i + 1 << ' ' << j + 1 << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n void print1d(vector<T> &a) {\n   for (long long int i = 0; i < a.size(); i++) {\n     cout << a[i] << ' ';\n   }\n   cout << endl;\n }\n vector<long long int> divisor(long long int n) {\n   vector<long long int> a;\n   for (long long int i = 1; i * i <= n; i++) {\n     if (n % i == 0) {\n       if (n / i == i)\n         a.push_back(i);\n       else {\n         a.push_back(i);\n         a.push_back(n / i);\n       }\n     }\n   }\n   return a;\n }\n bool sortsecond(const pair<long long int, long long int> &a,\n                 const pair<long long int, long long int> &b) {\n   return a.second < b.second;\n }\n bool isPrime(long long int n) {\n   for (long long int i = 2; i * i <= n; i++) {\n     if (n % i == 0) return false;\n   }\n   return true;\n }\n vector<string> split_string(const string &s, const string &delimiter) {\n   vector<string> token;\n   string ans;\n   size_t end_point, start_point = 0, delim_length = delimiter.length();\n   while ((end_point = s.find(delimiter, start_point)) != string::npos) {\n     ans = s.substr(start_point, end_point - start_point);\n     start_point = end_point + delim_length;\n     token.push_back(ans);\n   }\n   token.push_back(s.substr(start_point));\n   return token;\n }\n bool is_vowel(const char &a) {\n   switch (a) {\n     case 'a':\n     case 'e':\n     case 'i':\n     case 'o':\n     case 'u':\n     case 'y':\n     case 'A':\n     case 'E':\n     case 'I':\n     case 'O':\n     case 'U':\n       return true;\n       break;\n     default:\n       return false;\n       break;\n   }\n }\n bool sortstring(const string &a, const string &b) {\n   return a.length() < b.length();\n }\n void convert(string &s) {\n   for (long long int i = 0; i < s.length(); i++) {\n     if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';\n     if (s[i] == 'o')\n       s[i] = '0';\n     else if (s[i] == 'l' || s[i] == 'i')\n       s[i] = '1';\n   }\n }\n const long long int K = 998244353;\n void solve() {\n   long long int n;\n   cin >> n;\n   string s;\n   cin >> s;\n   long long int fir = 0;\n   long long int las = 0;\n   char c = s[0];\n   long long int k = 0;\n   for (long long int i = 0; i < n; i++) {\n     k = i;\n     if (s[i] == c)\n       fir++;\n     else {\n       break;\n     }\n   }\n   c = s[n - 1];\n   for (long long int i = n - 1; i >= k; i--) {\n     if (s[i] == c)\n       las++;\n     else\n       break;\n   }\n   if (s[0] == s[n - 1])\n     cout << ((las + 1) * (fir + 1)) % K << endl;\n   else\n     cout << (fir + las + 1) % K << endl;\n   return;\n }\n int32_t main() {\n   ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   ;\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #define l1 long long int \n #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);\n #define test l1 t;cin>>t;while(t--)\n // Function to check \n // if parentheses are balanced \n bool isBalanced(string exp) \n { \n   \n     // Initialising Variables \n     bool flag = true; \n     l1 count = 0; \n   \n     // Traversing the Expression \n     for (l1 i = 0; i < exp.length(); i++) { \n   \n         if (exp[i] == '(') { \n             count++; \n         } \n         else { \n   \n             // It is a closing parenthesis \n             count--; \n         } \n         if (count < 0) { \n   \n             // This means there are \n             // more Closing parenthesis \n             // than opening ones \n             flag = false; \n             break; \n         } \n     } \n   \n     // If count is not zero, \n     // It means there are \n     // more opening parenthesis \n     if (count != 0) { \n         flag = false; \n     } \n   \n     return flag; \n }\n \n int main()\n {\n     fast\n     test\n     {\n         l1 i,l;\n         string str,str1='',str2='';\n         cin>>str;\n         l=str.size();\n         l1 a=0,b=0,c=0;\n         for(i=0;i<l;i++)\n         {\n             if(str[i]=='A')\n             {\n                 a++;\n             }\n             if(str[i]=='B')\n             {\n                 b++;\n             }\n             if(str[i]=='C')\n             {\n                 c++;\n             }\n         }\n         l1 arr[3];\n         arr[0]=a;arr[1]=b;arr[2]=c;\n         sort(arr,arr+3);\n         char temp=NULL;\n         if(arr[2]==a)\n         {\n             temp='A';\n         }\n         else\n         {\n             if(arr[2]==b)\n             {\n                 temp='B';\n             }\n             else\n             {\n                 temp='C';\n             }\n         }\n         for(i=0;i<l;i++)\n         {\n             if(str[i]==temp)\n             {\n                 str1+='(';\n                 str2+=')';\n             }\n             else\n             {\n                 str1+=')';\n                 str2+='(';\n             }\n         }\n         if(isBalanced(str1) || isBalanced(str2))\n         {\n             cout<<'YES\n';\n         }\n         else\n         {\n             cout<<'NO\n';\n         }\n     }\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s;\n   cin >> s;\n   int l = s.size();\n   int a[2];\n   int b[2];\n   a[0] = a[1] = 0;\n   b[0] = b[1] = 0;\n   long long ans_odd = 0LL;\n   long long ans_even = 0LL;\n   for (int i = 0; i < l; i++) {\n     ans_odd++;\n     if (s[i] == 'a') {\n       ans_even += a[1 - i % 2];\n       ans_odd += a[i % 2];\n     } else {\n       ans_even += b[1 - i % 2];\n       ans_odd += b[i % 2];\n     }\n     a[i % 2] += (s[i] == 'a');\n     b[i % 2] += (s[i] == 'b');\n   }\n   cout << ans_even << ' ' << ans_odd << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n;\n   cin.sync_with_stdio(false);\n   cout.sync_with_stdio(false);\n   cin >> n;\n   vector<long long> q(1000100, 0);\n   for (long long i = 0; i < n; i++) {\n     long long t;\n     cin >> t;\n     q[t]++;\n   }\n   long long ans = 0;\n   for (long long i = 0; (i < 1000100 - 1); ++i) {\n     if (q[i] % 2 == 1) ans++;\n     q[i + 1] += q[i] / 2;\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n bool chmax(T& a, const T& b) {\n   return a < b ? (a = b, true) : false;\n }\n template <typename T>\n bool chmin(T& a, const T& b) {\n   return b < a ? (a = b, true) : false;\n }\n int N, Q;\n const int MAX_N = 100000;\n const int BUCKET = 100, SIZE = 1000;\n char S[MAX_N + 17];\n int bucketCnt[BUCKET][10][11][4];\n int getId(char c) {\n   if (c == 'A') return 0;\n   if (c == 'C') return 1;\n   if (c == 'G') return 2;\n   return 3;\n }\n void init() {\n   for (int i = (int)(0); i < (int)(N); i++) {\n     int bucketL = i / SIZE * SIZE;\n     for (int j = (int)(1); j < (int)(11); j++) {\n       bucketCnt[i / SIZE][(i - bucketL) % j][j][getId(S[i])]++;\n     }\n   }\n }\n void change(int idx, char c) {\n   int bucketL = idx / SIZE * SIZE;\n   for (int j = (int)(1); j < (int)(11); j++) {\n     bucketCnt[idx / SIZE][(idx - bucketL) % j][j][getId(S[idx])]--;\n   }\n   S[idx] = c;\n   for (int j = (int)(1); j < (int)(11); j++) {\n     bucketCnt[idx / SIZE][(idx - bucketL) % j][j][getId(S[idx])]++;\n   }\n }\n int getImpact(int l, int r, int M, char e[]) {\n   int res = 0;\n   for (int i = (int)(0); i < (int)(BUCKET); i++) {\n     int bucketL = i * SIZE, bucketR = min(N, (i + 1) * SIZE);\n     if (r <= bucketL || bucketR <= l) continue;\n     if (l <= bucketL && bucketR <= r) {\n       for (int j = (int)(0); j < (int)(min(M, bucketR - bucketL)); j++) {\n         int x = (bucketL + j - l) % M;\n         res += bucketCnt[i][j][M][getId(e[x])];\n       }\n       continue;\n     }\n     for (int j = (int)(max(bucketL, l)); j < (int)(min(bucketR, r)); j++) {\n       int x = (j - l) % M;\n       res += e[x] == S[j];\n     }\n   }\n   return res;\n }\n int main() {\n   scanf('%s', S);\n   N = strlen(S);\n   init();\n   scanf('%d', &Q);\n   for (int i = (int)(0); i < (int)(Q); i++) {\n     int t;\n     scanf('%d', &t);\n     if (t == 1) {\n       int x;\n       char c[17];\n       scanf('%d%s', &x, c);\n       x--;\n       change(x, c[0]);\n     } else {\n       int l, r;\n       char e[17];\n       scanf('%d%d%s', &l, &r, e);\n       l--;\n       int M = strlen(e);\n       printf('%d\n', getImpact(l, r, M, e));\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     int n, k;\n     cin >> n >> k;\n     vector<int> v(n);\n     for (auto &it : v) cin >> it;\n     int ans = 0;\n     sort(v.begin(), v.end());\n     for (int i = n - 1; i >= n - k; i--) ans += v[i - k] / v[i];\n     for (int i = 0; i < n - 2 * k; i++) ans += v[i];\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, arr[1000], arr2[1000], i = 0;\n   cin >> n;\n   while (i < n) {\n     cin >> arr[i];\n     arr2[arr[i]] = i + 1;\n     i++;\n   }\n   sort(arr, arr + n);\n   for (i = 0; i < n; i++) {\n     cout << arr2[arr[i]] << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 105;\n int zy[N][N * N / 2];\n bool dp[N][N * N / 2];\n deque<int> ans;\n void dfs(int n, int k) {\n   if (n == 1) {\n     ans.push_back(1);\n     return;\n   } else {\n     if (zy[n][k] > 0) {\n       dfs(n - zy[n][k] + 1, k - zy[n][k]);\n       int sz = ans.size();\n       ans.push_front(zy[n][k] / 2 + sz);\n       if (zy[n][k] & 1) {\n         for (int i = (int)1; i <= (int)zy[n][k] / 2 - 2; ++i) {\n           ans.push_back(sz + zy[n][k] / 2 + i);\n           ans.push_back(sz + i);\n         }\n         ans.push_back(sz + zy[n][k] - 1);\n         ans.push_back(sz + zy[n][k] / 2 - 1);\n         ans.push_back(sz + zy[n][k] - 2);\n       } else {\n         for (int i = (int)1; i <= (int)zy[n][k] / 2 - 1; ++i) {\n           ans.push_back(sz + zy[n][k] / 2 + i);\n           ans.push_back(sz + i);\n         }\n       }\n     } else {\n       dfs(n + zy[n][k] + 1, k + zy[n][k] * (1 - zy[n][k]) / 2 + 1);\n       int sz = ans.size();\n       if (ans.front() > ans.back()) {\n         for (int i = (int)1; i <= (int)-zy[n][k] - 1; ++i)\n           ans.push_back(sz + i);\n       } else {\n         for (int i = (int)1; i <= (int)-zy[n][k] - 1; ++i)\n           ans.push_front(sz + i);\n       }\n     }\n   }\n }\n int main() {\n   dp[1][1] = 1;\n   for (int i = (int)2; i <= (int)100; ++i) {\n     for (int j = (int)i + 1; j <= (int)i * (i + 1) / 2; ++j) {\n       for (int k = (int)i; k >= (int)2; --k) {\n         if (k * (k + 1) / 2 <= j &&\n             dp[i - (k - 1)][j - (k * (k + 1) / 2 - 1)]) {\n           dp[i][j] = 1;\n           zy[i][j] = -k;\n           break;\n         }\n         if (k >= 4 && dp[i - k + 1][j - k]) {\n           dp[i][j] = 1;\n           zy[i][j] = k;\n           break;\n         }\n       }\n     }\n   }\n   int q, n, k;\n   cin >> q;\n   while (q--) {\n     cin >> n >> k;\n     if (!dp[n][k]) {\n       puts('NO');\n     } else {\n       dfs(n, k);\n       puts('YES');\n       while (ans.size()) {\n         cout << ans.front() << ' ';\n         ans.pop_front();\n       }\n       cout << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n char ara[55][55];\n bool ok(int i, int j) {\n   if (i >= n || j < 0 || j >= n) return false;\n   if (ara[i][j] == '#') return false;\n   return true;\n }\n int main() {\n   while (cin >> n) {\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < n; j++) {\n         cin >> ara[i][j];\n       }\n     }\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < n; j++) {\n         if (ara[i][j] == '.') {\n           if (ok(i + 1, j) && ok(i + 1, j - 1) && ok(i + 1, j + 1) &&\n               ok(i + 2, j)) {\n             ara[i][j] = ara[i + 1][j] = ara[i + 1][j - 1] = ara[i + 1][j + 1] =\n                 ara[i + 2][j] = '#';\n           }\n         }\n       }\n     }\n     bool flag = true;\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < n; j++) {\n         if (ara[i][j] == '.') {\n           flag = false;\n         }\n       }\n     }\n     cout << (flag ? 'YES\n' : 'NO\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n, first = 0, second = 0, no = 0, spare;\n   cin >> n;\n   vector<long long> v1;\n   vector<long long> v2;\n   for (long long i = 0; i < n; i++) {\n     long long p;\n     cin >> p;\n     if (p > 0) {\n       first += p;\n       v1.push_back(p);\n     } else {\n       second += abs(p);\n       v2.push_back(abs(p));\n     }\n     if (i == n - 1) spare = p;\n   }\n   if (first > second)\n     cout << 'first';\n   else if (second > first)\n     cout << 'second';\n   else {\n     long long q = min(v1.size(), v2.size());\n     for (long long i = 0; i < q; i++) {\n       if (v1[i] > v2[i]) {\n         cout << 'first';\n         no++;\n         break;\n       } else if (v1[i] < v2[i]) {\n         cout << 'second';\n         no++;\n         break;\n       }\n     }\n     if (no == 0) {\n       if (spare > 0)\n         cout << 'first';\n       else\n         cout << 'second';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T1, typename T2>\n ostream& operator<<(ostream& cout, const pair<T1, T2>& a) {\n   return cout << '(' << a.first << '; ' << a.second << ')';\n }\n template <typename T>\n ostream& operator<<(ostream& cout, const vector<T>& a) {\n   if (a.size() == 0) {\n     return cout << '()';\n   }\n   cout << '(' << a[0];\n   for (int i = 1; i < (int)a.size(); i++) {\n     cout << '; ' << a[i];\n   }\n   return cout << ')';\n }\n template <typename T>\n ostream& operator<<(ostream& cout, const set<T>& a) {\n   if (a.size() == 0) {\n     return cout << '{}';\n   }\n   auto it = a.begin();\n   cout << '{' << *it;\n   ++it;\n   for (; it != a.end(); ++it) {\n     cout << '; ' << *it;\n   }\n   return cout << '}';\n }\n long long a1, a2, a3;\n int main() {\n   cin >> a1;\n   cin >> a2;\n   cin >> a3;\n   cout << min({(a1 + a2) * 2, a1 + a3 + a2, (a1 + a3) * 2, (a2 + a3) * 2});\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int i, n, j;\n     cin >> n;\n     int arr[n], a[n];\n     set<int> s1, s2;\n     int flag = 0, p = 0;\n     for (i = 0; i < n; i++) {\n       cin >> arr[i];\n       a[i] = arr[i];\n       s2.insert(arr[i]);\n       if (arr[i] == 0) flag = 1;\n     }\n     sort(a, a + n);\n     if (flag == 1) {\n       p == 0;\n       for (i = 0; i < n; i++) {\n         s1.clear();\n         if (a[i] != 0) {\n           for (j = 0; j < n; j++) {\n             int p = (a[i] ^ arr[j]);\n             s1.insert(p);\n           }\n         }\n         if (s2 == s1) {\n           p = 1;\n           cout << a[i] << '\n';\n           break;\n         }\n       }\n       if (p == 0) cout << '-1\n';\n     } else {\n       p = 0;\n       for (i = 1; i < 1025; i++) {\n         s1.clear();\n         for (j = 0; j < n; j++) {\n           s1.insert(i ^ arr[j]);\n         }\n         if (s2 == s1) {\n           p = 1;\n           cout << i << '\n';\n           break;\n         }\n       }\n       if (p == 0) cout << '-1\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int ini() {\n   int x;\n   scanf('%d', &x);\n   return x;\n }\n long long inl() {\n   long long x;\n   scanf('%lld', &x);\n   return x;\n }\n void file_mamager() {}\n int arr[105], mask[105], dp[105][1 << 17];\n pair<int, int> path[105][1 << 17];\n vector<int> primes;\n void gen() {\n   for (int i = 2; i <= 60; i++) {\n     bool is = true;\n     for (int j = 2; j * j <= i; j++) {\n       if (i % j == 0) {\n         is = false;\n         break;\n       }\n     }\n     if (is) primes.push_back(i);\n   }\n }\n void bit_rep(int x) {\n   for (int i = 0; i < 10; i++) cout << ((x >> i) & 1);\n   cout << '\n';\n }\n int main() {\n   gen();\n   int n = ini();\n   for (int i = 1; i <= n; i++) {\n     for (int j = 0; j < (1 << 17); j++) dp[i][j] = 1e8;\n   }\n   for (int i = 1; i <= n; i++) arr[i] = ini();\n   for (int i = 1; i <= 60; i++) {\n     int x = 0, y = i;\n     for (int j = 0; j < 17; j++) {\n       if (y % primes[j] == 0) {\n         x |= (1 << j);\n         while (y % primes[j] == 0) y /= primes[j];\n       }\n     }\n     mask[i] = x;\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= 60; j++) {\n       for (int k = 0; k < (1 << 17); k++) {\n         if ((k & mask[j]) == mask[j]) {\n           if (dp[i - 1][k ^ mask[j]] + abs(arr[i] - j) < dp[i][k]) {\n             dp[i][k] = dp[i - 1][k ^ mask[j]] + abs(arr[i] - j);\n             path[i][k] = {(k ^ mask[j]), j};\n           }\n         }\n       }\n     }\n   }\n   int mn = 1e8;\n   int x = (1 << 17) - 1;\n   for (int k = 0; k < (1 << 17); k++) {\n     if (dp[n][k] < mn) {\n       mn = dp[n][k];\n       x = k;\n     }\n   }\n   vector<int> ans;\n   for (int i = n; i >= 1; i--) {\n     ans.push_back(path[i][x].second);\n     x = path[i][x].first;\n   }\n   reverse(ans.begin(), ans.end());\n   for (int xx : ans) cout << xx << ' ';\n   cout << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n using vi = vector<int>;\n using vvi = vector<vector<int>>;\n using vl = vector<ll>;\n using vvl = vector<vector<ll>>;\n using pi = pair<int, int>;\n using pl = pair<ll, ll>;\n template <typename U>\n void print(U arr) {\n   for (auto element : arr) {\n     cout << element << ' ';\n   }\n   cout << '\n';\n }\n void setup(string s) {\n   freopen((s + '.in').c_str(), 'r', stdin);\n   freopen((s + '.out').c_str(), 'w', stdout);\n }\n const int M = 1e9 + 7;\n const int mxN = 1e5 + 1;\n vvi adj(mxN);\n vi lvl(mxN, 0), sub(mxN, 0);\n int getSize(int i, int p) {\n   sub[i] = 1;\n   for (auto& e : adj[i]) {\n     if (e != p && !lvl[e]) {\n       sub[i] += getSize(e, i);\n     }\n   }\n   return sub[i];\n }\n ll centroid(int i, int p, int n) {\n   for (auto& e : adj[i]) {\n     if (e != p && !lvl[e] && sub[e] > n / 2) return centroid(e, i, n);\n   }\n   return i;\n }\n ll decomp(ll i, ll l) {\n   ll cent = centroid(i, -1, getSize(i, -1));\n   lvl[cent] = l;\n   for (ll j : adj[cent])\n     if (!lvl[j]) decomp(j, l + 1);\n   return cent;\n }\n int main(void) {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   for (ll _ = 0; _ < n - 1; _++) {\n     int a, b;\n     cin >> a >> b;\n     adj[a].push_back(b);\n     adj[b].push_back(a);\n   }\n   decomp(1, 1);\n   for (ll i = 1; i < n + 1; i++) cout << (char)('A' + lvl[i] - 1) << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s;\n int l, r;\n inline void get() {\n   l = 1;\n   r = 2;\n   printf('? %d %d\n', l, r);\n   fflush(stdout);\n   cin >> s;\n   while (s[0] == 'y') {\n     l <<= 1;\n     r <<= 1;\n     printf('? %d %d\n', l, r);\n     fflush(stdout);\n     cin >> s;\n   }\n }\n int main() {\n   int mid;\n   while (1) {\n     cin >> s;\n     if (s[0] == 'e') {\n       return 0;\n     }\n     get();\n     while (l + 1 < r) {\n       mid = l + r >> 1;\n       printf('? %d %d\n', l, mid);\n       fflush(stdout);\n       cin >> s;\n       if (s[0] == 'x')\n         r = mid;\n       else\n         l = mid;\n     }\n     printf('? %d %d\n', 0, l);\n     fflush(stdout);\n     cin >> s;\n     if (s[0] == 'x')\n       printf('! %d\n', l), fflush(stdout);\n     else\n       printf('! %d\n', r), fflush(stdout);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};\n int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};\n char mat[105][105];\n int n, m;\n int main() {\n   scanf('%d %d', &n, &m);\n   for (int i = 0; i < n; i++) {\n     scanf(' %s', mat[i]);\n   }\n   int flag = 0;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       if (mat[i][j] == '*') continue;\n       int cnt = 0;\n       for (int k = 0; k < 8; k++) {\n         if (i + dx[k] < 0 || j + dy[k] < 0 || i + dx[k] >= n || j + dy[k] >= m)\n           continue;\n         if (mat[i + dx[k]][j + dy[k]] == '*') cnt++;\n       }\n       int koto;\n       if (mat[i][j] == '.')\n         koto = 0;\n       else\n         koto = mat[i][j] - '0';\n       if (cnt != koto) flag = 1;\n     }\n   }\n   if (flag == 1) {\n     cout << 'NO' << endl;\n   } else\n     cout << 'YES' << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s;\n void rd() {\n   cin >> s;\n   if (s != 'start') exit(0);\n }\n int q(int x, int y) {\n   cout << '? ' << x << ' ' << y << endl;\n   cin >> s;\n   if (s[0] == 'x') return 1;\n   if (s[0] == 'y') return 0;\n   exit(0);\n }\n int main() {\n   int i, l, r;\n   while (1) {\n     rd();\n     if (q(0, 1)) {\n       cout << '! ' << 1 << endl;\n       continue;\n     }\n     for (i = 1; 1; i <<= 1)\n       if (q(i, i + i)) break;\n     for (l = i + 1, r = i + i; l < r;) {\n       i = ((long long)l + r) / 2;\n       if (q(i, r))\n         l = i + 1;\n       else\n         r = i;\n     }\n     cout << '! ' << l << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct E {\n   int to, col, time, ind;\n   E(int to, int col, int time, int ind)\n       : to(to), col(col), time(time), ind(ind) {}\n };\n int n, m, cnt;\n vector<E> g[50000];\n int a[50000], b[50000], c[50000], d[50000], t[50000];\n map<int, pair<int, int> > colInd;\n const int INF = 1e9 + 99;\n vector<int> sat[311111], rev[311111], tmp[311111], ord;\n bool used[311111];\n int cmp[311111], curCmp;\n void dfs1(int v) {\n   used[v] = true;\n   for (int to : sat[v])\n     if (!used[to]) {\n       dfs1(to);\n     }\n   ord.push_back(v);\n }\n void dfs2(int v) {\n   cmp[v] = curCmp;\n   for (int to : rev[v])\n     if (cmp[to] == -1) {\n       dfs2(to);\n     }\n }\n bool solve(int bound) {\n   for (int i = 0; i < (int)(cnt << 1); ++i) sat[i] = tmp[i];\n   for (int i = 0; i < (int)(m); ++i)\n     if (t[i] > bound) {\n       sat[i << 1].push_back((i << 1) | 1);\n     }\n   for (int i = 0; i < (int)(cnt << 1); ++i) rev[i].clear();\n   for (int i = 0; i < (int)(cnt << 1); ++i)\n     for (int to : sat[i]) {\n       rev[to].push_back(i);\n     }\n   for (int i = 0; i < (int)(cnt << 1); ++i) used[i] = false;\n   ord.clear();\n   for (int i = 0; i < (int)(cnt << 1); ++i)\n     if (!used[i]) {\n       dfs1(i);\n     }\n   reverse(ord.begin(), ord.end());\n   for (int i = 0; i < (int)(cnt << 1); ++i) cmp[i] = -1;\n   curCmp = 0;\n   for (int i : ord)\n     if (cmp[i] == -1) {\n       dfs2(i);\n       ++curCmp;\n     }\n   for (int i = 0; i < (int)(cnt); ++i)\n     if (cmp[i << 1] == cmp[(i << 1) | 1]) {\n       return false;\n     }\n   return true;\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < (int)(m); ++i) {\n     int from, to, c, tt;\n     scanf('%d%d%d%d', &from, &to, &c, &tt), --from, --to;\n     g[from].push_back(E(to, c, tt, i));\n     g[to].push_back(E(from, c, tt, i));\n     t[i] = tt;\n   }\n   for (int i = 0; i < (int)(n); ++i) {\n     a[i] = -1;\n     for (E e : g[i]) {\n       auto it = colInd.find(e.col);\n       if (it != colInd.end()) {\n         if (a[i] != -1) {\n           printf('No\n');\n           return 0;\n         }\n         a[i] = it->second.first;\n         b[i] = e.ind;\n         c[i] = it->second.second;\n         d[i] = e.time;\n       } else {\n         colInd[e.col] = make_pair(e.ind, e.time);\n       }\n     }\n     colInd.clear();\n   }\n   int lo = 0, hi = 0, mid;\n   for (int i = 0; i < (int)(n); ++i)\n     if (a[i] != -1) {\n       lo = max(lo, min(c[i], d[i]));\n       hi = max(hi, max(c[i], d[i]));\n     }\n   if (hi == 0) {\n     printf('Yes\n0 0\n');\n     return 0;\n   }\n   cnt = m;\n   for (int i = 0; i < (int)(n); ++i)\n     if ((int)g[i].size() > 1) {\n       for (int j = 0; j < (int)((int)g[i].size() - 1); ++j) {\n         tmp[g[i][j].ind << 1].push_back((cnt + j) << 1);\n         tmp[((cnt + j) << 1) | 1].push_back((g[i][j].ind << 1) | 1);\n       }\n       for (int j = 0; j < (int)((int)g[i].size() - 2); ++j) {\n         tmp[(cnt + j) << 1].push_back((cnt + j + 1) << 1);\n         tmp[((cnt + j + 1) << 1) | 1].push_back(((cnt + j) << 1) | 1);\n       }\n       for (int j = 1; j < (int)g[i].size(); ++j) {\n         tmp[g[i][j].ind << 1].push_back(((cnt + j - 1) << 1) | 1);\n         tmp[(cnt + j - 1) << 1].push_back((g[i][j].ind << 1) | 1);\n       }\n       cnt += (int)g[i].size() - 1;\n     }\n   for (int i = 0; i < (int)(n); ++i)\n     if (a[i] != -1) {\n       tmp[(a[i] << 1) | 1].push_back(b[i] << 1);\n       tmp[(b[i] << 1) | 1].push_back(a[i] << 1);\n     }\n   while (lo < hi) {\n     mid = (lo + hi) >> 1;\n     if (solve(mid)) {\n       hi = mid;\n     } else {\n       lo = mid + 1;\n     }\n   }\n   if (solve(lo)) {\n     printf('Yes\n');\n     vector<int> ans;\n     for (int i = 0; i < (int)(m); ++i)\n       if (cmp[(i << 1) | 1] < cmp[i << 1]) {\n         ans.push_back(i);\n       }\n     printf('%d %d\n', lo, (int)ans.size());\n     for (int x : ans) printf('%d ', x + 1);\n     printf('\n');\n   } else {\n     printf('No\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n int cna, cnb;\n bool isha[108];\n bool ishb[108];\n bool vis[108];\n int main() {\n   cin >> n >> m;\n   cin >> cna;\n   int tmp;\n   for (int i = 0; i < cna; i++) {\n     scanf('%d', &tmp);\n     isha[tmp] = 1;\n   }\n   cin >> cnb;\n   for (int i = 0; i < cnb; i++) {\n     scanf('%d', &tmp);\n     ishb[tmp] = 1;\n   }\n   for (int i = 0; i < n; i++) {\n     if (!isha[i]) continue;\n     int x = i % m;\n     vis[x] = 1;\n     ishb[x] = 1;\n     tmp = 0;\n     while (true) {\n       tmp = (tmp + n) % m;\n       x = (i + tmp) % m;\n       if (vis[x]) break;\n       vis[x] = 1;\n       ishb[x] = 1;\n     }\n   }\n   memset(vis, 0, sizeof vis);\n   for (int i = 0; i < m; i++) {\n     if (!ishb[i]) continue;\n     int x = i % n;\n     isha[x] = 1;\n     vis[x] = 1;\n     tmp = 0;\n     while (true) {\n       tmp = (tmp + m) % n;\n       x = (i + tmp) % n;\n       if (vis[x]) break;\n       vis[x] = 1;\n       isha[x] = 1;\n     }\n   }\n   memset(vis, 0, sizeof vis);\n   for (int i = 0; i < n; i++) {\n     if (!isha[i]) continue;\n     int x = i % m;\n     vis[x] = 1;\n     ishb[x] = 1;\n     tmp = 0;\n     while (true) {\n       tmp = (tmp + n) % m;\n       x = (i + tmp) % m;\n       if (vis[x]) break;\n       vis[x] = 1;\n       ishb[x] = 1;\n     }\n   }\n   memset(vis, 0, sizeof vis);\n   for (int i = 0; i < m; i++) {\n     if (!ishb[i]) continue;\n     int x = i % n;\n     isha[x] = 1;\n     vis[x] = 1;\n     tmp = 0;\n     while (true) {\n       tmp = (tmp + m) % n;\n       x = (i + tmp) % n;\n       if (vis[x]) break;\n       vis[x] = 1;\n       isha[x] = 1;\n     }\n   }\n   bool flag = 0;\n   for (int i = 0; i < n; i++) {\n     if (!isha[i]) {\n       cout << 'No' << endl;\n       return 0;\n     }\n   }\n   for (int i = 0; i < m; i++) {\n     if (!ishb[i]) {\n       cout << 'No' << endl;\n       return 0;\n     }\n   }\n   cout << 'Yes' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 310;\n int g[maxn][maxn];\n int best[maxn];\n int a[maxn];\n int ans[maxn];\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= n; j++) {\n       int v;\n       scanf('%d', &v);\n       g[i][v] = j;\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n     best[i] = 1000;\n   }\n   for (int i = 1; i <= n; i++) {\n     int cura = -1;\n     int curb = -1;\n     for (int j = 1; j <= n; j++)\n       if (a[j] <= i) {\n         cura = a[j];\n         break;\n       }\n     for (int j = 1; j <= n; j++)\n       if (cura != a[j] && a[j] <= i) {\n         curb = a[j];\n         break;\n       }\n     for (int j = 1; j <= n; j++) {\n       int cur = cura;\n       if (cura == j) cur = curb;\n       if (cur == -1) continue;\n       if (g[j][cur] < best[j]) {\n         best[j] = g[j][cur];\n         ans[j] = i;\n       }\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     printf('%d', ans[i]);\n     if (i != n)\n       printf(' ');\n     else\n       printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a[300010], cnt, fa[300010], siz[300010], ans;\n bool tag[300010];\n inline int find(int x) {\n   while (x ^ fa[x]) x = fa[x] = fa[fa[x]];\n   return x;\n }\n inline void merge(int x, int y) {\n   x = find(x), y = find(y);\n   if (x ^ y) fa[x] = y, siz[y] += siz[x];\n }\n int main() {\n   printf('1 ');\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) fa[i] = i, siz[i] = 1;\n   for (int i = 1; i <= n; i++) {\n     int p;\n     scanf('%d', &p);\n     if (a[p - 1]) {\n       merge(p, p - 1);\n     }\n     if (a[p + 1]) {\n       merge(p, p + 1);\n     }\n     a[p] = 1;\n     printf('%d ', a[n] ? i - siz[find(n)] + 1 : i + 1);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n, k, i;\n   cin >> n >> k;\n   if (n % (2 * k + 1) == 0) {\n     cout << n / (2 * k + 1) << '\n';\n     for (i = k + 1; i <= n; i += (2 * k + 1)) cout << i << ' ';\n   } else if (n % (2 * k + 1) < (k + 1)) {\n     cout << n / (2 * k + 1) + 1 << '\n';\n     for (i = 1; i <= n; i += (2 * k + 1)) cout << i << ' ';\n   } else {\n     cout << n / (2 * k + 1) + 1 << '\n';\n     for (i = k + 1; i <= n; i += (2 * k + 1)) cout << i << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long maxn = 3e5 + 7, mod = 998244353, inf = 1e18, MAXN = 1e6 + 7;\n const double eps = 1e-9;\n mt19937 rnd(time(0));\n long long n;\n long long cnt[maxn];\n struct state {\n   long long a, b, d;\n   state(long long a, long long b, long long d) : a(a), b(b), d(d) {}\n   state() : a(0), b(0), d(0) {}\n };\n vector<state> have;\n bool cmp(state p1, state p2) { return p1.d > p2.d; }\n vector<long long> gr[maxn];\n vector<long long> step[maxn];\n void solve() {\n   cin >> n;\n   for (long long i = 1; i <= n; ++i) {\n     long long d;\n     cin >> d;\n     long long a = 2 * i;\n     long long b = a - 1;\n     have.emplace_back(b, a, d);\n   }\n   sort(have.begin(), have.end(), cmp);\n   vector<long long> even;\n   for (auto v : have) {\n     even.push_back(v.a);\n   }\n   for (long long i = 1; i < n; ++i) {\n     gr[even[i - 1]].push_back(even[i]);\n   }\n   long long size = n;\n   for (long long i = 0; i < n; ++i) {\n     --size;\n     long long d = have[i].d;\n     long long b = have[i].b;\n     if (size < d) {\n       gr[even.back()].push_back(b);\n       even.push_back(b);\n       ++size;\n     } else {\n       gr[even[i + d - 1]].push_back(b);\n     }\n   }\n   for (long long i = 1; i <= 2 * n; ++i) {\n     for (auto v : gr[i]) {\n       cout << i << ' ' << v << '\n';\n     }\n   }\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.precision(20);\n   cout << fixed;\n   long long t = 1;\n   for (long long i = 0; i < t; ++i) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t = 1;\n   while (t--) {\n     long long n;\n     cin >> n;\n     long long a[n];\n     for (int i = 0; i < n; i++) cin >> a[i];\n     if (n == 1) {\n       cout << '1 1' << endl;\n       cout << '0' << endl;\n       cout << '1 1' << endl;\n       cout << 0 << endl;\n       cout << '1 1' << endl;\n       cout << -a[0] << endl;\n     } else {\n       cout << '1 1' << endl;\n       cout << -a[0] << endl;\n       cout << '2'\n            << ' ' << n << endl;\n       for (int i = 1; i < n; i++) {\n         cout << a[i] * (n - 1) << ' ';\n       }\n       cout << endl;\n       cout << '1'\n            << ' ' << n << endl;\n       cout << '0 ';\n       for (int i = 1; i < n; i++) cout << -a[i] * n << ' ';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct pt {\n   int x, y;\n };\n int h, t, r, n, m;\n int w[205][205], unc[205][205], siofdjsodi[205][205];\n basic_string<pt> e[205][205], f[205][205], qu;\n pt hd[205], td[205];\n void ae(int i, int j, int u, int v) {\n   if (u + v > r) return;\n   e[i][j] += {u, v};\n   f[u][v] += {i, j};\n   unc[i][j]++;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   cerr.tie(nullptr);\n   cin >> h >> t >> r;\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> hd[i].x >> hd[i].y;\n   cin >> m;\n   for (int i = 1; i <= m; i++) cin >> td[i].x >> td[i].y;\n   for (int i = 0; i <= r; i++) {\n     for (int j = 0; i + j <= r; j++) {\n       for (int x = 1; x <= min(i, n); x++) {\n         int u = i - x + hd[x].x;\n         int v = j + hd[x].y;\n         ae(i, j, u, v);\n       }\n       for (int y = 1; y <= min(j, m); y++) {\n         int u = i + td[y].x;\n         int v = j - y + td[y].y;\n         ae(i, j, u, v);\n       }\n     }\n   }\n   {\n     w[0][0] = 1;\n     qu += pt{0, 0};\n     size_t qs = 0;\n     while (qs != qu.size()) {\n       auto [i, j] = qu[qs++];\n       for (auto [x, y] : f[i][j]) {\n         if (w[x][y] == 0) {\n           w[x][y] = 1;\n           siofdjsodi[x][y] = siofdjsodi[i][j] + 1;\n           qu += {x, y};\n         }\n       }\n     }\n   }\n   qu = {};\n   for (int i = 0; i <= r; i++) {\n     for (int j = 0; i + j <= r; j++) {\n       if (w[i][j] == 0 && unc[i][j] == 0) {\n         qu += {i, j};\n       }\n     }\n   }\n   size_t qs = 0;\n   while (qs != qu.size()) {\n     auto [i, j] = qu[qs++];\n     int q = 0;\n     for (auto [x, y] : e[i][j]) {\n       q = max(q, siofdjsodi[x][y]);\n     }\n     w[i][j] = -1;\n     siofdjsodi[i][j] = q + 1;\n     for (auto [x, y] : f[i][j]) {\n       if (!--unc[x][y]) {\n         qu += {x, y};\n       }\n     }\n   }\n   if (w[h][t] == 1) {\n     cout << 'Ivan\n';\n     cout << siofdjsodi[h][t] << '\n';\n   } else if (w[h][t] == -1) {\n     cout << 'Zmey\n';\n     cout << siofdjsodi[h][t] << '\n';\n   } else {\n     cout << 'Draw\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/STACK:102400000,102400000')\n using namespace std;\n const int inf = 1e9 + 7;\n const long long linf = 1e18;\n const double pi = acos(-1.0);\n int main() {\n   ios::sync_with_stdio(false);\n   int t;\n   cin >> t;\n   for (int total = 0; total < t; total++) {\n     int n, p;\n     cin >> n >> p;\n     for (int temp = 0; temp < 2 * n + p;) {\n       for (int i = 1; i <= n; i++) {\n         if (temp == 2 * n + p) break;\n         for (int j = i + 1; j <= n; j++) {\n           temp++;\n           cout << i << ' ' << j << endl;\n           if (temp == 2 * n + p) break;\n         }\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n static struct FastInput {\n   static constexpr int BUF_SIZE = 1 << 20;\n   char buf[BUF_SIZE];\n   size_t chars_read = 0;\n   size_t buf_pos = 0;\n   FILE* in = stdin;\n   char cur = 0;\n   inline char get_char() {\n     if (buf_pos >= chars_read) {\n       chars_read = fread(buf, 1, BUF_SIZE, in);\n       buf_pos = 0;\n       buf[0] = (chars_read == 0 ? -1 : buf[0]);\n     }\n     return cur = buf[buf_pos++];\n   }\n   inline void tie(int) {}\n   inline explicit operator bool() { return cur != -1; }\n   inline static bool is_blank(char c) { return c <= ' '; }\n   inline bool skip_blanks() {\n     while (is_blank(cur) && cur != -1) {\n       get_char();\n     }\n     return cur != -1;\n   }\n   inline FastInput& operator>>(char& c) {\n     skip_blanks();\n     c = cur;\n     return *this;\n   }\n   inline FastInput& operator>>(string& s) {\n     if (skip_blanks()) {\n       s.clear();\n       do {\n         s += cur;\n       } while (!is_blank(get_char()));\n     }\n     return *this;\n   }\n   template <typename T>\n   inline FastInput& read_integer(T& n) {\n     n = 0;\n     if (skip_blanks()) {\n       int sign = +1;\n       if (cur == '-') {\n         sign = -1;\n         get_char();\n       }\n       do {\n         n += n + (n << 3) + cur - '0';\n       } while (!is_blank(get_char()));\n       n *= sign;\n     }\n     return *this;\n   }\n   template <typename T>\n   inline typename enable_if<is_integral<T>::value, FastInput&>::type operator>>(\n       T& n) {\n     return read_integer(n);\n   }\n   inline FastInput& operator>>(__int128& n) { return read_integer(n); }\n   template <typename T>\n   inline typename enable_if<is_floating_point<T>::value, FastInput&>::type\n   operator>>(T& n) {\n     n = 0;\n     if (skip_blanks()) {\n       string s;\n       (*this) >> s;\n       sscanf(s.c_str(), '%lf', &n);\n     }\n     return *this;\n   }\n } fast_input;\n static struct FastOutput {\n   static constexpr int BUF_SIZE = 1 << 20;\n   char buf[BUF_SIZE];\n   size_t buf_pos = 0;\n   static constexpr int TMP_SIZE = 1 << 20;\n   char tmp[TMP_SIZE];\n   FILE* out = stdout;\n   inline void put_char(char c) {\n     buf[buf_pos++] = c;\n     if (buf_pos == BUF_SIZE) {\n       fwrite(buf, 1, buf_pos, out);\n       buf_pos = 0;\n     }\n   }\n   ~FastOutput() { fwrite(buf, 1, buf_pos, out); }\n   inline FastOutput& operator<<(char c) {\n     put_char(c);\n     return *this;\n   }\n   inline FastOutput& operator<<(const char* s) {\n     while (*s) {\n       put_char(*s++);\n     }\n     return *this;\n   }\n   inline FastOutput& operator<<(const string& s) {\n     for (int i = 0; i < (int)s.size(); i++) {\n       put_char(s[i]);\n     }\n     return *this;\n   }\n   template <typename T>\n   inline char* integer_to_string(T n) {\n     char* p = tmp + TMP_SIZE - 1;\n     if (n == 0) {\n       *--p = '0';\n     } else {\n       bool is_negative = false;\n       if (n < 0) {\n         is_negative = true;\n         n = -n;\n       }\n       while (n > 0) {\n         *--p = (char)('0' + n % 10);\n         n /= 10;\n       }\n       if (is_negative) {\n         *--p = '-';\n       }\n     }\n     return p;\n   }\n   template <typename T>\n   inline typename enable_if<is_integral<T>::value, char*>::type stringify(T n) {\n     return integer_to_string(n);\n   }\n   inline char* stringify(__int128 n) { return integer_to_string(n); }\n   template <typename T>\n   inline typename enable_if<is_floating_point<T>::value, char*>::type stringify(\n       T n) {\n     sprintf(tmp, '%.17f', n);\n     return tmp;\n   }\n   template <typename T>\n   inline FastOutput& operator<<(const T& n) {\n     auto p = stringify(n);\n     for (; *p != 0; p++) {\n       put_char(*p);\n     }\n     return *this;\n   }\n } fast_output;\n const int N = 1e6 + 3;\n vector<int> inq[N];\n int main() {\n   ios::sync_with_stdio(false);\n   fast_input.tie(0);\n   int n, m, q;\n   fast_input >> n >> m >> q;\n   vector<vector<int>> edge(n + 1);\n   vector<tuple<int, int, int>> edges;\n   for (int i = 0; i < m; i++) {\n     int u, v, w;\n     fast_input >> u >> v >> w;\n     edges.emplace_back(u, v, w);\n     edge[u].emplace_back(i);\n   }\n   priority_queue<pair<long long, int>> pq;\n   const long long inf = 1e18;\n   vector<long long> d(n + 1, inf);\n   d[1] = 0;\n   pq.emplace(d[1], 1);\n   while ((int)pq.size()) {\n     auto x = pq.top();\n     pq.pop();\n     if (-x.first != d[x.second]) continue;\n     int v = x.second;\n     for (auto& x : edge[v]) {\n       int u = get<1>(edges[x]);\n       if (d[u] > d[v] + get<2>(edges[x])) {\n         d[u] = d[v] + get<2>(edges[x]);\n         pq.emplace(-d[u], u);\n       }\n     }\n   }\n   vector<int> add(m);\n   for (int i = 0; i < m; i++) {\n     auto& x = edges[i];\n     add[i] = get<2>(x) - (d[get<1>(x)] - d[get<0>(x)]);\n   }\n   int up = 0;\n   while (q--) {\n     int type;\n     fast_input >> type;\n     if (type == 1) {\n       int v;\n       fast_input >> v;\n       if (up) {\n         vector<int> dist(n + 1, (int)1e9);\n         dist[1] = 0;\n         inq[0].emplace_back(1);\n         for (int i = 0; i <= up; i++) {\n           for (int j = 0; j < (int)inq[i].size(); j++) {\n             int v = inq[i][j];\n             if (dist[v] != i) continue;\n             for (auto& x : edge[v]) {\n               int u = get<1>(edges[x]);\n               if (dist[u] > dist[v] + add[x]) {\n                 dist[u] = dist[v] + add[x];\n                 if (dist[u] <= up) inq[dist[u]].emplace_back(u);\n               }\n             }\n           }\n           inq[i].clear();\n         }\n         for (int i = 1; i <= n; i++) d[i] = min(d[i] + dist[i], inf);\n         for (int i = 0; i < m; i++) {\n           auto& x = edges[i];\n           add[i] -= (dist[get<1>(x)] - dist[get<0>(x)]);\n         }\n         up = 0;\n       }\n       if (d[v] != inf)\n         fast_output << d[v] << '\n';\n       else\n         fast_output << '-1\n';\n     } else {\n       int foo;\n       fast_input >> foo;\n       for (int i = 0; i < foo; i++) {\n         int x;\n         fast_input >> x;\n         --x;\n         add[x]++;\n       }\n       up += foo;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1000000007;\n long long ksm(long long a, long long b) {\n   long long res = 1;\n   a %= mod;\n   assert(b >= 0);\n   for (; b; b >>= 1) {\n     if (b & 1) res = res * a % mod;\n     a = a * a % mod;\n   }\n   return res;\n }\n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n const int N = 1e5;\n int n, t, p[N], pos[N], tmp[N];\n int main() {\n   scanf('%d', &t);\n   while (t--) {\n     scanf('%d', &n);\n     for (int i = 1; i <= n; i++) {\n       scanf('%d', &p[i]);\n       tmp[i] = 0;\n       pos[p[i]] = i;\n     }\n     bool f = false;\n     for (int i = 1; i <= n; i++) {\n       if (tmp[pos[i]]) {\n         continue;\n       } else {\n         tmp[pos[i]] = i;\n         int x = i + 1;\n         for (int j = pos[i] + 1, x = i + 1; j <= n; j++) {\n           if (tmp[j]) break;\n           tmp[j] = x++;\n         }\n         i = x - 1;\n       }\n     }\n     for (int i = 1; i <= n; i++) {\n       if (p[i] == tmp[i]) continue;\n       f = true;\n       break;\n     }\n     if (f)\n       puts('NO');\n     else\n       puts('YES');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T1>\n void debug(T1 e) {\n   cout << e << endl;\n }\n template <class T1, class T2>\n void debug(T1 e1, T2 e2) {\n   cout << e1 << '\t' << e2 << endl;\n }\n template <class T1, class T2, class T3>\n void debug(T1 e1, T2 e2, T3 e3) {\n   cout << e1 << '\t' << e2 << '\t' << e3 << endl;\n }\n template <class T1, class T2, class T3, class T4>\n void debug(T1 e1, T2 e2, T3 e3, T4 e4) {\n   cout << e1 << '\t' << e2 << '\t' << e3 << '\t' << e4 << endl;\n }\n template <class T1, class T2, class T3, class T4, class T5>\n void debug(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {\n   cout << e1 << '\t' << e2 << '\t' << e3 << '\t' << e4 << '\t' << e5 << endl;\n }\n template <class T1, class T2, class T3, class T4, class T5, class T6>\n void debug(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {\n   cout << e1 << '\t' << e2 << '\t' << e3 << '\t' << e4 << '\t' << e5 << '\t'\n        << e6 << endl;\n }\n template <class T>\n void debug(vector<vector<T> > e, int row, int col) {\n   int i, j;\n   for (i = 0; i < row; i++) {\n     for (j = 0; j < col; j++) cout << e[i][j] << ' ';\n     cout << endl;\n   }\n   cout << endl;\n }\n template <class T>\n void debug(vector<basic_string<T> > e, int row, int col) {\n   int i, j;\n   for (i = 0; i < row; i++) {\n     for (j = 0; j < col; j++) cout << e[i][j];\n     cout << endl;\n   }\n   cout << endl;\n }\n template <class T>\n void debug(T e[110][110], int row, int col) {\n   int i, j;\n   for (i = 0; i < row; i++) {\n     for (j = 0; j < col; j++) cout << e[i][j] << ' ';\n     cout << endl;\n   }\n }\n template <class T>\n string toString(T n) {\n   ostringstream oss;\n   oss << n;\n   oss.flush();\n   return oss.str();\n }\n int toInt(string s) {\n   int r = 0;\n   istringstream sin(s);\n   sin >> r;\n   return r;\n }\n bool isVowel(char ch) {\n   ch = tolower(ch);\n   if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u')\n     return true;\n   return false;\n }\n bool isUpper(char c) { return c >= 'A' && c <= 'Z'; }\n bool isLower(char c) { return c >= 'a' && c <= 'z'; }\n int n;\n int arr[2000];\n int main() {\n   int n;\n   while (cin >> n) {\n     int i;\n     for (i = 1; i <= n; i++) cin >> arr[i];\n     if (n % 2 == 0 || n == 1) {\n       cout << '-1' << endl;\n       continue;\n     }\n     int ans = 0;\n     for (i = n - 1; i > 1; i -= 2) {\n       int ma = max(arr[i], arr[i + 1]);\n       arr[i] = 0;\n       arr[i + 1] = 0;\n       arr[i / 2] -= ma;\n       arr[i / 2] = max(0, arr[i / 2]);\n       ans += ma;\n     }\n     ans += arr[1];\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int read() {\n   char c = getchar();\n   int d = 0, f = 1;\n   for (; c < '0' || c > '9'; c = getchar())\n     if (c == '-') f = -1;\n   for (; c >= '0' && c <= '9'; d = d * 10 + c - 48, c = getchar())\n     ;\n   return d * f;\n }\n int r, d, n;\n const int N = 100001;\n struct xint {\n   int x, y, r;\n } a[N];\n int main() {\n   r = read(), d = read(), n = read();\n   int ans = 0;\n   for (int i = 1; i <= n; ++i) {\n     a[i].x = read(), a[i].y = read(), a[i].r = read();\n     int dis = a[i].x * a[i].x + a[i].y * a[i].y;\n     if (dis >= (r - d + a[i].r) * (r - d + a[i].r) && r >= a[i].r &&\n         dis <= (r - a[i].r) * (r - a[i].r))\n       ans++;\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n const double PI = acos(-1.0);\n const double E = exp(1);\n const double EPS = 1e-5;\n const int maxn = 2000 + 5;\n int n, m;\n char mp[maxn][maxn] = {0};\n int dx[] = {1, 0, 0, -1};\n int dy[] = {0, 1, -1, 0};\n int cnt = 0;\n bool check(int x, int y) {\n   if (x < 0 || x >= m || y < 0 || y >= n || mp[x][y] != '.') return false;\n   return true;\n }\n void dfs(int x, int y) {\n   if (!check(x, y)) return;\n   int num = 0;\n   int dir;\n   for (int i = 0; i < (4); i++) {\n     int xx = x + dx[i];\n     int yy = y + dy[i];\n     if (check(xx, yy)) {\n       dir = i;\n       num++;\n     }\n   }\n   if (num == 1) {\n     if (dir == 0) {\n       mp[x][y] = '^';\n       mp[x + dx[dir]][y + dy[dir]] = 'v';\n     } else if (dir == 1) {\n       mp[x][y] = '<';\n       mp[x + dx[dir]][y + dy[dir]] = '>';\n     } else if (dir == 2) {\n       mp[x][y] = '>';\n       mp[x + dx[dir]][y + dy[dir]] = '<';\n     } else if (dir == 3) {\n       mp[x][y] = 'v';\n       mp[x + dx[dir]][y + dy[dir]] = '^';\n     }\n     cnt += 2;\n     for (int i = 0; i < (4); i++) dfs(x + dx[i] + dx[dir], y + dy[i] + dy[dir]);\n   }\n }\n int main(void) {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> m >> n;\n   for (int i = 0; i < (m); i++) cin >> mp[i];\n   for (int i = 0; i < (m); i++)\n     for (int j = 0; j < (n); j++) {\n       if (mp[i][j] == '*') cnt++;\n       dfs(i, j);\n     }\n   if (cnt != m * n)\n     puts('Not unique');\n   else\n     for (int i = 0; i < (m); i++) cout << mp[i] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using LL = long long;\n using pss = pair<string, string>;\n using pis = pair<int, string>;\n const int maxn = 300300;\n int n;\n LL val[maxn], mask[maxn], sum;\n signed main() {\n   while (cin >> n) {\n     sum = 0;\n     for (int i = 1; i <= n; i++) {\n       cin >> val[i] >> mask[i];\n       sum += val[i];\n     }\n     for (int i = 1; i <= n; i++) {\n       if (sum < 0) {\n         val[i] = -val[i];\n       }\n     }\n     LL ret = 0;\n     for (int k = 0; k < 62; k++) {\n       LL tot = 0;\n       for (int i = 1; i <= n; i++) {\n         if (mask[i] == (1LL << k)) {\n           tot += val[i];\n         }\n       }\n       if (tot > 0) ret |= (1LL << k);\n       for (int i = 1; i <= n; i++) {\n         if ((1LL << k) & mask[i]) {\n           mask[i] ^= (1LL << k);\n           if (tot > 0) {\n             val[i] = -val[i];\n           }\n         }\n       }\n     }\n     cout << ret << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename Arg1>\n void __f(const char* name, Arg1&& arg1) {\n   cerr << name << ' : ' << arg1 << std::endl;\n }\n template <typename Arg1, typename... Args>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int, int>, pair<int, int> > edge[N];\n vector<int> 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<int> 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<int> 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<int>();\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n template <typename S, typename T>\n ostream &operator<<(ostream &os, pair<S, T> &m) {\n   os << '[' << m.first << ' ' << m.second << ']';\n   return os;\n }\n int n;\n vector<int> 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 <bits/stdc++.h>\n using namespace std;\n int n, m, k;\n vector<int> v[1000010];\n vector<int> vv;\n bool visit[1000010] = {0};\n int t, tt;\n int res = 0;\n void dfs(int x) {\n   visit[x] = 1;\n   t++;\n   for (int i = 0; i < v[x].size(); i++) {\n     int xi = v[x][i];\n     if (!visit[xi]) dfs(xi);\n   }\n }\n int main() {\n   scanf('%d%d%d', &n, &m, &k);\n   for (int i = 0; i < m; i++) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     x--, y--;\n     v[x].push_back(y);\n     v[y].push_back(x);\n   }\n   for (int i = 0; i < n; i++) {\n     if (!visit[i]) {\n       t = 0;\n       dfs(i);\n       vv.push_back(min(t, k));\n     }\n   }\n   if (k == 1) {\n     cout << max(0, (int)(vv.size() - 2));\n     return 0;\n   }\n   sort(vv.begin(), vv.end());\n   reverse(vv.begin(), vv.end());\n   tt = vv[0];\n   for (int i = 1; i < vv.size(); i++) {\n     if (tt)\n       tt += vv[i] - 2;\n     else {\n       tt++;\n       res++;\n     }\n   }\n   cout << res;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 4000 + 1;\n const int sq = 100;\n const long long int mod = 1e9 + 7;\n const long long int inf = 4000 + 1;\n unordered_map<long long int, int> dp;\n int ps[N], n;\n inline int get(int l, int r) { return ps[r] - ps[l]; }\n int solve(int l, int r, int k, bool bol) {\n   if (r - l < k || l >= r || r > n || l < 0) return 0;\n   if (r - l == k && bol) return get(l, r);\n   if (r - l == k) return -get(l, r);\n   long long int key = l * N * sq * 2 + r * sq * 2 + k * 2 + bol;\n   if (dp.count(key)) return dp[key];\n   int ans, x, y;\n   if (bol) {\n     x = solve(l + k, r, k, 0) + get(l, l + k);\n     y = solve(l + k + 1, r, k + 1, 0) + get(l, l + k + 1);\n     ans = max(x, y);\n   } else {\n     x = solve(l, r - k, k, 1) - get(r - k, r);\n     y = solve(l, r - k - 1, k + 1, 1) - get(r - k - 1, r);\n     ans = min(x, y);\n   }\n   return dp[key] = ans;\n }\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   dp.rehash(16e6);\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     int x;\n     scanf('%d', &x);\n     ps[i + 1] = ps[i] + x;\n   }\n   printf('%d \n', solve(0, n, 1, 1));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void enable_comma() {}\n string tostring(char c);\n string tostring(long long x);\n template <class A, class B>\n string tostring(pair<A, B> p);\n template <class A>\n string tostring(vector<A> v);\n string tostring(char c) {\n   string s = '';\n   s += c;\n   return s;\n }\n string tostring(string s) { return '\'' + s + '\''; }\n string tostring(char *c) { return tostring((string)c); }\n string tostring(long long x) {\n   if (x < 0) return '-' + tostring(-x);\n   if (x > 9)\n     return tostring(x / 10) + tostring(char('0' + x % 10));\n   else\n     return tostring(char('0' + x));\n }\n string tostring(int x) { return tostring((long long)x); }\n string tostring(unsigned long long x) {\n   if (x > 9)\n     return tostring((long long)(x / 10)) + tostring(char('0' + x % 10));\n   else\n     return tostring(char('0' + x));\n }\n string tostring(unsigned x) { return tostring((long long)x); }\n string tostring(double x) {\n   static char res[114];\n   sprintf(res, '%lf', x);\n   return tostring(res);\n }\n string tostring(long double x) { return tostring((double)x); }\n template <class A, class B>\n string tostring(pair<A, B> p) {\n   return '(' + tostring(p.first) + ',' + tostring(p.second) + ')';\n }\n template <class A>\n string tostring(vector<A> v) {\n   string res = '{';\n   for (int i = (0); i <= ((int)v.size() - 1); i++) {\n     res += tostring(v[i]);\n     res += i == (int)v.size() - 1 ? '}' : ',';\n   }\n   if (res == '{') res += '}';\n   return res;\n }\n template <class A>\n string tostring(A a, int L, int R) {\n   string res = '{';\n   for (int i = (L); i <= (R); i++) {\n     res += tostring(a[i]);\n     res += i == R ? '}' : ',';\n   }\n   if (res == '{') res += '}';\n   return res;\n }\n string tostrings() { return ''; }\n template <typename Head, typename... Tail>\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 <class T>\n void ckmax(T &x, const T y) {\n   if (x < y) x = y;\n }\n template <class T>\n void ckmin(T &x, const T y) {\n   if (x > y) x = y;\n }\n const int N = 500005 * 2;\n int n, m, q;\n int p[N];\n pair<int, int> e[N], t[N];\n int ti[N];\n namespace S {\n int fa[N];\n void init() { iota(fa, fa + N, 0); }\n int getf(int x) { return fa[x] == x ? x : fa[x] = getf(fa[x]); }\n }  // namespace S\n int cnt;\n int fa[N], val[N];\n vector<int> son[N];\n int vis[N];\n int I[N], O[N], ii[N];\n int anc[N][20], dep[N];\n int Time = 0;\n void dfs(int x, int d = 1) {\n   vis[x] = 1;\n   anc[x][0] = fa[x];\n   for (int i = (1); i <= (19); i++) anc[x][i] = anc[anc[x][i - 1]][i - 1];\n   dep[x] = d;\n   I[x] = ++Time;\n   ii[Time] = x;\n   for (auto y : son[x]) dfs(y, d + 1);\n   O[x] = Time;\n }\n int pmax(int x, int y) { return p[x] > p[y] ? x : y; }\n namespace seg {\n const int S = N * 4;\n int mx[S];\n void pushup(int rt) {\n   int ls = rt << 1, rs = ls | 1;\n   mx[rt] = pmax(mx[ls], mx[rs]);\n }\n void build(int rt, int L, int R) {\n   if (L == R) {\n     mx[rt] = ii[L];\n     return;\n   }\n   int mid = (L + R) >> 1, ls = rt << 1, rs = ls | 1;\n   build(ls, L, mid);\n   build(rs, mid + 1, R);\n   pushup(rt);\n }\n int query(int rt, int L, int R, int xL, int xR) {\n   if (R < xL || L > xR) return 0;\n   if (xL <= L && R <= xR) return mx[rt];\n   int mid = (L + R) >> 1, ls = rt << 1, rs = ls | 1;\n   return pmax(query(ls, L, mid, xL, xR), query(rs, mid + 1, R, xL, xR));\n }\n void update(int rt, int L, int R, int x) {\n   if (L == R) {\n     mx[rt] = 0;\n     return;\n   }\n   int mid = (L + R) >> 1, ls = rt << 1, rs = ls | 1;\n   if (x <= mid)\n     update(ls, L, mid, x);\n   else\n     update(rs, mid + 1, R, x);\n   pushup(rt);\n }\n }  // namespace seg\n void solve() {\n   n = read(), m = read(), q = read();\n   for (int i = (1); i <= (n); i++) p[i] = read();\n   for (int i = (1); i <= (m); i++) {\n     int x = read(), y = read();\n     e[i] = make_pair(x, y);\n     ti[i] = q + 1;\n   }\n   for (int i = (1); i <= (q); i++) {\n     int tp = read(), x = read();\n     t[i] = make_pair(tp, x);\n     if (tp == 2) ti[x] = i;\n   }\n   vector<int> id(m);\n   iota(id.begin(), id.end(), 1);\n   sort(id.begin(), id.end(), [&](int x, int y) { return ti[x] > ti[y]; });\n   cnt = n;\n   S::init();\n   for (auto i : id) {\n     int x = e[i].first, y = e[i].second;\n     int fx = S::getf(x), fy = S::getf(y);\n     if (fx != fy) {\n       int f = ++cnt;\n       fa[fx] = fa[fy] = S::fa[fx] = S::fa[fy] = f;\n       val[f] = ti[i];\n       son[f] = {fx, fy};\n       enable_comma();\n     }\n   }\n   for (int i = (cnt); i >= (1); i--)\n     if (!vis[i]) dfs(i);\n   seg::build(1, 1, cnt);\n   for (int i = (1); i <= (q); i++) {\n     int tp = t[i].first, x = t[i].second;\n     if (tp == 1) {\n       for (int j = (19); j >= (0); j--)\n         if (val[anc[x][j]] > i) x = anc[x][j];\n       int res = seg::query(1, 1, cnt, I[x], O[x]);\n       printf('%d\n', p[res]);\n       p[res] = 0;\n       seg::update(1, 1, cnt, I[res]);\n     } else {\n     }\n   }\n }\n int main() {\n   int T = 1;\n   while (T--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void init() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n }\n void skipInputLine() { cin.ignore(numeric_limits<streamsize>::max(), '\n'); }\n template <typename TYPE>\n TYPE readNum() {\n   TYPE item;\n   cin >> item;\n   return item;\n }\n template <typename COLLECTION>\n COLLECTION readNums(size_t count) {\n   COLLECTION collection;\n   typename COLLECTION::value_type item;\n   for (size_t i = 0; i < count; i++) {\n     cin >> item;\n     collection.insert(item);\n   }\n   return collection;\n }\n template <typename COLLECTION>\n void writeNums(const COLLECTION &collection) {\n   for (auto item : collection) {\n     cout << item << ' ';\n   }\n   cout << endl;\n }\n struct Datum {\n   Datum() {}\n   Datum(uint32_t _x, uint32_t _count) : x(_x), count(_count) {}\n   uint32_t x;\n   uint32_t count;\n };\n void pass(const vector<Datum> &data, uint32_t k, vector<Datum> &ranges) {\n   uint32_t idx_left = 0, idx_right = 0;\n   uint32_t left_value = 0;\n   while (idx_left < data.size() && idx_right < data.size()) {\n     while (idx_right < data.size()) {\n       if (idx_right + 1 < data.size() &&\n           data[idx_right + 1].x <= data[idx_left].x + k) {\n         idx_right++;\n       } else {\n         break;\n       }\n     }\n     ranges.push_back(\n         Datum(data[idx_left].x, data[idx_right].count - left_value));\n     left_value = data[idx_left].count;\n     idx_left++;\n   }\n }\n uint32_t calc(uint32_t n, uint32_t k) {\n   map<uint32_t, uint32_t> xs;\n   for (size_t i = 0; i < n; i++) {\n     uint32_t x;\n     cin >> x;\n     xs[x]++;\n   }\n   skipInputLine();\n   skipInputLine();\n   uint32_t cumulative = 0;\n   vector<Datum> data(xs.size());\n   uint32_t index = 0;\n   for (map<uint32_t, uint32_t>::const_iterator it = xs.begin(); it != xs.end();\n        it++) {\n     cumulative += it->second;\n     data[index++] = Datum(it->first, cumulative);\n   }\n   xs.clear();\n   uint32_t width = data[data.size() - 1].x - data[0].x + 1;\n   if (width <= 2 * (k + 1)) {\n     return n;\n   }\n   vector<Datum> ranges;\n   ranges.reserve(2 * data.size());\n   pass(data, k, ranges);\n   data.clear();\n   map<uint32_t, uint32_t> best_sums;\n   uint32_t bs = 0;\n   for (size_t i = 0; i < ranges.size(); i++) {\n     const Datum &range = ranges[i];\n     bs = max(bs, range.count);\n     best_sums[range.x] = bs;\n   }\n   uint32_t best_sum = 0;\n   for (size_t i = 1; i < ranges.size(); i++) {\n     const Datum &range = ranges[i];\n     uint32_t sum = range.count;\n     int32_t x = int32_t(range.x) - int32_t(k + 1);\n     if (x < 0) {\n       x = 0;\n     }\n     map<uint32_t, uint32_t>::const_iterator it = best_sums.upper_bound(x);\n     if (it != best_sums.cbegin()) {\n       it--;\n       best_sum = max(best_sum, sum + it->second);\n     }\n   }\n   return best_sum;\n }\n int main() {\n   init();\n   uint32_t t = readNum<uint32_t>();\n   for (uint32_t i = 0; i < t; i++) {\n     uint32_t n, k;\n     cin >> n >> k;\n     uint32_t res = calc(n, k);\n     cout << res << '\n';\n   }\n   cout << flush;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long read() {\n   register long long x = 0, f = 1;\n   char ch = getchar();\n   while (!isdigit(ch)) {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (isdigit(ch)) {\n     x = (x << 1) + (x << 3) + (ch ^ 48);\n     ch = getchar();\n   }\n   return x * f;\n }\n const long long N = 1e5 + 10;\n const long long M = N;\n const long long INF = 1e16;\n struct edge {\n   long long u, v, w, next;\n   bool operator<(const edge &x) const { return w < x.w; }\n } e[M << 1];\n long long head[N], cnt;\n void add(long long u, long long v, long long w = 0) {\n   e[++cnt] = (edge){u, v, w, head[u]};\n   head[u] = cnt;\n }\n long long n, m, k, ans = INF;\n long long dis[N], s[N], from[N];\n bool vis[N];\n struct node {\n   long long u, d;\n   bool operator<(const node &x) const { return d > x.d; }\n };\n priority_queue<node> q;\n void Dij() {\n   for (long long i = 1; i <= n; i++) from[i] = vis[i] = 0, dis[i] = INF;\n   for (long long i = 1; i <= k; i++)\n     from[s[i]] = s[i], dis[s[i]] = 0, q.push((node){s[i], 0});\n   while (!q.empty()) {\n     long long u = q.top().u;\n     q.pop();\n     if (vis[u]) continue;\n     vis[u] = 1;\n     for (long long i = head[u]; i; i = e[i].next) {\n       long long v = e[i].v;\n       if (vis[v]) continue;\n       if (dis[v] > dis[u] + e[i].w) {\n         dis[v] = dis[u] + e[i].w;\n         from[v] = from[u];\n         q.push((node){v, dis[v]});\n       }\n     }\n   }\n }\n long long fa[N];\n long long find(long long x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }\n void krus() {\n   for (long long i = 1; i <= cnt; i++) {\n     e[i].w += dis[e[i].u] + dis[e[i].v];\n     e[i].u = from[e[i].u], e[i].v = from[e[i].v];\n   }\n   sort(e + 1, e + cnt + 1);\n   for (long long i = 1; i <= cnt; i++) {\n     long long fx = find(e[i].u), fy = find(e[i].v);\n     if (fx == fy) continue;\n     ans += e[i].w;\n     fa[fx] = fy;\n   }\n }\n signed main() {\n   n = read(), m = read();\n   for (long long i = 1; i <= n; i++) fa[i] = i;\n   for (long long i = 1; i <= m; i++) {\n     long long u = read(), v = read(), w = read();\n     add(u, v, w), add(v, u, w);\n   }\n   s[k = 1] = 1;\n   Dij();\n   k = read();\n   for (long long i = 1; i <= k; i++) {\n     s[i] = read();\n     ans = min(ans, dis[s[i]]);\n   }\n   Dij();\n   krus();\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   string s;\n   int n;\n   while (cin >> n) {\n     cin >> s;\n     int gold = 0, cnt = 0, prev = 0, ans = 0;\n     for (auto ch : s) {\n       if (ch == 'G')\n         gold++, cnt++;\n       else\n         prev = cnt, cnt = 0;\n       ans = max(ans, prev + cnt + 1);\n     }\n     ans = min(ans, gold);\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int t;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> t;\n   while (t--) {\n     int a, b, c;\n     cin >> a >> b >> c;\n     if (c == 0) {\n       if (a <= b)\n         cout << 0 << endl;\n       else\n         cout << 1 << endl;\n       continue;\n     } else if (a + c <= b) {\n       cout << 0 << endl;\n       continue;\n     }\n     int res;\n     if (a == b) {\n       res = c / 2;\n       if (c % 2 == 1) res++;\n     } else if (a > b) {\n       if (b + c < a)\n         res = c + 1;\n       else if (b + c == a)\n         res = c;\n       else {\n         if ((b + c - a) % 2 == 1)\n           res = (b + c - a) / 2 + 1 + a - b;\n         else\n           res = (b + c - a) / 2 + a - b;\n       }\n     } else {\n       if ((a + c - b) % 2 == 1)\n         res = (a + c - b) / 2 + 1;\n       else\n         res = (a + c - b) / 2;\n     }\n     cout << res << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   std::cin >> n;\n   bool letters[26];\n   bool d = false;\n   int extra = 0;\n   for (int i = 0; i < 26; i++) {\n     letters[i] = true;\n   }\n   char action;\n   string input = '';\n   for (int i = 0; i < n; i++) {\n     cin >> action;\n     cin >> input;\n     if (action == '!') {\n       for (int j = 0; j < 26; j++) {\n         if (strchr(input.c_str(), j + 'a') == NULL) {\n           letters[j] = false;\n         }\n       }\n       if (d == true) extra++;\n     }\n     if (action == '.') {\n       for (int j = 0; j < 26; j++) {\n         if (strchr(input.c_str(), j + 'a') != NULL) {\n           letters[j] = false;\n         }\n       }\n     }\n     if (action == '?') {\n       letters[input[0] - 'a'] = false;\n       if (d == true && i < n - 1) extra++;\n     }\n     if (d == false) {\n       int truec = 0;\n       for (int j = 0; j < 26; j++) {\n         if (letters[j] == true) {\n           truec++;\n         }\n       }\n       if (truec == 1) {\n         d = true;\n       }\n     }\n   }\n   cout << extra << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int M = 100010;\n int n, m;\n struct road {\n   int to, th;\n   bool f;\n } in;\n struct dot {\n   int come_road;\n   int come_point;\n   bool func;\n } r[M];\n vector<road> work[M];\n vector<road> not_work[M];\n vector<road> rw[M];\n vector<road> rnw[M];\n bool vis[M];\n int d[M];\n int broken_road[M];\n bool inq[M];\n int tot, u;\n int input() {\n   int ans = 0;\n   char ch;\n   while (1) {\n     ch = getchar();\n     if (ch == ' ' || ch == '\n') return ans;\n     ans *= 10;\n     ans += ch - '0';\n   }\n   return ans;\n }\n void output(int out) {\n   if (out == 0) {\n     putchar('0');\n     return;\n   }\n   char ans[10];\n   int cnt = 0;\n   while (out) {\n     ans[cnt++] = out % 10 + '0';\n     out /= 10;\n   }\n   for (int i = cnt - 1; i >= 0; i--) putchar(ans[i]);\n }\n int main() {\n   while (~scanf('%d%d', &n, &m)) {\n     tot = 0;\n     memset(broken_road, 0x3f, sizeof(broken_road));\n     memset(vis, 0, sizeof(vis));\n     memset(d, 0x3f, sizeof(d));\n     for (int i = 1; i <= n; i++) {\n       work[i].clear();\n       not_work[i].clear();\n       rw[i].clear();\n       rnw[i].clear();\n     }\n     int x, y, fun;\n     getchar();\n     for (int i = 0; i < m; i++) {\n       x = input();\n       y = input();\n       fun = input();\n       in.to = y;\n       in.th = i;\n       if (!fun) {\n         in.f = 0;\n         not_work[x].push_back(in);\n         in.to = x;\n         rnw[y].push_back(in);\n       } else {\n         tot++;\n         in.f = 1;\n         work[x].push_back(in);\n         in.to = x;\n         rw[y].push_back(in);\n       }\n     }\n     memset(inq, 0, sizeof(inq));\n     inq[1] = 1;\n     d[1] = 0;\n     queue<int> q;\n     q.push(1);\n     broken_road[1] = 0;\n     while (!q.empty()) {\n       u = q.front();\n       q.pop();\n       inq[u] = 0;\n       int v;\n       for (int i = 0; i < work[u].size(); i++) {\n         v = work[u][i].to;\n         if (d[u] + 1 < d[v] ||\n             (d[u] + 1 == d[v] && broken_road[u] < broken_road[v])) {\n           d[v] = d[u] + 1;\n           r[v].come_point = u;\n           r[v].come_road = work[u][i].th;\n           r[v].func = 1;\n           broken_road[v] = broken_road[u];\n           if (!inq[v]) {\n             q.push(v);\n             inq[v] = 1;\n           }\n         }\n       }\n       for (int i = 0; i < rw[u].size(); i++) {\n         v = rw[u][i].to;\n         if (d[u] + 1 < d[v] ||\n             (d[u] + 1 == d[v] && broken_road[u] < broken_road[v])) {\n           d[v] = d[u] + 1;\n           r[v].come_point = u;\n           r[v].come_road = rw[u][i].th;\n           r[v].func = 1;\n           broken_road[v] = broken_road[u];\n           if (!inq[v]) {\n             q.push(v);\n             inq[v] = 1;\n           }\n         }\n       }\n       for (int i = 0; i < not_work[u].size(); i++) {\n         v = not_work[u][i].to;\n         if (d[u] + 1 < d[v] ||\n             (d[u] + 1 == d[v] && broken_road[u] + 1 < broken_road[v])) {\n           d[v] = d[u] + 1;\n           r[v].come_point = u;\n           r[v].come_road = not_work[u][i].th;\n           r[v].func = 0;\n           broken_road[v] = broken_road[u] + 1;\n           if (!inq[v]) {\n             q.push(v);\n             inq[v] = 1;\n           }\n         }\n       }\n       for (int i = 0; i < rnw[u].size(); i++) {\n         v = rnw[u][i].to;\n         if (d[u] + 1 < d[v] ||\n             (d[u] + 1 == d[v] && broken_road[u] + 1 < broken_road[v])) {\n           d[v] = d[u] + 1;\n           r[v].come_point = u;\n           r[v].come_road = rnw[u][i].th;\n           r[v].func = 0;\n           broken_road[v] = broken_road[u] + 1;\n           if (!inq[v]) {\n             q.push(v);\n             inq[v] = 1;\n           }\n         }\n       }\n     }\n     int p = n;\n     while (p != 1) {\n       vis[r[p].come_road] = 1;\n       if (r[p].func)\n         tot--;\n       else\n         tot++;\n       p = r[p].come_point;\n     }\n     output(tot);\n     puts('');\n     for (int i = 1; i <= n; i++) {\n       for (int j = 0; j < work[i].size(); j++) {\n         if (!vis[work[i][j].th]) {\n           output(i);\n           putchar(' ');\n           output(work[i][j].to);\n           putchar(' ');\n           puts('0');\n         }\n       }\n       for (int j = 0; j < not_work[i].size(); j++) {\n         if (vis[not_work[i][j].th]) {\n           output(i);\n           putchar(' ');\n           output(not_work[i][j].to);\n           putchar(' ');\n           puts('1');\n         }\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n void solve(int tc) {\n   int n, k;\n   cin >> n >> k;\n   string s;\n   cin >> s;\n   for (int i = k; i < s.size(); i++) {\n     if (s[i] == '?') {\n       if (s[i - k] != '?') {\n         s[i] = s[i - k];\n       }\n     } else {\n       if (s[i - k] == '?') {\n         s[i - k] = s[i];\n       } else {\n         if (s[i] != s[i - k]) {\n           cout << 'NO' << endl;\n           return;\n         }\n       }\n     }\n   }\n   int count = 0;\n   int free = 0;\n   for (int i = 0; i < s.size(); i++) {\n     if (i >= k) {\n       if (s[i - k] == '?') {\n         free--;\n       } else {\n         count -= ((s[i - k] == '1') ? 1 : 0);\n       }\n     }\n     if (s[i] == '?') {\n       free++;\n     } else {\n       count += ((s[i] == '1') ? 1 : 0);\n     }\n     if (i >= k - 1) {\n       if (count > k / 2 || count + free < k / 2) {\n         cout << 'NO' << endl;\n         return;\n       }\n     }\n   }\n   cout << 'YES' << endl;\n }\n int main() {\n   int t;\n   cin >> t;\n   for (int i = 1; i <= t; i++) {\n     solve(i);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long double pi = 3.14159265359;\n inline long long add(long long a, long long b, long long m) {\n   if ((a + b) >= m) return (a + b) % m;\n   return a + b;\n }\n inline long long mul(long long a, long long b, long long m) {\n   if ((a * b) < m) return a * b;\n   return (a * b) % m;\n }\n long long power(long long x, long long y, long long m) {\n   long long res = 1;\n   x = x % m;\n   if (x == 0) return 0;\n   while (y > 0) {\n     if (y & 1) res = (res * x) % m;\n     y = y >> 1;\n     x = (x * x) % m;\n   }\n   return res;\n }\n long long gcd(long long a, long long b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n int main() {\n   ios_base::sync_with_stdio;\n   cin.tie(0);\n   cout.tie(0);\n   int t = 1, n;\n   cin >> t;\n   while (t--) {\n     string s;\n     cin >> n;\n     cin >> s;\n     string ans;\n     int i = 0;\n     for (; i < s.length(); i++) {\n       if (s[i] == '0') {\n         ans.push_back(s[i]);\n       } else {\n         break;\n       }\n     }\n     string ans2;\n     for (int i = s.length() - 1; i > -1; i--) {\n       if (s[i] == '1') {\n         ans2.push_back(s[i]);\n       } else {\n         break;\n       }\n     }\n     if (ans.length() + ans2.length() == s.length()) {\n       cout << s << endl;\n     } else\n       cout << ans << '0' << ans2 << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n const int N = 1e2 + 5;\n int ans[N][N][N];\n bool was[N][N][N];\n vector<pair<int, int> > adj[N];\n bool calc(int x, int y, int pr) {\n   if (was[x][y][pr]) return ans[x][y][pr];\n   was[x][y][pr] = 1;\n   for (auto to : adj[x]) {\n     if (to.second >= pr && !calc(y, to.first, to.second)) {\n       ans[x][y][pr] = 1;\n       break;\n     }\n   }\n   return ans[x][y][pr];\n }\n int main() {\n   ios ::sync_with_stdio(0), cin.tie(0);\n   int n, m;\n   cin >> n >> m;\n   for (int i = 1; i <= m; ++i) {\n     int u, v;\n     char c;\n     cin >> u >> v >> c;\n     adj[u].push_back({v, c - 'a'});\n   }\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= n; ++j) {\n       if (!calc(i, j, 0))\n         cout << 'B';\n       else\n         cout << 'A';\n     }\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int v[2000];\n int a, b, n, res;\n int main() {\n   scanf('%d %d %d', &n, &a, &b);\n   for (int i = 0; i < n; i++) scanf('%d', &v[i]);\n   sort(v, v + n);\n   int res = v[b] - v[b - 1];\n   cout << res << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long maxsize = 100000 + 9;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int T;\n   T = 1;\n   while (T--) {\n     long long i, j, k, m, n, flag = 0;\n     vector<int> v;\n     string s;\n     cin >> n >> s;\n     for (i = 0; i < n; i++) {\n       if (s[i] == '2') {\n         v.push_back(2);\n       }\n       if (s[i] == '3') {\n         v.push_back(3);\n       }\n       if (s[i] == '4') {\n         v.push_back(3);\n         v.push_back(2);\n         v.push_back(2);\n       }\n       if (s[i] == '5') {\n         v.push_back(5);\n       }\n       if (s[i] == '6') {\n         v.push_back(5);\n         v.push_back(3);\n       }\n       if (s[i] == '7') {\n         v.push_back(7);\n       }\n       if (s[i] == '8') {\n         v.push_back(7);\n         v.push_back(2);\n         v.push_back(2);\n         v.push_back(2);\n       }\n       if (s[i] == '9') {\n         v.push_back(7);\n         v.push_back(3);\n         v.push_back(3);\n         v.push_back(2);\n       }\n     }\n     sort(v.begin(), v.end());\n     for (i = v.size() - 1; i >= 0; i--) {\n       cout << v[i];\n     }\n     cout << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, s = 0;\n   cin >> n;\n   if (n >= 1 && n <= 100) {\n     if (n == 1)\n       cout << 1;\n     else {\n       while (1) {\n         if (n == 2) {\n           s = s + 5;\n           break;\n         }\n         s = s + (n * 2) + (n - 2) * 2;\n         n = n - 1;\n       }\n       cout << s;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using namespace std::chrono;\n long long gcd(long long a, long long b) {\n   if (b == 0) {\n     return a;\n   } else {\n     return gcd(b, a % b);\n   }\n }\n void change(map<long long, long long> &m, long long n) {\n   long long i;\n   for (long long i = 1; i < n + 1; i++) {\n     if (m[i] == 1)\n       m.erase(i);\n     else\n       m[i]--;\n   }\n   return;\n }\n void solve() {\n   long long n, i, l, t;\n   cin >> n >> t;\n   string ans = '';\n   map<long long, long long> m;\n   for (long long i = 0; i < t; i++) {\n     cin >> l;\n     m[l]++;\n     if ((long long)m.size() == n) {\n       ans += '1';\n       change(m, n);\n     } else {\n       ans += '0';\n     }\n   }\n   cout << ans;\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   long long t = 1;\n   while (t--) {\n     solve();\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n, a[101][101] = {0}, d = 0;\n   cin >> n;\n   for (long long int i = 1; i <= n; i++) {\n     long long int x1, x2, y1, y2;\n     cin >> x1 >> y1 >> x2 >> y2;\n     for (long long int j = x1; j <= x2; j++) {\n       for (long long int k = y1; k <= y2; k++) {\n         d++;\n       }\n     }\n   }\n   cout << d << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long getLL() {\n   long long ret = 0;\n   char c;\n   while (1) {\n     c = getchar();\n     if (c >= '0' && c <= '9') break;\n   }\n   while (1) {\n     ret = ret * 10 + c - '0';\n     c = getchar();\n     if (c < '0' || c > '9') break;\n   }\n   return ret;\n }\n int getInt() {\n   int ret = 0;\n   char c;\n   while (1) {\n     c = getchar();\n     if (c >= '0' && c <= '9') break;\n   }\n   while (1) {\n     ret = ret * 10 + c - '0';\n     c = getchar();\n     if (c < '0' || c > '9') break;\n   }\n   return ret;\n }\n const double eps = 1e-10;\n int dcmp(double x) { return (x < -eps) ? -1 : (x > eps); }\n struct Point {\n   double x, y;\n   int who;\n   Point() {}\n   Point(double _x, double _y, int _who) : x(_x), y(_y), who(_who){};\n   bool operator<(const Point &b) const {\n     if (dcmp(x - b.x) == 0) return y < b.y;\n     return x < b.x;\n   }\n   Point operator-(const Point &b) const { return Point(x - b.x, y - b.y, 0); }\n   double operator*(const Point &b) const { return x * b.y - y * b.x; }\n } A[1020304];\n int n, Stack[1020304], can[1020304], sameas[1020304];\n int main() {\n   cin >> n;\n   for (int i = 1; i <= n; ++i) {\n     double r, s;\n     scanf('%lf%lf', &r, &s);\n     A[i] = Point(10000.0 / r, 10000.0 / s, i);\n   }\n   sort(A + 1, A + n + 1);\n   int Top = 0;\n   vector<int> ans;\n   for (int i = 1; i <= n; ++i) {\n     if (i > 1 && dcmp(A[i].x - A[i - 1].x) == 0) continue;\n     while (Top > 1 &&\n            (dcmp((A[i] - A[Stack[Top]]) * (A[i] - A[Stack[Top - 1]])) > 0))\n       --Top;\n     Stack[++Top] = i;\n   }\n   for (int i = 1; i <= Top; ++i)\n     if (i == 1 || dcmp(A[Stack[i]].y - A[Stack[i - 1]].y) < 0)\n       can[Stack[i]] = true;\n   for (int i = 1; i <= n; ++i) {\n     if (dcmp(A[i].x - A[i - 1].x) == 0 && dcmp(A[i].y - A[i - 1].y) == 0)\n       can[i] |= can[i - 1];\n     if (can[i]) ans.push_back(A[i].who);\n   }\n   sort(ans.begin(), ans.end());\n   for (auto x : ans) printf('%d ', x);\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 12;\n int p[1 << N], q[1 << N], a[1 << N], pos[1 << N], ans[1 << N];\n void do_swap(int x, int y) {\n   int val = (p[x] ^ q[x] ^ a[x]);\n   if (!val) {\n     return;\n   }\n   int idx = pos[a[x] ^ q[x]];\n   swap(pos[p[x]], pos[p[idx]]);\n   swap(p[x], p[idx]);\n   swap(q[y], q[idx]);\n   do_swap(idx, y);\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int n, i, j, k, l = 0;\n   cin >> n;\n   n = (1 << n);\n   for (i = 0; i < n; i++) {\n     cin >> a[i];\n     l ^= a[i];\n     p[i] = q[i] = pos[i] = i;\n   }\n   if (l) {\n     cout << 'Fou';\n     return 0;\n   }\n   for (i = 0; i + 1 < n; i++) {\n     do_swap(i, i + 1);\n   }\n   cout << 'Shi\n';\n   for (i = 0; i < n; i++) {\n     cout << p[i] << ' ';\n   }\n   cout << '\n';\n   for (i = 0; i < n; i++) {\n     cout << q[i] << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long r, d, n;\n vector<vector<long long>> data;\n const long double pi = 3.1415926535897932;\n long long per(vector<long long> x, vector<long long> y) {\n   long long su = 0;\n   for (long long(i) = 0; (i) < (5); (i)++) {\n     su += x[i] * y[i];\n   }\n   return su;\n }\n long double pere(vector<long long> x, vector<long long> y) {\n   long double su = per(x, y);\n   su /= sqrt(per(x, x)) * sqrt(per(y, y));\n   su = acos(su);\n   return su;\n }\n int main() {\n   cin >> n;\n   data.resize(n);\n   for (long long(i) = 0; (i) < (n); (i)++) {\n     for (long long(j) = 0; (j) < (5); (j)++) {\n       data[i].resize(5);\n       cin >> data[i][j];\n     }\n   }\n   if (n > 32) {\n     cout << 0;\n     return 0;\n   }\n   vector<long long> result;\n   for (long long(i) = 0; (i) < (n); (i)++) {\n     bool mark = false;\n     for (long long(j) = 0; (j) < (n); (j)++) {\n       if (mark) {\n         break;\n       }\n       for (long long(l) = 0; (l) < (n); (l)++) {\n         if (i == j || j == l || i == l) {\n           continue;\n         }\n         vector<long long> x, y;\n         x.resize(5);\n         y.resize(5);\n         for (long long(h) = 0; (h) < (5); (h)++) {\n           x[h] = data[j][h] - data[i][h];\n           y[h] = data[l][h] - data[i][h];\n         }\n         if (pere(x, y) < pi / 2) {\n           mark = true;\n           break;\n         }\n       }\n     }\n     if (!mark) {\n       result.push_back(i);\n     }\n   }\n   cout << result.size() << endl;\n   for (long long(i) = 0; (i) < (result.size()); (i)++) {\n     cout << result[i] + 1 << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     long long n;\n     cin >> n;\n     long long ans = 0, turn = 1;\n     while (n > 0) {\n       if (n % 2) {\n         n--;\n         if (turn % 2) {\n           ans++;\n         }\n       } else {\n         if ((n / 2) % 2 == 0 && (n / 2) != 2) {\n           n--;\n           if (turn % 2) {\n             ans++;\n           }\n         } else {\n           if (turn % 2) {\n             ans += (n / 2);\n           }\n           n /= 2;\n         }\n       }\n       turn++;\n     }\n     cout << ans << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using namespace chrono;\n const int infinity = (int)1e9 + 42;\n const int64_t llInfinity = (int64_t)1e18 + 256;\n const int module = (int)1e9 + 7;\n const long double eps = 1e-8;\n mt19937_64 randGen(system_clock().now().time_since_epoch().count());\n inline void raiseError(string errorCode) {\n   cerr << 'Error : ' << errorCode << endl;\n   exit(42);\n }\n inline basic_string<int64_t> arith(int64_t n, int64_t base, int64_t step) {\n   basic_string<int64_t> res;\n   for (int64_t i = 0; i < n; i++) {\n     res += base;\n     base += step;\n   }\n   return res;\n }\n inline int64_t ask(basic_string<int64_t> b) {\n   cout << b.size();\n   for (int64_t i : b) {\n     cout << ' ' << i;\n   }\n   cout << endl;\n   int64_t x;\n   cin >> x;\n   if (x == -2) {\n     exit(42);\n   }\n   if (x == -1) {\n     exit(0);\n   }\n   return x;\n }\n inline void simpleGuess(int64_t l, int64_t r, int64_t knt, int64_t att) {\n   for (int64_t i = 0; i < att; i++) {\n     if (r - l + 1 <= knt) {\n       ask(arith(r - l + 1, l, 1));\n       exit(42);\n     }\n     int64_t delta = (r - l + 1 - knt) / (knt + 1);\n     int64_t mod = (r - l + 1 - knt) % (knt + 1);\n     int64_t val = l;\n     basic_string<int64_t> bounds;\n     bounds += l - 1;\n     for (int64_t i = 1; i <= knt; i++) {\n       int64_t add = delta + (i <= mod);\n       val += add;\n       bounds += val;\n       val++;\n     }\n     bounds += r + 1;\n     int64_t q = ask(bounds.substr(1, knt));\n     l = bounds[q] + 1;\n     r = bounds[q + 1] - 1;\n   }\n   exit(42);\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   if (ask({204761410474}) == 0) {\n     if (ask({2046}) == 0) {\n       if (ask({6}) == 0) {\n         if (ask({2}) == 0) {\n           ask({1});\n         } else {\n           ask(arith(3, 3, 1));\n         }\n       } else {\n         int64_t q = ask({14, 30, 62, 126, 254, 510, 1022});\n         int64_t w = (8 << q) - 1;\n         ask(arith(w, w, 1));\n       }\n     } else {\n       int64_t base1 = 20468427, step1 = 100020001;\n       int64_t w1 = ask(arith(2047, base1, step1));\n       if (w1 == 0) {\n         int64_t base2 = 16382, step2 = 10001;\n         int64_t w2 =\n             ask(basic_string<int64_t>{4094, 8190} + arith(2045, base2, step2));\n         if (w2 <= 2) {\n           int64_t abase = (2048 << w2) - 1;\n           ask(arith(abase, abase, 1));\n         } else {\n           ask(arith(10000, base2 + (w2 - 3) * step2 + 1, 1));\n         }\n       } else {\n         simpleGuess(base1 + (w1 - 1) * step1 + 1, base1 + w1 * step1 - 1, 10000,\n                     2);\n       }\n     }\n   } else {\n     simpleGuess(204761410475, 10004205361450474, 10000, 4);\n   }\n   return 42;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n, i, f = 0, se = 0, so = 0, sume = 0, sumo = 0, c = 0, x, y;\n   cin >> n;\n   long long int a[n];\n   for (i = 0; i < n; i++) cin >> a[i];\n   for (i = 0; i < n; i++) {\n     if (i % 2)\n       so += a[i];\n     else\n       se += a[i];\n   }\n   for (i = 0; i < n; i++) {\n     if (i % 2) {\n       x = so - sumo - a[i] + sume;\n       y = se - sume + sumo;\n       sumo += a[i];\n     } else {\n       x = so - sumo + sume;\n       y = se - sume + sumo - a[i];\n       sume += a[i];\n     }\n     if (x == y) c++;\n   }\n   cout << c << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dividers[60];\n int main() {\n   long long int n, k;\n   cin >> n >> k;\n   if (k == 1) {\n     cout << 'Yes';\n     return 0;\n   }\n   if (k == 2 && n == 1) {\n     cout << 'Yes';\n     return 0;\n   }\n   if (n <= k) {\n     cout << 'No';\n     return 0;\n   }\n   if (k > 50) {\n     cout << 'No';\n     return 0;\n   }\n   long long int c = n + 1;\n   for (int i = 2; i <= k; i++) {\n     if (c % i != 0) {\n       cout << 'No';\n       return 0;\n     }\n   }\n   cout << 'Yes';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 2e3 + 5;\n char a[MAX][MAX];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0), cout.tie(0);\n   int n, m, k;\n   cin >> n >> m >> k;\n   for (int i = (1); i <= (n); ++i)\n     for (int j = (1); j <= (m); ++j) cin >> a[i][j];\n   int ans = 0;\n   for (int i = (1); i <= (n); ++i) {\n     int cnt = 0;\n     for (int j = (1); j <= (m); ++j) {\n       if (a[i][j] == '.')\n         ++cnt;\n       else {\n         if (cnt >= k) ans += cnt - k + 1;\n         cnt = 0;\n       }\n     }\n     if (cnt >= k) ans += cnt - k + 1;\n   }\n   if (k > 1) {\n     for (int i = (1); i <= (m); ++i) {\n       int cnt = 0;\n       for (int j = (1); j <= (n); ++j) {\n         if (a[j][i] == '.')\n           ++cnt;\n         else {\n           if (cnt >= k) ans += cnt - k + 1;\n           cnt = 0;\n         }\n       }\n       if (cnt >= k) ans += cnt - k + 1;\n     }\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int oo = 10000000;\n int n, m, x, y, a, b;\n int vabs(int t) { return (t > 0) ? t : (-t); }\n int calc(int cx, int cy) {\n   int dx = vabs(cx - x);\n   int dy = vabs(cy - y);\n   if (dx == 0 && dy == 0) return 0;\n   if (dx % a != 0 || dy % b != 0) return oo;\n   int ca = dx / a, cb = dy / b;\n   if (vabs(ca - cb) % 2 != 0) return oo;\n   if (ca < cb && cx - a < 1 && cx + a > n) return oo;\n   if (ca > cb && cy - b < 1 && cy + b > m) return oo;\n   return max(ca, cb);\n }\n int main() {\n   while (cin >> n) {\n     cin >> m >> x >> y >> a >> b;\n     int ans = oo;\n     ans = min(ans, calc(1, 1));\n     ans = min(ans, calc(1, m));\n     ans = min(ans, calc(n, 1));\n     ans = min(ans, calc(n, m));\n     if (ans == oo)\n       cout << 'Poor Inna and pony!' << endl;\n     else\n       cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 1e10;\n void solve() {\n   long long n, c;\n   cin >> n >> c;\n   long long a[n], b[n];\n   for (long long i = 0; i < n; i++) {\n     cin >> a[i] >> b[i];\n   }\n   long long low = -1, high = -1;\n   for (long long i = 1; i <= 100000; i++) {\n     long long cnt = 0;\n     for (long long j = 0; j < n; j++) {\n       cnt++;\n       cnt += (a[j] * i) / b[j];\n     }\n     if (cnt > c) break;\n     if (cnt < c) continue;\n     if (cnt == c) {\n       if (low == -1) low = i;\n       high = i;\n     }\n   }\n   if (high == -1)\n     cout << 0;\n   else\n     cout << high - low + 1;\n }\n int32_t main() {\n   long long t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n, x;\n   std::cin >> n >> x;\n   std::vector<int> data;\n   int counter = 0;\n   for (int i = 0; i != n; i++) {\n     int temp;\n     std::cin >> temp;\n     data.push_back(temp);\n   }\n   std::sort(data.begin(), data.end());\n   if (std::find(data.begin(), data.end(), x) != data.end()) {\n     auto it = std::find(data.begin(), data.end(), x);\n     counter++;\n     data.erase(it);\n   }\n   for (int i = 0; i < x; i++) {\n     if (std::find(data.begin(), data.end(), i) == data.end()) {\n       data.push_back(i);\n       counter++;\n     }\n   }\n   std::cout << counter << std::endl;\n   return 0;\n }\n "}
+{"func_code_string": "\n #include <bits/stdc++.h>\n \n #define ll long long\n #define sz(x) ((int) (x).size())\n #define all(x) (x).begin(), (x).end()\n #define vi vector<int>\n #define pii pair<int, int>\n #define rep(i, a, b) for(int i = (a); i < (b); i++)\n using namespace std;\n template<typename T>\n using minpq = priority_queue<T, vector<T>, greater<T>>;\n \n struct pt {\n     ll x, y;\n     pt(ll x = 0, ll y = 0) : x(x), y(y) {}\n     pt operator-(const pt &o) const {\n         return pt(x - o.x, y - o.y);\n     }\n     ll cross(const pt &o) const {\n         return x * o.y - y * o.x;\n     }\n     bool operator<(const pt &o) const {\n         return cross(o) > 0;\n     }\n };\n \n struct dsu {\n     vi a;\n     dsu(int n) {\n         a.assign(n, -1);\n     }\n     int trace(int x) {\n         return a[x] < 0 ? x : a[x] = trace(a[x]);\n     }\n     void join(int x, int y) {\n         if((x = trace(x)) == (y = trace(y))) return;\n         if(a[x] > a[y]) swap(x, y);\n         a[x] += a[y];\n         a[y] = x;\n     }\n };\n \n int main() {\n     ios::sync_with_stdio(false);\n     cin.tie(0);\n     int n;\n     cin >> n;\n     vi a(n + 1);\n     vector<pt> p(n + 1);\n     rep(i, 1, n + 1) {\n         cin >> p[i].x >> p[i].y >> a[i];\n     }\n     int idx = -1;\n     rep(i, 1, n + 1) {\n         if(a[i] != i && (idx == -1 || p[i].y < p[idx].y)) {\n             idx = i;\n         }\n     }\n     if(idx == -1) {\n         cout << 0 << '\n';\n         return 0;\n     }\n     vi balls;\n     rep(i, 1, n + 1) {\n         if(i != idx && a[i] != i) {\n             balls.push_back(i);\n         }\n     }\n     sort(all(balls), [&](int i, int j) {\n         return p[i] - p[idx] < p[j] - p[idx];\n     });\n     dsu D(n + 1);\n     rep(i, 1, n + 1) D.join(i, a[i]);\n     int k = sz(balls);\n     vector<pii> ops;\n     auto pass = [&](int i, int j) {\n         swap(a[i], a[j]);\n         ops.push_back({i, j});\n     };\n     rep(i, 0, k - 1) {\n         if(D.trace(balls[i]) != D.trace(balls[i + 1])) {\n             pass(balls[i], balls[i + 1]);\n             D.join(balls[i], balls[i + 1]);\n         }\n     }\n     while(a[idx] != idx) {\n         pass(idx, a[idx]);\n     }\n \n     cout << sz(ops) << '\n';\n     for(auto &pa : ops) {\n         cout << pa.first << ' ' << pa.second << '\n';\n     }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n, a[102400], i, j, o = 0, l = 0, ma, k = 0;\n   cin >> n;\n   for (i = 0; i < n; i++) cin >> a[i];\n   for (i = 1; i < n; i++) {\n     if (a[i] + k < a[i - 1]) {\n       o += a[i - 1] - (a[i] + k);\n       k += a[i - 1] - (a[i] + k);\n       a[i] = a[i - 1];\n     } else {\n       if (a[i] < a[i - 1]) {\n         k = a[i - 1] - a[i];\n         a[i] = a[i - 1];\n       } else\n         k = 0;\n     }\n   }\n   cout << o << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 100110;\n const int maxm = 100010;\n char s[maxn][5];\n long long sum[maxm * 4][5][11];\n int n;\n void init() {\n   for (int i = 1; i < maxn; i++)\n     for (int z = 2; z <= 6; z++) {\n       int tp = i % (2 * (z - 1));\n       if (tp == 0)\n         s[i][z - 2] = 2;\n       else if (tp <= z)\n         s[i][z - 2] = tp;\n       else\n         s[i][z - 2] = 2 * z - tp;\n     }\n }\n void build(int pos, int l, int r) {\n   for (int i = 2; i <= 6; i++)\n     for (int j = 0; j <= 10; j++) sum[pos][i - 2][j] = 0;\n   if (l == r) return;\n   int mid = (l + r) >> 1;\n   build((pos << 1), l, mid);\n   build(((pos << 1) | 1), mid + 1, r);\n }\n void insert(int pos, int l, int r, int i, int a) {\n   if (i < l || i > r) return;\n   if (l == r) {\n     for (int z = 2; z <= 6; z++)\n       for (int j = 0; j <= 10; j++)\n         sum[pos][z - 2][j] = (long long)s[i + j][z - 2] * a;\n     return;\n   }\n   int mid = (l + r) >> 1;\n   insert((pos << 1), l, mid, i, a);\n   insert(((pos << 1) | 1), mid + 1, r, i, a);\n   for (int z = 2; z <= 6; z++)\n     for (int j = 0; j <= 10; j++)\n       sum[pos][z - 2][j] =\n           sum[(pos << 1)][z - 2][j] + sum[((pos << 1) | 1)][z - 2][j];\n }\n long long search(int pos, int l, int r, int x, int y, int z, int offset) {\n   if (y < l || r < x) return 0;\n   if (x <= l && r <= y) return sum[pos][z - 2][offset];\n   int mid = (l + r) >> 1;\n   return search((pos << 1), l, mid, x, y, z, offset) +\n          search(((pos << 1) | 1), mid + 1, r, x, y, z, offset);\n }\n int main() {\n   init();\n   while (~scanf('%d', &n)) {\n     build(1, 1, n);\n     for (int i = 1; i <= n; i++) {\n       int a;\n       scanf('%d', &a);\n       insert(1, 1, n, i, a);\n     }\n     int m;\n     scanf('%d', &m);\n     while (m-- > 0) {\n       int t, p, v, l, r, z;\n       scanf('%d', &t);\n       if (t == 1) {\n         scanf('%d%d', &p, &v);\n         insert(1, 1, n, p, v);\n       } else {\n         scanf('%d%d%d', &l, &r, &z);\n         int offset = 0;\n         if (s[l][z - 2] <= s[l + 1][z - 2]) {\n           if (s[l][z - 2] == 1)\n             offset = 0;\n           else\n             offset = z - s[l][z - 2] + z - 1;\n         } else {\n           offset = s[l][z - 2] - 1;\n         }\n         cout << search(1, 1, n, l, r, z, offset) << endl;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   string s;\n   cin >> n;\n   getline(cin, s);\n   for (int i = 0; i < n; ++i) {\n     getline(cin, s);\n     int len = s.length();\n     if (len < 5)\n       cout << 'OMG>.< I don't know!' << endl;\n     else {\n       string prefix(s.substr(0, 5));\n       string suffix(s.substr(len - 5, 5));\n       if (prefix == 'miao.' && suffix == 'lala.')\n         cout << 'OMG>.< I don't know!' << endl;\n       else if (prefix == 'miao.')\n         cout << 'Rainbow's' << endl;\n       else if (suffix == 'lala.')\n         cout << 'Freda's' << endl;\n       else\n         cout << 'OMG>.< I don't know!' << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n const int inf = 2e9 + 5;\n const int N = 1e5;\n int cost[26];\n map<long long, long long> m[26];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(nullptr);\n   for (int i = 0; i < 26; i++) cin >> cost[i];\n   string s;\n   cin >> s;\n   long long n = s.length(), sum = 0;\n   long long ans = 0;\n   for (int i = 0; i < n; i++) {\n     ans += m[s[i] - 'a'][sum];\n     sum += cost[s[i] - 'a'];\n     m[s[i] - 'a'][sum] += 1;\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void prv(vector<int> v) {\n   int n = v.size();\n   for (int i = 0; i < n; i++) cout << v[i] << ' ';\n }\n void swap(long long int &a, long long int &b) {\n   int tm = a;\n   a = b;\n   b = tm;\n }\n bool comp(const pair<int, int> &p1, const pair<int, int> &p2) {\n   if (p1.first > p2.first)\n     return 1;\n   else\n     return 0;\n }\n const int N = 3e5 + 5;\n void findPrefix(string pattern, int m, int prefArray[]) {\n   int length = 0;\n   prefArray[0] = 0;\n   for (int i = 1; i < m; i++) {\n     if (pattern[i] == pattern[length]) {\n       length++;\n       prefArray[i] = length;\n     } else {\n       if (length != 0) {\n         length = prefArray[length - 1];\n         i--;\n       } else\n         prefArray[i] = 0;\n     }\n   }\n }\n int kmpPattSearch(string mainString, string pattern) {\n   int n, m, i = 0, j = 0, fr = 0;\n   n = mainString.size();\n   m = pattern.size();\n   int prefixArray[m];\n   findPrefix(pattern, m, prefixArray);\n   while (i < n) {\n     if (mainString[i] == pattern[j]) {\n       i++;\n       j++;\n     }\n     if (j == m) {\n       fr++;\n       j = prefixArray[j - 1];\n     } else if (i < n && pattern[j] != mainString[i]) {\n       if (j != 0)\n         j = prefixArray[j - 1];\n       else\n         i++;\n     }\n   }\n   return fr;\n }\n string crts(int d, int m, int y) {\n   string t;\n   t.clear();\n   while (y != 0) {\n     t.push_back(y % 10 + '0');\n     y = y / 10;\n   }\n   t.push_back('-');\n   while (m != 0) {\n     t.push_back(m % 10 + '0');\n     m = m / 10;\n   }\n   if (t.size() == 6) t.push_back('0');\n   t.push_back('-');\n   while (d != 0) {\n     t.push_back(d % 10 + '0');\n     d = d / 10;\n   }\n   if (t.size() == 9) t.push_back('0');\n   reverse((t).begin(), (t).end());\n   return t;\n }\n void solve() {\n   string s, ans;\n   cin >> s;\n   int mx = 0;\n   for (int i = 2013; i < 2016; ++i) {\n     for (int j = 1; j <= 12; j++) {\n       int k;\n       if (j == 2)\n         k = 28;\n       else if (j == 1 || j == 3 || j == 5 || j == 7 || j == 8 || j == 10 ||\n                j == 12)\n         k = 31;\n       else\n         k = 30;\n       for (int l = 1; l <= k; l++) {\n         string t;\n         int frq;\n         t = crts(l, j, i);\n         frq = kmpPattSearch(s, t);\n         if (frq > mx) {\n           mx = frq;\n           ans = t;\n         }\n       }\n     }\n   }\n   cout << ans;\n }\n signed int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int t = 1;\n   while (t--) {\n     solve();\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double PI = acos(-1.0);\n template <class T>\n T SQR(const T &a) {\n   return a * a;\n }\n void run() {\n   char str[1000100];\n   scanf('%s', str);\n   int n = strlen(str);\n   int m;\n   cin >> m;\n   int A[10001];\n   int B[10001];\n   map<int, int> res;\n   char pat[100];\n   for (int i = (0), ei = (m); i < ei; i++) {\n     scanf(' %s', pat);\n     int mask = 0;\n     for (int j = (0), ej = (strlen(pat)); j < ej; j++)\n       mask |= 1 << (pat[j] - 'a');\n     B[i] = A[i] = mask;\n   }\n   sort(B, B + m);\n   int Pos[26] = {0};\n   for (int i = (0), ei = (26); i < ei; i++) Pos[i] = -1;\n   int mask = 0, curr;\n   pair<int, int> P[26];\n   str[n] = 'z' + 1;\n   for (int i = (0), ei = (n); i < ei; i++) {\n     mask |= 1 << (str[i] - 'a');\n     Pos[str[i] - 'a'] = i;\n     for (int j = (0), ej = (26); j < ej; j++) {\n       P[j].first = Pos[j];\n       P[j].second = j;\n     }\n     sort(P, P + 26);\n     curr = mask;\n     int next = 1 << (str[i + 1] - 'a');\n     if (binary_search(B, B + m, mask) && (mask & next) == 0) res[mask]++;\n     for (int j = (0), ej = (25); j < ej; j++)\n       if (P[j].first != -1) {\n         curr &= ~(1 << P[j].second);\n         if (binary_search(B, B + m, curr) && (curr & next) == 0) res[curr]++;\n       }\n   }\n   for (int i = (0), ei = (m); i < ei; i++) printf('%d\n', res[A[i]]);\n }\n int main() {\n   run();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n  \n #define st first\n #define nd second\n #define pb push_back\n #define BOOST ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);\n #define PI 3.14159265359\n  \n using namespace std;\n  \n typedef long long ll;\n constexpr ll MOD = 1000000007, sup = 29;\n constexpr ll MOD_1 = 1234567891, sup_1 = 1009;\n constexpr ll MOD_2 = 1000000009, sup_2 = 107;\n constexpr int MXN = 200000+10, CZAPA = (1<<18), INF = 1000000000;\n \n int n, m;\n \n struct tree{\n 	pair<int, int> tab[2*CZAPA+10];\n \n 	void add(int leaf, int x){\n 		int v = leaf + CZAPA;\n 		tab[v] = {x, x};\n 		v /= 2;\n 		while(v >= 1){\n 			tab[v].st = min(tab[2*v].st, tab[2*v+1].st);\n 			tab[v].nd = max(tab[2*v].nd, tab[2*v+1].nd);\n 			v /= 2;\n 		}\n 	}\n \n 	pair<int, int> query(int a, int b, int v, int p, int q){\n 		if(q < a || b < p)\n 			return {INF, -INF};\n 		if(p >= a && q <= b)\n 			return tab[v];\n 		int mid = (p+q)/2;\n 		pair<int, int> x = query(a, b, 2*v, p, mid), y = query(a, b, 2*v+1, mid+1, q);\n 		return {min(x.st, y.st), max(x.nd, y.nd)};\n 	}\n \n 	pair<int, int> query(int a, int b){\n 		return query(a+CZAPA, b+CZAPA, 1, CZAPA, 2*CZAPA-1);\n 	}\n };\n \n tree T;\n \n int tab[MXN];\n \n \n int main(){\n 	BOOST;\n \n 	int t;\n 	cin>> t;\n 	T.add(0, 0);\n 	while(t--){\n 		string s; \n 		cin>> n >> m >> s;\n 		for(int i=1; i<=n; i++){\n 			tab[i] = tab[i-1];\n 			if(s[i-1] == '-')\n 				tab[i]--;\n 			else\n 				tab[i]++;\n 			T.add(i, tab[i]);\n 			//cout<< tab[i] << ' ';\n 		}\n 		//cout<< '\n';\n 		while(m--){\n 			int a, b;\n 			cin>> a >> b;\n 			pair<int, int> x = T.query(0, a-1);\n 			int sum = tab[b] - tab[a-1];\n 			pair<int, int> y = T.query(b+1, n);\n 			if(y.st == INF){\n 				cout<< abs(x.st-x.nd)+1 << '\n';\n 				continue;\n 			}\n 			y.st -= sum;\n 			y.nd -= sum;\n 			pair<int, int> ans = {min(x.st, y.st), max(x.nd, y.nd)};\n 			cout<< abs(ans.st-ans.nd)+1 << '\n';\n 			//cout<< x.st << ' ~ ' << x.nd << ', ' << y.st << ' ~ ' << y.nd << '\n';\n 		}\n 	}\n \n 	\n 	\n 	return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int read() {\n   int s = 0, w = 1;\n   char ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') w = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();\n   return s * w;\n }\n const int inf = 2e9 + 7;\n double eps = 1e-6;\n const int mod = 1e9 + 9;\n const int N = 1e3 + 10;\n const double pi = acos(-1.0);\n long long power(long long a, long long b) {\n   long long res = 1;\n   while (b) {\n     if (b & 1) res = res * a % mod;\n     a = a * a % mod;\n     b >>= 1;\n   }\n   return res;\n }\n long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }\n long long exgcd(long long a, long long b, long long& x, long long& y) {\n   long long c;\n   return !b ? (x = 1, y = 0, a)\n             : (c = exgcd(b, a % b, y, x), y -= (a / b) * x, c);\n }\n long long INV(long long a) {\n   long long x, y;\n   exgcd(a, mod, x, y);\n   x %= mod;\n   if (x < 0) x += mod;\n   return x;\n }\n int n;\n long long dp[N][N][11];\n struct AC {\n   int tr[N][26], tot;\n   int fail[N];\n   int tr2[N][26];\n   int Len[N];\n   bool key[N];\n   int insert(char s[]) {\n     int u = 0;\n     for (int i = 1; s[i]; i++) {\n       int c = s[i] - 'a';\n       if (!tr[u][c]) tr[u][c] = ++tot;\n       Len[tr[u][c]] = Len[u] + 1;\n       u = tr[u][c];\n     }\n     key[u] = 1;\n     return u;\n   }\n   void build() {\n     for (int i = 0; i <= tot; ++i)\n       for (int j = 0; j <= 3; ++j) tr2[i][j] = tr[i][j];\n     queue<int> q;\n     for (int i = 0; i <= 25; ++i)\n       if (tr[0][i]) q.push(tr[0][i]);\n     while (!q.empty()) {\n       int u = q.front();\n       q.pop();\n       for (int i = 0; i <= 25; ++i) {\n         if (tr[u][i]) {\n           fail[tr[u][i]] = tr[fail[u]][i], q.push(tr[u][i]);\n         } else\n           tr[u][i] = tr[fail[u]][i];\n       }\n     }\n   }\n   int dfs(int u, int len, int k) {\n     bool ok = key[u];\n     int now = u;\n     while (1) {\n       now = fail[now];\n       if (Len[now] >= k && key[now]) {\n         ok |= 1;\n         break;\n       }\n       if (now == 0) break;\n     }\n     if (ok) k = 0;\n     if (!u) return 0;\n     if (dp[u][len][k] != -1) return dp[u][len][k];\n     if (len == n) {\n       bool ok = key[u];\n       int now = u;\n       while (1) {\n         now = fail[now];\n         if (Len[now] >= k && key[now]) {\n           ok |= 1;\n           break;\n         }\n         if (now == 0) break;\n       }\n       return dp[u][len][k] = ok;\n     }\n     long long& res = dp[u][len][k] = 0;\n     for (int i = 0; i <= 3; i++) {\n       if (tr2[u][i])\n         res += dfs(tr2[u][i], len + 1, k + 1);\n       else {\n         int now = u;\n         while (1) {\n           now = fail[now];\n           if (Len[now] >= k && tr2[now][i]) {\n             res += dfs(tr2[now][i], len + 1, k + 1);\n             break;\n           }\n           if (now == 0) break;\n         }\n       }\n     }\n     res %= mod;\n     return res;\n   }\n   int work() {\n     memset(dp, -1, sizeof(dp));\n     long long res = 0;\n     for (int i = 0; i <= 3; i++) res += dfs(tr[0][i], 1, 1);\n     res %= mod;\n     return res;\n   }\n } ac;\n char s[N];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int m;\n   cin >> n >> m;\n   map<char, char> mp;\n   mp['A'] = 'a';\n   mp['C'] = 'b';\n   mp['T'] = 'c';\n   mp['G'] = 'd';\n   for (int i = 1; i <= m; ++i) {\n     cin >> s + 1;\n     for (int i = 1; i <= strlen(s + 1); ++i) s[i] = mp[s[i]];\n     ac.insert(s);\n   }\n   ac.build();\n   cout << ac.work() << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct edge {\n   long long to, cost;\n   edge() {}\n   edge(long long a, long long b) { to = a, cost = b; }\n };\n const long long dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};\n const long long mod = 1000000007;\n struct mint {\n   long long x = 0;\n   mint(long long y = 0) {\n     x = y;\n     if (x < 0 || x >= mod) x = (x % mod + mod) % mod;\n   }\n   mint(const mint& ope) { x = ope.x; }\n   mint operator-() { return mint(-x); }\n   mint operator+(const mint& ope) { return mint(x) += ope; }\n   mint operator-(const mint& ope) { return mint(x) -= ope; }\n   mint operator*(const mint& ope) { return mint(x) *= ope; }\n   mint operator/(const mint& ope) { return mint(x) /= ope; }\n   mint& operator+=(const mint& ope) {\n     x += ope.x;\n     if (x >= mod) x -= mod;\n     return *this;\n   }\n   mint& operator-=(const mint& ope) {\n     x += mod - ope.x;\n     if (x >= mod) x -= mod;\n     return *this;\n   }\n   mint& operator*=(const mint& ope) {\n     x *= ope.x, x %= mod;\n     return *this;\n   }\n   mint& operator/=(const mint& ope) {\n     long long n = mod - 2;\n     mint mul = ope;\n     while (n) {\n       if (n & 1) *this *= mul;\n       mul *= mul;\n       n >>= 1;\n     }\n     return *this;\n   }\n   mint inverse() { return mint(1) / *this; }\n   bool operator==(const mint& ope) { return x == ope.x; }\n   bool operator!=(const mint& ope) { return x != ope.x; }\n };\n mint modpow(mint a, long long n) {\n   if (n == 0) return mint(1);\n   if (n % 2)\n     return a * modpow(a, n - 1);\n   else\n     return modpow(a * a, n / 2);\n }\n istream& operator>>(istream& is, mint& ope) {\n   long long t;\n   is >> t, ope.x = t;\n   return is;\n }\n ostream& operator<<(ostream& os, mint& ope) { return os << ope.x; }\n ostream& operator<<(ostream& os, const mint& ope) { return os << ope.x; }\n vector<mint> fact, fact_inv;\n void make_fact(int n) {\n   fact.resize(n + 1), fact_inv.resize(n + 1);\n   fact[0] = mint(1);\n   for (long long i = (1); (i) <= (n); (i)++) fact[i] = fact[i - 1] * mint(i);\n   fact_inv[n] = fact[n].inverse();\n   for (long long i = (n - 1); (i) >= (0); (i)--)\n     fact_inv[i] = fact_inv[i + 1] * mint(i + 1);\n }\n mint comb(long long n, long long k) {\n   if (n < 0 || k < 0 || n < k) return mint(0);\n   return fact[n] * fact_inv[k] * fact_inv[n - k];\n }\n mint perm(long long n, long long k) { return comb(n, k) * fact[k]; }\n vector<int> prime;\n void make_prime(int n) {\n   prime.resize(n + 1);\n   for (long long i = (2); (i) <= (n); (i)++) {\n     if (prime[i]) continue;\n     for (int j = i; j <= n; j += i) prime[j] = i;\n   }\n }\n bool exceed(long long x, long long y, long long m) { return x >= m / y + 1; }\n void mark() { cout << '*' << endl; }\n void yes() { cout << 'YES' << endl; }\n void no() { cout << 'NO' << endl; }\n long long sgn(long long x) {\n   if (x > 0) return 1;\n   if (x < 0) return -1;\n   return 0;\n }\n long long gcd(long long a, long long b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }\n long long digitnum(long long x, long long b = 10) {\n   long long ret = 0;\n   for (; x; x /= b) ret++;\n   return ret;\n }\n long long digitsum(long long x, long long b = 10) {\n   long long ret = 0;\n   for (; x; x /= b) ret += x % b;\n   return ret;\n }\n string lltos(long long x) {\n   string ret;\n   for (; x; x /= 10) ret += x % 10 + '0';\n   reverse(ret.begin(), ret.end());\n   return ret;\n }\n long long stoll(string& s) {\n   long long ret = 0;\n   for (auto c : s) ret *= 10, ret += c - '0';\n   return ret;\n }\n template <typename T>\n void uniq(T& vec) {\n   sort(vec.begin(), vec.end());\n   vec.erase(unique(vec.begin(), vec.end()), vec.end());\n }\n template <class S, class T>\n pair<S, T>& operator+=(pair<S, T>& s, const pair<S, T>& t) {\n   s.first += t.first, s.second += t.second;\n   return s;\n }\n template <class S, class T>\n pair<S, T>& operator-=(pair<S, T>& s, const pair<S, T>& t) {\n   s.first -= t.first, s.second -= t.second;\n   return s;\n }\n template <class S, class T>\n pair<S, T> operator+(const pair<S, T>& s, const pair<S, T>& t) {\n   return pair<S, T>(s.first + t.first, s.second + t.second);\n }\n template <class S, class T>\n pair<S, T> operator-(const pair<S, T>& s, const pair<S, T>& t) {\n   return pair<S, T>(s.first - t.first, s.second - t.second);\n }\n template <typename T>\n ostream& operator<<(ostream& os, vector<T>& vec) {\n   for (int i = 0; i < vec.size(); i++)\n     os << vec[i] << (i + 1 == vec.size() ? '' : ' ');\n   return os;\n }\n template <typename T>\n ostream& operator<<(ostream& os, deque<T>& deq) {\n   for (int i = 0; i < deq.size(); i++)\n     os << deq[i] << (i + 1 == deq.size() ? '' : ' ');\n   return os;\n }\n template <typename T, typename U>\n ostream& operator<<(ostream& os, pair<T, U>& pair_var) {\n   os << '(' << pair_var.first << ', ' << pair_var.second << ')';\n   return os;\n }\n template <typename T, typename U>\n ostream& operator<<(ostream& os, const pair<T, U>& pair_var) {\n   os << '(' << pair_var.first << ', ' << pair_var.second << ')';\n   return os;\n }\n template <typename T, typename U>\n ostream& operator<<(ostream& os, map<T, U>& map_var) {\n   for (typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end();\n        itr++) {\n     os << '(' << itr->first << ', ' << itr->second << ')';\n     itr++;\n     if (itr != map_var.end()) os << ',';\n     itr--;\n   }\n   return os;\n }\n template <typename T>\n ostream& operator<<(ostream& os, set<T>& set_var) {\n   for (typename set<T>::iterator itr = set_var.begin(); itr != set_var.end();\n        itr++) {\n     os << *itr;\n     ++itr;\n     if (itr != set_var.end()) os << ' ';\n     itr--;\n   }\n   return os;\n }\n template <typename T>\n ostream& operator<<(ostream& os, multiset<T>& set_var) {\n   for (typename multiset<T>::iterator itr = set_var.begin();\n        itr != set_var.end(); itr++) {\n     os << *itr;\n     ++itr;\n     if (itr != set_var.end()) os << ' ';\n     itr--;\n   }\n   return os;\n }\n template <typename T>\n void outa(T a[], long long s, long long t) {\n   for (long long i = s; i <= t; i++) {\n     cout << a[i];\n     if (i < t) cout << ' ';\n   }\n   cout << endl;\n }\n void dump_func() { cout << endl; }\n template <class Head, class... Tail>\n void dump_func(Head&& head, Tail&&... tail) {\n   cout << head;\n   if (sizeof...(Tail) > 0) cout << ' ';\n   dump_func(std::move(tail)...);\n }\n long long n;\n long long a[150005];\n bool check(long long i) {\n   if (i <= 0 || i >= n) return true;\n   if (i % 2)\n     return a[i] < a[i + 1];\n   else\n     return a[i] > a[i + 1];\n }\n int main(void) {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n;\n   for (long long i = (1); (i) <= (n); (i)++) cin >> a[i];\n   set<long long> S;\n   set<pair<long long, long long> > ans;\n   for (long long i = (1); (i) <= (n - 1); (i)++)\n     if (!check(i)) S.insert(i);\n   if (((long long)(S).size()) > 4) {\n     dump_func(0);\n     return 0;\n   }\n   set<long long> T;\n   for (auto x : S) {\n     T.insert(x);\n     T.insert(x + 1);\n   }\n   for (auto x : T) {\n     for (long long i = (1); (i) <= (n); (i)++) {\n       if (i == x) continue;\n       swap(a[i], a[x]);\n       bool flag = true;\n       for (auto y : S) flag &= check(y);\n       for (long long j = (-1); (j) <= (1); (j)++)\n         flag &= check(i + j), flag &= check(x + j);\n       if (flag) {\n         long long u = i, v = x;\n         if (u > v) swap(u, v);\n         ans.insert(pair<long long, long long>(u, v));\n       }\n       swap(a[i], a[x]);\n     }\n   }\n   dump_func(((long long)(ans).size()));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n const long long LINF = 0x3f3f3f3f3f3f3f3fLL;\n const double PI = acos(-1.0);\n const double EPS = 1e-8;\n const int MOD = 998244353;\n template <typename T>\n void cmin(T &x, T y) {\n   if (y < x) x = y;\n }\n template <typename T>\n void cmax(T &x, T y) {\n   if (y > x) x = y;\n }\n long long qpow(long long x, long long n, long long mod = MOD) {\n   long long res = 1;\n   while (n) {\n     if (n & 1) res = res * x % mod;\n     x = x * x % mod;\n     n >>= 1;\n   }\n   return res;\n }\n namespace Solver {\n void InitOnce() {}\n int n, m, k;\n int u[200005];\n int v[200005];\n int deg[200005];\n vector<pair<int, int> > G[200005];\n void Read() {\n   int res = scanf('%d%d%d', &n, &m, &k);\n   if (res == -1) exit(0);\n   for (int i = 1; i <= n; ++i) G[i].clear();\n   for (int i = 1; i <= m; ++i) {\n     scanf('%d%d', &u[i], &v[i]);\n     G[u[i]].emplace_back(v[i], i);\n     G[v[i]].emplace_back(u[i], i);\n   }\n   for (int i = 1; i <= n; ++i) deg[i] = G[i].size();\n }\n bool vis[200005];\n int ans[200005];\n bool inQ[200005];\n queue<int> Q;\n void delEdge(int u, int v, int id) {\n   if (vis[id]) return;\n   vis[id] = 1;\n   --deg[u];\n   --deg[v];\n   if (inQ[v] == 0 && deg[v] < k) {\n     Q.push(v);\n     inQ[v] = 1;\n   }\n }\n void delEdge2(int u, int v, int id) {\n   if (vis[id]) return;\n   vis[id] = 1;\n   --deg[u];\n   --deg[v];\n   if (inQ[u] == 0 && deg[u] < k) {\n     Q.push(u);\n     inQ[u] = 1;\n   }\n   if (inQ[v] == 0 && deg[v] < k) {\n     Q.push(v);\n     inQ[v] = 1;\n   }\n }\n void Solve() {\n   memset(vis, 0, sizeof(vis));\n   memset(ans, 0, sizeof(ans));\n   memset(inQ, 0, sizeof(inQ));\n   for (int i = 1; i <= n; ++i) {\n     if (deg[i] < k) {\n       Q.push(i);\n       inQ[i] = 1;\n     }\n   }\n   int cur = n;\n   while (!Q.empty()) {\n     int u = Q.front();\n     Q.pop();\n     --cur;\n     for (pair<int, int> &p : G[u]) {\n       int v = p.first, id = p.second;\n       delEdge(u, v, id);\n     }\n   }\n   for (int i = 1; i <= n; ++i) {\n     if (deg[i]) assert(deg[i] >= k);\n   }\n   ans[m] = cur;\n   for (int i = m - 1; i >= 0; --i) {\n     int de = i + 1;\n     delEdge2(u[de], v[de], de);\n     while (!Q.empty()) {\n       int u = Q.front();\n       Q.pop();\n       --cur;\n       for (pair<int, int> &p : G[u]) {\n         int v = p.first, id = p.second;\n         delEdge(u, v, id);\n       }\n     }\n     ans[i] = cur;\n   }\n   for (int i = 1; i <= n; ++i) {\n     assert(deg[i] == 0);\n     assert(inQ[i] == 1);\n   }\n   for (int i = 1; i <= m; ++i) assert(vis[i] == 1);\n   for (int i = 1; i <= m; ++i) printf('%d\n', ans[i]);\n   return;\n }\n }  // namespace Solver\n int main() {\n   Solver::InitOnce();\n   while (true) {\n     Solver::Read();\n     Solver::Solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MOD = 1e9 + 7;\n const long long INF = 1e18;\n const string nl = '\n';\n int32_t main() {\n   ios::sync_with_stdio(0);\n   cin.tie(nullptr);\n   long long n, k;\n   cin >> n >> k;\n   vector<long long> a(n);\n   for (auto& i : a) {\n     cin >> i;\n   }\n   vector<long long> pref(n);\n   long long sum = 0, ans = 0;\n   bool ok = 0;\n   map<long long, long long> cnt;\n   cnt[0] = 1;\n   for (long long i = 0; i < n; ++i) {\n     if (a[i] > k) {\n       ++sum;\n     } else if (a[i] < k) {\n       --sum;\n     }\n     if (a[i] == k) {\n       ok = 1;\n     }\n     if (ok) {\n       ans += cnt[sum] + cnt[sum - 1];\n     } else {\n       ++cnt[sum];\n     }\n   }\n   cout << ans << nl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a, b, c, cc = 0;\n   cin >> a >> b >> c;\n   if (a < 0 || b < 2 || c < 4)\n     cout << 0 << endl;\n   else {\n     while (a >= 1 && b >= 2 && c >= 4) {\n       cc++;\n       a--;\n       b -= 2;\n       c -= 4;\n     }\n     cout << cc * 7 << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<long long> v[100001];\n int main() {\n   int n;\n   cin >> n;\n   for (long long i = 1; i < n; i++) {\n     long long a, b;\n     cin >> a >> b;\n     v[a].push_back(b);\n     v[b].push_back(a);\n   }\n   for (long long i = 1; i <= n; i++) {\n     if (v[i].size() == 2) {\n       cout << 'NO';\n       return 0;\n     }\n   }\n   cout << 'YES';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #pragma GCC optimize('-Ofast')\n #pragma GCC optimize('trapv')\n #pragma GCC target( \\n     'sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native')\n #pragma GCC optimize('-ffast-math')\n #pragma GCC optimize('-funroll-loops')\n #pragma GCC optimize('-funroll-all-loops,-fpeel-loops,-funswitch-loops')\n const int N = 1e3 + 40;\n const int MAXK = 12;\n const long long int INF = 1000000000000000000;\n const int RANDOM =\n     chrono::high_resolution_clock::now().time_since_epoch().count();\n long long int expo_pow(long long int x, long long int y) {\n   if (y == 0) return 1;\n   y = y % ((1000000007) - 1);\n   x %= (1000000007);\n   if (y == 0) y = (1000000007) - 1;\n   long long int res = 1;\n   while (y) {\n     if (y & 1) res = (res * x) % (1000000007);\n     x = (x * x) % (1000000007);\n     y >>= 1;\n   }\n   return res;\n }\n long long int modInverse(long long int a, long long int m = (1000000007)) {\n   return expo_pow(a, m - 2);\n }\n void solve() {\n   int n;\n   cin >> n;\n   vector<vector<long long int>> cnt(n + 2);\n   map<int, int> ones;\n   map<int, int> t;\n   for (long long int i = (1); i < (n + 1); i++) {\n     int tp, w;\n     cin >> tp >> w;\n     if (w) ones[tp]++;\n     t[tp]++;\n   }\n   for (auto x : t) {\n     cnt[x.second].push_back(ones[x.first]);\n   }\n   priority_queue<pair<long long int, long long int>> pq;\n   long long int ans = 0;\n   long long int fo = 0;\n   set<long long int> second;\n   for (long long int i = (1); i < (n + 1); i++) {\n     if (1) second.insert(i);\n     for (long long int j = (0); j < (cnt[i].size()); j++) {\n       pq.push(make_pair(cnt[i][j], i));\n     }\n   }\n   while (second.size()) {\n     if (pq.empty()) break;\n     int x = pq.top().second;\n     auto it = second.upper_bound(x);\n     if (it == second.begin()) {\n       pq.pop();\n       continue;\n     }\n     it--;\n     ans += *it;\n     fo += min(*it, pq.top().first);\n     pq.pop();\n     second.erase(*it);\n   }\n   cout << ans << ' ' << fo << '\n';\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int T = 1;\n   cin >> T;\n   while (T--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long n, k, iters, p[10000], q[1000], rp[1000], ar[200000], ar1[20000];\n long ans;\n bool not_same() {\n   for (int i = 1; i <= n; i++)\n     if (ar[i] != q[i]) return true;\n   return false;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n >> k;\n   for (int i = 1; i <= n; i++) cin >> p[i];\n   for (int i = 1; i <= n; i++) cin >> q[i];\n   for (int i = 1; i <= n; i++) rp[p[i]] = i;\n   long tf = 0;\n   for (int i = 1; i <= n; i++)\n     if (rp[i] != p[i]) tf = 1;\n   ans = 0;\n   for (int i = 1; i <= n; i++) ar[i] = i;\n   iters = 0;\n   while (not_same()) {\n     ++iters;\n     for (int i = 1; i <= n; i++) ar1[i] = ar[p[i]];\n     for (int i = 1; i <= n; i++) ar[i] = ar1[i];\n     if (iters > k) break;\n   }\n   if (iters <= k && iters % 2 == k % 2) ans = 1;\n   for (int i = 1; i <= n; i++) ar[i] = i;\n   iters = 0;\n   while (not_same()) {\n     ++iters;\n     for (int i = 1; i <= n; i++) ar1[i] = ar[rp[i]];\n     for (int i = 1; i <= n; i++) ar[i] = ar1[i];\n     if (iters > k) break;\n   }\n   if (iters <= k && iters % 2 == k % 2) ans = 1;\n   long fl = 0;\n   for (int i = 1; i <= n; i++)\n     if (q[i] != i) fl = 1;\n   if (fl == 0) ans = 0;\n   if (tf == 0 && k > 1) ans = 0;\n   if (ans)\n     cout << 'YES' << endl;\n   else\n     cout << 'NO' << endl;\n   cin.get();\n   cin.get();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a, b, ans = 6;\n int len[15], last[15];\n void dfs(int x, int va) {\n   if (x == 7) {\n     ans = min(ans, va);\n     return;\n   }\n   for (int i = 1; i <= va; i++) {\n     if (last[i] >= len[x]) {\n       last[i] -= len[x];\n       dfs(x + 1, va);\n       last[i] += len[x];\n     }\n   }\n   last[va + 1] = n - len[x];\n   dfs(x + 1, va + 1);\n }\n int main() {\n   scanf('%d%d%d', &n, &a, &b);\n   for (int i = 1; i <= 4; i++) len[i] = a;\n   for (int i = 5; i <= 6; i++) len[i] = b;\n   dfs(1, 0);\n   printf('%d', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   vector<string> s;\n   set<string> ss;\n   string a, b, res;\n   int n, cnt_a = 0, cnt_b = 0;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> a;\n     ss.insert(a);\n     s.push_back(a);\n   }\n   if (ss.size() == 1)\n     cout << s[0] << endl;\n   else {\n     sort(s.begin(), s.end());\n     a = s[0];\n     b = s[n - 1];\n     for (int i = 0; i < n; i++) {\n       if (s[i].compare(a) == 0)\n         cnt_a++;\n       else\n         cnt_b++;\n     }\n     res = (cnt_a > cnt_b) ? a : b;\n     cout << res << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   int x, y;\n   while (t--) {\n     cin >> x >> y;\n     if (y <= sqrt(x)) {\n       if (x % 2 == 0 && y % 2 == 0)\n         cout << 'YES' << endl;\n       else if (x % 2 == 1 && y % 2 == 1)\n         cout << 'YES' << endl;\n       else\n         cout << 'NO' << endl;\n     } else\n       cout << 'NO' << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1000003;\n long double pi = 3.1415926536;\n const int mx = 1000003;\n long long gcd(long long x, long long y) {\n   if (y == 0) return x;\n   return gcd(y, x % y);\n }\n long long bp(long long a, long long b) {\n   long long ans = 1;\n   while (b > 0) {\n     if (b & 1) ans = (ans * a) % mod;\n     a = (a * a) % mod;\n     b >>= 1;\n   }\n   return ans;\n }\n long long p(long long n) {\n   for (long long i = 2; i * i <= n; i++) {\n     if (n % i == 0) {\n       return n / i;\n     }\n   }\n   return 1;\n }\n void solve() {\n   long long a, d, x, i = 1;\n   cin >> a >> d;\n   x = a++;\n   while ((a % i) <= d) {\n     x = (a - (a % i));\n     i *= 10;\n   }\n   cout << x - 1;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int a, b;\n   cin >> a >> b;\n   if (a == 0 && b == 0) {\n     cout << 1;\n   }\n   if (a == 0 && b != 0) {\n     for (int i = b + 1; i > 0; i--) {\n       cout << i << ' ';\n     }\n   }\n   if (b == 0 && a != 0) {\n     for (int i = 1; i <= a + 1; i++) {\n       cout << i << ' ';\n     }\n   }\n   int z = a + b + 1;\n   if (a != 0 && b != 0) {\n     a++;\n     b++;\n     int m = 0;\n     int n = 0;\n     while (a--) {\n       m = z - a;\n       cout << m << ' ';\n     }\n     while (b > 1) {\n       b--;\n       cout << b << ' ';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long qitaceruts(long long num) {\n   long long n = 0, d, p = 1;\n   while (num > 0) {\n     d = num % 10;\n     num = num / 10;\n     if (d != 0) {\n       n = (d * p) + n;\n       p *= 10;\n     }\n   }\n   return n;\n }\n int main() {\n   long long a, b, c1, c2;\n   cin >> a >> b;\n   c1 = a + b;\n   a = qitaceruts(a);\n   b = qitaceruts(b);\n   c1 = qitaceruts(c1);\n   if (a + b == c1) {\n     cout << 'YES\n';\n   } else {\n     cout << 'NO\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s1, s2;\n int main() {\n   int n, i, j;\n   scanf('%d', &n);\n   cin >> s1 >> s2;\n   int ans = 0;\n   for (i = 0; i < (n / 2); i++) {\n     j = n - i - 1;\n     map<char, int> mp;\n     mp[s1[i]]++;\n     mp[s1[j]]++;\n     mp[s2[i]]++;\n     mp[s2[j]]++;\n     int len = mp.size();\n     if (len == 4)\n       ans += 2;\n     else if (len == 3)\n       ans += 1 + (s1[i] == s1[j]);\n     else if (len == 2)\n       ans += (mp[s1[i]] != 2);\n   }\n   if ((n % 2) && (s1[n / 2] != s2[n / 2])) ans++;\n   printf('%d', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   vector<bool> in(n + 1);\n   for (int i = 0; i < n; i++) {\n     int a;\n     cin >> a;\n     in[a] = true;\n   }\n   vector<int> b(n);\n   for (int i = 0; i < n; i++) {\n     cin >> b[i];\n   }\n   int ind = 0;\n   int next_ = 1;\n   vector<int> c = b;\n   for (; next_ <= n; ind++) {\n     int t = ind - n - 1;\n     if (t >= 0 && t < n) {\n       in[b[ind - n - 1]] = true;\n     }\n     if (c[ind % n] == next_) {\n       next_++;\n       c[ind % n] = -1;\n       continue;\n     }\n     if (c[ind % n] == -1 && in[next_]) {\n       next_++;\n       continue;\n     }\n     c[ind % n] = -1;\n     if (ind - next_ + 1 < n) {\n       next_ = 1;\n     }\n   }\n   cout << ind - n << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n long long L[500005];\n char ch[500005];\n class segtree {\n  public:\n   long long seg[(1 << 19) * 2];\n   long long lazy[(1 << 19) * 2];\n   void lazy_evaluate(int k) {\n     if (k * 2 + 2 >= (1 << 19) * 2) return;\n     lazy[k * 2 + 2] += lazy[k];\n     lazy[k * 2 + 1] += lazy[k];\n     seg[k * 2 + 2] += lazy[k];\n     seg[k * 2 + 1] += lazy[k];\n     lazy[k] = 0;\n   }\n   long long update(int beg, int end, int idx, int lb, int ub, long long num) {\n     if (ub < beg || end < lb) {\n       return seg[idx];\n     }\n     if (beg <= lb && ub <= end) {\n       lazy[idx] += num;\n       seg[idx] += num;\n       return seg[idx];\n     }\n     if (lazy[idx]) {\n       lazy_evaluate(idx);\n     }\n     return seg[idx] =\n                min(update(beg, end, idx * 2 + 1, lb, (lb + ub) / 2, num),\n                    update(beg, end, idx * 2 + 2, (lb + ub) / 2 + 1, ub, num));\n   }\n   long long query(int beg, int end, int idx, int lb, int ub) {\n     if (ub < beg || end < lb) {\n       return 1500000000000000000LL;\n     }\n     if (beg <= lb && ub <= end) {\n       return seg[idx];\n     }\n     if (lazy[idx]) {\n       lazy_evaluate(idx);\n     }\n     return min(query(beg, end, idx * 2 + 1, lb, (lb + ub) / 2),\n                query(beg, end, idx * 2 + 2, (lb + ub) / 2 + 1, ub));\n   }\n } kaede;\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) scanf('%lld', &L[i]);\n   scanf('%s', &ch);\n   long long cur = 0;\n   long long ans = 0;\n   bool ok = 0;\n   for (int i = 0; i < n; i++) {\n     if (ch[i] == 'L')\n       ans += L[i];\n     else if (ch[i] == 'W')\n       ans += L[i] * 3LL;\n     else\n       ans += L[i] * 5LL;\n   }\n   vector<long long> vec;\n   int lasw, lasg;\n   for (int i = 0; i < n; i++) {\n     if (ch[i] == 'G') {\n       cur += L[i];\n       kaede.update(i, i, 0, 0, (1 << 19) - 1, cur);\n       vec.push_back(L[i]);\n       lasg = i;\n       continue;\n     }\n     if (ch[i] == 'W') {\n       cur += L[i];\n       lasw = i;\n       ok = 1;\n       kaede.update(i, i, 0, 0, (1 << 19) - 1, cur);\n       vec.push_back(L[i]);\n       continue;\n     }\n     if (ch[i] == 'L') {\n       if (cur >= L[i]) {\n         cur -= L[i];\n         kaede.update(i, i, 0, 0, (1 << 19) - 1, cur);\n         vec.push_back(L[i]);\n         continue;\n       } else {\n         long long need = L[i] - cur;\n         if (ok) {\n           ans += 3LL * need;\n           vec[lasw] += need;\n         } else {\n           ans += 5LL * need;\n           vec[lasg] += need;\n         }\n         cur = 0;\n         vec.push_back(L[i]);\n         kaede.update(i, i, 0, 0, (1 << 19) - 1, cur);\n         continue;\n       }\n     }\n   }\n   for (int i = n - 1; i >= 0; i--) {\n     if (ch[i] == 'L') continue;\n     if (ch[i] == 'W') continue;\n     long long mn = kaede.query(i, n - 1, 0, 0, (1 << 19) - 1);\n     if (2LL * vec[i] <= mn) {\n       kaede.update(i, n - 1, 0, 0, (1 << 19) - 1, -2LL * vec[i]);\n       ans -= 4LL * vec[i];\n     } else {\n       kaede.update(i, n - 1, 0, 0, (1 << 19) - 1, -mn);\n       ans -= 2LL * mn;\n     }\n   }\n   for (int i = n - 1; i >= 0; i--) {\n     if (ch[i] == 'L') continue;\n     if (ch[i] == 'G') continue;\n     long long mn = kaede.query(i, n - 1, 0, 0, (1 << 19) - 1);\n     if (2LL * vec[i] <= mn) {\n       kaede.update(i, n - 1, 0, 0, (1 << 19) - 1, -2LL * vec[i]);\n       ans -= 2LL * vec[i];\n     } else {\n       kaede.update(i, n - 1, 0, 0, (1 << 19) - 1, -mn);\n       ans -= 1LL * mn;\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MOD = 1e9 + 7;\n const int INF = 0x3f3f3f3f;\n const int MAXN = 3e6 + 3;\n bool appear[MAXN];\n int ans[MAXN];\n signed main() {\n   int cnt = 1;\n   int n, x;\n   scanf('%d%d', &n, &x);\n   int now = 0;\n   appear[0] = true;\n   appear[x] = true;\n   for (int i = 1; i < (1 << n); ++i) {\n     if (appear[i]) continue;\n     appear[i ^ x] = true;\n     ans[cnt++] = i;\n   }\n   printf('%d\n', cnt - 1);\n   for (int i = 1; i < cnt; ++i) printf('%d ', ans[i] ^ ans[i - 1]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native')\n using namespace std;\n void JIZZ(string output = '') {\n   cout << output;\n   exit(0);\n }\n const long double PI = 3.14159265358979323846264338327950288;\n const long double eps = 1e-13;\n const long long mod = 1e9 + 7;\n long long a[200005], pre[200005];\n vector<int> good;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int n;\n   long long k;\n   cin >> n >> k;\n   for (int i = 1; i <= n; ++i) cin >> a[i];\n   for (int i = 1; i <= n; ++i) pre[i] = pre[i - 1] + a[i];\n   for (int i = 1; i <= n; ++i)\n     if (a[i] > 1) good.push_back(i);\n   good.push_back(n + 1);\n   if (0) {\n     long long ans = 0;\n     for (int i = 1; i <= n; ++i) {\n       long long s = 0, p = 1;\n       for (int j = i; j <= n; ++j) {\n         if (((long double)p) * a[j] > 2e18) break;\n         p *= a[j], s += a[j];\n         if (s * k == p) cout << i << ' ' << j << endl, ++ans;\n       }\n     }\n     cout << ans << endl;\n   }\n   long long ans = 0;\n   for (int i = 1; i <= n; ++i) {\n     long long p = a[i], s = a[i];\n     int now = i;\n     auto ptr = upper_bound(good.begin(), good.end(), i);\n     if (s * k <= p && p <= (s + *ptr - now) * k && p % k == 0) ++ans;\n     while (p <= 2e18) {\n       if (*ptr == n + 1) break;\n       if (((long double)p) * a[*ptr] > 2e18) break;\n       p *= a[*ptr];\n       s += pre[*ptr] - pre[now];\n       now = *ptr;\n       ++ptr;\n       if (s * k <= p && p <= (s + *ptr - now - 1) * k && p % k == 0) ++ans;\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long N, Q;\n long long A[1100100], a, b;\n vector<pair<long long, long long> > qu[1100100];\n long long sol[1100100], dp[1100100];\n long long solve(long long I, long long b) {\n   if (I > N) return 0;\n   long long ret = A[I];\n   return ret += solve(I + b, b);\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> N;\n   for (long long I = 1; I <= N; I++) cin >> A[I];\n   cin >> Q;\n   for (long long q = 1; q <= Q; q++) {\n     cin >> a >> b;\n     qu[b].push_back(pair<long long, long long>(a, q));\n   }\n   for (long long b = 1; b <= N; b++) {\n     if (b < 300) {\n       for (long long I = N; I >= 1; I--) {\n         dp[I] = A[I];\n         if (I + b <= N) dp[I] += dp[I + b];\n       }\n       for (typeof((qu[b]).begin()) it = (qu[b]).begin(); it != (qu[b]).end();\n            it++)\n         sol[it->second] = dp[it->first];\n     } else {\n       for (typeof((qu[b]).begin()) it = (qu[b]).begin(); it != (qu[b]).end();\n            it++)\n         sol[it->second] = solve(it->first, b);\n     }\n   }\n   for (long long q = 1; q <= Q; q++) cout << sol[q] << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 100000 + 10;\n int n, m;\n pair<int, int> s[MAX];\n pair<long long, long long> ans;\n void update(long long a, long long b) {\n   if (b <= 0) return;\n   if (a > ans.first) {\n     ans.first = a;\n     ans.second = b;\n   } else if (a == ans.first)\n     ans.second += b;\n }\n void work1() {\n   int i, mi = n, mm = 0;\n   long long num = 0;\n   for ((i) = (1); (i) <= (m); ++(i))\n     if (s[i].first == 0) {\n       ++num;\n       mi = min(mi, s[i].second);\n       mm = max(mm, s[i].second);\n     }\n   long long num_mi = 0, num_mm = 0;\n   for ((i) = (1); (i) <= (m); ++(i)) {\n     if (s[i].first == 0 && s[i].second == mi) ++num_mi;\n     if (s[i].first == 0 && s[i].second == mm) ++num_mm;\n   }\n   if (mm == mi) {\n     update(0, num * (num - 1) * (num - 2) / 6);\n     return;\n   }\n   num -= num_mi;\n   num -= num_mm;\n   update((mm - mi) * 2, (num_mi - 1) * num_mi / 2 * num_mm +\n                             (num_mm - 1) * num_mm / 2 * num_mi +\n                             num * num_mi * num_mm);\n }\n int cmp(pair<int, int> a, pair<int, int> b) {\n   if (a.second != b.second)\n     return a.second < b.second;\n   else\n     return a.first < b.first;\n }\n void work2() {\n   sort(s + 1, s + m + 1, cmp);\n   int i;\n   long long num0 = 0;\n   for ((i) = (1); (i) <= (m); ++(i))\n     if (s[i].first == 0) ++num0;\n   int largb = 0, numb = 0, tmp = num0;\n   for ((i) = (1); (i) <= (m); ++(i))\n     if (s[i].first == 0) {\n       --tmp;\n       if (largb != s[i].second)\n         update(2LL * n + 2 * largb - 2 * s[i].second, (long long)tmp * numb);\n     } else if (s[i].second == largb)\n       ++numb;\n     else if (s[i].second > largb)\n       largb = s[i].second, numb = 1;\n   int smallb = n + 1;\n   numb = 0;\n   tmp = num0;\n   for (i = m; i >= 1; --i)\n     if (s[i].first == 0) {\n       --tmp;\n       if (smallb != s[i].second)\n         update(2LL * n - 2 * smallb + 2 * s[i].second, (long long)tmp * numb);\n     } else if (s[i].second == smallb)\n       ++numb;\n     else if (s[i].second < smallb)\n       smallb = s[i].second, numb = 1;\n   map<int, int> hash;\n   for ((i) = (1); (i) <= (m); ++(i))\n     if (s[i].first == 0) hash[s[i].second]++;\n   tmp = 0;\n   for ((i) = (1); (i) <= (m); ++(i)) {\n     if (s[i].first == 0)\n       ++tmp;\n     else {\n       long long u = hash[s[i].second];\n       long long now = (long long)tmp * (num0 - tmp) +\n                       (long long)u * (u - 1) / 2 + (tmp - u) * u;\n       update(2LL * n, now);\n     }\n   }\n }\n void work() {\n   work1();\n   work2();\n }\n int main() {\n   int i;\n   scanf('%d%d', &n, &m);\n   for ((i) = (1); (i) <= (m); ++(i)) scanf('%d%d', &s[i].first, &s[i].second);\n   work();\n   for ((i) = (1); (i) <= (m); ++(i)) s[i].first ^= 1;\n   work();\n   cout << ans.second << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long t;\n   cin >> t;\n   while (t--) {\n     long long n;\n     cin >> n;\n     if (n == 1)\n       cout << 1 << endl;\n     else\n       cout << (n / 2) << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int Maxn = ((int)1e5) + 100;\n int arr[Maxn], n;\n map<int, int> 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 <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\n using namespace std;\n const int maxn = 100007;\n const int maxv = 100000;\n long long fac[maxn], fac2[maxn];\n map<pair<int, int>, 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<int, int>(f, n))) return save[pair<int, int>(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<int, int>(f, n)] =\n       (C(n - 1, f - 1) - res + 1000000007) % 1000000007;\n   return save[pair<int, int>(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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n int n, m;\n int map[1010][1010];\n int strpnt[1001000][2];\n int q[1001000][2];\n int qs, qe;\n int stn;\n int ans;\n int gcd(int x, int y) {\n   if (y == 0) return x;\n   return gcd(y, x % y);\n }\n int main() {\n   int i, j, k, l, t;\n   scanf('%d%d', &n, &m);\n   for (i = 0; i < n; i++) {\n     for (j = 0; j < m; j++) {\n       scanf('%d', &map[i + 1][j + 1]);\n     }\n   }\n   n += 2;\n   m += 2;\n   k = 0;\n   for (i = 0; i < n; i++) {\n     for (j = 0; j < m; j++) {\n       if (map[i + 1][j + 1] == 1) {\n         t = 0;\n         t += map[i][j + 1];\n         t += map[i + 1][j];\n         t += map[i + 1][j + 2];\n         t += map[i + 2][j + 1];\n         if (t == 1 || t == 3) {\n           k++;\n         }\n         if (t == 0) {\n           printf('-1');\n           return 0;\n         }\n       }\n     }\n   }\n   if (k != 0 && k != 2) {\n     printf('-1');\n     return 0;\n   }\n   for (i = 0; i < n; i++) {\n     for (j = 0; j < m; j++) {\n       if (map[i + 1][j + 1] == 1) {\n         t = 0;\n         t += map[i][j + 1];\n         t += map[i + 1][j];\n         t += map[i + 1][j + 2];\n         t += map[i + 2][j + 1];\n         if (t != 2 || (!(((map[i][j + 1] == 1 && map[i + 2][j + 1] == 1) ||\n                           (map[i + 1][j] == 1 && map[i + 1][j + 2] == 1))))) {\n           strpnt[stn][0] = i;\n           strpnt[stn][1] = j;\n           stn++;\n         }\n       }\n     }\n   }\n   if (stn < 2) {\n     printf('-1');\n     return 0;\n   }\n   for (i = 1; i < stn; i++) {\n     strpnt[i][0] -= strpnt[0][0];\n     if (strpnt[i][0] < 0) strpnt[i][0] = -strpnt[i][0];\n     strpnt[i][1] -= strpnt[0][1];\n     if (strpnt[i][1] < 0) strpnt[i][1] = -strpnt[i][1];\n     ans = gcd(strpnt[i][0], ans);\n     ans = gcd(strpnt[i][1], ans);\n   }\n   if (ans < 2) {\n     printf('-1');\n     return 0;\n   }\n   t = 0;\n   for (i = 0; i < n; i++) {\n     for (j = 0; j < m; j++) {\n       if (map[i][j] == 1) {\n         t = 1;\n         break;\n       }\n     }\n     if (t == 1) break;\n   }\n   qe = 1;\n   q[0][0] = i;\n   q[0][1] = j;\n   map[i][j] = 0;\n   for (qs = 0; qs < qe; qs++) {\n     if (map[q[qs][0] + 1][q[qs][1]] == 1) {\n       map[q[qs][0] + 1][q[qs][1]] = 0;\n       q[qe][0] = q[qs][0] + 1;\n       q[qe][1] = q[qs][1];\n       qe++;\n     }\n     if (map[q[qs][0] - 1][q[qs][1]] == 1) {\n       map[q[qs][0] - 1][q[qs][1]] = 0;\n       q[qe][0] = q[qs][0] - 1;\n       q[qe][1] = q[qs][1];\n       qe++;\n     }\n     if (map[q[qs][0]][q[qs][1] + 1] == 1) {\n       map[q[qs][0]][q[qs][1] + 1] = 0;\n       q[qe][0] = q[qs][0];\n       q[qe][1] = q[qs][1] + 1;\n       qe++;\n     }\n     if (map[q[qs][0]][q[qs][1] - 1] == 1) {\n       map[q[qs][0]][q[qs][1] - 1] = 0;\n       q[qe][0] = q[qs][0];\n       q[qe][1] = q[qs][1] - 1;\n       qe++;\n     }\n   }\n   for (i = 0; i < n; i++) {\n     for (j = 0; j < m; j++) {\n       if (map[i][j] == 1) {\n         printf('-1');\n         return 0;\n       }\n     }\n   }\n   for (i = 2; i <= ans; i++) {\n     if (ans % i == 0) printf('%d ', i);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long in() {\n   int32_t x;\n   scanf('%d', &x);\n   return x;\n }\n inline string getStr() {\n   char ch[1000000];\n   scanf('%s', ch);\n   return ch;\n }\n const long long MOD = 1e9 + 7;\n const long long base = 29;\n const long long MAX_N = 3e5 + 1;\n inline long long divide(long long a, long long b) { return (a + b - 1) / b; }\n vector<long long> g[MAX_N];\n long long deg[MAX_N];\n bool vis[MAX_N];\n long long res[MAX_N];\n inline void dfs(long long node, long long part) {\n   if (vis[node] == true) return;\n   res[node] = part;\n   long long cnt = 0;\n   for (long long i = 0; i < g[node].size(); i++) {\n     long long u = g[node][i];\n     if (res[node] == res[u]) cnt++;\n   }\n   if (cnt > 1) {\n     res[node] ^= 1;\n     dfs(node, res[node]);\n     vis[node] = false;\n     return;\n   }\n   vis[node] = true;\n   for (long long pt = 0; pt < g[node].size(); pt++) {\n     long long u = g[node][pt];\n     if (res[u] == res[node]) {\n       dfs(u, res[u]);\n       vis[node] = 0;\n       return;\n     }\n   }\n   vis[node] = false;\n }\n int32_t main() {\n   long long n = in(), m = in();\n   for (long long i = 0; i < m; i++) {\n     long long v = in(), u = in();\n     deg[v]++, deg[u]++;\n     g[v].push_back(u);\n     g[u].push_back(v);\n   }\n   for (long long i = 1; i <= n; i++) res[i] = 1;\n   for (long long i = 1; i <= n; i++) {\n     dfs(i, res[i]);\n   }\n   for (long long i = 1; i <= n; i++) cout << res[i];\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   string s;\n   cin >> s;\n   int res = 0;\n   for (int i = 0; i < n; i++) {\n     res++;\n     if (i == n - 1) break;\n     if (s[i] != s[i + 1]) {\n       i++;\n     }\n   }\n   cout << res << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, x, y, z, x_, y_, z_;\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> x_ >> y_ >> z_;\n     x += x_;\n     z += z_;\n     y += y_;\n   }\n   if (x != 0 || y != 0 || z != 0)\n     cout << 'NO' << endl;\n   else\n     cout << 'YES' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct IInt {\n   int z;\n };\n bool cmp(int a, int b) { return a < b; }\n bool operator<(IInt a, IInt b) { return a.z > b.z; }\n int main() {\n   int n, m, x, i, ans, ans1;\n   IInt t;\n   scanf('%d%d', &n, &m);\n   vector<int> q;\n   priority_queue<IInt> w;\n   for (i = 0; i < m; i++) {\n     scanf('%d', &x);\n     q.push_back(x);\n     t.z = x;\n     w.push(t);\n   }\n   make_heap(q.begin(), q.end(), cmp);\n   ans = ans1 = 0;\n   for (i = 0; i < n; i++) {\n     ans += q[0];\n     q[0]--;\n     make_heap(q.begin(), q.end(), cmp);\n   }\n   for (i = 0; i < n; i++) {\n     t = w.top();\n     w.pop();\n     ans1 += t.z;\n     if (t.z == 1) {\n       continue;\n     } else {\n       t.z--;\n       w.push(t);\n     }\n   }\n   printf('%d %d\n', ans, ans1);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2005, M = 2000010;\n const long long MOD = 1E9 + 7;\n long long Pow(long long a, long long b) {\n   long long c = 1;\n   for (; b; a = a * a % MOD, b >>= 1)\n     if (b & 1) c = c * a % MOD;\n   return c;\n }\n struct Node {\n   int x, y;\n   bool operator<(const Node &a) const {\n     return (x != a.x) ? (x < a.x) : (y < a.y);\n   }\n } p[N];\n int h, w, n, m;\n long long fac[M], fac_inv[M];\n long long f[N];\n void Init() {\n   fac[0] = 1;\n   for (int i = 1; i <= m; ++i) fac[i] = fac[i - 1] * i % MOD;\n   fac_inv[m] = Pow(fac[m], MOD - 2);\n   for (int i = m; i; --i) fac_inv[i - 1] = fac_inv[i] * i % MOD;\n   return;\n }\n inline long long F(int a, int b) {\n   return fac[a + b] * fac_inv[a] % MOD * fac_inv[b] % MOD;\n }\n int main() {\n   scanf('%d%d%d', &h, &w, &n);\n   m = h + w;\n   Init();\n   for (int i = 1; i <= n; ++i) scanf('%d%d', &p[i].x, &p[i].y);\n   sort(p + 1, p + n + 1);\n   for (int i = 1; i <= n; ++i) {\n     f[i] = F(p[i].x - 1, p[i].y - 1);\n     for (int j = 1; j < i; ++j)\n       if (p[j].y <= p[i].y)\n         f[i] = (f[i] + MOD - f[j] * F(p[i].x - p[j].x, p[i].y - p[j].y) % MOD) %\n                MOD;\n   }\n   long long res = F(h - 1, w - 1);\n   for (int i = 1; i <= n; ++i)\n     res = (res + MOD - f[i] * F(h - p[i].x, w - p[i].y) % MOD) % MOD;\n   printf('%lld\n', res);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1000000000;\n const int MOD = 1000000007;\n signed main() {\n   cin.tie(0), cout.tie(0);\n   ios::sync_with_stdio(0);\n   int n, k;\n   cin >> n >> k;\n   int a, b, c, d;\n   cin >> a >> b >> c >> d;\n   if (k < n + 1 || n <= 4)\n     cout << -1 << '\n', exit(0);\n   else {\n     cout << a << ' ' << c << ' ';\n     for (int i = 1; i <= n; i++)\n       if (i != a && i != b && i != c && i != d) cout << i << ' ';\n     cout << d << ' ' << b << '\n';\n     cout << c << ' ' << a << ' ';\n     for (int i = 1; i <= n; i++)\n       if (i != a && i != b && i != c && i != d) cout << i << ' ';\n     cout << b << ' ' << d << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int h1, a1, c1, h2, a2;\n   int move_counter = 0;\n   vector<char> move;\n   cin >> h1 >> a1 >> c1 >> h2 >> a2;\n   while (h2 > 0) {\n     if (h2 - a1 <= 0) {\n       move.push_back('S');\n       ++move_counter;\n       break;\n     } else {\n       if (h1 - a2 <= 0) {\n         h1 += c1;\n         move.push_back('H');\n         ++move_counter;\n       } else {\n         h2 -= a1;\n         move.push_back('S');\n         ++move_counter;\n       }\n       h1 -= a2;\n     }\n   }\n   cout << move_counter << '\n';\n   for (const auto it : move) {\n     if (it == 'H')\n       cout << 'HEAL' << '\n';\n     else\n       cout << 'STRIKE' << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, k, x[1010], dp[1010][1010], sm[1010];\n long long solve(long long gap) {\n   dp[0][0] = 1, x[0] = -200000;\n   for (long long i = 1; i <= k; ++i) {\n     for (long long j = 0; j <= n; ++j)\n       sm[j] = j == 0 ? dp[i - 1][j] : (dp[i - 1][j] + sm[j - 1]) % 998244353;\n     long long pos = 0;\n     for (long long j = 1; j <= n; ++j) {\n       while (x[j] - x[pos + 1] >= gap) pos++;\n       dp[i][j] = sm[pos];\n     }\n   }\n   long long sum = 0;\n   for (long long i = 1; i <= n; ++i) sum = (sum + dp[k][i]) % 998244353;\n   return sum;\n }\n int32_t main() {\n   cin.tie(0), cout.sync_with_stdio(0);\n   cin >> n >> k;\n   for (long long i = 1; i <= n; ++i) cin >> x[i];\n   sort(x + 1, x + 1 + n);\n   long long dis = 100000 / (k - 1), pre = solve(1), ans = 0;\n   for (long long i = 2; i <= dis + 5; ++i) {\n     long long now = solve(i);\n     ans = (ans + (pre - now + 998244353) * (i - 1)) % 998244353;\n     pre = now;\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int arr[1000];\n   int num;\n   cin >> num;\n   for (int i = 0; i < num; i++) {\n     cin >> arr[i];\n     arr[num + i] = arr[i];\n   }\n   int ans = 360;\n   for (int i = 0; i < num; i++) {\n     int temp = 0;\n     for (int j = i; j < num * 2; j++) {\n       temp += arr[j];\n       ans = min(ans, abs(360 - 2 * temp));\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a, b;\n char s[1000005];\n int arr[205];\n int main() {\n   scanf('%d%d%d%s', &n, &a, &b, s);\n   int i, j, len = strlen(s), tag;\n   if (len > n * b || len < n * a) {\n     puts('No solution');\n     return 0;\n   }\n   int eve = len / n;\n   for (i = 0; i < n; i++) {\n     arr[i] = eve;\n   }\n   eve = len % n;\n   for (i = 0; i < eve; i++) arr[i]++;\n   for (i = tag = 0; i < n; i++) {\n     for (j = 0; j < arr[i]; j++) printf('%c', s[tag++]);\n     puts('');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   char instr[51], outstr[51] = {}, ch;\n   int n, i;\n   cin >> instr;\n   cin >> n;\n   for (i = 0; i < strlen(instr); i++) {\n     if (instr[i] < 97) instr[i] += 32;\n   }\n   for (i = 0; i < strlen(instr); i++) {\n     ch = instr[i];\n     if (int(ch) < (n + 97)) {\n       outstr[i] = ch - 32;\n     } else {\n       outstr[i] = ch;\n     }\n   }\n   cout << outstr;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   int N, M;\n   cin >> N >> M;\n   vector<int> arr(N + 2);\n   arr[0] = 1;\n   for (int i = 0; i < N; ++i) cin >> arr[i + 1];\n   arr[N + 1] = 1;\n   int q = M, w = M;\n   int r = 0;\n   while (q > 0 || w < N + 1) {\n     int s = arr[q] + arr[w];\n     if (s == 2) r += s - (q == 0) - (w == N + 1) - (w == q);\n     if (q > 0) q--;\n     if (w < N + 1) w++;\n   }\n   cout << r << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long a, b, c, d = 0, e = 0, f = 0, g = 0, i, j, k = 1, l = 1, r = 1,\n                      n[300001], m[300001], q, u, v, w, y, z[400001], h[400001],\n                      p[500001];\n   string s, t, x;\n   cin >> a >> b >> c;\n   for (i = 1; i <= a; i++) {\n     cin >> d >> e;\n     f += (d - g) / c;\n     g = d + e;\n   }\n   cout << f + ((b - g) / c);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int d[300002];\n int safe[300002];\n bool solve() {\n   long long int n, k, l, i;\n   cin >> n >> k >> l;\n   for (i = 1; i <= n; i++) cin >> d[i];\n   int tide, dir, mtide;\n   tide = k;\n   dir = -1;\n   for (i = 1; i <= n; i++) {\n     if (d[i] + k <= l)\n       tide = k, dir = -1;\n     else if (d[i] > l)\n       return false;\n     else {\n       mtide = l - d[i];\n       if (tide + dir <= mtide) {\n         tide += dir;\n         if (tide == 0) dir = 1;\n       } else if (dir == -1 && mtide < tide - 1) {\n         tide = mtide;\n         if (tide == 0) dir = 1;\n       } else\n         return false;\n     }\n   }\n   return true;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int t, i;\n   cin >> t;\n   while (t--) {\n     if (solve())\n       cout << 'Yes\n';\n     else\n       cout << 'No\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<long long int, long long int> 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 <bits/stdc++.h>\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<char> 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<string> 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 <bits/stdc++.h>\n using namespace std;\n template <class T>\n T min(T a, T b, T c) {\n   return min(a, min(b, c));\n }\n template <class T>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long> 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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   string res = '';\n   cin >> n;\n   int arr[2004] = {0};\n   for (int i = 0; i < n; ++i) {\n     cin >> arr[i];\n   }\n   int now_rejt = 0;\n   int mesto = 1;\n   for (int i = 0; i < n; ++i) {\n     now_rejt = arr[i];\n     mesto = 1;\n     for (int j = 0; j < n; ++j) {\n       if (now_rejt < arr[j]) {\n         ++mesto;\n       }\n     }\n     stringstream ss;\n     ss << mesto;\n     string strmesto;\n     ss >> strmesto;\n     res = res + ' ' + strmesto;\n   }\n   res.erase(0, 1);\n   cout << res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<int, map<int, vector<int>>> answers;\n int main() {\n   int t;\n   cin >> t;\n   for (int i = 0; i < t; i++) {\n     int bus, tram, money;\n     cin >> bus >> tram >> money;\n     string s;\n     cin >> s;\n     int cur = s.size() - 2;\n     while (true) {\n       char cur_char = s[cur];\n       if (cur_char == 'A') {\n         if (bus > money) {\n           cout << cur + 2 << '\n';\n           break;\n         }\n         money -= bus;\n       }\n       if (cur_char == 'B') {\n         if (tram > money) {\n           cout << cur + 2 << '\n';\n           break;\n         }\n         money -= tram;\n       }\n       while (cur >= 0 && s[cur] == cur_char) {\n         cur -= 1;\n       }\n       if (cur == -1) {\n         cout << 1 << '\n';\n         break;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int GCD(int x, int y) { return !y ? x : GCD(y, x % y); }\n int LCM(int x, int y) { return x * y / GCD(x, y); }\n long long ceilDivision(long long dividend, long long divisor) {\n   return (dividend + divisor - 1) / divisor;\n }\n bool check(pair<long long, int> right, pair<long long, int> left) {\n   return ((left.second > right.second) ||\n           (left.second == right.second && left.first > right.first));\n }\n int main() {\n   long long r, avg, sum = 0, target, counter = 0;\n   int n, pointer = 0;\n   cin >> n >> r >> avg;\n   vector<pair<long long, int> > arr(n);\n   target = avg * n;\n   for (int i = 0; i < n; i++)\n     cin >> arr[i].first >> arr[i].second, sum += arr[i].first;\n   if (sum < target) {\n     sort(arr.begin(), arr.end(), check);\n     target -= sum;\n     while (target) {\n       if (arr[pointer].first < r)\n         counter += (min(target, r - arr[pointer].first) * arr[pointer].second),\n             target -= min(target, r - arr[pointer].first);\n       pointer++;\n     }\n   }\n   cout << counter << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<vector<int>> dir_graph;\n vector<int> vis, order;\n void dfs(int i) {\n   vis[i] = true;\n   for (int j = 0; j < dir_graph[i].size(); j++) {\n     if (!vis[dir_graph[i][j]]) {\n       dfs(dir_graph[i][j]);\n     }\n   }\n   order.push_back(i);\n }\n int main() {\n   int cases;\n   cin >> cases;\n   while (cases--) {\n     int n, m;\n     cin >> n >> m;\n     dir_graph = vector<vector<int>>(n);\n     order.clear();\n     vis = vector<int>(n);\n     vector<pair<int, int>> edges;\n     int type, s, d;\n     for (int i = 0; i < m; i++) {\n       cin >> type >> s >> d;\n       s--;\n       d--;\n       if (type == 1) dir_graph[s].push_back(d);\n       edges.push_back({s, d});\n     }\n     for (int i = 0; i < n; i++) {\n       if (!vis[i]) {\n         dfs(i);\n       }\n     }\n     vector<int> pos(n);\n     reverse(order.begin(), order.end());\n     for (int i = 0; i < n; ++i) {\n       pos[order[i]] = i;\n     }\n     bool hasCycle = false;\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < dir_graph[i].size(); j++) {\n         if (pos[i] > pos[dir_graph[i][j]]) {\n           hasCycle = true;\n           break;\n         }\n       }\n     }\n     if (hasCycle)\n       cout << 'NO' << endl;\n     else {\n       cout << 'YES\n';\n       for (int i = 0; i < edges.size(); i++) {\n         if (pos[edges[i].first] < pos[edges[i].second]) {\n           cout << edges[i].first + 1 << ' ' << edges[i].second + 1 << endl;\n         } else {\n           cout << edges[i].second + 1 << ' ' << edges[i].first + 1 << endl;\n         }\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   char ch[] = {'B', 'u', 'l', 'b', 'a', 's', 'a', 'u', 'r'};\n   map<char, int> mp;\n   string ss;\n   int n, k, i, cnt = 100000;\n   cin >> ss;\n   for (i = 0; i < ss.size(); i++) {\n     mp[ss[i]]++;\n   }\n   for (i = 0; i < 9; i++) {\n     k = mp[ch[i]];\n     if (ch[i] == 'u' || ch[i] == 'a') k = k / 2;\n     cnt = min(cnt, k);\n   }\n   cout << cnt << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, k;\n   cin >> n;\n   if (n % 2 == 0)\n     printf('-1\n');\n   else {\n     for (k = 0; k < n; k++) printf('%d ', ((n / 2 + 1 - k) + n) % n);\n     cout << endl;\n     for (k = 0; k < n; k++) printf('%d ', ((n / 2 + 2 * k) + n) % n);\n     cout << endl;\n     for (k = 0; k < n; k++) printf('%d ', k);\n   }\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n int n;\n int arr1[10];\n int arr2[100005];\n pair<int, int> diffs[600005];\n int cnts[100005];\n int main() {\n   while (scanf('%d', arr1) == 1) {\n     for (int i = 1; i < 6; ++i) {\n       scanf('%d', arr1 + i);\n     }\n     scanf('%d', &n);\n     for (int i = 0; i < n; ++i) {\n       scanf('%d', arr2 + i);\n     }\n     int idx = 0;\n     for (int i = 0; i < 6; ++i) {\n       for (int j = 0; j < n; ++j) {\n         diffs[idx].first = arr2[j] - arr1[i];\n         diffs[idx].second = j;\n         ++idx;\n       }\n     }\n     sort(diffs, diffs + idx);\n     memset(cnts, 0, sizeof(cnts));\n     int cnt = 0;\n     int j = 0;\n     int ans = INF;\n     for (int i = 0; i < 5 * n; ++i) {\n       if (i && --cnts[diffs[i - 1].second] <= 0) {\n         --cnt;\n       }\n       while (cnt < n && j < 6 * n) {\n         if (cnts[diffs[j].second]++ == 0) {\n           ++cnt;\n         }\n         ++j;\n       }\n       if (cnt >= n) {\n         ans = min(ans, diffs[j - 1].first - diffs[i].first);\n       }\n     }\n     printf('%d\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   char a;\n   cin >> a;\n   string str1, str2;\n   cin >> str1 >> str2;\n   int b1, b2;\n   switch (str1[0]) {\n     case 'T':\n       b1 = 10;\n       break;\n     case 'J':\n       b1 = 11;\n       break;\n     case 'Q':\n       b1 = 12;\n       break;\n     case 'K':\n       b1 = 13;\n       break;\n     case 'A':\n       b1 = 14;\n       break;\n     default:\n       b1 = str1[0] - '0';\n   }\n   switch (str2[0]) {\n     case 'T':\n       b2 = 10;\n       break;\n     case 'J':\n       b2 = 11;\n       break;\n     case 'Q':\n       b2 = 12;\n       break;\n     case 'K':\n       b2 = 13;\n       break;\n     case 'A':\n       b2 = 14;\n       break;\n     default:\n       b2 = str2[0] - '0';\n   }\n   if (str1[1] == a)\n     if (str2[1] != str1[1]) {\n       cout << 'YES';\n     } else {\n       if (b1 > b2) {\n         cout << 'YES';\n       } else\n         cout << 'NO';\n     }\n   else {\n     if (str2[1] == str1[1]) {\n       if (b1 > b2) {\n         cout << 'YES';\n       } else\n         cout << 'NO';\n     } else {\n       cout << 'NO';\n     };\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 5001;\n int n, m, x, y, c[N], p[N], A;\n int main() {\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++) p[i] = N;\n   while (m-- && cin >> x >> y) c[x]++, p[x] = min(p[x], (y + n - x) % n);\n   for (int i = 1; i <= n; i++) {\n     A = 0;\n     for (int j = 1; j <= n; j++)\n       if (c[j]) A = max(A, (j + n - i) % n + (c[j] - 1) * n + p[j]);\n     cout << A << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 50;\n int n, q;\n int lca[N][25], mark[N], sum[N], h[N], a[N][4];\n vector<int> adj[N];\n map<int, map<int, int> > m;\n void DFS(int v, int p, int hi) {\n   h[v] = hi;\n   lca[v][0] = p;\n   for (auto u : adj[v]) {\n     if (u == p) continue;\n     DFS(u, v, hi + 1);\n   }\n }\n void dfs_sum(int v, int p) {\n   sum[v] += mark[v];\n   for (auto u : adj[v]) {\n     if (u == p) continue;\n     dfs_sum(u, v);\n     sum[v] += sum[u];\n   }\n   m[p][v] = sum[v];\n }\n void LCA() {\n   for (int j = 1; j <= 20; j++)\n     for (int i = 1; i <= n; i++) lca[i][j] = lca[lca[i][j - 1]][j - 1];\n }\n int find_par(int v, int k) {\n   for (int j = 0; j <= 20; j++) {\n     if (k & (1 << j)) v = lca[v][j];\n   }\n   return v;\n }\n int find_lca(int u, int v) {\n   v = find_par(v, h[v] - h[u]);\n   if (v == u) return u;\n   for (int j = 20; j >= 0; j--) {\n     if (lca[u][j] != lca[v][j]) {\n       u = lca[u][j];\n       v = lca[v][j];\n     }\n   }\n   return lca[u][0];\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie();\n   cin >> n;\n   for (int i = 1; i < n; i++) {\n     cin >> a[i][0] >> a[i][1];\n     adj[a[i][0]].push_back(a[i][1]);\n     adj[a[i][1]].push_back(a[i][0]);\n   }\n   DFS(n - 1, 0, 1);\n   LCA();\n   cin >> q;\n   for (int i = 0; i < q; i++) {\n     int u, v;\n     cin >> u >> v;\n     if (h[u] > h[v]) swap(u, v);\n     int lca = find_lca(u, v);\n     mark[u]++;\n     mark[v]++;\n     mark[lca] -= 2;\n   }\n   dfs_sum(n - 1, 0);\n   for (int i = 1; i < n; i++) {\n     cout << max(m[a[i][0]][a[i][1]], m[a[i][1]][a[i][0]]) << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1e9 + 7;\n const long long maxn = 1e5 + 5;\n void solve() {\n   long long k;\n   cin >> k;\n   long long first = pow(2, 17);\n   cout << 2 << ' ' << 3 << '\n';\n   cout << first + k << ' ' << first << ' ' << 0 << '\n'\n        << k << ' ' << first + k << ' ' << k;\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long tc = 1;\n   while (tc--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 6;\n int n, m, k;\n int s[N], c[N];\n bool vis[N];\n int fir[N];\n long long ans = 1e15;\n void can(int u) {\n   long long rep = 0;\n   for (int i = 1; i <= n;) {\n     if (fir[i + u] == i) {\n       return;\n     }\n     rep += c[u];\n     if (i + u > n) {\n       break;\n     }\n     i = fir[i + u];\n   }\n   ans = min(ans, rep);\n }\n int main() {\n   scanf('%d%d%d', &n, &m, &k);\n   for (int i = 1; i <= m; i++) {\n     scanf('%d', &s[i]);\n     vis[s[i] + 1] = 1;\n   }\n   for (int i = 1; i <= k; i++) {\n     scanf('%d', &c[i]);\n   }\n   for (int i = 1; i <= n; i++) {\n     if (vis[i]) {\n       fir[i] = fir[i - 1];\n     } else {\n       fir[i] = i;\n     }\n   }\n   if (!fir[1]) {\n     printf('-1\n');\n     return 0;\n   }\n   for (int i = 1; i <= k; i++) {\n     can(i);\n   }\n   if (ans == 1e15) {\n     printf('-1\n');\n   } else {\n     printf('%lld\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int where[26][26];\n int n, dp[(1 << 23) + 5], d[35];\n bool fdp[(1 << 23) + 5];\n int rec(int mask) {\n   if (fdp[mask]) return dp[mask];\n   int next = 0;\n   for (int i = n - 1; i >= 0; --i) {\n     if (mask & (1 << i)) {\n       next = i;\n       break;\n     }\n   }\n   next++;\n   fdp[mask] = 1;\n   if (next == n) return dp[mask] = __builtin_popcount(mask);\n   int make = d[next + 1];\n   dp[mask] = 30;\n   int valid = 0;\n   for (int i = 0; i < n; ++i) {\n     if (mask & (1 << i)) {\n       int j = where[next + 1][i + 1];\n       if (d[i + 1] < make and j) {\n         j--;\n         if (mask & (1 << j)) valid = 1;\n       }\n     }\n   }\n   if (valid) {\n     dp[mask] = rec(mask | (1 << next));\n     for (int i = 0; i < next; ++i) {\n       if (mask & (1 << i))\n         dp[mask] = min(dp[mask], rec((mask ^ (1 << i)) | (1 << next)));\n     }\n   }\n   return dp[mask];\n }\n int main() {\n   cin >> n;\n   for (int i = 1; i <= n; ++i) {\n     cin >> d[i];\n   }\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= n; ++j) {\n       int f = d[i] - d[j];\n       for (int k = 1; k <= n; ++k) {\n         if (d[k] == f) {\n           where[i][j] = k;\n         }\n       }\n     }\n   }\n   int ans = rec(1);\n   if (ans == 30) ans = -1;\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<int, int> wow;\n long long shob[104];\n vector<int> 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 <bits/stdc++.h>\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<char, int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   long long h[100000], ans[100000];\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> h[i];\n   ans[n - 1] = 0;\n   for (int i = n - 2; i >= 0; i--) {\n     if (h[i] <= h[i + 1])\n       ans[i] = h[i + 1] - h[i] + 1;\n     else\n       ans[i] = 0;\n     h[i] = max(h[i], h[i + 1]);\n   }\n   for (int i = 0; i < n; i++) cout << ans[i] << ' ';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int inp() {\n   char c = getchar();\n   while (c < '0' || c > '9') c = getchar();\n   int sum = 0;\n   while (c >= '0' && c <= '9') {\n     sum = sum * 10 + c - '0';\n     c = getchar();\n   }\n   return sum;\n }\n int root[1000010];\n struct President_Tree {\n   int lc[10000000], rc[10000000];\n   long long k[10000000], b[10000000];\n   int cnt;\n   void push_up(int cur) {\n     k[cur] = k[lc[cur]] + k[rc[cur]];\n     b[cur] = b[lc[cur]] + b[rc[cur]];\n   }\n   void insert(int &cur, int last, int x, int kc, int bc, int l, int r) {\n     cur = ++cnt;\n     if (l == r) {\n       k[cur] = k[last] + kc;\n       b[cur] = b[last] + bc;\n       return;\n     }\n     int mid = (l + r) >> 1;\n     if (x <= mid) {\n       insert(lc[cur], lc[last], x, kc, bc, l, mid);\n       rc[cur] = rc[last];\n     } else {\n       lc[cur] = lc[last];\n       insert(rc[cur], rc[last], x, kc, bc, mid + 1, r);\n     }\n     push_up(cur);\n   }\n   long long query(int cur, int last, int ql, int qr, long long x, int l,\n                   int r) {\n     if (l > qr || r < ql) return 0;\n     if (l >= ql && r <= qr) return x * (k[cur] - k[last]) + (b[cur] - b[last]);\n     int mid = (l + r) >> 1;\n     return query(lc[cur], lc[last], ql, qr, x, l, mid) +\n            query(rc[cur], rc[last], ql, qr, x, mid + 1, r);\n   }\n } t;\n int main() {\n   int n = inp();\n   for (int i = 1; i <= n; i++) {\n     int xl = inp();\n     int xr = inp();\n     int yl = inp();\n     int k = inp();\n     int b = inp();\n     int yr = inp();\n     t.insert(root[i], root[i - 1], 0, 0, yl, 0, 1e9);\n     t.insert(root[i], root[i], xl + 1, k, b - yl, 0, 1e9);\n     t.insert(root[i], root[i], xr + 1, -k, yr - b, 0, 1e9);\n   }\n   int m = inp();\n   long long lastans = 0;\n   while (m--) {\n     int l = inp();\n     int r = inp();\n     int x = (inp() + lastans) % 1000000000;\n     lastans = t.query(root[r], root[l - 1], 0, x, x, 0, 1e9);\n     printf('%lld\n', lastans);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int a, int b) {\n   while (b) {\n     int temp = b;\n     b = a % b;\n     a = temp;\n   }\n   return a;\n }\n int main() {\n   int a, b, n, counting = 0, GCD;\n   scanf('%d %d %d', &a, &b, &n);\n   while (1) {\n     counting++;\n     GCD = gcd(a, n);\n     if (n < GCD) break;\n     n = n - GCD;\n     counting++;\n     GCD = gcd(b, n);\n     if (n < GCD) break;\n     n = n - GCD;\n   }\n   printf('%d\n', counting % 2);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long date(int y, int m, int d) {\n   if (m < 3) y--, m += 12;\n   return (long long)365 * y + y / 4 - y / 100 + y / 400 + (153 * m - 457) / 5 +\n          d - 306;\n }\n int main() {\n   int y1, y2, m1, m2, d1, d2;\n   scanf('%d:%d:%d', &y1, &m1, &d1);\n   scanf('%d:%d:%d', &y2, &m2, &d2);\n   printf('%lld\n', llabs(date(y1, m1, d1) - date(y2, m2, d2)));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n mt19937 Rand(time(0));\n long long rnd(long long a) { return Rand() % a; }\n long long rnd(long long a, long long b) { return Rand() % (b - a + 1) + a; }\n double rnd_01d() { return (double)Rand() / (1ll << 32); }\n double rnd_d(double r) { return rnd_01d() * r; }\n const long long inf = 1e9 + 7;\n void run() {\n   long long n;\n   cin >> n;\n   vector<long long> h(n);\n   for (long long i = 0; i < n; ++i) cin >> h[i];\n   long long l = -1, r = 1e9 + 3;\n   while (r - l > 1) {\n     long long mid = (l + r) / 2;\n     vector<long long> b;\n     copy(begin(h), end(h), back_inserter(b));\n     bool bad = false;\n     for (long long i = n - 1; i >= 2; --i) {\n       if (b[i] < mid) bad = true;\n       long long d = min(b[i] - mid, h[i]) / 3;\n       b[i - 1] += d;\n       b[i - 2] += 2 * d;\n     }\n     if (b[1] < mid || b[0] < mid || bad)\n       r = mid;\n     else\n       l = mid;\n   }\n   cout << l << endl;\n }\n signed main() {\n   cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0);\n   cout.precision(5);\n   long long t = 1;\n   cin >> t;\n   while (t--) {\n     run();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int minimum(int x, int y) { return (x < y ? x : y); }\n template <typename type>\n struct even {\n   bool operator()(const type &x, const type &y) const { return x % 2 == 0; }\n };\n template <typename type>\n struct odd {\n   bool operator()(const type &x, const type &y) const { return x % 2 != 0; }\n };\n bool flusher(int x) {\n   string s;\n   cout << x << endl;\n   fflush(stdout);\n   cin >> s;\n   return s == 'yes';\n }\n long long int magic(string s) {\n   long long int sum = 0;\n   for (int i = 0; i < s.size(); i++) {\n     sum += s[i] - '0';\n   }\n   return sum;\n }\n long long int binaryToInt(string s) {\n   long long int n = s.length();\n   long long int res = 0;\n   long long int base = 1;\n   for (long long int i = n - 1; i >= 0; i--) {\n     if (s[i] == '1') {\n       res += base;\n     }\n     base *= 2;\n   }\n   return res;\n }\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   int n, k;\n   cin >> n >> k;\n   int length = n * 2 + 1;\n   int res = 0;\n   int x[length];\n   for (int i = 0; i < length; i++) {\n     cin >> x[i];\n   }\n   for (int i = 1; i < length; i += 2) {\n     if (x[i] - 1 > x[i - 1] && x[i] - 1 > x[i + 1]) {\n       x[i]--;\n       res++;\n     }\n     if (res == k) {\n       break;\n     }\n   }\n   for (int i = 0; i < length; i++) {\n     cout << x[i] << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   cout << (n * 3) / 2 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 50;\n long long kol, sum, id, ans;\n string s;\n vector<long long> a;\n int main() {\n   cin >> s;\n   ans = 0;\n   sum = 0;\n   for (int i = 0; i < s.size(); i++) {\n     if (s[i] == 'v') {\n       id += 1;\n       if (i == s.size() - 1) {\n         sum += id - 1;\n       }\n     } else {\n       if (id != 0) {\n         sum += id - 1;\n         id = 0;\n       }\n       a.push_back(sum);\n       kol += 1;\n     }\n   }\n   if (a.size() == 0) {\n     cout << 0;\n     return 0;\n   }\n   for (int i = 0; i < a.size(); i++) {\n     ans += a[i] * (sum - a[i]);\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(NULL);\n   int n, x;\n   cin >> n;\n   while (n--) {\n     cin >> x;\n     if (x < 3 || x == 4 || x == 5 || x == 8 || x == 11)\n       cout << 'NO' << endl;\n     else\n       cout << 'YES' << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m, k;\n   int ans = 0;\n   cin >> n >> m >> k;\n   int t;\n   for (int i = 0; i < n; ++i) {\n     cin >> t;\n     if (t == 1) {\n       if (m == 0)\n         ++ans;\n       else\n         --m;\n     } else {\n       if (m + k == 0)\n         ++ans;\n       else {\n         if (k)\n           --k;\n         else\n           --m;\n       }\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 300005;\n const int MAXINT = 1073741823;\n vector<int> neighbors[MAXN];\n int a[MAXN];\n int greater_right[MAXN];\n int greater_left[MAXN];\n int less_right[MAXN];\n int less_left[MAXN];\n int dp[MAXN];\n stack<int> s;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   for (int i = 0; i < n; i++) {\n     while (!s.empty() && a[s.top()] < a[i]) s.pop();\n     greater_left[i] = (s.empty() ? -1 : s.top());\n     s.push(i);\n   }\n   stack<int>().swap(s);\n   for (int i = 0; i < n; i++) {\n     while (!s.empty() && a[s.top()] > a[i]) s.pop();\n     less_left[i] = (s.empty() ? -1 : s.top());\n     s.push(i);\n   }\n   stack<int>().swap(s);\n   for (int i = n - 1; i >= 0; i--) {\n     while (!s.empty() && a[s.top()] < a[i]) s.pop();\n     greater_right[i] = (s.empty() ? -1 : s.top());\n     s.push(i);\n   }\n   stack<int>().swap(s);\n   for (int i = n - 1; i >= 0; i--) {\n     while (!s.empty() && a[s.top()] > a[i]) s.pop();\n     less_right[i] = (s.empty() ? -1 : s.top());\n     s.push(i);\n   }\n   for (int i = 0; i < n; i++) {\n     if (greater_left[i] != -1) neighbors[greater_left[i]].push_back(i);\n     if (greater_right[i] != -1) neighbors[i].push_back(greater_right[i]);\n     if (less_left[i] != -1) neighbors[less_left[i]].push_back(i);\n     if (less_right[i] != -1) neighbors[i].push_back(less_right[i]);\n   }\n   fill(dp, dp + n, MAXINT);\n   dp[0] = 0;\n   for (int i = 0; i < n; i++)\n     for (int j : neighbors[i]) dp[j] = min(dp[j], dp[i] + 1);\n   cout << dp[n - 1];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename Arg1>\n void __f(const char* name, Arg1&& arg1) {\n   cerr << name << ' : ' << arg1 << std::endl;\n }\n template <typename Arg1, typename... Args>\n void __f(const char* names, Arg1&& arg1, Args&&... args) {\n   const char* comma = strchr(names + 1, ',');\n   cerr.write(names, comma - names) << ' : ' << arg1 << ' | ';\n   __f(comma + 1, args...);\n }\n const int N = 2e5 + 5;\n int n;\n vector<int> adj[N];\n int root;\n int degree[N], removed[N], level[N];\n void dfs(int u, int p) {\n   for (auto v : adj[u]) {\n     if (v == p) continue;\n     level[v] = level[u] + 1;\n     dfs(v, u);\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   ;\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     int x;\n     cin >> x;\n     if (x == 0) {\n       root = i;\n       continue;\n     }\n     adj[x].push_back(i);\n     adj[i].push_back(x);\n     degree[i]++, degree[x]++;\n   }\n   if (n % 2 == 0) {\n     cout << 'NO\n';\n     return 0;\n   }\n   dfs(root, 0);\n   set<pair<int, int> > s;\n   for (int i = 1; i <= n; i++) {\n     if (degree[i] % 2 == 0) s.insert({level[i], i});\n   }\n   vector<int> ans;\n   while (!s.empty()) {\n     auto top = *s.rbegin();\n     s.erase(prev(s.end()));\n     int node = top.second;\n     for (auto v : adj[node]) {\n       if (removed[v]) continue;\n       degree[v]--;\n       if (degree[v] % 2 == 1) {\n         s.erase(s.find({level[v], v}));\n       } else {\n         s.insert({level[v], v});\n       }\n     }\n     ans.push_back(node);\n     removed[node] = 1;\n   }\n   if (ans.size() == n) {\n     cout << 'YES\n';\n     for (auto i : ans) cout << i << '\n';\n   } else\n     cout << 'NO\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using ll = long long;\n using ld = long double;\n using ull = unsigned long long;\n using namespace std;\n const int N = 2e5 + 2, mod = 998244353;\n int n, m, d[N][20];\n pair<int, int> dist[N][2];\n vector<int> g[2][N];\n struct State {\n   int d, ver, B;\n   bool operator<(const State& oth) const { return d > oth.d; }\n };\n struct State1 {\n   int B, A, ver;\n   bool operator<(const State1& oth) const {\n     return B > oth.B || (B == oth.B && A > oth.A);\n   }\n };\n void solve1() {\n   priority_queue<State1> pq;\n   for (int i = (1); i <= (n); ++i) dist[i][0] = dist[i][1] = {1e9, 1e9};\n   dist[1][0] = {0, 0};\n   pq.push({0, 0, 1});\n   while (!pq.empty()) {\n     State1 cur = pq.top();\n     pq.pop();\n     int side = cur.B & 1;\n     if (pair<int, int>(cur.B, cur.A) != dist[cur.ver][side]) continue;\n     for (int v : g[side][cur.ver])\n       if (dist[v][side].first > cur.B ||\n           (dist[v][side].first == cur.B && dist[v][side].second > cur.A + 1)) {\n         dist[v][side] = {cur.B, cur.A + 1};\n         pq.push({cur.B, cur.A + 1, v});\n       }\n     if (dist[cur.ver][side ^ 1].first > cur.B + 1 ||\n         (dist[cur.ver][side ^ 1].first == cur.B + 1 &&\n          dist[cur.ver][side ^ 1].second > cur.A)) {\n       dist[cur.ver][side ^ 1] = {cur.B + 1, cur.A};\n       pq.push({cur.B + 1, cur.A, cur.ver});\n     }\n   }\n   pair<int, int> ans = dist[n][0];\n   if (dist[n][1].first < ans.first ||\n       (dist[n][1].first == ans.first && dist[n][1].second < ans.second))\n     ans = dist[n][1];\n   assert(ans.first != 1e9 && ans.second != 1e9);\n   int res = 1;\n   for (int i = (1); i <= (ans.first); ++i) res = res * 2LL % mod;\n   cout << (res + ans.second - 1) % mod;\n }\n void solve() {\n   int LG = 32 - __builtin_clz(m);\n   assert(LG <= 19);\n   priority_queue<State> pq;\n   pq.push({0, 1, 0});\n   for (int i = (1); i <= (n); ++i)\n     for (int j = (0); j <= (19); ++j) d[i][j] = 1e9;\n   d[1][0] = 0;\n   while (!pq.empty()) {\n     State cur = pq.top();\n     pq.pop();\n     if (cur.d != d[cur.ver][cur.B]) continue;\n     for (int v : g[cur.B & 1][cur.ver])\n       if (d[v][cur.B] > cur.d + 1) {\n         d[v][cur.B] = cur.d + 1;\n         pq.push({d[v][cur.B], v, cur.B});\n       }\n     if (cur.B < LG) {\n       if (d[cur.ver][cur.B + 1] > cur.d + (1 << cur.B)) {\n         d[cur.ver][cur.B + 1] = cur.d + (1 << cur.B);\n         pq.push({d[cur.ver][cur.B + 1], cur.ver, cur.B + 1});\n       }\n     }\n   }\n   int ans = 1e9;\n   for (int i = (0); i <= (LG); ++i)\n     if (ans > d[n][i]) ans = d[n][i];\n   if (ans == 1e9)\n     solve1();\n   else\n     cout << ans;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cin >> n >> m;\n   for (int i = (1); i <= (m); ++i) {\n     int u, v;\n     cin >> u >> v;\n     g[0][u].emplace_back(v);\n     g[1][v].emplace_back(u);\n   }\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <iostream>\n #include <algorithm>\n #include <cassert>\n #include <fstream>\n \n using ll = long long;\n const int maxn = 5007;\n ll t, n, S[maxn], ans[maxn];\n ll res;\n \n int main(int argc, char *argv[]) {  \n 	std::ios::sync_with_stdio(false);\n 	std::cin.tie(0); \n 	std::cin >> t;\n 	while (t--) {\n 		res = 0;\n 		std::cin >> n;\n 		for (ll i = 0; i < n; i++) {\n 			std::cin >> S[i];\n 			ans[i] = 0;\n 		}\n 		for (ll i = 0; i < n; i++) {\n 			ll temp = ans[i];\n 			if (temp < S[i]-1){\n 				res += S[i] - 1 - temp;\n 				temp += S[i] - 1 - temp;\n 			}\n 			ans[i+1] += temp - S[i] + 1;\n 			if (i+2 < n) {\n 				for (int j = i+2; j < std::min(n,i+S[i]+1); j++) {\n 					ans[j]++;\n 				}\n 			}\n  		}\n 		std::cout << res << '\n';\n 	}\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, pos;\n long long a[200005], sum[200005], ans;\n vector<long long> vec;\n int main() {\n   cin.tie(0), ios::sync_with_stdio(0);\n   cin >> n >> k;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n     sum[i] = a[i];\n     sum[i] += sum[i - 1];\n     if (a[i] > 1) vec.push_back(i);\n   }\n   a[n + 1] = 1;\n   vec.push_back(n + 1);\n   for (int i = 1; i <= n; i++) {\n     pos = i;\n     long long tich = a[i];\n     while (1) {\n       int it = lower_bound(vec.begin(), vec.end(), pos + 1) - vec.begin();\n       int l = pos, r = vec[it] - 1, mid;\n       if (tich % k == 0) {\n         long long val = tich / k;\n         while (l < r) {\n           mid = (l + r) / 2;\n           if (sum[mid] - sum[i - 1] >= val)\n             r = mid;\n           else\n             l = mid + 1;\n         }\n         if (l >= pos && sum[l] - sum[i - 1] == val) {\n           ans++;\n         }\n       }\n       long long amount = LLONG_MAX / a[vec[it]];\n       if (tich >= amount) break;\n       tich *= a[vec[it]];\n       pos = vec[it];\n       if (pos == n + 1) break;\n     }\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[300000];\n int ans[300000];\n map<int, int> m;\n int gcd(int a, int b) {\n   if (b == 0)\n     return a;\n   else\n     return gcd(b, a % b);\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 0; i < n * n; i++) {\n     scanf('%d', &a[i]);\n     m[a[i]]++;\n   }\n   sort(a, a + n * n);\n   int k = 0;\n   for (int i = n * n - 1; i >= 0; i--) {\n     if (m[a[i]] > 0) {\n       ans[k++] = a[i];\n       for (int j = 0; j < k; j++) {\n         m[gcd(a[i], ans[j])] -= 2;\n       }\n     }\n   }\n   for (int i = 0; i < k - 1; i++) {\n     printf('%d ', ans[i]);\n   }\n   printf('%d', ans[k - 1]);\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<pair<long long int, long long int>> v1;\n int main() {\n   long long int n, i, A[300005], minn, t1, a1, i1;\n   cin >> n;\n   for (i = 1; i <= n; i++) {\n     cin >> A[i];\n     v1.push_back(make_pair(A[i], i));\n   }\n   minn = 10000000000;\n   for (i = 2; i <= n; i++) {\n     t1 = min(A[1], A[i]) / (i - 1);\n     if (t1 < minn) minn = t1;\n   }\n   for (i = n - 1; i >= 1; i--) {\n     t1 = min(A[n], A[i]) / (n - i);\n     if (t1 < minn) minn = t1;\n   }\n   sort(v1.begin(), v1.end());\n   a1 = v1[0].first;\n   i1 = v1[0].second;\n   for (i = 1; i < v1.size(); i++) {\n     t1 = min(a1, v1[i].first) / (abs(i1 - v1[i].second));\n     if (t1 < minn) minn = t1;\n   }\n   cout << minn << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxN = 2e5 + 10;\n const long long oo = 1e18;\n char s[maxN];\n long long cost[maxN][2];\n int main() {\n   int test;\n   scanf('%d', &test);\n   while (test--) {\n     int n, a, b;\n     scanf('%d%d%d%*c', &n, &a, &b);\n     gets(s);\n     cost[0][0] = b;\n     cost[0][1] = oo;\n     for (int i = 0; i < n; i++) {\n       if (s[i] == '0') {\n         cost[i + 1][0] = min(cost[i][0] + a + b, cost[i][1] + a * 2 + b);\n         cost[i + 1][1] = min(cost[i][0] + 2 * (a + b), cost[i][1] + a + b * 2);\n       } else {\n         cost[i + 1][1] = cost[i][1] + a + b * 2;\n         cost[i + 1][0] = oo;\n       }\n     }\n     printf('%lld\n', cost[n][0]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a[100001], g[100001], h[100001], m;\n set<int> events[100001];\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) events[i].clear();\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]), events[a[i]].insert(i);\n   m = 0;\n   bool ok = true;\n   for (int i = 1; i <= n; ++i)\n     if (!events[i].empty())\n       if (events[i].find(i) == events[i].end()) {\n         ok = false;\n         break;\n       }\n   if (!ok) {\n     printf('-1\n');\n     return 0;\n   }\n   for (int i = 1; i <= n; i++)\n     if (!events[i].empty()) {\n       h[++m] = i;\n       for (set<int>::iterator itr = events[i].begin(); itr != events[i].end();\n            ++itr)\n         g[*itr] = m;\n     }\n   printf('%d\n', m);\n   for (int i = 1; i <= n; i++) printf('%d ', g[i]);\n   printf('\n');\n   for (int i = 1; i <= m; i++) printf('%d ', h[i]);\n   printf('\n');\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n using namespace std;\n long long a,b,c,d,e,i,j,ii,jj,zx,xc,tes,t,f[200009],A[200009],B[200009],rg[200009][20],rgx[200009][20],lf[200009][20],lfx[200009][20],P[200009],pas;\n stack <long long> st;\n set <long long> s;\n set <long long>::iterator it,lft,rgt;\n long long uprg(long long q, long long w){\n 	if(q>=w) return 0;\n 	long long jm=0;\n 	long long h=0;\n 	for(h=18; h>=0; h--){\n 		if(rg[q][h]!=0&&rg[q][h]<w){\n 			jm+=rgx[q][h];\n 			q=rg[q][h];\n 		}\n 	}\n 	jm+=rgx[q][0];\n 	return jm;\n }\n long long uplf(long long q, long long w){\n 	if(w<=q) return 0;\n 	long long jm=0;\n 	long long h=0;\n 	for(h=19; h>=0; h--){\n 		if(lf[w][h]!=0&&lf[w][h]>q){\n 			jm+=lfx[w][h];\n 			w=lf[w][h];\n 		}\n 	}\n 	jm+=lfx[w][0];\n 	return jm;\n }\n long long fun(long long q, long long w){\n 	if(q>=w) return 0;\n 	long long jm=0;\n 	long long h=0;\n 	for(h=18; h>=0; h--){\n 		if(rg[q][h]!=0&&rg[q][h]<=w){\n 			jm+=rgx[q][h];\n 			q=rg[q][h];\n 		}\n 	}\n 	if(q==w) return jm;\n 	jm+=uplf(q,w);\n 	return jm;\n }\n int main(){\n 	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);\n 	cin>>a>>tes;\n 	for(i=1; i<=a; i++) cin>>f[i];\n 	for(i=1; i<=a; i++) cin>>A[i];\n 	for(i=1; i<=a; i++) cin>>B[i];\n 	while(st.size()) st.pop();\n 	st.push(a+1);\n 	f[a+1]=a+2;\n 	for(i=a; i>=1; i--){\n 		while(st.size()>0&&f[st.top()]<f[i]) st.pop();\n 		if(st.size()==0){\n 			\n 		}else{\n 			rg[i][0]=st.top();\n 			rgx[i][0]=min(B[i],A[i]+uprg(i+1,st.top()));\n 		}\n 		for(j=1; j<=18; j++){\n 			rg[i][j]=rg[rg[i][j-1]][j-1];\n 			rgx[i][j]=rgx[i][j-1]+rgx[rg[i][j-1]][j-1];\n 		}\n 		st.push(i);\n 	}\n 	while(st.size()) st.pop();\n 	for(i=1; i<=a; i++){\n 		while(st.size()>0&&f[st.top()]<f[i]) st.pop();\n 		if(st.size()==0){\n 			\n 		}else{\n 			lf[i][0]=st.top();\n 			lfx[i][0]=A[st.top()]+uprg(st.top()+1,i);\n 		}\n 		for(j=1; j<=18; j++){\n 			lf[i][j]=lf[lf[i][j-1]][j-1];\n 			lfx[i][j]=lfx[i][j-1]+lfx[lf[i][j-1]][j-1];\n 		}\n 		st.push(i);\n 	}\n 	s.insert(1);\n 	s.insert(a+1);\n 	P[1]=fun(1,a+1);\n 	pas+=P[1];\n 	for(t=1; t<=tes; t++){\n 		cin>>c;\n 		if(c==1){\n 			cout<<pas<<endl;\n 			continue;\n 		}\n 		it=s.lower_bound(c);\n 		if(it==s.end()||(*it)!=c){\n 			P[c]=fun(c,(*it));\n 			pas+=P[c];\n 			lft=it;lft--;\n 			pas-=P[(*lft)];\n 			P[(*lft)]=fun((*lft),c);\n 			pas+=P[(*lft)];\n 			s.insert(c);\n 		}else{\n 			lft=it;lft--;\n 			pas-=P[(*lft)];\n 			rgt=it;rgt++;\n 			pas-=P[c];\n 			P[(*lft)]=fun((*lft),(*rgt));\n 			pas+=P[(*lft)];\n 			s.erase(it);\n 		}\n 		cout<<pas<<endl;\n 	}\n 	P[0]=2*6;\n 	pas=P[0]+5;\n 	return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int solve(int n, int m, int k) {\n   if (n > m) return 0;\n   if (n == 0) return min(m + 1, (1 << (k + 1)));\n   if ((1 << k) & n) {\n     int c = solve(n - (1 << k), m - (1 << k), k - 1);\n     if (c == (1 << k))\n       return (1 << (k + 1));\n     else\n       return c;\n   } else {\n     int z = solve(n, m - (1 << k), k - 1);\n     if (z == (1 << k))\n       return 2 * z;\n     else {\n       int c = solve(n, m, k - 1);\n       if (c == (1 << k))\n         return (1 << k) + z;\n       else\n         return c;\n     }\n   }\n }\n void solve() {\n   int n, m;\n   cin >> n >> m;\n   cout << solve(n, m, 29) << '\n';\n }\n signed main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int t;\n   cin >> t;\n   while (t--) solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool f = 0;\n const double eps = 1e-8;\n int n;\n struct point {\n   double x, y;\n } p[100010];\n inline int rd() {\n   int x = 0;\n   bool f = 0;\n   char c = getchar();\n   while (!isdigit(c)) {\n     if (c == '-') f = 1;\n     c = getchar();\n   }\n   while (isdigit(c)) {\n     x = (x << 1) + (x << 3) + (c ^ 48);\n     c = getchar();\n   }\n   return f ? -x : x;\n }\n inline bool valid(double x) {\n   double l = -(double)1e18, r = (double)1e18, dlt;\n   for (register int i = 1; i <= n; ++i) {\n     if (p[i].y > x + x) return 0;\n     dlt = sqrt(p[i].y * (2 * x - p[i].y));\n     l = max(l, p[i].x - dlt);\n     r = min(r, p[i].x + dlt);\n   }\n   return (r - l + eps >= 0.0);\n }\n int main() {\n   n = rd();\n   for (register int i = 1; i <= n; ++i) {\n     p[i].x = (double)rd();\n     p[i].y = (double)rd();\n     if (p[i].y < 0.0) f = 1;\n   }\n   if (f == 1)\n     for (register int i = 1; i <= n; ++i) {\n       p[i].y = -p[i].y;\n       if (p[i].y < 0.0) {\n         puts('-1');\n         return 0;\n       }\n     }\n   int t = 0;\n   register double l = 0.0, r = (double)1e18, mid;\n   while (t <= 300) {\n     mid = (l + r) / 2.0;\n     ++t;\n     valid(mid) ? r = mid : l = mid;\n   }\n   printf('%.10lf', l);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n const long long inf = 2e9 + 10;\n template <typename T1, typename T2>\n static void relax(T1 &x, T2 y) {\n   if (x > y) x = y;\n }\n template <typename T1, typename T2>\n static void gain(T1 &x, T2 y) {\n   if (x < y) x = y;\n }\n long long powmod(long long a, long long b) {\n   long long res = 1;\n   while (b) {\n     if (b & 1) res = (res * a) % mod;\n     a = (a * a) % mod;\n     b >>= 1;\n   }\n   return res;\n }\n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n inline void add(int &x, int y) {\n   x += y;\n   if (x >= mod) x -= mod;\n }\n inline void sub(int &x, int y) {\n   x -= y;\n   if (x < 0) x += mod;\n }\n const int maxl = 2e3 + 3;\n int m, d;\n string a, b;\n int dp[maxl][maxl][2];\n int solve(string s) {\n   int n = (int)s.length();\n   for (int(i) = 0; (i) < (int)(n + 1); ++(i))\n     for (int(j) = 0; (j) < (int)(m); ++(j))\n       for (int(k) = 0; (k) < (int)(2); ++(k)) dp[i][j][k] = 0;\n   dp[0][0][1] = 1;\n   for (int(i) = 0; (i) < (int)(n); ++(i))\n     for (int(j) = 0; (j) < (int)(m); ++(j))\n       for (int(k) = 0; (k) < (int)(2); ++(k))\n         for (int dgt = 0; dgt <= (k ? int(s[i] - '0') : 9); ++dgt) {\n           if ((i & 1) && dgt != d) continue;\n           if (!(i & 1) && dgt == d) continue;\n           int ni = i + 1;\n           int nj = ((j * 10 + dgt) % m);\n           int nk = k && (dgt == int(s[i] - '0'));\n           add(dp[ni][nj][nk], dp[i][j][k]);\n         }\n   int ans = 0;\n   for (int(k) = 0; (k) < (int)(2); ++(k)) add(ans, dp[n][0][k]);\n   return ans;\n }\n bool ok(string s) {\n   int n = (int)s.length();\n   int rem = 0;\n   for (int(i) = 0; (i) < (int)(n); ++(i)) {\n     int dgt = int(s[i] - '0');\n     if ((i & 1) && dgt != d) return false;\n     if (!(i & 1) && dgt == d) return false;\n     rem = (rem * 10 + dgt) % m;\n   }\n   return !rem;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   cin >> m >> d;\n   cin >> a;\n   cin >> b;\n   int ans = 0;\n   add(ans, solve(b));\n   sub(ans, solve(a));\n   add(ans, ok(a));\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[200010];\n int main() {\n   cin.tie(0);\n   ios_base::sync_with_stdio(false);\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   int f = 0;\n   for (int i = 1; i < n; i++)\n     if (a[i] != a[i - 1]) {\n       f = 1;\n       break;\n     }\n   if (f == 0) {\n     if (a[0] == 0) {\n       cout << 'YES' << endl;\n       for (int i = 0; i < n; i++) cout << '1' << ' ';\n       exit(0);\n     }\n     cout << 'NO' << endl;\n     exit(0);\n   }\n   long long mx = 0, mxer = 0;\n   for (int i = 0; i < n; i++)\n     if (a[i] > mx) mx = a[mxer = i];\n   while (true) {\n     int x = mxer - 1;\n     if (x < 0) x += n;\n     if (a[x] == a[mxer])\n       mxer = x;\n     else\n       break;\n   }\n   int flag = 1;\n   for (int i = 1; i < n; i++) {\n     int x = mxer - 1;\n     if (x < 0) x += n;\n     if (flag && a[x] == 0) {\n       a[x] += a[mxer];\n       flag = 0;\n     }\n     a[x] += a[mxer];\n     mxer = x;\n   }\n   cout << 'YES' << endl;\n   for (int i = 0; i < n; i++) cout << a[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int(a), int(b)) { return ((a) % (b) ? gcd((b), (a) % (b)) : (b)); }\n long long lgcd(long long(a), long long(b)) {\n   return ((a) % (b) ? gcd((b), (a) % (b)) : (b));\n }\n int lcm(int a, int b) { return (a) / gcd((a), (b)) * b; }\n long long llcm(long long a, long long b) { return (a) / lgcd((a), (b)) * b; }\n int n, m, ans[100010], crime[100010], notcrime[100010];\n int main() {\n   memset(ans, 0, sizeof(ans));\n   memset(crime, 0, sizeof(crime));\n   memset(notcrime, 0, sizeof(notcrime));\n   scanf('%d%d', &n, &m);\n   getchar();\n   for (int i = 1; i <= n; i++) {\n     char c;\n     int temp;\n     scanf('%c%d', &c, &temp);\n     getchar();\n     if (c == '+') {\n       crime[temp]++;\n       ans[i] = temp;\n     } else {\n       notcrime[temp]++;\n       ans[i] = -temp;\n     }\n   }\n   int nnc = 0;\n   for (int i = 1; i <= n; i++) nnc += notcrime[i];\n   int nc = 0;\n   bool cc[100010];\n   memset(cc, false, sizeof(cc));\n   for (int i = 1; i <= n; i++) {\n     if (crime[i] + nnc - notcrime[i] == m) {\n       cc[i] = true;\n       nc++;\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     if (ans[i] > 0) {\n       if (cc[((ans[i]) > 0 ? (ans[i]) : -(ans[i]))]) {\n         if (nc > 1)\n           printf('Not defined\n');\n         else\n           printf('Truth\n');\n       } else\n         printf('Lie\n');\n     } else {\n       if (cc[((ans[i]) > 0 ? (ans[i]) : -(ans[i]))]) {\n         if (nc == 1)\n           printf('Lie\n');\n         else\n           printf('Not defined\n');\n       } else\n         printf('Truth\n');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int dx[] = {-1, 0, 1, 0};\n const int dy[] = {0, -1, 0, 1};\n const int dx8[] = {-1, 0, 1, 0, 1, 1, -1, -1};\n const int dy8[] = {0, -1, 0, 1, 1, -1, 1, -1};\n void solve() {\n   long long n;\n   cin >> n;\n   vector<long long> a(n);\n   vector<vector<long long>> dp(n, vector<long long>(n));\n   vector<vector<long long>> sum(n, vector<long long>(n));\n   for (long long i = 0; i < n; i++) cin >> a[i];\n   sort(a.begin(), a.end());\n   vector<long long> s(n), l(n);\n   for (long long i = 0; i < n; i++) {\n     for (long long j = 0; j < n; j++) {\n       if (a[i] >= 2 * a[j]) {\n         l[i] = j;\n         s[i]++;\n       }\n     }\n   }\n   for (long long i = 0; i < n; i++) {\n     for (long long j = 0; j < n; j++) {\n       if (j == 0) {\n         dp[i][j] = 1;\n         long long x = i - 1 >= 0 ? sum[i - 1][j] : 0;\n         sum[i][j] = x + dp[i][j];\n         sum[i][j] %= 998244353;\n         continue;\n       }\n       if (s[i] - j + 1 > 0) {\n         dp[i][j] =\n             (dp[i][j - 1] * (s[i] - j + 1)) % 998244353 + sum[l[i]][j - 1];\n         dp[i][j] %= 998244353;\n       } else\n         dp[i][j] = 0;\n       long long x = i - 1 >= 0 ? sum[i - 1][j] : 0;\n       sum[i][j] = x + dp[i][j];\n       sum[i][j] %= 998244353;\n     }\n   }\n   cout << dp[n - 1][n - 1] << '\n';\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class node>\n struct link_cut_tree {\n   bool connected(node* u, node* v) { return lca(u, v) != NULL; }\n   int depth(node* u) {\n     access(u);\n     return get_sz(u->ch[0]);\n   }\n   node* get_root(node* u) {\n     access(u);\n     while (u->ch[0]) u = u->ch[0], u->push();\n     return access(u), u;\n   }\n   node* ancestor(node* u, int k) {\n     k = depth(u) - k;\n     assert(k >= 0);\n     for (;; u->push()) {\n       int sz = get_sz(u->ch[0]);\n       if (sz == k) return access(u), u;\n       if (sz < k)\n         k -= sz + 1, u = u->ch[1];\n       else\n         u = u->ch[0];\n     }\n     assert(0);\n   }\n   node* lca(node* u, node* v) {\n     if (u == v) return u;\n     access(u);\n     access(v);\n     if (!u->p) return NULL;\n     u->splay();\n     return u->p ?: u;\n   }\n   void link(node* u, node* v) {\n     make_root(v);\n     access(u);\n     set_link(v, u, 0);\n     v->update();\n   }\n   void cut(node* u) {\n     access(u);\n     u->ch[0]->p = NULL;\n     u->ch[0] = NULL;\n     u->update();\n   }\n   void cut(node* u, node* v) { cut(depth(u) > depth(v) ? u : v); }\n   void make_root(node* u) {\n     access(u);\n     u->reverse();\n     access(u);\n     assert(!u->ch[0] && !u->ch[1]);\n   }\n   void access(node* u) {\n     for (node *v = u, *pre = NULL; v; v = v->p) {\n       v->splay();\n       if (pre) v->update_vsub(pre, false);\n       if (v->ch[1]) v->update_vsub(v->ch[1], true);\n       v->ch[1] = pre;\n       v->update();\n       pre = v;\n     }\n     u->splay();\n     assert(!u->ch[1]);\n   }\n   node* operator[](int i) { return &data[i]; }\n   int operator[](node* i) { return i - &data[0]; }\n   vector<node> data;\n   link_cut_tree(int n) : data(n) {}\n };\n template <typename pnode>\n struct splay_tree {\n   pnode ch[2], p;\n   splay_tree() { ch[0] = ch[1] = p = NULL; }\n   int dir() {\n     if (!p) return -2;\n     if (p->ch[0] == this) return 0;\n     if (p->ch[1] == this) return 1;\n     return -1;\n   }\n   bool is_root() { return dir() < 0; }\n   friend void set_link(pnode u, pnode v, int d) {\n     if (v) v->p = u;\n     if (d >= 0) u->ch[d] = v;\n   }\n   void rotate() {\n     assert(!is_root());\n     int x = dir();\n     pnode g = p;\n     set_link(g->p, static_cast<pnode>(this), g->dir());\n     set_link(g, ch[x ^ 1], x);\n     set_link(static_cast<pnode>(this), g, x ^ 1);\n     g->update();\n   }\n   void splay() {\n     const pnode& self = static_cast<pnode>(this);\n     while (!is_root() && !p->is_root()) {\n       p->p->push(), p->push(), self->push();\n       dir() == p->dir() ? p->rotate() : self->rotate();\n       self->rotate();\n     }\n     if (!is_root()) p->push(), self->push(), self->rotate();\n     self->push();\n     self->update();\n   }\n };\n template <typename pnode, class splay_tree_vchs>\n struct splay_tree_lct : splay_tree<pnode> {\n   splay_tree_vchs vnode;\n   using splay_tree<pnode>::ch;\n   bool rev;\n   splay_tree_vchs* root;\n   splay_tree_lct() : splay_tree<pnode>() {\n     root = NULL;\n     rev = 0;\n   }\n   void update() {}\n   void push() {\n     if (rev) {\n       if (ch[0]) ch[0]->reverse();\n       if (ch[1]) ch[1]->reverse();\n       rev = 0;\n     }\n   }\n   void rotate() {\n     swap(vnode, this->p->vnode);\n     splay_tree<pnode>::rotate();\n   }\n   void splay() {\n     auto v = &vnode;\n     bool r = !v->key;\n     splay_tree<pnode>::splay();\n     if (r && v->key) {\n       if (v->p) v->p->ch[v->p->ch[1] == &v->key->vnode] = v;\n       if (v->ch[0]) v->ch[0]->p = v;\n       if (v->ch[1]) v->ch[1]->p = v;\n       v->key = static_cast<pnode>(this);\n     }\n   }\n   void reverse() {\n     rev ^= 1;\n     swap(ch[0], ch[1]);\n   }\n   void update_vsub(pnode v, bool add) {\n     auto& u = root;\n     if (add) {\n       v->vnode = splay_tree_vchs(v);\n       if (!u) {\n         u = &v->vnode;\n         return;\n       }\n       while (u->ch[1]) u = u->ch[1];\n       u->ch[1] = &v->vnode;\n       u->ch[1]->p = u;\n       u = u->ch[1];\n       u->splay();\n     } else {\n       auto x = &v->vnode;\n       x->splay();\n       if (!x->ch[0]) {\n         u = x->ch[1];\n       } else if (!x->ch[1]) {\n         u = x->ch[0];\n       } else {\n         u = x->ch[0];\n         u->p = NULL;\n         while (u->ch[1]) u = u->ch[1];\n         u->ch[1] = x->ch[1];\n         x->ch[1]->p = u;\n         u->splay();\n       }\n       if (u) u->p = NULL;\n       x->key = NULL;\n     }\n   }\n };\n const int inf = -1e8;\n template <typename pnode>\n struct splay_tree_vchs : splay_tree<splay_tree_vchs<pnode>*> {\n   using splay_tree<splay_tree_vchs<pnode>*>::ch;\n   pnode key;\n   int x;\n   array<int, 4> y;\n   splay_tree_vchs(){};\n   splay_tree_vchs(const pnode& key)\n       : splay_tree<splay_tree_vchs<pnode>*>(), key(key) {\n     build();\n   }\n   void build() {\n     x = key->x;\n     y[0] = key->pp[0];\n     y[1] = 0;\n     y[2] = key->pp[1];\n     y[3] = inf;\n   }\n   void update() {\n     build();\n     for (int c = 0; c < 2; ++c)\n       if (ch[c]) {\n         x = max(x, ch[c]->x);\n         for (int i = 0; i < 4; i += 2) {\n           if (ch[c]->y[i] > y[i]) {\n             y[i + 1] = y[i];\n             y[i] = ch[c]->y[i];\n             if (ch[c]->y[i + 1] > y[i + 1]) y[i + 1] = ch[c]->y[i + 1];\n           } else if (ch[c]->y[i] > y[i + 1])\n             y[i + 1] = ch[c]->y[i];\n         }\n       }\n   }\n   void push() {}\n };\n const array<int, 4> ainf = {0, inf, 0, inf};\n struct node : splay_tree_lct<node*, splay_tree_vchs<node*>> {\n   bool val, len, sval;\n   int slen;\n   int x;\n   array<int, 4> pp;\n   node() : splay_tree_lct() {\n     val = len = sval = 0;\n     slen = x = 0;\n     pp = ainf;\n   }\n   void update() {\n     splay_tree_lct::update();\n     x = 0;\n     sval = val;\n     slen = len;\n     array<int, 4> up = ainf, dw = ainf;\n     array<int, 2> v1 = {0, inf}, v2 = v1;\n     bool upsval = val;\n     int upslen = len;\n     bool dwsval = val;\n     int dwslen = len;\n     if (ch[0]) {\n       x = max(x, ch[0]->x);\n       up = ch[0]->pp;\n       sval ^= ch[0]->sval;\n       slen += ch[0]->slen;\n       upsval ^= ch[0]->sval;\n       upslen += ch[0]->slen;\n     }\n     if (ch[1]) {\n       x = max(x, ch[1]->x);\n       dw = ch[1]->pp;\n       sval ^= ch[1]->sval;\n       slen += ch[1]->slen;\n       dwsval ^= ch[1]->sval;\n       dwslen += ch[1]->slen;\n     }\n     if (root) {\n       x = max(x, root->x);\n       v1[0] = root->y[0];\n       v1[1] = root->y[2];\n       v2[0] = root->y[1];\n       v2[1] = root->y[3];\n     }\n     pp[0] = up[0], pp[1] = up[1];\n     pp[2] = dw[2], pp[3] = dw[3];\n     for (int i = 0; i < 2; ++i) {\n       x = max(x, len + max({up[2 + i] + dw[i ^ val], up[2 + i] + v1[i ^ val],\n                             dw[i] + v1[i ^ val], v1[i] + v2[i ^ val]}));\n       pp[i ^ upsval] = max(pp[i ^ upsval], upslen + max(dw[i], v1[i]));\n       pp[2 + (i ^ dwsval)] =\n           max(pp[2 + (i ^ dwsval)], dwslen + max(up[2 + i], v1[i]));\n     }\n   }\n   void push() { splay_tree_lct::push(); }\n   void reverse() {\n     splay_tree_lct::reverse();\n     swap(pp[0], pp[2]);\n     swap(pp[1], pp[3]);\n   }\n };\n int main() {\n   ios_base::sync_with_stdio(0), cin.tie(0);\n   int n;\n   cin >> n;\n   link_cut_tree<node> lct(2 * n);\n   vector<vector<tuple<int, bool, int>>> adj(n);\n   for (int i = 1, u, v, w; i < n; ++i) {\n     cin >> u >> v >> w;\n     --u, --v;\n     adj[u].push_back({v, w, i});\n     adj[v].push_back({u, w, i});\n   }\n   function<void(int, int)> dfs = [&](int u, int p) {\n     for (auto [v, w, i] : adj[u])\n       if (v != p) {\n         dfs(v, u);\n         lct[n + i]->val = w;\n         lct[n + i]->len = true;\n         lct[n + i]->update();\n         lct.link(lct[u], lct[n + i]);\n         lct.link(lct[n + i], lct[v]);\n       }\n   };\n   dfs(0, -1);\n   int q;\n   cin >> q;\n   for (int i = 0, u; i < q; ++i) {\n     cin >> u;\n     lct.access(lct[n + u]);\n     lct[n + u]->val ^= 1;\n     lct[n + u]->update();\n     cout << lct[n + u]->x << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<int, map<int, int> > m;\n long long int lol(long long int a, long long int r) {\n   if (a >= 0 && r <= 0) return a;\n   if (a <= 0 && r >= 0) return a;\n   return a % r;\n }\n int main() {\n   long long int a, b;\n   cin >> a >> b;\n   string s;\n   cin >> s;\n   long x = 0;\n   long y = 0;\n   if (a == 0 && b == 0) {\n     cout << 'Yes' << endl;\n     return 0;\n   }\n   for (long i = 0; i < s.size(); i++) {\n     if (s[i] == 'L') x--;\n     if (s[i] == 'R') x++;\n     if (s[i] == 'U') y++;\n     if (s[i] == 'D') y--;\n   }\n   long p = 2;\n   long w = 0;\n   long q = 0;\n   int d = 0;\n   for (long i = 0; i < s.size(); i++) {\n     if (s[i] == 'L') w--;\n     if (s[i] == 'R') w++;\n     if (s[i] == 'U') q++;\n     if (s[i] == 'D') q--;\n     long long int u = a - w;\n     long long int e = b - q;\n     if (x != 0) {\n       if (y != 0) {\n         long long int v = u / x;\n         long long int z = e / y;\n         if (v == z && v >= 0 && u % x == 0 && e % y == 0) d = 1;\n       } else {\n         long long int v = a / x;\n         if (e == 0 && v >= 0 && u % x == 0) d = 1;\n       }\n     } else {\n       if (y != 0) {\n         long long int z = e / y;\n         if (z >= 0 && u == 0 && e % y == 0) d = 1;\n       } else {\n         if (u == 0 && e == 0) d = 1;\n       }\n     }\n   }\n   if (d == 1)\n     cout << 'Yes' << endl;\n   else\n     cout << 'No' << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int V = 100100;\n int l[V], r[V], a[V], ret, n;\n int main() {\n   while (~scanf('%d', &n)) {\n     ret = 0;\n     for (int i = 1; i <= n; i++) scanf('%d', &a[i]);\n     for (int i = 1; i <= n; i++) l[i] = r[i] = i;\n     for (int i = 1; i <= n; i++) {\n       while (l[i] != 1 && a[l[i] - 1] < a[i]) l[i] = l[l[i] - 1];\n       if (l[i] != 1) ret = max(ret, a[i] ^ a[l[i] - 1]);\n     }\n     for (int i = n; i >= 1; i--) {\n       while (r[i] != n && a[r[i] + 1] < a[i]) r[i] = r[r[i] + 1];\n       if (r[i] != n) ret = max(ret, a[i] ^ a[r[i] + 1]);\n     }\n     printf('%d\n', ret);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX_N = 17;\n int n;\n vector<int> adj[(1 << MAX_N) + 9];\n bool used[(1 << MAX_N) + 9];\n int cnt[(1 << MAX_N) + 9];\n vector<int> vRoot;\n vector<int> ans;\n void buildCnt(int x) {\n   used[x] = true;\n   cnt[x] = 1;\n   for (int y : adj[x]) {\n     if (!used[y]) {\n       buildCnt(y);\n       cnt[x] += cnt[y];\n     }\n   }\n   used[x] = false;\n }\n void findRoot(int x, vector<int>& vRoot) {\n   used[x] = true;\n   for (int y : adj[x]) {\n     if (!used[y]) {\n       findRoot(y, vRoot);\n     }\n   }\n   if ((1 << n) - 2 - cnt[x] == (1 << n - 1) - 1) {\n     vRoot.push_back(x);\n   } else {\n     for (int y : adj[x]) {\n       if (!used[y]) {\n         if (cnt[y] == (1 << n - 1) - 1) {\n           vRoot.push_back(x);\n           break;\n         }\n       }\n     }\n   }\n   used[x] = false;\n }\n bool checkTree1(int x, int depth) {\n   used[x] = true;\n   bool result = false;\n   if (cnt[x] != (1 << depth) - 1) {\n     result = false;\n   } else if (depth == 1) {\n     result = true;\n   } else {\n     result = true;\n     for (int y : adj[x]) {\n       if (!used[y]) {\n         if (!checkTree1(y, depth - 1)) {\n           result = false;\n           break;\n         }\n       }\n     }\n   }\n   used[x] = false;\n   return result;\n }\n int checkTree2(int x, int depth) {\n   used[x] = true;\n   int result = -1;\n   if (cnt[x] != (1 << depth) - 2) {\n     result = -1;\n   } else if (depth == 2) {\n     result = x;\n   } else {\n     vector<pair<int, int>> children;\n     for (int y : adj[x]) {\n       if (!used[y]) {\n         children.push_back(make_pair(cnt[y], y));\n       }\n     }\n     sort(children.begin(), children.end());\n     if (children.size() == 2) {\n       int tmp = checkTree2(children[0].second, depth - 1);\n       if (tmp != -1 && checkTree1(children[1].second, depth - 1)) {\n         result = tmp;\n       } else {\n         result = -1;\n       }\n     } else if (children.size() == 3) {\n       if (checkTree1(children[0].second, depth - 2) &&\n           checkTree1(children[1].second, depth - 2) &&\n           checkTree1(children[2].second, depth - 1)) {\n         result = x;\n       } else {\n         result = -1;\n       }\n     } else {\n       result = -1;\n     }\n   }\n   used[x] = false;\n   return result;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cin >> n;\n   for (int i = 1; i <= (1 << n) - 3; i++) {\n     int x;\n     int y;\n     cin >> x >> y;\n     adj[x].push_back(y);\n     adj[y].push_back(x);\n   }\n   buildCnt(1);\n   findRoot(1, vRoot);\n   for (int root : vRoot) {\n     buildCnt(root);\n     int x = checkTree2(root, n);\n     if (x != -1) {\n       ans.push_back(x);\n     }\n   }\n   sort(ans.begin(), ans.end());\n   cout << ans.size() << '\n';\n   for (int x : ans) {\n     cout << x << ' ';\n   }\n   cout << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, maxx, idx, max1, s;\n int main(int argc, char *argv[]) {\n   pair<int, int> a[10000];\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i].first;\n     a[i].second = 0;\n   }\n   maxx = 0;\n   max1 = 0;\n   for (int i = 0; i < n; i++) {\n     if (a[i].first > maxx) {\n       max1 = maxx;\n       maxx = a[i].first;\n       idx = i;\n     } else if (max1 < a[i].first)\n       max1 = a[i].first;\n   }\n   cout << idx + 1 << ' ' << max1 << endl;\n   return EXIT_SUCCESS;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long z, mn, mx, sum, ans, k, pos, pos1, r, xx, yy, zz, n, m, x, y;\n vector<int> v;\n bool OK[1000002], KO[1000002], zoom;\n int b[100003], c[100002];\n map<char, int> mp, mr;\n set<int> st;\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; ++i) {\n     cin >> x >> y >> k;\n     cout << ((k + 1) / 2 * x) - (k / 2 * y) << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main(void) {\n   long long int n = 0ll, k = 0ll, p = 0ll, pn = 0ll, even = 0ll, odd = 0ll;\n   while (cin >> n) {\n     cin >> k >> p;\n     if (k == 0) {\n       for (long long int i = 0; i < p; i++) {\n         cin >> pn;\n         cout << '.';\n       }\n       cout << endl;\n     } else {\n       if (n % 2 == 0) {\n         if (k >= (n >> 1)) {\n           even = 2;\n           k -= (n >> 1);\n           odd = n + 1 - (k << 1);\n         } else {\n           odd = n + 1;\n           even = n + 2 - (k << 1);\n         }\n         for (int i = 0; i < p; i++) {\n           cin >> pn;\n           if (pn % 2 == 0) {\n             if (pn >= even) {\n               cout << 'X';\n             } else {\n               cout << '.';\n             }\n           } else {\n             if (pn >= odd) {\n               cout << 'X';\n             } else {\n               cout << '.';\n             }\n           }\n         }\n         cout << endl;\n       } else {\n         n--;\n         k--;\n         if (k >= (n >> 1)) {\n           even = 2;\n           k -= (n >> 1);\n           odd = n + 1 - (k << 1);\n         } else {\n           odd = n + 1;\n           even = n + 2 - (k << 1);\n         }\n         for (int i = 0; i < p; i++) {\n           cin >> pn;\n           if (pn == n + 1) {\n             cout << 'X';\n           } else if (pn % 2 == 0) {\n             if (pn >= even) {\n               cout << 'X';\n             } else {\n               cout << '.';\n             }\n           } else {\n             if (pn >= odd) {\n               cout << 'X';\n             } else {\n               cout << '.';\n             }\n           }\n         }\n         cout << endl;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<int, int> mp;\n int fin(int rem) {\n   for (auto p : mp) {\n     if (p.first >= rem) return p.first;\n   }\n   return -1;\n }\n int main() {\n   long long ans = 0, rem = 0, p, x, y, n, RES = 1e9;\n   cin >> n >> x >> y;\n   long long a[] = {x, x, x, x, y, y};\n   sort(a, a + 6);\n   do {\n     mp.clear();\n     ans = 0;\n     for (int i = 0; i < 6; ++i) {\n       if ((x = fin(a[i])) == -1) {\n         ++ans;\n         ++mp[n - a[i]];\n       } else {\n         ++mp[x - a[i]];\n         if (!--mp[x]) mp.erase(x);\n       }\n     }\n     RES = min(RES, ans);\n   } while (next_permutation(a, a + 6));\n   cout << RES;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 2000005;\n template <typename T>\n void read(T &x) {\n   x = 0;\n   int f = 1;\n   char c = getchar();\n   for (; !isdigit(c); c = getchar())\n     if (c == '-') f = -f;\n   for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';\n   x *= f;\n }\n template <typename T>\n void write(T x) {\n   if (x < 0) x = -x, putchar('-');\n   if (x > 9) write(x / 10);\n   putchar(x % 10 + '0');\n }\n template <typename T>\n void writeln(T x) {\n   write(x);\n   puts('');\n }\n int n, m1, m2, m, t;\n int x1[MAXN], x2[MAXN];\n int mid1[MAXN], mid2[MAXN];\n int pos1[MAXN], pos2[MAXN];\n int dp[3][MAXN], path[3][MAXN], pos[MAXN];\n int main() {\n   read(n), read(m1), read(m2), read(t);\n   for (int i = 1; i <= m1; i++) read(x1[i]);\n   for (int i = 1; i <= m2; i++) read(x2[i]);\n   pos[++m] = 0;\n   int p1 = 1, p2 = 1;\n   while (p1 <= m1 || p2 <= m2) {\n     if (p1 > m1)\n       pos[++m] = x2[p2++] + 1;\n     else if (p2 > m2)\n       pos[++m] = x1[p1++] + 1;\n     else {\n       int Min = min(x1[p1], x2[p2]);\n       pos[++m] = Min + 1;\n       if (Min == x1[p1]) p1++;\n       if (Min == x2[p2]) p2++;\n     }\n   }\n   if (pos[m] != n + 1) pos[++m] = n + 1;\n   p1 = 1;\n   for (int i = 1; i <= m1; i++) {\n     while (x1[i] > pos[p1]) p1++;\n     if (pos[p1] > x1[i]) mid1[p1] = x1[i];\n     pos1[p1] += x1[i] == pos[p1];\n   }\n   p2 = 1;\n   for (int i = 1; i <= m2; i++) {\n     while (x2[i] > pos[p2]) p2++;\n     if (pos[p2] > x2[i]) mid2[p2] = x2[i];\n     pos2[p2] += x2[i] == pos[p2];\n   }\n   memset(dp, -1, sizeof(dp));\n   dp[1][1] = 0;\n   for (int i = 1; i <= m - 1; i++) {\n     if (dp[1][i] != -1 && pos2[i] == 0) {\n       int tmp = min(dp[1][i], t);\n       if (tmp > dp[2][i]) {\n         dp[2][i] = tmp;\n         path[2][i] = 1;\n       }\n     }\n     if (dp[2][i] != -1 && pos1[i] == 0) {\n       int tmp = min(dp[2][i], t);\n       if (tmp > dp[1][i]) {\n         dp[1][i] = tmp;\n         path[1][i] = 1;\n       }\n     }\n     if (dp[1][i] != -1) {\n       int tmp = dp[1][i];\n       if (pos1[i + 1] == 0 && mid1[i + 1] == 0) tmp += pos[i + 1] - pos[i];\n       if (pos1[i + 1] == 0 && mid1[i + 1] != 0) {\n         tmp += mid1[i + 1] - pos[i] - 1;\n         if (tmp < t)\n           tmp = -1;\n         else\n           tmp -= t;\n         if (tmp != -1) tmp += pos[i + 1] - mid1[i + 1] + 1;\n       }\n       if (pos1[i + 1] != 0 && mid1[i + 1] == 0) {\n         tmp += pos[i + 1] - pos[i] - 1;\n         if (tmp < t)\n           tmp = -1;\n         else\n           tmp -= t;\n         if (tmp != -1) tmp += 1;\n       }\n       if (pos1[i + 1] != 0 && mid1[i + 1] != 0) {\n         tmp += mid1[i + 1] - pos[i] - 1;\n         if (tmp < t)\n           tmp = -1;\n         else\n           tmp -= t;\n         if (tmp != -1) tmp += pos[i + 1] - mid1[i + 1];\n         if (tmp < t)\n           tmp = -1;\n         else\n           tmp -= t;\n         if (tmp != -1) tmp += 1;\n       }\n       dp[1][i + 1] = tmp;\n     }\n     if (dp[2][i] != -1) {\n       int tmp = dp[2][i];\n       if (pos2[i + 1] == 0 && mid2[i + 1] == 0) tmp += pos[i + 1] - pos[i];\n       if (pos2[i + 1] == 0 && mid2[i + 1] != 0) {\n         tmp += mid2[i + 1] - pos[i] - 1;\n         if (tmp < t)\n           tmp = -1;\n         else\n           tmp -= t;\n         if (tmp != -1) tmp += pos[i + 1] - mid2[i + 1] + 1;\n       }\n       if (pos2[i + 1] != 0 && mid2[i + 1] == 0) {\n         tmp += pos[i + 1] - pos[i] - 1;\n         if (tmp < t)\n           tmp = -1;\n         else\n           tmp -= t;\n         if (tmp != -1) tmp += 1;\n       }\n       if (pos2[i + 1] != 0 && mid2[i + 1] != 0) {\n         tmp += mid2[i + 1] - pos[i] - 1;\n         if (tmp < t)\n           tmp = -1;\n         else\n           tmp -= t;\n         if (tmp != -1) tmp += pos[i + 1] - mid2[i + 1];\n         if (tmp < t)\n           tmp = -1;\n         else\n           tmp -= t;\n         if (tmp != -1) tmp += 1;\n       }\n       dp[2][i + 1] = tmp;\n     }\n   }\n   if (dp[1][m] == -1 && dp[2][m] == -1) {\n     printf('No\n');\n     return 0;\n   }\n   printf('Yes\n');\n   int px, py;\n   if (dp[1][m] == -1)\n     py = 2, px = m;\n   else\n     py = 1, px = m;\n   static int shifts[MAXN], cnts = 0;\n   static int x[MAXN], y[MAXN], cnt = 0;\n   int now = 0;\n   while (px != 1 || py != 1) {\n     if (path[py][px]) {\n       cnt += now;\n       int tx = pos[px] - dp[py][px];\n       for (int i = 1; i <= now; i++) {\n         tx += t;\n         x[cnt - i + 1] = tx;\n         y[cnt - i + 1] = py;\n       }\n       py = 3 - py;\n       now = 0;\n       shifts[++cnts] = pos[px];\n     } else {\n       if (py == 1)\n         now += mid1[px] != 0, now += pos1[px] != 0;\n       else\n         now += mid2[px] != 0, now += pos2[px] != 0;\n       px = px - 1;\n     }\n   }\n   cnt += now;\n   int tx = 0;\n   for (int i = 1; i <= now; i++) {\n     tx += t;\n     x[cnt - i + 1] = tx;\n     y[cnt - i + 1] = py;\n   }\n   writeln(cnts);\n   reverse(shifts + 1, shifts + cnts + 1);\n   for (int i = 1; i <= cnts; i++) printf('%d ', shifts[i]);\n   printf('\n');\n   writeln(cnt);\n   reverse(x + 1, x + cnt + 1);\n   reverse(y + 1, y + cnt + 1);\n   for (int i = 1; i <= cnt; i++) printf('%d %d\n', x[i], y[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int sum[100005];\n int main() {\n   int h1, h2, a, b, k, x;\n   cin >> h1 >> h2 >> a >> b;\n   int num = h1 + a * 8;\n   if (num >= h2)\n     x = 0;\n   else if (a <= b)\n     x = -1;\n   else {\n     x = 1;\n     num -= b * 12;\n     for (int i = 1;; i++) {\n       num += a * 12;\n       if (num >= h2)\n         break;\n       else {\n         x++;\n         num -= b * 12;\n       }\n     }\n   }\n   cout << x << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = 200010;\n const long long INF = 1ll << 60;\n const int inf = 0x3f3f3f3f;\n class SegmentTree {\n  public:\n   SegmentTree() {}\n   void Init(int n, int v[]) {\n     n_ = n;\n     Build(1, n, 1, v);\n   }\n   void ChangeSingle(int l, int r, int rt, int id, int x) {\n     if (l == r) {\n       min_[rt] = std::pair<int, int>(x, l);\n       return;\n     }\n     int m = (l + r) >> 1;\n     if (id <= m) {\n       ChangeSingle(l, m, rt << 1, id, x);\n     } else {\n       ChangeSingle(m + 1, r, rt << 1 | 1, id, x);\n     }\n     Up(rt);\n   }\n   std::pair<int, int> MinInterval(int l, int r, int rt, int L, int R) {\n     if (L > R) {\n       return std::pair<int, int>(inf, inf);\n     }\n     if (L <= l && r <= R) {\n       return min_[rt];\n     }\n     int m = (l + r) >> 1;\n     std::pair<int, int> ans(inf, inf);\n     if (L <= m) {\n       ans = std::min(ans, MinInterval(l, m, rt << 1, L, R));\n     }\n     if (R > m) {\n       ans = std::min(ans, MinInterval(m + 1, r, rt << 1 | 1, L, R));\n     }\n     return ans;\n   }\n \n  private:\n   void Build(int l, int r, int rt, int v[]) {\n     if (l == r) {\n       min_[rt].first = v[l];\n       min_[rt].second = l;\n       return;\n     }\n     int m = (l + r) >> 1;\n     Build(l, m, rt << 1, v);\n     Build(m + 1, r, rt << 1 | 1, v);\n     Up(rt);\n   }\n   void Up(int rt) { min_[rt] = std::min(min_[rt << 1], min_[rt << 1 | 1]); }\n   int n_;\n   std::pair<int, int> min_[N << 2 | 1];\n } seg;\n int t;\n int n, m;\n int a[N];\n int b[N];\n std::multiset<int> se[N];\n int pre[N];\n int v[N];\n int main() {\n   scanf('%d', &t);\n   while (t--) {\n     scanf('%d', &n);\n     for (int i = 0; i < n; ++i) {\n       se[i].clear();\n       pre[i] = 0;\n     }\n     for (int i = 1; i <= n; ++i) {\n       scanf('%d%d', &a[i], &b[i]);\n       se[a[i]].insert(b[i]);\n     }\n     if (n == 1) {\n       printf('0\n');\n       continue;\n     }\n     for (int i = 0; i < n; ++i) {\n       pre[i] = (i == 0 ? se[i].size() : pre[i - 1] + se[i].size());\n       v[i] = (se[i].size() ? (*se[i].begin()) : inf);\n     }\n     seg.Init(n - 1, v);\n     int id_st = n - 1;\n     while (id_st >= 0 && pre[id_st] > id_st) {\n       --id_st;\n     }\n     int num = 0;\n     int num_last = 0;\n     int num2 = 0;\n     long long ans = 0ll;\n     while (num < n) {\n       int inc = 0;\n       for (int i = num_last; i <= num; ++i) {\n         if (se[i].size()) {\n           inc += se[i].size();\n           se[i].clear();\n         }\n       }\n       num_last = num + 1;\n       if (inc) {\n         num += inc;\n         continue;\n       } else {\n         while (id_st >= num + 1 && pre[id_st] + num2 > id_st) {\n           --id_st;\n         }\n         std::pair<int, int> x = seg.MinInterval(1, n - 1, 1, id_st + 1, n - 1);\n         ans += x.first;\n         int id = x.second;\n         se[id].erase(se[id].begin());\n         if (se[id].size()) {\n           seg.ChangeSingle(1, n - 1, 1, id, *se[id].begin());\n         } else {\n           seg.ChangeSingle(1, n - 1, 1, id, inf);\n         }\n         ++num2;\n         ++num;\n       }\n     }\n     printf('%lld\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n, k;\n   scanf('%d %d', &n, &k);\n   printf('%d\n', 6 * n * k - k);\n   for (int i = 0; i < n; ++i) {\n     printf('%d %d %d %d\n', 6 * i * k + k, 6 * i * k + 2 * k, 6 * i * k + 3 * k,\n            6 * i * k + 5 * k);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long t, fact[405], inv[405], dp[405][405], ans[405], n, dp2[405];\n long long p;\n long long exp(long long x, long long k) {\n   if (k == 0) return 1;\n   if (k % 2 == 1) return x * exp(x, k - 1) % p;\n   long long y = exp(x, k / 2);\n   return y * y % p;\n }\n int main() {\n   cin >> t >> p;\n   fact[0] = 1;\n   for (int i = 1; i < 405; ++i) {\n     fact[i] = i * fact[i - 1] % p;\n     inv[i] = exp(i, p - 2);\n   }\n   dp[0][0] = 1;\n   for (int i = 0; i <= 399; ++i)\n     for (int k = 1; k <= 400; ++k)\n       for (int j = 0; j <= 400 - k; ++j)\n         dp[j + k][i + 1] = (dp[j + k][i + 1] + fact[k] * dp[j][i]) % p;\n   dp2[1] = dp2[2] = 1;\n   for (int i = 3; i <= 400; ++i) {\n     dp2[i] = fact[i];\n     for (int j = 1; j < i; ++j)\n       dp2[i] = (p + dp2[i] - dp2[j] * fact[i - j] % p) % p;\n   }\n   for (int i = 1; i <= 400; ++i) {\n     ans[i] = fact[i];\n     for (int j = 3; j < i; ++j) ans[i] = (ans[i] + p - dp[i][j] * ans[j]) % p;\n     for (int j = 1; j <= i - 1; ++j)\n       ans[i] = (ans[i] + p - 2 * dp2[j] * fact[i - j] % p) % p;\n     ans[2] = 2;\n   }\n   for (int i = 0; i < t; ++i) {\n     int x;\n     cin >> x;\n     cout << ans[x] << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Amulet {\n   char p[2][2];\n   void Read() { cin >> p[0][0] >> p[0][1] >> p[1][0] >> p[1][1]; }\n   Amulet Rotate() const {\n     Amulet ret(*this);\n     ret.p[0][0] = this->p[0][1];\n     ret.p[0][1] = this->p[1][1];\n     ret.p[1][0] = this->p[0][0];\n     ret.p[1][1] = this->p[1][0];\n     return ret;\n   }\n };\n bool Equiv(Amulet const& a1, Amulet const& a2) {\n   return a1.p[0][0] == a2.p[0][0] && a1.p[0][1] == a2.p[0][1] &&\n          a1.p[1][0] == a2.p[1][0] && a1.p[1][1] == a2.p[1][1];\n }\n bool operator==(Amulet const& a1, Amulet const& a2) {\n   Amulet tmp(a1);\n   for (int i = 0; i < 4; ++i) {\n     if (Equiv(tmp, a2)) return true;\n     tmp = tmp.Rotate();\n   }\n   return false;\n }\n int main() {\n   vector<Amulet> v;\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; ++i) {\n     Amulet a;\n     a.Read();\n     vector<Amulet>::iterator it = find(v.begin(), v.end(), a);\n     if (it == v.end()) {\n       v.push_back(a);\n     }\n     char dummy;\n     cin >> dummy >> dummy;\n   }\n   cout << v.size() << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, k;\n   cin >> n >> k;\n   cout << (n / k + 1) * k;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   string s;\n   cin >> s;\n   set<char> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> 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<vector<int> > 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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   int x;\n   cin >> x;\n   cout << 25;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline void read(T &x) {\n   x = 0;\n   bool f = false;\n   char ch = getchar();\n   while (!isdigit(ch)) {\n     f |= ch == '-', ch = getchar();\n   }\n   while (isdigit(ch)) {\n     x = (x << 1) + (x << 3) + (ch ^ 48);\n     ch = getchar();\n   }\n   x = f ? -x : x;\n   return;\n }\n template <typename T>\n inline void write(T x) {\n   if (x < 0) x = -x, putchar('-');\n   if (x > 9) write(x / 10);\n   putchar(x % 10 ^ 48);\n   return;\n }\n const int N = 1e3 + 5, MOD = 998244353;\n int n, m, val[N], dp[N], Ans, C[N][N];\n int main() {\n   read(n);\n   for (int i = 1; i <= n; i++) read(val[i]), C[i][i] = C[i][0] = 1;\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j < i; j++)\n       C[i][j] = (C[i - 1][j - 1] + C[i - 1][j] > +MOD\n                      ? C[i - 1][j - 1] + C[i - 1][j] - MOD\n                      : C[i - 1][j - 1] + C[i - 1][j]);\n   dp[n + 1] = 1;\n   for (int i = n; i >= 1; i--) {\n     if (val[i] <= 0) continue;\n     for (int j = val[i] + i + 1; j <= n + 1; j++)\n       dp[i] = (dp[i] + 1ll * dp[j] * C[j - i - 1][val[i]] % MOD > +MOD\n                    ? dp[i] + 1ll * dp[j] * C[j - i - 1][val[i]] % MOD - MOD\n                    : dp[i] + 1ll * dp[j] * C[j - i - 1][val[i]] % MOD);\n   }\n   for (int i = 1; i <= n; i++)\n     Ans = (Ans + dp[i] > +MOD ? Ans + dp[i] - MOD : Ans + dp[i]);\n   write(Ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class t>\n t mag(t a) {\n   return a > 0 ? a : -a;\n }\n template <class T, class U>\n T cdiv(T num, U den) {\n   return (num / den) + ((num % den) > 0);\n }\n std::ifstream term('/dev/tty');\n std::string tempstring;\n using ll = int_fast64_t;\n using ii = pair<int, int>;\n using vi = vector<int>;\n using vl = vector<ll>;\n using vii = vector<ii>;\n const int &sij = 400010;\n const ll &mod = 998244353ll;\n int n;\n ll add(ll a, ll b) { return (a + b) % mod; }\n int esc(int tcase) {\n   cin >> n;\n   vi vec(n);\n   for (auto &e : vec) cin >> e;\n   vl dp0(201), sdp0(201), dp1(201), sdp1(201);\n   for (int i = 1; i <= 200; i++) {\n     if (vec.back() == -1 or i == vec.back()) dp0[i] = 1;\n   }\n   partial_sum(dp0.begin(), dp0.end(), sdp0.begin(), add);\n   partial_sum(dp1.begin(), dp1.end(), sdp1.begin(), add);\n   ;\n   auto get0 = [&](int l, int r) -> ll {\n     if (r < l) return 0;\n     return (sdp0[r] - sdp0[l - 1] + mod) % mod;\n   };\n   auto get1 = [&](int l, int r) -> ll {\n     if (r < l) return 0;\n     return (sdp1[r] - sdp1[l - 1] + mod) % mod;\n   };\n   for (auto i = n - 2; i >= 0; i--) {\n     vl ndp0(201), ndp1(201);\n     for (int x = 1; x <= 200; x++) {\n       if (vec[i] == -1 or x == vec[i]) {\n         ndp0[x] = (get0(1, x - 1) + get1(1, x - 1)) % mod;\n         ndp1[x] = (get1(x + 1, 200) + get1(x, x) + get0(x, x)) % mod;\n       }\n     }\n     partial_sum(ndp0.begin(), ndp0.end(), sdp0.begin(), add);\n     partial_sum(ndp1.begin(), ndp1.end(), sdp1.begin(), add);\n     ;\n     ;\n     ;\n   }\n   cout << get1(1, 200) << '\n';\n   return 0;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int tc = 1;\n   for (int i = 1; i <= tc; i++) esc(i);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1 << 28;\n const long long LINF = 1ll << 61;\n inline long long getnum() {\n   register long long r = 0;\n   register bool ng = 0;\n   register char c;\n   c = getchar();\n   while (c != '-' && (c < '0' || c > '9')) c = getchar();\n   if (c == '-') ng = 1, c = getchar();\n   while (c != ' ' && c != '\n') r = r * 10 + c - '0', c = getchar();\n   if (ng) r = -r;\n   return r;\n }\n template <class T>\n inline void putnum(T x) {\n   if (x < 0) putchar('-'), x = -x;\n   register short a[20] = {}, sz = 0;\n   while (x > 0) a[sz++] = x % 10, x /= 10;\n   if (sz == 0) putchar('0');\n   for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);\n }\n inline void putsp() { putchar(' '); }\n inline void putendl() { putchar('\n'); }\n inline char mygetchar() {\n   register char c = getchar();\n   while (c == ' ' || c == '\n') c = getchar();\n   return c;\n }\n const int dx[] = {1, -1, 0, 0};\n const int dy[] = {0, 0, 1, -1};\n const int maxn = 1700;\n int w, h, c[maxn][maxn], ans[12345];\n bool g[maxn][maxn], ng[2][maxn][maxn], vis[maxn][maxn], p;\n void color(int x, int y, int id) {\n   c[x][y] = id;\n   for (int i = 0; i < 4; i++) {\n     int nx = x + dx[i], ny = y + dy[i];\n     if (nx > 0 && nx <= w && ny > 0 && ny <= h && g[nx][ny] && c[nx][ny] == 0) {\n       color(nx, ny, id);\n     }\n   }\n }\n void dfs(int x, int y) {\n   vis[x][y] = 1;\n   for (int i = 0; i < 4; i++) {\n     int nx = x + dx[i], ny = y + dy[i];\n     if (nx > 0 && nx <= w && ny > 0 && ny <= h && g[nx][ny] && !vis[nx][ny]) {\n       dfs(nx, ny);\n     }\n   }\n }\n void getsmaller() {\n   p ^= 1;\n   for (int i = 1; i <= w; i++) {\n     for (int j = 1; j <= h; j++) {\n       ng[p][i][j] = ng[p ^ 1][i][j];\n       for (int k = 0; k < 4; k++) {\n         if (!ng[p ^ 1][i + dx[k]][j + dy[k]]) {\n           ng[p][i][j] = 0;\n         }\n       }\n     }\n   }\n }\n void getbigger() {\n   p ^= 1;\n   for (int i = 1; i <= w; i++) {\n     for (int j = 1; j <= h; j++) {\n       ng[p][i][j] = ng[p ^ 1][i][j];\n       for (int k = 0; k < 4; k++) {\n         if (ng[p ^ 1][i + dx[k]][j + dy[k]]) {\n           ng[p][i][j] = 1;\n         }\n       }\n     }\n   }\n }\n void see() {\n   for (int i = 1; i <= w; i++) {\n     for (int j = 1; j <= h; j++) {\n       putnum(g[i][j] & (!vis[i][j])), putsp();\n     }\n     putendl();\n   }\n   putendl();\n }\n int main() {\n   w = getnum(), h = getnum();\n   for (int i = 1; i <= w; i++) {\n     for (int j = 1; j <= h; j++) {\n       g[i][j] = getnum();\n     }\n   }\n   int id = 0;\n   for (int i = 1; i <= w; i++) {\n     for (int j = 1; j <= h; j++) {\n       if (g[i][j] && c[i][j] == 0) {\n         id++;\n         color(i, j, id);\n       }\n     }\n   }\n   for (int i = 1; i <= w; i++)\n     for (int j = 1; j <= h; j++) ng[p][i][j] = g[i][j];\n   getsmaller();\n   getsmaller();\n   getsmaller();\n   getbigger();\n   getbigger();\n   getbigger();\n   getbigger();\n   getbigger();\n   for (int i = 1; i <= w; i++) {\n     for (int j = 1; j <= h; j++) {\n       g[i][j] &= !ng[p][i][j];\n     }\n   }\n   for (int i = 1; i <= w; i++)\n     for (int j = 1; j <= h; j++) ng[p][i][j] = g[i][j];\n   getsmaller();\n   getbigger();\n   for (int i = 1; i <= w; i++)\n     for (int j = 1; j <= h; j++) g[i][j] = ng[p][i][j];\n   for (int i = 1; i <= w; i++) {\n     for (int j = 1; j <= h; j++) {\n       if (g[i][j] && !vis[i][j]) {\n         ans[c[i][j]]++;\n         dfs(i, j);\n       }\n     }\n   }\n   sort(ans + 1, ans + id + 1);\n   putnum(id), putsp(), putendl();\n   for (int i = 1; i <= id; i++) putnum(ans[i]), putsp();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n class Solve {\n  public:\n   int num;\n   int inputNum[2005];\n   int inversion[2005][2];\n   int sequence[2005];\n \n  public:\n   Solve() {\n     num = 0;\n     memset(inputNum, 0, sizeof(inputNum));\n     memset(inversion, 0, sizeof(inversion));\n     memset(sequence, 0, sizeof(sequence));\n   }\n   void stat() {\n     for (int i = 0; i < num; ++i) {\n       for (int j = 0; j < i; ++j) {\n         if (inputNum[j] < inputNum[i]) {\n           ++inversion[i][0];\n         }\n       }\n     }\n     for (int i = 0; i < num; ++i) {\n       for (int j = i + 1; j < num; ++j) {\n         if (inputNum[i] > inputNum[j]) {\n           ++inversion[i][1];\n         }\n       }\n     }\n   }\n   void calculate() {\n     for (int i = 0; i < num; ++i) {\n       if (inversion[i][0] < inversion[i][1]) {\n         sequence[i] = -inputNum[i];\n       } else {\n         sequence[i] = inputNum[i];\n       }\n     }\n   }\n   int getResult() {\n     int total = 0;\n     for (int i = 0; i < num; ++i) {\n       for (int j = i + 1; j < num; ++j) {\n         if (sequence[i] > sequence[j]) {\n           ++total;\n         }\n       }\n     }\n     return total;\n   }\n   void readData() {\n     cin >> num;\n     for (int i = 0; i < num; ++i) {\n       cin >> inputNum[i];\n       if (inputNum[i] < 0) {\n         inputNum[i] = -1 * inputNum[i];\n       }\n     }\n   }\n   int facade() {\n     readData();\n     stat();\n     calculate();\n     return getResult();\n   }\n };\n int main() {\n   Solve solve;\n   cout << solve.facade() << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m, x, y;\n   cin >> n >> m;\n   y = 3 * m;\n   x = 2 * n;\n   for (int i = 6; i <= x && i <= y; i += 6) {\n     if (x <= y)\n       x += 2;\n     else\n       y += 3;\n   }\n   cout << max(x, y);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 505;\n bool arr[N][N];\n int dp[N][N];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int n, m, k;\n   cin >> n >> m >> k;\n   for (int i = 1; i <= n; i++) {\n     string s;\n     cin >> s;\n     for (int j = 1; j <= m; j++) {\n       arr[i][j] = (int)(s[j - 1] - '0');\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= m; j++) {\n       if (arr[i][j] && arr[i - 1][j] && arr[i + 1][j] && arr[i][j - 1] &&\n           arr[i][j + 1]) {\n         dp[i][j] = 1;\n       }\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= m; j++) {\n       dp[i][j] += dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1];\n     }\n   }\n   long long int ans = 0;\n   for (int a = 2; a < n; a++) {\n     for (int b = a; b < n; b++) {\n       int ptr = 1;\n       for (int c = 2; c < m; c++) {\n         while (ptr < m &&\n                (dp[a - 1][c - 1] - dp[b][c - 1] - dp[a - 1][ptr] + dp[b][ptr] <\n                 k)) {\n           ptr++;\n         }\n         ans += (m - ptr);\n       }\n     }\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n static long long mi[400005][20];\n static bool mark[400005][20];\n static long long psum[400005];\n long long f(int x, int k) {\n   if (k == 0) return psum[x];\n   if (mark[x][k]) return mi[x][k];\n   mark[x][k] = 1;\n   return mi[x][k] = min(f(x, k - 1), f(x + (1 << (k - 1)), k - 1));\n }\n long long qry(int l, int r) {\n   int t = r - l + 1;\n   int lg = 31 - __builtin_clz(t);\n   return min(f(l, lg), f(r - (1 << lg) + 1, lg));\n }\n int main() {\n   long long n, a, b, c, d, start, len;\n   scanf('%lld %lld %lld %lld %lld %lld %lld', &n, &a, &b, &c, &d, &start, &len);\n   vector<pair<long long, long long> > v;\n   for (long long i = 0; i < n; i++) {\n     long long x, y;\n     scanf('%lld %lld', &x, &y);\n     v.push_back(make_pair(y, x));\n   }\n   if (v[0].first == 0)\n     psum[0] = -d;\n   else\n     psum[0] = c;\n   for (int i = 1; i < n; i++) {\n     if (v[i].first)\n       psum[i] = psum[i - 1] + c;\n     else\n       psum[i] = psum[i - 1] - d;\n   }\n   psum[n] = 1000000000000000000;\n   vector<long long> t;\n   t.push_back(0);\n   for (int i = 0; i < n; i++) {\n     t.push_back(v[i].second + 1);\n     if (v[i].second - len + 1 >= 0) t.push_back(v[i].second - len + 1);\n   }\n   sort(t.begin(), t.end());\n   int l = 0, r = 0;\n   long long at = start;\n   for (int i = 0; i < t.size(); i++) {\n     while (l < v.size() && v[l].second < t[i]) {\n       if (v[l].first)\n         at += a;\n       else\n         at -= b;\n       if (at < 0) {\n         printf('-1\n');\n         return 0;\n       }\n       l++;\n     }\n     while (r < v.size() && v[r].second < t[i] + len) r++;\n     long long low = qry(l, r - 1) - (l > 0 ? psum[l - 1] : 0) + at;\n     if (low >= 0) {\n       printf('%lld\n', t[i]);\n       return 0;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int get() {\n   char ch;\n   while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-')\n     ;\n   if (ch == '-') {\n     int s = 0;\n     while (ch = getchar(), ch >= '0' && ch <= '9') s = s * 10 + ch - '0';\n     return -s;\n   }\n   int s = ch - '0';\n   while (ch = getchar(), ch >= '0' && ch <= '9') s = s * 10 + ch - '0';\n   return s;\n }\n const int mo = 1e9 + 7;\n const int N = 2e6 + 5;\n int cnt[N];\n int val[N];\n int lst[N];\n int pri[N], k;\n int n;\n int tim[N];\n bool bz[N];\n int main() {\n   n = get();\n   for (int i = 1; i <= n; i++) {\n     int x = get();\n     cnt[x]++;\n   }\n   lst[1] = 1;\n   for (int i = 2; i <= 2e6; i++) {\n     if (!lst[i]) pri[++k] = lst[i] = i;\n     for (int j = 1; j <= k; j++) {\n       if (1ll * pri[j] * i > 2e6) break;\n       lst[i * pri[j]] = pri[j];\n       if (i % pri[j] == 0) break;\n     }\n   }\n   for (int i = 1; i <= 2e6; i++) val[i] = 1;\n   int C = 0;\n   for (int i = 2e6; i >= 2; i--) {\n     for (int T = 1; T <= cnt[i]; T++) {\n       if (val[i] < i)\n         bz[i] = 1, tim[i] = 1, val[i] = i;\n       else {\n         bz[i - 1] = 1;\n         int x = i - 1;\n         while (x > 1) {\n           int v = lst[x];\n           int t = 1;\n           while (x % v == 0) {\n             x /= v;\n             t = t * v;\n           }\n           if (t > val[v]) {\n             val[v] = t;\n             tim[v] = 1;\n           } else if (val[v] == t)\n             tim[v]++;\n         }\n       }\n     }\n   }\n   for (int i = 1; i <= 2e6; i++)\n     if (bz[i]) {\n       bool can = 1;\n       for (int x = i; x > 1;) {\n         int v = lst[x], t = 1;\n         for (; x % v == 0;) x /= v, t *= v;\n         if (val[v] == t && tim[v] == 1) can = 0;\n       }\n       if (can) {\n         C = 1;\n         break;\n       }\n     }\n   int ans = 1;\n   for (int i = 1; i <= 2e6; i++) ans = 1ll * ans * val[i] % mo;\n   ans = (ans + C) % mo;\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool vis[50];\n bool OK(vector<set<int> > v) {\n   for (int i = 0; i < (int)v.size(); i++)\n     if ((int)v[i].size() > 3) return 1;\n   return 0;\n }\n int Find(vector<set<int> > v, int x) {\n   for (int i = 0; i < (int)v.size(); i++)\n     if (find(v[i].begin(), v[i].end(), x) != v[i].end()) return i;\n   return -1;\n }\n int main() {\n   int n, q, x, y, ex, ey, c = 0;\n   scanf('%d %d', &n, &q);\n   if (n % 3) {\n     cout << -1;\n     return 0;\n   }\n   vector<set<int> > v(n / 3);\n   while (q--) {\n     scanf('%d %d', &x, &y);\n     vis[x] = 1, vis[y] = 1;\n     ex = Find(v, x), ey = Find(v, y);\n     if (ex != -1)\n       v[ex].insert(y);\n     else if (ey != -1)\n       v[ey].insert(x);\n     else {\n       if (c == n / 3) {\n         cout << -1;\n         return 0;\n       }\n       v[c].insert(x), v[c].insert(y), c++;\n     }\n   }\n   if (OK(v)) {\n     cout << -1;\n     return 0;\n   }\n   c = 1;\n   for (int i = 0; i < (int)v.size(); i++) {\n     for (int j = 0; j < 3 - (int)v[i].size(); j++) {\n       for (int k = c; k < n + 1; k++)\n         if (!vis[k]) {\n           v[i].insert(k);\n           c = k + 1;\n           j--;\n           break;\n         }\n     }\n   }\n   for (int i = 0; i < (int)v.size(); i++) {\n     for (set<int>::iterator it = v[i].begin(); it != v[i].end(); it++)\n       printf('%d ', *it);\n     printf('\n');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long w1, h1, w2, h2;\n   cin >> w1 >> h1 >> w2 >> h2;\n   long long ans = h1 + h2 + 2;\n   ans += h1 + h2 + 2 + (w1 - w2);\n   ans += w1 + w2;\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100005;\n vector<int> cnt[N];\n int res[N];\n int main() {\n   int n;\n   while (cin >> n) {\n     for (int i = 1; i < N; i++) cnt[i].clear();\n     for (int i = 1; i <= n; i++) {\n       int v;\n       cin >> v;\n       cnt[v].push_back(i);\n     }\n     bool ok = true;\n     for (int i = 1; i < N; i++) {\n       if (i > 1 && cnt[i].size() > cnt[i - 1].size()) ok = false;\n       for (int j = 0; j < cnt[i].size(); j++) {\n         res[cnt[i][j]] = j + 1;\n       }\n     }\n     if (!ok) {\n       printf('%d\n', -1);\n     } else {\n       printf('%d\n', cnt[1].size());\n       for (int i = 1; i <= n; i++) printf('%d%c', res[i], i == n ? '\n' : ' ');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   while (n--) {\n     int a, s, d;\n     cin >> a >> s >> d;\n     if (a > s) swap(a, s);\n     if (a > d) swap(a, d);\n     if (s > d) swap(s, d);\n     if (s == d) {\n       cout << 'YES' << endl;\n       cout << a << ' ' << a << ' ' << d << endl;\n     } else {\n       cout << 'NO' << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1005;\n const int INF = 1e9;\n pair<int, int> NULLPOINT = make_pair(INF, INF);\n int n;\n int gcd(int x, int y) {\n   while (y) {\n     int t = x;\n     x = y;\n     y = t % y;\n   }\n   return x;\n }\n struct Line {\n   int x, y, xx, yy;\n   pair<int, int> slope() {\n     pair<int, int> ret = {x - xx, y - yy};\n     if (ret.second < 0) {\n       ret.first *= -1;\n       ret.second *= -1;\n     }\n     int g = gcd(abs(ret.first), ret.second);\n     ret.first /= g, ret.second /= g;\n     return ret;\n   }\n   pair<int, int> intersect(const Line &l) const {\n     long long den =\n         1LL * (x - xx) * (l.y - l.yy) - 1LL * (y - yy) * (l.x - l.xx);\n     if (den == 0) return NULLPOINT;\n     long long c1 = 1LL * x * yy - 1LL * y * xx;\n     long long c2 = 1LL * l.x * l.yy - 1LL * l.y * l.xx;\n     long long ix = c1 * (l.x - l.xx) - (x - xx) * c2;\n     long long iy = c1 * (l.y - l.yy) - (y - yy) * c2;\n     if (ix % den != 0) return NULLPOINT;\n     if (iy % den != 0) return NULLPOINT;\n     ix /= den;\n     iy /= den;\n     if (ix < min(x, xx) || ix > max(x, xx) || ix < min(l.x, l.xx) ||\n         ix > max(l.x, l.xx))\n       return NULLPOINT;\n     if (iy < min(y, yy) || iy > max(y, yy) || iy < min(l.y, l.yy) ||\n         iy > max(l.y, l.yy))\n       return NULLPOINT;\n     return pair<int, int>(ix, iy);\n   }\n };\n Line lines[N];\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; ++i) {\n     scanf('%d %d %d %d', &lines[i].x, &lines[i].y, &lines[i].xx, &lines[i].yy);\n   }\n   long long ans = 0;\n   for (int i = 0; i < n; ++i) {\n     pair<int, int> slope = lines[i].slope();\n     if (slope.first == 0)\n       ans += abs((lines[i].y - lines[i].yy) / slope.second) + 1;\n     else\n       ans += abs((lines[i].x - lines[i].xx) / slope.first) + 1;\n   }\n   set<pair<int, int>> intersects;\n   intersects.insert(NULLPOINT);\n   for (int i = 0; i < n; ++i) {\n     set<pair<int, int>> lineIntersects;\n     lineIntersects.insert(NULLPOINT);\n     for (int j = 0; j < n; ++j) {\n       pair<int, int> p = lines[i].intersect(lines[j]);\n       lineIntersects.insert(p);\n       intersects.insert(p);\n     }\n     ans -= lineIntersects.size() - 1;\n   }\n   ans += intersects.size() - 1;\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   long long n, k;\n   scanf('%lld%lld', &n, &k);\n   if (k < 2) {\n     printf('%lld', n);\n     return 0;\n   }\n   long long s = 1;\n   while (s - 1 < n) s *= 2;\n   printf('%lld', s - 1);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   cin.sync_with_stdio(0);\n   cin.tie(0);\n   cin.exceptions(cin.failbit);\n   int n;\n   cin >> n;\n   vector<long long> a(n);\n   long long s = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n     s += a[i];\n   }\n   sort(a.begin(), a.end());\n   reverse(a.begin(), a.end());\n   if (s % 2 == 1) {\n     cout << 'NO' << endl;\n     return 0;\n   }\n   if (a[0] <= s / 2) {\n     cout << 'YES' << endl;\n   } else {\n     cout << 'NO' << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 160;\n const int mod = 1e9 + 7;\n int n, m, f[N][N][2][2], ans;\n void inc(int& a, int b) {\n   if (a += b, a >= mod) a -= mod;\n }\n int main() {\n   scanf('%d %d', &n, &m);\n   for (int i = 1; i <= m; ++i)\n     for (int j = i; j <= m; ++j) {\n       f[i][j][1][1] = 1;\n     }\n   for (int h = 1; h <= n; ++h) {\n     int tot = 0;\n     for (int i = 1; i <= m; ++i)\n       for (int j = 1; j <= m; ++j)\n         for (int kl = 0; kl <= 1; ++kl)\n           for (int kr = 0; kr <= 1; ++kr) {\n             inc(tot, f[i][j][kl][kr]);\n           }\n     inc(ans, (long long)tot * (n + 1 - h) % mod);\n     if (h == n) break;\n     for (int j = 1; j <= m; ++j)\n       for (int i = 1; i < j; ++i)\n         for (int kr = 0; kr <= 1; ++kr) {\n           inc(f[i + 1][j][0][kr], (f[i][j][0][kr] + f[i][j][1][kr]) % mod);\n         }\n     for (int i = 1; i <= m; ++i)\n       for (int j = m; j > i; --j)\n         for (int kl = 0; kl <= 1; ++kl) {\n           inc(f[i][j - 1][kl][0], (f[i][j][kl][0] + f[i][j][kl][1]) % mod);\n         }\n     for (int j = 2; j <= m; ++j)\n       for (int i = j; i > 1; --i)\n         for (int kr = 0; kr <= 1; ++kr) {\n           inc(f[i - 1][j][1][kr], f[i][j][1][kr]);\n         }\n     for (int i = 1; i <= m - 1; ++i)\n       for (int j = i; j < m; ++j)\n         for (int kl = 0; kl <= 1; ++kl) {\n           inc(f[i][j + 1][kl][1], f[i][j][kl][1]);\n         }\n   }\n   printf('%d\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX_N = 1e5 + 5;\n char a[MAX_N];\n int main() {\n   int N;\n   cin >> N;\n   scanf('%s', a + 1);\n   int cnt = 0;\n   for (int i = 1; i <= N; i++) {\n     if (a[i] == 'S' && a[i] >= 2 && a[i - 1] == 'G') {\n       cnt++;\n     }\n   }\n   if (a[N] == 'G') cnt++;\n   int len = 0, prelen = (cnt >= 2), ans = 0;\n   for (int i = 1; i <= N; i++) {\n     if (a[i] == 'G') {\n       len++;\n       ans = max(ans, len + prelen);\n     }\n     if (a[i] == 'S') {\n       if (2 <= i && i <= N - 1 && a[i - 1] == 'G' && a[i + 1] == 'G') {\n         if (cnt == 2) {\n           prelen = len;\n         } else if (cnt >= 3) {\n           prelen = len + 1;\n         }\n       } else {\n         prelen = (cnt >= 2);\n       }\n       len = 0;\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int t, a[4][200010], len;\n string s;\n bool check(int x) {\n   for (int i = x; i <= len; i++)\n     if (a[1][i] - a[1][i - x] && a[2][i] - a[2][i - x] && a[3][i] - a[3][i - x])\n       return 1;\n   return 0;\n }\n int main() {\n   scanf('%d', &t);\n   while (t--) {\n     cin >> s;\n     len = s.size();\n     s += s[s.size() - 1];\n     for (int i = len; i >= 1; i--) {\n       s[i] = s[i - 1];\n     }\n     int l = 1, r = len;\n     for (int i = 1; i <= len; i++) {\n       if (s[i] == '1') {\n         a[1][i] = a[1][i - 1] + 1;\n         a[2][i] = a[2][i - 1];\n         a[3][i] = a[3][i - 1];\n       }\n       if (s[i] == '2') {\n         a[1][i] = a[1][i - 1];\n         a[2][i] = a[2][i - 1] + 1;\n         a[3][i] = a[3][i - 1];\n       }\n       if (s[i] == '3') {\n         a[1][i] = a[1][i - 1];\n         a[2][i] = a[2][i - 1];\n         a[3][i] = a[3][i - 1] + 1;\n       }\n     }\n     if (!a[1][len] || !a[2][len] || !a[3][len]) {\n       puts('0');\n       continue;\n     }\n     while (l + 1 < r) {\n       int mid = (l + r) >> 1;\n       if (check(mid))\n         r = mid;\n       else\n         l = mid;\n     }\n     cout << r << endl;\n     memset(a, 0, sizeof(a));\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long double EPS = 1e-10;\n const long double INF = (int)1e9 + 34;\n const int N = (int)1e6 + 34;\n void ret(int x) {\n   cout << x;\n   exit(0);\n }\n int n, k;\n int a[N];\n int b[N], len;\n bool u[N];\n int main() {\n   scanf('%d%d', &n, &k);\n   for (int i = 0; i < n; i++) scanf('%d', a + i);\n   srand(3431);\n   sort(a, a + n);\n   a[n] = 100000000;\n   int lst = a[0];\n   b[len++] = a[0];\n   for (int i = 1; i < n; i++)\n     if (a[i + 1] - lst >= k) {\n       b[len++] = lst = a[i];\n     }\n   int mn = a[0];\n   for (int i = 0; i < n; i++) mn = min(mn, a[i]);\n   vector<int> v;\n   for (int i = 0; i < 30; i++) v.push_back(a[abs((rand() << 16) ^ rand()) % n]);\n   for (int i = 1; i <= 1000000; i++)\n     for (int j = 0; !u[i] && j < (int)v.size(); j++)\n       if (v[j] % i > k) u[i] = true;\n   int l1 = -1;\n   int pr;\n   bool fail;\n   for (int d = mn; d >= 0; d--) {\n     if (u[d]) continue;\n     fail = false;\n     for (int i = 0; !fail && i < len; i++)\n       if (b[i] % d > k) fail = true;\n     if (!fail) {\n       pr = d;\n       break;\n     }\n     l1 = d;\n   }\n   for (int d = pr; d >= 0; d--) {\n     if (u[d]) continue;\n     fail = false;\n     for (int i = n - 1; !fail && i >= 0; i--)\n       if (a[i] % d > k) fail = true;\n     if (!fail) {\n       pr = d;\n       break;\n     }\n     l1 = d;\n   }\n   cout << pr;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   long long n, cnt1 = 0, cnt2 = 0, l, r;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> l >> r;\n     cnt1 += l;\n     cnt2 += r;\n   }\n   cout << min(cnt1, n - cnt1) + min(cnt2, n - cnt2);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int Mmax(long long int a, long long int b) {\n   if (a > b) return a;\n   return b;\n }\n long long int Mmin(long long int a, long long int b) {\n   if (a < b) return a;\n   return b;\n }\n long long int nod(long long int a, long long int b) {\n   while (a && b) {\n     if (a > b)\n       a %= b;\n     else\n       b %= a;\n   }\n   return Mmax(a, b);\n }\n long long int nok(long long int a, long long int b) {\n   return a * b / nod(a, b);\n }\n bool IsPrime(long long int x) {\n   if (x < 2) return false;\n   long long int X = sqrt(x), i;\n   for (i = 2; i <= X; i++)\n     if (x % i == 0) return false;\n   return true;\n }\n void hanoi(int n, int A, int C, int B) {\n   if (n == 1) {\n     cout << n << ' ' << A << ' ' << C << endl;\n   } else {\n     hanoi(n - 1, A, B, C);\n     cout << n << ' ' << A << ' ' << C << endl;\n     hanoi(n - 1, B, C, A);\n   }\n }\n string pr2(string a, int d) {\n   if (d == 0) return '0';\n   string b;\n   long long int sz = a.size(), i, prenos = 0;\n   for (i = 0; i < sz; i++) {\n     b[i] = a[i];\n   }\n   for (i = sz - 1; i > -1; i--) {\n     a[i] = ((b[i] - '0') * d + prenos) % 10 + '0';\n     prenos = ((b[i] - '0') * d + prenos) / 10;\n   }\n   if (prenos) a = char(prenos + '0') + a;\n   return a;\n }\n string sum(string a, string b) {\n   bool carry = false;\n   long long int i, sz1, sz2, maxsz, minsz;\n   string c, d;\n   sz1 = a.size();\n   sz2 = b.size();\n   maxsz = max(sz1, sz2);\n   minsz = min(sz1, sz2);\n   while (sz1 < maxsz) {\n     sz1++;\n     a = '0' + a;\n   }\n   while (sz2 < maxsz) {\n     sz2++;\n     b = '0' + b;\n   }\n   for (i = maxsz - 1; i > -1; i--) {\n     d = char((a[i] + b[i] - 96 + carry) % 10 + 48) + d;\n     if (a[i] + b[i] - 96 + carry > 9)\n       carry = true;\n     else\n       carry = false;\n   }\n   if (carry == true) d = char('1') + d;\n   return d;\n }\n string pr(string a, string b) {\n   string res = '0', p, p2;\n   int sz = a.size(), x = 0;\n   for (sz = a.size(); sz > 0; sz--, x++) {\n     int d = a[sz - 1] - '0';\n     a = a.erase(sz - 1, 1);\n     p2 = pr2(b, d);\n     p2 += p;\n     res = sum(res, p2);\n     p += '0';\n   }\n   return res;\n }\n bool vesokosna(long long int x) {\n   return (x % 4 == 0 && x % 100 || x % 400 == 0);\n }\n long long int reverse(long long int x) {\n   long long int mirror = 0;\n   while (x) {\n     mirror = mirror * 10 + x % 10;\n     x /= 10;\n   }\n   return mirror;\n }\n long long int ost(string x, long long int k) {\n   long long int num = 0, i, sz = x.size();\n   for (i = 0; i < sz; i++) {\n     num = num * 10;\n     num += x[i] - '0';\n     num %= k;\n   }\n   return num;\n }\n bool can[128][128];\n vector<string> ans;\n int main() {\n   char last;\n   int k, i, j, sz2 = 1;\n   cin >> k;\n   string q;\n   cin >> q;\n   int sz = q.size();\n   if (sz < k) {\n     cout << 'NO\n';\n     return 0;\n   }\n   string help;\n   help += q[0];\n   ans.push_back(help);\n   last = q[0];\n   for (i = 1; i < sz; i++) {\n     if (sz2 == k) break;\n     bool can = true;\n     ;\n     for (j = 0; j < sz2; j++)\n       if (q[i] == ans[j][0]) can = false;\n     if (can) {\n       string help;\n       help += q[i];\n       last = q[i];\n       ans.push_back(help);\n       sz2++;\n     } else\n       ans.back() += q[i];\n   }\n   if (sz2 == k) {\n     cout << 'YES\n';\n     for (; i < sz; i++) {\n       ans.back() += q[i];\n     }\n     for (i = 0; i < sz2; i++) cout << ans[i] << endl;\n     return 0;\n   }\n   cout << 'NO\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <ostream& out = cout, class... T>\n void prints(T&&...) {}\n template <ostream& out = cout, class... T>\n void printe(T&&...) {}\n template <ostream& out = cout, class... T>\n void printw(T&&...) {}\n template <ostream& out = cout, class... T>\n void printew(T&&...) {}\n template <ostream& out = cout, class... T>\n void printb(T&&...) {}\n template <ostream& out = cout, class... T>\n void printd(T&&...) {}\n template <ostream& out = cout, class... T>\n void printde(T&&...){};\n template <class T>\n istream& operator>>(istream& in, vector<T>& v) {\n   for (auto& e : v) {\n     in >> e;\n   }\n   return in;\n }\n int main() {\n   int n;\n   cin >> n;\n   vector<char> s(n);\n   cin >> s;\n   int k = 0;\n   bool pr;\n   for (int i = 0; i < n; i++) {\n     if (s[i] == '1') {\n       k++;\n       pr = true;\n     } else {\n       break;\n     }\n   }\n   if (k == n) {\n     cout << 'YES';\n     return 0;\n   }\n   int l = 0;\n   for (int i = 0; i < n; i++) {\n     if (s[i] == '0') {\n       l++;\n       pr = false;\n     } else {\n       break;\n     }\n   }\n   if (l == n) {\n     cout << 'YES';\n     return 0;\n   }\n   int m;\n   m = max(l, k);\n   for (int i = 0; i < n; i = i + m) {\n     if (s[i] == '1' && pr) {\n       for (int j = 0; j < m; j++) {\n         if (s[j + i] != '1') {\n           cout << 'NO';\n           return 0;\n         }\n       }\n       pr = false;\n       continue;\n     }\n     if (s[i] == '0' && !pr) {\n       for (int j = 0; j < m; j++) {\n         if (s[j + i] != '0') {\n           cout << 'NO';\n           return 0;\n         }\n       }\n       pr = true;\n       continue;\n     }\n     cout << 'NO';\n     return 0;\n   }\n   cout << 'YES';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int nax = 505;\n int n;\n char grid[nax][nax];\n int cc[nax][nax];\n int cc_size[nax * nax];\n int when_added[nax * nax];\n const int dx[4] = {-1, 1, 0, 0};\n const int dy[4] = {0, 0, -1, 1};\n const char EMPTY = '.';\n bool inside(int x, int y) { return 0 <= min(x, y) && max(x, y) < n; }\n void dfs(int x, int y, int which_cc) {\n   cc[x][y] = which_cc;\n   ++cc_size[which_cc];\n   for (int i = 0; i < 4; ++i) {\n     int x2 = x + dx[i];\n     int y2 = y + dy[i];\n     if (inside(x2, y2) && grid[x2][y2] == EMPTY && cc[x2][y2] == 0)\n       dfs(x2, y2, which_cc);\n   }\n }\n void add(int x, int y, int& answer, int current_time) {\n   if (inside(x, y) && grid[x][y] == EMPTY) {\n     int id = cc[x][y];\n     if (when_added[id] != current_time) {\n       when_added[id] = current_time;\n       answer += cc_size[id];\n     }\n   }\n }\n int main() {\n   int k;\n   scanf('%d%d', &n, &k);\n   for (int i = 0; i < n; ++i) scanf('%s', grid[i]);\n   int how_many_cc = 0;\n   for (int x = 0; x < n; ++x)\n     for (int y = 0; y < n; ++y)\n       if (grid[x][y] == EMPTY && cc[x][y] == 0) dfs(x, y, ++how_many_cc);\n   int cur_time = 1;\n   int best_answer = 0;\n   for (int y_low = 0; y_low + k <= n; ++y_low) {\n     for (int x = 0; x < k; ++x)\n       for (int y = y_low; y < y_low + k; ++y) --cc_size[cc[x][y]];\n     for (int x_low = 0; x_low + k <= n; ++x_low) {\n       int answer = k * k;\n       for (int x = x_low; x < x_low + k; ++x) {\n         add(x, y_low - 1, answer, cur_time);\n         add(x, y_low + k, answer, cur_time);\n       }\n       for (int y = y_low; y < y_low + k; ++y) {\n         add(x_low - 1, y, answer, cur_time);\n         add(x_low + k, y, answer, cur_time);\n       }\n       ++cur_time;\n       best_answer = max(best_answer, answer);\n       if (x_low + k != n) {\n         for (int y = y_low; y < y_low + k; ++y) {\n           ++cc_size[cc[x_low][y]];\n           --cc_size[cc[x_low + k][y]];\n         }\n       }\n     }\n     for (int x = n - k; x < n; ++x)\n       for (int y = y_low; y < y_low + k; ++y) ++cc_size[cc[x][y]];\n   }\n   printf('%d', best_answer);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 1000000000;\n const int maxn = 100010;\n int a[maxn];\n int max(int a, int b) { return a > b ? a : b; }\n int min(int a, int b) { return a > b ? b : a; }\n int main() {\n   int n, l, r, i, j;\n   string s;\n   while (cin >> n) {\n     for (i = 0; i < n; i++) cin >> a[i];\n     cin >> s;\n     l = -inf, r = inf;\n     for (i = 4; i < n; i++) {\n       if (s[i] == '1') {\n         int maxi = -inf;\n         for (j = i; j >= i - 4; j--) {\n           maxi = max(maxi, a[j]);\n         }\n         int cnt = 0;\n         for (j = i; j >= i - 4; j--) {\n           if (s[j] == '0') cnt++;\n         }\n         if (cnt == 4) {\n           l = max(l, maxi + 1);\n         }\n       } else if (s[i] == '0') {\n         int mina = inf;\n         for (j = i; j >= i - 4; j--) {\n           mina = min(mina, a[j]);\n         }\n         int cnt = 0;\n         for (j = i; j >= i - 4; j--) {\n           if (s[j] == '1') cnt++;\n         }\n         if (cnt == 4) {\n           r = min(r, mina - 1);\n         }\n       }\n     }\n     cout << l << ' ' << r << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long i, j, k, n, v[200010], m, a, b, x, y, h, w, l, p, ans, numitor, aux,\n     mini, sum, poz;\n string s1, s2, second;\n char c;\n map<long long, long long> mip;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n >> x;\n   for (long long i = 1; i <= n; i++) {\n     cin >> v[i];\n     if (v[i] < x)\n       v[i] = -1;\n     else if (v[i] > x)\n       v[i] = 1;\n     else {\n       v[i] = 0;\n       poz = i;\n     }\n   }\n   mip[0] = 1;\n   sum = 0;\n   for (long long i = 1; i <= n; i++) {\n     sum += v[i];\n     if (i >= poz) {\n       if (mip.find(sum) != mip.end()) ans += mip[sum];\n       if (mip.find(sum - 1) != mip.end()) ans += mip[sum - 1];\n     } else {\n       mip[sum] += 1;\n       v[i] = sum;\n     }\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 5;\n int n, ex, ey, sx[N], sy[N];\n char s[N];\n inline bool check(int m) {\n   for (int i = 1; i + m - 1 <= n; i++) {\n     int decx = sx[n] - sx[i + m - 1] + sx[i - 1];\n     int decy = sy[n] - sy[i + m - 1] + sy[i - 1];\n     int nedx = ex - decx;\n     int nedy = ey - decy;\n     if (abs(nedx) + abs(nedy) <= m && !(m - abs(nedx) - abs(nedy) & 1))\n       return 1;\n   }\n   return 0;\n }\n int main() {\n   scanf('%d%s%d%d', &n, s + 1, &ex, &ey);\n   for (int i = 1; i <= n; i++) {\n     sx[i] = sx[i - 1] + (s[i] == 'L' ? -1 : (s[i] == 'R' ? 1 : 0));\n     sy[i] = sy[i - 1] + (s[i] == 'D' ? -1 : (s[i] == 'U' ? 1 : 0));\n   }\n   int l = 0, r = n, mid, ans = -1;\n   while (l <= r) {\n     mid = l + r >> 1;\n     if (check(mid)) {\n       ans = mid;\n       r = mid - 1;\n     } else {\n       l = mid + 1;\n     }\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a, b, c, d, i, j, x, y = 0, w, z = 0, e;\n   cin >> a >> b >> c >> d;\n   if (d % c != 0) {\n     cout << 0;\n     return 0;\n   }\n   w = d / c;\n   if (c == d) {\n     if (c >= a && c <= b)\n       cout << 1;\n     else\n       cout << 0;\n     return 0;\n   }\n   for (i = 1; i <= sqrt(w); i++) {\n     if (w % i == 0) {\n       x = w / i;\n       e = 0;\n       for (j = 2; j <= i; j++) {\n         if (i % j == 0 && x % j == 0) {\n           e = 1;\n           break;\n         }\n       }\n       if (e == 0) {\n         if (i * c >= a && i * c <= b && x * c >= a && x * c <= b) y++;\n       }\n     }\n   }\n   cout << y * 2;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 1e6 + 5;\n int tree[4 * MAXN], n, m, a[MAXN], size = 0, less1[MAXN];\n vector<int> del, nums;\n void initialize(int l, int r, int node) {\n   tree[node] = r - l + 1;\n   if (r == l) return;\n   int mid = (l + r) / 2;\n   initialize(l, mid, 2 * node);\n   initialize(mid + 1, r, 2 * node + 1);\n }\n int elim(int node) {\n   while (node >= 1) {\n     tree[node]--;\n     node /= 2;\n   }\n }\n void find(int l, int r, int sum, int node) {\n   if (l == r) {\n     nums[l] = -2;\n     elim(node);\n     return;\n   }\n   int mid = (l + r) / 2;\n   if (tree[2 * node] >= sum)\n     find(l, mid, sum, 2 * node);\n   else\n     find(mid + 1, r, sum - tree[2 * node], 2 * node + 1);\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n >> m;\n   for (int i = 0; i < m; ++i) {\n     cin >> a[i];\n   }\n   for (int i = 0; i < MAXN; ++i) less1[i] = 0;\n   for (int i = 0; i < m - 1; ++i)\n     for (int k = a[i]; k < a[i + 1]; ++k) less1[k] = i + 1;\n   for (int i = a[m - 1]; i < MAXN; ++i) less1[i] = m;\n   for (int i = 0; i < n; ++i) {\n     int x;\n     cin >> x;\n     if (x == -1) {\n       del.push_back(less1[size]);\n       size -= less1[size];\n     } else {\n       nums.push_back(x);\n       size++;\n     }\n   }\n   if (nums.size() == 0) {\n     cout << 'Poor stack!' << endl;\n     return 0;\n   }\n   initialize(0, nums.size() - 1, 1);\n   for (int i = 0; i < del.size(); ++i)\n     for (int j = del[i] - 1; j >= 0; --j) find(0, nums.size() - 1, a[j], 1);\n   int ct = 0;\n   for (int i = 0; i < nums.size(); ++i) {\n     if (nums[i] != -2) {\n       cout << nums[i];\n       ++ct;\n     }\n   }\n   if (ct == 0) cout << 'Poor stack!';\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n const long long INFF = 0x3f3f3f3f3f3f3f3f;\n const double pi = acos(-1.0);\n const double eps = 1e-9;\n const long long mod = 1e9 + 7;\n int read() {\n   int x = 0, f = 1;\n   char ch = getchar();\n   while (ch<'0' | ch> '9') {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') {\n     x = x * 10 + ch - '0';\n     ch = getchar();\n   }\n   return x * f;\n }\n void Out(int aa) {\n   if (aa > 9) Out(aa / 10);\n   putchar(aa % 10 + '0');\n }\n int n, t;\n int f[55], s[55], p[55];\n double dp[55][5005];\n bool check(double mid) {\n   for (int i = n; i >= 1; i--) {\n     for (int j = t + 1; j <= 5000; j++) dp[i + 1][j] = mid;\n     for (int j = 0; j <= t; j++) {\n       double t1 = (dp[i + 1][j + f[i]] + f[i]) * p[i] / 100;\n       double t2 = (dp[i + 1][j + s[i]] + s[i]) * (100 - p[i]) / 100;\n       dp[i][j] = min(mid, t1 + t2);\n     }\n   }\n   return dp[1][0] < mid;\n }\n int main() {\n   n = read(), t = read();\n   for (int i = 1; i <= n; i++) f[i] = read(), s[i] = read(), p[i] = read();\n   double l = 0, r = 1e12;\n   for (int i = 0; i < 100; i++) {\n     double mid = (l + r) / 2;\n     if (check(mid))\n       r = mid;\n     else\n       l = mid;\n   }\n   printf('%.10f\n', l);\n   return 0;\n }\n "}
+{"func_code_string": "#include <iostream>\n #include <vector>\n #include <algorithm>\n \n using namespace std;\n \n #define int long long\n \n void solve() {\n     int n;\n     vector<long long> vect;\n     cin >> n;\n     for (int i = 0; i < n; i++) {\n         long long x;\n         cin >> x;\n         vect.push_back(x);\n     }\n     sort(vect.begin(), vect.end());\n     long long res = 0;\n     long long now = 0;\n     for (int i = n - 2; i >= 0; i--) {\n         res -= now - (n - i - 2) * vect[i];\n         now += vect[i + 1];\n     }\n     cout << res << '\n';\n }\n \n signed main()\n {\n     ios_base::sync_with_stdio(false);\n     cin.tie(nullptr);\n     int t;\n     cin >> t;\n     for (int i = 0; i < t; i++)\n         solve();\n     return 0;\n }\n "}
+{"func_code_string": "\n // Problem : B. Tree Array\n // Contest : Codeforces - Codeforces Round #728 (Div. 1)\n // URL : https://codeforces.com/contest/1540/problem/B\n // Memory Limit : 256 MB\n // Time Limit : 2000 ms\n // Powered by CP Editor (https://github.com/cpeditor/cpeditor)\n \n #include <bits/stdc++.h>\n \n using namespace std;\n \n int N;\n long long pas[205][205];\n const long long MOD = 1e9+7;\n long long cache[205][205];\n vector<int> graph[205];\n int par[205];\n bool vis[205];\n \n long long add(long long a, long long b){\n 	return (a + b) % MOD;\n }\n \n long long mult(long long a, long long b){\n 	return a * b % MOD;\n }\n \n long long qikpow(long long b, long long e){\n 	if(!e){\n 		return 1;\n 	}\n 	long long ret = qikpow(b, e / 2);\n 	ret = mult(ret, ret);\n 	if(e & 1){\n 		ret = mult(ret, b);\n 	}\n 	return ret;\n }\n \n long long sub(long long a, long long b){\n 	return ((a - b) % MOD + MOD ) % MOD;\n }\n \n long long divd(long long a, long long b){\n 	return mult(a, qikpow(b, MOD - 2));\n }\n \n void dfs1(int n){\n 	for(int e : graph[n]){\n 		if(e != par[n]){\n 			par[e] = n;\n 			dfs1(e);\n 		}\n 	}\n }\n \n int dfs2(int n, int p){\n 	int sz = 1;\n 	for(int e : graph[n]){\n 		if(!vis[e] && p != e){\n 			sz += dfs2(e, n);\n 		}\n 	}\n 	return sz;\n }\n \n int main(){\n 	ios::sync_with_stdio(0);\n 	cin.tie(0);\n 	cout.tie(0);\n 	cin >> N;\n 	for(int i = 0; i <= N; i++){\n 		pas[i][0] = 1;\n 		for(int j = 1; j <= i; j++){\n 			pas[i][j] = add(pas[i-1][j], pas[i-1][j-1]);\n 		}\n 	}	\n 	for(int i = 1; i < N; i++){\n 		int a, b;\n 		cin >> a >> b;\n 		graph[a].emplace_back(b);\n 		graph[b].emplace_back(a);\n 	}\n 	long long ans = 0;\n 	for(int n = 1; n <= N; n++){\n 		fill(par, par+1+N, 0);\n 		dfs1(n);\n 		vis[n] = 1;\n 		for(int k = n+1; k <= N; k++){\n 			int cur = k, len = 0;\n 			while(cur != n){\n 				vis[cur] = 1;\n 				len++;\n 				cur = par[cur];\n 			}\n 			cur = k;\n 			for(int t = len; t; t--){\n 				int s = dfs2(cur, 0);\n 				//cout << s << '\n';\n 				long long tot = divd(s, N);\n 				if(t == len){\n 					ans = add(ans, tot);\n 				}\n 				else{\n 					/*\n 					long long p = 1;//qikpow(divd(1, 2), len);					\n 					cout << p << ' ' << pas[len - 1][len - t] << '\n';\n 					p = mult(p, divd(pas[len - 1][len - t], pas[len][len-t]));\n 					cout << n << ' ' << k << ' ' << cur << '\n';\n 					cout << p << ' ' << tot << '\n';\n 					ans = add(ans, mult(p, tot));\n 					*/\n 					//cout << n << ' ' << k << ' ' << cur << '\n';\n 					//cout << tot << '\n';\n 					if(!cache[len][t]){\n 						for(int c = 0; c < t; c++){\n 							cache[len][t] = add(cache[len][t], mult(pas[c+len-t-1][len-t-1], qikpow(divd(1, 2), c+len-t)));\n 							//cout << mult(mult(pas[c+len-t-1][len-t-1], qikpow(divd(1, 2), c+len-t)), tot) << '\n';\n 						}		\n 					}\n 					ans = add(mult(tot, cache[len][t]), ans);\n 					\n 				}\n 				cur = par[cur];\n 			}\n 			cur = k;\n 			while(cur != n){\n 				vis[cur] = 0;\n 				cur = par[cur];\n 			}\n 		}\n 		vis[n] = 0;\n 	}\n 	cout << ans;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int read() {\n   int a = 0;\n   char c = getchar();\n   bool f = 0;\n   while (!isdigit(c)) {\n     f = c == '-';\n     c = getchar();\n   }\n   while (isdigit(c)) {\n     a = a * 10 + c - 48;\n     c = getchar();\n   }\n   return f ? -a : a;\n }\n const int _ = 1e5 + 11;\n vector<int> nxt[_][2];\n int N, C[_], ans;\n long long num;\n void addEd(int a, int b, int c) { nxt[a][c].push_back(b); }\n int deg[_], dst[_], seq[_], cseq;\n unsigned long long arr[_][50];\n void build(int fir) {\n   memset(deg, 0, sizeof(deg));\n   cseq = 0;\n   for (int i = 1; i <= N + 8; ++i) {\n     for (auto t : nxt[i][0]) deg[t] += dst[t] == dst[i];\n     for (auto t : nxt[i][1]) deg[t] += dst[t] == dst[i] + 1;\n   }\n   queue<int> q;\n   q.push(fir);\n   while (!q.empty()) {\n     int t = q.front();\n     q.pop();\n     seq[++cseq] = t;\n     for (int l = 0; l < 2; ++l)\n       for (auto p : nxt[t][l])\n         if (dst[p] == dst[t] + l && !--deg[p]) q.push(p);\n   }\n }\n void solve(int size, vector<int> node, int fir, int mx) {\n   memset(arr, 0, sizeof(arr));\n   for (int i = 0; i < node.size(); ++i)\n     arr[node[i]][i >> 6] |= 1ull << (i & 63);\n   for (int i = 1; i <= cseq; ++i) {\n     int t = seq[i];\n     for (int l = 0; l < 2; ++l)\n       for (auto p : nxt[t][l])\n         if (dst[p] == dst[t] + l)\n           for (int r = 0; r < 50; ++r) arr[p][r] |= arr[t][r];\n   }\n   long long cnt = 0;\n   int val = node.size();\n   for (int i = 1; i <= N && val == node.size(); ++i)\n     if (dst[i] == mx) {\n       int num = 0;\n       for (int j = 0; j < 50; ++j) {\n         num += __builtin_popcountll(arr[i][j]);\n       }\n       val = min(val, num);\n     }\n   if (val == node.size()) --mx;\n   for (int i = 1; i <= N; ++i)\n     if (dst[i] > mx)\n       cnt += node.size();\n     else if (dst[i] == mx) {\n       int num = 0;\n       for (int j = 0; j < 50; ++j) {\n         num += __builtin_popcountll(arr[i][j]);\n       }\n       cnt += node.size() - num;\n     }\n   if (ans < mx) {\n     ans = mx;\n     num = 0;\n   }\n   if (ans == mx) num += cnt;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin >> N;\n   for (int i = 1; i <= N; ++i) {\n     char c;\n     cin >> c;\n     C[i] = c - 'a' + 1;\n     addEd(i, N + C[i], 0);\n     addEd(N + C[i], i, 1);\n   }\n   for (int i = 2; i <= N; ++i) {\n     addEd(i - 1, i, 1);\n     addEd(i, i - 1, 1);\n   }\n   for (int i = 1; i <= 8; ++i) {\n     memset(dst, 0x3f, sizeof(dst));\n     dst[N + i] = 0;\n     deque<int> q;\n     q.push_back(N + i);\n     int mx = 0;\n     while (!q.empty()) {\n       int t = q.front();\n       q.pop_front();\n       if (t <= N) mx = max(mx, dst[t]);\n       for (auto r : nxt[t][0])\n         if (dst[r] > dst[t]) {\n           dst[r] = dst[t];\n           q.push_front(r);\n         }\n       for (auto r : nxt[t][1])\n         if (dst[r] > dst[t] + 1) {\n           dst[r] = dst[t] + 1;\n           q.push_back(r);\n         }\n     }\n     vector<int> node;\n     build(N + i);\n     for (int j = 1; j <= N; ++j)\n       if (C[j] == i) {\n         node.push_back(j);\n         if (node.size() == 64 * 50) {\n           solve(64 * 50, node, N + i, mx);\n           node.clear();\n         }\n       }\n     if (node.size()) solve(node.size(), node, N + i, mx);\n   }\n   cout << ans << ' ' << num / 2;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int64_t ans, n, k, m, r[100005];\n char s[100005], t[100005];\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int64_t tt;\n   cin >> tt;\n   while (tt--) {\n     cin >> n;\n     cin >> s;\n     cin >> t;\n     vector<int> ans;\n     m = n - 1;\n     int i = 0, j = n - 1;\n     while (i < j) {\n       r[m--] = i;\n       i++;\n       r[m--] = j;\n       j--;\n     }\n     if (i == j) r[m] = i;\n     m = 0;\n     for (int i = n - 1; i >= 0; i--) {\n       if ((s[r[i]] - '0' + m) % 2 == t[i] - '0') ans.push_back(1);\n       ans.push_back(i + 1);\n       m++;\n     }\n     cout << (int)ans.size() << ' ';\n     for (auto i : ans) cout << i << ' ';\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> a;\n int k, t, n, mx;\n string s;\n int main() {\n   cin >> n >> k;\n   cin >> s;\n   for (int i = 0; i < s.size(); i++)\n     if (s[i] == '.') a.push_back(i);\n   for (int i = 0; i < a.size() - 1; i++) mx = max(mx, a[i + 1] - a[i]);\n   if (mx > k)\n     cout << 'NO';\n   else\n     cout << 'YES';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int w;\n long long n, k;\n pair<long long, long long> o = {0, 0};\n pair<long long, long long> csop(long long kezd, long long kim) {\n   long long sum = 0, kov = kezd + k;\n   if (kezd <= kim && kim <= kov) {\n     kov++;\n   }\n   sum = (kov - kezd) * (kov - kezd - 1) / 2;\n   if (log(k) + log(kezd) < 42.0) {\n     sum += kezd * (kov - kezd);\n   } else {\n     sum = 2e18;\n   }\n   if (kezd <= kim && kim < kov) {\n     sum -= kim;\n   }\n   return {sum, kov};\n }\n pair<long long, long long> calc(long long ert) {\n   if (ert <= k * (k + 1) / 2) {\n     return {1, k * (k + 1) / 2};\n   }\n   long long kis = ert / k - k / 2;\n   auto s = calc(kis);\n   long long fi = s.first, se = s.second;\n   long long s2 = kis, kor = 0, ert2 = 0;\n   s2 -= (fi - 1) * (k + 1), kor += fi - 1, ert2 = (fi - 1) * (k + 1);\n   long long ss = (s2 + k - 2) / k;\n   kor += ss, ert2 += ss * k;\n   ert2++, kor++;\n   if (ert2 >= se) {\n     ert2++;\n   }\n   auto cs = csop(ert2, se);\n   if (cs.first < ert) {\n     ert2 = cs.second, kor++;\n     cs = csop(ert2, se);\n   }\n   return {kor, cs.first};\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin >> w;\n   while (w--) {\n     cin >> n >> k;\n     if (n <= k) {\n       cout << n << '\n';\n       continue;\n     }\n     if (k == 2 && n <= 5) {\n       cout << n << '\n';\n       continue;\n     }\n     auto s = calc(n);\n     if (s.second == n) {\n       cout << s.first * (k + 1) << '\n';\n     } else {\n       long long fi = s.first, ans = fi * (k + 1);\n       n -= fi * (k + 1) - 1;\n       ans += (k + 1) * (n / k) + n % k;\n       if (n % k == 0) {\n         ans--;\n       }\n       cout << ans << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int cl[5000010], cr[5000010], ld[5000010], sl = 1;\n bool yz[5000010];\n void pushd(int x) {\n   if (cl[x] == 0) {\n     cl[x] = ++sl;\n     yz[cl[x]] = 1;\n   }\n   if (cr[x] == 0) {\n     cr[x] = ++sl;\n     yz[cr[x]] = 1;\n   }\n   yz[x] = 0;\n   if (ld[x] == 0) return;\n   ld[cl[x]] = ld[cr[x]] = ld[x];\n   ld[x] = 0;\n }\n vector<int> cf[50010], ve[5000010];\n void addqj(int i, long long l, long long r, long long L, long long R, int x) {\n   if (R <= l || r <= L) return;\n   if (L <= l && r <= R) {\n     ld[i] = x;\n     cf[x].push_back(i);\n     return;\n   }\n   long long m = (l + r) >> 1;\n   pushd(i);\n   addqj(cl[i], l, m, L, R, x);\n   addqj(cr[i], m, r, L, R, x);\n }\n void link(int x, int y) {\n   if (yz[x] && yz[y]) {\n     if (ld[x] < ld[y])\n       ve[x].push_back(y);\n     else\n       ve[y].push_back(x);\n     return;\n   }\n   link(yz[x] ? x : cl[x], yz[y] ? y : cl[y]);\n   link(yz[x] ? x : cr[x], yz[y] ? y : cr[y]);\n }\n int find(int i, long long l, long long r, long long x) {\n   if (yz[i]) return i;\n   long long m = (l + r) >> 1;\n   return x < m ? find(cl[i], l, m, x) : find(cr[i], m, r, x);\n }\n int lx[50010], fa[5000010], ans[50010];\n long long A[50010], B[50010];\n int getv(int x) { return x == fa[x] ? x : fa[x] = getv(fa[x]); }\n void merge(int x, int y) {\n   x = getv(x);\n   y = getv(y);\n   if (x != y) fa[x] = y;\n }\n int main() {\n   int n, m;\n   scanf('%d%d', &n, &m);\n   ld[1] = m + 1;\n   yz[1] = 1;\n   for (int i = 1; i <= m; i++) {\n     char zf[10];\n     scanf('%s%lld%lld', zf, &A[i], &B[i]);\n     lx[i] = zf[0] == 'b' ? 0 : 1;\n     if (lx[i] == 0) addqj(1, 0, (1ll << n), A[i], B[i] + 1, i);\n   }\n   for (int i = 1; i <= sl; i++) {\n     fa[i] = i;\n     if (!yz[i]) link(cl[i], cr[i]);\n   }\n   for (int i = 1; i <= sl; i++) {\n     if (ld[i] != m + 1) continue;\n     for (int j = 0; j < ve[i].size(); j++) merge(i, ve[i][j]);\n   }\n   for (int i = m; i >= 1; i--) {\n     if (lx[i])\n       ans[i] = (getv(find(1, 0, (1ll << n), A[i])) ==\n                 getv(find(1, 0, (1ll << n), B[i])));\n     else {\n       for (int x = 0; x < cf[i].size(); x++) {\n         int u = cf[i][x];\n         for (int y = 0; y < ve[u].size(); y++) merge(u, ve[u][y]);\n       }\n     }\n   }\n   for (int i = 1; i <= m; i++) {\n     if (lx[i]) printf('%d\n', ans[i]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 15;\n long long Get_Num(int num[], int b, int n) {\n   long long number = 0;\n   long long in = 1;\n   for (int i = n - 1; i >= 0; i--) {\n     number += num[i] * in;\n     in = in * b;\n   }\n   return number;\n }\n int main() {\n   int x[N], y[N];\n   int b;\n   int n;\n   long long X, Y;\n   cin >> n >> b;\n   for (int i = 0; i < n; i++) {\n     cin >> x[i];\n   }\n   X = Get_Num(x, b, n);\n   cin >> n >> b;\n   for (int i = 0; i < n; i++) {\n     cin >> y[i];\n   }\n   Y = Get_Num(y, b, n);\n   if (X == Y) {\n     printf('=\n');\n   } else if (X > Y) {\n     printf('>\n');\n   } else {\n     printf('<\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     long n, m;\n     cin >> n >> m;\n     long sum = 0;\n     if (n == 1 || n == 2) {\n       if (n == 1)\n         cout << 0 << endl;\n       else\n         cout << m << endl;\n     } else {\n       cout << 2 * m << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n long long n, m;\n int k;\n int mpow(int a, long long b) {\n   int c = 1;\n   for (; b; b >>= 1, a = 1ll * a * a % mod)\n     if (b & 1) c = 1ll * c * a % mod;\n   return c;\n }\n int main() {\n   scanf('%lld%lld%d', &n, &m, &k);\n   if ((n + m) & 1)\n     if (k == -1) {\n       printf('0\n');\n       return 0;\n     }\n   int tmp = mpow(2, n - 1);\n   printf('%d\n', mpow(tmp, m - 1));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int tt(char p) {\n   int s;\n   if (p == '>')\n     s = 8;\n   else if (p == '<')\n     s = 9;\n   else if (p == '+')\n     s = 10;\n   else if (p == '-')\n     s = 11;\n   else if (p == '.')\n     s = 12;\n   else if (p == ',')\n     s = 13;\n   else if (p == '[')\n     s = 14;\n   else\n     s = 15;\n   return s;\n }\n int main() {\n   string x;\n   int t = 0;\n   int q = x.length() - 1;\n   cin >> x;\n   for (int i = 0; i < x.length(); ++i) {\n     t = (t * 16 + tt(x[i])) % 1000003;\n   }\n   cout << t;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n template <typename T>\n inline T MIN(T a, T b) {\n   return a < b ? a : b;\n }\n template <typename T>\n inline T MAX(T a, T b) {\n   return a > b ? a : b;\n }\n using namespace std;\n void reop() { freopen('input.txt', 'r', stdin); }\n int a[100001] = {0};\n int ans = 0, curans = 0;\n bool test(int div, int n, int start) {\n   int prev = start;\n   for (int i = 2; i < n; ++i) {\n     if (a[i] == prev + div)\n       prev = a[i];\n     else if (a[i] + 1 == prev + div) {\n       prev = a[i] + 1;\n       curans++;\n     } else if (a[i] - 1 == prev + div) {\n       prev = a[i] - 1;\n       curans++;\n     } else\n       return false;\n   }\n   ans = MIN(ans, curans);\n   return true;\n }\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   if (n == 1 || n == 2) {\n     cout << 0;\n     return 0;\n   }\n   ans = 1000000007;\n   for (int i = -1; i <= 1; ++i) {\n     for (int j = -1; j <= 1; ++j) {\n       curans = 0;\n       int div = a[1] + j - (a[0] + i);\n       if (j) curans++;\n       if (i) curans++;\n       test(div, n, a[1] + j);\n     }\n   }\n   cout << (ans == 1000000007 ? -1 : ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n #define int long long\n #define pii pair<int,int>\n #define F first\n #define S second\n #define pi acos(-1.0)\n #define pb push_back\n #define sf(x) scanf('%lld',&x)\n #define pf(x) printf('%lld',&x)\n using namespace std;\n const int mod=1e9+7;\n int a1[2000],ar[2000],ff[2000] ;\n map<int,int>mp,mk ;\n int bigmod(int a , int b)\n {\n     if(b==0) return 1 ;\n     int x = bigmod(a,b/2) ;\n     x=((x%mod)*(x%mod))%mod ;\n     if(b%2) x=((x%mod)*(a%mod))%mod ;\n     return x ;\n }\n int ncr(int a , int b)\n {\n     int p=(ff[a-b]*ff[b])%mod ;\n     p=(ff[a]*bigmod(p,mod-2)) ; p%=mod ;\n     return p ;\n }\n int32_t main()\n {\n     ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ;\n     ff[0]=1 ; ff[1]=1 ;\n     for(int i = 2 ; i <= 1000 ; i++) ff[i]=(ff[i-1]*i)%mod ;\n     int t ; cin>>t ;\n     while(t--)\n     {\n         int n,k,mx=0 ; cin>>n>>k ; mp.clear() ; mk.clear() ;\n         set<int>st ;\n         for(int i = 1 ; i <= n ; i++){cin>>ar[i] ; mp[ar[i]]++ ; a1[i]=ar[i] ; }\n         sort(a1+1,a1+n+1) ; reverse(a1+1,a1+n+1) ;\n        // for(int i = 1 ; i <= n ; i++) cout<<a1[i]<<' ' ; cout<<endl ;\n         for(int i = 1 ; i <= k ; i++) {mx+=a1[i] ; st.insert(a1[i]) ; mk[a1[i]]++ ;}\n         int ans=1 ;\n         for(int x : st)\n         {\n             int p=mp[x],q=mk[x] ;\n           //  cout<<x<<' '<<p<<' '<<q<<endl ;\n             ans*=ncr(p,q); ans%=mod ;\n         }\n         cout<<ans<<endl ;\n     }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 2, M = 1e9 + 7;\n int tt = 1, n, k;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> tt;\n   while (tt--) {\n     cin >> n;\n     if (n == 1) {\n       cout << 'a\n';\n       continue;\n     }\n     string second = '', ans = '';\n     for (int i = 0; i < n / 2 - 1; i++) second += 'a';\n     ans += 'a' + second + 'b' + second;\n     if (n & 1) ans += 'c';\n     cout << ans << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 2e5 + 7;\n const long long inf = 1e17 + 7;\n pair<long long, long long> a[maxn];\n pair<long long, long long> A[maxn];\n pair<pair<long long, long long>, pair<long long, long long> > S[maxn];\n int pos;\n inline long long elf(pair<long long, long long> z, long long x) {\n   return z.first * x + z.second;\n }\n inline long long earl(pair<long long, long long> z, long long v) {\n   long long a = z.first, b = z.second;\n   long long x = (v - b) / a;\n   if (a * x >= v - b) return x;\n   return x + 1;\n }\n inline long double intx(pair<long long, long long> l1,\n                         pair<long long, long long> l2) {\n   long long a1 = l1.first, a2 = l2.first, b1 = l1.second, b2 = l2.second;\n   return (long double)(b2 - b1) / (long double)(a1 - a2);\n }\n void ins(long long a, long long b) {\n   while (pos >= 2 && intx(S[pos].first, S[pos - 1].first) >=\n                          intx(make_pair(a, b), S[pos].first))\n     pos--;\n   S[pos].second.second = ceil(intx(S[pos].first, make_pair(a, b))) - 1;\n   pos++;\n   S[pos] =\n       make_pair(make_pair(a, b),\n                 make_pair(ceil(intx(S[pos - 1].first, make_pair(a, b))), inf));\n }\n int main() {\n   int n;\n   long long s;\n   scanf('%d %lld', &n, &s);\n   for (int i = 1; i <= n; i++) {\n     scanf('%lld %lld', &a[i].first, &a[i].second);\n   }\n   sort(a + 1, a + n + 1);\n   a[0].first = -1;\n   long long cur = -1;\n   long long best = inf;\n   int idx = 0;\n   for (int i = n; i >= 0; i--) {\n     if (a[i].first != cur) {\n       if (cur > 0) {\n         idx++;\n         A[idx] = make_pair(cur, best);\n       }\n       cur = a[i].first;\n       best = inf;\n     }\n     best = min(best, a[i].second);\n   }\n   n = idx;\n   for (int i = 1; i <= n; i++) a[i] = A[i];\n   best = inf;\n   idx = 0;\n   for (int i = 1; i <= n; i++) {\n     if (a[i].second >= best) continue;\n     idx++;\n     A[idx] = a[i];\n     best = min(best, a[i].second);\n   }\n   n = idx;\n   reverse(A + 1, A + n + 1);\n   long long ans = inf;\n   pos = 1;\n   S[pos] = make_pair(make_pair(A[1].first, 0), make_pair(0, inf));\n   int fp = 1;\n   for (int i = 2; i <= n; i++) {\n     while (fp < pos && elf(S[fp].first, S[fp].second.second) < A[i].second)\n       fp++;\n     long long cx = earl(S[fp].first, A[i].second);\n     long long fcx = elf(S[fp].first, cx);\n     ins(A[i].first, fcx - A[i].second - A[i].first * cx);\n     fp = min(fp, pos);\n   }\n   for (int i = 1; i <= pos; i++) {\n     ans = min(ans, earl(S[i].first, s));\n   }\n   printf('%lld\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 3;\n const long long int M = 1000000007;\n void solve() {\n   string s;\n   cin >> s;\n   int n = s.length();\n   for (int i = 0; i < n - 1; ++i) {\n     s += '0';\n   }\n   long long int ans = 0;\n   for (int i = 0; i < 2 * (n - 1) + 1; ++i) {\n     ans += ans + s[i] - '0';\n     ans %= M;\n   }\n   cout << ans;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   solve(), cout << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct like {\n   int id;\n   int change = 0;\n };\n int main() {\n   int n, s, max = 0, idmax = 0, count = 0, k = 0;\n   cin >> n;\n   like *A = new like[n];\n   for (int i = 0; i < n; i++) {\n     cin >> s;\n     k = 1;\n     for (int j = 0; j < count; j++) {\n       if (A[j].id == s) {\n         A[j].change++;\n         k = 0;\n         if (A[j].change > max) {\n           max = A[j].change;\n           idmax = A[j].id;\n         }\n       }\n     }\n     if (k == 1) {\n       A[count].id = s;\n       A[count].change++;\n       if (A[count].change > max) {\n         max = A[count].change;\n         idmax = A[count].id;\n       }\n       count++;\n     }\n   }\n   cout << idmax << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int H[100000][5], V[100000][5];\n long long dp[32];\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int n, m;\n   cin >> n >> m;\n   for (int i = 1; i < m; ++i)\n     for (int j = 0; j < n; ++j) cin >> H[i][j];\n   for (int i = 0; i < m; ++i)\n     for (int j = 0; j < n; ++j) cin >> V[i][j];\n   for (int i = 1; i < (1 << n); ++i) dp[i] = 1e18;\n   const int sz = 1 << n;\n   for (int i = 1; i < m; ++i) {\n     for (int j = 0; j < sz; ++j) {\n       for (int k = 0; k < n; ++k) {\n         if (!(j & (1 << k))) {\n           auto &t = dp[j | (1 << k)];\n           const auto &nt = dp[j] + H[i][k];\n           if (nt < t) t = nt;\n         }\n       }\n       for (int k = 0; k < n; ++k) {\n         if ((((j >> k)) ^ ((j >> ((k + 1) % n)))) & 1) dp[j] += V[i][k];\n       }\n     }\n   }\n   cout << dp[sz - 1] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int arr[100000], arr1[100000], arr2[100000];\n int main() {\n   int n, flag = 0;\n   cin >> n;\n   multiset<long long int> m;\n   multiset<long long int>::iterator it;\n   for (int i = 0; i < n; i++) {\n     cin >> arr[i];\n     m.insert(arr[i]);\n     if (i == 0)\n       arr1[i] = arr[i];\n     else\n       arr1[i] = arr1[i - 1] + arr[i];\n   }\n   for (int i = n - 1; i >= 0; i--) {\n     if (i == n - 1)\n       arr2[n - 1 - i] = arr[i];\n     else\n       arr2[n - 1 - i] = arr2[n - 2 - i] + arr[i];\n   }\n   if (arr1[n - 1] % 2 != 0)\n     cout << 'NO';\n   else {\n     long long int sum = arr1[n - 1] / 2;\n     it = m.find(arr[0]);\n     m.erase(it);\n     if (arr1[0] == sum || arr2[0] == sum) flag = 1;\n     if (!flag) {\n       for (int i = 1; i < n - 1; i++) {\n         if (m.find(sum - arr1[i - 1]) != m.end()) {\n           flag = 1;\n           break;\n         }\n         if (!flag) {\n           int low = i + 1, high = n - 1;\n           while (low < high) {\n             int mid = low + (high - low + 1) / 2;\n             if (arr1[mid] - arr1[i] + arr1[i - 1] > sum)\n               high = mid - 1;\n             else\n               low = mid;\n           }\n           if (arr1[low] - arr1[i] + arr1[i - 1] == sum) {\n             flag = 1;\n             break;\n           }\n         }\n         it = m.find(arr[i]);\n         m.erase(it);\n       }\n     }\n     m.clear();\n     if (!flag) {\n       for (int i = 0; i < n; i++) m.insert(arr[i]);\n       it = m.find(arr[n - 1]);\n       m.erase(it);\n       for (int i = 1; i < n - 1; i++) {\n         if (m.find(sum - arr2[i - 1]) != m.end()) {\n           flag = 1;\n           break;\n         }\n         int low = i + 1, high = n - 1;\n         while (low < high) {\n           int mid = low + (high - low + 1) / 2;\n           if (arr2[mid] - arr2[i] + arr2[i - 1] > sum)\n             high = mid - 1;\n           else\n             low = mid;\n         }\n         if (arr2[low] - arr2[i] + arr2[i - 1] == sum) {\n           flag = 1;\n           cout << i << endl;\n           break;\n         }\n         it = m.find(arr[n - 1 - i]);\n         m.erase(it);\n       }\n     }\n     if (flag)\n       cout << 'YES';\n     else\n       cout << 'NO';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n const ll MOD = 1e9 + 7;\n void dfs(int node, vector<vector<pair<int, int>>>& adj, vector<bool>& vu,\n          ll& cnt) {\n   for (auto& p : adj[node]) {\n     if (!vu[p.first] and p.second == 0) {\n       vu[p.first] = true;\n       ++cnt;\n       dfs(p.first, adj, vu, cnt);\n     }\n   }\n }\n ll getPow(ll a, ll p) {\n   ll ret = 1, cp = a;\n   while (p) {\n     if (p & 1) ret = (ret * cp) % MOD;\n     p >>= 1;\n     cp = (cp * cp) % MOD;\n   }\n   return ret;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int n, k, a, b, c;\n   cin >> n >> k;\n   vector<vector<pair<int, int>>> adj(n + 1);\n   for (int i = 1; i < n; ++i) {\n     cin >> a >> b >> c;\n     adj[a].emplace_back(b, c);\n     adj[b].emplace_back(a, c);\n   }\n   vector<bool> vu(n + 1);\n   ll ans = getPow(n, k);\n   for (int i = 1; i <= n; ++i) {\n     if (!vu[i]) {\n       ll tmp = 1;\n       vu[i] = true;\n       dfs(i, adj, vu, tmp);\n       ans = (ans - getPow(tmp, k)) % MOD;\n     }\n   }\n   cout << (ans + MOD) % MOD;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, v[5000];\n char a[5000][5050];\n bool dfs(int x, int from) {\n   v[x] = 1;\n   for (int y = 0; y < n; y++)\n     if (a[x][y] == '1') {\n       if (!v[y]) {\n         if (dfs(y, x)) return true;\n       } else {\n         if (a[y][from] == '1') {\n           printf('%d %d %d\n', y + 1, from + 1, x + 1);\n           return true;\n         }\n       }\n     }\n   return false;\n }\n int main() {\n   scanf('%d', &n);\n   gets(a[0]);\n   for (int i = 0; i < n; i++) gets(a[i]);\n   for (int i = 0; i < n; i++)\n     if (!v[i])\n       if (dfs(i, -1)) return 0;\n   puts('-1');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const double EPS = 0.0000000001;\n const long long mod1 = 998244353;\n const long long mod2 = 1000000007;\n const long long mod3 = 1000000009;\n const long long mod4 = 998244353;\n const long long inf = 10000000000000000;\n using namespace std;\n signed main() {\n   cin.tie(0);\n   cout.tie(0);\n   std::ios_base::sync_with_stdio(0);\n   long long n, a;\n   cin >> n >> a;\n   long long matrix[a][n];\n   for (long long i = 0; i < a; i++) {\n     for (long long z = 0; z < n; z++) {\n       char c;\n       cin >> c;\n       matrix[i][z] = (c - '0');\n     }\n   }\n   bool used[a];\n   for (long long i = 0; i < a; i++) {\n     bool p = 0;\n     for (long long z = 0; z < n; z++) {\n       if (!matrix[i][z]) p = 1;\n     }\n     used[i] = p;\n   }\n   long long c = 0;\n   long long x = 1;\n   long long maxi = -1;\n   for (long long i = 0; i < a; i++) {\n     if (used[i]) {\n       c++;\n       continue;\n     }\n     maxi = max(maxi, c);\n     c = 0;\n   }\n   maxi = max(maxi, c);\n   cout << maxi;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n pair<int, int> x[1024], y[1024];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     for (int i = 0; i < n; i++) {\n       cin >> x[i].first >> x[i].second;\n       y[i].first = x[i].first;\n       y[i].second = x[i].second;\n     }\n     sort(x, x + n, [](const pair<int, int>& a, const pair<int, int>& b) {\n       return a.first < b.first || (a.first == b.first && a.second < b.second);\n     });\n     sort(y, y + n, [](const pair<int, int>& a, const pair<int, int>& b) {\n       return a.second < b.second || (a.second == b.second && a.first < b.first);\n     });\n     string ans = '';\n     int r = 0, c = 0;\n     for (int i = 0; i < n; i++) {\n       if (x[i] != y[i]) {\n         cout << 'NO' << endl;\n         ans = '';\n         break;\n       } else {\n         ans += string(x[i].first - r, 'R');\n         ans += string(x[i].second - c, 'U');\n         r = x[i].first;\n         c = x[i].second;\n       }\n     }\n     if (!ans.empty()) {\n       cout << 'YES' << endl << ans << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s[123456];\n int main() {\n   scanf('%s', s);\n   stack<pair<int, int> > st;\n   int best = 0, rr = -1;\n   int sqb = 0;\n   for (int i = 0; s[i]; ++i) {\n     if (s[i] == '(' || s[i] == '[') {\n       st.push(make_pair(i, sqb));\n       sqb = 0;\n     } else if (s[i] == ')') {\n       if (st.size() > 0 && s[st.top().first] == '(') {\n         sqb += st.top().second;\n         if (best < sqb) {\n           best = sqb;\n           rr = i;\n         }\n         st.pop();\n       } else {\n         stack<pair<int, int> >().swap(st);\n         sqb = 0;\n       }\n     } else if (s[i] == ']') {\n       if (st.size() > 0 && s[st.top().first] == '[') {\n         sqb += st.top().second + 1;\n         if (best < sqb) {\n           best = sqb;\n           rr = i;\n         }\n         st.pop();\n       } else {\n         stack<pair<int, int> >().swap(st);\n         sqb = 0;\n       }\n     }\n   }\n   s[rr + 1] = 0;\n   int ll = rr;\n   stack<int> out;\n   for (int i = rr; i >= 0; --i) {\n     if (s[i] == ')' || s[i] == ']') {\n       out.push(i);\n     } else if (s[i] == '(') {\n       if (out.size() > 0 && s[out.top()] == ')') {\n         ll = i;\n         out.pop();\n       } else\n         break;\n     } else if (s[i] == '[') {\n       if (out.size() > 0 && s[out.top()] == ']') {\n         ll = i;\n         out.pop();\n       } else\n         break;\n     }\n   }\n   while (out.size() > 0) {\n     ll = out.top() + 1;\n     out.pop();\n   }\n   printf('%d\n', best);\n   puts(s + ll);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n template <int MOD_>\n struct modnum {\n   static constexpr int MOD = MOD_;\n   static_assert(MOD_ > 0, 'MOD must be positive');\n \n  private:\n   using ll = long long;\n   int v;\n   static int minv(int a, int m) {\n     a %= m;\n     assert(a);\n     return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a);\n   }\n \n  public:\n   modnum() : v(0) {}\n   modnum(ll v_) : v(int(v_ % MOD)) {\n     if (v < 0) v += MOD;\n   }\n   explicit operator int() const { return v; }\n   friend std::ostream& operator<<(std::ostream& out, const modnum& n) {\n     return out << int(n);\n   }\n   friend std::istream& operator>>(std::istream& in, modnum& n) {\n     ll v_;\n     in >> v_;\n     n = modnum(v_);\n     return in;\n   }\n   friend bool operator==(const modnum& a, const modnum& b) {\n     return a.v == b.v;\n   }\n   friend bool operator!=(const modnum& a, const modnum& b) {\n     return a.v != b.v;\n   }\n   modnum inv() const {\n     modnum res;\n     res.v = minv(v, MOD);\n     return res;\n   }\n   friend modnum inv(const modnum& m) { return m.inv(); }\n   modnum neg() const {\n     modnum res;\n     res.v = v ? MOD - v : 0;\n     return res;\n   }\n   friend modnum neg(const modnum& m) { return m.neg(); }\n   modnum operator-() const { return neg(); }\n   modnum operator+() const { return modnum(*this); }\n   modnum& operator++() {\n     v++;\n     if (v == MOD) v = 0;\n     return *this;\n   }\n   modnum& operator--() {\n     if (v == 0) v = MOD;\n     v--;\n     return *this;\n   }\n   modnum& operator+=(const modnum& o) {\n     v += o.v;\n     if (v >= MOD) v -= MOD;\n     return *this;\n   }\n   modnum& operator-=(const modnum& o) {\n     v -= o.v;\n     if (v < 0) v += MOD;\n     return *this;\n   }\n   modnum& operator*=(const modnum& o) {\n     v = int(ll(v) * ll(o.v) % MOD);\n     return *this;\n   }\n   modnum& operator/=(const modnum& o) { return *this *= o.inv(); }\n   friend modnum operator++(modnum& a, int) {\n     modnum r = a;\n     ++a;\n     return r;\n   }\n   friend modnum operator--(modnum& a, int) {\n     modnum r = a;\n     --a;\n     return r;\n   }\n   friend modnum operator+(const modnum& a, const modnum& b) {\n     return modnum(a) += b;\n   }\n   friend modnum operator-(const modnum& a, const modnum& b) {\n     return modnum(a) -= b;\n   }\n   friend modnum operator*(const modnum& a, const modnum& b) {\n     return modnum(a) *= b;\n   }\n   friend modnum operator/(const modnum& a, const modnum& b) {\n     return modnum(a) /= b;\n   }\n };\n int main() {\n   using namespace std;\n   ios_base::sync_with_stdio(false), cin.tie(nullptr);\n   using num = modnum<int(1e9) + 7>;\n   int Q;\n   cin >> Q;\n   string A;\n   cin >> A;\n   vector<num> dp(int(A.size()) + 1, num(1));\n   Q--;\n   while (Q--) {\n     string B;\n     cin >> B;\n     vector<num> ndp(int(B.size()) + 1, num(0));\n     int Asize = int(A.size());\n     int Bsize = int(B.size());\n     int L = max(Asize + 1, Bsize + 1);\n     A.resize(L + 1, '$');\n     B.resize(L + 1, '%');\n     dp.resize(L + 1, num(0));\n     ndp.resize(L, num(0));\n     vector<array<array<num, 2>, 2>> pref_dp(L);\n     pref_dp[0][0][0]++;\n     for (int i = 0; i < L; i++) {\n       for (int z : {0, 1}) {\n         pref_dp[i][1][z] += dp[i] * pref_dp[i][0][z];\n       }\n       if (i + 1 == L) break;\n       for (int z : {0, 1}) {\n         pref_dp[i + 1][z][1] += pref_dp[i][z][1];\n         if (A[i + z] == B[i]) {\n           pref_dp[i + 1][z][0] += pref_dp[i][z][0];\n         } else if (A[i + z] < B[i]) {\n           pref_dp[i + 1][z][1] += pref_dp[i][z][0];\n         }\n       }\n     }\n     bool suff_less = true;\n     num ways_suff = num(0);\n     num ways_suff_less = num(0);\n     for (int i = L - 1; i >= 0; i--) {\n       ways_suff += dp[i + 1];\n       if (suff_less) {\n         ways_suff_less += dp[i + 1];\n       }\n       if (A[i] < B[i + 1]) {\n         ways_suff_less = ways_suff;\n       } else if (A[i] > B[i + 1]) {\n         ways_suff_less = 0;\n       }\n       if (A[i + 1] != B[i + 1]) {\n         suff_less = A[i + 1] < B[i + 1];\n       }\n       ndp[i] += ways_suff_less * pref_dp[i][0][0];\n       ndp[i] += suff_less * pref_dp[i][1][0];\n       ndp[i] += ways_suff * pref_dp[i][0][1];\n       ndp[i] += pref_dp[i][1][1];\n     }\n     A.resize(Asize);\n     B.resize(Bsize);\n     dp.resize(Asize + 1);\n     ndp.resize(Bsize + 1);\n     A = std::move(B);\n     dp = std::move(ndp);\n   }\n   num ans = accumulate(dp.begin(), dp.end(), num(0));\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dx[] = {0, 0, 1, -1};\n int dy[] = {-1, 1, 0, 0};\n template <class T>\n T power(T N, T P) {\n   return (P == 0) ? 1 : N * power(N, P - 1);\n }\n template <class T>\n T gcd(T a, T b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n struct debugger {\n   template <typename T>\n   debugger& operator,(const T& v) {\n     cerr << v << ' ';\n     return *this;\n   }\n } dbg;\n void make_unique(vector<int>& a) {\n   sort(a.begin(), a.end());\n   a.erase(unique(a.begin(), a.end()), a.end());\n }\n int on(int n, int pos) { return n = n | (1 << pos); }\n void off(int& n, int pos) { n = n & ~(1 << pos); }\n bool check(int n, int pos) { return (bool)(n & (1 << pos)); }\n const int N = 1e5 + 10;\n const int M = 64;\n int id, cnt[M * N], a[N * M][5];\n int new_node() {\n   for (int i = 0; i < 3; i++) {\n     a[id][i] = -1;\n   }\n   cnt[id] = 0;\n   return id++;\n }\n vector<int> bit(70);\n void make(long long int x) {\n   bit.clear();\n   int i = 0;\n   while (x) {\n     bit.push_back(x % 2);\n     x /= 2LL;\n     i++;\n   }\n   while (i < M - 1) {\n     bit.push_back(0LL);\n     i++;\n   }\n   reverse(bit.begin(), bit.end());\n }\n void add(long long int x) {\n   make(x);\n   int cur = 0, typ;\n   for (int i = 0; i < M; i++) {\n     typ = bit[i];\n     if (a[cur][typ] == -1) {\n       a[cur][typ] = new_node();\n     }\n     cur = a[cur][typ];\n     ++cnt[cur];\n   }\n }\n void del(long long int x) {\n   make(x);\n   int cur = 0, typ;\n   for (int i = 0; i < M; i++) {\n     typ = bit[i];\n     cur = a[cur][typ];\n     --cnt[cur];\n   }\n }\n long long int query(long long int x) {\n   make(x);\n   int cur = 0, typ;\n   long long int ans = 0LL;\n   for (int i = 0; i < M; i++) {\n     typ = bit[i];\n     if (cnt[a[cur][!typ]] > 0) {\n       ans += (1LL << (M - i - 2));\n       cur = a[cur][!typ];\n     } else {\n       if (a[cur][typ] == -1) return ans;\n       cur = a[cur][typ];\n     }\n   }\n   return ans;\n }\n long long int arr[N];\n int main() {\n   int n;\n   while (scanf('%d', &n) != EOF) {\n     id = 0;\n     new_node();\n     for (__typeof(n) i = 1; i <= n; i++) {\n       scanf('%lld', &arr[i]);\n     }\n     long long int xr = 0LL;\n     for (int i = n; i >= 1; i--) {\n       xr ^= arr[i];\n       add(xr);\n     }\n     long long int mx = 0LL;\n     long long int nw = 0LL;\n     mx = max(mx, query(nw));\n     for (int i = 1; i <= n; i++) {\n       nw ^= arr[i];\n       mx = max(mx, query(nw));\n       del(xr);\n       xr ^= arr[i];\n     }\n     printf('%lld\n', mx);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t > 0) {\n     t--;\n     string s, x;\n     cin >> s;\n     x.push_back(s[0]);\n     for (int i = 1; i < s.size(); i++) {\n       if (i % 2 != 0) x.push_back(s[i]);\n     }\n     cout << x << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int q = 1, i, j;\n   while (q--) {\n     int n, r;\n     cin >> r >> n;\n     vector<int> t(n + 1), x(n + 1), y(n + 1);\n     t[0] = 0, x[0] = 1, y[0] = 1;\n     for (i = 1; i < (n + 1); i++) {\n       cin >> t[i] >> x[i] >> y[i];\n     }\n     vector<int> dp(n + 1, INT_MIN), pref(n + 1, INT_MIN);\n     dp[0] = 0;\n     for (i = 1; i < (n + 1); i++) {\n       dp[i] = 1 + pref[max(i - 2 * r, 0)];\n       for (j = max(0, i - 2 * r + 1); j < (i); j++) {\n         if (t[i] - t[j] >= abs(x[i] - x[j]) + abs(y[i] - y[j])) {\n           dp[i] = max(dp[i], dp[j] + 1);\n         }\n       }\n       pref[i] = max({dp[i], pref[i - 1], 0});\n     }\n     cout << pref[n] << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   int n, m, a;\n   cin >> n >> m;\n   int l = 1, mx = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> a;\n     if ((a + m - 1) / m >= mx) {\n       mx = (a + m - 1) / m;\n       l = i + 1;\n     }\n   }\n   cout << l << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long const M = 2000 + 10, M2 = 1e7 + 10, mod = 1e9 + 7, inf = 1e9 + 10,\n                 sq = 450;\n long long a[M][M], ro[M], col[M], all[M];\n int32_t main() {\n   long long n, ans = 0;\n   cin >> n;\n   for (long long i = 1; i <= n; i++) {\n     string x;\n     cin >> x;\n     for (long long j = 0; j < x.size(); j++) {\n       a[i][j + 1] = x[j] - '0';\n     }\n   }\n   for (long long i = 1; i <= n; i++) {\n     for (long long j = n; j > i; j--) {\n       long long good = col[j] xor ro[i];\n       long long need = good xor a[i][j];\n       ro[i] = ro[i] xor need;\n       all[i] = all[i] xor need;\n       col[j] = col[j] xor need;\n       all[j] = all[j] xor need;\n       ans += need;\n     }\n   }\n   for (long long i = 1; i <= n; i++) col[i] = 0, ro[i] = 0;\n   for (long long i = n; i >= 1; i--) {\n     for (long long j = 1; j < i; j++) {\n       long long good = col[j] xor ro[i];\n       long long need = good xor a[i][j];\n       ro[i] = ro[i] xor need;\n       all[i] = all[i] = all[i] xor need;\n       col[j] = col[j] xor need;\n       all[j] = all[j] xor need;\n       ans += need;\n     }\n   }\n   for (long long i = 1; i <= n; i++) {\n     ans += all[i] xor a[i][i];\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1e18;\n int32_t main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, m;\n   cin >> n >> m;\n   long long a[n], b[m];\n   for (long long i = 0; i < n; ++i) {\n     cin >> a[i];\n   }\n   for (long long i = 0; i < m; ++i) {\n     cin >> b[i];\n   }\n   long long ans = INF;\n   for (long long i = 0; i < n; ++i) {\n     long long res = -INF;\n     for (long long j = 0; j < n; ++j) {\n       if (i != j) {\n         for (long long k = 0; k < m; ++k) {\n           res = max(res, a[j] * b[k]);\n         }\n       }\n     }\n     ans = min(ans, res);\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 5;\n int n, x[maxn], y[maxn];\n int solve(set<pair<int, int> >& a, set<pair<int, int> >& b) {\n   set<pair<int, int> >::iterator itl = a.begin(), itd = b.begin(), it1;\n   set<pair<int, int> >::reverse_iterator itr = a.rbegin(), itu = b.rbegin(),\n                                          it2;\n   set<pair<int, int> > f, s;\n   bool chk = false;\n   for (int i = 0; i < a.size() - 1; ++i) {\n     if (next(itl)->first > itl->first + 1) {\n       chk = true;\n       for (it1 = a.begin(); it1 != next(itl); ++it1) {\n         f.insert({x[it1->second], it1->second});\n       }\n     } else if (next(itd)->first > itd->first + 1) {\n       chk = true;\n       for (it1 = b.begin(); it1 != next(itd); ++it1) {\n         f.insert({x[it1->second], it1->second});\n       }\n     } else if (next(itr)->first + 1 < itr->first) {\n       chk = true;\n       for (it2 = a.rbegin(); it2 != next(itr); ++it2) {\n         f.insert({x[it2->second], it2->second});\n       }\n     } else if (next(itu)->first + 1 < itu->first) {\n       chk = true;\n       for (it2 = b.rbegin(); it2 != next(itu); it2++) {\n         f.insert({x[it2->second], it2->second});\n       }\n     }\n     if (chk) {\n       for (auto u : f) {\n         s.insert({y[u.second], u.second});\n         b.erase({y[u.second], u.second});\n         a.erase(u);\n       }\n       return solve(a, b) + solve(f, s);\n     }\n     itl++;\n     itr++;\n     itd++;\n     itu++;\n   }\n   return 1;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n;\n   set<pair<int, int> > xs, ys;\n   for (int i = 0; i < n; ++i) {\n     cin >> x[i] >> y[i];\n     xs.insert({x[i], i});\n     ys.insert({y[i], i});\n   }\n   cout << solve(xs, ys);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int t = 1, i, j, n;\n   long long int p, q, temp, arr[90];\n   for (j = 0; j < t; j++) {\n     scanf('%lld %lld', &p, &q);\n     scanf('%d', &n);\n     for (i = 0; i < n; i++) scanf('%lld', &arr[i]);\n     for (i = 0; i < n; i++) {\n       if (p / q < arr[i]) {\n         printf('NO\n');\n         break;\n       }\n       p = p - (q * arr[i]);\n       if (p == 0 && i != n - 1) {\n         printf('NO\n');\n         break;\n       }\n       if (i != n - 1) {\n         temp = p;\n         p = q;\n         q = temp;\n       }\n     }\n     if (p == 0 && i == n)\n       printf('YES\n');\n     else if (i == n)\n       printf('NO\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int bits = 1000;\n bitset<bits> node[4 * 100060];\n long long int leftOver[4 * 100060];\n int n;\n int treeSize[100060];\n vector<int> adj[100060];\n int dfsOrder[100060];\n int o = 1;\n void dfs(int curr = 1, int par = -1) {\n   treeSize[curr] = 1;\n   dfsOrder[curr] = o++;\n   for (int nxt : adj[curr]) {\n     if (nxt != par) {\n       dfs(nxt, curr);\n       treeSize[curr] += treeSize[nxt];\n     }\n   }\n }\n int m;\n bitset<bits> rotate(std::bitset<bits> b, unsigned k) {\n   b = b << (k) | b >> (m - (k));\n   b = b | (b >> m);\n   return b;\n }\n void build(int pos, int bit, int id = 1, int l = 1, int r = n) {\n   if (l == r) {\n     node[id][bit] = 1;\n     return;\n   }\n   int mid = (l + r) >> 1;\n   if (pos <= mid)\n     build(pos, bit, id << 1, l, mid);\n   else\n     build(pos, bit, (id << 1) + 1, mid + 1, r);\n   node[id] = node[id << 1] | node[(id << 1) + 1];\n }\n void push(int id) {\n   if (leftOver[id] > 0) {\n     leftOver[id << 1] = (leftOver[id] + leftOver[id << 1]) % m;\n     leftOver[(id << 1) + 1] = (leftOver[id] + leftOver[(id << 1) + 1]) % m;\n     leftOver[id] = 0;\n   }\n }\n void add(int val, int L, int R, int id = 1, int l = 1, int r = n) {\n   if (L <= l && r <= R) {\n     leftOver[id] = (leftOver[id] + val) % m;\n     return;\n   }\n   push(id);\n   int mid = (l + r) >> 1;\n   if (L <= mid) add(val, L, R, id << 1, l, mid);\n   if (R > mid) add(val, L, R, (id << 1) + 1, mid + 1, r);\n   node[id] = rotate(node[id << 1], leftOver[id << 1]) |\n              rotate(node[(id << 1) + 1], leftOver[(id << 1) + 1]);\n }\n bitset<bits> ans;\n void query(int qL, int qR, int id = 1, int l = 1, int r = n) {\n   if (qL <= l && qR >= r) {\n     ans = ans | rotate(node[id], leftOver[id]);\n     return;\n   }\n   push(id);\n   int mid = (l + r) >> 1;\n   if (qL <= mid) query(qL, qR, id << 1, l, mid);\n   if (qR > mid) query(qL, qR, (id << 1) + 1, mid + 1, r);\n   node[id] = rotate(node[id << 1], leftOver[id << 1]) |\n              rotate(node[(id << 1) + 1], leftOver[(id << 1) + 1]);\n }\n vector<int> primes;\n vector<int> sieve(int limit) {\n   vector<int> primes;\n   bool in[limit + 1];\n   memset(in, true, sizeof(in));\n   for (int i = 2; i <= limit; i++) {\n     if (in[i]) {\n       primes.push_back(i);\n       for (int j = i; j <= limit; j += i) in[j] = false;\n     }\n   }\n   return primes;\n }\n int a[100060];\n int aTemp[100060];\n int addBrute(int l, int r, int x) {\n   for (int i = l; i < r + 1; i++) a[i] = (a[i] + x) % m;\n }\n bitset<bits> findBrute(int l, int r) {\n   bitset<bits> temp = 0;\n   for (int i = l; i < r + 1; i++) temp[a[i] % m] = 1;\n   return temp;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int q;\n   cin >> n >> m;\n   primes = sieve(m);\n   for (int i = 0; i < n; i++) cin >> a[i + 1];\n   for (int i = 0; i < n - 1; i++) {\n     int x, y;\n     cin >> x >> y;\n     adj[x].push_back(y);\n     adj[y].push_back(x);\n   }\n   dfs();\n   for (int i = 0; i < n; i++) {\n     build(dfsOrder[i + 1], a[i + 1] % m);\n   }\n   for (int i = 1; i < n + 1; i++) {\n     aTemp[dfsOrder[i]] = a[i];\n   }\n   for (int i = 1; i < n + 1; i++) {\n     a[i] = aTemp[i];\n   }\n   cin >> q;\n   for (int i = 0; i < q; i++) {\n     int t, v;\n     cin >> t >> v;\n     if (t == 1) {\n       int x;\n       cin >> x;\n       add(x % m, dfsOrder[v], dfsOrder[v] + treeSize[v] - 1);\n     } else {\n       ans = 0;\n       query(dfsOrder[v], dfsOrder[v] + treeSize[v] - 1);\n       int k = 0;\n       for (int j = 0; j < primes.size(); j++) {\n         if (primes[j] < m) {\n           if (ans[primes[j]]) {\n             k++;\n           }\n         }\n       }\n       cout << k << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100010;\n struct seg {\n   vector<int> t;\n   int n;\n   seg(int n = 0) : t(2 * n), n(n) {}\n   int query(int l, int r) {\n     int ans = 0;\n     for (l += n, r += n; l < r; l >>= 1, r >>= 1) {\n       if (l & 1) ans += t[l++];\n       if (r & 1) ans += t[--r];\n     }\n     return ans;\n   }\n   void update(int p, int v) {\n     for (t[p += n] += v; p > 1; p >>= 1) {\n       t[p >> 1] = t[p] + t[p ^ 1];\n     }\n   }\n };\n seg s[4][11][10];\n void modify(int p, int c, int m) {\n   for (int i = 1; i <= 10; i++) {\n     s[c][i][p % i].update(p, m);\n   }\n }\n void convert(string& s) {\n   for (char& c : s) {\n     switch (c) {\n       case 'A':\n         c = 0;\n         break;\n       case 'T':\n         c = 1;\n         break;\n       case 'C':\n         c = 2;\n         break;\n       case 'G':\n         c = 3;\n         break;\n     }\n   }\n }\n int main() {\n   string k;\n   cin >> k;\n   convert(k);\n   for (int i = 0; i < 4; i++) {\n     for (int j = 1; j <= 10; j++) {\n       for (int l = 0; l < j; l++) {\n         s[i][j][l] = seg(k.size());\n       }\n     }\n   }\n   for (int i = 0; i < k.size(); i++) {\n     modify(i, k[i], 1);\n   }\n   int q;\n   cin >> q;\n   while (q--) {\n     int op;\n     cin >> op;\n     if (op == 1) {\n       int x;\n       string c;\n       cin >> x >> c;\n       convert(c);\n       x--;\n       modify(x, k[x], -1);\n       k[x] = c[0];\n       modify(x, k[x], 1);\n     } else {\n       int l, r;\n       cin >> l >> r;\n       l--;\n       string e;\n       cin >> e;\n       convert(e);\n       int a = 0;\n       for (int i = l; i < l + e.size(); i++) {\n         a += s[e[i - l]][e.size()][i % e.size()].query(l, r);\n       }\n       cout << a << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int d4i[4] = {-1, 0, 1, 0}, d4j[4] = {0, 1, 0, -1};\n const int d8i[8] = {-1, -1, 0, 1, 1, 1, 0, -1},\n           d8j[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n void DBG() { cout << ']' << endl; }\n template <class H, class... T>\n void DBG(H h, T... t) {\n   cout << to_string(h);\n   if (sizeof...(t)) cout << ', ';\n   DBG(t...);\n }\n template <class T>\n bool umin(T& a, const T& b) {\n   return b < a ? a = b, 1 : 0;\n }\n template <class T>\n bool umax(T& a, const T& b) {\n   return a < b ? a = b, 1 : 0;\n }\n int n;\n vector<pair<long long, long long>> cards[(long long)(200002)],\n     need[(long long)(200002)];\n vector<array<long long, 3>> valid[(long long)(200002)];\n void prepare() {\n   for (int i = (1), _c = (n); i <= _c; ++i) {\n     vector<int> cnt(4, 0);\n     sort((cards[i]).begin(), (cards[i]).end(),\n          [](pair<long long, long long> a, pair<long long, long long> b) {\n            return a.first < b.first ||\n                   (a.first == b.first && a.second > b.second);\n          });\n     for (auto j : cards[i]) {\n       if (j.first == 1 && cnt[j.first] >= 3) continue;\n       if (j.first == 2 && cnt[j.first] >= 1) continue;\n       if (j.first == 3 && cnt[j.first] >= 1) continue;\n       need[i].push_back(j);\n       ++cnt[j.first];\n     }\n   }\n   for (int i = (1), _c = (n); i <= _c; ++i) {\n     for (int j = (0), _c = ((1ll << (((int)((need[i]).size())))) - 1); j <= _c;\n          ++j) {\n       long long cost = 0, ma = 0, dame = 0;\n       for (int k = (0), _c = (((int)((need[i]).size())) - 1); k <= _c; ++k) {\n         if ((((j) >> (k)) & 1ll)) {\n           cost += need[i][k].first;\n           dame += need[i][k].second;\n           umax(ma, need[i][k].second);\n         }\n       }\n       if (cost <= 3) {\n         int bonus = __builtin_popcountll(j);\n         valid[i].push_back({bonus, dame, ma});\n       }\n     }\n   }\n }\n long long dp[(long long)(200002)][11];\n void test_case() {\n   cin >> n;\n   for (int i = (1), _c = (n); i <= _c; ++i) {\n     int k;\n     cin >> k;\n     cards[i].assign(k, {0, 0});\n     for (int j = (0), _c = (k - 1); j <= _c; ++j)\n       cin >> cards[i][j].first >> cards[i][j].second;\n   }\n   prepare();\n   for (auto i : valid[1]) umax(dp[1][i[0]], i[1]);\n   for (int i = (1), _c = (n - 1); i <= _c; ++i)\n     for (int j = (0), _c = (10); j <= _c; ++j)\n       if (dp[i][j] || j == 0) {\n         for (auto k : valid[i + 1]) {\n           int nxtNum = j + k[0];\n           if (nxtNum < 10)\n             umax(dp[i + 1][nxtNum], dp[i][j] + k[1]);\n           else\n             umax(dp[i + 1][nxtNum % 10], dp[i][j] + k[1] + k[2]);\n         }\n       }\n   long long ans = 0;\n   for (int i = (0), _c = (10); i <= _c; ++i) umax(ans, dp[n][i]);\n   cout << ans << '\n';\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   auto time = clock();\n   int test = 1;\n   while (test--) {\n     test_case();\n   }\n   cerr << '[It took ' << fixed << setprecision(3)\n        << double(clock() - time) / CLOCKS_PER_SEC << 's]'\n        << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void Get(int &T) {\n   char C;\n   bool F = 0;\n   for (; C = getchar(), C < '0' || C > '9';)\n     if (C == '-') F = 1;\n   for (T = C - '0'; C = getchar(), C >= '0' && C <= '9'; T = T * 10 + C - '0')\n     ;\n   F && (T = -T);\n }\n int N;\n void Init() { Get(N); }\n int T[55][55];\n void Mul(int A[][55], int B[][55], int N, int K, int M) {\n   for (int i = 1; i <= N; i++)\n     for (int j = 1; j <= M; j++) {\n       T[i][j] = 0;\n       for (int k = 1; k <= K; k++) (T[i][j] ^= (A[i][k] & B[k][j]));\n     }\n   for (int i = 1; i <= N; i++)\n     for (int j = 1; j <= M; j++) A[i][j] = T[i][j];\n }\n int A[55][55];\n int B[55][55];\n int T2[55][55];\n void Pow(int X[][55], long long P) {\n   for (int i = 1; i <= N; i++)\n     for (int j = 1; j <= N; j++) T2[i][j] = (i == j);\n   for (; P; P >>= 1) {\n     if (P & 1) Mul(T2, X, N, N, N);\n     Mul(X, X, N, N, N);\n   }\n   for (int i = 1; i <= N; i++)\n     for (int j = 1; j <= N; j++) X[i][j] = T2[i][j];\n }\n long long Factor[100005];\n int FactorTop;\n bool I() {\n   for (int i = 1; i <= N; i++)\n     for (int j = 1; j <= N; j++)\n       if (B[i][j] != (i == j)) return 0;\n   return 1;\n }\n bool Check() {\n   for (int i = 1; i <= N; i++)\n     for (int j = 1; j <= N; j++) B[i][j] = A[i][j];\n   Pow(B, (1ll << N) - 1);\n   int Ans = I();\n   if (Ans == 0) return 0;\n   for (int k = 1; k <= FactorTop; k++) {\n     for (int i = 1; i <= N; i++)\n       for (int j = 1; j <= N; j++) B[i][j] = A[i][j];\n     Pow(B, ((1ll << N) - 1) / Factor[k]);\n     int Ans = I();\n     if (Ans == 1) return 0;\n   }\n   return 1;\n }\n void Debug() {\n   FactorTop = 0;\n   long long X = 1ll << N;\n   X--;\n   Factor[0] = 1;\n   for (long long i = 2; i * i <= X; i++) {\n     for (;; X /= i) {\n       if (X % i != 0) break;\n       Factor[++FactorTop] = i;\n     }\n   }\n   if (X > 1) Factor[++FactorTop] = X;\n   for (int i = 1; i < N; i++) A[i + 1][i] = 1;\n   for (;;) {\n     for (int i = 1; i <= N; i++) A[i][N] = rand() & 1;\n     int Ans = Check();\n     if (Ans) break;\n   }\n }\n void Work() { Debug(); }\n void Output() {\n   for (int i = N; i >= 1; i--) printf('%d ', A[i][N]);\n   puts('');\n   for (int i = N; i >= 1; i--) printf('%d ', 1);\n   puts('');\n }\n int main() {\n   srand(time(0));\n   Init();\n   Work();\n   Output();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long t;\n long long n;\n long long tmp;\n long long gcd(long long a, long long b) {\n   long long temp;\n   if (a < b) {\n     temp = a;\n     a = b;\n     b = temp;\n   }\n   while (b != 0) {\n     temp = a % b;\n     a = b;\n     b = temp;\n   }\n   return a;\n }\n long long lcm(long long a, long long b) {\n   long long temp_lcm;\n   temp_lcm = a * b / gcd(a, b);\n   return temp_lcm;\n }\n int main() {\n   cin >> t;\n   while (t--) {\n     cin >> n;\n     if (n % 2 == 0) {\n       long long a, b;\n       tmp = n / 2;\n       while (tmp--) {\n         cin >> a >> b;\n         cout << b << ' ' << -a << ' ';\n       }\n       cout << endl;\n     } else {\n       long long a, b, c;\n       tmp = (n - 2) / 2;\n       while (tmp--) {\n         cin >> a >> b;\n         cout << b << ' ' << -a << ' ';\n       }\n       cin >> a >> b >> c;\n       tmp = lcm(a, b);\n       tmp = lcm(tmp, c);\n       cout << tmp / a << ' ' << tmp / b << ' ' << -2 * tmp / c;\n       cout << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   int max = 0, min = 0;\n   int a[m], b[m];\n   for (int i = 0; i < m; i++) {\n     cin >> a[i];\n     b[i] = a[i];\n   }\n   sort(a, a + m, greater<int>());\n   for (int i = 0; i < n; i++) {\n     if (a[0] != 0) {\n       max = max + a[0];\n       a[0] = a[0] - 1;\n       sort(a, a + m, greater<int>());\n     } else {\n       break;\n     }\n   }\n   sort(b, b + m);\n   int i = 0, k = 0;\n   while (i != n) {\n     if (b[k] != 0) {\n       min = min + b[k];\n       b[k] = b[k] - 1;\n     } else {\n       k++;\n       min = min + b[k];\n       b[k] = b[k] - 1;\n     }\n     i++;\n   }\n   cout << max << ' ' << min;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool isPrime[1000005] = {false};\n vector<long long int> SPF(1000005);\n long long int fastPower(long long int a, long long int b) {\n   if (b == 0) return 1;\n   long long int prod = 1;\n   while (b > 0) {\n     if (b & 1) prod = prod * a;\n     b = b >> 1;\n     a = a * a;\n   }\n   return prod;\n }\n void sieve() {\n   int i;\n   for (i = 2; i < 1000005; ++i) isPrime[i] = 1;\n   for (i = 2; i * i < 1000005; ++i) {\n     if (isPrime[i]) {\n       for (int j = i * i; j < 1000005; j += i) isPrime[j] = 0;\n     }\n   }\n }\n void printa(bool f) {\n   if (f)\n     cout << 'YES';\n   else\n     cout << 'NO';\n   cout << '\n';\n }\n bool flip(bool f) {\n   if (f) return 0;\n   return 1;\n }\n void solve() {\n   long long int i, n;\n   cin >> n;\n   vector<long long int> a(n);\n   for (i = 0; i < n; ++i) cin >> a[i];\n   sort(a.begin(), a.end());\n   long long int s = 0, m = a[n - 1];\n   for (i = 0; i < n - 1; ++i) s += a[i];\n   cout << abs(m - s) + 1 << '\n';\n }\n int main() {\n   int tc = 1;\n   while (tc--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int m, n, p, count = 0;\n   cin >> m >> n;\n   if (m % n == 0)\n     cout << m / n;\n   else {\n     count = count + (m / n);\n     m = m % n;\n     for (;;) {\n       if (m > n) {\n         if (m % n == 0) {\n           count += m / n;\n           break;\n         }\n         m = m - n;\n         count++;\n       } else if (n > m) {\n         if (n % m == 0) {\n           count += n / m;\n           break;\n         }\n         n = n - m;\n         count++;\n       }\n     }\n     cout << count;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 5;\n const int MAXM = 20;\n int n, m;\n int a[MAXN], b[MAXM];\n int num[MAXM];\n char ans[MAXN][MAXM];\n set<int> states[MAXM];\n int getState(int mask, int num[MAXM]) {\n   int res = mask;\n   for (int i = 0; i < n; ++i) {\n     res = res * MAXN + num[i];\n   }\n   return res;\n }\n bool dfs(int j, int lastState = 0) {\n   if (j == m) {\n     for (int i = 0; i < n; ++i) {\n       if (num[i] != a[i]) {\n         return false;\n       }\n     }\n     return true;\n   }\n   if (j) {\n     if (states[j].find(lastState) != states[j].end()) {\n       return false;\n     }\n     states[j].insert(lastState);\n   }\n   int origin[MAXM];\n   memcpy(origin, num, sizeof(num));\n   for (int k = 0; k < (1 << n); ++k) {\n     int cnt = 0;\n     for (int i = 0; i < n; ++i) {\n       if (k & (1 << i)) {\n         ans[i][j] = '*';\n         if (i == 0 || ans[i - 1][j] == '.') {\n           ++cnt;\n         }\n       } else {\n         ans[i][j] = '.';\n       }\n     }\n     if (cnt != b[j]) {\n       continue;\n     }\n     for (int i = 0; i < n; ++i) {\n       if (ans[i][j] == '*') {\n         if (j == 0 || ans[i][j - 1] == '.') {\n           ++num[i];\n         }\n       }\n     }\n     bool valid = true;\n     for (int i = 0; i < n; ++i) {\n       if (num[i] > a[i]) {\n         valid = false;\n         break;\n       }\n       if (ans[i][j] == '*') {\n         if (a[i] - num[i] > (m - j - 1) / 2) {\n           valid = false;\n           break;\n         }\n       } else {\n         if (a[i] - num[i] > (m - j) / 2) {\n           valid = false;\n           break;\n         }\n       }\n     }\n     if (valid) {\n       if (dfs(j + 1, getState(k, num))) {\n         return true;\n       }\n     }\n     memcpy(num, origin, sizeof(origin));\n   }\n   return false;\n }\n int main() {\n   while (cin >> n >> m) {\n     for (int i = 0; i < n; ++i) {\n       cin >> a[i];\n     }\n     for (int i = 0; i < m; ++i) {\n       cin >> b[i];\n     }\n     for (int i = 0; i < n; ++i) {\n       states[i].clear();\n     }\n     memset(num, 0, sizeof(num));\n     dfs(0);\n     for (int i = 0; i < n; ++i) {\n       for (int j = 0; j < m; ++j) {\n         cout << ans[i][j];\n       }\n       cout << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100500;\n const int INF = 2 * (1e9);\n int n, m;\n vector<pair<int, int> > edge[N];\n vector<pair<int, int> > delay[N];\n int dist[N];\n int main() {\n   cin.sync_with_stdio(false);\n   cin >> n >> m;\n   for (int i = 0; i < m; i++) {\n     int from, to, len;\n     cin >> from >> to >> len;\n     from--;\n     to--;\n     edge[from].push_back(make_pair(to, len));\n     edge[to].push_back(make_pair(from, len));\n   }\n   for (int i = 0; i < n; i++) {\n     int num;\n     cin >> num;\n     int cur;\n     for (int j = 0; j < num; j++) {\n       cin >> cur;\n       if (j == 0 or delay[i].back().second != cur)\n         delay[i].push_back(make_pair(cur, cur + 1));\n       else\n         delay[i].back().second++;\n     }\n   }\n   for (int i = 0; i < n; i++) dist[i] = INF;\n   dist[0] = 0;\n   if (delay[0].size() >= 1 and delay[0][0].first == 0)\n     dist[0] = delay[0][0].second;\n   set<pair<int, int> > dijkstra;\n   dijkstra.insert(make_pair(dist[0], 0));\n   for (int i = 0; i < n; i++) {\n     if (dijkstra.empty()) break;\n     pair<int, int> now = *dijkstra.begin();\n     dijkstra.erase(now);\n     for (const pair<int, int> &next : edge[now.second]) {\n       int arrival = next.first;\n       int tm = next.second + now.first;\n       int idx = lower_bound(delay[arrival].begin(), delay[arrival].end(),\n                             make_pair(tm, INF)) -\n                 delay[arrival].begin();\n       if (idx > 0 and arrival != n - 1) {\n         idx--;\n         if (delay[arrival][idx].first <= tm and tm < delay[arrival][idx].second)\n           tm = delay[arrival][idx].second;\n       }\n       if (dist[arrival] > tm) {\n         dijkstra.erase(make_pair(dist[arrival], arrival));\n         dist[arrival] = tm;\n         dijkstra.insert(make_pair(dist[arrival], arrival));\n       }\n     }\n   }\n   if (dist[n - 1] == INF) dist[n - 1] = -1;\n   cout << dist[n - 1] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <cstdio>\n #include <vector>\n #include <cstring>\n #include <algorithm>\n const int Maxn=200000;\n const int Inf=0x3f3f3f3f;\n int n;\n int a[Maxn+5];\n std::vector<int> v_lis[Maxn+5];\n struct Segment_Tree{\n 	struct Segment_Node{\n 		int minn,maxn;\n 		int lazy;\n 	}seg[Maxn<<2|5];\n 	void update_tag(int root,int a){\n 		seg[root].lazy+=a;\n 		seg[root].minn+=a,seg[root].maxn+=a;\n 	}\n 	void push_up(int root){\n 		seg[root].minn=std::min(seg[root<<1].minn,seg[root<<1|1].minn);\n 		seg[root].maxn=std::max(seg[root<<1].maxn,seg[root<<1|1].maxn);\n 	}\n 	void push_down(int root){\n 		if(seg[root].lazy==0){\n 			return;\n 		}\n 		update_tag(root<<1,seg[root].lazy);\n 		update_tag(root<<1|1,seg[root].lazy);\n 		seg[root].lazy=0;\n 	}\n 	void update(int l,int r,int v,int root=1,int left=0,int right=n){\n 		if(l>right||r<left){\n 			return;\n 		}\n 		if(l<=left&&r>=right){\n 			update_tag(root,v);\n 			return;\n 		}\n 		push_down(root);\n 		int mid=(left+right)>>1;\n 		update(l,r,v,root<<1,left,mid);\n 		update(l,r,v,root<<1|1,mid+1,right);\n 		push_up(root);\n 	}\n 	int query_min(int l,int r,int root=1,int left=0,int right=n){\n 		if(l>right||r<left){\n 			return Inf;\n 		}\n 		if(l<=left&&r>=right){\n 			return seg[root].minn;\n 		}\n 		push_down(root);\n 		int mid=(left+right)>>1;\n 		return std::min(query_min(l,r,root<<1,left,mid),query_min(l,r,root<<1|1,mid+1,right));\n 	}\n 	int query_max(int l,int r,int root=1,int left=0,int right=n){\n 		if(l>right||r<left){\n 			return -Inf;\n 		}\n 		if(l<=left&&r>=right){\n 			return seg[root].maxn;\n 		}\n 		push_down(root);\n 		int mid=(left+right)>>1;\n 		return std::max(query_max(l,r,root<<1,left,mid),query_max(l,r,root<<1|1,mid+1,right));\n 	}\n }seg_1,seg_2;\n int ans[Maxn+5];\n int main(){\n 	scanf('%d',&n);\n 	for(int i=1;i<=n;i++){\n 		scanf('%d',&a[i]);\n 		v_lis[a[i]].push_back(i);\n 	}\n 	for(int i=1;i<=n;i++){\n 		seg_1.update(i>>1,(n-1)>>1,1);\n 		seg_2.update((i+1)>>1,n>>1,1);\n 	}\n 	for(int i=1;i<=n;i++){\n 		for(int j=0;j<(int)v_lis[i].size();j++){\n 			int pos=v_lis[i][j];\n 			int pos_1_max=seg_1.query_max(pos>>1,(n-1)>>1);\n 			int pos_1_min=seg_1.query_min(0,(pos>>1)-1);\n 			int pos_2_max=seg_2.query_max((pos+1)>>1,n>>1);\n 			int pos_2_min=seg_2.query_min(0,(pos-1)>>1);\n 			ans[pos]=std::max(std::max((pos_2_max-pos_2_min)>>1,(pos_1_max-pos_1_min)>>1),\\n 			std::max((pos_2_max-pos_1_min-1)>>1,(pos_1_max-pos_2_min-1)>>1));\n 		}\n 		for(int j=0;j<(int)v_lis[i].size();j++){\n 			seg_1.update(v_lis[i][j]>>1,(n-1)>>1,-2);\n 			seg_2.update((v_lis[i][j]+1)>>1,n>>1,-2);\n 		}\n 		for(int j=0;j<(int)v_lis[i].size();j++){\n 			int pos=v_lis[i][j];\n 			int pos_1_min=seg_1.query_min(pos>>1,(n-1)>>1);\n 			int pos_1_max=seg_1.query_max(0,(pos>>1)-1);\n 			int pos_2_min=seg_2.query_min((pos+1)>>1,n>>1);\n 			int pos_2_max=seg_2.query_max(0,(pos-1)>>1);\n 			ans[pos]=std::max(ans[pos],std::max(\n 			std::max((pos_2_max-pos_2_min)>>1,(pos_1_max-pos_1_min)>>1)-1,\\n 			std::max((pos_2_max-pos_1_min-1)>>1,(pos_1_max-pos_2_min-1)>>1)));\n 		}\n 	}\n 	for(int i=1;i<=n;i++){\n 		printf('%d ',ans[i]);\n 	}\n 	puts('');;\n 	return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> V[100005];\n int main() {\n   int N, M, K, ans = 1;\n   scanf('%d%d%d', &N, &M, &K);\n   for (int i = 1; i <= N; ++i) {\n     int c;\n     scanf('%d', &c);\n     V[c].push_back(i);\n   }\n   for (int c = 1; c <= M; ++c) {\n     int L = V[c].size(), rem = 0, st = 0;\n     for (int j = 1; j < L; ++j) {\n       rem += V[c][j] - V[c][j - 1] - 1;\n       while (rem > K) {\n         rem -= V[c][st + 1] - V[c][st] - 1;\n         ++st;\n       }\n       ans = max(ans, j - st + 1);\n     }\n   }\n   printf('%d\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using namespace std;\n int main() {\n   string s;\n   cin >> s;\n   string h = s.substr(0, 2);\n   int hour = atoi(h.c_str());\n   string m = s.substr(3, 2);\n   int minute = atoi(m.c_str());\n   long long time = 60 * hour + minute;\n   long long add;\n   cin >> add;\n   long long sum = time + add;\n   long long n = sum % (24 * 60);\n   cout << setfill('0') << setw(2) << right << (n / 60);\n   cout << ':';\n   cout << setfill('0') << setw(2) << right << (n % 60) << endl;\n   ;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[7];\n int b[7];\n int main() {\n   string s;\n   int k;\n   cin >> s >> k;\n   int kol = 0;\n   for (int i = 0; i < s.length(); i++) {\n     if (s[i] == '0') {\n       kol++;\n     }\n   }\n   if (kol < k) {\n     cout << s.length() - 1;\n   } else {\n     kol = 0;\n     int res = 0;\n     for (int i = s.length() - 1; i >= 0; i--) {\n       if (s[i] == '0') {\n         kol++;\n       } else {\n         res++;\n       }\n       if (kol == k) {\n         cout << res;\n         return 0;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s1[5010], s2[5010], str[5010];\n int num[30];\n int len1, len2;\n int dfs(int k, int m) {\n   if (!s1[k]) return m;\n   for (int i = 0; i < 26; i++)\n     if (num[i] && (m || (i >= s2[k] - 'a'))) {\n       str[k] = i + 'a';\n       num[i]--;\n       if (dfs(k + 1, m || (i > s2[k] - 'a'))) return 1;\n       num[i]++;\n     }\n   return 0;\n }\n int main() {\n   while (EOF != scanf('%s %s', s1, s2)) {\n     memset(num, 0, sizeof(num));\n     len1 = strlen(s1), len2 = strlen(s2);\n     for (int i = 0; i < len1; i++) num[s1[i] - 'a']++;\n     if (!dfs(0, 0))\n       printf('-1\n');\n     else {\n       printf('%s\n', str);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Rectangle {\n   int x1;\n   int x2;\n   int y1;\n   int y2;\n   Rectangle() {}\n   Rectangle(int a, int b, int c, int d) {\n     x1 = a;\n     y1 = b;\n     x2 = c;\n     y2 = d;\n     if (x1 > x2) {\n       swap(x1, x2);\n     }\n     if (y1 > y2) {\n       swap(y1, y2);\n     }\n   }\n   bool operator<(Rectangle r) const {\n     if (x1 != r.x1) {\n       return x1 < r.x1;\n     } else if (x2 != r.x2) {\n       return x2 < r.x2;\n     } else if (y1 != r.y1) {\n       return y1 < r.y1;\n     } else {\n       return y2 < r.y2;\n     }\n   }\n };\n int Area(Rectangle r) { return (r.x2 - r.x1) * (r.y2 - r.y1); }\n set<Rectangle> rec;\n set<Rectangle> lines;\n int main() {\n   int W, H, N;\n   scanf('%d', &W);\n   ;\n   scanf('%d', &H);\n   ;\n   scanf('%d', &N);\n   ;\n   rec.insert(Rectangle(0, 0, W, H));\n   for (int(n) = 0; n < (int)N; n++) {\n     int a, b, c, d;\n     scanf('%d', &a);\n     ;\n     scanf('%d', &b);\n     ;\n     scanf('%d', &c);\n     ;\n     scanf('%d', &d);\n     ;\n     lines.insert(Rectangle(a, b, c, d));\n   }\n   for (int(n) = 0; n < (int)N; n++) {\n     for (__typeof(rec).begin() t = rec.begin(); t != rec.end(); t++) {\n       Rectangle r = *t;\n       for (__typeof(lines).begin() it = lines.begin(); it != lines.end();\n            it++) {\n         if (it->x1 == it->x2) {\n           if (r.x1 < it->x1 && it->x2 < r.x2 && r.y1 == it->y1 &&\n               r.y2 == it->y2) {\n             lines.erase(lines.find(*it));\n             rec.erase(*t);\n             rec.insert(Rectangle(r.x1, r.y1, it->x2, r.y2));\n             rec.insert(Rectangle(it->x2, r.y1, r.x2, r.y2));\n             goto end;\n           }\n         } else if (it->y1 == it->y2) {\n           if (r.y1 < it->y1 && it->y2 < r.y2 && r.x1 == it->x1 &&\n               r.x2 == it->x2) {\n             lines.erase(lines.find(*it));\n             rec.erase(*t);\n             rec.insert(Rectangle(r.x1, r.y1, r.x2, it->y1));\n             rec.insert(Rectangle(r.x1, it->y1, r.x2, r.y2));\n             goto end;\n           }\n         }\n       }\n     }\n   end:\n     int sol = 42;\n   }\n   vector<int> res;\n   for (__typeof(rec).begin() it = rec.begin(); it != rec.end(); it++) {\n     res.push_back(Area(*it));\n   }\n   sort(res.begin(), res.end());\n   for (__typeof(res).begin() it = res.begin(); it != res.end(); it++) {\n     printf(' %d', *it);\n   }\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 1e3 + 10;\n long long q, x, v, u, w, ans;\n map<long long, long long> len;\n int main() {\n   cin >> q;\n   for (int i = 1; i <= q; i++) {\n     cin >> x >> v >> u;\n     if (x == 1) {\n       cin >> w;\n       while (v != u) {\n         if (v > u) {\n           len[v] += w;\n           v = v / 2;\n         } else {\n           len[u] += w;\n           u = u / 2;\n         }\n       }\n     } else {\n       ans = 0;\n       while (v != u) {\n         if (v > u) {\n           ans += len[v];\n           v = v / 2;\n         } else {\n           ans += len[u];\n           u = u / 2;\n         }\n       }\n       cout << ans << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1000000000000000000ll;\n long long x[6], y[6];\n int main() {\n   ios_base::sync_with_stdio(0);\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> x[i] >> y[i];\n   if (n == 1) {\n     cout << -1 << endl;\n     return 0;\n   }\n   if (n == 2) {\n     if (x[0] == x[1] || y[0] == y[1]) {\n       cout << -1 << endl;\n       return 0;\n     }\n     long long s = (abs(x[0] - x[1]) * abs(y[0] - y[1]));\n     cout << s << endl;\n     return 0;\n   }\n   long long X = 0, Y = 0;\n   for (int i = 1; i < n; i++) {\n     X = max(X, abs(x[0] - x[i]));\n     Y = max(Y, abs(y[0] - y[i]));\n   }\n   cout << X * Y << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n const long long LINF = 0x3f3f3f3f3f3f3f3f;\n const int MOD = (int)1e9 + 7;\n const int N = (int)3e5 + 7;\n char read_char() {\n   char c;\n   for (;;) {\n     c = getchar();\n     if (c >= 'A' && c <= 'Z') return c;\n   }\n }\n long long powmod(long long a, long long b) {\n   long long res = 1;\n   a %= MOD;\n   for (; b; b >>= 1) {\n     if (b & 1) res = res * a % MOD;\n     a = a * a % MOD;\n   }\n   return res;\n }\n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n long long add(long long a, long long b) {\n   a = ((a + b) % MOD + MOD) % MOD;\n   return a;\n }\n long long mul(long long a, long long b) { return a * b % MOD; }\n int n, p, cnt[N], tmp[N];\n pair<int, int> a[N];\n void Init() {\n   memset(cnt, 0, sizeof(cnt));\n   for (int i = (0); i < (n); ++i) {\n     int u, v;\n     scanf('%d%d', &u, &v);\n     if (u > v) swap(u, v);\n     a[i].first = u, a[i].second = v;\n     cnt[u]++;\n     cnt[v]++;\n   }\n   for (int i = (1); i < (n + 1); ++i) tmp[i] = cnt[i];\n   sort(tmp + 1, tmp + n + 1);\n   sort(a, a + n);\n }\n int Solve() {\n   long long ans = 0;\n   for (int i = n, j = 1; j < i; i--) {\n     while (tmp[j] + tmp[i] < p && j < i) j++;\n     ans += i - j;\n   }\n   for (int i = 0, j; i < n; i = j) {\n     j = i + 1;\n     while (j < n && a[i] == a[j]) j++;\n     int u = a[i].first, v = a[i].second;\n     if (cnt[u] + cnt[v] >= p && cnt[u] + cnt[v] - (j - i) < p) {\n       ans--;\n     }\n   }\n   return !printf('%lld\n', ans);\n }\n int main() {\n   while (~scanf('%d%d', &n, &p)) {\n     Init();\n     Solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<long long, long long> s;\n long long n, b[500005], c[500005];\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     long long x;\n     cin >> x;\n     s[x]++;\n   }\n   long long m, mx1 = 0, mx2 = 0, index = 1;\n   cin >> m;\n   for (int i = 0; i < m; i++) {\n     cin >> b[i];\n   }\n   for (int i = 0; i < m; i++) {\n     cin >> c[i];\n   }\n   for (int i = 0; i < m; i++) {\n     if (s[b[i]] > mx1) {\n       mx1 = s[b[i]];\n       index = i + 1;\n     }\n   }\n   for (int i = 0; i < m; i++) {\n     if (s[b[i]] == mx1) {\n       if (s[c[i]] > mx2) {\n         index = i + 1;\n         mx2 = s[c[i]];\n       }\n     }\n   }\n   cout << index << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX_N = 1010;\n const double EPS = 0.0000001;\n struct Point {\n   int x, y;\n   Point() {}\n   Point(int a, int b) : x(a), y(b) {}\n };\n int n;\n long long k;\n Point centers[MAX_N];\n int radii[MAX_N];\n double GetDist(int x1, int y1, int x2, int y2) {\n   return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n }\n void AddEvents(vector<pair<double, int> > &events, double ang1, double ang2) {\n   for (int i = 0; i < 3; ++i) {\n     events.push_back(make_pair(ang1 + i * 2 * M_PI + EPS, 1));\n     events.push_back(make_pair(ang2 + i * 2 * M_PI - EPS, -1));\n   }\n }\n int main() {\n   cin >> n >> k;\n   for (int i = 1; i <= n; ++i) {\n     int x, y;\n     cin >> x >> y >> radii[i];\n     centers[i] = Point(x, y);\n   }\n   int best = 0;\n   for (int i = 1; i <= n; ++i) {\n     vector<pair<double, int> > events;\n     int cnt = 0;\n     for (int j = 1; j <= n; ++j) {\n       if (i != j) {\n         double ang =\n             atan2(centers[j].y - centers[i].y, centers[j].x - centers[i].x);\n         double d =\n             GetDist(centers[i].x, centers[i].y, centers[j].x, centers[j].y);\n         double u1 = asin((radii[i] - radii[j]) / d);\n         double u2 = asin((radii[i] + radii[j]) / d);\n         AddEvents(events, ang + u1 - M_PI / 2, ang + u2 - M_PI / 2);\n         AddEvents(events, ang - u2 + M_PI / 2, ang - u1 + M_PI / 2);\n       }\n     }\n     sort(events.begin(), events.end());\n     for (size_t j = 0; j < events.size(); ++j) {\n       cnt += events[j].second;\n       if (cnt < 0) {\n         cnt = 0;\n       }\n       best = max(best, cnt);\n     }\n   }\n   long long sol = k * (k + 1) / 2 + (k + 1) * best + (n - best);\n   cout << sol << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long calc(const long long &x, const long long &pow, const long long &pp) {\n   long long res = 1, tmp = (x % pp);\n   long long cur = pow;\n   while (cur > 0) {\n     if (cur % 2 == 0) {\n       tmp = (tmp * tmp) % pp;\n       cur = cur / 2;\n     } else {\n       res = (res * tmp) % pp;\n       cur = cur - 1;\n     }\n   }\n   return res;\n }\n int obr() {\n   long long k, l, r, p;\n   cin >> k >> l >> r >> p;\n   long long ans;\n   if (p == 2) {\n     cout << (1 - (k % 2)) << endl;\n     return 0;\n   }\n   if (k == 1)\n     ans = 2 % p;\n   else {\n     long long st_l = calc(2, l, p - 1), st_r = calc(2, r + 1, p - 1);\n     long long rev_2 = (p + 1) / 2;\n     long long ch = (calc(k, st_r, p) + p - 1) % p;\n     long long zn = (calc(k, st_l, p) + p - 1) % p;\n     if (k % p == 0) zn = ch = p - 1;\n     if (zn == 0) {\n       ch = calc(2, r - l + 1, p);\n     } else {\n       zn = calc(zn, p - 2, p);\n       ch = (ch * zn) % p;\n     }\n     if (k % 2) {\n       long long to_div = calc(rev_2, r - l, p);\n       ch = (ch * to_div) % p;\n     }\n     ans = ch;\n   }\n   cout << ans << endl;\n   return 0;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   int t;\n   cin >> t;\n   for (int i = 1; i <= t; ++i) obr();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n int x[500010], y[500010];\n bitset<2010 * 2> A[2010];\n void Work() {\n   for (int i = 1; i <= n; i++) {\n     int t = i;\n     for (int j = i + 1; j <= n; j++)\n       if (A[j][i]) t = j;\n     swap(A[i], A[t]);\n     for (int j = 1; j <= n; j++)\n       if (A[j][i] && j != i) A[j] ^= A[i];\n   }\n   for (int i = 1; i <= m; i++)\n     if (A[y[i]][x[i] + n])\n       puts('NO');\n     else\n       puts('YES');\n }\n void Init() {\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= m; i++) {\n     scanf('%d%d', &x[i], &y[i]);\n     A[x[i]][y[i]] = 1;\n   }\n   for (int i = 1; i <= n; i++) A[i][i + n] = 1;\n }\n int main() {\n   Init();\n   Work();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int MAXN = 60;\n int n, P, A[MAXN];\n const int mod = 1000000007;\n void reduce(int& x) { x += x >> 31 & mod; }\n int mul(int a, int b) { return (long long)a * b % mod; }\n int pow(int a, int b, int res = 1) {\n   for (; b; b >>= 1, a = mul(a, a))\n     if (b & 1) res = mul(res, a);\n   return res;\n }\n int dp[MAXN][MAXN][MAXN];\n int main() {\n   std::ios_base::sync_with_stdio(false), std::cin.tie(0);\n   std::cin >> n >> P;\n   for (int i = 1; i <= n; ++i) std::cin >> A[i];\n   dp[0][0][0] = 1;\n   for (int i = 1; i <= n; ++i)\n     for (int j = 0; j <= i; ++j)\n       for (int k = 0; k <= i; ++k)\n         if (dp[i - 1][j][k]) {\n           if (A[i] == 0 || A[i] == -1) {\n             int t = pow(2, i - 1 - (!!k), dp[i - 1][j][k]);\n             reduce(dp[i][j + 1][k] += t - mod);\n             if (k) reduce(dp[i][j][k] += t - mod);\n           }\n           if (A[i] == 1 || A[i] == -1) {\n             int t = pow(2, i - 1 - (!!j), dp[i - 1][j][k]);\n             reduce(dp[i][j][k + 1] += t - mod);\n             if (j) reduce(dp[i][j][k] += t - mod);\n           }\n         }\n   int ans = 0;\n   for (int i = 0; i <= n; ++i)\n     for (int j = 0; j <= n; ++j)\n       if ((i + j & 1) == P) reduce(ans += dp[n][i][j] - mod);\n   std::cout << ans << std::endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   char s[200001], t1[200001];\n   long long n, x, y, t, con = 0;\n   cin >> n >> x >> y;\n   getchar();\n   gets(s);\n   t = n - x;\n   for (long long i = t; s[i] != '\0'; i++) {\n     if (i == n - 1 - y && s[i] != '1') con++;\n     if (i != n - 1 - y && s[i] != '0') con++;\n   }\n   cout << con << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int k, r;\n   cin >> k >> r;\n   int n = 1;\n   while (true) {\n     if ((k * n - r) % 10 == 0 || (k * n) % 10 == 0) {\n       cout << n << '\n';\n       return 0;\n     }\n     n++;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n using namespace std;\n template <class c>\n struct rge {\n   c b, e;\n };\n template <class c>\n rge<c> range(c h, c n) {\n   return {h, n};\n }\n template <class c>\n auto dud(c* r) -> decltype(cerr << *r);\n template <class c>\n char dud(...);\n struct muu {\n   template <class c>\n   muu& operator<<(const c&) {\n     return *this;\n   }\n   muu& operator()() { return *this; }\n };\n const int N = 1e5 + 7;\n long long tab[N];\n int n;\n long long inf = 1e18;\n void fail() {\n   printf('No\n');\n   exit(0);\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 2; i <= n; i += 2) scanf('%lld', tab + i);\n   long long sum = 0;\n   for (int i = 2; i <= n; i += 2) {\n     long long nsum = inf;\n     for (int d = 1; d * d <= tab[i]; ++d) {\n       if (tab[i] % d == 0) {\n         long long a = (tab[i] / d) - d;\n         long long b = (tab[i] / d) + d;\n         if (a % 2 == 0 && b % 2 == 0) {\n           if (a * a > 4 * sum) {\n             nsum = min(nsum, (b * b) / 4);\n           }\n         }\n       }\n     }\n     (muu() << __FUNCTION__ << '#' << 67 << ': ') << i << ' ' << nsum;\n     if (nsum == inf) fail();\n     tab[i - 1] = nsum - sum - tab[i];\n     sum = nsum;\n   }\n   printf('Yes\n');\n   for (int i = 1; i <= n; ++i) printf('%lld ', tab[i]);\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 3e5 + 50;\n vector<int> e[N];\n int dp[N], res, deg[N];\n void dfs(int u, int pre) {\n   dp[u] = deg[u];\n   for (int v : e[u]) {\n     if (v == pre) continue;\n     dfs(v, u);\n     res = max(res, dp[u] + dp[v]);\n     dp[u] = max(dp[u], dp[v] + deg[u] - 2 + 1);\n   }\n }\n int main() {\n   int t;\n   scanf('%d', &t);\n   while (t--) {\n     int n;\n     scanf('%d', &n);\n     for (int i = 1; i <= n; i++) e[i].clear(), deg[i] = 0;\n     for (int i = 0; i < n - 1; i++) {\n       int u, v;\n       scanf('%d%d', &u, &v);\n       e[u].push_back(v);\n       e[v].push_back(u);\n       deg[u]++;\n       deg[v]++;\n     }\n     res = 0;\n     dfs(1, 0);\n     printf('%d\n', res);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n const int maxN = (int)1e6 + 10;\n vector<int> g[maxN];\n int p[maxN];\n int a[maxN];\n long long s = 0;\n long long tr[maxN];\n set<long long> all;\n void dfs(int v) {\n   tr[v] = a[v];\n   for (int to : g[v]) {\n     dfs(to);\n     tr[v] += tr[to];\n   }\n   if (s % tr[v] == 0) {\n     all.insert(tr[v]);\n   }\n }\n int val[maxN];\n const int mod = (int)1e9 + 7;\n int sum(int a, int b) {\n   int s = a + b;\n   if (s >= mod) s -= mod;\n   return s;\n }\n set<long long> ok;\n long long id[maxN];\n long long sm[maxN];\n map<long long, int> f;\n int dp[maxN];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n     s += a[i];\n   }\n   for (int i = 1; i < n; i++) {\n     cin >> p[i];\n     g[p[i]].push_back(i + 1);\n   }\n   dfs(1);\n   int sz = 1;\n   int oth = 1;\n   for (long long t : all) {\n     memset(sm, 0, sizeof sm);\n     bool can = true;\n     for (int i = n; i >= 1; i--) {\n       if (sm[i] + a[i] > t) {\n         can = false;\n         break;\n       }\n       if (sm[i] + a[i] == t) {\n         continue;\n       }\n       if (i == 1) {\n         can = false;\n         break;\n       }\n       sm[p[i - 1]] += (sm[i] + a[i]);\n     }\n     if (can) {\n       f[t] = oth;\n       oth++;\n       ok.insert(t);\n     }\n   }\n   for (long long x : ok) {\n     int id = f[x];\n     dp[id] = 1;\n     for (long long y : ok) {\n       if (y >= x) continue;\n       if (x % y == 0) dp[id] = sum(dp[id], dp[f[y]]);\n     }\n   }\n   cout << dp[f[s]];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n const long long LINF = 0x3f3f3f3f3f3f3f3f;\n const int MOD = (int)1e9 + 7;\n const int N = (int)2e5 + 7;\n int tree[N << 1];\n void update(int x, int n) {\n   x += n;\n   if (tree[x]) return;\n   while (x) {\n     tree[x]++;\n     x >>= 1;\n   }\n }\n int query(int l, int r, int n) {\n   int re = 0;\n   l += n, r += n;\n   while (l <= r) {\n     if (l & 1) re += tree[l++];\n     if (~r & 1) re += tree[r--];\n     l >>= 1, r >>= 1;\n   }\n   return re;\n }\n pair<int, int> p[N];\n vector<int> x;\n int l[N];\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = (0); i < (n); ++i) {\n     scanf('%d%d', &p[i].first, &p[i].second);\n     x.push_back(p[i].first);\n   }\n   sort((x).begin(), (x).end());\n   sort(p, p + n);\n   for (int i = (0); i < (n); ++i) {\n     p[i].first = lower_bound((x).begin(), (x).end(), p[i].first) - x.begin();\n     swap(p[i].first, p[i].second);\n   }\n   sort(p, p + n);\n   long long ans = 0;\n   for (int i = n - 1, j; i >= 0; i = j) {\n     for (j = i; j >= 0 && p[i].first == p[j].first; j--)\n       ;\n     int z = 0;\n     for (int k = (j + 1); k < (i + 1); ++k) {\n       l[k] = query(z, p[k].second - 1, n);\n       update(p[k].second, n);\n       z = p[k].second + 1;\n     }\n     for (int k = (j + 1); k < (i + 1); ++k) {\n       ans += (long long)(l[k] + 1) * (query(p[k].second + 1, n, n) + 1);\n     }\n   }\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   double l, p, q;\n   cin >> l >> p >> q;\n   double qq = l / (p + q) * p;\n   cout << setiosflags(ios::fixed);\n   cout << setprecision(4) << qq;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long exp(long long x, long long y) {\n   x %= 1000000007;\n   long long res = 1;\n   while (y) {\n     if (y & 1) res = res * x % 1000000007;\n     x = x * x % 1000000007;\n     y >>= 1;\n   }\n   return res;\n }\n long long fact(long long n) {\n   long long res = 1;\n   for (long long i = 2; i <= n; ++i) (res *= i) %= 1000000007;\n   return res;\n }\n bool isprime(long long n) {\n   for (long long i = 2; i * i <= n; ++i)\n     if (n % i == 0) return 0;\n   return 1;\n }\n int main() {\n   int n, m;\n   cin >> n >> m;\n   const long long inf = 1e17;\n   vector<long long> sum(n), pre(n), s(n);\n   vector<long long> t(n);\n   for (int i = 0; i < n; ++i) {\n     int x;\n     cin >> x;\n     long long val = -inf;\n     long long mx = -inf;\n     vector<long long> v1, v2;\n     for (int j = 0; j < x; ++j) {\n       long long k;\n       cin >> k;\n       val = max(k, val + k);\n       mx = max(mx, val);\n       v1.push_back(k);\n       v2.push_back(k);\n     }\n     t[i] = mx;\n     for (int j = 1; j < x; ++j) v1[j] += v1[j - 1];\n     for (int j = x - 2; j >= 0; --j) v2[j] += v2[j + 1];\n     sum[i] = v1[x - 1];\n     pre[i] = *max_element(v1.begin(), v1.end());\n     s[i] = *max_element(v2.begin(), v2.end());\n   }\n   long long to = -inf;\n   vector<int> v(m + 1);\n   for (int i = 1; i <= m; ++i) {\n     cin >> v[i];\n     to = max(to, t[v[i] - 1]);\n   }\n   long long dp[m + 1][3];\n   memset(dp, 0, sizeof(dp));\n   for (int i = 1; i <= m; ++i) {\n     dp[i][0] = s[v[i] - 1];\n     dp[i][1] = max(dp[i - 1][0] + sum[v[i] - 1], dp[i - 1][1] + sum[v[i] - 1]);\n     dp[i][2] = max(dp[i - 1][0] + pre[v[i] - 1], dp[i - 1][1] + pre[v[i] - 1]);\n   }\n   long long ans = -inf;\n   for (int i = 1; i <= m; ++i) ans = max(ans, dp[i][2]);\n   cout << max(ans, to);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = -1;\n struct disk {\n   long long L;\n   double p;\n   disk(long long L = 0, double p = 0.) : L(L), p(p) {}\n };\n bool operator<(disk a, disk b) {\n   return (a.L * a.p * (1 - b.p)) > (b.L * b.p * (1 - a.p));\n }\n int n;\n vector<disk> P;\n int main() {\n   while (cin >> n) {\n     P.resize(n);\n     for (int i = (0); i < (int)(n); i++)\n       scanf('%lld %lf', &P[i].L, &P[i].p), P[i].p /= 100;\n     sort(P.begin(), P.end());\n     double ans = 0., E = 0.;\n     for (int i = ((int)n) - 1; i >= 0; i--) {\n       disk D = P[i];\n       ans += D.L * (1 + E * D.p);\n       E = D.p * E + (1 - D.p) * (E + 1);\n     }\n     printf('%.6f\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long i, n, now, ans, hh, m, p = 1000000009;\n int main() {\n   scanf('%lld', &n);\n   if (n == 2) {\n     puts('10');\n     return 0;\n   }\n   m = n / 2;\n   now = 4;\n   hh = 1;\n   for (i = 3; i <= m; i++) {\n     now = now * 2 % p;\n     hh = hh * (now - 3) % p;\n     ans = (ans + hh) % p;\n   }\n   ans = ans * 4 + 6;\n   ans %= p;\n   ans = ans * ans % p;\n   ans++;\n   ans = ans * 2 % p;\n   printf('%lld', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int m(int x, int md) { return (((x) % md) + md) % md; }\n void solve() {\n   int n;\n   cin >> n;\n   vector<int> a(n);\n   for (int i = 0; i < n; i++) cin >> a[i];\n   set<int> st;\n   for (int r = 0; r < n; r++) {\n     st.insert(m(r + a[r], n));\n   }\n   if (st.size() == n)\n     cout << 'YES\n';\n   else\n     cout << 'NO\n';\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int T;\n   cin >> T;\n   for (int testcase = 1; testcase <= T; testcase++) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct event {\n   int pos, type, p;\n   event(int pos = 0, int type = -1, int p = 0) : pos(pos), type(type), p(p) {}\n   bool operator<(const event &e) const {\n     if (pos == e.pos) return type < e.type;\n     return pos < e.pos;\n   }\n };\n const int maxE = 5e5 + 10;\n event E[maxE];\n int cnt[111];\n double fpow(double a, int n) {\n   double r = 1;\n   for (; n; n = n >> 1) {\n     if (n & 1) r *= a;\n     a = a * a;\n   }\n   return r;\n }\n int main() {\n   memset((cnt), (0), sizeof(cnt));\n   int n, m, x, h, l, r, sz = 0, b, z;\n   scanf('%d%d', &n, &m);\n   for (int _n(n), i(0); i < _n; i++) {\n     scanf('%d%d%d%d', &x, &h, &l, &r);\n     l = 100 - l;\n     r = 100 - r;\n     E[sz++] = event(x - h, 0, l);\n     E[sz++] = event(x, 0, -1 - l);\n     E[sz++] = event(x + 1, 0, r);\n     E[sz++] = event(x + h + 1, 0, -1 - r);\n   }\n   for (int _n(m), i(0); i < _n; i++) {\n     scanf('%d%d', &b, &z);\n     E[sz++] = event(b, z);\n   }\n   sort(E, E + sz);\n   double expectation = 0, pro = 0;\n   for (int _n(sz), i(0); i < _n; i++) {\n     if (E[i].type == 0) {\n       if (E[i].p >= 0) {\n         cnt[E[i].p]++;\n       } else\n         cnt[-E[i].p - 1]--;\n     } else {\n       pro = 1;\n       for (int _n(101), i(0); i < _n; i++) pro *= fpow(0.01 * i, cnt[i]);\n       expectation += pro * E[i].type;\n     }\n   }\n   printf('%.7f\n', expectation);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX_N = 100011;\n const long long INF = (1 << 29) + 123;\n const long long MOD = 1000000007;\n const long double PI = 4 * atan((long double)1);\n int fenw[2 * MAX_N];\n int n;\n void mod(int i, int v) {\n   while (i <= n) {\n     fenw[i] += v;\n     i += i & -i;\n   }\n }\n int query(int i) {\n   int sum = 0;\n   while (i > 0) {\n     sum += fenw[i];\n     i -= i & -i;\n   }\n   return sum;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n;\n   vector<pair<int, int> > p;\n   int x[n], v[n];\n   for (int i = 0; i < n; i++) cin >> x[i];\n   for (int i = 0; i < n; i++) {\n     cin >> v[i];\n     p.push_back(make_pair(v[i], x[i]));\n   }\n   unordered_map<int, int> m;\n   int rev_map[n];\n   sort(x, x + n);\n   for (int i = 0; i < n; i++) {\n     m[x[i]] = i + 1;\n     rev_map[i] = x[i];\n   }\n   for (int i = 0; i < n; i++) {\n     p[i].second = m[p[i].second];\n   }\n   sort(p.begin(), p.end());\n   long long ans = 0;\n   for (int i = 0; i < n; i++) {\n     int q = query(p[i].second);\n     ans += 1LL * q * rev_map[p[i].second - 1];\n     ans -=\n         1LL * ((n - i - 1) - (p[i].second - 1 - q)) * rev_map[p[i].second - 1];\n     mod(p[i].second, 1);\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long V[10005], O[10005], F[1005][10005];\n int c[1005], cost[1005];\n int n, W, B, X;\n struct Queue {\n   int p[1005], q[1005];\n   long long maxp[1005], maxq[1005];\n   void clear() {\n     *p = 0;\n     *q = 0;\n     maxp[0] = maxq[0] = -1;\n   }\n   void add(int x) {\n     q[++*q] = x;\n     maxq[*q] = max(maxq[(*q) - 1], V[x]);\n   }\n   void del() {\n     if (*p)\n       --*p;\n     else {\n       for (; *q; --*q) ++*p, maxp[*p] = max(maxp[(*p) - 1], V[p[*p] = q[*q]]);\n       --*p;\n     }\n   }\n   long long ask() { return max(maxp[*p], maxq[*q]); }\n } G;\n int main() {\n   scanf('%d%d%d%d', &n, &W, &B, &X);\n   for (int i = 1; i <= n; i++) scanf('%d', &c[i]);\n   for (int i = 1; i <= n; i++) scanf('%d', &cost[i]);\n   memset(F, -1, sizeof(F));\n   F[0][0] = W;\n   int sum = 0;\n   for (int i = 1; i <= n; i++) {\n     sum += c[i];\n     for (int j = 0; j <= sum; j++) {\n       for (int k = max(j - c[i], 0); k <= j; k++)\n         if (F[i - 1][k] >= 1ll * cost[i] * (j - k))\n           F[i][j] = max(F[i][j], F[i - 1][k] - 1ll * cost[i] * (j - k));\n       if (F[i][j] != -1) {\n         F[i][j] += X;\n         F[i][j] = min(F[i][j], W + 1ll * j * B);\n       }\n     }\n   }\n   for (int k = sum; k >= 0; k--)\n     if (F[n][k] >= 0) {\n       printf('%d\n', k);\n       return 0;\n     }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, p1 = 0, p2 = 0;\n   cin >> n;\n   int mid[1000], index = 0;\n   for (int i = 0; i < n; i++) {\n     int a;\n     cin >> a;\n     if (a % 2 == 0) {\n       for (int j = 1; j <= (a / 2); j++) {\n         int t;\n         cin >> t;\n         p1 += t;\n       }\n       for (int j = 1; j <= (a / 2); j++) {\n         int t;\n         cin >> t;\n         p2 += t;\n       }\n     } else {\n       for (int j = 1; j <= (a / 2); j++) {\n         int t;\n         cin >> t;\n         p1 += t;\n       }\n       cin >> mid[index++];\n       for (int j = 1; j <= (a / 2); j++) {\n         int t;\n         cin >> t;\n         p2 += t;\n       }\n     }\n   }\n   sort(mid, mid + index);\n   for (int i = index - 1; i >= 0; i--) {\n     if (((index - 1) % 2 == 0 && i % 2 == 0) ||\n         ((index - 1) % 2 == 1 && i % 2 == 1))\n       p1 += mid[i];\n     else\n       p2 += mid[i];\n   }\n   cout << p1 << ' ' << p2 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 6010;\n vector<int> a[N];\n int L[N], cnt, r[N], n, res = 0;\n void Refresh() {\n   L[0] = cnt = 0;\n   for (int i = 1; i <= n + 1; i++) L[i] = 10000000;\n }\n void DFS(int u, int p) {\n   int Oldval, Oldid, Oldcnt = cnt;\n   if (cnt == 0 || r[u] > L[cnt])\n     L[++cnt] = r[u];\n   else {\n     Oldid = lower_bound(L, L + n + 1, r[u]) - L;\n     Oldval = L[Oldid];\n     L[Oldid] = r[u];\n   }\n   res = max(res, cnt);\n   for (int i = 0; i < a[u].size(); i++) {\n     int v = a[u][i];\n     if (v != p) DFS(v, u);\n   }\n   if (Oldcnt != cnt)\n     L[cnt--] = 10000000;\n   else\n     L[Oldid] = Oldval;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   int u, v;\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> r[i];\n   for (int i = 1; i < n; i++) {\n     cin >> u >> v;\n     a[u].push_back(v);\n     a[v].push_back(u);\n   }\n   for (int i = 1; i <= n; i++) {\n     Refresh();\n     DFS(i, 0);\n   }\n   cout << res;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long pow1(int a, int b) {\n   long long res = 1;\n   for (int i = 1; i <= b; i++) res *= a;\n   return res;\n }\n int main() {\n   int n;\n   cin >> n;\n   long long sum = 2 * (pow1(2, n) - 1);\n   cout << sum << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int gcd(long long int a, long long int b) {\n   if (b == 0)\n     return a;\n   else\n     return gcd(b, a % b);\n }\n bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {\n   return (a.second < b.second);\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   std::cout.precision(12);\n   int t;\n   cin >> t;\n   while (t--) {\n     bool f = 0;\n     int n, m;\n     cin >> n >> m;\n     char a[n][m];\n     char ans[n][m];\n     vector<pair<int, int>> v[26];\n     int ma = -1;\n     int r, c;\n     for (long long int i = 0; i < n; i++) {\n       for (long long int j = 0; j < m; j++) {\n         cin >> a[i][j];\n         ans[i][j] = '.';\n         if (a[i][j] >= 97 && a[i][j] <= 'z') {\n           v[a[i][j] - 'a'].push_back({i + 1, j + 1});\n           if (a[i][j] - 'a' > ma) {\n             ma = a[i][j] - 'a';\n             r = i + 1;\n             c = j + 1;\n           }\n         }\n       }\n     }\n     vector<pair<int, int>> start[ma + 1], end[ma + 1];\n     for (long long int i = 0; i < ma + 1; i++) {\n       if (v[i].size() == 0) {\n         start[i].push_back({r, c});\n         end[i].push_back({r, c});\n       } else if (v[i].size() == 1) {\n         ans[v[i][0].first - 1][v[i][0].second - 1] = 'a' + i;\n         start[i].push_back({v[i][0].first, v[i][0].second});\n         end[i].push_back({v[i][0].first, v[i][0].second});\n       } else {\n         if (v[i][1].first == v[i][0].first) {\n           int mi = m + 6, m = 0;\n           for (int j = 0; j < v[i].size(); j++) {\n             if (v[i][j].first != v[i][0].first) {\n               f = 1;\n               break;\n             }\n             mi = min(mi, v[i][j].second);\n             m = max(m, v[i][j].second);\n           }\n           if (f == 1) break;\n           for (int j = mi - 1; j < m; j++) {\n             ans[v[i][0].first - 1][j] = 'a' + i;\n           }\n           start[i].push_back({v[i][0].first, mi});\n           end[i].push_back({v[i][0].first, m});\n         } else if (v[i][1].second == v[i][0].second) {\n           int mi = n + 6, m = 0;\n           for (int j = 0; j < v[i].size(); j++) {\n             if (v[i][j].second != v[i][0].second) {\n               f = 1;\n               break;\n             }\n             mi = min(mi, v[i][j].first);\n             m = max(m, v[i][j].first);\n           }\n           if (f == 1) break;\n           for (int j = mi - 1; j < m; j++) {\n             ans[j][v[i][0].second - 1] = 'a' + i;\n           }\n           start[i].push_back({mi, v[i][0].second});\n           end[i].push_back({m, v[i][0].second});\n         } else {\n           f = 1;\n           break;\n         }\n       }\n     }\n     for (long long int i = 0; i < n; i++) {\n       for (long long int j = 0; j < m; j++) {\n         if (a[i][j] != ans[i][j]) {\n           f = 1;\n           break;\n         }\n       }\n       if (f == 1) break;\n     }\n     if (f == 0) {\n       cout << 'YES\n';\n       cout << ma + 1 << endl;\n       for (long long int i = 0; i < ma + 1; i++)\n         cout << start[i][0].first << ' ' << start[i][0].second << ' '\n              << end[i][0].first << ' ' << end[i][0].second << endl;\n     } else {\n       cout << 'NO\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n const long long linf = 4000000000000000000LL;\n const long long inf = 998244353;\n const long double pi = 3.1415926535;\n void pv(vector<int> a) {\n   for (auto& x : a) cout << x << ' ';\n   cout << '\n';\n }\n void pv(vector<long long> a) {\n   for (auto& x : a) cout << x << ' ';\n   cout << '\n';\n }\n void pv(vector<vector<int>> a) {\n   for (int i = (0); i < (int(a.size())); ++i) {\n     cout << i << '\n';\n     pv(a[i]);\n     cout << '\n';\n   }\n }\n void pv(vector<vector<long long>> a) {\n   for (int i = (0); i < (int(a.size())); ++i) {\n     cout << i << '\n';\n     pv(a[i]);\n   }\n   cout << '\n';\n }\n void pv(vector<string> a) {\n   for (auto& x : a) cout << x << '\n';\n   cout << '\n';\n }\n void build_primes(vector<int>& primes, int size) {\n   vector<int> visited;\n   visited.resize(size, 0);\n   for (int i = (2); i < (size); ++i) {\n     if (visited[i] == 0) {\n       primes.push_back(i);\n       int a = i;\n       while (a < size) {\n         visited[a] = 1;\n         a += i;\n       }\n     }\n   }\n }\n vector<vector<long long>> matrix_mult(vector<vector<long long>>& a,\n                                       vector<vector<long long>>& b) {\n   int n = a.size();\n   vector<vector<long long>> answer;\n   answer.resize(n);\n   for (int i = 0; i < n; i++) answer[i].resize(n, 0);\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       for (int k = 0; k < n; k++)\n         answer[i][j] = (answer[i][j] + a[i][k] * b[k][j]) % inf;\n     }\n   }\n   return answer;\n }\n int modInverse(int a, int m) {\n   int m0 = m;\n   int y = 0, x = 1;\n   if (m == 1) return 0;\n   while (a > 1) {\n     int q = a / m;\n     int t = m;\n     m = a % m, a = t;\n     t = y;\n     y = x - q * y;\n     x = t;\n   }\n   if (x < 0) x += m0;\n   return x;\n }\n long long power(long long x, long long y) {\n   long long k = 1LL << 60;\n   long long z = 1;\n   while (k != 0) {\n     z *= z;\n     z %= inf;\n     if (y >= k) {\n       z *= x;\n       z %= inf;\n       y -= k;\n     }\n     k >>= 1;\n   }\n   return z;\n }\n struct point {\n   long double x, y;\n   bool operator<(const point& rhs) const {\n     if (x == rhs.x) return y < rhs.y;\n     return x < rhs.x;\n   }\n };\n struct pt {\n   long long x, y;\n   bool operator<(const point& rhs) const {\n     if (x == rhs.x) return y < rhs.y;\n     return x < rhs.x;\n   }\n };\n long double area(point x, point y, point z) {\n   return (x.y * y.x + y.y * z.x + z.y * x.x - x.x * y.y - y.x * z.y -\n           z.x * x.y) /\n          2.0;\n }\n bool clockwise(point x, point y, point z) { return area(x, y, z) > 0; }\n long double area(pt x, pt y, pt z) {\n   return (x.y * y.x + y.y * z.x + z.y * x.x - x.x * y.y - y.x * z.y -\n           z.x * x.y) /\n          2.0;\n }\n bool clockwise(pt x, pt y, pt z) { return area(x, y, z) > 0; }\n long long gcd(long long a, long long b) {\n   if (a > b) swap(a, b);\n   if (a == 0) return b;\n   return gcd(a, b % a);\n }\n int popcount(long long a) {\n   int count = 0;\n   while (a) {\n     count += (a & 1);\n     a >>= 1;\n   }\n   return count;\n }\n long long choose(long long n, long long r) {\n   long long p = 1, k = 1;\n   if (n - r < r) r = n - r;\n   if (r != 0) {\n     while (r) {\n       p *= n;\n       k *= r;\n       long long m = gcd(p, k);\n       p /= m;\n       k /= m;\n       n--;\n       r--;\n     }\n   } else\n     p = 1;\n   return p;\n }\n vector<long long> prefix_hash(string& a, vector<long long>& powers) {\n   int n = int(a.size());\n   vector<long long> prefix(n + 1);\n   for (int i = (0); i < (n); ++i)\n     prefix[i + 1] = (prefix[i] + powers[i] * (a[i] - 'a' + 1)) % inf;\n   return prefix;\n }\n struct custom_hash {\n   static uint64_t splitmix64(uint64_t x) {\n     x += 0x9e3779b97f4a7c15;\n     x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n     x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n     return x ^ (x >> 31);\n   }\n   uint64_t operator()(uint64_t x) const {\n     static const uint64_t FIXED_RANDOM =\n         chrono::steady_clock::now().time_since_epoch().count();\n     return splitmix64(x + FIXED_RANDOM);\n   }\n };\n struct custom_hash_fast {\n   uint64_t operator()(uint64_t x) const {\n     static const uint64_t FIXED_RANDOM =\n         chrono::steady_clock::now().time_since_epoch().count();\n     x ^= FIXED_RANDOM;\n     return x ^ (x >> 16);\n   }\n };\n void setIO(string second) {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n }\n int main() {\n   setIO('');\n   int testc;\n   cin >> testc;\n   while (testc--) {\n     int n;\n     cin >> n;\n     string a;\n     cin >> a;\n     int i = n - 1;\n     for (; i >= 0; i--)\n       if ((a[i] - '0') & 1) break;\n     if (i == -1) {\n       cout << -1 << '\n';\n       continue;\n     }\n     int j = 0;\n     for (; j < i; j++) {\n       if ((a[j] - '0') % 2 == 1) break;\n     }\n     if (j == i) {\n       cout << -1 << '\n';\n       continue;\n     }\n     cout << a[j] << a[i] << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n, m, k;\n     cin >> n >> m >> k;\n     int cardsPlayer = n / k;\n     double maxCard;\n     int jokerMax = min(m, cardsPlayer);\n     maxCard = ceil((m - jokerMax) / (k - 1.0));\n     if (jokerMax - maxCard > 0)\n       cout << jokerMax - maxCard << endl;\n     else\n       cout << 0 << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n typedef struct {\n   long long j, x1, x2;\n } inter;\n struct comp1 {\n   bool operator()(const inter& a, const inter& b) const { return a.x1 < b.x1; };\n };\n struct comp2 {\n   bool operator()(const inter& a, const inter& b) const {\n     return (a.x2 == b.x2) ? (a.x1 < b.x1) : (a.x2 < b.x2);\n   };\n };\n void solve() {\n   long long n;\n   cin >> n;\n   vector<long long> a(n), b(n), m(n);\n   unordered_map<long long, vector<long long>> dsize;\n   for (long long i = 0; i < (n); i++) {\n     cin >> a[i] >> b[i] >> m[i];\n     dsize[a[i] + b[i] - m[i]].push_back(i);\n   }\n   long long c = 0;\n   vector<long long> ea(n);\n   for (auto& x : dsize) {\n     multiset<inter, comp1> inter1;\n     multiset<inter, comp2> inter2;\n     for (auto& i : x.second) {\n       long long eamax = min(m[i], a[i]);\n       long long eamin = max(m[i] - b[i], 0LL);\n       inter1.insert(inter{i, a[i] - eamax, a[i] - eamin});\n       inter2.insert(inter{i, a[i] - eamax, a[i] - eamin});\n     }\n     auto p1 = inter1.begin();\n     while (!inter2.empty()) {\n       long long targ = inter2.begin()->x2;\n       while ((p1 == inter1.end()) ? false : (p1->x1 <= targ)) {\n         inter2.erase(*p1);\n         ea[p1->j] = a[p1->j] - targ;\n         p1++;\n       }\n       c++;\n     }\n   }\n   cout << c << endl;\n   for (long long i = 0; i < (n); i++)\n     cout << ea[i] << ' ' << m[i] - ea[i] << endl;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   ifstream ifs;\n   if (''[0]) cin.rdbuf((ifs = ifstream('')).rdbuf());\n   ;\n   ofstream ofs;\n   if (''[0]) cout.rdbuf((ofs = ofstream('')).rdbuf());\n   ;\n   ofstream lfs;\n   if (''[0]) clog.rdbuf((lfs = ofstream('')).rdbuf());\n   ;\n   int t;\n   cin >> t;\n   for (int i = 1; i <= t; i++) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1e9 + 7;\n long long a[2000], dp[2000];\n long long qmod(long long y) {\n   long long res = 1, two = (long long)2;\n   for (; y; y >>= 1) {\n     if (y & 1) res = res * two % mod;\n     two = two * two % mod;\n   }\n   return res;\n }\n int main() {\n   long long x, y;\n   int cnt = 0;\n   scanf('%lld%lld', &x, &y);\n   if (y % x) return 0 * puts('0');\n   for (long long i = 1; i <= sqrt(y); ++i) {\n     if (y % i == 0) {\n       if (i % x == 0) a[++cnt] = i;\n       if (i * i != y && y / i % x == 0) a[++cnt] = y / i;\n     }\n   }\n   sort(a + 1, a + 1 + cnt);\n   for (int i = cnt; i > 0; --i) {\n     dp[i] = qmod(y / a[i] - 1);\n     for (int j = i + 1; j <= cnt; ++j)\n       if (a[j] % a[i] == 0) dp[i] = ((dp[i] - dp[j]) % mod + mod) % mod;\n   }\n   printf('%lld\n', dp[1]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> 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<long long> &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<long long> c(k);\n   for (auto &e : c) cin >> e;\n   vector<int> pos = {0, n - x};\n   vector<pair<int, int> > 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<Mat> 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<long long> 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 <bits/stdc++.h>\n using namespace std;\n bool vis[2][100005];\n char c[2][100005];\n int main() {\n   queue<pair<int, pair<int, int> > > 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long int> 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<bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n using ll = long long int;\n using ld = long double;\n using vi = vector<int>;\n using vll = vector<ll>;\n using vd = vector<double>;\n using vvi = vector<vi>;\n int ctoi(char c) { return c - '0'; }\n int slen(string s) { return s.length(); }\n int vsize(vi a) { return (int)a.size(); }\n int in() {\n   int x;\n   cin >> x;\n   return x;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(nullptr);\n   int N;\n   cin >> N;\n   vi d(N);\n   for (auto& x : d) cin >> x;\n   int mn = abs(d[N - 1] - d[0]);\n   int a = N - 1, b = 0;\n   for (int i = 1; i < N; i++) {\n     if (abs(d[i] - d[i - 1]) < mn) {\n       mn = abs(d[i] - d[i - 1]);\n       a = i;\n       b = i - 1;\n     }\n   }\n   cout << a + 1 << ' ' << b + 1 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int result = 0;\n   for (int i = 0; i < n; i++) {\n     int k, a;\n     cin >> k >> a;\n     long x = k * a;\n     int c = 0;\n     if (a % 4 == 0) a--;\n     while (a) {\n       a /= 4;\n       c++;\n     }\n     result = (((result) < (k + c)) ? (k + c) : (result));\n   }\n   cout << result;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n, m;\n   cin >> n >> m;\n   long long x;\n   for (int i = 0; i < m; i++) {\n     cin >> x;\n     if (x > n)\n       cout << 0 << endl;\n     else {\n       if (x % 2 == 1)\n         cout << x / 2 + 1 << endl;\n       else {\n         long long a = x, b, c = n;\n         while (1) {\n           if (a % 2 == 1) break;\n           b = a + (c - a / 2);\n           a = b;\n         }\n         cout << a / 2 + 1 << endl;\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 0x3f3f3f3f;\n const int maxn = 100010;\n int x0[maxn], x1[maxn], d[maxn], c[maxn];\n int main() {\n   int n, m, y0, y1;\n   scanf('%d %d %d %d', &n, &m, &y0, &y1);\n   for (int i = 0; i < n; ++i) {\n     scanf('%d', &x0[i]);\n   }\n   memset(d, -1, sizeof(d));\n   for (int i = 0; i < m; ++i) {\n     scanf('%d', &x1[i]);\n   }\n   int p = 0, k = 0, last = -1;\n   for (int i = 0; i < n; ++i) {\n     while (p < m && abs(x0[i] - x1[p]) > abs(x0[i] - x1[p + 1])) ++p;\n     if (last < p || abs(x0[i - 1] - x1[p]) == abs(x0[i] - x1[p]))\n       ++k, last = p;\n     else if (p < m && abs(x0[i] - x1[p]) == abs(x0[i] - x1[p + 1]))\n       ++k, last = ++p;\n     else\n       last = p;\n   }\n   printf('%d\n', n - k);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string a;\n   cin >> a;\n   long long int x = a.length();\n   std::vector<long long int> v;\n   long long int c = 0;\n   long long int d = 0;\n   for (long long int i = 0; i < x; i++) {\n     if (a[i] == 'b') {\n       d++;\n     }\n     if (a[i] == 'a') {\n       if (d > 0 && c > 0) {\n         v.push_back(c);\n         d = 0;\n         c = 0;\n       }\n       c++;\n       d = 0;\n     }\n   }\n   if (c > 0) v.push_back(c);\n   long long int res = 1;\n   for (long long int i = 0; i < v.size(); i++) {\n     res = (res * (v[i] + 1)) % 1000000007;\n   }\n   cout << res - 1;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a[16], b[16];\n int main() {\n   double cnt = 0;\n   ios::sync_with_stdio(false);\n   cin >> n;\n   for (register int i = 0; i < n; i++) cin >> a[i];\n   for (register int i = 0; i < n; i++) cin >> b[i];\n   for (register int i = 0; i < 1e6; ++i) {\n     register bool f = false;\n     for (register int j = 0; !f && j < n; ++j) f |= i % a[j] == b[j];\n     cnt += f;\n   }\n   cout.setf(ios::fixed, ios::floatfield);\n   return (cout << setprecision(7) << cnt / 1e6 << endl) && 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, k1, k2;\n long long a[1005];\n long long b[1005];\n void ReadData() {\n   cin >> n >> k1 >> k2;\n   for (long long i = 1; i <= n; i++) cin >> a[i];\n   for (long long i = 1; i <= n; i++) cin >> b[i];\n }\n long long c[1005];\n void process() {\n   long long k = k1 + k2;\n   priority_queue<long long> heap;\n   for (long long i = 1; i <= n; i++) {\n     c[i] = abs(a[i] - b[i]);\n     heap.push(c[i]);\n   }\n   while (k--) {\n     long long tmp = heap.top();\n     heap.pop();\n     tmp--;\n     heap.push(abs(tmp));\n   }\n   long long res = 0;\n   while (!heap.empty()) {\n     long long tmp = heap.top();\n     heap.pop();\n     res += tmp * tmp;\n   }\n   cout << res;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   ReadData();\n   process();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1002, M = 10002;\n pair<int, long long> dp[N][M];\n map<long long, int> 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<long long> 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<int, long long> ans1 = dp[j + 1][i];\n       pair<int, long long> 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<int, long long> 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 <bits/stdc++.h>\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<int> diff;\n   set<int> 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 <bits/stdc++.h>\n using namespace std;\n vector<long int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   vector<int> v(n);\n   for (auto &x : v) cin >> x;\n   int mine = *min_element(v.begin(), v.end());\n   vector<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long> 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<WGiOi?YO:<W?6?FC5CG;36eBGGXOVK9GWGi?hGXOi?'\n     'WK9O9GFKHKYBXO9KIGHKjK4GWGiOUKYOUOgBGCWGF7EOIKiK9@WKYCjSFCWKWOH>'\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<unsigned long long, int> 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<bool> 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<int> 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<int(int)> get_ind = [&](int a) {\n     vector<int> pows;\n     map<int, int> cnt;\n     int tmp = a;\n     while (tmp > 1) {\n       int div = sieve[tmp];\n       cnt[div]++;\n       tmp /= div;\n     }\n     for (pair<int, int> p : cnt) {\n       pows.push_back(p.second);\n     }\n     sort(pows.begin(), pows.end());\n     unsigned long long h = 0;\n     for (int num : pows) {\n       h = h * 23 + num;\n     }\n     return inds[h];\n   };\n   int t;\n   cin >> t;\n   for (int i = 0; i < t; ++i) {\n     int a, b;\n     cin >> a >> b;\n     int ind1 = get_ind(a);\n     int ind2 = get_ind(b);\n     cout << real_dist[ind1][ind2] << '\n';\n   }\n }\n int main() {\n   cerr << fixed << setprecision(15);\n   cout << fixed << setprecision(15);\n   ios::sync_with_stdio(false);\n   int tests = 1;\n   for (int it = 1; it <= tests; ++it) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long t;\n   cin >> t;\n   while (t--) {\n     long long a, b, c, i, j;\n     cin >> a >> b >> c;\n     string f, s, third;\n     if (a) {\n       s = string(a + 1, '0');\n     }\n     if (c) {\n       f = string(c + 1, '1');\n     }\n     if (b) {\n       bool flag;\n       if (a == 0 && c) {\n         flag = true;\n         for (i = 0; i < b; i++) {\n           if (flag) {\n             third += '0';\n             flag = false;\n           } else {\n             third += '1';\n             flag = true;\n           }\n         }\n         cout << f << third << endl;\n         continue;\n       }\n       if (c) {\n         b--;\n       }\n       flag = true;\n       for (i = 0; i < b; i++) {\n         if (flag) {\n           third += '1';\n           flag = false;\n         } else {\n           third += '0';\n           flag = true;\n         }\n       }\n       if (a == 0 && c == 0) {\n         if (b & 1)\n           third += '0';\n         else\n           third += '1';\n       }\n     }\n     cout << f << s << third << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s1, s2;\n   cin >> s1 >> s2;\n   for (int i = 0; i < s1.size(); i++) {\n     s1[i] = tolower(s1[i]);\n     s2[i] = tolower(s2[i]);\n   }\n   if (s1 < s2) {\n     cout << -1;\n   } else if (s2 < s1) {\n     cout << 1;\n   } else {\n     cout << 0;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const float pi = acos(-1.0);\n const int maxn = 1e5 + 5;\n int c[maxn];\n long long a[5][maxn], b[maxn];\n vector<int> vec[maxn];\n void dfs(int u, int fa) {\n   for (auto p : vec[u]) {\n     if (p != fa) {\n       c[p] = 6 - c[u] - c[fa];\n       dfs(p, u);\n     }\n   }\n }\n int main() {\n   int u, v;\n   int t, n;\n   cin >> n;\n   for (int i = 1; i <= 3; i++)\n     for (int j = 1; j <= n; j++) cin >> a[i][j];\n   int fu, fv;\n   for (int i = 1; i <= n - 1; i++) {\n     cin >> u >> v;\n     vec[u].push_back(v);\n     vec[v].push_back(u);\n   }\n   int cnt = 0, cnt1 = 0;\n   for (int i = 1; i <= n; i++) {\n     if (vec[i].size() == 2) {\n       cnt++;\n     }\n     if (vec[i].size() == 1) {\n       fv = i;\n       cnt1++;\n     }\n   }\n   if (cnt != n - 2 && cnt1 != 2) {\n     puts('-1');\n     return 0;\n   }\n   long long res = 1e17, ans = 0;\n   ;\n   for (int i = 1; i <= 3; i++) {\n     for (int j = 1; j <= 3; j++) {\n       if (i == j) continue;\n       fu = vec[fv][0];\n       c[fu] = i, c[fv] = j;\n       dfs(fu, fv);\n       ans = 0;\n       for (int k = 1; k <= n; k++) ans += a[c[k]][k];\n       if (ans < res) {\n         res = ans;\n         for (int k = 1; k <= n; k++) {\n           b[k] = c[k];\n         }\n       }\n     }\n   }\n   printf('%lld\n', res);\n   for (int i = 1; i <= n; i++) cout << b[i] << ' ';\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a, b, d[500], s;\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= 2 * n; i++) scanf('%d', &d[i]);\n   for (int i = 1; i <= 2 * n; i++)\n     for (int j = 1; j <= 2 * n; j++)\n       if (d[i] == d[i + (2 * j - 1)]) s++;\n   printf('%d', s);\n   scanf(' ');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n template <class T>\n T Min(const T &a, const T &b) {\n   return a < b ? a : b;\n }\n template <class T>\n T Max(const T &a, const T &b) {\n   return a > b ? a : b;\n }\n template <class T>\n bool Chkmin(T &a, const T &b) {\n   return a > b ? a = b, 1 : 0;\n }\n template <class T>\n bool Chkmax(T &a, const T &b) {\n   return a < b ? a = b, 1 : 0;\n }\n struct fast_input {\n   static const int L = 1 << 15 | 1;\n   char buf[L], *l, *r;\n   fast_input() { l = r = buf; }\n   void Next(char &c) {\n     if (l == r) r = (l = buf) + fread(buf, 1, L, stdin);\n     c = l == r ? (char)EOF : *l++;\n   }\n   template <class T>\n   void operator()(T &x) {\n     char c, f = 0;\n     for (Next(c); !isdigit(c); Next(c))\n       if (c == '-') f = 1;\n     for (x = 0; isdigit(c); Next(c)) x = x * 10 + c - '0';\n     if (f) x = -x;\n   }\n } input;\n const int N = 1000 + 3;\n const int M = 100000 + 7;\n const int MOD = 998244353;\n int n, m, a[N], f[N][N], ans[M], b[M];\n int Power(int x, int y) {\n   int ret = 1;\n   while (y) {\n     if (y & 1) ret = 1LL * x * ret % MOD;\n     x = 1LL * x * x % MOD, y >>= 1;\n   }\n   return ret;\n }\n int main() {\n   int x, y, z;\n   input(n), input(m);\n   for (int i = (1), i_end = (n); i <= i_end; ++i) input(a[i]), b[a[i]] = 1;\n   std::sort(a + 1, a + n + 1);\n   ans[0] = 1;\n   for (int i = (m + 1), i_end = (n); i <= i_end; ++i)\n     ans[0] = 1LL * ans[0] * i % MOD;\n   for (int i = (2), i_end = (n - m); i <= i_end; ++i)\n     ans[0] = 1LL * ans[0] * Power(i, MOD - 2) % MOD;\n   int maxans = 0;\n   while (ans[maxans++]) {\n     x = 0;\n     for (int i = (1), i_end = (n); i <= i_end; ++i)\n       x |= (a[i] - maxans + 1 >= 0 && b[a[i] - maxans + 1]);\n     if (!x) {\n       ans[maxans] = ans[maxans - 1];\n       continue;\n     }\n     f[0][0] = 1, x = 0;\n     for (int j = (1), j_end = (n); j <= j_end; ++j) {\n       for (int k = (1), k_end = (m); k <= k_end; ++k) {\n         while (a[j] - a[x + 1] >= maxans) ++x;\n         f[j][k] = (f[j - 1][k] + f[x][k - 1]) % MOD;\n       }\n       f[j][0] = f[j - 1][0];\n     }\n     ans[maxans] = f[n][m];\n   }\n   int ret = 0;\n   for (int i = (1), i_end = (maxans - 2); i <= i_end; ++i)\n     ret = (ret + 1LL * (ans[i] - ans[i + 1]) * i) % MOD;\n   printf('%d\n', (ret + MOD) % MOD);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct S {\n   long long prime;\n   int q, h, ji;\n };\n S xxx[300000];\n priority_queue<S> sum[4];\n bool biao[300000];\n bool operator<(const S &a, const S &b) { return a.prime > b.prime; }\n int main() {\n   int x, y;\n   cin >> x;\n   for (int a = 0; a < x; a++) {\n     cin >> xxx[a].prime;\n     xxx[a].ji = a;\n   }\n   for (int a = 0; a < x; a++) cin >> xxx[a].q;\n   for (int a = 0; a < x; a++) cin >> xxx[a].h;\n   for (int a = 0; a < x; a++) {\n     sum[xxx[a].q].push(xxx[a]);\n     sum[xxx[a].h].push(xxx[a]);\n   }\n   cin >> y;\n   while (y--) {\n     cin >> x;\n     while (!sum[x].empty() && biao[sum[x].top().ji]) sum[x].pop();\n     if (sum[x].empty())\n       cout << '-1';\n     else {\n       cout << sum[x].top().prime;\n       biao[sum[x].top().ji] = 1;\n       sum[x].pop();\n     }\n     y == 0 ? cout << endl : cout << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native')\n using namespace std;\n long long n, m, a, b, c, k, temp, x, y;\n const int MAXN = 1e5 + 11, mod = 1e9 + 7;\n inline long long max(long long a, long long b) { return ((a > b) ? a : b); }\n inline long long min(long long a, long long b) { return ((a > b) ? b : a); }\n inline vector<long long> read(int n) {\n   vector<long long> v(n);\n   for (int i = 0; i < v.size(); i++) cin >> v[i];\n   return v;\n }\n long long setbits(long long n) {\n   if (n % 4 == 0) return n;\n   if (n % 4 == 1) return 1;\n   if (n % 4 == 2) return n + 1;\n   if (n % 4 == 3) return 0;\n   return 1e18;\n }\n long long getxor(long long x, long long m) {\n   return setbits(x + m - 1) ^ setbits(x - 1);\n }\n void sol() {\n   cin >> n;\n   long long txor = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> x >> m;\n     txor = txor ^ getxor(x, m);\n   }\n   if (txor)\n     cout << 'tolik';\n   else\n     cout << 'bolik';\n   return;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int test = 1;\n   for (int i = 1; i <= test; i++) sol();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<pair<int, int> > G[100005];\n vector<int> E[100005];\n pair<int, int> SL(pair<int, int> 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<pair<int, int>, 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 <bits/stdc++.h>\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 <class Front, class... Queue>\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 <class Front, class... Queue>\n inline int oup(Front A, Queue... B) {\n   return oup(A) + oup(B...);\n }\n template <class T>\n inline void remax(T& A, T B) {\n   if (A < B) A = B;\n }\n template <class T>\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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n struct Node {\n   int u;\n   map<char, int> child;\n };\n vector<Node> 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<int, int> par : grafo[u].child) {\n     int v = par.second;\n     solve(v);\n     win[u] = (win[u] || !win[v]);\n     lose[u] = (lose[u] || !lose[v]);\n   }\n }\n int main() {\n   ios::sync_with_stdio(false);\n   Node root;\n   root.u = 0;\n   grafo.push_back(root);\n   int n, k;\n   cin >> n >> k;\n   for (int i = 0; i < n; i++) {\n     string s;\n     cin >> s;\n     addTrie(0, s);\n   }\n   solve(0);\n   int w = win[0], l = lose[0];\n   if (w == 0)\n     cout << 'Second' << endl;\n   else if (w == 1 && l == 1)\n     cout << 'First' << endl;\n   else if (w == 1 && l == 0 && k % 2 != 0)\n     cout << 'First' << endl;\n   else\n     cout << 'Second' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n using v2d = vector<vector<T> >;\n template <class T>\n bool uin(T &a, T b) {\n   return a > b ? (a = b, true) : false;\n }\n template <class T>\n bool uax(T &a, T b) {\n   return a < b ? (a = b, true) : false;\n }\n mt19937 rng(chrono::system_clock::now().time_since_epoch().count());\n const int maxN = 2e5 + 10;\n const long long inf = 1e18;\n int n;\n long long k, a[maxN];\n bool check(long long d) {\n   long long c = 1, x = d - 1, y = 0, sum = 0;\n   bool ovf = 0;\n   for (int i = n; i; i--) {\n     if (a[i] > 0 && (ovf || (long double)sum + (long double)c * a[i] > inf)) {\n       return 1;\n     }\n     if (a[i] > 0) {\n       sum += c * a[i];\n     }\n     if (sum >= k) {\n       return 1;\n     }\n     x++;\n     y++;\n     if ((long double)c * x / y > inf) {\n       ovf = 1;\n     } else {\n       __int128 tmp = c;\n       tmp *= x;\n       tmp /= y;\n       c = tmp;\n     }\n   }\n   return sum >= k;\n }\n void solve() {\n   cin >> n >> k;\n   for (int i = 1; i <= (int)(n); ++i) {\n     cin >> a[i];\n   }\n   if (*max_element(a + 1, a + n + 1) >= k) {\n     cout << 0;\n     return;\n   }\n   long long l = 0, r = inf;\n   while (r - l > 1) {\n     long long mid = (l + r) / 2;\n     if (check(mid)) {\n       r = mid;\n     } else {\n       l = mid;\n     }\n   }\n   cout << r;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   int T = 1;\n   while (T--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int qr() {\n   int f = 0, fu = 1;\n   char c = getchar();\n   while (c < '0' || c > '9') {\n     if (c == '-') fu = -1;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') {\n     f = (f << 3) + (f << 1) + c - 48;\n     c = getchar();\n   }\n   return f * fu;\n }\n const int N = 2e5 + 10;\n int a[N], n, k, T;\n pair<int, int> b[N];\n int main() {\n   T = qr();\n   while (T--) {\n     n = qr(), k = qr();\n     for (register int i = 1; i <= n; ++i) a[i] = qr();\n     for (register int i = 1; i <= n; ++i) qr();\n     sort(a + 1, a + n + 1);\n     int m = 0;\n     for (register int i = 1; i <= n; ++i) {\n       b[++m] = {a[i], 0};\n       int j = i;\n       while (a[j] == a[i]) b[m].second++, j++;\n       i = j - 1;\n     }\n     for (register int i = 1; i <= m; ++i) b[i].second += b[i - 1].second;\n     if (k * 2 >= a[n] - a[1]) {\n       printf('%d\n', n);\n       continue;\n     }\n     vector<int> st(m + 1);\n     int ans = 0;\n     for (int i = 1, j = 1; i <= m; i++) {\n       while (b[i].first - b[j].first > k) j++;\n       st[i] = max(st[i - 1], b[i].second - b[j - 1].second);\n       ans = max(ans, b[i].second - b[j - 1].second + st[j - 1]);\n     }\n     printf('%d\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[1000006];\n map<pair<long long, long long>, long long> mp;\n int main() {\n   long long n, k;\n   cin >> n >> k;\n   if (k == 0 && n != 1) {\n     cout << 'No solution';\n     return 0;\n   }\n   if (n == 1) {\n     cout << k;\n     return 0;\n   }\n   if (k != 1) {\n     cout << k - 1;\n     for (int i = 0; i < n - 2; i++) cout << 0;\n     cout << 1;\n     return 0;\n   }\n   if (k == 1) {\n     cout << 9;\n     for (int i = 0; i < n - 2; i++) cout << 0;\n     cout << 1;\n     return 0;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int64_t k;\n   cin >> k;\n   int64_t r = 2, c = 3;\n   cout << r << ' ' << c << endl;\n   int64_t arr[2][3];\n   int64_t ones = ((int64_t)1 << 18) - 1;\n   arr[0][0] = ones;\n   arr[0][1] = ((int64_t)1 << 17);\n   arr[0][2] = 0;\n   arr[1][0] = k;\n   arr[1][1] = ones;\n   arr[1][2] = k;\n   for (int64_t i = 0; i < r; i++) {\n     for (int64_t j = 0; j < c; j++) {\n       cout << arr[i][j] << ' ';\n     }\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a[2][2];\n   cin >> a[0][0] >> a[0][1] >> a[1][0] >> a[1][1];\n   int n[2];\n   if (!a[0][0] && !a[1][0] && !a[0][1] && !a[1][1]) {\n     cout << '0';\n     return 0;\n   }\n   for (int i = 0; 1; i++) {\n     int temp = i * (i - 1) / 2;\n     if (temp == a[0][0]) {\n       n[0] = i;\n       break;\n     }\n     if (temp > a[0][0]) {\n       cout << 'Impossible';\n       return 0;\n     }\n   }\n   for (int i = 0; 1; i++) {\n     int temp = i * (i - 1) / 2;\n     if (temp == a[1][1]) {\n       n[1] = i;\n       break;\n     }\n     if (temp > a[1][1]) {\n       cout << 'Impossible';\n       return 0;\n     }\n   }\n   if (n[0] == 0)\n     if (a[0][1] || a[1][0]) n[0] = 1;\n   if (n[1] == 0)\n     if (a[0][1] || a[1][0]) n[1] = 1;\n   if ((a[0][1] + a[1][0]) != n[0] * n[1]) {\n     cout << 'Impossible';\n     return 0;\n   }\n   int base = n[1];\n   while (1) {\n     if (a[0][1] > base) {\n       cout << '0';\n       n[0]--;\n       a[0][1] -= base;\n     } else {\n       for (int i = 0; i < base - a[0][1]; ++i) cout << '1';\n       if (n[0] > 0) {\n         cout << '0';\n         n[0]--;\n       }\n       for (int i = 0; i < a[0][1]; ++i) cout << '1';\n       for (int i = 0; i < n[0]; ++i) cout << '0';\n       break;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n = 0;\n   long long moves = 0;\n   cin >> n;\n   vector<long long> arr(n, 0);\n   for (int i = 0; i < n; i++) cin >> arr[i];\n   long long last = arr[0];\n   long long min = INT_MAX;\n   bool found = false;\n   for (int i = 1; i < n; i++) {\n     if (arr[i] < arr[i - 1]) {\n       if (arr[i] < min) {\n         min = arr[i];\n         found = true;\n       }\n     }\n     if (arr[i] > arr[i - 1] || i + 1 == n) {\n       if (found) {\n         moves += last - min;\n         found = false;\n       }\n       min = INT_MAX;\n       last = arr[i];\n     }\n   }\n   cout << moves << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long a, b, r;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> a >> b >> r;\n   if (min(a, b) >= 2 * r)\n     cout << 'First' << endl;\n   else\n     cout << 'Second' << endl;\n   cin.get();\n   cin.get();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T, size_t N>\n struct ma : array<T, N> {\n   T &operator[](size_t n) { return (*static_cast<array<T, N> *>(this))[n]; }\n };\n template <class T>\n string to_str(const T &a) {\n   ostringstream os;\n   os << a;\n   return os.str();\n }\n template <>\n string to_str<long double>(const long double &a) {\n   ostringstream os;\n   os.precision(10);\n   os.setf(ios::fixed);\n   os << a;\n   return os.str();\n }\n template <class T>\n T from_str(const string &s) {\n   istringstream is;\n   T val;\n   is >> val;\n   return val;\n }\n int cond = (long long)0;\n map<int, vector<int> > nei;\n int dat[(int)1e5 + 11];\n void solve() {\n   int n, m;\n   scanf('%d%d', &n, &m);\n   for (auto i = (0); i < (m); ++i) {\n     scanf('%d', &dat[i]);\n   }\n   long long turn = 0;\n   for (auto i = (0); i < (m - 1); ++i) {\n     int a = dat[i], b = dat[i + 1];\n     turn += abs(a - b);\n     if (a != b) {\n       nei[a].push_back(b);\n       nei[b].push_back(a);\n     }\n   }\n   long long res = turn;\n   for (auto &it : (nei)) {\n     auto kol = it.second;\n     sort((kol).begin(), (kol).end());\n     int mid = kol.size() / 2;\n     long long cand1 = 0;\n     long long cand2 = 0;\n     for (auto &jt : (kol)) {\n       cand1 += abs(it.first - jt);\n       cand2 += abs(jt - kol[mid]);\n     }\n     res = min(res, turn + cand2 - cand1);\n   }\n   cout << res << endl;\n }\n void brute() {}\n void gen(int i, int n, int k) {}\n int main(int argc, char **argv) {\n   ios::sync_with_stdio(false);\n   vector<string> args;\n   int nr_test = -1;\n   int t = 1;\n   for (auto i = (1); i <= (argc - 1); ++i) args.push_back(argv[i]);\n   for (auto &it : (args))\n     if (it == 'q') cond = 10000000;\n   for (auto &it : (args))\n     if (it == 'all') t = 1000;\n   for (auto &it : (args))\n     if (atoi(it.c_str()) > 0) nr_test = atoi(it.c_str());\n   for (auto &it : (args))\n     if (it == 'b') {\n       brute();\n       return 0;\n     }\n   for (auto &it : (args))\n     if (it == 'g' && args.size() >= 4) {\n       gen(atoi(args[1].c_str()), atoi(args[2].c_str()), atoi(args[3].c_str()));\n       return 0;\n     }\n   for (auto i = (1); i <= (t); ++i) {\n     if (nr_test == -1 || i <= nr_test) solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s;\n   vector<int> v;\n   int n, d, p = 0, cnt = 0, mx = -1;\n   cin >> n >> d >> s;\n   for (int i = 0; i < n; i++)\n     if (s[i] == '1') v.push_back(i);\n   for (int i = 1; i < v.size(); i++) {\n     if (v[i] - v[i - 1] > mx) mx = v[i] - v[i - 1];\n   }\n   if (mx > d) {\n     cout << -1;\n     return 0;\n   }\n   while (p < n - 1) {\n     p += d;\n     while (s[p] == '0') p--;\n     cnt++;\n   }\n   cout << cnt;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Hill {\n   int Lid, Mid, Rid;\n   long long Lv, Mv, Rv;\n   bool valid;\n   Hill() : valid(false) {}\n   Hill(int Lid, int Mid, int Rid, long long Lv, long long Mv, long long Rv)\n       : Lid(Lid), Mid(Mid), Rid(Rid), Lv(Lv), Mv(Mv), Rv(Rv), valid(true) {}\n   int Len() const { return valid ? Rid - Lid + 1 : 0; }\n   Hill operator+(const Hill B) const {\n     Hill Ans;\n     if (Rv == B.Lv) return Ans;\n     if (Rv < B.Lv) {\n       if (Mid == Rid)\n         return Hill(Lid, B.Mid, B.Rid, Lv, B.Mv, B.Rv);\n       else\n         return Hill(Rid, B.Mid, B.Rid, Rv, B.Mv, B.Rv);\n     } else {\n       if (B.Mid == B.Lid)\n         return Hill(Lid, Mid, B.Rid, Lv, Mv, B.Rv);\n       else\n         return Hill(Lid, Mid, B.Lid, Lv, Mv, B.Lv);\n     }\n   }\n   bool operator<(const Hill B) const { return Len() < B.Len(); }\n   void show() {\n     if (valid)\n       printf('A[%d]=%d  A[%d]=%d  A[%d]=%d\n', Lid, int(Lv), Mid, int(Mv), Rid,\n              int(Rv));\n     else\n       printf('ERROR!\n');\n   }\n };\n Hill CLeft(const Hill A, const Hill B) {\n   if (!B.valid || B.Lv == A.Rv) return A;\n   if (A.Mid == A.Rid) {\n     if (B.Lv > A.Rv)\n       return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv);\n     else if (B.Lid == B.Mid)\n       return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv);\n     else\n       return Hill(A.Lid, A.Mid, B.Lid, A.Lv, A.Mv, B.Lv);\n   } else {\n     if (B.Lv < A.Rv) {\n       if (B.Lid == B.Mid)\n         return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv);\n       else\n         return Hill(A.Lid, A.Mid, B.Lid, A.Lv, A.Mv, B.Lv);\n     } else\n       return A;\n   }\n }\n Hill CRight(const Hill A, const Hill B) {\n   if (!A.valid || A.Rv == B.Lv) return B;\n   if (B.Mid == B.Lid) {\n     if (A.Rv > B.Lv)\n       return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv);\n     else if (A.Rid == A.Mid)\n       return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv);\n     else\n       return Hill(A.Rid, B.Mid, B.Rid, A.Rv, B.Mv, B.Rv);\n   } else {\n     if (A.Rv < B.Lv) {\n       if (A.Rid == A.Mid)\n         return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv);\n       else\n         return Hill(A.Rid, B.Mid, B.Rid, A.Rv, B.Mv, B.Rv);\n     } else\n       return B;\n   }\n }\n struct Segment {\n   Hill L, M, R;\n   bool pure;\n   Segment() {}\n   Segment(Hill L, Hill M, Hill R, bool pure) : L(L), M(M), R(R), pure(pure) {}\n   Segment operator+(const Segment B) const {\n     Segment Ans;\n     Ans.L = pure ? CLeft(L, B.L) : L;\n     Ans.R = B.pure ? CRight(R, B.R) : B.R;\n     Hill CM = M < B.M ? B.M : M;\n     Ans.M = R + B.L;\n     if (Ans.M < CM) Ans.M = CM;\n     Ans.pure = Ans.M.Len() == Ans.R.Rid - Ans.L.Lid + 1;\n     return Ans;\n   }\n   void Add(const long long D) {\n     L.Lv += D;\n     L.Mv += D;\n     L.Rv += D;\n     M.Lv += D;\n     M.Mv += D;\n     M.Rv += D;\n     R.Lv += D;\n     R.Mv += D;\n     R.Rv += D;\n   }\n   void show() {\n     L.show();\n     M.show();\n     R.show();\n   }\n };\n Segment S[300001 << 2];\n long long Add[300001 << 2];\n int mm[300001 << 2];\n void PushUp(int rt) { S[rt] = S[rt << 1] + S[rt << 1 | 1]; }\n void PushDown(int rt) {\n   int ls = rt << 1, rs = ls | 1;\n   if (Add[rt]) {\n     Add[ls] += Add[rt];\n     Add[rs] += Add[rt];\n     S[ls].Add(Add[rt]);\n     S[rs].Add(Add[rt]);\n     Add[rt] = 0;\n   }\n }\n void Build(int l, int r, int rt) {\n   if (l == r) {\n     int v;\n     scanf('%d', &v);\n     Hill tempH(l, l, l, v, v, v);\n     S[rt] = Segment(tempH, tempH, tempH, true);\n     return;\n   }\n   int m = mm[rt] = (l + r) >> 1;\n   Build(l, m, rt << 1);\n   Build(m + 1, r, rt << 1 | 1);\n   PushUp(rt);\n   Add[rt] = 0;\n }\n void Update(const int L, const int R, const long long D, const int l,\n             const int r, const int rt) {\n   if (L <= l && r <= R) {\n     Add[rt] += D;\n     S[rt].Add(D);\n     return;\n   }\n   const int m = mm[rt];\n   PushDown(rt);\n   if (L <= m) Update(L, R, D, l, m, rt << 1);\n   if (R > m) Update(L, R, D, m + 1, r, rt << 1 | 1);\n   PushUp(rt);\n }\n void Search(int l, int r, int rt) {\n   if (l == r) {\n     printf('%d ', int(S[rt].L.Lv));\n     return;\n   }\n   PushDown(rt);\n   int m = (l + r) >> 1;\n   Search(l, m, rt << 1);\n   Search(m + 1, r, rt << 1 | 1);\n }\n int main() {\n   int n, m;\n   while (~scanf('%d', &n)) {\n     Build(1, n, 1);\n     scanf('%d', &m);\n     for (int i = 0; i < m; ++i) {\n       static int l, r, d;\n       scanf('%d%d%d', &l, &r, &d);\n       Update(l, r, d, 1, n, 1);\n       printf('%d\n', S[1].M.Len());\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n pair<int, pair<int, int> > A[2003 * 2003], B[2003 * 2003];\n pair<int, int> a[2003], b[2003];\n int m, n, r, s, x, y, i, j, asd;\n long long t1, t2, mn;\n bool h;\n int main() {\n   cin >> m;\n   for (i = 1; i <= m; i++) {\n     cin >> a[i].first;\n     t1 += a[i].first;\n     a[i].second = i;\n   }\n   cin >> n;\n   for (i = 1; i <= n; i++) {\n     cin >> b[i].first;\n     t2 += b[i].first;\n     b[i].second = i;\n   }\n   for (i = 1; i <= m; i++)\n     for (j = i + 1; j <= m; j++)\n       A[++r] = make_pair(a[i].first + a[j].first, make_pair(i, j));\n   for (i = 1; i <= n; i++)\n     for (j = i + 1; j <= n; j++)\n       B[++s] = make_pair(b[i].first + b[j].first, make_pair(i, j));\n   sort(a + 1, a + m + 1);\n   sort(b + 1, b + n + 1);\n   sort(A + 1, A + r + 1);\n   sort(B + 1, B + s + 1);\n   if (t1 < t2) {\n     h = 1;\n     swap(t1, t2);\n     swap(m, n);\n     swap(r, s);\n     swap(a, b);\n     swap(A, B);\n   }\n   mn = t1 - t2;\n   for (i = j = 1; i <= m; i++) {\n     while (abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first)) >\n                abs(t1 - a[i].first + b[j + 1].first -\n                    (t2 - b[j + 1].first + a[i].first)) &&\n            j < n)\n       j++;\n     if (mn >\n         abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first))) {\n       mn = abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first));\n       asd = 1;\n       x = i;\n       y = j;\n     }\n   }\n   for (i = j = 1; i <= r && s; i++) {\n     while (abs(t1 - A[i].first + B[j].first - (t2 - B[j].first + A[i].first)) >\n                abs(t1 - A[i].first + B[j + 1].first -\n                    (t2 - B[j + 1].first + A[i].first)) &&\n            j < s)\n       j++;\n     if (mn >\n         abs((t1 - A[i].first + B[j].first) - (t2 - B[j].first + A[i].first))) {\n       mn = abs((t1 - A[i].first + B[j].first) - (t2 - B[j].first + A[i].first));\n       asd = 2;\n       x = i;\n       y = j;\n     }\n   }\n   cout << mn << endl << asd << endl;\n   if (asd == 1) {\n     if (!h)\n       cout << a[x].second << ' ' << b[y].second;\n     else\n       cout << b[y].second << ' ' << a[x].second;\n   } else if (asd) {\n     if (!h) {\n       cout << A[x].second.first << ' ' << B[y].second.first << endl;\n       cout << A[x].second.second << ' ' << B[y].second.second;\n     } else {\n       cout << B[y].second.first << ' ' << A[x].second.first << endl;\n       cout << B[y].second.second << ' ' << A[x].second.second;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t, i, j, n, x, y;\n   cin >> x >> y;\n   bool c = 0;\n   char a;\n   for (i = 0; i < x; i++) {\n     for (j = 0; j < y; j++) {\n       cin >> a;\n       if (a != 'W' && a != 'B' && a != 'G') c = 1;\n     }\n   }\n   if (c)\n     puts('#Color');\n   else\n     puts('#Black&White');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n double const EPS = 3e-8;\n using namespace std;\n template <class T>\n T gcd(T a, T b) {\n   return (b != 0 ? gcd<T>(b, a % b) : a);\n }\n template <class T>\n T lcm(T a, T b) {\n   return (a / gcd<T>(a, b) * b);\n }\n struct debugger {\n   template <typename T>\n   debugger& operator,(const T& v) {\n     cerr << v << '\t';\n     return *this;\n   }\n } dbg;\n template <class A, class B>\n ostream& operator<<(ostream& o, const pair<A, B>& p) {\n   return o << '(' << p.first << ', ' << p.second << ')';\n }\n template <class T>\n ostream& operator<<(ostream& o, const vector<T>& v) {\n   o << '[';\n   for (__typeof((v).end()) it = (v).begin(); it != (v).end(); ++it)\n     o << *it << ', ';\n   return o << ']';\n }\n template <class T>\n ostream& operator<<(ostream& o, const set<T>& v) {\n   o << '[';\n   for (__typeof((v).end()) it = (v).begin(); it != (v).end(); ++it)\n     o << *it << ', ';\n   return o << ']';\n }\n template <class T>\n inline bool read(T& x) {\n   int c = getchar();\n   int sgn = 1;\n   while (~c && c < '0' || c > '9') {\n     if (c == '-') sgn = -1;\n     c = getchar();\n   }\n   for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';\n   x *= sgn;\n   return ~c;\n }\n int dx[] = {1, 0, -1, 0};\n int dy[] = {0, 1, 0, -1};\n const int NX = 1e6 + 10;\n int fromFront[NX], fromBack[NX];\n string a, b;\n void solve(int cs) {\n   cin >> a >> b;\n   int asz = a.size();\n   int bsz = b.size();\n   int backIdx = bsz - 1;\n   int cur = 0;\n   for (int i = asz - 1; i >= 0; i--) {\n     if (backIdx >= 0 && a[i] == b[backIdx]) {\n       backIdx--;\n       cur++;\n     }\n     fromBack[i] = cur;\n   }\n   int frontIdx = 0;\n   cur = 0;\n   for (int i = 0; i < asz; i++) {\n     if (frontIdx < bsz && a[i] == b[frontIdx]) {\n       frontIdx++;\n       cur++;\n     }\n     fromFront[i] = cur;\n   }\n   int low = 0, high = 0;\n   int ans = 0;\n   while (high < asz) {\n     int f = 0, b = 0;\n     if (low > 0) f = fromFront[low - 1];\n     if (high + 1 < asz) b = fromBack[high + 1];\n     if (f + b >= bsz) {\n       ans = max(ans, high - low + 1);\n     } else {\n       while (f + b < bsz && low <= high) {\n         low++;\n         f = fromFront[low - 1];\n         if (high + 1 < asz) b = fromBack[high + 1];\n       }\n     }\n     high++;\n   }\n   printf('%d\n', ans);\n }\n int main() {\n   int t = 1;\n   for (int cs = 1; cs <= t; cs++) solve(cs);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n, k;\n   while (~scanf('%d%d', &n, &k)) {\n     int ant[55] = {0};\n     int temp = 0;\n     int count = k;\n     for (int i = 1; i <= n; i++) {\n       scanf('%d', &ant[i - 1]);\n       if (i == k) temp = ant[i - 1];\n     }\n     if (temp)\n       for (int i = k + 1; i <= n; i++) {\n         if (ant[i - 1] >= temp)\n           count++;\n         else\n           break;\n       }\n     else\n       for (int i = k; i >= 1; i--) {\n         if (!ant[i - 1]) count--;\n       }\n     printf('%d\n', count);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void err(istream_iterator<string> it) {}\n template <typename T, typename... Args>\n void err(istream_iterator<string> it, T a, Args... args) {\n   cerr << ' ' << *it << ' = ' << a;\n   err(++it, args...);\n }\n template <typename T, typename U>\n inline void min_self(T& x, U y) {\n   if (y < x) x = y;\n }\n template <typename T, typename U>\n inline void max_self(T& x, U y) {\n   if (x < y) x = y;\n }\n template <class T1, class T2>\n ostream& operator<<(ostream& out, pair<T1, T2> pair) {\n   return out << '(' << pair.first << ', ' << pair.second << ')';\n }\n template <class T>\n ostream& operator<<(ostream& out, vector<T> vec) {\n   out << '(';\n   for (auto& v : vec) out << v << ', ';\n   return out << ')';\n }\n template <class T>\n ostream& operator<<(ostream& out, set<T> vec) {\n   out << '(';\n   for (auto& v : vec) out << v << ', ';\n   return out << ')';\n }\n template <class L, class R>\n ostream& operator<<(ostream& out, map<L, R> vec) {\n   out << '(';\n   for (auto& v : vec) out << '[' << v.first << ', ' << v.second << ']';\n   return out << ')';\n }\n template <class A, class B>\n istream& operator>>(istream& in, pair<A, B>& a) {\n   return in >> a.first >> a.second;\n }\n template <class A>\n istream& operator>>(istream& in, vector<A>& a) {\n   for (A& i : a) in >> i;\n   return in;\n }\n long long XX[4] = {-1, 0, 1, 0};\n long long YY[4] = {0, -1, 0, 1};\n void solve() {\n   long long n, res = 0;\n   cin >> n;\n   vector<pair<long long, long long>> a(n);\n   for (long long i = 0; i <= n - 1; i++) cin >> a[i];\n   sort(a.begin(), a.end());\n   long long maxi = a[0].second;\n   for (long long i = 1; i <= n - 1; i++) {\n     if (a[i].second < maxi && a[i].first > a[i - 1].first) {\n       res++;\n     }\n     max_self(maxi, a[i].second);\n   }\n   cout << res << '\n';\n   return;\n }\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int N, K;\n   cin >> N >> K;\n   double res = 0;\n   long double t1x, t1y, t2x, t2y;\n   cin >> t1x >> t1y;\n   for (int i = 1; i < N; ++i) {\n     t2x = t1x;\n     t2y = t1y;\n     cin >> t1x >> t1y;\n     res += sqrt((t1x - t2x) * (t1x - t2x) + (t1y - t2y) * (t1y - t2y));\n   }\n   printf('%.15lf\n', res * K / 50);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100005;\n int down[N], sz[N], up[N], n;\n vector<pair<int, bool> > adj[N];\n void dfs(int s, int p) {\n   sz[s] = 1;\n   for (auto it : adj[s]) {\n     if (it.first != p) {\n       dfs(it.first, s);\n       sz[s] += sz[it.first];\n       if (it.second)\n         down[s] += sz[it.first];\n       else\n         down[s] += down[it.first];\n     }\n   }\n }\n void dfs2(int s, int p) {\n   for (auto it : adj[s]) {\n     if (it.first != p) {\n       if (it.second)\n         up[it.first] = n - sz[it.first];\n       else\n         up[it.first] = down[s] - down[it.first] + up[s];\n       dfs2(it.first, s);\n     }\n   }\n }\n int main() {\n   int i;\n   scanf('%d', &n);\n   for (i = 0; i < n - 1; i++) {\n     int a, b, c, te;\n     bool flag = true;\n     scanf('%d%d%d', &a, &b, &c);\n     while (c > 0) {\n       if (c % 10 == 4 || c % 10 == 7)\n         ;\n       else\n         flag = false;\n       c /= 10;\n     }\n     adj[a - 1].push_back(make_pair(b - 1, flag));\n     adj[b - 1].push_back(make_pair(a - 1, flag));\n   }\n   long long ans = 0;\n   dfs(0, -1);\n   dfs2(0, -1);\n   for (i = 0; i < n; i++) {\n     long long temp = up[i] + down[i];\n     ans += temp * (temp - 1);\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n double p[1010][1010];\n int a[1010];\n int n, m;\n int main() {\n   double t, ans;\n   int i, j, x, y;\n   scanf('%d%d', &n, &m);\n   for (i = 1; i <= n; i++) scanf('%d', &a[i]);\n   for (i = 1; i <= n; i++)\n     for (j = 1; j <= n; j++)\n       if (a[i] > a[j])\n         p[i][j] = 1;\n       else\n         p[i][j] = 0;\n   for (i = 1; i <= m; i++) {\n     scanf('%d%d', &x, &y);\n     p[x][y] = 0.5;\n     p[y][x] = 0.5;\n     for (j = 1; j <= n; j++)\n       if ((j != x) && (j != y)) {\n         t = (p[j][x] + p[j][y]) * 0.5;\n         p[j][x] = t;\n         p[x][j] = 1 - t;\n         p[j][y] = t;\n         p[y][j] = 1 - t;\n       }\n   }\n   ans = 0;\n   for (i = 1; i <= n - 1; i++)\n     for (j = i + 1; j <= n; j++) ans += p[i][j];\n   printf('%.10lf\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int one, two, three, four;\n bool check(deque<int> x) {\n   int cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0;\n   for (int i = 0; i < x.size(); i++) {\n     if (x[i] == 0) cnt1++;\n     if (x[i] == 1) cnt2++;\n     if (x[i] == 2) cnt3++;\n     if (x[i] == 3) cnt4++;\n   }\n   if (cnt1 == one && cnt2 == two && cnt3 == three & cnt4 == four) {\n     for (int i = 0; i + 1 < x.size(); i++) {\n       if (abs(x[i] - x[i + 1]) != 1) return 0;\n     }\n     cout << 'YES' << '\n';\n     for (int i : x) cout << i << ' ';\n     exit(0);\n   }\n   return 0;\n }\n deque<int> merge(deque<int> x, deque<int> y) {\n   for (int i : y) x.push_back(i);\n   return x;\n }\n void go2(pair<int, int> a, pair<int, int> b, deque<int> ans) {\n   deque<int> ans2 = ans;\n   if (a.first < b.first) {\n     for (int i = 0; i < a.first; i++) {\n       ans.push_back(b.second);\n       ans.push_back(a.second);\n     }\n     ans.push_back(b.second);\n   } else {\n     for (int i = 0; i < b.first; i++) {\n       ans.push_back(a.second);\n       ans.push_back(b.second);\n     }\n     if (a.first != b.first) ans.push_back(a.second);\n   }\n   check(ans);\n   ans = ans2;\n   if (a.first <= b.first) {\n     for (int i = 0; i < a.first; i++) {\n       ans.push_back(b.second);\n       ans.push_back(a.second);\n     }\n     if (a.first != b.first) ans.push_back(b.second);\n   } else {\n     for (int i = 0; i < b.first; i++) {\n       ans.push_back(a.second);\n       ans.push_back(b.second);\n     }\n     if (a.first != b.first) ans.push_back(a.second);\n   }\n   ans = ans2;\n   deque<int> zl;\n   if (a.first < b.first) {\n     for (int i = 0; i < a.first; i++) {\n       zl.push_back(b.second);\n       zl.push_back(a.second);\n     }\n     zl.push_back(b.second);\n   } else {\n     for (int i = 0; i < b.first; i++) {\n       zl.push_back(a.second);\n       zl.push_back(b.second);\n     }\n     if (a.first != b.first) zl.push_back(a.second);\n   }\n   check(merge(zl, ans));\n   zl.clear();\n   if (a.first <= b.first) {\n     for (int i = 0; i < a.first; i++) {\n       zl.push_back(b.second);\n       zl.push_back(a.second);\n     }\n     if (a.first != b.first) zl.push_back(b.second);\n   } else {\n     for (int i = 0; i < b.first; i++) {\n       zl.push_back(a.second);\n       zl.push_back(b.second);\n     }\n     if (a.first != b.first) zl.push_back(a.second);\n   }\n   check(merge(zl, ans));\n }\n void go3(pair<int, int> a, pair<int, int> b, pair<int, int> c, deque<int> cur) {\n   deque<int> ans;\n   if (a.first <= b.first) {\n     for (int i = 0; i < a.first; i++) {\n       ans.push_back(a.second);\n       ans.push_back(b.second);\n     }\n     go2(pair<int, int>(b.first - a.first, b.second), c, merge(cur, ans));\n     go2(pair<int, int>(b.first - a.first, b.second), c, merge(ans, cur));\n     ans.clear();\n     for (int i = 0; i < a.first; i++) {\n       ans.push_back(b.second);\n       ans.push_back(a.second);\n     }\n     go2(pair<int, int>(b.first - a.first, b.second), c, merge(cur, ans));\n     go2(pair<int, int>(b.first - a.first, b.second), c, merge(ans, cur));\n   }\n   ans.clear();\n   if (c.first <= b.first) {\n     for (int i = 0; i < c.first; i++) {\n       ans.push_back(c.second);\n       ans.push_back(b.second);\n     }\n     go2(a, pair<int, int>(b.first - c.first, b.second), merge(cur, ans));\n     go2(a, pair<int, int>(b.first - c.first, b.second), merge(ans, cur));\n     ans.clear();\n     for (int i = 0; i < c.first; i++) {\n       ans.push_back(b.second);\n       ans.push_back(c.second);\n     }\n     go2(a, pair<int, int>(b.first - c.first, b.second), merge(cur, ans));\n     go2(a, pair<int, int>(b.first - c.first, b.second), merge(ans, cur));\n   }\n }\n void go4(int a, int b, int c, int d) {\n   if (a <= b) {\n     deque<int> lul;\n     for (int i = 0; i < a; i++) {\n       lul.push_back(0);\n       lul.push_back(1);\n     }\n     go3(pair<int, int>(b - a, 1), pair<int, int>(c, 2), pair<int, int>(d, 3),\n         lul);\n     lul.clear();\n     for (int i = 0; i < a; i++) {\n       lul.push_back(1);\n       lul.push_back(0);\n     }\n     go3(pair<int, int>(b - a, 1), pair<int, int>(c, 2), pair<int, int>(d, 3),\n         lul);\n   }\n   if (d <= c) {\n     deque<int> lul;\n     for (int i = 0; i < d; i++) {\n       lul.push_back(3);\n       lul.push_back(2);\n     }\n     go3(pair<int, int>(a, 0), pair<int, int>(b, 1), pair<int, int>(c - d, 2),\n         lul);\n     lul.clear();\n     for (int i = 0; i < d; i++) {\n       lul.push_back(2);\n       lul.push_back(3);\n     }\n     go3(pair<int, int>(a, 0), pair<int, int>(b, 1), pair<int, int>(c - d, 2),\n         lul);\n   }\n }\n int main() {\n   cin >> one >> two >> three >> four;\n   go4(one, two, three, four);\n   cout << 'NO';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long range(long long L) {\n   switch (L & 3) {\n     case 0:\n       return L;\n     case 1:\n       return 1;\n     case 2:\n       return L + 1;\n     case 3:\n       return 0;\n   }\n }\n int main() {\n   for (int N; cin >> N;) {\n     long long sum = 0;\n     for (int i = 0; i < (int)(N); ++i) {\n       long long m, x;\n       cin >> x >> m;\n       long long b = range(x - 1);\n       long long a = range(x + m - 1);\n       sum ^= b;\n       sum ^= a;\n     }\n     if (sum == 0)\n       cout << 'bolik' << endl;\n     else\n       cout << 'tolik' << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct trie {\n   char ch;\n   int son, next, father, suffix;\n   vector<int> danger;\n   int sum;\n };\n trie a[205];\n int now, m;\n void clear(int x) {\n   a[x].son = a[x].next = 0;\n   a[x].danger.clear();\n }\n void insert(char *s, int l, int t, int x) {\n   if (!a[x].son) {\n     a[x].son = ++m;\n     clear(m);\n     a[m].father = x;\n     a[m].ch = s[t];\n     if (t + 1 == l)\n       a[m].danger.push_back(now);\n     else\n       insert(s, l, t + 1, m);\n     return;\n   }\n   int i = a[x].son;\n   while (1) {\n     if (!a[i].next || a[i].ch == s[t]) break;\n     i = a[i].next;\n   }\n   if (a[i].ch == s[t] && t + 1 == l)\n     a[i].danger.push_back(now);\n   else if (a[i].ch == s[t])\n     insert(s, l, t + 1, i);\n   else {\n     a[i].next = ++m;\n     clear(m);\n     a[m].father = x;\n     a[m].ch = s[t];\n     if (t + 1 == l)\n       a[m].danger.push_back(now);\n     else\n       insert(s, l, t + 1, m);\n   }\n }\n int q[205];\n int child(int x, char ch) {\n   for (int i = a[x].son; i; i = a[i].next)\n     if (a[i].ch == ch) return (i);\n   if (x == 1) return (1);\n   return (child(a[x].suffix, ch));\n }\n void build_trie() {\n   int l, r;\n   l = r = 1;\n   q[1] = 1;\n   while (l <= r) {\n     int x = q[l++];\n     for (int i = a[x].son; i; i = a[i].next) q[++r] = i;\n   }\n   a[1].suffix = 1;\n   for (int i = 2; i <= r; i++) {\n     int x = q[i];\n     if (a[x].father == 1) {\n       a[x].suffix = 1;\n       continue;\n     }\n     a[x].suffix = child(a[a[x].father].suffix, a[x].ch);\n     for (int j = 0; j < (int)a[a[x].suffix].danger.size(); j++)\n       a[x].danger.push_back(a[a[x].suffix].danger[j]);\n   }\n }\n int n, base, k;\n void read(char *s) {\n   int l;\n   scanf('%d', &l);\n   s[l] = '\0';\n   for (int i = 0; i < l; ++i) {\n     int a;\n     scanf('%d', &a);\n     s[i] = a + 'a';\n   }\n }\n int v[205];\n char l[205], r[205], s[205];\n const int MOD = 1000000007;\n int curl;\n char cur[205];\n int f[205][205][505];\n int dp(int i, int state, int sum, bool cmp, bool first) {\n   if (sum > k) {\n     return 0;\n   }\n   if (i == 0) {\n     return 1;\n   }\n   if (!first && !cmp && f[i][state][sum] != -1) {\n     return f[i][state][sum];\n   }\n   int ret = 0;\n   int r = cur[curl - i] - 'a';\n   for (int d = first; d < base; ++d) {\n     if (cmp && d > r) {\n       continue;\n     }\n     int nstate = child(state, d + 'a'), nsum = sum + a[nstate].sum;\n     bool ncmp = cmp && d == r;\n     ret += dp(i - 1, nstate, nsum, ncmp, false);\n     if (ret >= MOD) {\n       ret -= MOD;\n     }\n   }\n   if (!cmp && !first) {\n     f[i][state][sum] = ret;\n   }\n   return ret;\n }\n int cal(char *s) {\n   int l = strlen(s);\n   curl = l;\n   for (int i = 0; i < l; ++i) {\n     cur[i] = s[i];\n   }\n   int ret = 0;\n   while (curl) {\n     ret += dp(curl, 1, 0, curl == l, true);\n     --curl;\n     if (ret >= MOD) {\n       ret -= MOD;\n     }\n   }\n   return ret;\n }\n int check(char *s) {\n   int sum = 0, cur = 1, l = strlen(s);\n   for (int i = 0; i < l; ++i) {\n     cur = child(cur, s[i]);\n     sum += a[cur].sum;\n   }\n   return sum <= k;\n }\n int main() {\n   memset(f, -1, sizeof(f));\n   scanf('%d%d%d', &n, &base, &k);\n   read(l), read(r);\n   clear(m = 1);\n   for (int i = 0; i < n; i++) {\n     read(s);\n     scanf('%d', v + i);\n     now = i;\n     insert(s, strlen(s), 0, 1);\n   }\n   build_trie();\n   for (int i = 1; i <= m; ++i) {\n     a[i].sum = 0;\n     for (int j = 0; j < (int)a[i].danger.size(); ++j) {\n       a[i].sum += v[a[i].danger[j]];\n     }\n   }\n   long long ansl = cal(l), ansr = cal(r);\n   cout << ((ansr - ansl + check(l)) % MOD + MOD) % MOD << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #include <cmath>\n #include <regex>\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<long long int>\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;i++)\n using namespace std;\n //-----------------------------------------------------------------------------------------------------------------\n const ll M = 1e9 + 7;\n const ll N = 2e5 + 5;\n const ll inf = 2e18;\n ll mod(ll x){   return (x%M);}\n ll mod_minus(ll a, ll b){ ll ans= (mod(a)-mod(b)); if(ans<0) ans=mod(ans+M); return ans;}\n  \n ll mod_mul(ll a,ll b){  return mod(mod(a)*mod(b));}\n  \n ll mod_add(ll a,ll b){ return mod(a+b);}\n  \n ll power(ll a,ll n){  \n     if(n==0) return 1; \n      else if(n==1) return a; \n       ll R=power(a,n/2)%M; \n        if(n%2==0) {    return mod(mod_mul(R,R));  } \n     \n       else {   return mod(mod_mul(mod_mul(R,a),mod(R)));  }\n     }\n  \n ll mod_inv(ll n){  return power(n,M-2);}\n  \n // only if M is prime\n ll mod_div(ll a,ll b){  \n      ll ans=mod(a);   ll b1=power(b,M-2); \n        ans= mod(mod_mul(ans,b1));  \n         return ans;\n         }\n  \n ll fact_mod(ll n){ \n     vec fact(n+1);\n      fact[0]=1;   \n      loop(i,1,n+1){  \n           fact[i]=mod_mul(fact[i-1],i);\n            }  \n             return fact[n];\n     }\n  \n unsigned long long nCr_mod(unsigned long long n,  ll r) \n { \n     if (r == 0) \n         return 1; \n     unsigned long long fac[n + 1]; \n     fac[0] = 1; \n     for (int i = 1; i <= n; i++) \n         fac[i] = (fac[i - 1] * i) % M; \n   \n     return (fac[n] * mod_inv(fac[r]) % M * mod_inv(fac[n - r]) % M) % M; \n } \n //--------------------------------------------------------------------------------------------------------------\n void solve(){\n     ll n;\n     cin>>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<<z<<endl;\n         return;\n     }\n     cout<<mx*(n-1)-sum+z<<endl;\n }\n \n int main(){\n     FAST;\n     int t;\n     cin>>t;\n     while(t--){\n         solve();  \n     }\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\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<int> v[N];\n int c[N];\n priority_queue<int> 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 <bits/stdc++.h>\n using namespace std;\n stack<pair<int, int> > 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <typename Head, typename... Tail>\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 <bits/stdc++.h>\n using namespace std;\n int N, K;\n int T[200005];\n vector<int> danger;\n vector<pair<int, int> > v;\n bool cf(pair<int, int> x, pair<int, int> y) {\n   return x.second * y.first > y.second * x.first;\n }\n int main() {\n   scanf('%d %d', &N, &K);\n   for (int i = 0; i < N; i++) {\n     scanf('%d', &T[i]);\n     if (T[i] < 0) {\n       danger.push_back(i);\n     }\n   }\n   if (danger.size() > K)\n     puts('-1');\n   else {\n     int change = danger.size() * 2;\n     K -= danger.size();\n     for (int i = 0; i < (int)danger.size(); i++) {\n       if (i == danger.size() - 1)\n         v.push_back(make_pair(N - danger[i] - 1, 1));\n       else\n         v.push_back(make_pair(danger[i + 1] - danger[i] - 1, 2));\n     }\n     sort(v.begin(), v.end(), cf);\n     int idx = 0;\n     while (idx < v.size()) {\n       if (K - v[idx].first >= 0) {\n         K -= v[idx].first;\n         change -= v[idx].second;\n       }\n       idx++;\n     }\n     printf('%d\n', change);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #define ff first\n #define ss second\n #define ll long long\n #define ld long double\n #define pb push_back\n #define eb emplace_back\n #define mp make_pair\n #define mt make_tuple\n #define pii pair<int, int>\n #define pll pair<ll,ll>\n #define vi vector<int>\n #define vl vector<ll>\n #define vii vector<pii>\n #define sws ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);\n #define endl '\n'\n #define teto(a, b) ((a+b-1)/(b))\n using namespace std;\n \n // Extra\n #define forn(i, n) for(int i = 0; i < (int)n; i++)\n #define forne(i, a, b) for(int i = a; i <= b; i++)\n #define all(x) x.begin(), x.end()\n #define dbg(msg, var) cout << msg << ' ' << var << endl;\n //\n \n const int MAX = 200010;\n const ll MOD = (int)1e9 +7;\n const int INF = 1e9;\n const ll LLINF = 0x3f3f3f3f3f3f3f3f;\n const ld EPS = 1e-8;\n \n int n, l, r, s;\n vector<vector<bool>> tab;\n vector<vector<bool>> btab;\n \n int dp(int idx, int soma) {\n     if(soma > s) return 0;\n     if(idx >= n) {\n         return (soma == s);\n     }\n     if(btab[idx][soma]) return tab[idx][soma];\n \n     // cout << idx << ' ' << soma << endl;\n     int res = 0;\n     int pega = dp(idx+1, soma + idx+1);\n     int npega = dp(idx+1, soma);\n \n     if(npega >= pega) {\n         res = npega;\n     }\n     else {\n         res = pega;\n     }\n \n     btab[idx][soma] = true;\n     return tab[idx][soma] = res;\n }\n \n vi solve(vi vals, int sz, bool& ruim) {\n     int t = vals.size();\n     vi foi(n+1, 0);\n     forn(i, t)\n         foi[vals[i]] = 1;\n \n     ruim = false;\n     while(t < sz and !ruim) {\n         bool brk = false;\n         forne(i, 1, n) {\n             if(!foi[i]) continue;\n             forne(j, 1, i-1) {\n                 if(j == i-j) continue;\n                 if(!foi[j] and !foi[i-j]) {\n                     foi[i] = 0;\n                     foi[j] = 1; foi[i-j] = 1;\n                     t++;\n                     brk = true;\n                     break;\n                 }\n             }\n             if(brk) break;\n         }\n         if(!brk) ruim = true;\n     }\n \n     return foi;\n }\n \n int32_t main() {\n     // sws;\n     int t;\n     cin >> t;\n \n     while(t--) {\n         cin >> n >> l >> r >> s;\n \n         tab.assign(n, vector<bool>(s+1, -1));\n         btab.assign(n, vector<bool>(s+1, 0));\n \n         bool win = dp(0, 0);\n         if(win) {\n             vi vals, p(n+1, -1);\n             set<int> pos;\n             forne(i, 1, n) pos.insert(i);\n \n             int idx = 0, soma = 0;\n             while(idx < n) {\n                 if(dp(idx+1, soma)) {\n                     idx++;\n                 }\n                 else {\n                     soma += idx+1;\n                     vals.pb(idx+1);\n                     idx++;\n                 }\n             }\n \n             if(vals.size() > (r-l+1)) {\n                 cout << -1 << endl;\n                 continue;\n             }\n \n             bool ruim;\n             // for(auto val : vals) cout << val << ' ';\n             // cout << endl;\n \n             vi foi = solve(vals, (r-l+1), ruim);\n             // cout << 'ruim = ' << ruim << endl;\n \n             // forne(i, 1, n) cout << foi[i] << ' ';\n             // cout << endl;\n \n             if(ruim) cout << -1 << endl;\n             else {\n                 int id1 = 1, id2 = 1;\n                 forne(i, 1, n) {\n                     if(l <= i and i <= r) {\n                         while(id1 <= n and !foi[id1]) id1++;\n                         cout << id1 << ' ';\n                         id1++;\n                     }\n                     else {\n                         while(id2 <= n and foi[id2]) id2++;\n                         cout << id2 << ' ';\n                         id2++;\n                     }\n                 }\n                 cout << endl;\n             }\n \n         }\n         else {\n             cout << -1 << endl;\n         }\n     }\n \n     // verificar limites, long long\n     return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC optimization('unroll-loops')\n std::pair<int, int> DR[] = {{-1, 0}, {0, 1},   {1, 0}, {0, -1},\n                             {-1, 1}, {-1, -1}, {1, 1}, {1, -1}};\n using namespace std;\n const long long mod = 998244353;\n long long nop = 70;\n vector<int> primes(nop + 1, 1);\n void sieve() {\n   primes[1] = primes[0] = 0;\n   for (long long i = 2; i * i <= nop; i++) {\n     if (primes[i]) {\n       for (long long j = i * i; j <= nop; j += i) {\n         primes[j] = 0;\n       }\n     }\n   }\n }\n long long gcd(long long a, long long b) {\n   if (b > a) swap(b, a);\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n void extgcd(long long a, long long b, long long& x, long long& y) {\n   if (a == 0) {\n     x = a;\n     y = b;\n     return;\n   }\n   extgcd(b % a, a, x, y);\n   long long y1 = y, x1 = x;\n   x = y1 - (b / a) * x1;\n   y = x1;\n }\n long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }\n long long bexp(long long num, long long e) {\n   long long ans = 1;\n   while (e > 0) {\n     if (e & 1) {\n       ans *= num;\n     }\n     num *= num;\n     e >>= 1;\n   }\n   return ans;\n }\n long long mexp(long long num, long long e) {\n   long long ans = 1;\n   while (e > 0) {\n     if (e & 1) {\n       ans = (ans * num) % mod;\n     }\n     num *= num;\n     num %= mod;\n     e >>= 1;\n   }\n   return ans % mod;\n }\n long long modinv(long long a) {\n   a %= mod;\n   return mexp(a, mod - 2);\n }\n void solve() {\n   long long n, k;\n   cin >> n >> k;\n   string s;\n   cin >> s;\n   sort(s.begin(), s.end());\n   vector<long long> cnt(26, 0);\n   for (long long i = 0; i < (n); i++) {\n     cnt[s[i] - 'a']++;\n   }\n   int first = -1, last = -1, nod = 0;\n   for (long long i = 0; i < (26); i++) {\n     if (cnt[i]) {\n       nod++;\n       if (first == -1) first = i;\n       last = i;\n     }\n   }\n   if (cnt[first] < k) {\n     cout << s[k - 1] << '\n';\n     return;\n   }\n   string worst = '';\n   worst += char('a' + first);\n   if (nod >= 3 || (nod == 2 && cnt[first] > k)) {\n     for (long long i = k; i < n; i++) {\n       worst += s[i];\n     }\n   } else {\n     for (long long i = k; i < n; i++) {\n       worst += s[i];\n       i += (k - 1);\n     }\n   }\n   cout << worst << '\n';\n }\n int main() {\n   cin.tie(0);\n   cout.tie(0);\n   ios::sync_with_stdio(0);\n   int t = 1;\n   cin >> t;\n   for (long long T = 1; T <= (t); T++) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char str[100010];\n int ct[100010][4];\n int main() {\n   int N, x[5], R, L, M;\n   scanf('%s', str);\n   N = strlen(str);\n   for (int i = 1; i <= N; i++) {\n     for (int j = 0; j < 3; j++) ct[i][j] = ct[i - 1][j];\n     ct[i][str[i - 1] - 'x']++;\n   }\n   scanf('%d', &M);\n   for (int i = 0; i < M; i++) {\n     scanf('%d%d', &L, &R);\n     L--;\n     if (R - L < 3) {\n       puts('YES');\n       continue;\n     }\n     for (int j = 0; j < 3; j++) x[j] = ct[R][j] - ct[L][j];\n     if (x[0] <= x[1] && x[1] <= x[2] && x[2] - x[0] <= 1)\n       puts('YES');\n     else if (x[1] <= x[2] && x[2] <= x[0] && x[0] - x[1] <= 1)\n       puts('YES');\n     else if (x[2] <= x[0] && x[0] <= x[1] && x[1] - x[2] <= 1)\n       puts('YES');\n     else\n       puts('NO');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 5;\n int n, a[maxn];\n struct node {\n   int pre;\n   bool flag;\n   int other;\n } num[2 * maxn];\n int main(int argc, char const *argv[]) {\n   while (cin >> n) {\n     bool flag = true;\n     for (int i = 0; i <= n; i++) {\n       cin >> a[i];\n       if (a[i] != 1) flag = false;\n     }\n     if (flag == true) {\n       cout << 'perfect' << endl;\n       continue;\n     }\n     bool temp = false;\n     bool ans = false;\n     int cnt = 1;\n     for (int i = 0; i <= n; i++) {\n       if (i > 0 && a[i] > 1 && a[i - 1] > 1 && ans == false) {\n         ans = true;\n         int par = cnt - 1;\n         int k = a[i];\n         k--;\n         while (k--) {\n           num[cnt].pre = par;\n           num[cnt].other = par - 1;\n           num[cnt].flag = true;\n           cnt++;\n         }\n         num[cnt].pre = num[cnt].other = par;\n         num[cnt].flag = true;\n         cnt++;\n       } else {\n         int par = cnt - 1;\n         int k = a[i];\n         while (k--) {\n           num[cnt].pre = par;\n           num[cnt].flag = false;\n           cnt++;\n         }\n       }\n     }\n     if (ans == false) {\n       cout << 'perfect' << endl;\n       continue;\n     }\n     cout << 'ambiguous' << endl;\n     for (int i = 1; i < cnt; i++) cout << num[i].pre << ' ';\n     cout << endl;\n     for (int i = 1; i < cnt; i++) {\n       if (num[i].flag == false)\n         cout << num[i].pre;\n       else\n         cout << num[i].other;\n       cout << ' ';\n     }\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int mymax(int x) {\n   int max = 0;\n   while (x) {\n     int s = x % 10;\n     if (s > max) max = s;\n     x /= 10;\n   }\n   return max;\n }\n int zh(int x, int n) {\n   int s = 0, p = 1;\n   while (x) {\n     s += x % 10 * p;\n     x /= 10;\n     p *= n;\n   }\n   return s;\n }\n int main() {\n   int a, b;\n   cin >> a >> b;\n   int n = max(mymax(a), mymax(b)) + 1;\n   int num = zh(a, n) + zh(b, n);\n   int j = 0;\n   while (num) {\n     int s = num % n;\n     num /= n;\n     j++;\n   }\n   cout << j << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n class Constellation {\n   static const long long N = 100010;\n   inline long long sign(long long x) { return x > 0 ? 1 : x == 0 ? 0 : -1; }\n   struct point {\n     long long x, y, num;\n   } b[N];\n   long long n;\n   long long cross(const point &a, const point &b, const point &c) {\n     return sign((b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x));\n   }\n   bool contain(const point &a, const point &b, const point &c, const point &p) {\n     long long v1 = cross(a, b, p), v2 = cross(b, c, p), v3 = cross(c, a, p);\n     return v1 * v2 >= 0 && v2 * v3 >= 0 && v3 * v1 >= 0;\n   }\n \n  public:\n   void solve() {\n     cin >> n;\n     for (long long i = 1; i <= n; ++i) cin >> b[i].x >> b[i].y;\n     long long p1 = 1, p2 = 2, p3 = 0;\n     for (long long i = 3; i <= n; ++i)\n       if (cross(b[p1], b[p2], b[i])) {\n         p3 = i;\n         break;\n       }\n     for (long long i = 1; i <= n; ++i)\n       if (i != p1 && i != p2 && i != p3 && contain(b[p1], b[p2], b[p3], b[i])) {\n         if (cross(b[p1], b[p2], b[i]))\n           p3 = i;\n         else\n           p2 = i;\n       }\n     cout << p1 << ' ' << p2 << ' ' << p3 << endl;\n   }\n } T;\n int main() { T.solve(); }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n double eps = 1e-9;\n using namespace std;\n int main() {\n   std::ios::sync_with_stdio(false);\n   int x, y, z, w, b, a;\n   cin >> x >> y >> z >> w >> b >> a;\n   cout << (2 * (2 * x + a + y) * (z + y) - (a * a + b * b + y * y + z * z)) / 2;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dirx[] = {1, 0, -1, 0};\n int diry[] = {0, 1, 0, -1};\n int a;\n vector<int> graph[100005];\n int dist[100005];\n bool visit[100005];\n int cnt = 0;\n bool flag = false;\n int dfs(int u, int par) {\n   visit[u] = true;\n   for (int i = 0; i < graph[u].size(); i++) {\n     if (!visit[graph[u][i]]) dist[u] += dfs(graph[u][i], u);\n   }\n   if (dist[u] != 0 && (dist[u] + 1) % 2 == 0) {\n     cnt++;\n     dist[u] = 0;\n     return 0;\n   } else\n     return 1;\n }\n int main() {\n   scanf('%d', &a);\n   int x, y;\n   int start = 0;\n   for (int i = 0; i < a - 1; i++) {\n     scanf('%d %d', &x, &y);\n     start = x;\n     graph[x].push_back(y);\n     graph[y].push_back(x);\n   }\n   if (a % 2 == 1) {\n     cout << -1 << endl;\n     return 0;\n   }\n   dfs(start, 0);\n   cout << cnt - 1 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int n, k, c[100005], visit[100005], tp = 0;\n vector<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n template <typename F, typename S>\n ostream &operator<<(ostream &os, const pair<F, S> &p) {\n   return os << '(' << p.first << ', ' << p.second << ')';\n }\n template <typename T>\n ostream &operator<<(ostream &os, const vector<T> &v) {\n   os << '{';\n   typename vector<T>::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 <typename T>\n ostream &operator<<(ostream &os, const set<T> &v) {\n   os << '[';\n   typename set<T>::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 <typename F, typename S>\n ostream &operator<<(ostream &os, const map<F, S> &v) {\n   os << '[';\n   typename map<F, S>::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<vector<bool> > &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<vector<bool> > visited(n, vector<bool>(m, false));\n       dfs(k, l, visited);\n       for (int i = 0; i < (n); i++) {\n         for (int j = 0; j < (m); j++) {\n           if (!visited[i][j]) {\n             cout << 'NO' << endl;\n             return 0;\n           }\n         }\n       }\n     }\n   }\n   cout << 'YES' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n template <class T>\n void cxk(T& a, T b) {\n   a = a > b ? a : b;\n }\n template <class T>\n void cnk(T& a, T b) {\n   a = a < b ? a : b;\n }\n long long gi() {\n   long long x = 0, f = 1;\n   char ch = getchar();\n   while (!isdigit(ch)) f ^= ch == '-', ch = getchar();\n   while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();\n   return f ? x : -x;\n }\n int col[200010], f[200010][2][2][2], p2[400010];\n void inc(int& x, int y) {\n   x = x + y >= 1000000007 ? x + y - 1000000007 : x + y;\n }\n int main() {\n   int n = gi(), p = gi();\n   for (int i = 1; i <= n; ++i) col[i] = gi();\n   p2[0] = 1;\n   for (int i = 1; i <= n + n; ++i) p2[i] = 2 * p2[i - 1] % 1000000007;\n   f[1][0][0][0] = 1;\n   for (int i = 1; i <= n; ++i)\n     for (int j = 0; j < 2; ++j)\n       for (int k = 0; k < 2; ++k)\n         for (int l = 0; l < 2; ++l)\n           if (f[i][j][k][l]) {\n             if (col[i] != 1) {\n               inc(f[i + 1][1][k][!l],\n                   1ll * p2[i - 1 - !!k] * f[i][j][k][l] % 1000000007);\n               if (k)\n                 inc(f[i + 1][j][k][l],\n                     1ll * p2[i - 2] * f[i][j][k][l] % 1000000007);\n             }\n             if (col[i] != 0) {\n               inc(f[i + 1][j][1][!l],\n                   1ll * p2[i - 1 - !!j] * f[i][j][k][l] % 1000000007);\n               if (j)\n                 inc(f[i + 1][j][k][l],\n                     1ll * p2[i - 2] * f[i][j][k][l] % 1000000007);\n             }\n           }\n   int ans = 0;\n   for (int i = 0; i < 2; ++i)\n     for (int j = 0; j < 2; ++j) inc(ans, f[n + 1][i][j][p]);\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #define me(a, b) memset(a, b, sizeof(a))\n #define IOS() ios::sync_with_stdio(false), cin.tie(0)\n #define endl '\n'\n \n typedef long long ll;\n typedef pair<ll, ll> pll;\n typedef pair<int, int> pii;\n const int INF = 0x3f3f3f3f;\n const int maxn = 2e5 + 5;\n const ll mod = 1e9 + 7;\n \n int cnt[26];\n int n, k;\n vector<pii> ans;\n int check()\n {\n 	ans.clear();\n 	int sum = 0;\n 	for(int i = 0; i < 26; ++i) {\n 		int r = cnt[i] % k;\n 		if(r){\n 			ans.push_back(pii(i, k - r));\n 			sum += k - r;\n 		}\n 	}\n 	return sum;\n }\n \n void solve()\n {\n 	me(cnt, 0);\n 	string s;\n 	cin >> n >> k >> s;\n 	for(char &c : s)\n 		++cnt[c - 'a'];\n 	if(check() == 0) {\n 		cout << s << endl;\n 		return ;\n 	}\n 	for(int i = s.size()-1; i >= 0; --i) {\n 		char &c = s[i];\n 		--cnt[c - 'a'];\n 		for(int j = s[i] - 'a' + 1; j < 26; ++j) {\n 			c = j + 'a';\n 			++cnt[j];\n 			int sum = s.size()-i-1 - check();\n 			--cnt[j];\n 			if(sum >= 0 && sum % k == 0) {\n 				string t;\n 				for(int p = 0; p <= i; ++p)\n 					t.push_back(s[p]);\n 				t.append(sum, 'a');\n 				for(pii p : ans) {\n 					t.append(p.second, p.first+'a');\n 				}\n 				cout << t << endl;\n 				return ;\n 			}\n \n 		}\n 	}\n 	cout << '-1\n';\n }\n \n \n int main()\n {\n 	IOS();\n 	int T;\n 	cin >> T;\n 	while(T--)\n 		solve();\n 	return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int f[100001], g[100001], h[100001];\n int n, cnt;\n bool work() {\n   cnt = -1;\n   for (int i = 0; i < n; ++i) {\n     if (g[i] != -1) {\n       if (f[i] != i) return false;\n     } else {\n       if (g[f[i]] == -1) {\n         g[i] = ++cnt;\n         h[cnt] = f[i];\n         g[f[i]] = cnt;\n       } else {\n         if (h[g[f[i]]] != f[i]) return false;\n         h[g[f[i]]] = f[i];\n         g[i] = g[f[i]];\n       }\n     }\n   }\n   return true;\n }\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; ++i) cin >> f[i];\n   for (int i = 0; i < n; ++i) --f[i];\n   for (int i = 0; i < n; ++i) g[i] = h[i] = -1;\n   if (work()) {\n     cout << ++cnt << endl;\n     for (int i = 0; i < n; ++i) cout << ++g[i] << ' ';\n     cout << endl;\n     for (int i = 0; i < cnt; ++i) cout << ++h[i] << ' ';\n   } else\n     cout << -1 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n;\n   cin >> n;\n   cout << n / 2 + 1;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxl = 200005;\n int T, n, mk, seq[maxl];\n char s[maxl];\n inline char read() {\n   char ch = getchar();\n   while (ch != '<' && ch != '>') ch = getchar();\n   return ch;\n }\n int main() {\n   scanf('%d', &T);\n   while (T--) {\n     scanf('%d', &n);\n     mk = 0;\n     memset(seq, 0, sizeof(seq));\n     for (register int i = 1; i < n; i++) s[i] = read();\n     s[0] = '>';\n     s[n] = '<';\n     for (register int i = n; i; i--)\n       if (s[i - 1] == '>' && s[i] == '<') seq[i] = ++mk;\n     mk = n;\n     for (register int i = 1, j, tmp; i <= n; i++) {\n       if (seq[i]) continue;\n       if (s[i - 1] == '>')\n         seq[i] = mk--;\n       else {\n         for (j = i; s[j] != '>' && j < n; j++)\n           ;\n         tmp = j;\n         for (; j >= i; j--) seq[j] = mk--;\n         i = tmp;\n       }\n     }\n     for (register int i = 1; i <= n; i++) printf('%d ', seq[i]);\n     printf('\n');\n     memset(seq, 0, sizeof(seq));\n     mk = 0;\n     for (register int i = 1; i <= n; i++)\n       if (s[i - 1] == '>' && s[i] == '<') seq[i] = ++mk;\n     mk = n;\n     for (register int i = n, j, tmp; i; i--) {\n       if (seq[i]) continue;\n       if (s[i] == '<')\n         seq[i] = mk--;\n       else {\n         for (j = i; s[j - 1] != '<' && j > 1; j--)\n           ;\n         tmp = j;\n         for (; j <= i; j++) seq[j] = mk--;\n         i = tmp;\n       }\n     }\n     for (register int i = 1; i <= n; i++) printf('%d ', seq[i]);\n     printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ifstream in('date.in');\n   ofstream out('date.out');\n   long long nr2, k, rez[4001], con = 0, nr, n, pli[4001], plp[4001], inc[4001],\n                                i, j;\n   cin >> n;\n   for (i = 1; i <= n; i++) cin >> pli[i] >> plp[i] >> inc[i];\n   for (i = 1; i <= n; i++) {\n     nr = nr2 = 0;\n     if (inc[i] >= 0) {\n       rez[++con] = i;\n       nr = pli[i];\n       for (j = i + 1; nr > 0 && j <= n; j++) {\n         if (inc[j] >= 0) {\n           inc[j] -= nr--;\n         } else {\n           if (pli[j]) {\n             inc[j] -= nr;\n             pli[j] = 0;\n             nr2 = plp[j];\n             for (k = j + 1; k <= n; k++) inc[k] -= nr2;\n           }\n         }\n       }\n     } else {\n       if (pli[i]) {\n         pli[i] = 0;\n         nr2 = plp[i];\n         for (k = i + 1; k <= n; k++) inc[k] -= nr2;\n       }\n     }\n   }\n   cout << con << '\n';\n   for (j = 1; j <= con; j++) cout << rez[j] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1000000007;\n const int N = 128;\n int num[N];\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; ++i) {\n     cin >> num[i];\n   }\n   int m;\n   cin >> m;\n   for (int i = 0; i < m; ++i) {\n     int x, y;\n     cin >> x >> y;\n     num[x - 1] += y - 1;\n     num[x + 1] += num[x] - y;\n     num[x] = 0;\n   }\n   for (int i = 1; i <= n; ++i) {\n     cout << num[i] << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int p[3010000], n;\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i < n + 1; i++) p[i] = i;\n   for (int i = 2; i < n + 1; i++) {\n     int s = p[i - 1], ns;\n     for (int j = i - 1; j <= n + i - 2; j += i) {\n       ns = p[j + i];\n       if (j + i <= n + i - 2)\n         p[j + i] = s;\n       else\n         p[n + i - 1] = s;\n       s = ns;\n     }\n   }\n   for (int i = 1; i < n + 1; i++) printf('%d ', p[n - 1 + i]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int arr[101];\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> arr[i];\n   }\n   sort(arr, arr + n);\n   for (int i = 0; i < n; i++) {\n     cout << arr[i] << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 100;\n long long arr[N], d[N], tree[N << 2], mx[N << 2];\n void build(int rt, int l, int r) {\n   if (l == r) {\n     tree[rt] = mx[rt] = arr[l];\n     return;\n   }\n   int m = (l + r) / 2;\n   build(rt << 1, l, m);\n   build(rt << 1 | 1, m + 1, r);\n   tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];\n   mx[rt] = max(mx[rt << 1], mx[rt << 1 | 1]);\n }\n void update(int L, int R, int rt, int l, int r) {\n   if (mx[rt] <= 2) return;\n   if (l == r) {\n     tree[rt] = mx[rt] = d[tree[rt]];\n     return;\n   }\n   int m = (l + r) >> 1;\n   if (L <= m) update(L, R, rt << 1, l, m);\n   if (R > m) update(L, R, rt << 1 | 1, m + 1, r);\n   tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];\n   mx[rt] = max(mx[rt << 1], mx[rt << 1 | 1]);\n }\n long long query(int L, int R, int rt, int l, int r) {\n   if (L <= l && r <= R) {\n     return tree[rt];\n   }\n   int m = (l + r) >> 1;\n   long long ans = 0;\n   if (L <= m) ans += query(L, R, rt << 1, l, m);\n   if (R > m) ans += query(L, R, rt << 1 | 1, m + 1, r);\n   return ans;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   int n, m, t, l, r;\n   for (int i = 1; i < N; i++) {\n     for (int j = i; j < N; j += i) d[j]++;\n   }\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++) cin >> arr[i];\n   build(1, 1, n);\n   while (m--) {\n     cin >> t >> l >> r;\n     if (t == 1)\n       update(l, r, 1, 1, n);\n     else\n       cout << query(l, r, 1, 1, n) << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int a[] = {0,   1,  1, 1, 2,  1, 2,  1, 5,  2, 2,  1, 5,  1, 2, 1,\n                  14,  1,  5, 1, 5,  2, 2,  1, 15, 2, 2,  5, 4,  1, 4, 1,\n                  51,  1,  2, 1, 14, 1, 2,  2, 14, 1, 6,  1, 4,  2, 2, 1,\n                  52,  2,  5, 1, 5,  1, 15, 2, 13, 2, 2,  1, 13, 1, 2, 4,\n                  267, 1,  4, 1, 5,  1, 4,  1, 50, 1, 2,  3, 4,  1, 6, 1,\n                  52,  15, 2, 1, 15, 1, 2,  1, 12, 1, 10, 1, 4,  2};\n int main() {\n   int n;\n   cin >> n;\n   cout << a[n];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline bool fs(T &x) {\n   int c = getchar();\n   int sgn = 1;\n   while (~c && c < '0' || c > '9') {\n     if (c == '-') sgn = -1;\n     c = getchar();\n   }\n   for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';\n   x *= sgn;\n   return ~c;\n }\n int main() {\n   long long int n, m, cnt = 0;\n   fs(n);\n   fs(m);\n   for (long long int i = 1; i * i <= m; i++) {\n     if (m % i == 0 && m / i <= n) {\n       if (m / i != i) cnt++;\n       cnt++;\n     }\n   }\n   cout << cnt << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int solve(vector<pair<int, int> > v, int price) {\n   if (v.size() < 2) return 0;\n   vector<int> p, b;\n   for (int i = 0; i < v.size(); i++)\n     p.push_back(v[i].first), b.push_back(v[i].second);\n   int amx[v.size()];\n   amx[0] = b[0];\n   for (int i = 1; i < b.size(); i++) amx[i] = max(amx[i - 1], b[i]);\n   int ans = 0;\n   for (int i = 0; i < v.size(); i++) {\n     int id = upper_bound(p.begin(), p.begin() + i, price - p[i]) - p.begin();\n     id--;\n     if (id < 0 || id >= v.size()) continue;\n     if (id != i) ans = max(ans, b[i] + amx[id]);\n   }\n   return ans;\n }\n int main() {\n   int i, j, k;\n   int n, m;\n   int c, d;\n   int x, y;\n   char ch;\n   cin >> n >> c >> d;\n   int mc = 0, md = 0;\n   vector<pair<int, int> > coins, diamonds;\n   for (i = 0; i < n; i++) {\n     cin >> x >> y >> ch;\n     if (ch == 'C') {\n       if (c >= y) mc = max(mc, x), coins.push_back({y, x});\n     } else {\n       if (d >= y) md = max(md, x), diamonds.push_back({y, x});\n     }\n   }\n   int ans = 0;\n   if (mc > 0 && md > 0) ans = mc + md;\n   sort(coins.begin(), coins.end());\n   sort(diamonds.begin(), diamonds.end());\n   ans = max(ans, solve(coins, c));\n   ans = max(ans, solve(diamonds, d));\n   printf('%d ', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int _, n;\n char s[100005];\n int main() {\n   scanf('%d', &_);\n   while (_--) {\n     scanf('%d', &n);\n     s[0] = 'a';\n     scanf('%s', s + 1);\n     int p = -1;\n     for (int i = n; i >= 1; i--) {\n       if (s[i] == '0') {\n         p = i;\n         break;\n       }\n     }\n     bool f = 0;\n     for (int i = 1; i <= n; i++) {\n       if (s[i] == '1') {\n         if (s[i + 1] == '0')\n           f = 1;\n         else\n           f = 0;\n         if (i < p) {\n           continue;\n         }\n         printf('1');\n       } else {\n         if (f) {\n           printf('0');\n           i = p;\n           continue;\n         }\n         printf('0');\n       }\n     }\n     puts('');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, ans, notOK;\n map<int, int> M;\n int main() {\n   cin >> n;\n   for (int i = 0, x; i < n; i++) cin >> x, M[x]++;\n   for (map<int, int>::iterator it = M.begin(); it != M.end(); it++) {\n     if (it->first) {\n       if (it->second == 2)\n         ans++;\n       else if (it->second > 2)\n         notOK = 1;\n     }\n   }\n   cout << (notOK ? -1 : ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> cr1[27];\n vector<int> cr2[27];\n int s1[27];\n int s2[27];\n struct node {\n   int x;\n   int y;\n };\n int main() {\n   int n;\n   cin >> n;\n   char c;\n   for (int i = 0; i < n; i++) {\n     cin >> c;\n     if (c == '?') {\n       s1[26]++;\n       cr1[26].push_back(i);\n     } else {\n       s1[c - 'a']++;\n       cr1[c - 'a'].push_back(i);\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     cin >> c;\n     if (c == '?') {\n       s2[26]++;\n       cr2[26].push_back(i);\n     } else {\n       s2[c - 'a']++;\n       cr2[c - 'a'].push_back(i);\n     }\n   }\n   int cnt = 0;\n   vector<node> nd;\n   for (int i = 0; i < 26; i++) {\n     int x = s1[i] - 1;\n     int y = s2[i] - 1;\n     while (x >= 0 && y >= 0) {\n       node n1;\n       n1.x = cr1[i][x];\n       n1.y = cr2[i][y];\n       nd.push_back(n1);\n       cnt++;\n       x--;\n       y--;\n     }\n     if (x >= 0 && y < 0) {\n       node n1;\n       while (x >= 0 && s2[26] > 0) {\n         n1.x = cr1[i][x];\n         n1.y = cr2[26][s2[26] - 1];\n         nd.push_back(n1);\n         cnt++;\n         s2[26]--;\n         x--;\n       }\n     } else if (x < 0 && y >= 0) {\n       node n1;\n       while (y >= 0 && s1[26] > 0) {\n         n1.x = cr1[26][s1[26] - 1];\n         n1.y = cr2[i][y];\n         nd.push_back(n1);\n         cnt++;\n         s1[26]--;\n         y--;\n       }\n     }\n   }\n   while (s1[26] > 0 && s2[26] > 0) {\n     node n1;\n     n1.x = cr1[26][s1[26] - 1];\n     n1.y = cr2[26][s2[26] - 1];\n     nd.push_back(n1);\n     cnt++;\n     s1[26]--;\n     s2[26]--;\n   }\n   cout << cnt << endl;\n   for (int i = 0; i < nd.size(); i++)\n     cout << nd[i].x + 1 << ' ' << nd[i].y + 1 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void actionFun() {\n   long long n;\n   cin >> n;\n   long long c = 2;\n   for (int i = 0; i < n; i++) {\n     cout << c << ' ';\n     ++c;\n   }\n   cout << endl;\n   return;\n }\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     actionFun();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   while (~scanf('%d', &n)) {\n     int cnt = 0;\n     for (int i = 1; i < n; i++) {\n       for (int j = i + 1; j < n; j++) {\n         int sum = i * i + j * j;\n         if (sum <= n * n) {\n           if ((int)sqrt(sum) * (int)sqrt(sum) == sum) cnt++;\n         }\n       }\n     }\n     printf('%d\n', cnt);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int k[1005], n, i, j;\n long long kx[1005];\n int main() {\n   cin >> n;\n   for (i = 1; i <= n; i++) cin >> k[i];\n   kx[1] = 2;\n   for (i = 2; i <= n; i++) {\n     if (k[i] == i)\n       kx[i] = 2;\n     else {\n       for (j = k[i]; j < i; j++) kx[i] = (kx[i] + kx[j]) % 1000000007;\n       kx[i] = (kx[i] + 2) % 1000000007;\n     }\n   }\n   long long ans = 0;\n   for (i = 1; i <= n; i++) ans = (ans + kx[i]) % 1000000007;\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(NULL);\n   long long n;\n   cin >> n;\n   vector<long long> a(n);\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   if (n == 1) {\n     cout << 'YES';\n     return 0;\n   }\n   vector<long long> v;\n   long long cnt0 = 1;\n   for (int i = 1; i < n; i++) {\n     if (a[i] != a[i - 1]) {\n       v.push_back(cnt0);\n       cnt0 = 1;\n     } else\n       cnt0++;\n     if (i == n - 1) {\n       v.push_back(cnt0);\n     }\n   }\n   long long cnt = 1;\n   for (int i = 0; i < v.size(); i++) {\n     if (v[i] == v[i + 1]) cnt++;\n   }\n   if (cnt == v.size())\n     cout << 'YES';\n   else\n     cout << 'NO';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #pragma GCC push_options\n #pragma GCC optimize('unroll-loops')\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long int INF = 10e18;\n   long long t;\n   cin >> t;\n   while (t--) {\n     long long n;\n     cin >> n;\n     long long a[n], b[n], c[n];\n     for (long long i = 0; i < n; i++) {\n       cin >> a[i] >> b[i];\n     }\n     for (long long i = 1; i <= n; i++) {\n       c[i % n] = max(0ll, a[i % n] - b[i - 1]);\n     }\n     long long sum = accumulate(c, c + n, 0ll);\n     long long res = INF;\n     for (long long i = 0; i < n; i++) {\n       res = min(res, sum + a[i] - c[i]);\n     }\n     cout << res << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int contrib[312345] = {0};\n bool in_set[312345] = {0};\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int n, k;\n   cin >> n >> k;\n   vector<int> ans;\n   int cnt = 0;\n   for (int i = 1; i <= n / 2; i++) {\n     if (cnt + contrib[i] <= k) {\n       ans.push_back(i);\n       in_set[i] = true;\n       cnt += contrib[i];\n       for (int j = i + i; j <= n; j += i) contrib[j]++;\n     } else {\n       while (cnt + contrib[i] > k) {\n         cnt -= contrib[ans.back()];\n         for (int j = ans.back() + ans.back(); j <= n; j += ans.back())\n           contrib[j]--;\n         in_set[ans.back()] = false;\n         ans.pop_back();\n       }\n       ans.push_back(i);\n       in_set[i] = true;\n       cnt += contrib[i];\n       for (int j = i + i; j <= n; j += i) contrib[j]++;\n     }\n     if (cnt == k) break;\n   }\n   priority_queue<pair<int, int> > pq;\n   for (int i = n / 2 + 1; i <= n; i++) {\n     if (in_set[i]) continue;\n     pq.push(make_pair(contrib[i], i));\n   }\n   while (!pq.empty()) {\n     while (!pq.empty() && cnt + pq.top().first > k) pq.pop();\n     if (pq.empty()) break;\n     cnt += pq.top().first;\n     ans.push_back(pq.top().second);\n     pq.pop();\n   }\n   if (cnt != k) {\n     cout << 'No' << endl;\n     return 0;\n   }\n   cout << 'Yes' << endl;\n   cout << ans.size() << endl;\n   for (int i = 0; i < ans.size(); i++) {\n     if (i) cout << ' ';\n     cout << ans[i];\n   }\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize(2)\n using namespace std;\n void qread(int &x) {\n   int neg = 1;\n   x = 0;\n   char c = getchar();\n   while (c < '0' || c > '9') {\n     if (c == '-') neg = -1;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') x = 10 * x + c - '0', c = getchar();\n   x *= neg;\n }\n const int maxn = 200005;\n char c[maxn];\n int n, m;\n string s, t;\n int main() {\n   scanf('%d%d', &n, &m);\n   scanf('%s', c);\n   s = c;\n   scanf('%s', c);\n   t = c;\n   bool ok = false;\n   for (int(i) = 0; (i) < n; i++)\n     if (s[i] == '*') ok = true;\n   if (!ok) {\n     puts(s == t ? 'YES' : 'NO');\n     return 0;\n   }\n   int pre = 0, suf = 0;\n   while (s[pre] != '*' && s[pre] == t[pre]) pre++;\n   while (s[n - suf - 1] != '*' && s[n - suf - 1] == t[m - suf - 1]) suf++;\n   if (s[pre] == '*' && s[n - suf - 1] == '*' && pre - 1 < m - suf)\n     puts('YES');\n   else\n     puts('NO');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   if (n == 1) {\n     cout << -1 << endl;\n     return 0;\n   }\n   cout << n << ' ' << n + 1 << ' ' << n * (n + 1) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using int64 = long long;\n using pii = pair<int, int>;\n using vchar = vector<char>;\n using vvchar = vector<vchar>;\n using vint = vector<int>;\n using vint64 = vector<int64>;\n using vvint = vector<vint>;\n using vbool = vector<bool>;\n using vpii = vector<pii>;\n template <typename T>\n T sqr(T x) {\n   return x * x;\n }\n template <typename T>\n T gcd(T a, T b) {\n   return b == 0 ? a : gcd(b, a % b);\n }\n pair<int, vint> solveD(vvint g, int k) {\n   enum { NOT_VISITED, STARTED, FINISHED };\n   const int n = g.size();\n   vint depth(n, -1);\n   depth[0] = 0;\n   vint parent(n, -1);\n   vint loopState(n, NOT_VISITED);\n   pair<int, vint> result;\n   result.first = 0;\n   std::function<void(int)> DFS = [&](int v) {\n     loopState[v] = STARTED;\n     const int previous = parent[v];\n     if (result.first != 0) return;\n     int backVertex = -1;\n     int backDepth = -1;\n     for (auto to : g[v]) {\n       if (to == previous) continue;\n       if (loopState[to] == STARTED && depth[to] > backDepth) {\n         backVertex = to;\n         backDepth = depth[to];\n       }\n     }\n     if (backVertex != -1) {\n       vint loop;\n       for (int u = v; u != backVertex; u = parent[u]) {\n         loop.push_back(u);\n       }\n       loop.push_back(backVertex);\n       reverse(std::begin(loop), std::end(loop));\n       assert(depth[v] - depth[backVertex] + 1 == loop.size());\n       const int loopLength = loop.size();\n       if (loopLength > k) {\n         result.first = 1;\n         for (int i = 0; i < loop.size(); i += 2) {\n           result.second.push_back(loop[i]);\n         }\n         result.second.resize((k + 1) / 2);\n       } else {\n         result.first = 2;\n         result.second = loop;\n       }\n       return;\n     }\n     for (auto to : g[v]) {\n       if (loopState[to] == NOT_VISITED) {\n         parent[to] = v;\n         depth[to] = depth[v] + 1;\n         DFS(to);\n         if (result.first != 0) return;\n       }\n     }\n     loopState[v] = FINISHED;\n   };\n   DFS(0);\n   if (result.first != 0) {\n     return result;\n   }\n   vint colors(n, -1);\n   std::function<void(int, int)> biColor = [&](int v, int color) {\n     colors[v] = color;\n     for (auto to : g[v]) {\n       if (colors[to] == -1) {\n         biColor(to, 1 - color);\n       }\n     }\n   };\n   biColor(0, 0);\n   int colorCount[2] = {0};\n   for (int i = 0; i < n; ++i) {\n     colorCount[colors[i]]++;\n   }\n   const int bestColor = colorCount[0] > colorCount[1] ? 0 : 1;\n   result.first = 1;\n   for (int i = 0; i < n; ++i) {\n     if (colors[i] == bestColor) {\n       result.second.push_back(i);\n     }\n   }\n   result.second.resize((k + 1) / 2);\n   return result;\n }\n int main() {\n   int T = 1;\n   std::ios::sync_with_stdio(false);\n   while (T--) {\n     int n;\n     cin >> n;\n     ;\n     int m;\n     cin >> m;\n     ;\n     int k;\n     cin >> k;\n     ;\n     vvint g(n);\n     while (m--) {\n       int u;\n       cin >> u;\n       ;\n       int v;\n       cin >> v;\n       ;\n       u--, v--;\n       g[u].push_back(v);\n       g[v].push_back(u);\n     }\n     auto result = solveD(g, k);\n     assert(result.first == 1 || result.first == 2);\n     cout << result.first << endl;\n     for (int& v : result.second) {\n       v++;\n     }\n     if (result.first == 2) {\n       cout << result.second.size() << endl;\n     }\n     std::copy(std::begin(result.second), std::end(result.second),\n               ostream_iterator<int>(cout, ' '));\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[500000];\n int mina, maxa;\n int n, k;\n long long sum = 0;\n bool check(int c) {\n   sum = 0;\n   for (int i = 0; i < n; i++) {\n     if (a[i] + c < mina) {\n       sum += mina - c - a[i];\n     } else {\n       break;\n     }\n   }\n   if (sum > k) return false;\n   return true;\n }\n bool checkp(int c) {\n   sum = 0;\n   for (int i = 0; i < n; i++) {\n     if (a[i] - c > maxa) {\n       sum += a[i] - c - maxa;\n     }\n   }\n   if (sum > k) return false;\n   return true;\n }\n int main() {\n   scanf('%d %d', &n, &k);\n   long long sum = 0;\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &a[i]);\n     sum += a[i];\n   }\n   if (sum % n == 0) {\n     mina = maxa = sum / n;\n   } else {\n     mina = sum / n;\n     maxa = sum / n + 1;\n   }\n   sort(a, a + n);\n   int ll = 0, rr = 1000000000;\n   while (ll != rr) {\n     int mid = (ll + rr) / 2;\n     if (check(mid)) {\n       rr = mid;\n     } else {\n       ll = mid + 1;\n     }\n   }\n   int lll = 0, rrr = 1000000000;\n   while (lll != rrr) {\n     int mid = (lll + rrr) / 2;\n     if (checkp(mid)) {\n       rrr = mid;\n     } else {\n       lll = mid + 1;\n     }\n   }\n   printf('%lld', (long long)lll + ll + maxa - mina);\n   scanf('%d', &n);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m, s, f, i;\n   cin >> n >> m >> s >> f;\n   long long t;\n   map<long long, pair<int, int>> h;\n   pair<int, int> R;\n   for (i = 0; i < m; i++) {\n     cin >> t >> R.first >> R.second;\n     h[t] = R;\n   }\n   i = 1;\n   if (s < f)\n     while (s != f) {\n       if (h.find(i) == h.end()) {\n         cout << 'R';\n         s++;\n       } else {\n         if ((h[i].first <= s && s <= h[i].second) ||\n             (h[i].first <= s + 1 && s + 1 <= h[i].second)) {\n           cout << 'X';\n         } else {\n           cout << 'R';\n           s++;\n         }\n       }\n       i++;\n     }\n   else {\n     while (s != f) {\n       if (h.find(i) == h.end()) {\n         cout << 'L';\n         s--;\n       } else {\n         if ((h[i].first <= s && s <= h[i].second) ||\n             (h[i].first <= s - 1 && s - 1 <= h[i].second)) {\n           cout << 'X';\n         } else {\n           cout << 'L';\n           s--;\n         }\n       }\n       i++;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int d[n];\n   int total = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> d[i];\n     total += d[i];\n   }\n   int s, t;\n   cin >> s >> t;\n   if (s == t) {\n     cout << 0;\n     return 0;\n   }\n   if (s > t) swap(s, t);\n   int ans = 0;\n   for (int i = s; i < t; i++) {\n     ans += d[i - 1];\n   }\n   cout << min(ans, total - ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, Q;\n double sy, l[200100], r[200100], sum[200100], zl, zr, x, y, ans;\n struct Node {\n   double x, y;\n } bj[2][200100], tmp, L, R;\n inline bool lef(Node u, Node v, Node w) {\n   if (u.x == v.x) return w.x < u.x;\n   double t;\n   t = v.x - (v.x - u.x) * (v.y - w.y) / (v.y - u.y);\n   return w.x < t;\n }\n inline double ask(int u) {\n   double p, q;\n   if (bj[0][u].x == x)\n     p = x;\n   else {\n     p = x - (x - bj[0][u].x) * (y - sy) / y;\n   }\n   if (bj[1][u].x == x)\n     q = x;\n   else {\n     q = x - (x - bj[1][u].x) * (y - sy) / y;\n   }\n   return max((double)0, min(q, zr) - max(p, zl));\n }\n int main() {\n   int i, j, p, q, mid, a, b;\n   cin >> sy >> zl >> zr >> n;\n   L.y = R.y = sy, L.x = zl, R.x = zr;\n   for (i = 1; i <= n; i++) {\n     scanf('%lf%lf', &l[i], &r[i]);\n     sum[i] = sum[i - 1] + r[i] - l[i];\n     bj[0][i].y = 0, bj[0][i].x = l[i];\n     bj[1][i].y = 0, bj[1][i].x = r[i];\n   }\n   cin >> m;\n   for (i = 1; i <= m; i++) {\n     scanf('%lf%lf', &x, &y);\n     ans = 0;\n     tmp.x = x, tmp.y = y;\n     for (p = 1, q = n; p < q;) {\n       mid = ((p + q) >> 1);\n       if (lef(tmp, bj[0][mid], L))\n         q = mid;\n       else\n         p = mid + 1;\n     }\n     a = p - 1;\n     for (p = 1, q = n; p < q;) {\n       mid = ((p + q) >> 1);\n       if (!lef(tmp, bj[1][mid], R))\n         p = mid + 1;\n       else\n         q = mid;\n     }\n     b = p;\n     printf('%.10f\n', ask(a) + ask(b) * (a != b) +\n                           max((double)0, sum[b - 1] - sum[a]) * (y - sy) / y);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #pragma warning(disable : 4996)\n const int MAX_N = 1000009;\n const long long mod = 998244353;\n long long modpow(long long a, long long b, long long m) {\n   long long p = 1, q = a;\n   for (int i = 0; i < 32; i++) {\n     if ((b / (1LL << i)) % 2 == 1) {\n       p *= q;\n       p %= m;\n     }\n     q *= q;\n     q %= m;\n   }\n   return p;\n }\n long long N, fact[MAX_N], factinv[MAX_N];\n void init() {\n   fact[0] = 1;\n   for (int i = 1; i <= 1000000; i++) fact[i] = (1LL * fact[i - 1] * i) % mod;\n   for (int i = 0; i <= 1000000; i++) factinv[i] = modpow(fact[i], mod - 2, mod);\n }\n long long ncr(long long n, long long r) {\n   if (r < 0 || n < r) return 0;\n   return (fact[n] * factinv[r] % mod) * factinv[n - r] % mod;\n }\n int main() {\n   cin >> N;\n   init();\n   long long V1 = modpow(modpow(3, N, mod), N, mod) -\n                  modpow((modpow(3, N, mod) - 3LL + mod), N, mod);\n   V1 += mod;\n   V1 *= 2LL;\n   V1 %= mod;\n   long long V2 = 0;\n   for (int i = 1; i <= N; i++) {\n     long long E1 = ncr(N, i);\n     long long E2 = modpow(3, N - i, mod);\n     long long E3 = (E2 + mod - 1) % mod;\n     E2 = modpow(E2, N, mod);\n     E3 = modpow(E3, N, mod);\n     if (i % 2 == 1) V2 += E1 * (E2 - E3 + mod);\n     if (i % 2 == 0) V2 -= E1 * (E2 - E3 + mod);\n     while (V2 < 0) V2 += mod * mod;\n     V2 %= mod;\n   }\n   V2 *= 3LL;\n   V2 %= mod;\n   cout << (V1 - V2 + mod) % mod << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long double pi = 4 * atan((long double)1);\n const long long mod = 1e9 + 7;\n const long long inf = 922337203685477;\n const long long nax = 1e5 + 5;\n long long n, p, m;\n long long d[nax], t[nax];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   cin >> n >> p >> m;\n   for (long long i = 1; i <= n; i++) {\n     cin >> d[i] >> t[i];\n   }\n   d[0] = 1;\n   d[n + 1] = m + 1;\n   long long cur = 0, ans = 0;\n   for (long long i = 1; i <= n + 1; i++) {\n     long long dif = 0;\n     if (cur > 0) {\n       dif = cur / p;\n     }\n     long long minus = d[i] - d[i - 1] - dif;\n     if (minus < 0) {\n       minus = 0;\n     }\n     ans += minus;\n     cur -= (d[i] - d[i - 1]) * p;\n     cur += t[i];\n   }\n   cout << ans << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 10;\n const int SIZ_TREE = 3e5 + 10;\n int n, m;\n struct Node {\n   int u, v;\n   Node(int U = 0, int V = 0) {\n     u = U, v = V;\n     if (u < v) swap(u, v);\n   }\n   bool operator<(const Node A) const {\n     if (u < A.u || (u == A.u && v < A.v)) return true;\n     return false;\n   }\n };\n vector<int> f[N], ans[2];\n vector<Node> edg;\n map<Node, bool> col;\n bool v[N], opr[N], flag1, flag2, add[N];\n int cnt_p, cnt_opr;\n void init() {\n   char s;\n   int x, y;\n   scanf('%d %d', &n, &m);\n   for (int i = 1; i <= m; i++) {\n     scanf('%d %d', &x, &y);\n     while ((s = getchar()) == ' ')\n       ;\n     f[y].push_back(x);\n     f[x].push_back(y);\n     edg.push_back(Node(x, y));\n     col[Node(x, y)] = (s == 'R' ? false : true);\n   }\n }\n bool dfs(int x) {\n   v[x] = true;\n   cnt_p++;\n   cnt_opr += opr[x];\n   for (int i = 0; i < f[x].size(); i++) {\n     int y = f[x][i];\n     if (v[y]) {\n       if ((col[Node(x, y)] ^ opr[x] ^ opr[y]) == true) return false;\n     } else {\n       opr[y] = col[Node(x, y)] ^ opr[x];\n       if (!dfs(y)) return false;\n     }\n   }\n   return true;\n }\n void add_ans(int x, bool s1, int s2) {\n   if (add[x]) return;\n   opr[x] ^= s1;\n   add[x] = true;\n   if (opr[x]) ans[s2].push_back(x);\n   for (int i = 0; i < f[x].size(); i++) add_ans(f[x][i], s1, s2);\n }\n bool solve(int sign) {\n   memset(opr, 0, sizeof(opr));\n   memset(v, 0, sizeof(v));\n   memset(add, 0, sizeof(add));\n   for (int i = 1; i <= n; i++)\n     if (!v[i]) {\n       cnt_opr = cnt_p = 0;\n       if (!dfs(i)) return false;\n       add_ans(i, (cnt_opr * 2 > cnt_p), sign);\n     }\n   return true;\n }\n void print(int s) {\n   printf('%d\n', ans[s].size());\n   for (int i = 0; i < ans[s].size(); i++) printf('%d ', ans[s][i]);\n   printf('\n');\n }\n void work() {\n   flag1 = solve(0);\n   for (int i = 0; i < edg.size(); i++) col[edg[i]] = (!col[edg[i]]);\n   flag2 = solve(1);\n   if (!flag1 && !flag2)\n     printf('-1\n');\n   else if (flag1 && !flag2)\n     print(0);\n   else if (!flag1 && flag2)\n     print(1);\n   else if (ans[0].size() < ans[1].size())\n     print(0);\n   else\n     print(1);\n }\n int main() {\n   init();\n   work();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MOD = 1e6 + 3;\n long long power(long long base, long long exp) {\n   long long ans = 1;\n   while (exp) {\n     if (exp & 1) ans = (ans * base) % MOD;\n     base = (base * base) % MOD;\n     exp >>= 1;\n   }\n   return ans;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   long long n, k;\n   cin >> n >> k;\n   if (n <= 63 && k > (1LL << n)) {\n     cout << 1 << ' ' << 1;\n     return 0;\n   }\n   long long v2 = 0;\n   int digits = __builtin_popcountll(k - 1);\n   v2 = k - 1 - digits;\n   long long ntmp = n % (MOD - 1);\n   if (ntmp < 0) ntmp += (MOD - 1);\n   long long ktmp = k % (MOD - 1);\n   if (ktmp < 0) ktmp += (MOD - 1);\n   long long v2tmp = v2 % (MOD - 1);\n   if (v2tmp < 0) v2tmp += (MOD - 1);\n   long long exponent = ntmp * (ktmp - 1) - v2tmp;\n   exponent %= (MOD - 1);\n   if (exponent < 0) exponent += MOD - 1;\n   long long denom = power(2, exponent);\n   long long numpart = 0;\n   if (k - 1 >= MOD) {\n     numpart = 0;\n   } else {\n     long long prod = 1;\n     long long ntmp2 = power(2, ntmp);\n     prod = power(2, v2tmp);\n     prod = power(prod, MOD - 2);\n     if (prod < 0) prod += MOD;\n     for (long long y = 1; y <= k - 1; y++) {\n       prod = (prod * (ntmp2 - y)) % MOD;\n     }\n     numpart = prod;\n   }\n   long long num = (denom - numpart) % MOD;\n   num %= MOD;\n   denom %= MOD;\n   if (num < 0) num += MOD;\n   if (denom < 0) denom += MOD;\n   cout << num << ' ' << denom;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<pair<long long, long long> > 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> t[2005];\n namespace Tree {\n int mn[8005], mx[8005], sum[8005], lzy[8005];\n inline void pushtag(int p, int l, int r, int val) {\n   mx[p] = mn[p] = lzy[p] = val;\n   sum[p] = 1ll * (ly[r + 1] - ly[l]) * val % mod;\n }\n inline void down(int p, int l, int mid, int r) {\n   pushtag(p << 1, l, mid, lzy[p]);\n   pushtag(p << 1 | 1, mid + 1, r, lzy[p]);\n   lzy[p] = -1;\n }\n void insert(int p, int id, int val, int l, int r) {\n   if (l == r)\n     return mx[p] = mn[p] = val,\n            sum[p] = 1ll * (ly[id + 1] - ly[id]) * val % mod, void();\n   const int mid = l + r >> 1;\n   if (id <= mid)\n     insert(p << 1, id, val, l, mid);\n   else\n     insert(p << 1 | 1, id, val, mid + 1, r);\n   mn[p] = min(mn[p << 1], mn[p << 1 | 1]);\n   mx[p] = max(mx[p << 1], mx[p << 1 | 1]);\n   sum[p] = (sum[p << 1] + sum[p << 1 | 1]) % mod;\n }\n void qmin(int p, int val, int l, int r, int L, int R) {\n   if (L >= l && R <= r) {\n     if (mx[p] <= val)\n       return;\n     else if (mn[p] >= val)\n       pushtag(p, L, R, val);\n     else {\n       const int mid = L + R >> 1;\n       if (~lzy[p]) down(p, L, mid, R);\n       qmin(p << 1, val, l, r, L, mid);\n       qmin(p << 1 | 1, val, l, r, mid + 1, R);\n       mn[p] = min(mn[p << 1], mn[p << 1 | 1]);\n       mx[p] = max(mx[p << 1], mx[p << 1 | 1]);\n       sum[p] = (sum[p << 1] + sum[p << 1 | 1]) % mod;\n     }\n     return;\n   }\n   const int mid = L + R >> 1;\n   if (~lzy[p]) down(p, L, mid, R);\n   if (l <= mid) qmin(p << 1, val, l, r, L, mid);\n   if (r > mid) qmin(p << 1 | 1, val, l, r, mid + 1, R);\n   mn[p] = min(mn[p << 1], mn[p << 1 | 1]);\n   mx[p] = max(mx[p << 1], mx[p << 1 | 1]);\n   sum[p] = (sum[p << 1] + sum[p << 1 | 1]) % mod;\n }\n }  // namespace Tree\n int main() {\n   scanf('%d%d%d', &n, &k, &l);\n   lx[++cx] = 0;\n   ly[++cy] = 0;\n   lx[++cx] = l + 1;\n   ly[++cy] = l + 1;\n   int ans = 0;\n   for (int i = 1; i <= n; ++i)\n     scanf('%d%d%d', &s[i].x, &s[i].y, &s[i].c), lx[++cx] = ++s[i].x,\n                                                 ly[++cy] = ++s[i].y;\n   sort(lx + 1, lx + cx + 1);\n   cx = unique(lx + 1, lx + cx + 1) - lx - 1;\n   sort(ly + 1, ly + cy + 1);\n   cy = unique(ly + 1, ly + cy + 1) - ly - 1;\n   for (int i = 1; i <= n; ++i)\n     s[i].x = lower_bound(lx + 1, lx + cx + 1, s[i].x) - lx,\n     s[i].y = lower_bound(ly + 1, ly + cy + 1, s[i].y) - ly, tmp[i] = s[i];\n   sort(s + 1, s + n + 1,\n        [](const node &a, const node &b) { return a.x < b.x; });\n   sort(tmp + 1, tmp + n + 1,\n        [](const node &a, const node &b) { return a.y < b.y; });\n   for (int u = 1; u < cx; ++u) {\n     memset(bk, 0, sizeof(bk));\n     memset(Tree::lzy, -1, sizeof(Tree::lzy));\n     for (int i = 1, j = 1, p = 1, cnt = 0; i < cy; ++i) {\n       while (j <= n && tmp[j].y <= i) {\n         if (tmp[j].x <= u)\n           ++j;\n         else {\n           if (!bk[tmp[j].c]) ++cnt;\n           ++bk[tmp[j++].c];\n         }\n       }\n       while (cnt == k) {\n         if (tmp[p].x <= u)\n           ++p;\n         else {\n           --bk[tmp[p].c];\n           if (!bk[tmp[p++].c]) --cnt;\n         }\n       }\n       Tree::insert(1, i, ly[tmp[p - 1].y], 1, cy - 1);\n     }\n     for (int i = 1; i <= k; ++i) t[i].clear();\n     for (int i = 1; i <= n; ++i)\n       if (s[i].x > u) t[s[i].c].insert(s[i].y);\n     for (int d = cx - 1, i = n; d > u; --d) {\n       (ans += 1ll * (lx[d + 1] - lx[d]) * (lx[u + 1] - lx[u]) % mod *\n               Tree::sum[1] % mod) %= mod;\n       while (i && s[i].x >= d) {\n         auto it = t[s[i].c].find(s[i].y);\n         int pre = it == t[s[i].c].begin() ? 0 : *prev(it);\n         int nxt = next(it) == t[s[i].c].end() ? cy : *next(it);\n         t[s[i].c].erase(it);\n         if (s[i].y < nxt) Tree::qmin(1, ly[pre], s[i].y, nxt - 1, 1, cy - 1);\n         --i;\n       }\n     }\n   }\n   return printf('%d\n', ans), 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T1, class T2>\n inline void upd1(T1& a, const T2& b) {\n   a = a < b ? a : b;\n }\n template <class T1, class T2>\n inline void upd2(T1& a, const T2& b) {\n   a = a > b ? a : b;\n }\n template <class T>\n inline bool equ(const T& a, const T& b) {\n   return !memcmp(&a, &b, sizeof a);\n }\n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n struct ano {\n   operator long long() {\n     long long x = 0, y = 0, c = getchar();\n     while (c < 48) y = c == 45, c = getchar();\n     while (c > 47) x = x * 10 + c - 48, c = getchar();\n     return y ? -x : x;\n   }\n } buf;\n const int p = 1e9 + 7;\n const int N = 1e6 + 5;\n int w[N], a[N], l[N], r[N];\n long long cal(long long a, long long n, long long d) {\n   return (a * n + n * (n - 1) / 2 % p * d) % p;\n }\n int main() {\n   int n = buf, m = buf;\n   for (int i = 1; i <= n; ++i) w[i] = buf;\n   w[n + 1] = 1 << 30;\n   int j = 0;\n   for (int i = 1; i <= n + 1; ++i) {\n     while (j > 0 && w[a[j]] <= w[i]) r[a[j--]] = i - 1;\n     l[i] = a[j] + 1;\n     a[++j] = i;\n   }\n   long long ans = 0;\n   for (int i = 1; i <= n; ++i) {\n     int a = i - l[i] + 1;\n     int b = r[i] - i + 1;\n     int c = (min(a, b) - 1) / (m - 1);\n     long long s = cal(m, c, m - 1);\n     int v = (c + 1) * (m - 1) + 1;\n     if (max(a, b) >= v) {\n       long long d = (max(a, b) - v) / (m - 1);\n       s += ((d + 1) * min(a, b)) % p;\n       v += (d + 1) * (m - 1);\n     }\n     v = a + b - v;\n     if (v >= 1) s += cal(v, (v - 1) / (m - 1) + 1, 1 + p - m);\n     ans += w[i] * s % p;\n   }\n   cout << ans % p << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 105, maxm = 5005;\n const double eps = 1e-9;\n int N, M, m, X[maxm], Y[maxm], Z[maxm];\n double f[maxn][maxn], p[maxn];\n int main() {\n   scanf('%d%d', &N, &M);\n   for (int i = 1; i <= M; i++) {\n     scanf('%d%d%d', &X[i], &Y[i], &Z[i]);\n     if (X[i] > 1 && X[i] < N) f[X[i]][X[i]]++, f[X[i]][Y[i]]--;\n     if (Y[i] > 1 && Y[i] < N) f[Y[i]][Y[i]]++, f[Y[i]][X[i]]--;\n   }\n   f[1][N + 1] = 1, f[1][1] = 1;\n   f[N][N + 1] = 0, f[N][N] = 1;\n   for (int i = 1; i <= N; i++) {\n     if (abs(f[i][i]) < eps)\n       for (int j = i + 1; j <= N; j++)\n         if (abs(f[j][i]) > eps) {\n           for (int k = i; k <= N + 1; k++) f[i][k] += f[j][k];\n           break;\n         }\n     for (int j = i + 1; j <= N; j++)\n       if (abs(f[j][i]) > eps) {\n         double r(f[j][i] / f[i][i]);\n         for (int k = i; k <= N + 1; k++) f[j][k] -= f[i][k] * r;\n       }\n   }\n   for (int i = N; i; i--)\n     if (abs(f[i][i]) > eps) {\n       p[i] = f[i][N + 1];\n       for (int j = i + 1; j <= N; j++) p[i] -= f[i][j] * p[j];\n       p[i] /= f[i][i];\n     }\n   double rate(1.0 / 0), ans(0);\n   for (int i = 1; i <= M; i++) rate = min(rate, Z[i] / abs(p[X[i]] - p[Y[i]]));\n   for (int i = 1; i <= M; i++) {\n     if (X[i] == 1) ans += p[1] - p[Y[i]];\n     if (Y[i] == 1) ans += p[1] - p[X[i]];\n   }\n   printf('%.7f\n', isfinite(rate) ? ans * rate : 0);\n   for (int i = 1; i <= M; i++)\n     printf('%.7f\n', isfinite(rate) ? (p[X[i]] - p[Y[i]]) * rate : 0);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int a1[4] = {1, -1, 0, 0}, a2[4] = {0, 0, 1, -1};\n struct ww {\n   int a, b;\n } g[1610 * 1610], h[1610 * 1610];\n int i, j, k, n, m, s, l, r;\n int a[1610][1610], f[1610][1610], d[1610][1610], F[1610][1610],\n     ans[1610 * 1610];\n inline void bfs(int x, int y) {\n   int i;\n   g[l = r = 1].a = x, g[1].b = y;\n   f[x][y] = 1;\n   for (; l <= r; l++) {\n     int X = g[l].a, Y = g[l].b;\n     for (i = 0; i <= 3; i++) {\n       int A = X + a1[i], B = Y + a2[i];\n       if (a[A][B] && !f[A][B]) {\n         f[A][B] = 1;\n         g[++r].a = A, g[r].b = B;\n       }\n     }\n   }\n }\n inline int cal(int x, int y) {\n   int l, r, i;\n   h[l = r = 1].a = x, h[1].b = y, d[x][y] = 0, F[x][y] = 1;\n   for (; l <= r; l++) {\n     int X = h[l].a, Y = h[l].b;\n     if (d[X][Y] == d[h[r].a][h[r].b] && l < r - 5) break;\n     for (i = 0; i <= 3; i++) {\n       int A = X + a1[i], B = Y + a2[i];\n       if (a[A][B] && !F[A][B]) {\n         F[A][B] = 1;\n         h[++r].a = A, h[r].b = B;\n         d[A][B] = d[X][Y] + 1;\n       }\n     }\n   }\n   int D = d[h[r].a][h[r].b];\n   if (D <= 10)\n     for (i = 1; i <= r; i++) F[h[i].a][h[i].b] = 0;\n   return D > 10;\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (i = 1; i <= n; i++)\n     for (j = 1; j <= m; j++) scanf('%d', &a[i][j]);\n   for (i = 1; i <= n; i++)\n     for (j = 1; j <= m; j++)\n       if (a[i][j] && !f[i][j]) {\n         bfs(i, j);\n         s = cal(i, j);\n         for (k = r; k > 1; k--) {\n           int A = g[k].a, B = g[k].b;\n           if (!F[A][B]) s += cal(A, B);\n         }\n         ans[++*ans] = s;\n       }\n   sort(ans + 1, ans + *ans + 1);\n   printf('%d\n', *ans);\n   for (i = 1; i <= *ans; i++) printf('%d ', ans[i]);\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n;\n   scanf('%d', &n);\n   int i = 1;\n   while ((i * (i + 1) / 2) <= n) {\n     if ((i * (i + 1) / 2) == n) {\n       printf('YES');\n       return 0;\n     }\n     i++;\n   }\n   printf('NO');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 123, inf = 1e9 + 123, mod = 1e9 + 7;\n const long long INF = 1e18;\n int n, a[N];\n int main() {\n   cin.tie(0);\n   cout.tie(0);\n   ios_base::sync_with_stdio(0);\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n   }\n   sort(a + 1, a + n + 1);\n   reverse(a + 1, a + n + 1);\n   int mn = inf;\n   for (int i = 1; i <= n; i++) {\n     if (a[i] + 1 < mn) {\n       a[i]++;\n       mn = a[i];\n     } else {\n       if (a[i] < mn) {\n         mn = a[i];\n       } else if (a[i] - 1 < mn && a[i] > 1) {\n         mn = a[i] - 1;\n         a[i]--;\n       }\n     }\n   }\n   set<int> st;\n   for (int i = 1; i <= n; i++) {\n     st.insert(a[i]);\n   }\n   cout << st.size();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n void rd(T &x) {\n   x = 0;\n   int f = 1;\n   char ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9')\n     x = (x << 3) + (x << 1) + ch - '0', ch = getchar();\n   x *= f;\n }\n const int maxn = 1e5 + 5;\n int n, m;\n int ans[maxn];\n struct node {\n   int x, op, id;\n   bool operator<(const node &b) const { return x == b.x ? id < b.id : x < b.x; }\n } p[maxn];\n struct segment_tree {\n   int op[maxn << 2], tag[maxn << 2];\n   void pushdown(int u) {\n     if (tag[u]) {\n       op[u << 1] = op[u << 1 | 1] = 1;\n       tag[u << 1] = tag[u << 1 | 1] = tag[u];\n       tag[u] = 0;\n     }\n     if (op[u] == -1) {\n       op[u << 1] *= -1;\n       op[u << 1 | 1] *= -1;\n       op[u] = 1;\n     }\n   }\n   void build(int u, int l, int r) {\n     op[u] = 1;\n     if (l == r) return (void)(op[u] = p[l].op);\n     int mid = l + r >> 1;\n     build(u << 1, l, mid);\n     build(u << 1 | 1, mid + 1, r);\n   }\n   void cover(int u, int l, int r, int ql, int qr, int v) {\n     if (ql <= l && r <= qr) return (void)(op[u] = 1, tag[u] = v);\n     int mid = l + r >> 1;\n     pushdown(u);\n     if (ql <= mid) cover(u << 1, l, mid, ql, qr, v);\n     if (qr > mid) cover(u << 1 | 1, mid + 1, r, ql, qr, v);\n   }\n   void change(int u, int l, int r, int ql, int qr) {\n     if (ql <= l && r <= qr) return (void)(op[u] *= -1);\n     int mid = l + r >> 1;\n     pushdown(u);\n     if (ql <= mid) change(u << 1, l, mid, ql, qr);\n     if (qr > mid) change(u << 1 | 1, mid + 1, r, ql, qr);\n   }\n   void query(int u, int l, int r) {\n     if (l == r) {\n       int res = tag[u] ? tag[u] * op[u] : op[u];\n       ans[p[l].id] = res * p[l].x;\n       return;\n     }\n     int mid = l + r >> 1;\n     pushdown(u);\n     query(u << 1, l, mid);\n     query(u << 1 | 1, mid + 1, r);\n   }\n } seg;\n int main() {\n   rd(n), rd(m);\n   for (int i = (1); i <= (n); ++i) {\n     int x;\n     rd(x);\n     p[i] = (node){abs(x), x > 0 ? 1 : -1, i};\n   }\n   sort(p + 1, p + n + 1);\n   seg.build(1, 1, n);\n   while (m--) {\n     char s[5];\n     int x;\n     scanf('%s', s);\n     rd(x);\n     if (s[0] == '<') {\n       if (x < 0) {\n         int pos = (lower_bound(p + 1, p + n + 1, (node){abs(x) + 1, 0, 0}) - p);\n         if (pos <= n) seg.cover(1, 1, n, pos, n, 1);\n       } else {\n         int pos = (lower_bound(p + 1, p + n + 1, (node){abs(x), 0, 0}) - p);\n         if (pos <= n) seg.cover(1, 1, n, pos, n, 1);\n         if (pos > 1) seg.change(1, 1, n, 1, pos - 1);\n       }\n     } else {\n       if (x > 0) {\n         int pos = (lower_bound(p + 1, p + n + 1, (node){abs(x) + 1, 0, 0}) - p);\n         if (pos <= n) seg.cover(1, 1, n, pos, n, -1);\n       } else {\n         int pos = (lower_bound(p + 1, p + n + 1, (node){abs(x), 0, 0}) - p);\n         if (pos <= n) seg.cover(1, 1, n, pos, n, -1);\n         if (pos > 1) seg.change(1, 1, n, 1, pos - 1);\n       }\n     }\n   }\n   seg.query(1, 1, n);\n   for (int i = (1); i <= (n); ++i) printf('%d ', ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int pic[610][610];\n int ABS(int x) {\n   if (x < 0) return -x;\n   return x;\n }\n int main(int argc, char const *argv[]) {\n   int q;\n   scanf('%d', &q);\n   for (int i = 0; i < q; i++) {\n     int n, m, pix = 0, sum1 = 0, sum2 = 0;\n     scanf('%d%d', &n, &m);\n     for (int k = 0; k < n; k++)\n       for (int j = 0; j < m; j++) {\n         scanf('%d', &pic[k][j]);\n       }\n     int dif = 0;\n     for (int j = 0; j < m; j++)\n       dif = dif + ABS(pic[n / 2][j] - pic[n / 2 - 1][j]);\n     if (dif < 6000)\n       printf('NO\n');\n     else\n       printf('YES\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 4e5 + 50;\n int n, m, a[N], b[N];\n vector<int> G[N];\n int in[N], out[N], tim, dep[N];\n int mn[20][N], lg[N], p[N], k;\n void dfs(int u, int f) {\n   dep[u] = dep[f] + 1;\n   in[u] = ++tim;\n   mn[0][p[u] = ++k] = u;\n   for (int v : G[u])\n     if (v != f) dfs(v, u), mn[0][++k] = u;\n   out[u] = tim;\n }\n int chk(int x, int y) { return dep[x] < dep[y] ? x : y; }\n int LCA(int x, int y) {\n   x = p[x], y = p[y];\n   if (x > y) swap(x, y);\n   int z = lg[y - x + 1];\n   return chk(mn[z][x], mn[z][y - (1 << z) + 1]);\n }\n int D(int x, int y) { return dep[x] + dep[y] - 2 * dep[LCA(x, y)]; }\n struct lll {\n   int x, y, o;\n   lll(int _x = 0, int _y = 0, int _o = 0) { x = _x, y = _y, o = _o; }\n   friend lll operator+(const lll &a, const lll &b) {\n     if (!a.o) return a;\n     if (!b.o) return b;\n     if (!a.x) return b;\n     if (!b.x) return a;\n     lll t = b;\n     int A = D(a.x, t.x), B = D(a.x, t.y), C = D(t.x, t.y);\n     if (A + B == C)\n       t = lll(t.x, t.y, 1);\n     else if (B + C == A)\n       t = lll(a.x, t.x, 1);\n     else if (A + C == B)\n       t = lll(a.x, t.y, 1);\n     else\n       return lll(0, 0, 0);\n     A = D(a.y, t.x), B = D(a.y, t.y), C = D(t.x, t.y);\n     if (A + B == C)\n       t = lll(t.x, t.y, 1);\n     else if (B + C == A)\n       t = lll(a.y, t.x, 1);\n     else if (A + C == B)\n       t = lll(a.y, t.y, 1);\n     else\n       return lll(0, 0, 0);\n     return t;\n   }\n };\n namespace SGT {\n const int N = ::N << 2;\n lll t[N];\n void up(int x) { t[x] = t[x << 1] + t[x << 1 | 1]; }\n void build(int x, int l, int r) {\n   if (l == r) return t[x] = lll(b[l], b[l], 1), void();\n   build(x << 1, l, ((l + r) >> 1)), build(x << 1 | 1, ((l + r) >> 1) + 1, r);\n   up(x);\n }\n void mdf(int x, int l, int r, int p, int v) {\n   if (l == r) return t[x] = lll(v, v, 1), void();\n   if (p <= ((l + r) >> 1))\n     mdf(x << 1, l, ((l + r) >> 1), p, v);\n   else\n     mdf(x << 1 | 1, ((l + r) >> 1) + 1, r, p, v);\n   up(x);\n }\n int ask(int x, int l, int r, lll z) {\n   if (l == r) {\n     lll y = z + t[x];\n     if (y.o) return l + 1;\n     return l;\n   }\n   lll y = z + t[x << 1];\n   if (!y.o) return ask(x << 1, l, ((l + r) >> 1), z);\n   return ask(x << 1 | 1, ((l + r) >> 1) + 1, r, y);\n }\n }  // namespace SGT\n int main() {\n   cin >> n;\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]), b[a[i]] = i;\n   for (int i = 2, x; i <= n; i++) scanf('%d', &x), G[x].push_back(i);\n   dfs(1, 0);\n   for (int i = 2; i <= k; i++) lg[i] = lg[i >> 1] + 1;\n   for (int i = 1; (1 << i) <= k; i++)\n     for (int j = 1; j + (1 << i) - 1 <= k; j++)\n       mn[i][j] = chk(mn[i - 1][j], mn[i - 1][j + (1 << i - 1)]);\n   SGT ::build(1, 0, n - 1);\n   cin >> m;\n   while (m--) {\n     int o, x, y;\n     scanf('%d', &o);\n     if (o == 1) {\n       scanf('%d%d', &x, &y);\n       swap(a[x], a[y]);\n       x = a[x], y = a[y];\n       swap(b[x], b[y]);\n       SGT ::mdf(1, 0, n - 1, x, b[x]);\n       SGT ::mdf(1, 0, n - 1, y, b[y]);\n     }\n     if (o == 2) cout << SGT ::ask(1, 0, n - 1, lll(0, 0, 1)) << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n, k;\n   cin >> n >> k;\n   char def = 'a';\n   int pos = 0;\n   string ans = '';\n   for (int i = 0; i < n; i++) {\n     ans += def + pos;\n     pos = (pos + 1) % k;\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mod = 1000000007LL;\n long long base = 10000007;\n long long large = 1000000000000000000LL;\n class UnionFind {\n  private:\n   vector<int> p, rank;\n \n  public:\n   UnionFind(int n) {\n     rank.assign(n, 0);\n     p.assign(n, 0);\n     for (int i = 0; i < n; i++) {\n       p[i] = i;\n     }\n   }\n   int findSet(int i) { return (p[i] == i) ? i : (p[i] = findSet(p[i])); }\n   bool isSameSet(int i, int j) { return findSet(i) == findSet(j); }\n   void unionSet(int i, int j) {\n     if (!isSameSet(i, j)) {\n       int x = findSet(i), y = findSet(j);\n       if (rank[x] > rank[y]) {\n         p[y] = x;\n       } else {\n         p[x] = y;\n         if (rank[x] == rank[y]) {\n           rank[y]++;\n         }\n       }\n     }\n   }\n };\n vector<vector<pair<int, int> > > adj;\n int n, m;\n vector<pair<pair<int, int>, int> > e;\n vector<int> dp;\n void dfs(int u, int pa, int val) {\n   dp[u] = val;\n   for (int j = 0; j < (int)adj[u].size(); j++) {\n     int v = adj[u][j].first;\n     int d = adj[u][j].second;\n     if (v != pa) {\n       dfs(v, u, val ^ d);\n     }\n   }\n }\n int main() {\n   cin >> n >> m;\n   UnionFind uf(n);\n   adj.assign(n, vector<pair<int, int> >());\n   for (int i = 0; i < m; i++) {\n     int x, y, z;\n     scanf('%d%d%d', &x, &y, &z);\n     x--;\n     y--;\n     if (uf.isSameSet(x, y)) {\n       e.push_back(pair<pair<int, int>, int>(pair<int, int>(x, y), z));\n     } else {\n       uf.unionSet(x, y);\n       adj[x].push_back(pair<int, int>(y, z));\n       adj[y].push_back(pair<int, int>(x, z));\n     }\n   }\n   dp.assign(n, 0);\n   dfs(0, -1, 0);\n   vector<int> mask;\n   for (int i = 0; i < (int)e.size(); i++) {\n     int x = e[i].first.first;\n     int y = e[i].first.second;\n     int z = e[i].second;\n     int lo = dp[x] ^ dp[y] ^ z;\n     mask.push_back(lo);\n   }\n   int cur = 0;\n   for (int l = 30; l >= 0; l--) {\n     int c = -1;\n     for (int i = cur; i < (int)mask.size(); i++) {\n       if (mask[i] & (1 << l)) {\n         c = i;\n         break;\n       }\n     }\n     if (c == -1) continue;\n     swap(mask[cur], mask[c]);\n     for (int i = cur + 1; i < (int)mask.size(); i++) {\n       if (mask[i] & (1 << l)) mask[i] ^= mask[cur];\n     }\n     cur++;\n   }\n   vector<int> basis;\n   for (int i = 0; i < cur; i++) {\n     basis.push_back(mask[i]);\n   }\n   int l = 30;\n   int dis = dp[n - 1];\n   for (int i = 0; i < (int)basis.size(); i++) {\n     while (((1 << l) & basis[i]) == 0) l--;\n     if ((1 << l) & dis) dis ^= basis[i];\n   }\n   cout << dis << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int input[100000];\n int output[100000];\n pair<pair<int, int>, int> queries[100000];\n int blockSize;\n bool mo_compare(pair<pair<int, int>, int>& x, pair<pair<int, int>, int>& y) {\n   int firstBlockIndex = x.first.first / blockSize;\n   int secondBlockIndex = y.first.first / blockSize;\n   if (firstBlockIndex == secondBlockIndex) {\n     return x.first.second < y.first.second;\n   }\n   return firstBlockIndex < secondBlockIndex;\n }\n void inline removeElement(unordered_map<int, int>& lookup, int val,\n                           int& result) {\n   unordered_map<int, int>::iterator itr = lookup.find(val);\n   if (itr != lookup.end()) {\n     if (itr->first == itr->second) {\n       result--;\n     }\n     itr->second--;\n     if (itr->first == itr->second) {\n       result++;\n     }\n   } else {\n     lookup[val]--;\n   }\n }\n void inline addElement(unordered_map<int, int>& lookup, int val, int& result) {\n   unordered_map<int, int>::iterator itr = lookup.find(val);\n   if (itr != lookup.end()) {\n     if (itr->first == itr->second) {\n       result--;\n     }\n     itr->second++;\n     if (itr->first == itr->second) {\n       result++;\n     }\n   } else {\n     lookup[val]++;\n     if (val == 1) {\n       result++;\n     }\n   }\n }\n int main() {\n   cin.tie(NULL);\n   int n, m;\n   cin >> n >> m;\n   blockSize = static_cast<int>(sqrt(n));\n   for (int i = 0; i < n; i++) {\n     cin >> input[i];\n   }\n   for (int i = 0; i < m; i++) {\n     pair<pair<int, int>, int>& query = queries[i];\n     cin >> query.first.first >> query.first.second;\n     query.first.first--;\n     query.first.second--;\n     query.second = i;\n   }\n   sort(queries, queries + m, mo_compare);\n   unordered_map<int, int> lookup;\n   int result = 0;\n   int prev_l = 0, prev_r = -1, left, right, index;\n   unordered_map<int, int>::iterator itr;\n   for (int i = 0; i < m; i++) {\n     left = queries[i].first.first;\n     right = queries[i].first.second;\n     index = queries[i].second;\n     while (left > prev_l) {\n       removeElement(lookup, input[prev_l], result);\n       prev_l++;\n     }\n     while (left < prev_l) {\n       prev_l--;\n       addElement(lookup, input[prev_l], result);\n     }\n     while (right < prev_r) {\n       removeElement(lookup, input[prev_r], result);\n       prev_r--;\n     }\n     while (right > prev_r) {\n       prev_r++;\n       addElement(lookup, input[prev_r], result);\n     }\n     output[index] = result;\n   }\n   for (int i = 0; i < m; i++) {\n     cout << output[i] << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int N, M, K;\n char a[1001], b[1001];\n int mem[1001][1001][11][2];\n int main() {\n   scanf('%d %d %d', &N, &M, &K);\n   scanf('%s %s', a, b);\n   memset(mem, 0, sizeof(mem));\n   int ans = 0;\n   for (int i = 1; i <= N; i++) {\n     for (int j = 1; j <= M; j++) {\n       for (int k = 1; k <= K; k++) {\n         if (a[i - 1] == b[j - 1]) {\n           mem[i][j][k][1] =\n               max(mem[i - 1][j - 1][k][1] + 1, mem[i - 1][j - 1][k - 1][0] + 1);\n           mem[i][j][k][0] =\n               max(mem[i][j][k][1],\n                   max(max(mem[i - 1][j][k][1], mem[i - 1][j][k][0]),\n                       max(mem[i][j - 1][k][1], mem[i][j - 1][k][0])));\n         } else {\n           mem[i][j][k][1] = 0;\n           mem[i][j][k][0] = max(max(mem[i - 1][j][k][1], mem[i - 1][j][k][0]),\n                                 max(mem[i][j - 1][k][1], mem[i][j - 1][k][0]));\n         }\n         if (k == K) {\n           ans = max(ans, max(mem[i][j][k][0], mem[i][j][k][1]));\n         }\n       }\n     }\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long k, n, m;\n int answ = 1;\n bool flag = 0;\n int main() {\n   cin >> n >> m;\n   k = 2;\n   for (int i = 2; i <= m; i++) k = (k * 2) % 1000000009;\n   if (k > n) {\n     for (int i = 1; i <= n; i++) answ = (answ * (k - i)) % 1000000009;\n     cout << answ;\n   } else\n     cout << 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double pi = acos(-1.0);\n long long int path[100001];\n long long int dist[100001];\n void shortest_path(vector<pair<long long int, long long int>> v[],\n                    long long int start) {\n   long long int i;\n   for (i = 0; i < 100001; i++) dist[i] = 1e18 + 1;\n   priority_queue<long long int> q;\n   q.push(start);\n   dist[start] = 0;\n   while (!q.empty()) {\n     long long int x = q.top();\n     q.pop();\n     for (i = 0; i < v[x].size(); i++) {\n       if (dist[v[x][i].first] > dist[x] + v[x][i].second) {\n         dist[v[x][i].first] = dist[x] + v[x][i].second;\n         path[v[x][i].first] = x;\n         q.push(v[x][i].first);\n       }\n     }\n   }\n }\n void solve() {\n   long long int ver, edge, i, x, y, w, start = 1;\n   cin >> ver >> edge;\n   vector<pair<long long int, long long int>> v[ver + 1];\n   vector<long long int> ans;\n   for (i = 0; i < edge; i++) {\n     cin >> x >> y >> w;\n     v[x].push_back(make_pair(y, w));\n     v[y].push_back(make_pair(x, w));\n   }\n   shortest_path(v, start);\n   if (dist[ver] == 1e18 + 1)\n     cout << '-1'\n          << '\n';\n   else {\n     cout << '1 ';\n     while (ver != 1) {\n       ans.push_back(ver);\n       ver = path[ver];\n     }\n     for (i = ans.size() - 1; i >= 0; i--) {\n       cout << ans[i] << ' ';\n     }\n     cout << '\n';\n   }\n }\n void fast() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n }\n int main() {\n   fast();\n   int t = 1;\n   while (t--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = int64_t;\n template <typename T, typename U>\n ostream& operator<<(ostream& _s, pair<T, U> _t) {\n   _s << '(' << _t.first << ',' << _t.second << ')';\n   return _s;\n }\n template <typename T, typename U>\n istream& operator>>(istream& _s, pair<T, U>& _t) {\n   _s >> _t.first >> _t.second;\n   return _s;\n }\n template <typename T>\n ostream& operator<<(ostream& _s, vector<T> _t) {\n   for (int i = 0; i < (int)(_t.size()); i++) _s << (i ? ' ' : '') << _t[i];\n   return _s;\n }\n template <typename T>\n istream& operator>>(istream& _s, vector<T>& _t) {\n   for (int i = 0; i < (int)(_t.size()); i++) _s >> _t[i];\n   return _s;\n }\n vector<int> val, comp, z, cont;\n int Time, ncomps;\n template <class G, class F>\n int dfs(int j, G& g, F f) {\n   int low = val[j] = ++Time, x;\n   z.push_back(j);\n   for (auto& e : g[j])\n     if (comp[e] < 0) low = min(low, val[e] ?: dfs(e, g, f));\n   if (low == val[j]) {\n     do {\n       x = z.back();\n       z.pop_back();\n       comp[x] = ncomps;\n       cont.push_back(x);\n     } while (x != j);\n     f(cont);\n     cont.clear();\n     ncomps++;\n   }\n   return val[j] = low;\n }\n template <class G, class F>\n void scc(G& g, F f) {\n   int n = g.size();\n   val.assign(n, 0);\n   comp.assign(n, -1);\n   Time = ncomps = 0;\n   for (int i = 0; i < (int)(n); i++)\n     if (comp[i] < 0) dfs(i, g, f);\n }\n void tassert(bool cond) {\n   if (!cond) {\n     while (1 < 2) {\n     }\n   }\n }\n void answer(int x) {\n   cout << '! ' << (x + 1) << endl;\n   cout << flush;\n   exit(0);\n }\n bool ask(int a, int b) {\n   cout << '? ' << (a + 1) << ' ' << (b + 1) << endl;\n   cout << flush;\n   int res;\n   cin >> res;\n   if (res == -1) {\n     exit(123);\n   }\n   return bool(res);\n }\n int main() {\n   int n, m;\n   cin >> n >> m;\n   vector<vector<int>> g(n);\n   for (int i = 0; i < (int)(m); i++) {\n     int x, y;\n     cin >> x >> y;\n     g[x - 1].push_back(y - 1);\n   }\n   vector<vector<int>> comps;\n   scc(g, [&](vector<int>& v) { comps.push_back(v); });\n   vector<unordered_set<int>> cg(ncomps);\n   for (int a = 0; a < (int)(n); a++) {\n     for (int b : g[a]) {\n       if (comp[a] != comp[b]) {\n         cg[comp[a]].insert(comp[b]);\n       }\n     }\n   }\n   vector<int> indeg(ncomps, 0);\n   for (int aa = 0; aa < (int)(ncomps); aa++) {\n     for (int bb : cg[aa]) {\n       indeg[bb]++;\n     }\n   }\n   unordered_set<int> heads;\n   for (int aa = 0; aa < (int)(ncomps); aa++) {\n     if (indeg[aa] == 0) {\n       heads.insert(aa);\n     }\n   }\n   int head = *heads.begin();\n   int cap = comps[head].back();\n   comps[head].pop_back();\n   auto update = [&](int aa) {\n     if (comps[aa].size() == 0) {\n       heads.erase(aa);\n       for (int bb : cg[aa]) {\n         tassert(comps[bb].size() > 0);\n         indeg[bb]--;\n         if (indeg[bb] == 0) {\n           heads.insert(bb);\n         }\n       }\n     }\n   };\n   while (true) {\n     assert(heads.size());\n     if (heads.size() == 1) {\n       answer(cap);\n     }\n     auto head2it = heads.begin();\n     if (head == (*head2it)) {\n       head2it++;\n     }\n     int head2 = *head2it;\n     tassert(!cg[head].count(head2));\n     int cap2 = comps[head2].back();\n     comps[head2].pop_back();\n     bool ok = ask(cap, cap2);\n     if (!ok) {\n       update(head);\n       head = head2;\n       cap = cap2;\n     } else {\n       update(head2);\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   unsigned long long n;\n   cin >> n;\n   vector<unsigned long long> a(n);\n   for (unsigned long long i = 0; i < n; i++) cin >> a[i];\n   unsigned long long total = 0;\n   for (unsigned long long i = 0; i < n; i++) total += a[i];\n   vector<unsigned long long> f;\n   unsigned long long zd = total;\n   for (unsigned long long i = 2; (i * i) <= zd; i++) {\n     if (zd % i == 0) {\n       f.push_back(i);\n       while (zd % i == 0) {\n         zd /= i;\n       }\n     }\n   }\n   if (zd != 1) f.push_back(zd);\n   if (total == 1) {\n     cout << -1 << '\n';\n     return 0;\n   }\n   unsigned long long is = 900000000000000000;\n   for (unsigned long long i = 0; i < f.size(); i++) {\n     unsigned long long x = f[i];\n     unsigned long long temp = 0;\n     vector<pair<unsigned long long, unsigned long long>> z;\n     unsigned long long tt = 0;\n     for (unsigned long long j = 0; j < n; j++) {\n       tt += a[j] % x;\n       z.push_back(make_pair(j, a[j] % x));\n       if (tt >= x) {\n         unsigned long long left = 0;\n         unsigned long long right = 0;\n         unsigned long long Sr = 0;\n         unsigned long long Sl = 0;\n         z[z.size() - 1].second -= (tt - x);\n         for (unsigned long long k = 0; k < z.size(); k++) {\n           right +=\n               (unsigned long long)z[k].first * (unsigned long long)z[k].second;\n         }\n         Sr = x;\n         unsigned long long ttt = 900000000000000000;\n         for (unsigned long long k = 0; k < z.size(); k++) {\n           unsigned long long t2 = 0;\n           right -= ((unsigned long long)z[k].first *\n                     (unsigned long long)z[k].second);\n           left += ((unsigned long long)z[k].first *\n                    (unsigned long long)z[k].second);\n           Sr -= z[k].second;\n           Sl += z[k].second;\n           t2 += (right - Sr * z[k].first) + (Sl * z[k].first - left);\n           ttt = min(ttt, t2);\n         }\n         temp += ttt;\n         z.clear();\n         tt %= x;\n         z.push_back(make_pair(j, tt));\n       }\n     }\n     is = min(is, temp);\n   }\n   cout << is << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, cnt[200005 * 5], E2[200005], f[200005 * 5];\n signed main() {\n   scanf('%d', &n);\n   int mx = 0;\n   for (int i = 1; i <= n; i++) {\n     int x;\n     scanf('%d', &x);\n     cnt[x]++;\n     mx = max(mx, x);\n   }\n   E2[0] = 1;\n   for (int i = 1; i < 200005; i++) E2[i] = E2[i - 1] * 2 % 1000000007;\n   for (int i = mx; i >= 2; i--) {\n     int tot = 0;\n     for (int j = i; j <= mx; j += i) tot += cnt[j];\n     f[i] = 1ll * tot * E2[tot - 1] % 1000000007;\n     for (int j = i + i; j <= mx; j += i)\n       f[i] = (f[i] - f[j] + 1000000007) % 1000000007;\n   }\n   int ans = 0;\n   for (int i = 2; i <= mx; i++)\n     ans = (ans + 1ll * f[i] * i % 1000000007) % 1000000007;\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n using ld = long double;\n using pii = pair<int, int>;\n constexpr int MAXN = 100005;\n int n;\n string type[MAXN], word[MAXN];\n bitset<30> to_bs(const string& s) {\n   bitset<30> res;\n   for (char c : s) {\n     res[c - 'a'] = true;\n   }\n   return res;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n;\n   bitset<30> all = to_bs('abcdefghijklmnopqrstuvwxyz');\n   int ans = 0;\n   for (int i = 0; i < n; ++i) {\n     cin >> type[i] >> word[i];\n     bitset<30> cur = to_bs(word[i]);\n     if (type[i][0] == '!') {\n       if (all.count() <= 1) {\n         ans += 1;\n       }\n       all = all & cur;\n     } else if (type[i][0] == '.') {\n       all = all & cur.flip();\n     } else {\n       if (all.count() == 1) ans += 1;\n       all.reset(word[i][0] - 'a');\n     }\n   }\n   cout << max(0, ans - 1) << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 10;\n bool lucky[10010];\n int n, m;\n int a[N];\n int t[N + N];\n void init() {\n   memset(lucky, false, sizeof(lucky));\n   lucky[0] = true;\n   for (int i = 1; i <= 10000; i++)\n     if (i % 10 == 4 || i % 10 == 7) lucky[i] = lucky[i / 10];\n }\n void update(int i, int v) {\n   if (!v) return;\n   i += n;\n   while (i >= 1) {\n     t[i] += v;\n     i >>= 1;\n   }\n }\n int query(int Left, int Right) {\n   int res = 0;\n   Left += n;\n   Right += n;\n   while (Left <= Right) {\n     if (Left % 2) res += t[Left];\n     if ((~Right) % 2) res += t[Right];\n     Left = (Left + 1) >> 1;\n     Right = (Right - 1) >> 1;\n   }\n   return res;\n }\n int main() {\n   init();\n   scanf('%d%d', &n, &m);\n   memset(t, 0, sizeof(t));\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &a[i]);\n     update(i, lucky[a[i]]);\n   }\n   char x[10];\n   int Left, Right, temp;\n   while (m--) {\n     scanf('%s', &x);\n     if (strcmp(x, 'count') == 0) {\n       scanf('%d%d', &Left, &Right);\n       Left--;\n       Right--;\n       printf('%d\n', query(Left, Right));\n     } else {\n       scanf('%d%d%d', &Left, &Right, &temp);\n       Left--;\n       Right--;\n       for (int i = Left; i <= Right; i++) {\n         a[i] += temp;\n         update(i, lucky[a[i]] - lucky[a[i] - temp]);\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double pi = acos(-1.0), eps = 1e-8;\n const int inf = ~0U >> 2;\n int mod = 1e9 + 7;\n int Pow(int x, long long t) {\n   int r = 1;\n   for (; t; t >>= 1, x = (long long)x * x % mod)\n     if (t & 1) r = (long long)r * x % mod;\n   return r;\n }\n const int N = 101010;\n int n, K;\n struct P {\n   long long x, y;\n   void in() { cin >> x >> y; }\n   P(long long _x = 0, long long _y = 0) { x = _x, y = _y; }\n   double dis() { return sqrt(x * x + y * y); }\n   long long operator^(const P& b) { return x * b.y - y * b.x; }\n   P operator-(const P& b) { return P(x - b.x, y - b.y); }\n } p[N << 1], q;\n long long mul(P& o, P& a, P& b) { return (a - o) ^ (b - o); }\n bool in(P q) {\n   double a = 0;\n   for (int i = 0; i < n; ++i) {\n     long long aera = mul(q, p[i], p[i + 1]);\n     double disa = (p[i] - q).dis(), disb = (p[i + 1] - q).dis(),\n            disc = (p[i] - p[i + 1]).dis();\n     double angle = acos(((disa) * (disa) + (disb) * (disb) - (disc) * (disc)) /\n                         2.0 / disa / disb);\n     if (aera > 0)\n       a += angle;\n     else\n       a -= angle;\n   }\n   return fabs(a) >= 1;\n }\n long long wk() {\n   q.in();\n   if (!in(q)) return 0;\n   long long ans = (long long)n * (n - 1) * (n - 2) / 6;\n   for (int i = 0, j = 1; i < n; ++i) {\n     while (mul(p[i], p[j], q) <= 0) ++j;\n     int del = (j + n - i) % n;\n     int rm = n - del;\n     ans -= (long long)rm * (rm - 1) / 2;\n   }\n   return ans;\n }\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; ++i) p[i].in(), p[i + n] = p[i];\n   cin >> K;\n   for (int i = 0; i < K; ++i) cout << wk() << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n  \n using namespace std;\n  \n bool palindrome(const string &s) {\n     int n = s.length();\n     for(int i = 0; i < n; i++) {\n         if(s[i] != s[n - i - 1]) return false;\n     }\n     return true;\n }\n  \n int main() {\n     ios::sync_with_stdio(false);\n     cin.tie(0);\n     int te;\n     cin >> te;\n     while(te--) {\n         string s;\n         cin >> s;\n         if(!palindrome(s + 'a')) {\n             cout << 'YES\n' << s << 'a' << '\n';\n         }else if(!palindrome('a' + s)) {\n             cout << 'YES\n' << 'a' << s << '\n';\n         }else {\n             cout << 'NO\n';\n         }\n     }\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n const long double PI(acosl(-1.0));\n long double eps = 1e-9;\n using namespace std;\n using namespace std;\n const int N = 1000000;\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   vector<pair<int, int> > p(n);\n   int s = 0;\n   for (int i(0); i < n; i++) {\n     int x;\n     cin >> x;\n     s += x;\n     p[i] = {x, i + 1};\n   }\n   sort(++p.begin(), p.end());\n   reverse(++p.begin(), p.end());\n   vector<pair<int, int> > ans;\n   int j = 1;\n   int i = 0;\n   while (j < n) {\n     while (j < n && p[i].first > 0) {\n       ans.push_back({p[i].second, p[j].second});\n       p[i].first--;\n       j++;\n     }\n     i++;\n     if (i == j) break;\n   }\n   if (j < n) {\n     cout << -1;\n     return 0;\n   }\n   cout << ans.size() << endl;\n   for (int i(0); i < ans.size(); i++)\n     cout << ans[i].first << ' ' << ans[i].second << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n void CIN(T &a) {\n   cin >> a;\n }\n template <class T>\n void CIN(T &a, T &b) {\n   cin >> a >> b;\n }\n template <class T>\n void CIN(T &a, T &b, T &c) {\n   cin >> a >> b >> c;\n }\n template <class T>\n void CIN(T &a, T &b, T &c, T &d) {\n   cin >> a >> b >> c >> d;\n }\n template <class T>\n void PI(T a) {\n   cout << a << endl;\n }\n template <class T>\n void PI(T a, T b) {\n   cout << a << ' ' << b << endl;\n }\n template <class T>\n void PIS(T a) {\n   cout << a << ' ';\n }\n template <class T>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n \n typedef long long Int;\n typedef pair<int,int> PII;\n typedef vector<int> 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 <bits/stdc++.h>\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<Node> 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 <bits/stdc++.h>\n using namespace std;\n template <class T>\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 <class T>\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 <class T>\n ostream &operator<<(ostream &os, const vector<T> &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 <class T>\n ostream &operator<<(ostream &os, const set<T> &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 <class S, class T>\n ostream &operator<<(ostream &os, const pair<S, T> &t) {\n   return os << '(' << t.first << ',' << t.second << ')';\n }\n template <class S, class T>\n pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {\n   return pair<S, T>(s.first + t.first, s.second + t.second);\n }\n template <class S, class T>\n pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {\n   return pair<S, T>(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<long double> &p) {\n   return p.real() * p.real() + p.imag() * p.imag();\n }\n inline long double inp(const complex<long double> &a,\n                        const complex<long double> &b) {\n   return (conj(a) * b).real();\n }\n inline long double outp(const complex<long double> &a,\n                         const complex<long double> &b) {\n   return (conj(a) * b).imag();\n }\n inline complex<long double> unit(const complex<long double> &p) {\n   return p / abs(p);\n }\n inline complex<long double> proj(const complex<long double> &s,\n                                  const complex<long double> &t) {\n   return t * inp(s, t) / norm(t);\n }\n inline int ccw(const complex<long double> &s, const complex<long double> &t,\n                const complex<long double> &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<long double> &a, const complex<long double> &b) {\n   return sig(a.real() - b.real()) ? a.real() < b.real()\n                                   : a.imag() + EPS < b.imag();\n }\n bool operator==(const complex<long double> &a, const complex<long double> &b) {\n   return abs(a - b) < EPS;\n }\n istream &operator>>(istream &is, complex<long double> &p) {\n   long double x, y;\n   is >> x >> y;\n   p = complex<long double>(x, y);\n   return is;\n }\n }  // namespace std\n int n, m;\n complex<long double> p, q, v, w;\n long double vmax, ct;\n long double dist(complex<long double> v, complex<long double> 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<long double> s =\n       q + v * min<long double>(t, ct) + w * max<long double>(t - ct, 0);\n   complex<long double> vec = p - s;\n   return dist(vec, v, min<long double>(t, ct)) +\n              dist(vec, w, max<long double>(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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> 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<int> res;\n   res.clear();\n   for (i = 1; i <= n; i++) {\n     if (!have[i]) {\n       res.push_back(i);\n     } else {\n       if (is[i]) res.push_back(i);\n     }\n   }\n   int sz = res.size();\n   cout << sz << endl;\n   for (i = 0; i < sz; i++) cout << res[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n const long long inf = 2e18;\n struct custom_hash {\n   static uint64_t splitmix64(uint64_t x) {\n     x += 0x9e3779b97f4a7c15;\n     x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n     x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n     return x ^ (x >> 31);\n   }\n   size_t operator()(uint64_t x) const {\n     static const uint64_t FIXED_RANDOM =\n         chrono::steady_clock::now().time_since_epoch().count();\n     return splitmix64(x + FIXED_RANDOM);\n   }\n };\n int add(int a, int b) {\n   int res = (a + b) % mod;\n   if (res < 0) res += mod;\n   return res;\n }\n int mult(int a, int b) {\n   int res = (a * 1LL * b) % mod;\n   if (res < mod) res += mod;\n   return res;\n }\n int power(int a, int b) {\n   int res = 1;\n   while (b) {\n     if ((b % 2) == 1) res = mult(res, a);\n     a = mult(a, a);\n     b /= 2;\n   }\n   return res;\n }\n template <typename A, typename B>\n string to_string(pair<A, B> p);\n template <typename A, typename B, typename C>\n string to_string(tuple<A, B, C> p);\n template <typename A, typename B, typename C, typename D>\n string to_string(tuple<A, B, C, D> p);\n string to_string(const string &s) { return ''' + s + '''; }\n string to_string(const char *s) { return to_string((string)s); }\n string to_string(bool b) { return (b ? 'true' : 'false'); }\n string to_string(char c) { return to_string(string(1, c)); }\n string to_string(vector<bool> v) {\n   bool first = true;\n   string res = '{';\n   for (int i = 0; i < static_cast<int>(v.size()); i++) {\n     if (!first) {\n       res += ', ';\n     }\n     first = false;\n     res += to_string(v[i]);\n   }\n   res += '}';\n   return res;\n }\n template <size_t N>\n string to_string(bitset<N> v) {\n   string res = '';\n   for (size_t i = 0; i < N; i++) {\n     res += static_cast<char>('0' + v[i]);\n   }\n   return res;\n }\n template <typename A>\n string to_string(A v) {\n   bool first = true;\n   string res = '{';\n   for (const auto &x : v) {\n     if (!first) {\n       res += ', ';\n     }\n     first = false;\n     res += to_string(x);\n   }\n   res += '}';\n   return res;\n }\n template <typename A, typename B>\n string to_string(pair<A, B> p) {\n   return '(' + to_string(p.first) + ', ' + to_string(p.second) + ')';\n }\n template <typename A, typename B, typename C>\n string to_string(tuple<A, B, C> p) {\n   return '(' + to_string(get<0>(p)) + ', ' + to_string(get<1>(p)) + ', ' +\n          to_string(get<2>(p)) + ')';\n }\n template <typename A, typename B, typename C, typename D>\n string to_string(tuple<A, B, C, D> p) {\n   return '(' + to_string(get<0>(p)) + ', ' + to_string(get<1>(p)) + ', ' +\n          to_string(get<2>(p)) + ', ' + to_string(get<3>(p)) + ')';\n }\n void dbg() { cout << endl; }\n template <typename Head, typename... Tail>\n void dbg(Head H, Tail... T) {\n   cout << ' ' << to_string(H);\n   dbg(T...);\n }\n void solve() {\n   int n;\n   cin >> n;\n   vector<int> v(n);\n   for (int i = 0; i < n; i++) {\n     cin >> v[i];\n   }\n   vector<int> dp(1 << 22, 0);\n   for (int i = 0; i < n; i++) {\n     dp[v[i]] = v[i];\n   }\n   for (int mask = 1; mask < (1 << 22); mask++) {\n     for (int i = 0; i < 22; i++) {\n       if (mask & (1 << i)) {\n         dp[mask] = max(dp[mask], dp[mask ^ (1 << i)]);\n       }\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     int no = ((1 << 22) - 1) & (~v[i]);\n     if (dp[no]) {\n       cout << dp[no] << ' ';\n     } else {\n       cout << '-1 ';\n     }\n   }\n }\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   cout << fixed << setprecision(10);\n   int t = 1;\n   for (int i = 1; i <= t; i++) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n using namespace std;\n #define ll long long\n #define ld long double\n #define For(i,x,y) for(ll i = (x);i <= (y);++i)\n #define FOr(i,x,y) for(ll i = (x);i >= (y);--i)\n #define fi first\n #define se second\n #define pa pair<ll,ll>\n #define mk make_pair\n #define pb push_back\n #define clr(a,b) memset(a,b,sizeof(a))\n #define cpy(a,b) memcpy(a,b,sizeof(b))\n #define y1 y11111111111111111111\n #define debug puts('@@@@@@@@@@@@@@@@@@@@')\n #define NO puts('NO')\n #define YES puts('YES')\n #define Yes puts('Yes')\n #define No puts('No')\n inline ll read()\n {\n 	ll x = 0,f = 1;char ch = getchar();\n 	while(ch < '0' || ch > '9'){if(ch == '-')f = -1;ch = getchar();}\n 	while(ch >= '0' && ch <= '9'){x = x*10+ch-'0';ch = getchar();}\n 	return x*f;\n }\n char s[999];\n int main()\n {\n 	while (scanf('%s',s)!=EOF)\n 	{\n 		if (s[1]=='s') puts('NO'),fflush(stdout);\n 	}\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n double s;\n vector<int> E[100005];\n int dist[100005], pa[100005];\n int dfs(int u, int p, int d) {\n   dist[u] = d;\n   int ans = u;\n   for (int v : E[u]) {\n     if (v == p) continue;\n     int tmp = dfs(v, u, d + 1);\n     pa[v] = u;\n     if (dist[ans] < dist[tmp]) ans = tmp;\n   }\n   return ans;\n }\n int main() {\n   scanf('%d%lf', &n, &s);\n   for (int i = 0; i < n - 1; i++) {\n     int u, v;\n     scanf('%d%d', &u, &v);\n     E[u].push_back(v);\n     E[v].push_back(u);\n   }\n   if (n == 2) {\n     printf('%.10lf\n', s);\n     return 0;\n   }\n   int l = 0;\n   for (int i = 1; i <= n; i++) {\n     if (E[i].size() == 1) l++;\n   }\n   printf('%.10lf\n', 2.0 * s / l);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long mk[100000];\n int main() {\n   long a, b, m, r0, r;\n   cin >> a >> b >> m >> r0;\n   for (long i = 0; i < m; i++) mk[i] = -1;\n   r = (a * r0 + b) % m;\n   mk[r] = 1;\n   long k = 1;\n   while (true) {\n     k++;\n     r = (a * r + b) % m;\n     if (mk[r] == -1)\n       mk[r] = k;\n     else {\n       cout << k - mk[r];\n       return 0;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, maxi = 2, ans = 2;\n int a[100005];\n vector<int> num;\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   if (n < 3) {\n     cout << n;\n     return 0;\n   }\n   for (int i = 2; i < n; i++) {\n     if (a[i] == a[i - 1] + a[i - 2]) {\n       ans++;\n       maxi = max(maxi, ans);\n     } else\n       ans = 2;\n   }\n   cout << maxi;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dx[] = {+1, -1, +0, +0};\n int dy[] = {+0, +0, +1, -1};\n int fx[] = {+0, +0, +1, -1, -1, +1, -1, +1};\n int fy[] = {-1, +1, +0, +0, +1, +1, -1, -1};\n int hr[] = {-2, -2, -1, +1, +2, +2, -1, +1};\n int hc[] = {+1, -1, +2, +2, -1, +1, -2, -2};\n const int MAXN = 1e5 + 9;\n int main() {\n   int i, j, k, l, m, n, tc, t, mx, ans, total = 0;\n   cin >> n >> m;\n   mx = -9999;\n   ans = -1;\n   for (int i = 0; i < (int)n; i++) {\n     cin >> k;\n     t = k / m;\n     if (k % m) t++;\n     if (t >= mx) {\n       mx = t;\n       ans = i + 1;\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 100010;\n const int mod = 1e9 + 7;\n long long dp[maxn] = {0, 1, 2, 3, 5, 8};\n int main() {\n   for (int i = 6; i < maxn; i++) dp[i] = (dp[i - 1] + dp[i - 2]) % mod;\n   int n, m;\n   cin >> n >> m;\n   cout << (2 * (dp[n] + dp[m] - 1)) % mod << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int Set(int N, int pos) { return N = N | (1 << pos); }\n int reset(int N, int pos) { return N = N & ~(1 << pos); }\n bool check(long long N, int pos) { return (bool)(N & (1LL << pos)); }\n int n, m, l, r;\n string s;\n char c1, c2;\n int main() {\n   cin >> n >> m;\n   cin >> s;\n   for (int i = 1; i <= m; i++) {\n     cin >> l >> r >> c1 >> c2;\n     l--, r--;\n     for (int j = l; j <= r; j++) {\n       if (s[j] == c1) s[j] = c2;\n     }\n   }\n   cout << s << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s;\n   cin >> s;\n   set<string> g;\n   g.insert(s);\n   int n = s.size();\n   for (int k = 0; k < s.size(); k++) {\n     string s1 = '';\n     s1 += s[n - 1];\n     for (int i = 0; i < s.size() - 1; i++) {\n       s1 += s[i];\n     }\n     s = s1;\n     g.insert(s);\n   }\n   cout << g.size();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mod = 1000000007;\n vector<long long> parent(200005), Size(200005, 1);\n long long answer = 0;\n long long find_set(long long n) {\n   if (parent[n] == n)\n     return n;\n   else\n     return find_set(parent[n]);\n }\n void add_edge(long long a, long long b) {\n   long long A = find_set(a);\n   long long B = find_set(b);\n   if (Size[A] >= Size[B]) {\n     answer -= ((Size[A] * (Size[A] - 1)) / 2);\n     answer -= ((Size[B] * (Size[B] - 1)) / 2);\n     Size[A] += Size[B];\n     Size[B] = 0;\n     parent[B] = A;\n     answer += ((Size[A] * (Size[A] - 1)) / 2);\n   } else {\n     answer -= ((Size[B] * (Size[B] - 1)) / 2);\n     answer -= ((Size[A] * (Size[A] - 1)) / 2);\n     Size[B] += Size[A];\n     Size[A] = 0;\n     parent[A] = B;\n     answer += ((Size[B] * (Size[B] - 1)) / 2);\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long N, Q, p, q, r;\n   cin >> N >> Q;\n   if (N == 1) {\n     for (long long i = 1; i <= Q; i++) cout << '0 ';\n     return 0;\n   }\n   for (long long i = 1; i <= N; i++) parent[i] = i;\n   vector<pair<long long, pair<long long, long long>>> G;\n   for (long long i = 1; i < N; i++) {\n     cin >> p >> q >> r;\n     G.push_back({r, {p, q}});\n   }\n   sort(G.begin(), G.end());\n   vector<long long> final_ans(N + 1);\n   long long ptr = 0;\n   for (long long i = 1; i <= N;) {\n     if (G[ptr].first == i) {\n       add_edge(G[ptr].second.first, G[ptr].second.second);\n       ptr++;\n     } else {\n       final_ans[i] = answer;\n       i++;\n     }\n   }\n   while (Q--) {\n     long long k;\n     cin >> k;\n     cout << final_ans[k] << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   map<long long, long long> isolados;\n   long long n, k, i, j, prox, qtd, x, resp;\n   bool first = true;\n   while (cin >> n >> k) {\n     resp = 0;\n     isolados.clear();\n     prox = -1;\n     first = true;\n     for (i = 0; i < k; i++) {\n       cin >> qtd;\n       for (j = 0; j < qtd; j++) {\n         cin >> x;\n         if (x == 1) prox = 1;\n         if (x == prox && first == true) {\n           prox++;\n         } else if (j == 0) {\n           isolados[x] = 0;\n         } else {\n           isolados[x] = 1;\n         }\n       }\n       if (prox != -1) first = false;\n     }\n     for (prox; prox <= n; prox++) {\n       resp += isolados[prox] + 1;\n     }\n     cout << resp << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, sti[101], i, x, ans;\n   cin >> n;\n   memset(sti, 0, sizeof(sti));\n   for (i = 1; i <= n; i++) {\n     cin >> x;\n     sti[x]++;\n   }\n   ans = 0;\n   for (i = 1; i <= 100; i++) {\n     ans += 2 * (sti[i] / 4);\n     sti[i] %= 4;\n     ans += sti[i] / 2;\n   }\n   cout << ans / 2 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n double a[4010];\n int main() {\n   cin >> n;\n   n *= 2;\n   for (int i = 1; i <= n; ++i) cin >> a[i];\n   for (int i = 1; i <= n; ++i) a[i] = a[i] - int(a[i]);\n   int cnt = 0;\n   for (int i = 1; i <= n; ++i)\n     if (abs(a[i] - 0) <= 0.0000001) cnt++;\n   double sum = 0;\n   for (int i = 1; i <= n; ++i) sum += a[i];\n   double res = 1000000001;\n   for (int i = 0; i <= cnt; ++i) res = min(res, abs(n / 2 - sum - i));\n   printf('%.3f', res);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a[100005];\n   int n, i;\n   scanf('%d', &n);\n   for (i = 0; i < n; i++) {\n     scanf('%d', &a[i]);\n   }\n   sort(a, a + n);\n   if (a[n - 1] == 1) {\n     for (i = 0; i < n - 1; i++) {\n       printf('%d ', a[i]);\n     }\n     puts('2');\n   } else {\n     printf('1');\n     for (i = 0; i < n - 1; i++) {\n       printf(' %d', a[i]);\n     }\n     printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long solve(long long a, long long b, long long c) {\n   long long a1 = a - c;\n   a1 *= a1;\n   long long b1 = c - b;\n   b1 *= b1;\n   long long c1 = b - a;\n   c1 *= c1;\n   return a1 + b1 + c1;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int t;\n   t = 1;\n   cin >> t;\n   while (t--) {\n     long long a, b, c;\n     cin >> a >> b >> c;\n     vector<long long> arr(a, 0), arr1(b, 0), arr2(c, 0);\n     for (int i = 0; i < a; i++) {\n       cin >> arr[i];\n     }\n     for (int i = 0; i < b; i++) {\n       cin >> arr1[i];\n     }\n     for (int i = 0; i < c; i++) {\n       cin >> arr2[i];\n     }\n     sort((arr).begin(), (arr).end());\n     sort((arr1).begin(), (arr1).end());\n     sort((arr2).begin(), (arr2).end());\n     long long ans = 4 * (1e18);\n     vector<long long>::iterator it;\n     it = unique((arr).begin(), (arr).end());\n     arr.resize(distance(arr.begin(), it));\n     it = unique((arr1).begin(), (arr1).end());\n     arr1.resize(distance(arr1.begin(), it));\n     it = unique((arr2).begin(), (arr2).end());\n     arr2.resize(distance(arr2.begin(), it));\n     a = arr.size();\n     b = arr1.size();\n     c = arr2.size();\n     for (int i = 0; i < a; i++) {\n       long long in =\n           lower_bound((arr1).begin(), (arr1).end(), arr[i]) - arr1.begin();\n       vector<long long> a1;\n       vector<long long> b1;\n       if (in == b) {\n         a1.push_back(arr1[in - 1]);\n       } else {\n         a1.push_back(arr1[in]);\n         if (in < b - 1) {\n           a1.push_back(arr1[in + 1]);\n         }\n         if (in > 0) {\n           a1.push_back(arr1[in - 1]);\n         }\n       }\n       in = lower_bound((arr2).begin(), (arr2).end(), arr[i]) - arr2.begin();\n       if (in == c) {\n         b1.push_back(arr2[in - 1]);\n       } else {\n         b1.push_back(arr2[in]);\n         if (in < c - 1) {\n           b1.push_back(arr2[in + 1]);\n         }\n         if (in > 0) {\n           b1.push_back(arr2[in - 1]);\n         }\n       }\n       for (int j = 0; j < a1.size(); j++) {\n         for (int l = 0; l < b1.size(); l++) {\n           long long k = solve(arr[i], a1[j], b1[l]);\n           ans = min(k, ans);\n         }\n       }\n     }\n     for (int i = 0; i < b; i++) {\n       long long in =\n           lower_bound((arr).begin(), (arr).end(), arr1[i]) - arr.begin();\n       vector<long long> a1;\n       vector<long long> b1;\n       if (in == a) {\n         a1.push_back(arr[in - 1]);\n       } else {\n         a1.push_back(arr[in]);\n         if (in < a - 1) {\n           a1.push_back(arr[in + 1]);\n         }\n         if (in > 0) {\n           a1.push_back(arr[in - 1]);\n         }\n       }\n       in = lower_bound((arr2).begin(), (arr2).end(), arr1[i]) - arr2.begin();\n       if (in == c) {\n         b1.push_back(arr2[in - 1]);\n       } else {\n         b1.push_back(arr2[in]);\n         if (in < c - 1) {\n           b1.push_back(arr2[in + 1]);\n         }\n         if (in > 0) {\n           b1.push_back(arr2[in - 1]);\n         }\n       }\n       for (int j = 0; j < a1.size(); j++) {\n         for (int l = 0; l < b1.size(); l++) {\n           long long k = solve(arr1[i], a1[j], b1[l]);\n           ans = min(k, ans);\n         }\n       }\n     }\n     for (int i = 0; i < c; i++) {\n       long long in =\n           lower_bound((arr1).begin(), (arr1).end(), arr2[i]) - arr1.begin();\n       vector<long long> a1;\n       vector<long long> b1;\n       if (in == b) {\n         a1.push_back(arr1[in - 1]);\n       } else {\n         a1.push_back(arr1[in]);\n         if (in < b - 1) {\n           a1.push_back(arr1[in + 1]);\n         }\n         if (in > 0) {\n           a1.push_back(arr1[in - 1]);\n         }\n       }\n       in = lower_bound((arr).begin(), (arr).end(), arr2[i]) - arr.begin();\n       if (in == a) {\n         b1.push_back(arr[in - 1]);\n       } else {\n         b1.push_back(arr[in]);\n         if (in < a - 1) {\n           b1.push_back(arr[in + 1]);\n         }\n         if (in > 0) {\n           b1.push_back(arr[in - 1]);\n         }\n       }\n       for (int j = 0; j < a1.size(); j++) {\n         for (int l = 0; l < b1.size(); l++) {\n           long long k = solve(arr2[i], a1[j], b1[l]);\n           ans = min(k, ans);\n         }\n       }\n     }\n     cout << ans << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct group {\n   int sz;\n   vector<int> worst, best;\n   group(vector<int>& 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<group> positions;\n int main() {\n   int n, k;\n   scanf('%d %d', &n, &k);\n   while (n--) {\n     vector<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n pair<int, int> a[5003];\n vector<int> 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 <bits/stdc++.h>\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 <class A, class B>\n string tostring(pair<A, B> p) {\n   return '(' + tostring(p.first) + ',' + tostring(p.second) + ')';\n }\n template <class T>\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 <class A>\n string tostring(A *a, int L, int R) {\n   return tostring(vector<A>(a + L, a + R + 1));\n };\n template <class A>\n string tostring(A a, int L, int R) {\n   return tostring(a.data(), L, R);\n }\n string tostrings() { return ''; }\n template <typename Head, typename... Tail>\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 <class T>\n void ckmax(T &x, const T y) {\n   if (x < y) x = y;\n }\n template <class T>\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<op> res;\n int a[60];\n set<long long> 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<long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n const int maxn = 200005;\n vector<int> g[maxn];\n int dis[maxn];\n int pa[maxn];\n set<pair<int, int>> 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 <bits/stdc++.h>\n using namespace std;\n long long int newarr[1005];\n long long int dp[1005][1005];\n long long int n, k;\n long long int solution(long long int index, long long int m) {\n   if (m < 0) m += k;\n   if (index >= n && m != 0)\n     return 0;\n   else if (m == 0)\n     return 1;\n   else if (dp[index][m] != -1)\n     return dp[index][m];\n   else {\n     long long int x = solution(index + 1, m);\n     long long int y = solution(index + 1, m - newarr[index]);\n     if (x > 0) x = 1;\n     if (y > 0) y = 1;\n     if (m >= newarr[index]) {\n       dp[index + 1][m - newarr[index]] = y;\n     }\n     dp[index + 1][m] = x;\n     return x + y;\n   }\n }\n int32_t main() {\n   memset(dp, -1, sizeof(dp));\n   cin >> n;\n   cin >> k;\n   long long int arr[n];\n   long long int ctr = 0;\n   for (long long int i = 0; i < n; i++) {\n     cin >> arr[i];\n   }\n   if (n > k) {\n     cout << 'YES\n';\n   } else {\n     for (long long int i = 0; i < n; i++) {\n       newarr[i] = arr[i] % k;\n       if (newarr[i] == 0) ctr++;\n     }\n     long long int x = solution(0, k);\n     if (x > 0 || ctr > 0)\n       cout << 'YES\n';\n     else\n       cout << 'NO';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int bas = 23333;\n const long long mod = 9999999999973ll;\n int N, M, S[26], L[555];\n char C[255][255];\n long long H[26], W[255][255][255], G[555];\n int manacher(int n) {\n   int k = 0, m = 0, res = 0;\n   memset(L, 0, sizeof(L));\n   for (int i = 1; i <= n; i++) {\n     if (G[i] == -1) {\n       continue;\n     }\n     int l = (m > i) ? min(L[2 * k - i], m - i) : 1;\n     while (G[i - l] != -1 && G[i + l] != -1 && G[i - l] == G[i + l]) {\n       l++;\n     }\n     if (l + i > m) {\n       m = l + i;\n       k = i;\n     }\n     L[i] = l;\n     res += l;\n   }\n   return (res - N - 1) >> 1;\n }\n int main() {\n   scanf('%d%d\n', &N, &M);\n   long long h = 1;\n   for (int i = 0; i < 26; i++) {\n     h = h * bas % mod;\n     H[i] = h;\n   }\n   for (int i = 1; i <= N; i++) {\n     scanf('%s', C[i] + 1);\n     for (int j = 1; j <= M; j++) {\n       C[i][j] -= 'a';\n       W[i][j][j] = H[C[i][j]];\n       for (int k = j - 1; k > 0; k--) {\n         W[i][k][j] = W[i][k + 1][j] + H[C[i][k]];\n         if (W[i][k][j] >= mod) {\n           W[i][k][j] -= mod;\n         }\n       }\n       memset(S, 0, sizeof(S));\n       int cnt = 0;\n       for (int k = j; k > 0; k--) {\n         S[C[i][k]]++;\n         if (S[C[i][k]] & 1) {\n           cnt++;\n         } else {\n           cnt--;\n         }\n         if (cnt > 1) {\n           W[i][k][j] = -1;\n         }\n       }\n     }\n   }\n   long long ANS = 0;\n   for (int j = 1; j <= M; j++) {\n     for (int k = j; k <= M; k++) {\n       memset(G, 0, sizeof(G));\n       G[0] = -1;\n       G[(N + 1) << 1] = -1;\n       for (int i = 1; i <= N; i++) {\n         G[i << 1] = W[i][j][k];\n       }\n       ANS += manacher((N << 1) | 1);\n     }\n   }\n   printf('%lld', ANS);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n typedef long long lo;\n typedef vector<lo> vl;\n typedef vector<lo> vll;\n typedef vector<vl> vvl;\n template <typename T>\n ostream &operator<<(ostream &o, vector<T> v) {\n   if (v.size() > 0) o << v[0];\n   for (unsigned i = 1; i < v.size(); i++) o << ' ' << v[i];\n   return o << '\n';\n }\n template <typename U, typename V>\n ostream &operator<<(ostream &o, pair<U, V> p) {\n   return o << '(' << p.first << ', ' << p.second << ') ';\n }\n template <typename T>\n istream &operator>>(istream &in, vector<T> &v) {\n   for (unsigned i = 0; i < v.size(); i++) in >> v[i];\n   return in;\n }\n template <typename T>\n istream &operator>>(istream &in, pair<T, T> &p) {\n   in >> p.first;\n   in >> p.second;\n   return in;\n }\n string s;\n lo len[203][2];\n lo dp[203][203][203][2];\n lo cal(string &t) {\n   for (lo i = t.size(); i > 0; i--) {\n     if (s.substr(0, i) == t.substr(t.size() - i, i)) return i;\n   }\n   return 0;\n }\n void add(lo &a, lo b) {\n   a += b;\n   if (a >= 1000000007) a -= 1000000007;\n   if (a < 0) a += 1000000007;\n }\n int main() {\n   std::ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cout.precision(20);\n   lo n, ssz;\n   cin >> n >> s;\n   ssz = s.size();\n   if (s[0] == '(')\n     len[0][0] = 1;\n   else\n     len[0][1] = 1;\n   string pref;\n   for (lo i = (0); i < (lo)ssz; i++) {\n     pref += s[i];\n     pref += '(';\n     len[i + 1][0] = cal(pref);\n     pref.pop_back();\n     pref += ')';\n     len[i + 1][1] = cal(pref);\n     pref.pop_back();\n   }\n   dp[0][0][0][0] = 1;\n   for (lo i = (0); i < (lo)2 * n; i++) {\n     for (lo(j) = 0; (j) < (n + 1); (j)++) {\n       for (lo(pos) = 0; (pos) < (ssz + 1); (pos)++) {\n         for (lo(f) = 0; (f) < (2); (f)++) {\n           if (dp[i][j][pos][f] == 0) continue;\n           if (j + 1 <= n)\n             add(dp[i + 1][j + 1][len[pos][0]][f | (len[pos][0] == ssz)],\n                 dp[i][j][pos][f]);\n           if (j > 0)\n             add(dp[i + 1][j - 1][len[pos][1]][f | (len[pos][1] == ssz)],\n                 dp[i][j][pos][f]);\n         }\n       }\n     }\n   }\n   lo ans = 0;\n   for (lo i = (0); i < (lo)ssz + 1; i++) add(ans, dp[2 * n][0][i][1]);\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline void checkMax(T& a, const T& b) {\n   if (a < b) a = b;\n }\n template <typename T>\n inline void checkMin(T& a, const T& b) {\n   if (a > b) a = b;\n }\n const int kMod = 1000000007;\n template <typename U, typename V>\n inline void addMod(U& x, const V y) {\n   x += y;\n   if (x >= kMod) {\n     x -= kMod;\n   }\n }\n template <int N>\n struct CombinationTable {\n   CombinationTable() { init(); }\n   static long long table[N + 1][N + 1];\n   static void init() {\n     table[0][0] = 1;\n     for (int i = 1; i <= N; ++i) {\n       table[i][0] = table[i][i] = 1;\n       for (int j = 1; j < i; ++j) {\n         table[i][j] = table[i - 1][j] + table[i - 1][j - 1];\n       }\n     }\n   }\n };\n template <int N>\n long long CombinationTable<N>::table[N + 1][N + 1];\n CombinationTable<40> comb_tbl;\n long long n, t;\n void go() {\n   if ((t & -t) != t) {\n     puts('0');\n     return;\n   }\n   ++n;\n   int tt = 1;\n   while (t >>= 1) ++tt;\n   int num_one;\n   long long tmp = n;\n   do {\n     num_one += (tmp & 1);\n   } while (tmp >>= 1);\n   long long ans = (tt == num_one);\n   for (int n___LINE__ = (50), i = 0; i < n___LINE__; ++i) {\n     if (n & 1) {\n       --num_one;\n       if (num_one <= tt && i >= 0 && tt >= num_one && tt - num_one <= i) {\n         ans += comb_tbl.table[i][tt - num_one];\n       }\n     }\n     n >>= 1;\n   }\n   if (tt == 1) --ans;\n   cout << ans << endl;\n }\n int main() {\n   cin >> n >> t;\n   go();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[100069], f[100069], p10[10];\n int main() {\n   long long t, rr, k, i, p, z, pp, ppp, zzz;\n   p10[0] = 1;\n   for (i = 1; i < 10; i++) {\n     p10[i] = p10[i - 1] * 10;\n   }\n   for (i = 1; 1; i++) {\n     f[i] = f[i - 1];\n     for (k = i; k > 0; k /= 10) {\n       f[i]++;\n     }\n     a[i] = a[i - 1] + f[i];\n     if (a[i] > 1000000000) {\n       break;\n     }\n   }\n   scanf('%lld', &t);\n   for (rr = 0; rr < t; rr++) {\n     scanf('%lld', &k);\n     p = lower_bound(a, a + 21837, k) - a;\n     pp = k - a[p - 1];\n     for (i = 1; i <= 5; i++) {\n       if (pp <= 9 * p10[i - 1] * i) {\n         z = (pp - 1) / i + p10[i - 1];\n         ppp = i - (pp - 1) % i;\n         break;\n       }\n       pp -= 9 * p10[i - 1] * i;\n     }\n     for (; ppp > 1; ppp--, z /= 10)\n       ;\n     zzz = z % 10;\n     printf('%lld\n', zzz);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename S, typename T>\n ostream& operator<<(ostream& out, const pair<S, T> p) {\n   out << '(' << p.first << ',' << p.second << ')';\n   return out;\n }\n template <typename T>\n ostream& operator<<(ostream& out, const vector<T>& v) {\n   for (auto a : v) out << a << ' ';\n   return out;\n }\n template <typename T>\n ostream& operator<<(ostream& out, const set<T>& S) {\n   for (auto a : S) cout << a << ' ';\n   return out;\n }\n template <typename T>\n ostream& operator<<(ostream& out, const multiset<T>& S) {\n   for (auto a : S) cout << a << ' ';\n   return out;\n }\n template <typename S, typename T>\n ostream& operator<<(ostream& out, const map<S, T>& M) {\n   for (auto m : M) cout << '(' << m.first << '->' << m.second << ') ';\n   return out;\n }\n template <typename S, typename T>\n pair<S, T> operator+(pair<S, T> a, pair<S, T> b) {\n   return make_pair(a.first + b.first, a.second + b.second);\n }\n template <typename S, typename T>\n pair<S, T> operator-(pair<S, T> a, pair<S, T> b) {\n   return make_pair(a.first - b.first, a.second - b.second);\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   cout << n + n / 2 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n inline long long rd() {\n   long long _x = 0;\n   int _ch = getchar(), _f = 1;\n   for (; !isdigit(_ch) && (_ch != '-') && (_ch != EOF); _ch = getchar())\n     ;\n   if (_ch == '-') {\n     _f = 0;\n     _ch = getchar();\n   }\n   for (; isdigit(_ch); _ch = getchar()) _x = _x * 10 + _ch - '0';\n   return _f ? _x : -_x;\n }\n void write(long long _x) {\n   if (_x >= 10)\n     write(_x / 10), putchar(_x % 10 + '0');\n   else\n     putchar(_x + '0');\n }\n inline void wrt(long long _x, char _p) {\n   if (_x < 0) putchar('-'), _x = -_x;\n   write(_x);\n   if (_p) putchar(_p);\n }\n int n, m;\n char s[1005][1005];\n bool flag1, flag2;\n bool vis[1005][1005];\n void dfs(int x, int y) {\n   if (vis[x][y] || s[x][y] != '#' || x == 0 || y == 0 || x == n + 1 ||\n       y == m + 1)\n     return;\n   vis[x][y] = 1;\n   dfs(x + 1, y), dfs(x, y + 1);\n   dfs(x - 1, y), dfs(x, y - 1);\n }\n int main() {\n   n = rd(), m = rd();\n   for (int i = 1; i <= n; i++) {\n     scanf('%s', s[i] + 1);\n   }\n   for (int i = 1; i <= n; i++) {\n     bool tag = 0;\n     for (int j = 1; j <= m; j++) {\n       if (s[i][j] == '#') tag = 1;\n     }\n     flag1 |= !tag;\n   }\n   for (int i = 1; i <= m; i++) {\n     bool tag = 0;\n     for (int j = 1; j <= n; j++) {\n       if (s[j][i] == '#') tag = 1;\n     }\n     flag2 |= !tag;\n   }\n   if (((!flag1) && (flag2)) || ((flag1) && (!flag2))) {\n     printf('-1\n');\n     return 0;\n   }\n   bool flag = 0;\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= m; j++) {\n       if (s[i][j] == '#') {\n         int t = j;\n         while (s[i][t] == '#') t++;\n         for (int k = t; k <= m; k++)\n           if (s[i][k] == '#') flag = 1;\n       }\n     }\n   }\n   for (int i = 1; i <= m; i++) {\n     for (int j = 1; j <= n; j++) {\n       if (s[j][i] == '#') {\n         int t = j;\n         while (s[t][i] == '#') t++;\n         for (int k = t; k <= n; k++)\n           if (s[k][i] == '#') flag = 1;\n       }\n     }\n   }\n   if (flag) {\n     printf('-1\n');\n     return 0;\n   }\n   int cnt = 0;\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= m; j++)\n       if (s[i][j] == '#' && !vis[i][j]) {\n         dfs(i, j);\n         cnt++;\n       }\n   }\n   wrt(cnt, '\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n, l, r;\n   cin >> n >> l >> r;\n   long long int dp[n][3];\n   long long int a = r / 3 - (l - 1) / 3;\n   long long int b = (r + 2) / 3 - (l + 1) / 3;\n   long long int c = (r + 1) / 3 - l / 3;\n   dp[0][0] = r / 3 - (l - 1) / 3;\n   dp[0][1] = (r + 2) / 3 - (l + 1) / 3;\n   dp[0][2] = (r + 1) / 3 - l / 3;\n   for (int i = 1; i < n; i++) {\n     dp[i][0] =\n         (dp[i - 1][0] * a + dp[i - 1][1] * c + dp[i - 1][2] * b) % 1000000007;\n     dp[i][1] =\n         (dp[i - 1][0] * b + dp[i - 1][1] * a + dp[i - 1][2] * c) % 1000000007;\n     dp[i][2] =\n         (dp[i - 1][0] * c + dp[i - 1][1] * b + dp[i - 1][2] * a) % 1000000007;\n   }\n   cout << dp[n - 1][0];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t, n, a[1000], d;\n   cin >> t;\n   while (t--) {\n     cin >> n;\n     for (int i = 0; i < n; i++) {\n       cin >> a[i];\n     }\n     sort(a, a + n);\n     d = 0;\n     for (int i = 1; i < n; i++) {\n       if (a[i] - a[i - 1] <= 1) {\n         d++;\n       }\n     }\n     if (d)\n       cout << 2 << endl;\n     else\n       cout << 1 << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n int p[100];\n char mm[100];\n int main() {\n   while (scanf('%d', &n) != EOF) {\n     scanf('%s', &mm);\n     int len = strlen(mm);\n     m = 0;\n     for (int i = 0; i < len; ++i) m = m * 10 + (mm[i] - '0');\n     if (n == 0) {\n       if (strlen(mm) != 1)\n         puts('WRONG_ANSWER');\n       else if (m == 0)\n         puts('OK');\n       else\n         puts('WRONG_ANSWER');\n     } else {\n       if (mm[0] == '0') {\n         puts('WRONG_ANSWER');\n         return 0;\n       }\n       int x = n;\n       memset(p, 0, sizeof(p));\n       while (x > 0) {\n         p[x % 10]++;\n         x /= 10;\n       }\n       int now = 0;\n       for (int i = 1; i <= 9; ++i)\n         if (p[i]) {\n           now = i;\n           p[i]--;\n           break;\n         }\n       for (int i = 0; i <= 9; ++i) {\n         while (p[i]) {\n           now = now * 10 + i;\n           p[i]--;\n         }\n       }\n       if (now == m)\n         puts('OK');\n       else\n         puts('WRONG_ANSWER');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MX_N = 3e5 + 5;\n const int MX_M = 3e5 + 5;\n int N, M, D[MX_N];\n vector<pair<int, int>> al[MX_N];\n int vis[MX_N], sumD;\n vector<int> edges;\n void dfs(int u, int p = 0, int pe = 0) {\n   vis[u] = 1;\n   for (auto v : al[u])\n     if (!vis[v.first]) {\n       dfs(v.first, u, v.second);\n     }\n   if (D[u]) edges.push_back(pe), D[p] ^= 1;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> N >> M;\n   for (int i = (1); i <= (N); ++i) {\n     cin >> D[i];\n     if (D[i] >= 0) sumD += D[i];\n   }\n   for (int i = (1); i <= (M); ++i) {\n     int U, V;\n     cin >> U >> V;\n     al[U].emplace_back(V, i);\n     al[V].emplace_back(U, i);\n   }\n   for (int i = (1); i <= (N); ++i)\n     if (D[i] == -1) {\n       if (sumD & 1)\n         D[i] = 1, ++sumD;\n       else\n         D[i] = 0;\n     }\n   if (sumD & 1)\n     cout << -1;\n   else {\n     dfs(1);\n     cout << ((int)(edges).size()) << '\n';\n     sort(edges.begin(), edges.end());\n     for (int& e : edges) cout << e << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n long long RemoveZeros(long long a) {\n   long long temp;\n   long long x = 0;\n   long long i = 10;\n   while (a > 0) {\n     if (a % 10 != 0) {\n       temp = (a % 10) * i;\n       x += temp;\n       i *= 10;\n     }\n     a /= 10;\n   }\n   return x / 10;\n }\n using namespace std;\n int main() {\n   long long a, b, c;\n   cin >> a >> b;\n   c = a + b;\n   long long a1 = RemoveZeros(a);\n   long long b1 = RemoveZeros(b);\n   long long c1 = RemoveZeros(c);\n   if (a1 + b1 == c1)\n     cout << 'YES';\n   else\n     cout << 'NO';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using li = long long;\n using ld = long double;\n using pii = pair<int, int>;\n const int INF = 1e9 + 13;\n const int N = 2e5 + 13;\n const int M = 1e9 + 7;\n const int B = 600;\n const int A = 256;\n const ld e = 1e-8;\n const int LOGN = 20;\n mt19937 rnd(time(0));\n void solve() {\n   int n, m;\n   cin >> n >> m;\n   vector<bool> a(n, false);\n   for (int i = 0; i < m; i++) {\n     int x, y, z;\n     cin >> x >> y >> z;\n     y--;\n     a[y] = true;\n   }\n   int v = -1;\n   for (int i = 0; i < n; i++)\n     if (!a[i]) v = i;\n   for (int i = 0; i < n; i++) {\n     if (i != v) cout << v + 1 << ' ' << i + 1 << '\n';\n   }\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int t = 1;\n   cin >> t;\n   while (t--) solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize '03'\n using namespace std;\n const int N = 1e5 + 5;\n const int mod = 1e9 + 7;\n const int inf = 1e9 + 9;\n pair<int, int> ans[1004];\n signed main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   string s;\n   cin >> s;\n   int c1 = 0, c2 = 0;\n   for (int i = 0; i < s.length(); i++) {\n     if (s[i] == '0') {\n       if (c1 == 0) {\n         c1 = 1;\n         ans[i].first = 3, ans[i].second = 1;\n       } else {\n         c1 = 0;\n         ans[i].first = 1, ans[i].second = 1;\n       }\n     } else {\n       if (c2 == 0) {\n         c2 = 1;\n         ans[i].first = 1, ans[i].second = 3;\n       } else {\n         c2 = 0;\n         ans[i].first = 1, ans[i].second = 1;\n       }\n     }\n   }\n   for (int i = 0; i < s.length(); i++)\n     cout << ans[i].first << ' ' << ans[i].second << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int MAX_N = 1e5 + 5;\n int n, m;\n char str[MAX_N], nxt[256];\n bool chk[256], vis[256], not_root[256], flag;\n std::vector<char> ans;\n void dfs(char c) {\n   if (!vis[c]) {\n     vis[c] = true;\n     ans.push_back(c);\n     if (nxt[c]) dfs(nxt[c]);\n   } else\n     flag = true;\n }\n int main() {\n   scanf('%d', &n);\n   while (n--) {\n     scanf(' %s', str);\n     m = strlen(str);\n     for (int i = 0; i < m; ++i) chk[str[i]] = true;\n     for (int i = 0; i + 1 < m; ++i) {\n       if (nxt[str[i]] == 0)\n         nxt[str[i]] = str[i + 1];\n       else if (nxt[str[i]] != str[i + 1]) {\n         printf('NO\n');\n         return 0;\n       }\n       not_root[str[i + 1]] = true;\n     }\n   }\n   for (char i = 'a'; i <= 'z'; ++i)\n     if (!not_root[i] && chk[i]) dfs(i);\n   for (char i = 'a'; i <= 'z'; ++i) flag |= chk[i] != vis[i];\n   if (flag) {\n     printf('NO\n');\n     return 0;\n   }\n   for (char c : ans) printf('%c', c);\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6;\n int A[5];\n int main() {\n   ios_base::sync_with_stdio(0);\n   int a, b, n, T, cas = 0;\n   cin >> T;\n   while (T--) {\n     cin >> A[0] >> A[1] >> A[2];\n     int cnt = 0;\n     sort(A, A + 3, greater<int>());\n     for (int i = 0; i < 3; ++i) {\n       if (A[i]) A[i]--, cnt++;\n     }\n     if (A[0] && A[1]) A[0]--, A[1]--, cnt++;\n     if (A[0] && A[2]) A[0]--, A[2]--, cnt++;\n     if (A[1] && A[2]) A[1]--, A[2]--, cnt++;\n     if (A[0] && A[1] && A[2]) {\n       ++cnt;\n     }\n     cout << cnt << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct S {\n   int a, b;\n   S() {}\n   S(int _a, int _b) {\n     a = _a;\n     b = _b;\n   }\n   const bool operator<(const S &o) const { return a < o.a; }\n };\n string exm;\n inline void exf(void) {\n   cout << exm << '\n';\n   exit(0);\n }\n template <typename T>\n inline void showAll(vector<T> &v, string sep = '') {\n   for (T &here : v) cout << here << sep;\n }\n template <typename T>\n inline void showAll(T arr[], int st, int end, string sep = '') {\n   for (int i = st; i <= end; i++) cout << arr[i] << sep;\n }\n template <typename T>\n inline vector<int> int_seperation(T N, int d = 10) {\n   vector<int> v;\n   while (N) {\n     v.push_back(N % d);\n     N /= d;\n   }\n   reverse(v.begin(), v.end());\n   return v;\n }\n const int SIZE = 500009;\n char s[SIZE], t[SIZE];\n int main() {\n   int n, k;\n   scanf('%d %d', &n, &k);\n   scanf('%s %s', s + 1, t + 1);\n   long long INF = 1e18, ans = 0, diff = 0;\n   for (int i = 1; i <= n; i++) {\n     diff = 2 * diff + (t[i] - s[i]);\n     diff = min(diff, INF);\n     ans += min(diff + 1, (long long)k);\n   }\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void qmax(int &x, int y) {\n   if (x < y) x = y;\n }\n void qmin(int &x, int y) {\n   if (x > y) x = y;\n }\n inline long long read() {\n   char s;\n   long long k = 0, base = 1;\n   while ((s = getchar()) != '-' && s != EOF && !(isdigit(s)))\n     ;\n   if (s == EOF) exit(0);\n   if (s == '-') base = -1, s = getchar();\n   while (isdigit(s)) {\n     k = k * 10 + (s ^ '0');\n     s = getchar();\n   }\n   return k * base;\n }\n inline void write(int x) {\n   static char cnt, num[15];\n   cnt = 0;\n   if (!x) {\n     printf('0');\n     return;\n   }\n   for (; x; x /= 10) num[++cnt] = x % 10;\n   for (; cnt; putchar(num[cnt--] + 48))\n     ;\n }\n const int maxn = 2020;\n int n, k;\n char ch[maxn][maxn];\n int a[maxn][maxn], Max;\n char d[maxn + maxn];\n bool vis[maxn][maxn];\n int main() {\n   n = read();\n   k = read();\n   for (int i = 1; i <= n; i++) {\n     scanf('%s', ch[i] + 1);\n   }\n   if (k >= (2 * n - 1)) {\n     for (int i = 1; i <= n + n - 1; i++) putchar('a');\n     return 0;\n   }\n   memset(a, 0x3f3f, sizeof(a));\n   a[1][1] = 1;\n   if (ch[1][1] == 'a') a[1][1] = 0;\n   for (int l = 2; l <= n + n; l++) {\n     for (int i = 1, j; i <= n; i++) {\n       j = l - i;\n       if (j <= 0) break;\n       if (j > n) continue;\n       if (i > n) continue;\n       if (j + 1 <= n) qmin(a[i][j + 1], a[i][j] + (ch[i][j + 1] != 'a'));\n       if (i + 1 <= n) qmin(a[i + 1][j], a[i][j] + (ch[i + 1][j] != 'a'));\n       if (a[i][j] <= k) Max = max(Max, l);\n     }\n   }\n   if (Max == n + n) {\n     for (int i = 1; i <= n + n - 1; i++) putchar('a');\n     return 0;\n   }\n   bool flag = false;\n   if (!Max) Max = 2, vis[1][1] = true, d[2] = ch[1][1], flag = true;\n   for (int i = 1, j; i <= n; i++) {\n     j = Max - i;\n     if (j <= 0) break;\n     if (j > n) continue;\n     if (a[i][j] <= k) vis[i][j] = true;\n   }\n   for (int l = Max; l <= n + n; l++) {\n     char z = 'z';\n     for (int i = 1, j; i <= n; i++) {\n       j = l - i;\n       if (j <= 0) break;\n       if (j > n) continue;\n       if (!vis[i][j]) continue;\n       if (j + 1 <= n) z = min(z, ch[i][j + 1]);\n       if (i + 1 <= n) z = min(z, ch[i + 1][j]);\n     }\n     d[l + 1] = z;\n     for (int i = 1, j; i <= n; i++) {\n       j = l - i;\n       if (j <= 0) break;\n       if (j > n) continue;\n       if (!vis[i][j]) continue;\n       if (j + 1 <= n && ch[i][j + 1] == z) vis[i][j + 1] = true;\n       if (i + 1 <= n && ch[i + 1][j] == z) vis[i + 1][j] = true;\n     }\n   }\n   if (flag) Max--;\n   for (int i = 2; i <= Max; i++) d[i] = 'a';\n   for (int i = 2; i <= n + n; i++) {\n     putchar(d[i]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long read() {\n   long long a = 0;\n   char c = getchar();\n   while (c > '9' || c < '0') c = getchar();\n   while ('0' <= c && c <= '9') {\n     a = a * 10 + c - 48;\n     c = getchar();\n   }\n   return a;\n }\n struct data {\n   long long x, y, c;\n   data(long long X = 0, long long Y = 0, long long C = 0) {\n     x = X;\n     y = Y;\n     c = C;\n   }\n } w[2005], e[2005];\n long long n, k, L;\n bool cmp(data a, data b) { return a.x < b.x; };\n bool cmp2(data a, data b) { return a.y < b.y; }\n long long nxt[2005], f[2005];\n multiset<long long> Set[2005];\n long long sum[2005 << 2], Max[2005 << 2], tag[2005 << 2];\n void pushup(long long x) {\n   sum[x] = (sum[(x << 1)] + sum[(x << 1 | 1)]) % 1000000007;\n   assert(Max[(x << 1)] <= Max[(x << 1 | 1)]);\n   Max[x] = Max[(x << 1 | 1)];\n }\n void build(long long x, long long l, long long r) {\n   tag[x] = 0;\n   if (l == r) {\n     sum[x] = f[l] * (e[l].y - e[l - 1].y) % 1000000007;\n     Max[x] = f[l];\n     return;\n   }\n   build((x << 1), l, ((l + r) >> 1));\n   build((x << 1 | 1), ((l + r) >> 1) + 1, r);\n   pushup(x);\n }\n void ptag(long long x, long long l, long long r, long long v) {\n   assert(Max[x] <= v);\n   sum[x] = v * (e[r].y - e[l - 1].y) % 1000000007;\n   tag[x] = Max[x] = v;\n }\n void pushdown(long long x, long long l, long long r) {\n   if (tag[x]) {\n     ptag((x << 1), l, ((l + r) >> 1), tag[x]);\n     ptag((x << 1 | 1), ((l + r) >> 1) + 1, r, tag[x]);\n     tag[x] = 0;\n   }\n }\n void chkmax(long long x, long long l, long long r, long long b, long long e,\n             long long v) {\n   if (r < b || l > e) return;\n   if (l == r && Max[x] > v) return;\n   if (Max[x] <= v && b <= l && r <= e) {\n     ptag(x, l, r, v);\n     return;\n   }\n   bool flag = (v > Max[(x << 1)]);\n   pushdown(x, l, r);\n   chkmax((x << 1), l, ((l + r) >> 1), b, e, v);\n   if (flag) chkmax((x << 1 | 1), ((l + r) >> 1) + 1, r, b, e, v);\n   pushup(x);\n }\n signed main() {\n   n = read();\n   k = read();\n   L = read();\n   for (long long i = 1; i <= n; ++i) {\n     w[i].x = read() + 1;\n     w[i].y = read() + 1;\n     w[i].c = read();\n     e[i] = w[i];\n   }\n   sort(w + 1, w + 1 + n, cmp);\n   sort(e + 1, e + 1 + n, cmp2);\n   e[n + 1].y = L + 1;\n   w[n + 1].x = w[n + 2].x = L + 1;\n   w[n + 1].y = L + 1;\n   long long ans = 0;\n   for (long long i = n; i; --i) {\n     long long tmp = (w[i].x - w[i - 1].x);\n     if (!tmp) continue;\n     multiset<long long> S;\n     S.clear();\n     for (long long i = 1; i <= k; ++i) {\n       S.insert(L + 1), nxt[i] = L + 1;\n       Set[i].clear();\n       Set[i].insert(L + 1);\n       Set[i].insert(0);\n     }\n     for (long long j = n; j; --j) {\n       if (e[j].x >= w[i].x) {\n         S.erase(S.find(nxt[e[j].c]));\n         nxt[e[j].c] = e[j].y;\n         S.insert(nxt[e[j].c]);\n         Set[e[j].c].insert(e[j].y);\n       }\n       f[j] = (*(--S.end()));\n     }\n     build(1, 1, n);\n     for (long long j = n + 1; j > i; --j) {\n       if (w[j].c) {\n         assert(Set[w[j].c].find(w[j].y) != Set[w[j].c].end());\n         Set[w[j].c].erase(Set[w[j].c].find(w[j].y));\n         multiset<long long>::iterator it = --Set[w[j].c].upper_bound(w[j].y),\n                                       ir = it;\n         ++ir;\n         long long ll = lower_bound(e, e + 1 + n, data(0, *it, 0), cmp2) - e;\n         if (ll) assert(e[ll].y != e[ll - 1].y);\n         chkmax(1, 1, n, ll + 1, n, *ir);\n       }\n       long long res = ((L + 1) * e[n].y - sum[1] + 1000000007) % 1000000007;\n       ans =\n           (ans + (res * tmp % 1000000007 * (w[j].x - w[j - 1].x))) % 1000000007;\n     }\n   }\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n #pragma GCC target('sse4')\n using namespace std;\n using ii = pair<int, int>;\n using ll = long long;\n const int N = 1e5 + 5;\n const int mod = 1e9 + 7;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int a, b;\n   cin >> a >> b;\n   vector<int> ans1, ans2;\n   ll limit = 0;\n   for (; limit * (limit + 1) / 2 <= a + b; limit++)\n     ;\n   cerr << limit << '\n';\n   for (int i = --limit; i >= 1; i--) {\n     if (a >= b)\n       ans1.push_back(i), a -= i;\n     else\n       ans2.push_back(i), b -= i;\n   }\n   cout << ans1.size() << '\n';\n   for (auto x : ans1) cout << x << ' ';\n   cout << '\n';\n   cout << ans2.size() << '\n';\n   for (auto x : ans2) cout << x << ' ';\n   cout << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 10;\n int t;\n int n;\n struct node {\n   long long id, val;\n   bool flag;\n   friend bool operator<(node a, node b) {\n     if (a.val == b.val) return a.flag == false;\n     return a.val > b.val;\n   }\n };\n int main() {\n   while (~scanf('%d', &n)) {\n     priority_queue<node> q;\n     long long num;\n     scanf('%lld', &num);\n     node nxt;\n     nxt.id = 1, nxt.val = num, nxt.flag = false;\n     q.push(nxt);\n     long long ans = 0;\n     for (int i = 2; i <= n; ++i) {\n       scanf('%lld', &num);\n       nxt.flag = false;\n       if (q.top().val < num) {\n         node now = q.top();\n         q.pop();\n         ans = ans + num - now.val;\n         if (now.flag) {\n           now.flag = false;\n           q.push(now);\n         }\n         nxt.flag = true;\n       }\n       nxt.id = i;\n       nxt.val = num;\n       q.push(nxt);\n     }\n     printf('%lld\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7, inf = 1061109567;\n const long long infll = 4557430888798830399;\n const int N = 2e5 + 5;\n int n, q, a[N], cnt[N];\n bool last[N], first[N];\n vector<int> app[N];\n bool start[N];\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n >> q;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   for (int i = 0; i < n; i++) app[a[i]].push_back(i);\n   for (int i = 0; i < N; i++)\n     if (app[i].size()) {\n       first[app[i][0]] = 1;\n       last[app[i].back()] = 1;\n     }\n   int thing = 0;\n   memset(start, 0, sizeof start);\n   start[0] = 1;\n   for (int i = 0; i < n; i++) {\n     if (first[i]) thing++;\n     if (last[i]) thing--;\n     if (!thing) start[i + 1] = 1;\n   }\n   int ans = 0;\n   int cur = 0;\n   while (cur < n) {\n     int nxt = n - 1;\n     for (int i = cur + 1; i < n; i++)\n       if (start[i]) {\n         nxt = i - 1;\n         break;\n       }\n     int lolMax = 0;\n     for (int i = cur; i < nxt + 1; i++) {\n       cnt[a[i]]++;\n       lolMax = max(lolMax, cnt[a[i]]);\n     }\n     ans += lolMax;\n     for (int i = cur; i < nxt + 1; i++) cnt[a[i]]--;\n     cur = nxt + 1;\n   }\n   cout << n - ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int MAXN = (int)1e5 + 5;\n const int MODN = (int)1e9 + 7;\n int inf = 0x3f3f3f3f;\n using namespace std;\n char str[MAXN];\n int num[MAXN];\n int a[MAXN];\n int vis[MAXN];\n int main() {\n   int n, m;\n   while (scanf('%d', &n) != EOF) {\n     memset(vis, 0, sizeof(vis));\n     int sum = 0;\n     for (int i = 0; i < n; i++) {\n       scanf('%d', &a[i]);\n       sum += a[i];\n     }\n     int it = sum * 2 / n;\n     for (int i = 0; i < n; i++) {\n       if (vis[i] == 0) {\n         vis[i] = 1;\n         printf('%d ', i + 1);\n         for (int j = 0; j < n; j++) {\n           if (vis[j] == 0 && a[j] + a[i] == it) {\n             vis[j] = 1;\n             printf('%d\n', j + 1);\n             break;\n           }\n         }\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int cntinv(vector<int> &a) {\n   int n = a.size();\n   int ans = 0;\n   for (int i = 0; i < n; ++i) {\n     for (int j = i + 1; j < n; ++j) {\n       if (a[j] < a[i]) ans++;\n     }\n   }\n   return ans;\n }\n int main(int argc, char const *argv[]) {\n   int n;\n   scanf('%d', &n);\n   vector<int> a(n);\n   for (int i = 0; i < n; ++i) {\n     scanf('%d', &a[i]);\n   }\n   int pv = (cntinv(a) & 1);\n   int m;\n   scanf('%d', &m);\n   while (m--) {\n     int l, r, swaps;\n     scanf('%d', &l);\n     scanf('%d', &r);\n     l--;\n     r--;\n     swaps = (r - l + 1) >> 1;\n     int cur = pv;\n     if (swaps & 1) cur = 1 - cur;\n     if (cur)\n       printf('odd\n');\n     else\n       printf('even\n');\n     pv = cur;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int a[100010], d[100010];\n int main() {\n   int ans = 1, i, j;\n   int temp;\n   int dlen = 0, mx = 0;\n   while (~scanf('%d', &n)) {\n     for (i = 0; i != n; ++i) {\n       dlen = mx = 0;\n       scanf('%d', &temp);\n       for (j = 2; j * j <= temp; j++) {\n         if (temp % j == 0) {\n           d[dlen++] = j;\n           if (a[j] + 1 > mx) mx = a[j] + 1;\n           while (temp % j == 0) temp /= j;\n         }\n       }\n       if (temp > 1) {\n         d[dlen++] = temp;\n         if (a[temp] + 1 > mx) mx = a[temp] + 1;\n       }\n       for (j = 0; j != dlen; j++) a[d[j]] = mx;\n       if (ans < mx) ans = mx;\n     }\n     printf('%d\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct UF {\n   vector<int> par, sz;\n   UF(int n) {\n     sz.resize(n);\n     par.resize(n);\n     for (int i = 0; i < n; i++) sz[i] = 1, par[i] = i;\n   }\n   int find(int x) {\n     if (par[x] == x) return x;\n     return par[x] = find(par[x]);\n   }\n   void unite(int x, int y) {\n     x = find(x);\n     y = find(y);\n     if (x == y) return;\n     if (sz[x] > sz[y]) swap(x, y);\n     sz[y] += sz[x];\n     par[x] = y;\n   }\n   bool same(int x, int y) { return find(x) == find(y); }\n };\n int main() {\n   int i, j, n, m1, m2;\n   cin >> n >> m1 >> m2;\n   UF uf1(n), uf2(n);\n   for (i = 0; i < m1; i++) {\n     int a, b;\n     cin >> a >> b;\n     a--;\n     b--;\n     uf1.unite(a, b);\n   }\n   for (i = 0; i < m2; i++) {\n     int a, b;\n     cin >> a >> b;\n     a--;\n     b--;\n     uf2.unite(a, b);\n   }\n   vector<pair<int, int>> p;\n   for (i = 0; i < n; i++) {\n     for (j = 0; j < n; j++) {\n       if (!uf1.same(i, j)) p.push_back({i, j});\n     }\n   }\n   int ans = 0;\n   vector<pair<int, int>> ansv;\n   for (i = 0; i < p.size(); i++) {\n     int x = p[i].first, y = p[i].second;\n     if (!uf1.same(x, y) && !uf2.same(x, y)) {\n       uf1.unite(x, y);\n       uf2.unite(x, y);\n       ans++;\n       ansv.push_back({x, y});\n     }\n   }\n   cout << ans << endl;\n   for (auto p : ansv) cout << p.first + 1 << ' ' << p.second + 1 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = (int)1e6 + 100;\n const long long inf = (1ll << 60);\n const int mod2 = (int)998244353;\n const int mod = (int)1e9 + 7;\n int n, m;\n vector<long long> b;\n vector<long long> c;\n void add(long long x) {\n   for (int i = 0; i < b.size(); i++) {\n     if (c[i] & x) {\n       x ^= b[i];\n     }\n   }\n   if (x > 0) {\n     long long y = 1;\n     while (!(x & y)) y *= 2;\n     for (int i = 0; i < b.size(); i++) {\n       if (b[i] & y) {\n         b[i] ^= x;\n       }\n     }\n     b.push_back(x);\n     c.push_back(y);\n   }\n }\n long long d[maxn];\n int u[maxn];\n vector<pair<long long, long long> > g[maxn];\n vector<int> ord;\n void dfs(int v) {\n   u[v] = 1;\n   ord.push_back(v);\n   for (auto to : g[v]) {\n     if (u[to.first] == 0) {\n       d[to.first] = d[v] ^ to.second;\n       dfs(to.first);\n     } else if (u[to.first] == 1) {\n       add(d[v] ^ d[to.first] ^ to.second);\n     }\n   }\n   u[v] = 2;\n }\n void solve() {\n   cin >> n >> m;\n   for (int i = 0; i < m; i++) {\n     long long x, y, z;\n     cin >> x >> y >> z;\n     g[x].push_back({y, z});\n     g[y].push_back({x, z});\n   }\n   long long ans = 0;\n   for (int i = 1; i <= n; i++) {\n     if (u[i]) continue;\n     b.clear();\n     c.clear();\n     ord.clear();\n     dfs(i);\n     long long sz = ord.size();\n     long long C = sz * (sz - 1) / 2;\n     C %= mod;\n     for (int j = 1; j < b.size(); j++) C = (C * 2) % mod;\n     for (int j = 0; j <= 60; j++) {\n       int ok = 0;\n       long long cur = (1ll << j);\n       for (long long x : b) {\n         if (x & cur) {\n           ok = 1;\n         }\n       }\n       if (ok) {\n         ans = (ans + cur % mod * C % mod) % mod;\n       } else {\n         long long cnt = 0;\n         for (int v : ord) {\n           if (d[v] & cur) {\n             cnt++;\n           }\n         }\n         long long cur_ans = cnt * (sz - cnt) % mod;\n         cur_ans = (cur % mod * cur_ans) % mod;\n         for (int j = 0; j < b.size(); j++) {\n           cur_ans = (cur_ans * 2) % mod;\n         }\n         ans += cur_ans;\n         ans %= mod;\n       }\n     }\n   }\n   cout << ans << '\n';\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int t = 1;\n   for (int i = 1; i <= t; i++) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int read() {\n   int X = 0, w = 1;\n   char c = getchar();\n   while (c < '0' || c > '9') {\n     if (c == '-') w = -1;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') X = X * 10 + c - '0', c = getchar();\n   return X * w;\n }\n const int N = 1000 + 10;\n int n, m, a[N];\n double f[N][N];\n int main() {\n   n = read(), m = read();\n   for (register int i = 1; i <= n; ++i) a[i] = read();\n   for (register int i = 1; i <= n; ++i)\n     for (register int j = 1; j <= n; ++j) f[i][j] = (a[i] > a[j]);\n   while (m--) {\n     int x = read(), y = read();\n     for (register int i = 1; i <= n; ++i) {\n       f[x][i] = f[y][i] = (f[x][i] + f[y][i]) / 2;\n       f[i][x] = f[i][y] = 1 - f[x][i];\n     }\n     f[x][y] = f[y][x] = 0.5;\n   }\n   double ans = 0;\n   for (register int i = 1; i <= n; ++i)\n     for (register int j = i + 1; j <= n; ++j) ans += f[i][j];\n   printf('%.9lf\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char orz[500001];\n int gg[500001];\n int t;\n int main() {\n   cin >> t;\n   while (t--) {\n     int n, q;\n     scanf('%d%d', &n, &q);\n     scanf('%s', orz + 1);\n     int rrr = 1;\n     for (int i = 1; i <= n; i++) {\n       if (orz[i] == '+')\n         gg[i] = gg[i - 1] + 1 * rrr;\n       else\n         gg[i] = gg[i - 1] - 1 * rrr;\n       rrr *= -1;\n     }\n     while (q--) {\n       int l, r;\n       scanf('%d%d', &l, &r);\n       int eee = abs(gg[r] - gg[l - 1]);\n       if (eee != 0) {\n         if (eee % 2 == 1) eee = 1;\n         if (eee % 2 == 0) eee = 2;\n       }\n       cout << eee << endl << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct debugger {\n   template <typename T>\n   debugger& operator,(const T& v) {\n     cerr << v << ' ';\n     return *this;\n   }\n } dbg;\n void solve() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < 200; i++) cout << '9';\n   cout << endl;\n   for (int i = 0; i < 200; i++) cout << '9';\n   for (int i = 0; i < 199; i++) cout << '0';\n   cout << '1';\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   int t = 1, num = 1;\n   while (t--) {\n     ;\n     ;\n     solve();\n     ;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MOD = 1e9 + 7;\n vector<vector<long long>> mul(vector<vector<long long>> A,\n                               vector<vector<long long>> B) {\n   int n = A.size();\n   vector<vector<long long>> res(n, vector<long long>(n));\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       for (int k = 0; k < n; k++) {\n         res[i][j] = (res[i][j] + A[i][k] * B[k][j]) % MOD;\n       }\n     }\n   }\n   return res;\n }\n vector<vector<long long>> mexp(vector<vector<long long>> M, long long e) {\n   if (e == 1) return M;\n   if (e % 2) return mul(M, mexp(M, e - 1));\n   vector<vector<long long>> R = mexp(M, e / 2);\n   return mul(R, R);\n }\n int main() {\n   long long n, m;\n   cin >> n >> m;\n   if (m > n) {\n     cout << 1 << endl;\n     return 0;\n   }\n   vector<vector<long long>> M(m, vector<long long>(m));\n   M[0][0] = M[0][m - 1] = 1;\n   for (int i = 1; i < m; i++) M[i][i - 1] = 1;\n   vector<vector<long long>> R = mexp(M, n - m + 1);\n   long long res = 0;\n   for (int i = 0; i < m; i++) res = (res + R[0][i]) % MOD;\n   cout << res << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using vi = std::vector<long long int>;\n using vvi = std::vector<vi>;\n using pii = std::pair<long long int, long long int>;\n using vpii = std::vector<pii>;\n using vvpii = std::vector<vpii>;\n using namespace std;\n const long long int N = 2e6 + 10;\n const long long int inf = 1e18 + 10;\n const long double Pi = 3.14159265;\n long long int n;\n vi a;\n long long int f(vi &a) {\n   long long int n = a.size();\n   if (a.empty() == 1) return 0;\n   if (a.back() == 0) return a.size();\n   long long int hig = 0;\n   for (long long int i = 0; i <= n - 1; i++) {\n     hig = max(hig, (long long int)log2(a[i]));\n   }\n   vi l, r;\n   for (long long int i = 0; i <= n - 1; i++) {\n     if ((long long int)log2(a[i]) < hig)\n       l.emplace_back(a[i]);\n     else\n       r.emplace_back(a[i] ^ (1 << (long long int)log2(a[i])));\n   }\n   if (!(l.size() < r.size())) swap(l, r);\n   a = vi();\n   if (l.size() == 0) return f(r);\n   return 1 + max(f(l), f(r));\n }\n void solve() {\n   cin >> n;\n   a.resize(n);\n   for (long long int i = 1; i <= n; i++) cin >> a[i - 1];\n   sort(a.begin(), a.end());\n   cout << (a.size() - f(a));\n }\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   solve();\n   return 0;\n   long long int xx = 0;\n   long long int t;\n   cin >> t;\n   while (t--) {\n     ;\n     solve();\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[610000], i, j, k, l, n, m, p[610000], t, last, o, r, mid;\n char c[610000];\n bool check(int mid) {\n   int tmp = 1e9, res = 0;\n   p[0] = mid;\n   m = last;\n   for (i = 1; i <= n; ++i) {\n     p[i] = p[i - 1] + a[i];\n     if (p[i] == 0 && p[i - 1] == -1) m = max(m, i);\n   }\n   if (m == 0) return 1;\n   for (i = 1; i <= m; ++i) {\n     if (p[i - 1] == 0 && p[i] == -1) {\n       o = i;\n       tmp = min(tmp, res + (m - i) * 2);\n     }\n     if (p[i - 1] == -1 && p[i] == 0) {\n       if (i == m) tmp = min(tmp, res + m - o);\n       res += (i - o) * 2;\n     }\n     res++;\n   }\n   tmp = min(tmp, res - 1);\n   return tmp + 1 <= t;\n }\n int main() {\n   scanf('%d%d%s', &n, &t, c + 1);\n   for (i = 1; i <= n; ++i) a[i] = c[i] == 'H' ? -1 : c[i] == 'S' ? 1 : 0;\n   for (i = 1; i <= n; ++i) {\n     if (a[i] == -1) r++, last = i;\n     if (a[i] == 1) l--;\n   }\n   l += r;\n   if (l < 0) l = 0;\n   if (last > t) {\n     printf('-1\n');\n     exit(0);\n   }\n   while (l <= r) {\n     mid = (l + r) / 2;\n     if (check(mid))\n       r = mid - 1;\n     else\n       l = mid + 1;\n   }\n   printf('%d\n', r + 1);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int a[111111], b[111111];\n vector<int> 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 <bits/stdc++.h>\n using namespace std;\n const long long N = 1e5 + 5;\n vector<long long> 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<<ans<<endl;\n     }\n     return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int max_can;\n pair<int, int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n multiset<int> 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<int>::iterator it = ms.lower_bound(i);\n     if (it != ms.end()) ans = min(ans, abs(*(it)-i));\n     if (it != ms.begin()) ans = min(ans, abs(*(--it) - i));\n     cout << ans << endl;\n     ms.erase(ms.find(st[i + 1]));\n     int num = b[i + 1];\n     ms.insert((i + n + 1) - pos[num]);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC optimize('unroll-loops')\n using namespace std;\n const long long N = 1000 + 5, L = 12, inf = LLONG_MAX;\n long long n, m, k;\n long long a[N][N], par[N * N], sz[N * N], res[N][N], hh, cnt;\n bool mark[N][N], vis[N][N];\n long long mp[N * N];\n vector<pair<long long, long long> > vec, all;\n set<long long> s;\n long long H[] = {0, 0, -1, 1};\n long long G[] = {1, -1, 0, 0};\n inline void er(long long x) {\n   mp[x]--;\n   if (mp[x] == 0) {\n     s.erase(-x);\n   }\n   return;\n }\n inline void ad(long long x) {\n   mp[x]++;\n   if (mp[x] == 1) {\n     s.insert(-x);\n   }\n   return;\n }\n long long find(long long a) {\n   if (par[a] == a) return a;\n   return par[a] = find(par[a]);\n }\n inline void _union(long long a, long long b) {\n   a = find(a);\n   b = find(b);\n   if (a == b) return;\n   if (sz[a] < sz[b]) swap(a, b);\n   er(sz[a]);\n   er(sz[b]);\n   par[b] = a;\n   sz[a] += sz[b];\n   ad(sz[a]);\n   return;\n }\n void dfs(long long x, long long y) {\n   vis[x][y] = 1;\n   all.push_back({x, y});\n   for (long long k = 0; k < 4; k++) {\n     long long i = x + H[k], j = y + G[k];\n     if (i >= 0 && j >= 0 && i < n && j < m) {\n       if (!vis[i][j] && a[i][j] >= hh) {\n         dfs(i, j);\n       }\n     }\n   }\n   return;\n }\n int32_t main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   ;\n   cin >> n >> m >> k;\n   for (long long i = 0; i < n * m; i++) par[i] = i, sz[i] = 1;\n   s.insert(-1);\n   mp[1] = n * m;\n   for (long long i = 0; i < n; i++)\n     for (long long j = 0; j < m; j++) {\n       cin >> a[i][j];\n       vec.push_back({a[i][j], i * m + j});\n     }\n   sort(vec.begin(), vec.end(), greater<pair<long long, long long> >());\n   long long ans = -1, xx = -1, yy = -1;\n   for (auto p : vec) {\n     long long x = p.second / m, y = p.second % m, h = p.first;\n     mark[x][y] = 1;\n     for (long long k = 0; k < 4; k++) {\n       long long i = x + H[k], j = y + G[k];\n       if (i >= 0 && j >= 0 && i < n && j < m && mark[i][j]) {\n         _union(i * m + j, p.second);\n       }\n     }\n     if (k % h == 0) {\n       long long mx = sz[find(p.second)];\n       if (mx >= k / h) {\n         ans = mx;\n         hh = h;\n         xx = x;\n         yy = y;\n         break;\n       }\n     }\n   }\n   if (ans == -1) return cout << 'NO\n', 0;\n   dfs(xx, yy);\n   cout << 'YES\n';\n   long long sum = 0;\n   for (auto p : all) {\n     res[p.first][p.second] = hh;\n     sum += hh;\n     if (sum == k) break;\n   }\n   for (long long i = 0; i < n; i++) {\n     for (long long j = 0; j < m; j++) cout << res[i][j] << ' ';\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, m;\n long long dp[1501][1501];\n long long a[1510][1501];\n long long func(long long here, long long here1) {\n   if (here1 > m) return -999999999999999;\n   if (here1 < 1) return -999999999999999;\n   if (here == n + 1) return 0;\n   long long &ret = dp[here][here1];\n   if (ret != -1) return ret;\n   ret = -999999999999999;\n   if (here % 2) {\n     ret = max(ret, func(here, here1 + 1));\n     ret = max(ret, func(here + 1, here1 - 1) + a[here][here1]);\n   } else {\n     ret = max(ret, func(here, here1 - 1));\n     ret = max(ret, func(here + 1, here1 + 1) + a[here][here1]);\n   }\n   return ret;\n }\n int main() {\n   memset(dp, -1, sizeof(dp));\n   scanf('%lld %lld', &n, &m);\n   for (int i = 1; i <= n; i++) {\n     for (int y = 1; y <= m; y++) {\n       scanf('%lld', &a[i][y]);\n       a[i][y] += a[i][y - 1];\n     }\n   }\n   printf('%lld\n', func(1, 1));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, m, i, j, k, mod, dp[605][605], rd[605], xs[605][605], ans = 1;\n vector<long long> ts, bi[605], nrd, ncd;\n long long gcd(long long x, long long y) {\n   if (y == 0) return x;\n   return gcd(y, x % y);\n }\n long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }\n void dfs(int x) {\n   int i;\n   rd[x] = -1;\n   ts.push_back(x);\n   for (i = 0; i < bi[x].size(); i++) {\n     rd[bi[x][i]]--;\n     if (!rd[bi[x][i]]) {\n       dfs(bi[x][i]);\n     }\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n >> m >> mod;\n   for (i = 1; i <= m; i++) {\n     int x, y;\n     cin >> x >> y;\n     bi[x].push_back(y);\n     rd[y]++;\n   }\n   for (i = 1; i <= n; i++) {\n     if (rd[i] == 0) nrd.push_back(i);\n     if (bi[i].size() == 0) ncd.push_back(i);\n   }\n   for (i = 0; i < nrd.size(); i++) {\n     dfs(nrd[i]);\n     dp[nrd[i]][nrd[i]] = 1;\n   }\n   for (i = 0; i < ts.size(); i++) {\n     for (j = 0; j < ts.size(); j++) {\n       for (k = 0; k < bi[ts[j]].size(); k++) {\n         dp[ts[i]][bi[ts[j]][k]] += dp[ts[i]][ts[j]];\n         dp[ts[i]][bi[ts[j]][k]] %= mod;\n       }\n     }\n   }\n   for (i = 0; i < nrd.size(); i++) {\n     for (j = 0; j < ncd.size(); j++) {\n       xs[i][j] = dp[nrd[i]][ncd[j]];\n     }\n   }\n   long long cnt = 0;\n   for (i = 0; i < ncd.size(); i++) {\n     for (j = i + 1; j < nrd.size(); j++) {\n       while (xs[j][i]) {\n         long long t = -xs[i][i] / xs[j][i];\n         for (k = i; k < nrd.size(); k++) {\n           xs[i][k] += t * xs[j][k];\n           xs[i][k] %= mod;\n           xs[i][k] += mod;\n           xs[i][k] %= mod;\n         }\n         for (k = i; k < nrd.size(); k++) {\n           swap(xs[i][k], xs[j][k]);\n         }\n         cnt++;\n       }\n     }\n   }\n   if (cnt & 1) ans = mod - 1;\n   for (i = 0; i < nrd.size(); i++) {\n     ans *= xs[i][i];\n     ans %= mod;\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n signed main() {\n   string s;\n   cin >> s;\n   char zero = '0';\n   s = '00' + s;\n   long long n = (long long)s.size();\n   for (long long i = 0; i < n - 2; i++) {\n     long long temp = 100 * (s[i] - zero);\n     for (long long j = i + 1; j < n - 1; j++) {\n       temp += (10 * (s[j] - zero));\n       for (long long k = j + 1; k < n; k++) {\n         temp += (s[k] - zero);\n         if (temp % 8 == 0) {\n           cout << 'YES' << '\n';\n           cout << temp << '\n';\n           return 0;\n         }\n         temp -= (s[k] - zero);\n       }\n       temp -= (10 * (s[j] - zero));\n     }\n   }\n   cout << 'NO' << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int Q;\n   cin >> Q;\n   while (Q--) {\n     long long n, a, b, ans;\n     cin >> n >> a >> b;\n     double x = b / 2.0;\n     if (x > a) {\n       ans = a * n;\n       cout << ans << endl;\n     } else {\n       if (n % 2 == 0) {\n         ans = n / 2 * b;\n         cout << ans << endl;\n       } else {\n         ans = (n - 1) / 2 * b + a;\n         cout << ans << endl;\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename S, typename T>\n ostream& operator<<(ostream& out, pair<S, T> const& p) {\n   out << '(' << p.first << ', ' << p.second << ')';\n   return out;\n }\n template <typename T>\n ostream& operator<<(ostream& out, vector<T> const& v) {\n   int l = v.size();\n   for (int i = 0; i < l - 1; i++) out << v[i] << ' ';\n   if (l > 0) out << v[l - 1];\n   return out;\n }\n template <typename T>\n void trace(const char* name, T&& arg1) {\n   cout << name << ' : ' << arg1 << endl;\n }\n template <typename T, typename... Args>\n void trace(const char* names, T&& arg1, Args&&... args) {\n   const char* comma = strchr(names + 1, ',');\n   cout.write(names, comma - names) << ' : ' << arg1 << ' | ';\n   trace(comma + 1, args...);\n }\n const int N = 100100;\n int pt;\n bool cmp(const int& i, const int& j) {\n   if (i < pt and j < pt) {\n     return i < j;\n   } else if (i > pt and j > pt) {\n     return i < j;\n   } else {\n     return i > j;\n   }\n }\n vector<int> nxt[N];\n int a[N];\n int b[N];\n int lft[N];\n int rgt[N];\n pair<int, int> tosort[N];\n bool importance(const int& i, const int& j) { return tosort[i] < tosort[j]; }\n vector<int> face[N];\n vector<int> g[N];\n map<pair<int, int>, int> id;\n set<pair<int, int> > used;\n void buildFace(int from, int to, int f) {\n   face[f].push_back(to);\n   used.insert(make_pair(from, to));\n   pt = to;\n   vector<int>& v = nxt[to];\n   int nxt = *upper_bound(v.begin(), v.end(), from, cmp);\n   if (used.count(make_pair(to, nxt))) return;\n   buildFace(to, nxt, f);\n }\n int vis[N];\n int usd[N];\n int sz[N];\n int lvl[N];\n void dfs(int x, int h) {\n   sz[x] = 1;\n   vis[x] = h;\n   for (auto it = (g[x]).begin(); it != (g[x]).end(); ++it) {\n     if (usd[*it]) continue;\n     if (vis[*it] == h) continue;\n     dfs(*it, h);\n     sz[x] += sz[*it];\n   }\n }\n int findCentroid(int x, int n, int prev) {\n   for (auto it = (g[x]).begin(); it != (g[x]).end(); ++it) {\n     if (vis[*it] != vis[x] or *it == prev) continue;\n     if (sz[*it] > n / 2) return findCentroid(*it, n, x);\n   }\n   return x;\n }\n void decompose(int x, int h) {\n   dfs(x, h);\n   int c = findCentroid(x, sz[x], -1);\n   lvl[c] = h;\n   usd[c] = 1;\n   for (auto it = (g[c]).begin(); it != (g[c]).end(); ++it) {\n     if (!usd[*it]) decompose(*it, h + 1);\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int n, m;\n   cin >> n >> m;\n   if (m == 0) {\n     cout << 1 << endl;\n     return 0;\n   }\n   if (m == 1) {\n     cout << '1 2' << endl;\n     return 0;\n   }\n   nxt[1].push_back(n);\n   nxt[n].push_back(1);\n   for (int i = 2; i <= n; i++) {\n     nxt[i].push_back(i - 1);\n     nxt[i - 1].push_back(i);\n   }\n   for (int i = 0; i < m; i++) {\n     cin >> a[i] >> b[i];\n     if (a[i] < b[i]) swap(a[i], b[i]);\n     id[make_pair(a[i], b[i])] = id[make_pair(b[i], a[i])] = i;\n     nxt[a[i]].push_back(b[i]);\n     nxt[b[i]].push_back(a[i]);\n   }\n   for (int i = 1; i <= n; i++) {\n     pt = i;\n     sort(nxt[i].begin(), nxt[i].end(), cmp);\n   }\n   int cur = 0;\n   for (int i = 0; i < m; i++) {\n     if (!used.count(make_pair(a[i], b[i]))) {\n       face[++cur].push_back(a[i]);\n       buildFace(a[i], b[i], cur);\n       for (int j = 1; j < face[cur].size(); j++) {\n         int x = face[cur][j - 1], y = face[cur][j];\n         if (x - 1 != y and !(x == 1 and y == n)) {\n           int k = id[make_pair(x, y)];\n           if (x > y)\n             lft[k] = cur;\n           else\n             rgt[k] = cur;\n         }\n       }\n     }\n     if (!used.count(make_pair(b[i], a[i]))) {\n       face[++cur].push_back(b[i]);\n       buildFace(b[i], a[i], cur);\n       for (int j = 1; j < face[cur].size(); j++) {\n         int x = face[cur][j - 1], y = face[cur][j];\n         if (x - 1 != y and !(x == 1 and y == n)) {\n           int k = id[make_pair(x, y)];\n           if (x > y)\n             lft[k] = cur;\n           else\n             rgt[k] = cur;\n         }\n       }\n     }\n     int x = lft[i], y = rgt[i];\n     assert(x > 0 and y > 0);\n     g[x].push_back(y);\n     g[y].push_back(x);\n   }\n   for (int i = 1; i <= cur; i++) {\n     int mx = 0, smx = 0;\n     for (int j = 1; j < face[i].size(); j++) {\n       int x = face[i][j];\n       if (x > mx) {\n         smx = mx;\n         mx = x;\n       } else if (x > smx)\n         smx = x;\n     }\n     tosort[i] = make_pair(mx, smx);\n   }\n   vector<int> faces;\n   for (int i = 1; i <= cur; i++) faces.push_back(i);\n   sort(faces.begin(), faces.end(), importance);\n   decompose(1, 1);\n   for (int x : faces) {\n     cout << lvl[x] << ' ';\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, k, x, a, b, i, j, m[1000005], f[1000005];\n multiset<long long> s;\n pair<long long, long long> d[1000005];\n vector<long long> v;\n int main() {\n   ios::sync_with_stdio(0);\n   cin >> n >> k >> x;\n   while (i < n) {\n     cin >> m[i];\n     i++;\n   }\n   i = 0;\n   while (i < k) {\n     cin >> d[i].first;\n     d[i].second = i + 1;\n     i++;\n   }\n   i = 0;\n   sort(m, m + n);\n   sort(d, d + k);\n   s.insert(1000000001);\n   while (i < n) {\n     if (x * m[i] + x < i + 1)\n       return cout << -1, 0;\n     else\n       f[i] = x * m[i] + x - i - 1, s.insert(f[i]);\n     i++;\n   }\n   i = 0;\n   while (i < n + 1) {\n     while (j < k && a < *s.begin()) {\n       if (x * d[j].first + x >= i + a + 1) a++, v.push_back(d[j].second);\n       j++;\n     }\n     s.erase(s.lower_bound(f[i]));\n     i++;\n   }\n   i = 0;\n   cout << a << endl;\n   while (i < a) {\n     cout << v[i] << ' ';\n     i++;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int i, count = 0;\n   string str;\n   cin >> str;\n   int len = str.size();\n   for (i = 0; i < len; i++) {\n     if (str[i] == 'W' && str[i + 1] == 'U' && str[i + 2] == 'B') {\n       i += 2;\n       if (count > 0) cout << ' ';\n     } else {\n       cout << str[i];\n       count = 1;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long inf = 2e9;\n int32_t main() {\n   cin.tie(0)->sync_with_stdio(0);\n   long long n, m;\n   string s, t;\n   cin >> n >> m >> s >> t;\n   vector<long long> pi(m, 0), nxt(m, 0);\n   for (long long i = 1; i < m; i++) {\n     {\n       t[i] = char('0' + (t[i] - '0') ^ 1);\n       long long j = pi[i - 1];\n       while (j > 0 and t[i] != t[j]) {\n         j = pi[j - 1];\n       }\n       if (t[i] == t[j]) j++;\n       nxt[i] = j;\n       t[i] = char('0' + (t[i] - '0') ^ 1);\n     }\n     {\n       long long j = pi[i - 1];\n       while (j > 0 and t[i] != t[j]) {\n         j = pi[j - 1];\n       }\n       if (t[i] == t[j]) j++;\n       pi[i] = j;\n     }\n   }\n   s = '#' + s;\n   long long dp[n + 1][m][n - m + 2];\n   fill(**dp, **dp + sizeof dp / sizeof(long long), inf);\n   dp[0][0][0] = 0;\n   for (long long i = 0; i < n; i++) {\n     for (long long j = 0; j < m; j++) {\n       for (long long k = 0; k < n - m + 2; k++) {\n         if (dp[i][j][k] == inf) continue;\n         if (j == m - 1) {\n           dp[i + 1][pi.back()][k + 1] = min(dp[i + 1][pi.back()][k + 1],\n                                             dp[i][j][k] + (s[i + 1] != t[j]));\n         } else {\n           dp[i + 1][j + 1][k] =\n               min(dp[i + 1][j + 1][k], dp[i][j][k] + (s[i + 1] != t[j]));\n         }\n         dp[i + 1][nxt[j]][k] =\n             min(dp[i + 1][nxt[j]][k], dp[i][j][k] + (s[i + 1] == t[j]));\n       }\n     }\n   }\n   for (long long i = 0; i < n - m + 2; i++) {\n     long long mn = inf;\n     for (long long j = 0; j < m; j++) {\n       mn = min(mn, dp[n][j][i]);\n     }\n     if (mn == inf) mn = -1;\n     cout << mn << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     vector<pair<int, pair<int, int>>> v;\n     for (int i = 0; i < n; i++) {\n       int a, b;\n       cin >> a >> b;\n       v.push_back(make_pair(a, make_pair(b, i)));\n     }\n     sort(v.begin(), v.end());\n     int g[100001]{}, r = v[0].second.first;\n     g[v[0].second.second] = 1;\n     for (int i = 1; i < n; i++) {\n       if (v[i].first > r) break;\n       g[v[i].second.second] = 1;\n       r = max(r, v[i].second.first);\n     }\n     bool ans = true;\n     for (int i = 0; i < n && ans; i++) ans &= g[i];\n     if (ans) {\n       cout << -1 << '\n';\n       continue;\n     }\n     for (int i = 0; i < n; i++) cout << g[i] + 1 << ' ';\n     cout << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char A[300];\n int cnt[5];\n char data[5] = 'ACGT';\n int main() {\n   int n;\n   scanf('%d', &n);\n   scanf('%s', A);\n   for (int i = 0; A[i]; i++) {\n     if (A[i] == 'A')\n       cnt[0]++;\n     else if (A[i] == 'C')\n       cnt[1]++;\n     else if (A[i] == 'G')\n       cnt[2]++;\n     else if (A[i] == 'T')\n       cnt[3]++;\n     else\n       cnt[4]++;\n   }\n   int big = 0, dif = 0;\n   ;\n   for (int i = 0; i < 4; i++) big = max(big, cnt[i]);\n   for (int i = 0; i < 4; i++) {\n     cnt[i] = big - cnt[i];\n     dif += cnt[i];\n   }\n   if (dif > cnt[4]) {\n     printf('===');\n     return 0;\n   }\n   if ((cnt[4] - dif) % 4 != 0) {\n     printf('===');\n     return 0;\n   }\n   int flag = 0;\n   for (int i = 0; A[i]; i++) {\n     if (A[i] == '?') {\n       flag = 0;\n       for (int j = 0; j < 4; j++) {\n         if (cnt[j] > 0) {\n           A[i] = data[j];\n           cnt[j]--;\n           flag = 1;\n           break;\n         }\n       }\n       if (flag == 0) {\n         for (int j = 0; j < 4; j++) cnt[j]++;\n         i--;\n       }\n     }\n   }\n   printf('%s', A);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[2];\n string ans[2] = {'Vladik', 'Valera'};\n int main() {\n   cin >> a[0] >> a[1];\n   int turn = 0;\n   int sub = 1;\n   while (true) {\n     if (a[turn] - sub >= 0) {\n       a[turn] -= sub;\n     } else {\n       break;\n     }\n     sub++;\n     turn = 1 - turn;\n   }\n   cout << ans[turn] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, loc[250] = {}, isi[250] = {}, idx = 0;\n int kosong() {\n   for (int i = 0, _n = (n); i < _n; i++)\n     if (isi[i] == -1) return i;\n   return -111;\n }\n int main() {\n   memset(isi, -1, sizeof isi);\n   scanf('%d %d', &n, &m);\n   for (int i = 0, _n = (m); i < _n; i++) {\n     int a;\n     scanf('%d', &a);\n     for (int j = 0, _n = (a); j < _n; j++) {\n       int x;\n       scanf('%d', &x);\n       x--;\n       isi[x] = idx;\n       loc[idx] = x;\n       idx++;\n     }\n   }\n   vector<pair<int, int> > ans;\n   for (int i = 0, _n = (idx); i < _n; i++)\n     if (isi[i] != i) {\n       if (isi[i] == -1) {\n         ans.push_back(make_pair(loc[i], i));\n         isi[loc[i]] = -1;\n         loc[i] = i;\n         isi[i] = i;\n       } else {\n         int k = kosong();\n         ans.push_back(make_pair(i, k));\n         isi[k] = isi[i];\n         loc[isi[i]] = k;\n         isi[i] = -1;\n         i--;\n       }\n     }\n   printf('%d\n', ans.size());\n   for (int i = 0, _n = (ans.size()); i < _n; i++)\n     printf('%d %d\n', ans[i].first + 1, ans[i].second + 1);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n using namespace std;\n template <class T>\n void dbg(const char* xn, T x) {\n   if (0) cout << xn << ': ' << x << '\n';\n }\n template <class T, class... TA>\n void dbg(const char* xn, T x, TA... t) {\n   while (*xn != ',')\n     if (0) cout << *xn++;\n   if (0) cout << ': ' << x << ',';\n   dbg(xn + 1, t...);\n }\n template <class T>\n inline bool upd_max(T& x, T y) {\n   return y > x ? x = y, true : false;\n }\n template <class T>\n inline bool upd_min(T& x, T y) {\n   return y < x ? x = y, true : false;\n }\n const int N = 1000007;\n long long n, m1 = 0, m0 = 0, n1 = 0, n0 = 0;\n string A, B;\n void solve() {\n   cin >> n;\n   cin >> A;\n   A = '#' + A;\n   cin >> B;\n   B = '#' + B;\n   for (long long i = 1; i <= (n); ++i) {\n     if (A[i] == '1')\n       ++n1;\n     else if (A[i] == '0')\n       ++n0;\n     if (A[i] == '1' && B[i] == '0') ++m1;\n     if (A[i] == '0' && B[i] == '0') ++m0;\n   }\n   cout << m1 * n0 + m0 * n1 - m1 * m0;\n }\n int32_t main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout << fixed << setprecision(10);\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int sz = 5005;\n long long int x[sz];\n long long int a[sz];\n long long int b[sz];\n long long int c[sz];\n long long int d[sz];\n int n, s, e;\n const long long int Max = 1e16;\n long long int dp[sz][sz];\n long long int jumpl(int i) { return x[i] + c[i]; }\n long long int jumpr(int i) { return -x[i] + d[i]; }\n long long int landfr(int i) { return -x[i] + b[i]; }\n long long int landfl(int i) { return x[i] + a[i]; }\n long long int calc(int ch, int pl, int pr) {\n   if (pl < 0 || pr < 0) {\n     return Max;\n   }\n   if (dp[ch][pl] != 0) {\n     return dp[ch][pl];\n   }\n   if (ch == 0) {\n     if (s == 0) {\n       return calc(ch + 1, pl, pr + 1) + jumpr(ch);\n     } else if (e == 0) {\n       return calc(ch + 1, pl + 1, pr) + landfr(ch);\n     }\n     return calc(ch + 1, pl + 1, pr + 1) + landfr(ch) + jumpr(ch);\n   }\n   if (ch == n - 1) {\n     if (s == n - 1 && (pl == 1 && pr == 0)) {\n       return jumpl(ch);\n     } else if (e == n - 1 && (pl == 0 && pr == 1)) {\n       return landfl(ch);\n     } else if (pl == pr && pl == 1) {\n       return landfl(ch) + jumpl(ch);\n     } else {\n       return Max;\n     }\n   } else if (pl == 0 && pr == 0) {\n     return Max;\n   }\n   long long int m;\n   if (ch == s) {\n     m = min(calc(ch + 1, pl - 1, pr) + jumpl(ch),\n             calc(ch + 1, pl, pr + 1) + jumpr(ch));\n     dp[ch][pl] = m;\n     return m;\n   }\n   if (ch == e) {\n     m = min(calc(ch + 1, pl, pr - 1) + landfl(ch),\n             calc(ch + 1, pl + 1, pr) + landfr(ch));\n     dp[ch][pl] = m;\n     return m;\n   }\n   m = calc(ch + 1, pl + 1, pr + 1) + jumpr(ch) + landfr(ch);\n   m = min(m, calc(ch + 1, pl - 1, pr - 1) + jumpl(ch) + landfl(ch));\n   if (pr > 0) {\n     m = min(m, calc(ch + 1, pl, pr) + jumpr(ch) + landfl(ch));\n   }\n   if (pl > 0) {\n     m = min(m, calc(ch + 1, pl, pr) + jumpl(ch) + landfr(ch));\n   }\n   dp[ch][pl] = m;\n   return m;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> n >> s >> e;\n   --s, --e;\n   for (int i = 0; i < n; ++i) {\n     cin >> x[i];\n   }\n   for (int i = 0; i < n; ++i) {\n     cin >> a[i];\n   }\n   for (int i = 0; i < n; ++i) {\n     cin >> b[i];\n   }\n   for (int i = 0; i < n; ++i) {\n     cin >> c[i];\n   }\n   for (int i = 0; i < n; ++i) {\n     cin >> d[i];\n   }\n   cout << calc(0, 0, 0) << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 200005;\n int x[maxn], n, m;\n int main() {\n   int ans = 0, use = 0;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> m;\n     x[m] = 0;\n   }\n   for (int i = 1; i <= n; i++) {\n     cin >> m;\n     x[m] = i;\n   }\n   for (int i = 1; x[i] <= n && i <= n && x[i + 1] == x[i] + 1; i++) use = i + 1;\n   if (use && x[use] == n) {\n     m = 0;\n     for (int i = use + 1; i <= n; i++) m = max(m, x[i] - (i - use - 1));\n     if (!m) {\n       cout << n - use << '\n';\n       return 0;\n     }\n   }\n   if (x[1] && x[1] < n) {\n     for (int i = 2; i <= n; i++) x[i] = max(0, x[i] - x[1]);\n     ans += x[1];\n     x[1] = 0;\n   }\n   if (x[1] == n) {\n     m = 0;\n     for (int i = 2; i <= n; i++) m = max(m, x[i] - (i - 2));\n     if (m) {\n       cout << ans + 2 * n << '\n';\n       return 0;\n     } else {\n       cout << ans + n - 1 << '\n';\n       return 0;\n     }\n   }\n   m = 0;\n   for (int i = 2; i <= n; i++) m = max(m, x[i] - (i - 1));\n   cout << ans + m + n << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long long int mod = 1000000007;\n using namespace std;\n void toh_chaliye_shuru_karte_hain() {}\n void code_samapti_ki_ghoshna() {}\n long long int power(long long int a, long long int b, long long int modi) {\n   a %= modi;\n   long long int res = 1;\n   while (b) {\n     if (b % 2) {\n       res = (res * a) % modi;\n     }\n     b /= 2;\n     a = (a * a) % modi;\n   }\n   return res;\n }\n int main() {\n   toh_chaliye_shuru_karte_hain();\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int n, x1, y1, x2, y2;\n   cin >> n >> x1 >> y1 >> x2 >> y2;\n   if (x1 == 0 && x2 == 0 || x1 == n && x2 == n) {\n     cout << abs(y1 - y2) << '\n';\n   } else if (y1 == 0 && y2 == 0 || y1 == n && y2 == n) {\n     cout << abs(x1 - x2) << '\n';\n   } else {\n     int ans = 0;\n     ans += min(n - y1 + n - y2, y1 + y2);\n     ans += min(n - x1 + n - x2, x1 + x2);\n     cout << ans << '\n';\n   }\n   code_samapti_ki_ghoshna();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct segment_change {\n   static const int SENTINEL = numeric_limits<int>::min();\n   int to_set;\n   segment_change(int _to_set = SENTINEL) : to_set(_to_set) {}\n   bool has_set() const { return to_set != SENTINEL; }\n   void reset() { to_set = SENTINEL; }\n   bool has_change() const { return has_set(); }\n   segment_change combine(const segment_change &other) const {\n     return other.has_set() ? other : *this;\n   }\n };\n struct segment {\n   int first;\n   segment(int _first = -1) : first(_first) {}\n   void apply(int, const segment_change &change) {\n     if (change.has_set()) first = change.to_set;\n   }\n   void join(const segment &other) {\n     if (first < 0) first = other.first;\n   }\n   void join(const segment &a, const segment &b) {\n     *this = a;\n     join(b);\n   }\n };\n pair<int, int> right_half[32];\n struct seg_tree {\n   int tree_n = 0;\n   vector<segment> tree;\n   vector<segment_change> changes;\n   seg_tree(int n = -1) {\n     if (n >= 0) init(n);\n   }\n   void init(int n) {\n     tree_n = 1;\n     while (tree_n < n) tree_n *= 2;\n     tree.assign(2 * tree_n, segment());\n     changes.assign(tree_n, segment_change());\n   }\n   void build(const vector<segment> &initial) {\n     int n = initial.size();\n     init(n);\n     assert(n <= tree_n);\n     for (int i = 0; i < n; i++) tree[tree_n + i] = initial[i];\n     for (int position = tree_n - 1; position > 0; position--)\n       tree[position].join(tree[2 * position], tree[2 * position + 1]);\n   }\n   void push_down(int position, int length) {\n     if (!changes[position].has_change()) return;\n     if (2 * position < tree_n) {\n       changes[2 * position] = changes[2 * position].combine(changes[position]);\n       changes[2 * position + 1] =\n           changes[2 * position + 1].combine(changes[position]);\n     }\n     tree[2 * position].apply(length / 2, changes[position]);\n     tree[2 * position + 1].apply(length / 2, changes[position]);\n     changes[position].reset();\n   }\n   void push_all(int a, int b) {\n     assert(0 <= a && a < b && b <= tree_n);\n     a += tree_n;\n     b += tree_n - 1;\n     for (int up = 31 - __builtin_clz(tree_n); up > 0; up--) {\n       int x = a >> up, y = b >> up;\n       push_down(x, 1 << up);\n       if (x != y) push_down(y, 1 << up);\n     }\n   }\n   void join_and_apply(int position, int length) {\n     tree[position].join(tree[2 * position], tree[2 * position + 1]);\n     tree[position].apply(length, changes[position]);\n   }\n   void join_all(int a, int b) {\n     assert(0 <= a && a < b && b <= tree_n);\n     a += tree_n;\n     b += tree_n - 1;\n     int length = 1;\n     while (a > 1) {\n       a /= 2;\n       b /= 2;\n       length *= 2;\n       join_and_apply(a, length);\n       if (a != b) join_and_apply(b, length);\n     }\n   }\n   template <typename T_range_op>\n   void process_range(int a, int b, bool needs_join, T_range_op &&range_op) {\n     if (a == b) return;\n     push_all(a, b);\n     int original_a = a, original_b = b;\n     int length = 1, r_size = 0;\n     for (a += tree_n, b += tree_n; a < b; a /= 2, b /= 2, length *= 2) {\n       if (a & 1) range_op(a++, length);\n       if (b & 1) right_half[r_size++] = {--b, length};\n     }\n     for (int i = r_size - 1; i >= 0; i--)\n       range_op(right_half[i].first, right_half[i].second);\n     if (needs_join) join_all(original_a, original_b);\n   }\n   segment query(int a, int b) {\n     assert(0 <= a && a <= b && b <= tree_n);\n     segment answer;\n     process_range(a, b, false,\n                   [&](int position, int) { answer.join(tree[position]); });\n     return answer;\n   }\n   void update(int a, int b, const segment_change &change) {\n     assert(0 <= a && a <= b && b <= tree_n);\n     process_range(a, b, true, [&](int position, int length) {\n       tree[position].apply(length, change);\n       if (position < tree_n)\n         changes[position] = changes[position].combine(change);\n     });\n   }\n };\n static segment v_half[32];\n struct ordered_path_heavy_light {\n   int n = 0;\n   bool vertex_mode;\n   vector<vector<int>> adj;\n   vector<int> parent, depth, subtree_size;\n   vector<int> chain_root, chain_size;\n   vector<seg_tree> chain_up_tree, chain_down_tree;\n   ordered_path_heavy_light() {}\n   ordered_path_heavy_light(int _n, bool _vertex_mode) {\n     init(_n, _vertex_mode);\n   }\n   void init(int _n, bool _vertex_mode) {\n     n = _n;\n     vertex_mode = _vertex_mode;\n     adj.assign(n, {});\n     parent.resize(n);\n     depth.resize(n);\n     subtree_size.resize(n);\n     chain_root.resize(n);\n     chain_size.assign(n, 0);\n     chain_up_tree.assign(n, {});\n     chain_down_tree.assign(n, {});\n   }\n   void add_edge(int a, int b) {\n     adj[a].push_back(b);\n     adj[b].push_back(a);\n   }\n   void dfs(int node, int par) {\n     parent[node] = par;\n     depth[node] = par < 0 ? 0 : depth[par] + 1;\n     subtree_size[node] = 1;\n     if (par >= 0)\n       adj[node].erase(find(adj[node].begin(), adj[node].end(), par));\n     for (int &child : adj[node]) {\n       dfs(child, node);\n       subtree_size[node] += subtree_size[child];\n     }\n     sort(adj[node].begin(), adj[node].end(),\n          [&](int a, int b) { return subtree_size[a] > subtree_size[b]; });\n   }\n   void chain_dfs(int node, bool heavy) {\n     chain_root[node] = heavy ? chain_root[parent[node]] : node;\n     chain_size[chain_root[node]]++;\n     bool heavy_child = true;\n     for (int child : adj[node]) {\n       chain_dfs(child, heavy_child);\n       heavy_child = false;\n     }\n   }\n   void build(const segment &initial) {\n     parent.assign(n, -1);\n     for (int i = 0; i < n; i++)\n       if (parent[i] < 0) {\n         dfs(i, -1);\n         chain_dfs(i, false);\n       }\n     for (int i = 0; i < n; i++)\n       if (chain_root[i] == i) {\n         chain_up_tree[i].init(chain_size[i]);\n         chain_down_tree[i].init(chain_size[i]);\n         vector<segment> initial_segs(chain_size[i], initial);\n         chain_up_tree[i].build(initial_segs);\n         chain_down_tree[i].build(initial_segs);\n       }\n   }\n   segment _query_up_tree(int root, int start, int end) {\n     int size = chain_size[root];\n     return chain_up_tree[root].query(size - end, size - start);\n   }\n   void _update_up_tree(int root, int start, int end,\n                        const segment_change &change) {\n     int size = chain_size[root];\n     chain_up_tree[root].update(size - end, size - start, change);\n   }\n   void _update_both_trees(int root, int start, int end,\n                           const segment_change &change) {\n     _update_up_tree(root, start, end, change);\n     chain_down_tree[root].update(start, end, change);\n   }\n   segment query_path(int u, int v) {\n     segment u_half;\n     int v_size = 0;\n     while (chain_root[u] != chain_root[v]) {\n       bool pull_u = depth[chain_root[u]] > depth[chain_root[v]];\n       int pull_node = pull_u ? u : v;\n       int root = chain_root[pull_node];\n       int end = depth[pull_node] - depth[root] + 1;\n       if (pull_u) {\n         u_half.join(_query_up_tree(root, 0, end));\n         u = parent[root];\n       } else {\n         v_half[v_size++] = chain_down_tree[root].query(0, end);\n         v = parent[root];\n       }\n     }\n     bool pull_u = depth[u] > depth[v];\n     int pull_node = pull_u ? u : v;\n     int ancestor = pull_u ? v : u;\n     int root = chain_root[pull_node];\n     int start = depth[ancestor] - depth[root] + (vertex_mode ? 0 : 1);\n     int end = depth[pull_node] - depth[root] + 1;\n     if (pull_u)\n       u_half.join(_query_up_tree(root, start, end));\n     else\n       v_half[v_size++] = chain_down_tree[root].query(start, end);\n     for (int i = v_size - 1; i >= 0; i--) u_half.join(v_half[i]);\n     return u_half;\n   }\n   void update_path(int u, int v, const segment_change &change) {\n     while (chain_root[u] != chain_root[v]) {\n       if (depth[chain_root[u]] > depth[chain_root[v]]) swap(u, v);\n       int root = chain_root[v];\n       _update_both_trees(root, 0, depth[v] - depth[root] + 1, change);\n       v = parent[root];\n     }\n     if (depth[u] > depth[v]) swap(u, v);\n     int root = chain_root[v];\n     _update_both_trees(root, depth[u] - depth[root] + (vertex_mode ? 0 : 1),\n                        depth[v] - depth[root] + 1, change);\n   }\n };\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(nullptr);\n   int N;\n   cin >> N;\n   ordered_path_heavy_light HLD(N, false);\n   vector<pair<int, int>> T1(N - 1);\n   for (int i = 0; i < N - 1; i++) {\n     int a, b;\n     cin >> a >> b;\n     a--;\n     b--;\n     HLD.add_edge(a, b);\n     T1[i] = {a, b};\n   }\n   HLD.build(segment());\n   for (int e = 0; e < N - 1; e++)\n     HLD.update_path(T1[e].first, T1[e].second, segment_change(e));\n   vector<vector<int>> adj(N);\n   vector<int> degree(N, 0);\n   for (int i = 0; i < N - 1; i++) {\n     int a, b;\n     cin >> a >> b;\n     a--;\n     b--;\n     adj[a].push_back(b);\n     adj[b].push_back(a);\n     degree[a]++;\n     degree[b]++;\n   }\n   queue<int> leaves;\n   for (int i = 0; i < N; i++)\n     if (degree[i] == 1) leaves.push(i);\n   cout << N - 1 << '\n';\n   while (!leaves.empty()) {\n     int leaf = leaves.front();\n     leaves.pop();\n     if (degree[leaf] == 0) break;\n     int parent = -1;\n     for (int neighbor : adj[leaf])\n       if (degree[neighbor] != 0) parent = neighbor;\n     assert(parent >= 0);\n     int first_edge = HLD.query_path(leaf, parent).first;\n     assert(first_edge >= 0);\n     int x = T1[first_edge].first, y = T1[first_edge].second;\n     HLD.update_path(x, y, segment_change(-1));\n     degree[leaf]--;\n     degree[parent]--;\n     if (degree[parent] == 1) leaves.push(parent);\n     cout << x + 1 << ' ' << y + 1 << ' ' << leaf + 1 << ' ' << parent + 1\n          << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/STACK:268435456')\n using namespace std;\n const string IN_NAME = 'input.txt';\n const string OUT_NAME = 'output.txt';\n template <class T>\n T abs(T &x) {\n   return ((x) >= 0) ? (x) : (-(x));\n }\n template <class T>\n T sqr(T &x) {\n   return (x) * (x);\n }\n template <class T>\n T min(T &a, T &b) {\n   return ((a) < (b)) ? (a) : (b);\n }\n template <class T>\n T max(T &a, T &b) {\n   return ((a) > (b)) ? (a) : (b);\n }\n int n, m;\n struct tree {\n   int x, h, pL, pR;\n   tree() {}\n   bool operator<(const tree &t) const { return x < t.x; }\n };\n struct mush {\n   int x, z;\n   mush() {}\n   bool operator<(const mush &t) const { return x < t.x; }\n };\n tree a[100010];\n mush b[100010], tmpb[100010];\n int binSearch(int x) {\n   if (x < b[0].x) return -1;\n   if (x > b[m - 1].x) return -m - 1;\n   int left = 0, right = m - 1;\n   while (right - left > 1) {\n     int mid = (left + right) >> 1;\n     if (b[mid].x == x) return mid;\n     if (b[mid].x < x)\n       left = mid + 1;\n     else\n       right = mid - 1;\n   }\n   for (int i = max(0, left - 4); i < min(m - 1, right + 3); i++) {\n     if (b[i].x < x && x < b[i + 1].x) return -(i + 1) - 1;\n   }\n   return right;\n }\n double d[100010];\n double db[100010];\n int dk;\n void multQuery(int left, int right, double p) {\n   if (left > right) return;\n   int L = left / dk + 1;\n   int R = right / dk - 1;\n   if (L > R) {\n     for (int i = left; i <= right; i++) d[i] *= p;\n   } else {\n     for (int i = left; i < L * dk; i++) d[i] *= p;\n     for (int j = L; j <= R; j++) db[j] *= p;\n     for (int i = (R + 1) * dk; i <= right; i++) d[i] *= p;\n   }\n }\n double getQuery(int index) { return d[index] * db[index / dk]; }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < n; i++)\n     scanf('%d%d%d%d', &a[i].x, &a[i].h, &a[i].pL, &a[i].pR);\n   for (int i = 0; i < m; i++) scanf('%d%d', &tmpb[i].x, &tmpb[i].z);\n   sort(a, a + n);\n   sort(tmpb, tmpb + m);\n   int newM = 0;\n   for (int i = 0; i < m; i++) {\n     if (i == 0 || tmpb[i - 1].x < tmpb[i].x) {\n       b[newM].x = tmpb[i].x;\n       b[newM].z = tmpb[i].z;\n       newM++;\n     } else {\n       b[newM - 1].z += tmpb[i].z;\n     }\n   }\n   m = newM;\n   for (int i = 0; i < n; i++) a[i].x *= 2;\n   for (int i = 0; i < n; i++) a[i].h *= 2;\n   for (int i = 0; i < m; i++) b[i].x *= 2;\n   dk = (int)sqrt(m + 1e-9);\n   for (int i = 0; i < m + 5; i++) {\n     d[i] = db[i] = 1;\n   }\n   for (int i = 0; i < n; i++) {\n     int leftIndex = binSearch(a[i].x - a[i].h - 1);\n     int rightIndex = binSearch(a[i].x + a[i].h + 1);\n     int thisLeftIndex = binSearch(a[i].x - 1);\n     int thisRightIndex = binSearch(a[i].x + 1);\n     leftIndex = ~leftIndex;\n     rightIndex = ~rightIndex;\n     thisLeftIndex = ~thisLeftIndex;\n     thisRightIndex = ~thisRightIndex;\n     multQuery(leftIndex, thisLeftIndex - 1, 1.0 - a[i].pL / 100.0);\n     multQuery(thisRightIndex, rightIndex - 1, 1.0 - a[i].pR / 100.0);\n   }\n   double result = 0;\n   for (int i = 0; i < m; i++) {\n     result += getQuery(i) * b[i].z;\n   }\n   printf('%.12f', result);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double pi = acos(0.0) * 2.0;\n const double eps = 1e-12;\n const int step[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};\n template <class T>\n inline T abs1(T a) {\n   return a < 0 ? -a : a;\n }\n template <class T>\n inline T max1(T a, T b, T c = -1234567, T d = -1234567) {\n   T ans = a > b ? a : b;\n   if (c != -1234567) ans = max1(ans, c);\n   if (d != -1234567) ans = max1(ans, d);\n   return ans;\n }\n template <class T>\n inline T min1(T a, T b, T c = -1234567, T d = -1234567) {\n   T ans = a < b ? a : b;\n   if (c != -1234567) ans = min(ans, c);\n   if (d != -1234567) ans = min(ans, d);\n   return ans;\n }\n template <class T>\n inline T gcd1(T a, T b) {\n   if (a < b) swap(a, b);\n   if (a % b == 0) return b;\n   return gcd1(b, a % b);\n }\n template <class T>\n inline T lb(T num) {\n   return num & (-num);\n }\n inline int jud(double a, double b) {\n   if (abs1(a - b) < eps) return 0;\n   if (a < b) return -1;\n   return 1;\n }\n template <typename it, typename t1>\n inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {\n   if (na == 1) return 0;\n   int be = 0, en = na - 1;\n   if (*a <= *(a + na - 1)) {\n     if (f_lb == 0)\n       while (be < en) {\n         int mid = (be + en + 1) / 2;\n         if (jud(*(a + mid), val) != 1)\n           be = mid;\n         else\n           en = mid - 1;\n       }\n     else\n       while (be < en) {\n         int mid = (be + en) / 2;\n         if (jud(*(a + mid), val) != -1)\n           en = mid;\n         else\n           be = mid + 1;\n       }\n     if (f_small && jud(*(a + be), val) == 1 && be != 0) be--;\n     if (!f_small && jud(*(a + be), val) == -1 && be != na - 1) be++;\n   } else {\n     if (f_lb)\n       while (be < en) {\n         int mid = (be + en + 1) / 2;\n         if (jud(*(a + mid), val) != -1)\n           be = mid;\n         else\n           en = mid - 1;\n       }\n     else\n       while (be < en) {\n         int mid = (be + en) / 2;\n         if (jud(*(a + mid), val) != 1)\n           en = mid;\n         else\n           be = mid + 1;\n       }\n     if (!f_small && jud(*(a + be), val) == -1 && be != 0) be--;\n     if (f_small && jud(*(a + be), val) == 1 && be != na - 1) be++;\n   }\n   return be;\n }\n inline int bitnum(unsigned long long nValue) {\n   nValue = ((0xaaaaaaaaaaaaaaaaull & nValue) >> 1) +\n            (0x5555555555555555ull & nValue);\n   nValue = ((0xccccccccccccccccull & nValue) >> 2) +\n            (0x3333333333333333ull & nValue);\n   nValue = ((0xf0f0f0f0f0f0f0f0ull & nValue) >> 4) +\n            (0x0f0f0f0f0f0f0f0full & nValue);\n   nValue = ((0xff00ff00ff00ff00ull & nValue) >> 8) +\n            (0x00ff00ff00ff00ffull & nValue);\n   nValue = ((0xffff0000ffff0000ull & nValue) >> 16) +\n            (0x0000ffff0000ffffull & nValue);\n   nValue = ((0xffffffff00000000ull & nValue) >> 32) +\n            (0x00000000ffffffffull & nValue);\n   return nValue;\n }\n long long pow(long long n, long long m, long long mod = 0) {\n   long long ans = 1;\n   long long k = n;\n   while (m) {\n     if (m & 1) {\n       ans *= k;\n       if (mod) ans %= mod;\n     }\n     k *= k;\n     if (mod) k %= mod;\n     m >>= 1;\n   }\n   return ans;\n }\n const int maxn = 200110;\n char str[maxn];\n int f[maxn];\n int cntwen = 0, cnt = 0, st1 = 0;\n int main() {\n   scanf('%s', str);\n   int l = strlen(str);\n   bool st = (str[0] >= 'A' && str[0] <= 'J');\n   for (int i = 0; i < l; i++) {\n     if (str[i] >= 'A' && str[i] <= 'J') {\n       if (f[str[i] - 'A'] == 0) cnt++;\n       f[str[i] - 'A']++;\n     }\n     if (str[i] == '?') cntwen++;\n   }\n   int ans = 1;\n   for (int i = 0; i < cnt; i++) ans *= 10 - i;\n   if (st) {\n     ans /= 10;\n     ans *= 9;\n   }\n   if (str[0] == '?') ans *= 9, cntwen--;\n   printf('%d', ans);\n   for (int i = 0; i < cntwen; i++) printf('0');\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n string toString(T x) {\n   if (x == 0) return '0';\n   bool negative = x < 0;\n   string res;\n   while (x) {\n     res.push_back('0' + x % 10);\n     x /= 10;\n   }\n   if (negative) res.push_back('-');\n   reverse(res.begin(), res.end());\n   return res;\n }\n template <typename T>\n T gcd(T a, T b) {\n   return a == 0 ? b : gcd(b % a, a);\n }\n template <typename T>\n T lcm(T a, T b) {\n   return a / gcd(a, b) * b;\n }\n int main() {\n   string s;\n   cin >> s;\n   vector<int> a(s.length() / 2);\n   int m;\n   cin >> m;\n   for (int i = 0; i < m; i++) {\n     int t;\n     cin >> t;\n     t--;\n     a[t]++;\n   }\n   int l = s.length() / 2;\n   vector<bool> r(l);\n   int carry = 0;\n   for (int i = 0; i < l; i++) {\n     int t = a[i] + carry;\n     carry = t % 2;\n     r[i] = carry;\n   }\n   for (int i = 0; i < l; i++) {\n     if (r[i]) {\n       cout << s[s.length() - 1 - i];\n     } else {\n       cout << s[i];\n     }\n   }\n   if (s.length() % 2 == 1) {\n     cout << s[l];\n     l++;\n   }\n   for (int i = (s.length() + 1) / 2; i < s.length(); i++) {\n     if (r[s.length() - 1 - i]) {\n       cout << s[s.length() - 1 - i];\n     } else {\n       cout << s[i];\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, k, key, MK, MKEY;\n int MAP[110][110];\n int ii, jj;\n void dfssolve(int pos, int step) {\n   int temp[110];\n   int cnt, i, j;\n   if (pos > n) {\n     key = 1;\n     k = k < step ? k : step;\n     return;\n   }\n   cnt = 0;\n   for (i = 1; i <= m; ++i) {\n     temp[i] = MAP[pos][i];\n     if (MAP[pos][i] != MAP[pos - 1][i]) {\n       cnt++;\n       MAP[pos][i] = MAP[pos - 1][i];\n     }\n   }\n   if (step + cnt <= k) dfssolve(pos + 1, step + cnt);\n   cnt = 0;\n   for (i = 1; i <= m; ++i) {\n     if (temp[i] == MAP[pos - 1][i]) {\n       cnt++;\n       MAP[pos][i] = MAP[pos - 1][i] & 1;\n     }\n   }\n   if (step + cnt <= k) dfssolve(pos + 1, step + cnt);\n   for (i = 1; i <= m; ++i) MAP[pos][i] = temp[i];\n }\n void dfssolveup(int pos, int step) {\n   int cnt, i, j;\n   int temp[110];\n   if (pos < 1) {\n     MKEY = 1;\n     MK = step < MK ? step : MK;\n     return;\n   }\n   cnt = 0;\n   for (i = 1; i <= m; ++i) {\n     temp[i] = MAP[pos][i];\n     if (MAP[pos][i] != MAP[pos + 1][i]) {\n       cnt++;\n       MAP[pos][i] = MAP[pos + 1][i];\n     }\n   }\n   if (step + cnt <= k) dfssolveup(pos - 1, step + cnt);\n   cnt = 0;\n   for (i = 1; i <= m; ++i) {\n     if (temp[i] == MAP[pos + 1][i]) {\n       cnt++;\n       MAP[pos][i] = MAP[pos + 1][i] & 1;\n     }\n   }\n   if (step + cnt <= k) dfssolveup(pos - 1, step + cnt);\n   for (i = 1; i <= m; ++i) MAP[pos][i] = temp[i];\n }\n void dfs(int pos, int step) {\n   if (k < step) return;\n   if (pos == m) {\n     dfssolve(2, step);\n     MAP[1][pos] ^= 1;\n     dfssolve(2, step + 1);\n     MAP[1][pos] ^= 1;\n   } else {\n     dfs(pos + 1, step);\n     MAP[1][pos] ^= 1;\n     dfs(pos + 1, step + 1);\n     MAP[1][pos] ^= 1;\n   }\n }\n int main() {\n   cin >> n >> m >> k;\n   key = 0;\n   if (n < m) {\n     for (ii = 1; ii <= n; ++ii)\n       for (jj = 1; jj <= m; ++jj) cin >> MAP[jj][ii];\n     swap(n, m);\n   } else {\n     for (ii = 1; ii <= n; ++ii)\n       for (jj = 1; jj <= m; ++jj) cin >> MAP[ii][jj];\n   }\n   if (n <= k) {\n     dfs(1, 0);\n   } else {\n     for (ii = 1; ii <= n; ++ii) {\n       MK = 10;\n       MKEY = 0;\n       dfssolveup(ii - 1, 0);\n       if (MKEY) {\n         dfssolve(ii + 1, MK);\n       }\n     }\n   }\n   if (key)\n     cout << k << endl;\n   else\n     cout << -1 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1e9 + 7;\n const long long N = 1e5 + 5;\n long long ans = 1e18;\n map<long long, bool> mp;\n void solve(long long n, long long cnt) {\n   if (!n) {\n     cout << cnt;\n     exit(0);\n   }\n   string s = to_string(n);\n   sort(s.rbegin(), s.rend());\n   solve(n - (s[0] - '0'), cnt + 1);\n }\n inline long long solve() {\n   long long n;\n   cin >> n;\n   solve(n, 0);\n   cout << ans;\n   return 0;\n }\n signed main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long t = 1;\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n, m, t, d;\n   cin >> n >> m;\n   map<long long, long long> mp;\n   set<pair<long long, long long> > st;\n   vector<long long> a(n), c(n);\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n     mp[i] = a[i];\n   }\n   for (int i = 0; i < n; i++) {\n     cin >> c[i];\n     st.insert({c[i], i});\n   }\n   for (int i = 0; i < m; i++) {\n     cin >> t >> d;\n     long long cost = 0;\n     t--;\n     if (st.size() == 0)\n       cout << 0 << endl;\n     else {\n       if (mp[t] != 0) {\n         if (mp[t] > d) {\n           mp[t] -= d;\n           cout << (long long)d * c[t] << endl;\n           d = 0;\n         } else if (mp[t] == d) {\n           mp[t] -= d;\n           cout << (long long)d * c[t] << endl;\n           d = 0;\n           st.erase({c[t], t});\n         } else {\n           cost += (long long)mp[t] * c[t];\n           d -= mp[t];\n           mp[t] = 0;\n           st.erase({c[t], t});\n         }\n       }\n       if (d > 0) {\n         while (d > 0 && st.size() > 0) {\n           pair<int, int> now = *st.begin();\n           if (mp[now.second] > d) {\n             mp[now.second] -= d;\n             cout << (long long)cost + d * now.first << endl;\n             d = 0;\n           } else if (mp[now.second] == d) {\n             mp[now.second] -= d;\n             cout << (long long)cost + d * now.first << endl;\n             d = 0;\n             st.erase(st.begin());\n           } else {\n             cost += (long long)mp[now.second] * now.first;\n             d -= mp[now.second];\n             mp[now.second] = 0;\n             st.erase(st.begin());\n           }\n         }\n         if (d > 0) {\n           cout << 0 << endl;\n         }\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void pri(deque<int> arr) {\n   for (int i : arr) cout << i << ' ';\n   cout << endl;\n }\n int main() {\n   string s;\n   cin >> s;\n   int n = s.size();\n   if (n <= 3) {\n     cout << s[0] << endl;\n     return 0;\n   }\n   deque<int> a1;\n   deque<int> b1;\n   deque<int> c1;\n   int as[n + 2];\n   int bs[n + 2];\n   int cs[n + 2];\n   memset(as, 0, sizeof as);\n   memset(bs, 0, sizeof bs);\n   memset(cs, 0, sizeof cs);\n   as[0] = 0;\n   bs[0] = 0;\n   cs[0] = 0;\n   for (int i = 0; i < n; i++) {\n     if (s[i] == 'a') {\n       a1.push_back(i);\n       as[i + 1]++;\n     } else if (s[i] == 'b') {\n       b1.push_back(i);\n       bs[i + 1]++;\n     } else {\n       c1.push_back(i);\n       cs[i + 1]++;\n     }\n     as[i + 1] += as[i];\n     bs[i + 1] += bs[i];\n     cs[i + 1] += cs[i];\n   }\n   int lim = -10;\n   int mx = 1000006;\n   string ans = '';\n   while (true) {\n     int a = lim;\n     int b = lim;\n     int c = lim;\n     if (a1.size() > 1) {\n       a = a1[a1.size() - 1] - a1[0];\n     }\n     if (b1.size() > 1) {\n       b = b1[b1.size() - 1] - b1[0];\n     }\n     if (c1.size() > 1) {\n       c = c1.back() - c1.front();\n     }\n     int x = max(max(a, b), c);\n     if (x == lim) break;\n     int az = mx, bz = mx, cz = mx;\n     if (a1.size() > 0) {\n       az = as[a1[a1.size() - 1] + 1] - as[a1[0]];\n     }\n     if (b1.size() > 0) {\n       bz = bs[b1[b1.size() - 1] + 1] - bs[b1[0]];\n     }\n     if (c1.size() > 0) {\n       cz = cs[c1[c1.size() - 1] + 1] - cs[c1[0]];\n     }\n     if (x > a) {\n       a = lim;\n       az = mx;\n     }\n     if (x > b) {\n       b = lim;\n       bz = mx;\n     }\n     if (x > c) {\n       c = lim;\n       cz = mx;\n     }\n     x += min(min(az, bz), cz);\n     a += az;\n     b += bz;\n     c += cz;\n     if (x == a) {\n       ans += 'a';\n       while (b1.size() > 0 && b1[0] < a1[0]) b1.pop_front();\n       while (b1.size() > 0 && b1[b1.size() - 1] > a1[a1.size() - 1])\n         b1.pop_back();\n       while (c1.size() > 0 && c1[0] < a1[0]) c1.pop_front();\n       while (c1.size() > 0 && c1[c1.size() - 1] > a1[a1.size() - 1])\n         c1.pop_back();\n       a1.pop_front();\n       a1.pop_back();\n     } else if (x == b) {\n       ans += 'b';\n       while (a1.size() > 0 && a1[0] < b1[0]) a1.pop_front();\n       while (a1.size() > 0 && a1[a1.size() - 1] > b1[b1.size() - 1])\n         a1.pop_back();\n       while (c1.size() > 0 && c1[0] < b1[0]) c1.pop_front();\n       while (c1.size() > 0 && c1[c1.size() - 1] > b1[b1.size() - 1])\n         c1.pop_back();\n       b1.pop_front();\n       b1.pop_back();\n     } else {\n       ans += 'c';\n       while (b1.size() > 0 && b1[0] < c1[0]) b1.pop_front();\n       while (b1.size() > 0 && b1[b1.size() - 1] > c1[c1.size() - 1])\n         b1.pop_back();\n       while (a1.size() > 0 && a1[0] < c1[0]) a1.pop_front();\n       while (a1.size() > 0 && a1[a1.size() - 1] > c1[c1.size() - 1])\n         a1.pop_back();\n       c1.pop_front();\n       c1.pop_back();\n     }\n   }\n   string aux = ans;\n   reverse(aux.begin(), aux.end());\n   if (c1.size() > 0) {\n     ans += 'c';\n   } else {\n     if (b1.size() > 0) {\n       ans += 'b';\n     } else {\n       if (a1.size()) {\n         ans += 'a';\n       }\n     }\n   }\n   ans += aux;\n   if (ans.size() >= (int)n / 2)\n     cout << ans;\n   else\n     cout << 'IMPOSSIBLE';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n T modulo(T x, T p) {\n   if (x >= 0) return x % p;\n   return p + x % p;\n }\n template <class T>\n T gcd(T a, T b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n template <class T>\n T lcm(T a, T b) {\n   return a * b / gcd(a, b);\n }\n int dfs_paths(\n     int u, int prev, vector<vector<pair<long long, long long> > > &G,\n     long long &cur,\n     priority_queue<pair<long long, pair<long long, long long> > > &pqw) {\n   long long paths, total = 0, profit;\n   for (pair<long long, long long> e : G[u]) {\n     if (e.second == prev) continue;\n     paths = dfs_paths(e.second, u, G, cur, pqw);\n     profit = e.first * paths - (e.first / 2) * paths;\n     pqw.push({profit, {e.first, paths}});\n     cur += e.first * paths;\n     total += paths;\n   }\n   return max(1ll, total);\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     long long n, S;\n     cin >> n >> S;\n     vector<vector<pair<long long, long long> > > G(n);\n     int u, v;\n     long long w;\n     for (int i = 0; i < n - 1; i++) {\n       cin >> u >> v >> w;\n       u--;\n       v--;\n       G[u].push_back({w, v});\n       G[v].push_back({w, u});\n     }\n     long long cur = 0;\n     priority_queue<pair<long long, pair<long long, long long> > > pqw;\n     dfs_paths(0, -1, G, cur, pqw);\n     long long moves = 0, mult;\n     pair<long long, pair<long long, long long> > e;\n     while (cur > S) {\n       e = pqw.top();\n       pqw.pop();\n       w = e.second.first / 2;\n       mult = e.second.second;\n       cur -= e.first;\n       pqw.push({w * mult - (w / 2) * mult, {w, mult}});\n       moves++;\n     }\n     cout << moves << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int long long l1, l2, r1, r2, k, ans, l, r;\n   cin >> l1;\n   cin >> r1;\n   cin >> l2;\n   cin >> r2;\n   cin >> k;\n   l = max(l1, l2);\n   r = min(r1, r2);\n   if (r - l < 0) {\n     cout << 0 << endl;\n     return 0;\n   }\n   ans = r - l + 1;\n   if (k >= l && k <= r) ans--;\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n clock_t __stt;\n inline void TStart() { __stt = clock(); }\n inline void TReport() {\n   cerr << fixed << setprecision(3) << '\nCurrent Case Taken Time : '\n        << (double)(clock() - __stt) / CLOCKS_PER_SEC << 'sec\n';\n }\n template <typename T>\n T MIN(T a, T b) {\n   return a < b ? a : b;\n }\n template <typename T>\n T MAX(T a, T b) {\n   return a > b ? a : b;\n }\n template <typename T>\n T ABS(T a) {\n   return a > 0 ? a : (-a);\n }\n template <typename T>\n void UMIN(T &a, T b) {\n   if (b < a) a = b;\n }\n template <typename T>\n void UMAX(T &a, T b) {\n   if (b > a) a = b;\n }\n int n, m, p[100005], s[100005], b[100005], inc[100005], pref[100005];\n struct ele {\n   int A, B, C, id;\n   void set(int _A, int _B, int _C, int _id) {\n     A = _A;\n     B = _B;\n     C = _C;\n     id = _id;\n   }\n } es[100005], et[100005];\n struct qry {\n   int Al, Ar, B, C;\n   void set(int _Al, int _Ar, int _B, int _C) {\n     Al = _Al;\n     Ar = _Ar;\n     B = _B;\n     C = _C;\n   }\n } qs[100005], qt[100005];\n namespace BIT {\n int arr[300005];\n void add(int p, int v = 1) {\n   ++p;\n   while (p <= 300002) {\n     arr[p] += v;\n     p += (p & (-p));\n   }\n }\n void clr(int p) {\n   ++p;\n   while (p <= 300002) {\n     arr[p] = 0;\n     p += (p & (-p));\n   }\n }\n int sum(int p) {\n   int r = 0;\n   ++p;\n   while (p) {\n     r += arr[p];\n     p -= (p & (-p));\n   }\n   return r;\n }\n }  // namespace BIT\n bool cmpB(ele a, ele b) { return a.B < b.B; }\n bool cmpC(ele a, ele b) { return a.C < b.C; }\n bool cmpBq(qry a, qry b) { return a.B < b.B; }\n bool cmpCq(qry a, qry b) { return a.C < b.C; }\n vector<int> vs;\n int id(int v) { return lower_bound(vs.begin(), vs.end(), v) - vs.begin(); }\n int res[100005];\n void solve2d(ele *E, int ec, qry *Q, int qc) {\n   int i, j, k;\n   sort(E, E + ec, cmpB);\n   sort(Q, Q + qc, cmpBq);\n   reverse(Q, Q + qc);\n   reverse(E, E + ec);\n   j = 0;\n   for (i = 0; i < ec; ++i) {\n     int cB = E[i].B;\n     while (j < qc && Q[j].B >= cB) {\n       BIT::add(Q[j].Al, 1);\n       BIT::add(Q[j].Ar + 1, -1);\n       ++j;\n     }\n     res[E[i].id] += BIT::sum(E[i].A);\n   }\n   for (i = 0; i < qc; ++i) {\n     BIT::clr(Q[i].Al);\n     BIT::clr(Q[i].Ar + 1);\n   }\n }\n void solve(int cl, int cr, int ql, int qr, int el, int er) {\n   if (ql > qr || el > er) return;\n   int i, j, k;\n   if (cl == cr) {\n     solve2d(es + el, er - el + 1, qs + ql, qr - ql + 1);\n     return;\n   }\n   memcpy(et + el, es + el, sizeof(ele) * (er - el + 1));\n   memcpy(qt + ql, qs + ql, sizeof(qry) * (qr - ql + 1));\n   int cM = ((long long)cl + (long long)cr) / 2ll, qM, eM;\n   for (qM = ql; qM <= qr; ++qM) {\n     if (qt[qM].C <= cM && (qM == qr || qt[qM + 1].C > cM)) break;\n   }\n   if (qt[ql].C > cM) qM = ql - 1;\n   for (eM = el; eM <= er; ++eM) {\n     if (et[eM].C <= cM && (eM == er || et[eM + 1].C > cM)) break;\n   }\n   if (et[el].C > cM) eM = el - 1;\n   if (er > eM && qM >= ql) solve2d(et + eM + 1, er - eM, qt + ql, qM - ql + 1);\n   solve(cl, cM, ql, qM, el, eM);\n   solve(cM + 1, cr, qM + 1, qr, eM + 1, er);\n }\n int main() {\n   int i, j, k;\n   scanf('%d%d', &n, &m);\n   for (i = 0; i < n; ++i) scanf('%d', p + i);\n   for (i = 0; i < n; ++i) scanf('%d', s + i);\n   for (i = 0; i < n; ++i) scanf('%d', b + i);\n   for (i = 0; i < m; ++i) scanf('%d', inc + i);\n   for (i = 0; i < m; ++i) scanf('%d', pref + i);\n   for (i = 0; i < n; ++i) {\n     qs[i].Al = p[i];\n     qs[i].Ar = s[i];\n     vs.push_back(p[i]);\n     vs.push_back(s[i]);\n     qs[i].B = b[i] - p[i];\n     qs[i].C = b[i] + p[i];\n   }\n   for (j = 0; j < m; ++j) {\n     es[j].A = inc[j];\n     vs.push_back(inc[j]);\n     es[j].B = pref[j] - inc[j];\n     es[j].C = pref[j] + inc[j];\n     es[j].id = j;\n   }\n   sort(vs.begin(), vs.end());\n   vs.erase(unique(vs.begin(), vs.end()), vs.end());\n   for (i = 0; i < n; ++i) {\n     qs[i].Al = id(qs[i].Al);\n     qs[i].Ar = id(qs[i].Ar);\n   }\n   for (j = 0; j < m; ++j) {\n     es[j].A = id(es[j].A);\n   }\n   sort(es, es + m, cmpC);\n   sort(qs, qs + n, cmpCq);\n   solve(0, (int)2e9 + 5, 0, n - 1, 0, m - 1);\n   for (i = 0; i < m; ++i) {\n     printf('%d ', res[i]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   scanf('%d', &t);\n   while (t--) {\n     long long x1, y1, x2, y2;\n     scanf('%lld%lld%lld%lld', &x1, &y1, &x2, &y2);\n     long long lenx = abs(x1 - x2);\n     long long leny = abs(y1 - y2);\n     long long ans = lenx + leny;\n     if (lenx && leny) ans += 2;\n     printf('%lld\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n;\n   cin >> n;\n   cout << n % 2;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n;\n   while (cin >> n) {\n     vector<long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int n, nxt[200010], a[200010], sz[200010][31];\n long long ans = 0;\n map<int, int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int, int> e[M];\n void ae(int *A, int x, int y) {\n   p[ee] = y;\n   n1[ee] = A[x];\n   A[x] = ee++;\n }\n void tarjan(int u, int fa) {\n   vis[u] = 1;\n   low[u] = dfn[u] = ++dfntot;\n   st[++top] = u;\n   for (int i = h[u]; ~i; i = n1[i])\n     if (p[i] != fa) {\n       if (!vis[p[i]])\n         tarjan(p[i], u), low[u] = min(low[u], low[p[i]]);\n       else\n         low[u] = min(low[u], dfn[p[i]]);\n       if (low[p[i]] > dfn[u]) {\n         ++tot;\n         while (st[top] != p[i]) id[st[top--]] = tot, sz[tot]++;\n         id[st[top--]] = tot;\n         sz[tot]++;\n       }\n     }\n }\n void dfs(int u, int fa) {\n   dp[u] = sz[u];\n   for (int i = g[u]; ~i; i = n1[i])\n     if (p[i] != fa) {\n       dfs(p[i], u);\n       dp[u] += dp[p[i]];\n     }\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   memset(h, -1, sizeof(h));\n   memset(g, -1, sizeof(g));\n   int x, y;\n   for (int i = 1; i <= m; i++) scanf('%d%d', &x, &y), ae(h, x, y), ae(h, y, x);\n   for (int i = 1; i <= n; i++)\n     if (!vis[i]) tarjan(i, 0);\n   ++tot;\n   while (top) id[st[top--]] = tot, sz[tot]++;\n   for (int i = 1; i <= n; i++)\n     for (int j = h[i]; ~j; j = n1[j])\n       if (id[i] != id[p[j]]) ae(g, id[i], id[p[j]]);\n   for (int i = 1; i <= tot; i++) ans += sz[i] * (sz[i] - 1);\n   int ret = 0;\n   for (int i = 1; i <= tot; i++) {\n     int tmp = 0;\n     dfs(i, 0);\n     for (int j = 1; j <= tot; j++) tmp += (dp[j] - sz[j]) * sz[j];\n     for (int j = 0; j <= n; j++) ok[j] = 0;\n     ok[0] = 1;\n     for (int k = g[i]; ~k; k = n1[k])\n       for (int j = n; j >= dp[p[k]]; j--) ok[j] |= ok[j - dp[p[k]]];\n     int mx = 0;\n     for (int j = 0; j <= n; j++)\n       if (ok[j]) mx = max(mx, j * (n - sz[i] - j));\n     ret = max(ret, tmp + mx);\n   }\n   printf('%d\n', n + ans + ret);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int m = 1000000007;\n long long int n1, n2 = 0, sum = 0;\n long long int gcd(long long int a, long long int b) {\n   return (b == 0) ? a : gcd(b, a % b);\n }\n bool compare(pair<string, long long int> p1, pair<string, long long int> p2) {\n   if (p1.second != p2.second) {\n     return p1.second > p2.second;\n   } else\n     return p1.first < p2.first;\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long int t = 1;\n   while (t--) {\n     long long int n;\n     cin >> n;\n     bool prime[n + 2];\n     memset(prime, true, sizeof(prime));\n     for (long long int p = 2; p * p <= n + 1; p++) {\n       if (prime[p] == true) {\n         for (long long int i = p * p; i <= n + 1; i += p) prime[i] = false;\n       }\n     }\n     if (n > 2)\n       cout << 2 << '\n';\n     else\n       cout << 1 << '\n';\n     for (long long int i = 2; i < n + 2; i++) {\n       if (prime[i])\n         cout << 1 << ' ';\n       else\n         cout << 2 << ' ';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n mt19937_64 mt(time(0));\n set<pair<long long, long long> > dp[49];\n void insert(set<pair<long long, long long> >& table, long long a, long long b) {\n   if (table.empty()) {\n     table.insert({a, b});\n     return;\n   }\n   auto it = table.lower_bound({b, LLONG_MAX});\n   while (it != table.begin()) {\n     it--;\n     if (it->second < a) break;\n     a = min(it->first, a);\n     b = max(it->second, b);\n     if (it == table.begin()) {\n       table.erase(it);\n       break;\n     } else {\n       table.erase(it++);\n     }\n   }\n   table.insert({a, b});\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cout.precision(10);\n   cout << fixed;\n   long long n;\n   cin >> n;\n   for (int i = 0; i <= min(48LL, n); i++) {\n     for (int j = 0; j <= 8 && i + j <= n; j++) {\n       int tmp = i * 9 + j * 4;\n       long long a = tmp / 49;\n       long long b = n - i - j + tmp / 49;\n       insert(dp[tmp % 49], a, b);\n     }\n   }\n   long long ret = 0;\n   for (int i = 0; i < 49; i++) {\n     for (auto item : dp[i]) {\n       ret += item.second - item.first + 1;\n     }\n   }\n   cout << ret << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n, i;\n   long long cnt[5] = {0};\n   char ch;\n   scanf('%d', &n);\n   getchar();\n   cnt[0] = 1;\n   for (i = 0; i < n; i++) {\n     scanf('%c', &ch);\n     if (ch == 'a') {\n       cnt[1] = (cnt[1] + cnt[0]) % 1000000007;\n     } else if (ch == 'b') {\n       cnt[2] = (cnt[2] + cnt[1]) % 1000000007;\n     } else if (ch == 'c') {\n       cnt[3] = (cnt[3] + cnt[2]) % 1000000007;\n     } else if (ch == '?') {\n       cnt[3] = (3 * cnt[3] % 1000000007 + cnt[2]) % 1000000007;\n       cnt[2] = (3 * cnt[2] % 1000000007 + cnt[1]) % 1000000007;\n       cnt[1] = (3 * cnt[1] % 1000000007 + cnt[0]) % 1000000007;\n       cnt[0] = 3 * cnt[0] % 1000000007;\n     }\n   }\n   printf('%lld\n', cnt[3]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using namespace std;\n struct node {\n   int l, m, r;\n };\n node t[3000005];\n int arr[300005], n, m;\n long long a[300005];\n int sign(long long x) {\n   if (x > 0) return 1;\n   if (x < 0) return -1;\n   return 0;\n }\n void cal(int x, int l, int r) {\n   int m = (l + r) / 2;\n   t[x].m = max(t[x * 2].m, t[x * 2 + 1].m);\n   t[x].l = t[x * 2].l;\n   t[x].r = t[x * 2 + 1].r;\n   if (!!a[m] && !!a[m + 1] && sign(a[m]) >= sign(a[m + 1])) {\n     t[x].m = max(t[x].m, t[x * 2].r + t[x * 2 + 1].l);\n     if (t[2 * x].m == m - l + 1) t[x].l = t[2 * x].l + t[2 * x + 1].l;\n     if (t[2 * x + 1].m == r - m) t[x].r = t[2 * x].r + t[2 * x + 1].r;\n   }\n }\n void build(int x, int l, int r) {\n   if (l == r) {\n     int tmp = !!a[l];\n     t[x] = {tmp, tmp, tmp};\n     return;\n   }\n   int m = (l + r) / 2;\n   build(x * 2, l, m);\n   build(x * 2 + 1, m + 1, r);\n   cal(x, l, r);\n }\n void update(int x, int l, int r, int pos, int d) {\n   if (l == r) {\n     a[pos] += d;\n     int tmp = !!a[pos];\n     t[x] = {tmp, tmp, tmp};\n     return;\n   }\n   int m = (l + r) / 2;\n   if (pos <= m)\n     update(x * 2, l, m, pos, d);\n   else\n     update(x * 2 + 1, m + 1, r, pos, d);\n   cal(x, l, r);\n }\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; i++) scanf('%d', &arr[i]);\n   for (int i = 0; i + 1 < n; i++) a[i] = arr[i + 1] - arr[i];\n   if (n > 1) build(1, 0, n - 2);\n   cin >> m;\n   while (m--) {\n     int l, r, d;\n     scanf('%d%d%d', &l, &r, &d);\n     if (n == 1) {\n       printf('%d\n', 1);\n       continue;\n     }\n     if (l > 1) update(1, 0, n - 2, l - 2, d);\n     if (r < n) update(1, 0, n - 2, r - 1, -d);\n     printf('%d\n', t[1].m + 1);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = int(1e9);\n const int MOD = INF + 7;\n const long long INFll = 1ll * INF * INF;\n const long double ldINF = 1e+018;\n const long double EPS = 0.000000001;\n const int MAXN = 150;\n const int N = 100001;\n const int seg[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};\n struct feature {\n   int b, i, r;\n };\n bool comp(feature x, feature y) {\n   return x.r > y.r || (x.r == y.r && x.b < y.b);\n }\n int t[1001000];\n int cur = 0;\n int query(int l, int r) {\n   int res = 0;\n   for (l += cur, r += cur; l < r; l >>= 1, r >>= 1) {\n     if (l & 1) res = max(res, t[l++]);\n     if (r & 1) res = max(res, t[--r]);\n   }\n   return res;\n }\n void modify(int p, int value) {\n   t[p += cur] = value;\n   while (p > 1) {\n     p >>= 1;\n     t[p] = max(t[p << 1], t[p << 1 | 1]);\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   int n;\n   cin >> n;\n   vector<feature> v(n);\n   for (int i = 0; i < n; i++) cin >> v[i].r;\n   for (int i = 0; i < n; i++) cin >> v[i].b;\n   for (int i = 0; i < n; i++) cin >> v[i].i;\n   vector<int> b;\n   for (int i = 0; i < n; i++) b.push_back(v[i].b);\n   sort(b.begin(), b.end());\n   map<int, int> m;\n   m[b[0]] = 0;\n   for (int i = 1; i < n; i++)\n     if (b[i] != b[i - 1]) m[b[i]] = ++cur;\n   cur++;\n   for (int i = 0; i < n; i++) v[i].b = m[v[i].b];\n   int ans = 0;\n   sort(v.begin(), v.end(), comp);\n   for (int i = 0; i < n; i++) {\n     int d = query(v[i].b + 1, cur);\n     if (d > v[i].i) {\n       ans++;\n     }\n     modify(v[i].b, max(t[v[i].b + cur], v[i].i));\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long int t = 1;\n   while (t--) {\n     long long int n, d = 0, r = 0;\n     cin >> n;\n     string s;\n     cin >> s;\n     char x;\n     for (long long int i = 0; i < s.length(); i++) {\n       if (s[i] == 'R') {\n         if (d) {\n           d--;\n         } else {\n           s += 'R';\n           r++;\n         }\n       } else {\n         if (r) {\n           r--;\n         } else {\n           s += 'D';\n           d++;\n         }\n       }\n       x = s[i];\n       if (d == n || r == n) {\n         break;\n       }\n     }\n     cout << x << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #define fasterio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)\n #define X first\n #define Y second\n #define forn(i, n) for(int i=0;i<(n);i++)\n #define pb push_back\n using namespace std;\n typedef long long ll;\n typedef pair<int, int> pii;\n const int inf = 0x3f3f3f3f;\n const long long mod = 1e9+7;\n const long long maxn = 100010;\n \n int gao (int x1, int y1, int x2, int y2, int xf, int yf) {\n 	auto abs = [&](int a, int b){return a>b?a-b:b-a;};\n 	int ans = abs(x1, x2) + abs(y1, y2);\n \n 	if (x1 == x2 && y1 == y2) {\n 		return ans;\n 	} else if (x1 == x2 && x2 == xf) { // on the same x axis\n 		if ((y1<yf && yf<y2) || (y2<yf && yf<y1))\n 			ans += 2;\n 	} else if (y1 == y2 && y2 == yf) {\n 		if ((x1<xf && xf<x2)||(x2<xf && xf<x1)) \n 			ans += 2;\n 	}\n 	return ans;\n }\n int main() {\n  int t;\n  cin>>t;\n  	while(t--) {\n 		int xa, ya, xb, yb, xf, yf;\n 		cin>>xa>>ya>>xb>>yb>>xf>>yf;\n 	 \n 		if(xa==xb && ya==yb) {\n 			cout<<0<<endl;\n 			continue;\n 		}\n \n 		int ans = gao(xa, ya, xb, yb, xf, yf);\n 		cout<<ans<<endl;\n 	}\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int l_f, l_h;\n long long int dp[101][101][11][11];\n int getans(int f, int h, int k1, int k2) {\n   int x = 0, y = 0;\n   if ((f + h) == 0) return 1;\n   if (dp[f][h][k1][k2] != -1) return dp[f][h][k1][k2];\n   if (f > 0 && k1 > 0) x = getans(f - 1, h, k1 - 1, l_h);\n   if (h > 0 && k2 > 0) y = getans(f, h - 1, l_f, k2 - 1);\n   return dp[f][h][k1][k2] = (x + y) % 100000000;\n }\n int main() {\n   int t = 1;\n   while (t--) {\n     int n1, n2;\n     cin >> n1 >> n2 >> l_f >> l_h;\n     memset(dp, -1, sizeof(dp));\n     int ans = getans(n1, n2, l_f, l_h);\n     cout << ans << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<string, string> mp;\n   map<string, string>::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 <bits/stdc++.h>\n using namespace std;\n pair<int, int> 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<int, int>(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<int, int>(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<int, int>(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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<string, int> h;\n vector<AA> ask[maxn];\n set<int> hip[maxn];\n int n, q, s, t, cnt, name[maxn], dep[maxn], son[maxn], size[maxn], ans[maxn];\n bool vis[maxn];\n char ch[30];\n inline void dfs1(int x, int fa) {\n   size[x] = 1;\n   dep[x] = dep[fa] + 1;\n   for (int i = head[x]; i; i = e[i].nxt) {\n     int v = e[i].v;\n     if (v == fa) continue;\n     dfs1(v, x);\n     size[x] += size[v];\n     if (son[x] == 0 || size[v] > size[son[x]]) son[x] = v;\n   }\n }\n inline void calc(int x, int fa) {\n   hip[dep[x]].insert(name[x]);\n   for (int i = head[x]; i; i = e[i].nxt) {\n     int v = e[i].v;\n     if (v == fa || vis[v]) continue;\n     calc(v, x);\n   }\n }\n inline void dfs2(int x, int fa, int keep) {\n   for (int i = head[x]; i; i = e[i].nxt) {\n     int v = e[i].v;\n     if (v == fa || v == son[x]) continue;\n     dfs2(v, x, 0);\n   }\n   if (son[x]) dfs2(son[x], x, 1), vis[son[x]] = true;\n   calc(x, fa);\n   vis[son[x]] = false;\n   for (int i = 0; i < ask[x].size(); i++) {\n     if (dep[x] + ask[x][i].s <= n)\n       ans[ask[x][i].num] = hip[dep[x] + ask[x][i].s].size();\n   }\n   if (!keep) {\n     for (int i = dep[x]; !hip[i].empty(); i++) {\n       hip[i].clear();\n     }\n   }\n }\n int main() {\n   read(n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%s', ch);\n     if (h.find(ch) == h.end()) h[ch] = ++cnt;\n     name[i] = h[ch];\n     read(s), add(s, i);\n   }\n   read(q);\n   AA tmp;\n   for (int i = 1; i <= q; i++) {\n     read(s), read(t);\n     tmp.s = t;\n     tmp.num = i;\n     ask[s].push_back(tmp);\n   }\n   dep[0] = -1;\n   dfs1(0, 0);\n   dfs2(0, 0, 1);\n   for (int i = 1; i <= q; i++) printf('%d\n', ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> v[250005];\n int visited[250005];\n int n, m, x, y;\n void zero() {\n   for (int i = 0; i <= n + 2; i++) {\n     visited[i] = 0;\n     v[i].clear();\n   }\n }\n void bipartite(int u) {\n   if (visited[u] == 1) {\n     x++;\n   } else if (visited[u] == 2) {\n     y++;\n   }\n   for (int i = 0; i < v[u].size(); i++) {\n     int a = v[u][i];\n     if (visited[a] == 0 && visited[u] == 1) {\n       visited[a] = 2;\n       bipartite(a);\n     } else if (visited[a] == 0 && visited[u] == 2) {\n       visited[a] = 1;\n       bipartite(a);\n     }\n   }\n }\n int main() {\n   int i, a, b, t;\n   scanf('%d', &t);\n   while (t--) {\n     scanf('%d %d', &n, &m);\n     zero();\n     for (i = 1; i <= m; i++) {\n       scanf('%d %d', &a, &b);\n       v[a].push_back(b);\n       v[b].push_back(a);\n     }\n     visited[1] = 1;\n     x = 0;\n     y = 0;\n     bipartite(1);\n     printf('%d\n', min(x, y));\n     if (x <= y) {\n       for (i = 1; i <= n; i++) {\n         if (visited[i] == 1) {\n           printf('%d ', i);\n         }\n       }\n     } else {\n       for (i = 1; i <= n; i++) {\n         if (visited[i] == 2) {\n           printf('%d ', i);\n         }\n       }\n     }\n     printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n #pragma GCC optimize('unroll-loops')\n using namespace std;\n using ll = long long;\n using db = long double;\n using ii = pair<int, int>;\n const int N = 1e7 + 5, LG = 19, MOD = 1e9 + 7;\n const int SQ = 225;\n const long double EPS = 1e-7;\n int fast(int b, int e) {\n   int res = 1;\n   for (; e; e >>= 1, b = 1ll * b * b % MOD)\n     if (e & 1) res = 1ll * res * b % MOD;\n   return res;\n }\n vector<int> adj[10005];\n int n, k;\n map<int, map<int, ll>> mat;\n int32_t main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n >> k;\n   vector<int> deg(n + 1);\n   for (int i = 1; i <= k; i++)\n     for (int j = i + 1; j <= k; j++) {\n       adj[j].push_back(i);\n       deg[j]++;\n       deg[i]++;\n     }\n   for (int i = k + 1; i <= n; i++) {\n     for (int j = 0; j < k; j++) {\n       int x;\n       cin >> x;\n       adj[i].push_back(x);\n       deg[i]++;\n       deg[x]++;\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     mat[i][i] = deg[i];\n     for (auto x : adj[i]) {\n       mat[i][x] = MOD - 1;\n       mat[x][i] = MOD - 1;\n     }\n   }\n   ll ans = 1;\n   for (int i = n; i >= 2; --i) {\n     ll v = mat[i][i];\n     ll inv = fast(MOD - v, MOD - 2);\n     ans = 1ll * ans * v % MOD;\n     for (auto j : adj[i]) {\n       ll coff = inv * mat[j][i] % MOD;\n       for (auto k : adj[i]) {\n         mat[j][k] = (mat[j][k] + mat[i][k] * coff) % MOD;\n       }\n     }\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1000000007;\n long long powermodm(long long x, long long n, long long M) {\n   long long result = 1;\n   while (n > 0) {\n     if (n % 2 == 1) result = (result * x) % M;\n     x = (x * x) % M;\n     n = n / 2;\n   }\n   return result;\n }\n long long power(long long _a, long long _b) {\n   long long _r = 1;\n   while (_b) {\n     if (_b % 2 == 1) _r = (_r * _a);\n     _b /= 2;\n     _a = (_a * _a);\n   }\n   return _r;\n }\n long long gcd(long long a, long long b) {\n   if (a == 0) return b;\n   return gcd(b % a, a);\n }\n long long lcm(long long a, long long b) {\n   return (max(a, b) / gcd(a, b)) * min(a, b);\n }\n long long modInverse(long long x) { return powermodm(x, mod - 2, mod); }\n long long fact[100005];\n long long ncrmodm(long long n, long long r, long long m) {\n   return (fact[n] * (modInverse(fact[n - r]) * modInverse(fact[r])) % m) % m;\n }\n void init_fact() {\n   fact[0] = 0;\n   for (long long i = 1; i < 100001; i++) fact[i] = fact[i - 1] * i;\n }\n void write(long long a[], long long n) {\n   for (long long i = 0; i < n; i++) cout << a[i] << ' ';\n   cout << endl;\n }\n void show(vector<long long> v) {\n   for (long long i = 0; i < v.size(); i++) cout << v[i] << ' ';\n   cout << endl;\n }\n vector<vector<long long> > vec;\n vector<long long> visited;\n void dfs(int x, int p = -1) {\n   visited[x] = 1;\n   for (int i = 0; i < vec[x].size(); i++) {\n     if (p == vec[x][i]) continue;\n     if (!visited[vec[x][i]]) {\n       visited[vec[x][i]] = 1;\n       dfs(vec[x][i], x);\n     }\n   }\n }\n bool prime[100000];\n void seive() {\n   int n = 100000;\n   memset(prime, true, sizeof(prime));\n   for (int p = 2; p * p <= n; p++) {\n     if (prime[p] == true) {\n       for (int i = p * p; i <= n; i += p) prime[i] = false;\n     }\n   }\n }\n void solve() {\n   long long n, k;\n   cin >> n >> k;\n   long long a[n];\n   long long ma = -INT_MAX, mi = INT_MAX;\n   for (long long i = 0; i < n; i++) {\n     cin >> a[i];\n     ma = max(ma, a[i]);\n     mi = min(mi, a[i]);\n   }\n   if (k % 2) {\n     for (long long i = 0; i < n; i++) {\n       cout << ma - a[i] << ' ';\n     }\n     cout << endl;\n   } else {\n     for (long long i = 0; i < n; i++) {\n       cout << -mi + a[i] << ' ';\n     }\n     cout << endl;\n   }\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int t = 1;\n   cin >> t;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void extgcd(long long a, long long b, long long& x, long long& y) {\n   if (b == 0) {\n     assert(a == 1);\n     x = 1, y = 0;\n     return;\n   }\n   extgcd(b, a % b, y, x);\n   y -= a / b * x;\n }\n int inv(int a, int c) {\n   long long x, y;\n   extgcd(a, c, x, y);\n   return (x % c + c) % c;\n }\n long long modpow(long long a, int b, int c) {\n   long long res = 1;\n   for (; b; b >>= 1) {\n     if (b & 1) res = res * a % c;\n     a = a * a % c;\n   }\n   return res;\n }\n const int MAXN = 100005, MAXT = 262150;\n int num[10], tot, n, m, Q, tn;\n struct Value {\n   int cnt[10];\n   long long rest;\n   void clear() {\n     memset(cnt, 0, sizeof(cnt));\n     rest = 1;\n   }\n   Value() { clear(); }\n   Value& operator*=(int x) {\n     for (int i = 0; i < tot; i++)\n       while (x % num[i] == 0) x /= num[i], ++cnt[i];\n     rest = rest * x % m;\n     return *this;\n   }\n   Value& operator/=(int x) {\n     for (int i = 0; i < tot; i++)\n       while (x % num[i] == 0) x /= num[i], --cnt[i];\n     rest = rest * inv(x, m) % m;\n     return *this;\n   }\n   Value& operator*=(const Value& v) {\n     for (int i = 0; i < tot; i++) cnt[i] += v.cnt[i];\n     rest = rest * v.rest % m;\n     return *this;\n   }\n   long long get_val() {\n     long long res = rest;\n     for (int i = 0; i < tot; i++) res = res * modpow(num[i], cnt[i], m) % m;\n     return res;\n   }\n } tag[MAXT];\n long long sum[MAXT];\n void build(int l = 1, int r = tn, int k = 1) {\n   if (l == r) return;\n   int mid = (l + r) >> 1;\n   build(l, mid, k << 1);\n   build(mid + 1, r, k << 1 | 1);\n   sum[k] = (sum[k << 1] + sum[k << 1 | 1]) % m;\n }\n void pushdown(int k) {\n   int flag = 1;\n   for (int i = 0; i < tot; i++)\n     if (tag[k].cnt[i]) {\n       flag = 0;\n       break;\n     }\n   if (flag && tag[k].rest == 1) return;\n   int ls = k << 1, rs = k << 1 | 1;\n   tag[ls] *= tag[k], tag[rs] *= tag[k];\n   long long v = tag[k].get_val();\n   (sum[ls] *= v) %= m, (sum[rs] *= v) %= m;\n   tag[k].clear();\n }\n void mul(int a, int b, int x, int l = 1, int r = tn, int k = 1) {\n   if (a > r || b < l) return;\n   if (a <= l && b >= r) {\n     tag[k] *= x, (sum[k] *= x) %= m;\n     return;\n   }\n   pushdown(k);\n   int mid = (l + r) >> 1;\n   mul(a, b, x, l, mid, k << 1);\n   mul(a, b, x, mid + 1, r, k << 1 | 1);\n   sum[k] = (sum[k << 1] + sum[k << 1 | 1]) % m;\n }\n void divi(int a, int x, int l = 1, int r = tn, int k = 1) {\n   if (l == r) {\n     tag[k] /= x;\n     sum[k] = tag[k].get_val();\n     return;\n   }\n   int mid = (l + r) >> 1;\n   pushdown(k);\n   if (a <= mid)\n     divi(a, x, l, mid, k << 1);\n   else\n     divi(a, x, mid + 1, r, k << 1 | 1);\n   sum[k] = (sum[k << 1] + sum[k << 1 | 1]) % m;\n }\n int query(int a, int b, int l = 1, int r = tn, int k = 1) {\n   if (a > r || b < l) return 0;\n   if (a <= l && b >= r) return sum[k];\n   pushdown(k);\n   int mid = (l + r) >> 1;\n   return (query(a, b, l, mid, k << 1) + query(a, b, mid + 1, r, k << 1 | 1)) %\n          m;\n }\n void pre() {\n   int kk = m;\n   for (int i = 2; i * i <= kk; i++)\n     if (kk % i == 0) {\n       while (kk % i == 0) kk /= i;\n       num[tot++] = i;\n     }\n   if (kk > 1) num[tot++] = kk;\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   pre();\n   for (tn = 1; tn < n; tn <<= 1)\n     ;\n   for (int i = 1; i <= n; i++) {\n     scanf('%lld', &sum[i + tn - 1]);\n     tag[i + tn - 1] *= sum[i + tn - 1];\n     sum[i + tn - 1] %= m;\n   }\n   build();\n   scanf('%d', &Q);\n   while (Q--) {\n     int a, b, c, d;\n     scanf('%d%d%d', &a, &b, &c);\n     if (a == 1) {\n       scanf('%d', &d);\n       mul(b, c, d);\n     } else if (a == 2)\n       divi(b, c);\n     else\n       printf('%d\n', query(b, c));\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double PI = acos(-1);\n const double eps = 1e-9;\n const int inf = 2000000000;\n const long long infLL = 9000000000000000000;\n inline bool checkBit(long long n, int i) { return n & (1LL << i); }\n inline long long setBit(long long n, int i) { return n | (1LL << i); }\n inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }\n int dx4[] = {0, 0, +1, -1};\n int dy4[] = {+1, -1, 0, 0};\n int dx8[] = {+1, 0, -1, 0, +1, +1, -1, -1};\n int dy8[] = {0, +1, 0, -1, +1, -1, +1, -1};\n inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }\n inline bool isLeapYear(long long year) {\n   return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);\n }\n inline bool isIntege(double num) { return (num == (int)num); }\n inline bool collinear(int x1, int y1, int x2, int y2, int x3, int y3) {\n   return (y1 - y2) * (x1 - x3) == (y1 - y3) * (x1 - x2);\n }\n inline double coDist(double x1, double y1, double x2, double y2) {\n   return sqrt(((x1 - x2) * (x1 - x2)) + ((y1 - y2) * (y1 - y2)));\n }\n inline double TriangleAreaWithSide(double a, double b, double c) {\n   double s = (a + b + c) / 2;\n   double area = sqrt(s * (s - a) * (s - b) * (s - c));\n   return area;\n }\n inline double area3(double x1, double y1, double x2, double y2, double x3,\n                     double y3) {\n   double A = abs((x1 * y2 + x2 * y3 + x3 * y1) - (y1 * x2 + y2 * x3 + y3 * x1));\n   A /= 2.0;\n   return A;\n }\n inline long double degreetoradian(long double x) {\n   long double val = PI * x;\n   val /= (180.0);\n   return val;\n }\n inline void normal(long long &a) {\n   a %= 1000000007;\n   (a < 0) && (a += 1000000007);\n }\n template <typename T>\n inline T gcd(T a, T b) {\n   T c;\n   while (b) {\n     c = b;\n     b = a % b;\n     a = c;\n   }\n   return a;\n }\n inline long long modMul(long long a, long long b) {\n   a %= 1000000007, b %= 1000000007;\n   normal(a), normal(b);\n   return (a * b) % 1000000007;\n }\n inline long long modAdd(long long a, long long b) {\n   a %= 1000000007, b %= 1000000007;\n   normal(a), normal(b);\n   return (a + b) % 1000000007;\n }\n inline long long modSub(long long a, long long b) {\n   a %= 1000000007, b %= 1000000007;\n   normal(a), normal(b);\n   a -= b;\n   normal(a);\n   return a;\n }\n inline long long modPow(long long b, long long p) {\n   long long r = 1;\n   while (p) {\n     if (p & 1) r = modMul(r, b);\n     b = modMul(b, b);\n     p >>= 1;\n   }\n   return r;\n }\n inline long long modInverse(long long a) { return modPow(a, 1000000007 - 2); }\n inline long long modDiv(long long a, long long b) {\n   return modMul(a, modInverse(b));\n }\n inline bool equalTo(double a, double b) {\n   if (fabs(a - b) <= eps)\n     return true;\n   else\n     return false;\n }\n inline bool notEqual(double a, double b) {\n   if (fabs(a - b) > eps)\n     return true;\n   else\n     return false;\n }\n inline bool lessThan(double a, double b) {\n   if (a + eps < b)\n     return true;\n   else\n     return false;\n }\n inline bool lessThanEqual(double a, double b) {\n   if (a < b + eps)\n     return true;\n   else\n     return false;\n }\n inline bool greaterThan(double a, double b) {\n   if (a > b + eps)\n     return true;\n   else\n     return false;\n }\n inline bool greaterThanEqual(double a, double b) {\n   if (a + eps > b)\n     return true;\n   else\n     return false;\n }\n inline string to_s(int t) {\n   stringstream ss;\n   ss << t;\n   return ss.str();\n }\n struct edge {\n   int p, q, w;\n };\n bool cmp(edge &a, edge &b) { return a.w < b.w; }\n template <typename first, typename second>\n ostream &operator<<(ostream &os, const pair<first, second> &p) {\n   return os << '(' << p.first << ', ' << p.second << ')';\n }\n template <typename T>\n ostream &operator<<(ostream &os, const vector<T> &v) {\n   os << '{';\n   for (auto it = v.begin(); it != v.end(); ++it) {\n     if (it != v.begin()) os << ', ';\n     os << *it;\n   }\n   return os << '}';\n }\n template <typename T>\n ostream &operator<<(ostream &os, const set<T> &v) {\n   os << '[';\n   for (auto it = v.begin(); it != v.end(); ++it) {\n     if (it != v.begin()) os << ', ';\n     os << *it;\n   }\n   return os << ']';\n }\n template <typename T>\n ostream &operator<<(ostream &os, const multiset<T> &v) {\n   os << '[';\n   for (auto it = v.begin(); it != v.end(); ++it) {\n     if (it != v.begin()) os << ', ';\n     os << *it;\n   }\n   return os << ']';\n }\n template <typename first, typename second>\n ostream &operator<<(ostream &os, const map<first, second> &v) {\n   os << '[';\n   for (auto it = v.begin(); it != v.end(); ++it) {\n     if (it != v.begin()) os << ', ';\n     os << it->first << ' = ' << it->second;\n   }\n   return os << ']';\n }\n clock_t tStart = clock();\n void faltu() { cerr << '\n'; }\n template <typename T>\n void faltu(T a[], int n) {\n   for (int i = 0; i < n; ++i) cerr << a[i] << ' ';\n   cerr << '\n';\n }\n template <typename T, typename... hello>\n void faltu(T arg, const hello &...rest) {\n   cerr << arg << ' ';\n   faltu(rest...);\n }\n const int mx = 1e5 + 5;\n bool cnt[mx];\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   int n, k;\n   cin >> n >> k;\n   long long g;\n   cin >> g;\n   for (int i = 1; i < n; i++) {\n     long long x;\n     cin >> x;\n     g = gcd(x, g);\n   }\n   vector<long long> st;\n   for (long long i = 0, j = 0; i < k; i++, j += g) {\n     int z = j % k;\n     if (!cnt[z]) st.emplace_back(z), cnt[z] = 1;\n   }\n   cout << st.size() << '\n';\n   for (int i = 0; i < k; i++) {\n     if (cnt[i]) cout << i << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1 << 18;\n const int MOD = 2013265921, MAX = MOD / 2;\n const int gen = 440564289;\n long long power(long long x, int n) {\n   if (n <= 1) return n ? x : 1LL;\n   long long t = power(x, n / 2);\n   if (n & 1)\n     return (t * t % MOD) * x % MOD;\n   else\n     return t * t % MOD;\n }\n long long tmp[maxn];\n void DFT(long long *a, long long x, int n) {\n   if (n == 1) {\n     a[0] %= MOD;\n     if (a[0] < 0) a[0] += MOD;\n     return;\n   }\n   for (int i = 0; i < n; i++) tmp[i] = a[i];\n   for (int i = 0; i < n; i++) a[i % 2 ? n / 2 + i / 2 : i / 2] = tmp[i];\n   long long *a1 = a, *a2 = a + n / 2, xx = x * x % MOD;\n   DFT(a1, xx, n / 2);\n   DFT(a2, xx, n / 2);\n   long long now = 1;\n   for (int i = 0; i < n / 2; i++, now = now * x % MOD) {\n     long long val = now * a2[i] % MOD;\n     tmp[i] = a1[i] + val - MOD;\n     tmp[i + n / 2] = a1[i] - val;\n   }\n   for (int i = 0; i < n; i++) a[i] = (tmp[i] < 0 ? tmp[i] + MOD : tmp[i]);\n }\n void mul(long long *a, long long *b, long long *c, int n) {\n   long long x = power(gen, (1 << 27) / n), xinv = power(x, n - 1);\n   long long ninv = power(n, MOD - 2);\n   DFT(a, x, n);\n   DFT(b, x, n);\n   for (int i = 0; i < n; i++) c[i] = a[i] * b[i] % MOD;\n   DFT(c, xinv, n);\n   for (int i = 0; i < n; i++) {\n     c[i] = c[i] * ninv % MOD;\n     if (c[i] > MAX) c[i] -= MOD;\n   }\n }\n int n, m, Q, L;\n char s[maxn], t[maxn];\n unsigned long long sbit[maxn], tbit[maxn];\n int match(int x, int y, int len) {\n   int ret = 0;\n   for (; len >= 64; len -= 64, x += 64, y += 64)\n     ret += __builtin_popcountll(sbit[x] ^ tbit[y]);\n   if (len)\n     ret +=\n         __builtin_popcountll((sbit[x] << (64 - len)) ^ (tbit[y] << (64 - len)));\n   return ret;\n }\n long long *poly[maxn], a[maxn], b[maxn];\n void precal() {\n   n = strlen(s), m = strlen(t);\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < 64 && i + j < n; j++)\n       if (s[i + j] == '1') sbit[i] |= (1ULL << j);\n   for (int i = 0; i < m; i++)\n     for (int j = 0; j < 64 && i + j < m; j++)\n       if (t[i + j] == '1') tbit[i] |= (1ULL << j);\n   L = n * sqrt(150 * log2(n) / Q);\n   int n2 = 1;\n   while (n2 < L + m) n2 *= 2;\n   for (int i = 0; i < n; i += L) {\n     poly[i / L] = new long long[n2];\n     memset(a, 0, sizeof(a));\n     memset(b, 0, sizeof(b));\n     for (int j = 0; j < L && i + j < n; j++) a[j] = (s[i + j] == '0' ? -1 : 1);\n     for (int j = 0; j < m; j++) b[m - 1 - j] = (t[j] == '0' ? -1 : 1);\n     mul(a, b, poly[i / L], n2);\n   }\n }\n int main() {\n   scanf('%s%s%d', s, t, &Q);\n   precal();\n   while (Q--) {\n     int x, y, l;\n     scanf('%d%d%d', &x, &y, &l);\n     if (l <= L) {\n       printf('%d\n', match(x, y, l));\n       continue;\n     }\n     int ans = 0;\n     if (x % L) {\n       int l2 = L - x % L;\n       ans += match(x, y, l2);\n       x += l2;\n       y += l2;\n       l -= l2;\n     }\n     if ((x + l) % L) {\n       int l2 = (x + l - 1) % L + 1;\n       ans += match(x + l - l2, y + l - l2, l2);\n       l -= l2;\n     }\n     if (!l) {\n       printf('%d\n', ans);\n       continue;\n     }\n     for (int i = x, j = y; l; i += L, j += L, l -= L)\n       ans += (L - poly[i / L][m - 1 - j]) / 2;\n     printf('%d\n', ans);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int arr[503][503];\n int main() {\n   int n, k;\n   cin >> n >> k;\n   int p = 1;\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j < k; j++) {\n       arr[i][j] = p++;\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = k; j <= n; j++) {\n       arr[i][j] = p++;\n     }\n   }\n   int sum = 0;\n   for (int i = 1; i <= n; i++) {\n     sum += arr[i][k];\n   }\n   cout << sum << endl;\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= n; j++) {\n       cout << arr[i][j] << ' ';\n     }\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T, typename U>\n std::istream& operator>>(std::istream& i, pair<T, U>& p) {\n   i >> p.first >> p.second;\n   return i;\n }\n template <typename T>\n std::istream& operator>>(std::istream& i, vector<T>& t) {\n   for (auto& v : t) {\n     i >> v;\n   }\n   return i;\n }\n template <typename T, typename U>\n std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) {\n   o << p.first << ' ' << p.second;\n   return o;\n }\n template <typename T>\n std::ostream& operator<<(std::ostream& o, const vector<T>& t) {\n   if (t.empty()) o << '\n';\n   for (size_t i = 0; i < t.size(); ++i) {\n     o << t[i] << ' \n'[i == t.size() - 1];\n   }\n   return o;\n }\n template <typename T>\n using minheap = priority_queue<T, vector<T>, greater<T>>;\n template <typename T>\n using maxheap = priority_queue<T, vector<T>, less<T>>;\n template <typename T>\n bool in(T a, T b, T c) {\n   return a <= b && b < c;\n }\n unsigned int logceil(int first) {\n   return 8 * sizeof(int) - __builtin_clz(first);\n }\n namespace std {\n template <typename T, typename U>\n struct hash<pair<T, U>> {\n   hash<T> t;\n   hash<U> u;\n   size_t operator()(const pair<T, U>& p) const {\n     return t(p.first) ^ (u(p.second) << 7);\n   }\n };\n }  // namespace std\n template <typename T, typename F>\n T bsh(T l, T h, const F& f) {\n   T r = -1, m;\n   while (l <= h) {\n     m = (l + h) / 2;\n     if (f(m)) {\n       l = m + 1;\n       r = m;\n     } else {\n       h = m - 1;\n     }\n   }\n   return r;\n }\n template <typename F>\n double bshd(double l, double h, const F& f, double p = 1e-9) {\n   unsigned int r = 3 + (unsigned int)log2((h - l) / p);\n   while (r--) {\n     double m = (l + h) / 2;\n     if (f(m)) {\n       l = m;\n     } else {\n       h = m;\n     }\n   }\n   return (l + h) / 2;\n }\n template <typename T, typename F>\n T bsl(T l, T h, const F& f) {\n   T r = -1, m;\n   while (l <= h) {\n     m = (l + h) / 2;\n     if (f(m)) {\n       h = m - 1;\n       r = m;\n     } else {\n       l = m + 1;\n     }\n   }\n   return r;\n }\n template <typename F>\n double bsld(double l, double h, const F& f, double p = 1e-9) {\n   unsigned int r = 3 + (unsigned int)log2((h - l) / p);\n   while (r--) {\n     double m = (l + h) / 2;\n     if (f(m)) {\n       h = m;\n     } else {\n       l = m;\n     }\n   }\n   return (l + h) / 2;\n }\n template <typename T>\n T gcd(T a, T b) {\n   if (a < b) swap(a, b);\n   return b ? gcd(b, a % b) : a;\n }\n template <typename T>\n class vector2 : public vector<vector<T>> {\n  public:\n   vector2() {}\n   vector2(size_t a, size_t b, T t = T())\n       : vector<vector<T>>(a, vector<T>(b, t)) {}\n };\n template <typename T>\n class vector3 : public vector<vector2<T>> {\n  public:\n   vector3() {}\n   vector3(size_t a, size_t b, size_t c, T t = T())\n       : vector<vector2<T>>(a, vector2<T>(b, c, t)) {}\n };\n template <typename T>\n class vector4 : public vector<vector3<T>> {\n  public:\n   vector4() {}\n   vector4(size_t a, size_t b, size_t c, size_t d, T t = T())\n       : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {}\n };\n template <typename T>\n class vector5 : public vector<vector4<T>> {\n  public:\n   vector5() {}\n   vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T())\n       : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {}\n };\n class vowels {\n  public:\n   void solve(istream& cin, ostream& cout) {\n     int N;\n     cin >> N;\n     vector<int> D(1 << 24, 0);\n     for (int i = 0; i < N; ++i) {\n       string S;\n       cin >> S;\n       int u = 0;\n       for (char c : S) u |= (1 << (c - 'a'));\n       u ^= (1 << 24) - 1;\n       D[u]++;\n     }\n     for (int i = 0; i < 24; ++i) {\n       for (int j = 0; j < (1 << 24); ++j) {\n         if (j & (1 << i)) D[j ^ (1 << i)] += D[j];\n       }\n     }\n     int ans = 0;\n     for (int i = 0; i < (1 << 24); ++i) {\n       ans ^= (N - D[i]) * (N - D[i]);\n     }\n     cout << ans << endl;\n   }\n };\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   vowels solver;\n   std::istream& in(std::cin);\n   std::ostream& out(std::cout);\n   solver.solve(in, out);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 310, INF = (1 << 27);\n int d[MAXN][MAXN];\n int all[20][MAXN][MAXN];\n int ans[MAXN][MAXN];\n int main() {\n   ios::sync_with_stdio(false);\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < n; j++) d[i][j] = INF;\n   for (int i = 0; i < n; i++) d[i][i] = 0;\n   for (int i = 0; i < m; i++) {\n     int x, y, w1, w2;\n     cin >> x >> y >> w1 >> w2;\n     x--;\n     y--;\n     w1 = -w1;\n     w2 = -w2;\n     d[x][y] = w1;\n     d[y][x] = w2;\n   }\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < n; j++) all[0][i][j] = ans[i][j] = d[i][j];\n   for (int k = 0; k < n; k++)\n     for (int i = 0; i < n; i++)\n       for (int j = 0; j < n; j++) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);\n   bool hasNeg = false;\n   for (int i = 0; i < n; i++)\n     if (d[i][i] < 0) hasNeg = true;\n   if (!hasNeg) {\n     cout << 0 << endl;\n     return 0;\n   }\n   int ind;\n   for (ind = 1; (1 << ind) < n; ind++) {\n     for (int i = 0; i < n; i++)\n       for (int j = 0; j < n; j++) {\n         all[ind][i][j] = INF;\n         for (int k = 0; k < n; k++)\n           all[ind][i][j] =\n               min(all[ind][i][j], all[ind - 1][i][k] + all[ind - 1][k][j]);\n       }\n   }\n   ind--;\n   int length = 1;\n   while (ind >= 0) {\n     int tmp[MAXN][MAXN];\n     for (int i = 0; i < n; i++)\n       for (int j = 0; j < n; j++) {\n         tmp[i][j] = INF;\n         for (int k = 0; k < n; k++)\n           tmp[i][j] = min(tmp[i][j], ans[i][k] + all[ind][k][j]);\n       }\n     hasNeg = false;\n     for (int i = 0; i < n; i++)\n       if (tmp[i][i] < 0) hasNeg = true;\n     if (!hasNeg) {\n       for (int i = 0; i < n; i++)\n         for (int j = 0; j < n; j++) ans[i][j] = tmp[i][j];\n       length += (1 << ind);\n     }\n     ind--;\n   }\n   cout << length + 1 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 2e6 + 7;\n const int mod = 51123987;\n const int inv2 = mod + 1 >> 1;\n struct Edge {\n   int to, last, v;\n } E[maxn];\n int fa[maxn];\n int len[maxn];\n int dep[maxn];\n int head[maxn];\n int tot;\n int last;\n int cnt;\n int n;\n char s[maxn];\n int pre[maxn];\n long long suf[maxn];\n void Init() {\n   for (int i = 0; i <= tot; ++i) {\n     fa[i] = len[i] = dep[i] = 0;\n     head[i] = 0;\n   }\n   cnt = 0;\n   fa[last = 0] = fa[tot = 1] = 1;\n   len[1] = -1;\n }\n int Getfail(int x, int ed) {\n   while (s[ed] ^ s[ed - len[x] - 1]) x = fa[x];\n   return x;\n }\n int Check(int x, int v) {\n   for (int i = head[x], y; y = E[i].to, i; i = E[i].last)\n     if (E[i].v == v) return E[i].to;\n   return 0;\n }\n void Adde(int x, int y, int z) {\n   E[++cnt] = (Edge){y, head[x], z};\n   head[x] = cnt;\n }\n void Extend(int x, int ed) {\n   int p = Getfail(last, ed);\n   int np = Check(p, x);\n   if (!np) {\n     np = ++tot;\n     int pp = Getfail(fa[p], ed);\n     fa[np] = Check(pp, x);\n     Adde(p, np, x);\n     len[np] = len[p] + 2;\n     dep[np] = dep[fa[np]] + 1;\n   }\n   last = np;\n }\n int main() {\n   Init();\n   scanf('%d', &n);\n   scanf('%s', s + 1);\n   for (int i = 1; i <= n; ++i) Extend(s[i] - 'a', i), pre[i] = dep[last];\n   Init();\n   reverse(s + 1, s + n + 1);\n   for (int i = 1; i <= n; ++i)\n     Extend(s[i] - 'a', i), suf[n - i + 1] = dep[last];\n   for (int i = n; i; --i) suf[i] += suf[i + 1], suf[i] %= mod;\n   int ans = 0;\n   for (int i = 1; i <= n; ++i) (ans += 1LL * pre[i] * suf[i + 1] % mod) %= mod;\n   int sum = 1LL * suf[1] * (suf[1] - 1) / 2 % mod;\n   ans = (sum - ans) % mod;\n   ans < 0 ? ans += mod : 0;\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool vis[200005];\n vector<int> v[200005], ak, d1, dn;\n vector<int> bfs(int n) {\n   queue<int> q;\n   vector<int> dis(200005);\n   q.push(n);\n   vis[n] = true;\n   dis[n] = 0;\n   while (!q.empty()) {\n     int x = q.front();\n     q.pop();\n     for (int i = 0; i < v[x].size(); i++) {\n       int u = v[x][i];\n       if (vis[u] == false) {\n         vis[u] = true;\n         dis[u] = dis[x] + 1;\n         q.push(u);\n       }\n     }\n   }\n   return dis;\n }\n bool cmp(int x, int y) { return d1[x] < d1[y]; }\n int main() {\n   int n, m, k, n1, n2, sp, ans = 0;\n   scanf('%d %d %d', &n, &m, &k);\n   for (int i = 0; i < k; i++) {\n     scanf('%d', &sp);\n     ak.push_back(sp);\n   }\n   for (int i = 0; i < m; i++) {\n     scanf('%d %d', &n1, &n2);\n     v[n1].push_back(n2);\n     v[n2].push_back(n1);\n   }\n   d1 = bfs(1);\n   memset(vis, false, sizeof(vis));\n   dn = bfs(n);\n   sort(ak.begin(), ak.end(), cmp);\n   for (int i = 1; i < ak.size(); i++) {\n     int x = ak[i - 1];\n     int y = ak[i];\n     ans = max(ans, d1[x] + 1 + dn[y]);\n   }\n   ans = min(ans, d1[n]);\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX_N = 1050;\n pair<int, int> a[MAX_N];\n int cnt[MAX_N];\n int sub[MAX_N];\n map<int, int> ids;\n int inds[MAX_N];\n int id = 0;\n int countplz(int f0, int f1) {\n   memset((sub), 0, sizeof(sub));\n   ++sub[a[f0].second];\n   ++sub[a[f1].second];\n   int ans = 2;\n   while (true) {\n     int fnval = a[f0].first + a[f1].first;\n     auto it = ids.find(fnval);\n     if (it == ids.end()) {\n       return ans;\n     }\n     int fnid = it->second;\n     int fn = inds[fnid];\n     int rest = cnt[fnid] - sub[fnid];\n     if (rest <= 0) {\n       return ans;\n     }\n     ++ans;\n     sub[fnid]++;\n     f0 = f1;\n     f1 = fn;\n   }\n }\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; ++i) {\n     int x;\n     cin >> x;\n     if (ids.count(x) == 0) {\n       ids[x] = id;\n       inds[id] = i;\n       ++id;\n     }\n     a[i] = make_pair(x, ids[x]);\n     cnt[ids[x]]++;\n   }\n   int maxs = 2;\n   if (ids.count(0) > 0) {\n     maxs = max(maxs, cnt[ids[0]]);\n   }\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < n; ++j) {\n       if (i == j || (a[i].first == a[j].first && a[i].first == 0)) {\n         continue;\n       }\n       maxs = max(maxs, countplz(i, j));\n     }\n   }\n   cout << maxs << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n class TaskB {\n  public:\n   long long dist(pair<long long, long long> f, pair<long long, long long> s) {\n     return (f.first - s.first) * (f.first - s.first) +\n            (f.second - s.second) * (f.second - s.second);\n   }\n   void solve(std::istream& cin, std::ostream& cout) {\n     ios_base::sync_with_stdio(0);\n     cin.tie(0);\n     cout.tie(0);\n     vector<pair<long long, long long> > v(3);\n     set<pair<long long, long long> > st;\n     for (long long i = 0; i < 3; i++) {\n       cin >> v[i].first >> v[i].second;\n     }\n     vector<pair<long long, long long> > ans;\n     if (1 || dist(v[1], v[2]) <= dist(v[0], v[1]) + dist(v[0], v[2])) {\n       ans.push_back({v[1].first + v[2].first - v[0].first,\n                      v[1].second + v[2].second - v[0].second});\n     }\n     if (1 || dist(v[0], v[2]) <= dist(v[2], v[1]) + dist(v[1], v[0])) {\n       ans.push_back({v[0].first + v[2].first - v[1].first,\n                      v[0].second + v[2].second - v[1].second});\n     }\n     if (1 || dist(v[1], v[0]) <= dist(v[2], v[1]) + dist(v[0], v[2])) {\n       ans.push_back({v[1].first + v[0].first - v[2].first,\n                      v[1].second + v[0].second - v[2].second});\n     }\n     cout << ans.size() << endl;\n     for (long long i = 0; i < ans.size(); i++)\n       cout << ans[i].first << ' ' << ans[i].second << endl;\n   }\n };\n int main() {\n   TaskB solver;\n   std::istream& in(std::cin);\n   std::ostream& out(std::cout);\n   solver.solve(in, out);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n string a, b;\n set<int> A, B;\n queue<int> qA, qB;\n map<char, queue<int> > q;\n vector<pair<int, int> > resp;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cin >> n >> a >> b;\n   for (int i = 0; i < n; ++i) {\n     if (a[i] == '?')\n       qA.push(i);\n     else {\n       q[a[i]].push(i);\n       A.insert(i);\n     }\n   }\n   for (int i = 0; i < n; ++i) {\n     if (b[i] == '?')\n       qB.push(i);\n     else\n       B.insert(i);\n   }\n   for (int i = 0; i < n; ++i) {\n     if (!q[b[i]].empty()) {\n       resp.push_back({q[b[i]].front(), i});\n       B.erase(i);\n       A.erase(q[b[i]].front());\n       q[b[i]].pop();\n     }\n   }\n   while (!qA.empty() && !B.empty()) {\n     auto it = B.begin();\n     resp.push_back({qA.front(), *it});\n     qA.pop();\n     B.erase(it);\n   }\n   while (!qB.empty() && !A.empty()) {\n     auto it = A.begin();\n     resp.push_back({*it, qB.front()});\n     qB.pop();\n     A.erase(it);\n   }\n   while (!qA.empty() && !qB.empty()) {\n     resp.push_back({qA.front(), qB.front()});\n     qA.pop();\n     qB.pop();\n   }\n   cout << (int)resp.size() << '\n';\n   for (auto x : resp) cout << x.first + 1 << ' ' << x.second + 1 << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(0);\n   int n;\n   double p[111];\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> p[i];\n   sort(p, p + n);\n   double ans = p[n - 1], notAns = 1 - p[n - 1];\n   for (int i = n - 2; i >= 0 && ans < notAns; i--) {\n     ans = ans * (1 - p[i]) + notAns * p[i];\n     notAns *= (1 - p[i]);\n   }\n   printf('%.12lf\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long inf = 1e18;\n long long first, T, mt;\n long long t[2], p[2], a[2];\n long long get(long long ile, long long czas) {\n   if (ile == 0) {\n     return 0;\n   }\n   if (min(ile * mt, ile * t[1]) > czas) {\n     return inf;\n   }\n   if (ile * mt <= czas) {\n     return 0;\n   }\n   long long st = 0, en = ile, mid = (st + en) / 2, res = inf;\n   while (st <= en) {\n     long long il = min(ile, mid * a[1]);\n     if (il * t[1] + (ile - il) * mt <= czas) {\n       res = min(res, mid);\n       en = mid - 1;\n     } else {\n       st = mid + 1;\n     }\n     mid = (st + en) / 2;\n   }\n   return res * p[1];\n }\n int main() {\n   scanf('%lld%lld%lld', &first, &T, &mt);\n   for (int i = 0; i < 2; i++) {\n     scanf('%lld%lld%lld', a + i, t + i, p + i);\n   }\n   if (t[0] > t[1]) {\n     swap(a[0], a[1]);\n     swap(t[0], t[1]);\n     swap(p[0], p[1]);\n   }\n   if (min(mt, t[0]) * first > T) {\n     printf('-1\n');\n     return 0;\n   }\n   if (mt * first <= T) {\n     printf('0\n');\n     return 0;\n   }\n   long long res = inf;\n   for (long long i = 0; (i - 1) * a[0] * t[0] + 1 <= T; i++) {\n     long long ile = min(first, a[0] * i);\n     long long cena = i * p[0] + get(first - ile, T - ile * t[0]);\n     res = min(res, cena);\n   }\n   printf('%lld\n', res);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t, T, i, n, k, d, ans, val;\n   cin >> T;\n   vector<int> id(pow(10, 6) + 1, 0);\n   for (t = 0; t < T; t++) {\n     cin >> n >> k >> d;\n     vector<int> v(n);\n     for (i = 0; i < n; i++) cin >> v[i];\n     ans = n;\n     val = 0;\n     for (i = 0; i < d; i++) {\n       id[v[i]]++;\n       if (id[v[i]] == 1) val++;\n     }\n     ans = val;\n     for (i = d; i < n; i++) {\n       id[v[i - d]]--;\n       if (id[v[i - d]] == 0) val--;\n       id[v[i]]++;\n       if (id[v[i]] == 1) val++;\n       ans = min(val, ans);\n     }\n     for (i = n - d; i < n; i++) id[v[i]] = 0;\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<treenode> tree1[4 * 111111], tree2[4 * 111111], *tree;\n set<pair<int, int> > seg;\n void mergetrees(vector<treenode> &v1, vector<treenode> &v2,\n                 vector<treenode> &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<treenode> &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 <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n using ld = long double;\n using ii = pair<ll, ll>;\n using vi = vector<ll>;\n using vb = vector<bool>;\n using vvi = vector<vi>;\n using vii = vector<ii>;\n using vvii = vector<vii>;\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<Line> lines;\n   static constexpr ld MAX = std::numeric_limits<ld>::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<Line>::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<ld> solve(vii &pairs, int s) {\n   vector<ld> 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<ld> 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 <bits/stdc++.h>\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<vector<int>> 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<int> go;\n   queue<int> 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<int> 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 <bits/stdc++.h>\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<int, int> mp;\n   q[0] = u;\n   while (ql < qr) {\n     int v = q[ql++];\n     vis[v] = true;\n     map<int, int>::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<int, int>::iterator it = mp.find(key);\n     if (it != mp.end()) {\n       ;\n       ret += it->second;\n     }\n   }\n   return ret;\n }\n void dfs(int u) {\n   vis[u] = true;\n   for (edge* p = g[u]; p; p = p->next)\n     if (!vis[p->v] && !cut[p->v]) {\n       dep[p->v] = dep[u] + 1;\n       rdigit[p->v] = ((long long)prod[dep[u]] * p->w + rdigit[u]) % ::p;\n       digit[p->v] = (digit[u] * 10LL + p->w) % ::p;\n       dfs(p->v);\n     }\n   vis[u] = false;\n }\n void calc_order(int u) {\n   calc_sum(u);\n   int s = sum[u], ql = 0, qr = 1;\n   q[0] = u;\n   while (ql < qr) {\n     int v = q[ql++];\n     vis[v] = true;\n     mex[v] = max(mex[v], s - sum[v]);\n     if (mex[v] < mex[u]) u = v;\n     for (edge* p = g[v]; p; p = p->next)\n       if (!vis[p->v] && !cut[p->v]) q[qr++] = p->v;\n   }\n   for (int i = 0; i < qr; ++i) vis[q[i]] = false;\n   ord[ordcnt++] = u;\n   cut[u] = true;\n   for (edge* p = g[u]; p; p = p->next)\n     if (!cut[p->v]) calc_order(p->v);\n }\n void calc_sum(int u) {\n   vis[u] = true;\n   mex[u] = 0;\n   sum[u] = 1;\n   for (edge* p = g[u]; p; p = p->next)\n     if (!vis[p->v] && !cut[p->v]) {\n       calc_sum(p->v);\n       sum[u] += sum[p->v];\n       mex[u] = max(mex[u], sum[p->v]);\n     }\n   vis[u] = false;\n }\n void add_edge(int u, int v, int w) {\n   static edge pool[N * 2];\n   static edge* p = pool;\n   ++p;\n   p->v = v;\n   p->w = w;\n   p->next = g[u];\n   g[u] = p;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n  \n #define fastIO ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);\n #define endl '\n'\n #define lli long long int\n #define ld long double\n #define p_b push_back\n #define m_p make_pair\n #define fs first\n #define sc second\n #define sz(x) ((lli)x.size())\n #define all(x) x.begin(),x.end()\n const lli mod = 1e9 + 7;\n const lli N = 1e6 + 5;\n /*****************************************************/\n lli t,n,m,a[N]={0},target;\n bool dp[105][200005],vis[105][200005];\n lli F(lli idx,lli ss)\n {\n     if(vis[idx][ss])\n         return dp[idx][ss];\n     vis[idx][ss]=true;\n     if(idx>n)\n     {\n         if(ss==target)\n             return dp[idx][ss]=true;\n         return dp[idx][ss]=false;\n     }\n     bool ret=F(idx+1,ss),ret1=F(idx+1,ss+a[idx]);\n     if(ret || ret1)\n         return dp[idx][ss]=true;\n     return dp[idx][ss]=false;\n }\n int main()\n {\n     fastIO\n     lli i,j,k,x,y;\n     lli ss=0;\n     cin>>n;\n     for(i=1;i<=n;i++)\n     {\n         cin>>a[i];\n         ss+=a[i];\n     }\n     if(ss%2!=0)\n     {\n         cout<<'0';\n         return 0;\n     }\n     target=ss/2;\n     memset(vis,false,sizeof vis);\n     memset(dp,false,sizeof dp);\n     if(F(1,0)==false)\n     {\n         cout<<'0';\n         return 0;\n     }\n     while(1)\n     {\n         for(i=1;i<=n;i++)\n         {\n             if(a[i]%2!=0)\n             {\n                 cout<<'1\n'<<i;\n                 return 0;\n             }\n             a[i]/=2;\n         } \n     }\n     \n     // cerr<< '\n' << 'Time elapsed :' << clock() * 1000.0 / CLOCKS_PER_SEC << ' ms\n' ;\n     return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int iinf = 1e9 + 7;\n const long long linf = 1ll << 60;\n const double dinf = 1e60;\n template <typename T>\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 <typename T1, typename T2>\n void scf(T1 &x, T2 &y) {\n   scf(x);\n   return scf(y);\n }\n template <typename T1, typename T2, typename T3>\n void scf(T1 &x, T2 &y, T3 &z) {\n   scf(x);\n   scf(y);\n   return scf(z);\n }\n template <typename T1, typename T2, typename T3, typename T4>\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 <typename T>\n void chkmax(T &x, const T &y) {\n   if (y > x) x = y;\n   return;\n }\n template <typename T>\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<int> 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 <bits/stdc++.h>\n using namespace std;\n int n, m;\n long long dis[100010];\n vector<int> mom[100010];\n vector<pair<int, int> > vertex[100010];\n set<int> 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<int>::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 <bits/stdc++.h>\n using namespace std;\n static const int INF = 500000000;\n template <class T>\n void debug(T a, T b) {\n   for (; a != b; ++a) cerr << *a << ' ';\n   cerr << endl;\n }\n int n;\n pair<pair<int, int>, int> es[5005];\n vector<pair<int, int> > 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 <bits/stdc++.h>\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<pair<int, int>> 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 <bits/stdc++.h>\n using namespace std;\n const long long inf = 1000000007;\n long long a[1100][1100];\n long long b[1100][1100];\n long long A(int n, int k);\n long long B(int n, int k);\n long long A(int n, int k) {\n   if (a[n][k] != -1) {\n     return a[n][k];\n   }\n   if (n < k) {\n     return a[n][k] = 0;\n   }\n   if (n == 1) {\n     return a[n][k] = (k == 0);\n   }\n   if (n == 2) {\n     return a[n][k] = (k != 1);\n   }\n   long long ret = A(n - 1, k);\n   ret += A(n - 1, k + 1) * (k + 1) - B(n - 1, k + 1) + B(n - 1, k) -\n          B(n - 1, k + 1) + B(n - 1, k);\n   ret += A(n - 1, k) * (n - 1 - k);\n   ret -= A(n - 1, k) - A(n - 2, k) - B(n - 1, k);\n   if (k > 0) {\n     ret += A(n - 1, k - 1) - A(n - 2, k - 1) - B(n - 1, k - 1);\n   }\n   ret -= A(n - 1, k) - A(n - 2, k) - B(n - 1, k);\n   if (k > 0) {\n     ret += A(n - 1, k - 1) - A(n - 2, k - 1) - B(n - 1, k - 1);\n   }\n   ret -= A(n - 2, k);\n   if (k > 1) {\n     ret += A(n - 2, k - 2);\n   }\n   return a[n][k] = (ret % inf + inf) % inf;\n }\n long long B(int n, int k) {\n   if (b[n][k] != -1) {\n     return b[n][k];\n   }\n   if (n < k) {\n     return (b[n][k] = 0);\n   }\n   if (n == 1) {\n     return b[n][k] = 0;\n   }\n   if (n == 2) {\n     return b[n][k] = (k == 2);\n   }\n   if (k == 0) {\n     return b[n][k] = 0;\n   }\n   if (k == 1) {\n     return b[n][k] =\n                ((A(n - 1, 0) - A(n - 2, 0) + B(n - 1, 1)) % inf + inf) % inf;\n   }\n   return b[n][k] = (A(n - 2, k - 2) + B(n - 1, k) + A(n - 1, k - 1) -\n                     B(n - 1, k - 1) - A(n - 2, k - 1)) %\n                    inf;\n }\n int main() {\n   memset(a, -1, sizeof(a));\n   memset(b, -1, sizeof(b));\n   int n, k;\n   cin >> n >> k;\n   cout << A(n, k) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double eps = 1e-8;\n const double pi = acos(-1.0);\n struct Q {\n   int a, b, c;\n   Q(int a, int b, int c) : a(a), b(b), c(c) {}\n   bool operator<(const Q& o) const {\n     if (a == o.a) return c < o.c;\n     return a < o.a;\n   }\n };\n vector<pair<int, int> > ans;\n set<Q> q;\n int in[100000];\n int main() {\n   int n, i, a, b;\n   scanf('%d', &n);\n   for (i = 0; i < n; ++i) {\n     scanf('%d%d', &a, &b);\n     in[i] = a;\n     if (a) q.insert(Q(a, b, i));\n   }\n   while (!q.empty()) {\n     Q u = *(q.begin());\n     q.erase(q.begin());\n     int cur = u.c;\n     ans.push_back(make_pair(u.b, u.c));\n     in[u.b]--;\n     in[u.c]--;\n     u = *q.lower_bound(Q(in[u.b] + 1, 0, u.b));\n     q.erase(u);\n     u.a--;\n     u.b ^= cur;\n     if (u.a) q.insert(u);\n   }\n   printf('%d\n', ans.size());\n   for (i = 0; i < ans.size(); ++i)\n     printf('%d %d\n', ans[i].first, ans[i].second);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int pos[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\n int n;\n char s[510][510];\n int v[510][510];\n vector<pair<int, int> > vec, ans;\n int operator*(const pair<int, int> &a, const pair<int, int> &b) {\n   return a.first * b.second - a.second * b.first;\n }\n pair<int, int> operator-(const pair<int, int> &a, const pair<int, int> &b) {\n   return make_pair(a.first - b.first, a.second - b.second);\n }\n pair<int, int> stk[250010];\n int main() {\n   while (1) {\n     ans.clear();\n     scanf('%d', &n);\n     if (n == 0) break;\n     for (int i = n; i >= 1; i--) scanf('%s', s[i] + 1);\n     for (int i = 1; i <= n; i++)\n       for (int j = 1; j <= n; j++) v[i][j] = s[i][j] - '0';\n     vec.clear();\n     for (int i = 1; i <= n; i++) {\n       for (int j = 1; j <= n; j++) {\n         int cnt = 0;\n         for (int k = -1; k <= 0; k++) {\n           for (int l = -1; l <= 0; l++) {\n             cnt += v[i + k][j + l];\n           }\n         }\n         if (cnt == 1) {\n           if (v[i][j] == 1)\n             vec.push_back(make_pair(i, j));\n           else if (v[i - 1][j] == 1)\n             vec.push_back(make_pair(i - 2, j));\n           else if (v[i][j - 1] == 1)\n             vec.push_back(make_pair(i, j - 2));\n           else\n             vec.push_back(make_pair(i - 2, j - 2));\n         }\n       }\n     }\n     for (auto &x : vec) swap(x.first, x.second);\n     sort(vec.begin(), vec.end());\n     int top = 0;\n     for (auto &x : vec) {\n       while (top > 1 && (stk[top] - stk[top - 1]) * (x - stk[top]) >= 0) top--;\n       stk[++top] = x;\n     }\n     for (int i = 1; i <= top; i++) ans.push_back(stk[i]);\n     reverse(vec.begin(), vec.end());\n     top = 0;\n     for (auto &x : vec) {\n       while (top > 1 && (stk[top] - stk[top - 1]) * (x - stk[top]) >= 0) top--;\n       stk[++top] = x;\n     }\n     for (int i = 2; i < top; i++) ans.push_back(stk[i]);\n     printf('%d\n', ans.size());\n     for (auto &x : ans) printf('%d %d\n', x.first, x.second);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC target('avx2')\n #pragma GCC optimization('O3')\n #pragma GCC optimization('unroll-loops')\n using namespace std;\n const int mod = 1e9 + 7;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     long long n, m, a, b, i, j;\n     cin >> n;\n     deque<long long> dq, tmp;\n     long long ar[n], ans[n];\n     set<long long> s;\n     for (i = 0; i < n; i++) {\n       cin >> a;\n       ar[a - 1] = i;\n       ans[i] = 0;\n     }\n     a = n, b = 0;\n     for (i = 0; i < n; i++) {\n       a = min(a, ar[i]);\n       b = max(b, ar[i]);\n       if (b - a == i) ans[i] = 1;\n     }\n     for (i = 0; i < n; i++) cout << ans[i];\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, p, b = 0;\n   cin >> n >> p;\n   vector<long long> v;\n   for (int i = 0; i < n; ++i) {\n     string s;\n     cin >> s;\n     if (s == 'half') {\n       v.push_back(0);\n     } else\n       v.push_back(1), b++;\n   }\n   reverse(v.begin(), v.end());\n   long long at = 0;\n   for (int i = 0; i < n; ++i) {\n     at *= 2;\n     at += v[i];\n   }\n   cout << (at * p) - (b * p / 2) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 1005;\n vector<int> v[MAX];\n int dp[105][MAX];\n int main() {\n   ios::sync_with_stdio(false);\n   int n, t;\n   cin >> n >> t;\n   for (int i = 0; i < n; i++) {\n     int t, p;\n     cin >> t >> p;\n     v[t].push_back(p);\n   }\n   for (int i = 0; i < MAX; i++) {\n     sort(v[i].begin(), v[i].end());\n     v[i].push_back(0);\n     reverse(v[i].begin(), v[i].end());\n     for (int j = 1; j < v[i].size(); j++) v[i][j] += v[i][j - 1];\n   }\n   for (int i = 1; i <= t; i++)\n     for (int j = 1; j < MAX; j++)\n       for (int k = 0; k < min((int)v[i].size(), j + 1); k++)\n         dp[i][j] =\n             max(dp[i][j], dp[i - 1][min(MAX - 1, (j - k) * 2)] + v[i][k]);\n   cout << dp[t][1] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long M = 7e2 + 5;\n const long long mod = 1e9 + 7;\n char sz[M];\n long long a[M], js;\n inline long long read() {\n   register long long x = 0, y = 1;\n   register char c = getchar();\n   while (!isdigit(c)) {\n     if (c == '-') y = 0;\n     c = getchar();\n   }\n   while (isdigit(c)) {\n     x = x * 10 + (c ^ 48);\n     c = getchar();\n   }\n   return y ? x : -x;\n }\n long long f[M][M][10];\n long long dfs(long long pos, long long limit, long long sum, long long l) {\n   if (!pos) return !sum % mod;\n   if (!limit && ~f[pos][sum][l]) return f[pos][sum][l] % mod;\n   long long up = limit ? a[pos] : 9;\n   long long cnt = 0;\n   for (long long i = 0; i <= up; i++)\n     cnt = (cnt + dfs(pos - 1, limit && i == up, sum - (i >= l), l)) % mod;\n   if (!limit) f[pos][sum][l] = cnt;\n   return cnt % mod;\n }\n signed main() {\n   scanf('%s', sz + 1);\n   memset(f, -1, sizeof(f));\n   long long len = strlen(sz + 1);\n   for (long long i = 1; i <= len; i++) a[i] = sz[len - i + 1] - '0';\n   a[0] = 0;\n   for (long long i = 1; i <= 9; i++)\n     for (long long j = 1, puz = 1; j <= len;\n          j++, puz = (10ll * puz + 1ll) % mod)\n       js = (js + dfs(len, 1, j, i) * puz % mod) % mod;\n   printf('%lld\n', js);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   int A[n][m], B[n][m], C[n][m];\n   vector<int> a, b;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       cin >> A[i][j];\n       a.push_back(A[i][j]);\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       cin >> B[i][j];\n       b.push_back(B[i][j]);\n     }\n   }\n   sort(a.begin(), a.end());\n   sort(b.begin(), b.end());\n   for (int i = 0; i < a.size(); i++) {\n     if (a[i] != b[i]) {\n       cout << 'NO' << endl;\n       return 0;\n     }\n   }\n   if (n >= m) {\n     for (int i = 0; i < n; i++) {\n       long long x = 0;\n       for (int j = 0; j < min(i + 1, m); j++) {\n         x ^= (long long)(A[i - j][j] ^ B[i - j][j]);\n       }\n       if (x) {\n         cout << 'NO' << endl;\n         return 0;\n       }\n     }\n     for (int i = 0; i < m - 1; i++) {\n       long long x = 0;\n       for (int j = 1; j + i < m; j++) {\n         x ^= (long long)(A[n - j][j + i] ^ B[n - j][j + i]);\n       }\n       if (x) {\n         cout << 'NO' << endl;\n         return 0;\n       }\n     }\n   } else {\n     for (int i = 0; i < m; i++) {\n       long long x = 0;\n       for (int j = 0; j < min(i + 1, n); j++) {\n         x ^= (long long)(A[j][i - j] ^ B[j][i - j]);\n       }\n       if (x) {\n         cout << 'NO' << endl;\n         return 0;\n       }\n     }\n     for (int i = 0; i < n - 1; i++) {\n       long long x = 0;\n       for (int j = 1; j + i < n; j++) {\n         x ^= (long long)(A[j + i][m - j] ^ B[j + i][m - j]);\n       }\n       if (x) {\n         cout << 'NO' << endl;\n         return 0;\n       }\n     }\n   }\n   cout << 'YES' << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, q;\n int x[100100], y[100100];\n bool ans[100100];\n int par[100100], sz[100100];\n int distToPar[100100];\n int getpar(int now) { return (par[now] == now) ? now : getpar(par[now]); }\n bool getdist(int now) {\n   bool ret = (par[now] == now) ? 0 : (getdist(par[now]) ^ distToPar[now]);\n   return ret;\n }\n stack<pair<pair<int, int>, bool> > prevStat;\n map<pair<int, int>, int> mp;\n vector<pair<pair<int, int>, pair<int, int> > > opSeg;\n vector<pair<int, int> > add[400400];\n void addSeg(int tl, int tr, pair<int, int> val, int l, int r, int k) {\n   if (tl > r || l > tr) return;\n   if (tl <= l && r <= tr) {\n     add[k].push_back(val);\n     return;\n   }\n   int mid = (l + r) >> 1;\n   addSeg(tl, tr, val, l, mid, k + k);\n   addSeg(tl, tr, val, mid + 1, r, k + k + 1);\n }\n bool isBipar = 1;\n void addEdge(pair<int, int> now) {\n   int u = now.first, v = now.second;\n   int pu = getpar(u), pv = getpar(v);\n   if (pu == pv) {\n     prevStat.push(make_pair(make_pair(-1, -1), isBipar));\n     if ((getdist(u) ^ getdist(v)) == 0) {\n       isBipar = 0;\n     }\n     return;\n   }\n   if (sz[pu] > sz[pv]) swap(u, v), swap(pu, pv);\n   prevStat.push(make_pair(make_pair(pu, sz[pu]), isBipar));\n   distToPar[pu] = getdist(u) ^ getdist(v) ^ 1;\n   par[pu] = pv;\n   sz[pv] += sz[pu];\n }\n void undo() {\n   int pos = prevStat.top().first.first, presz = prevStat.top().first.second,\n       preIsBipar = prevStat.top().second;\n   prevStat.pop();\n   if (pos >= 0) {\n     sz[pos] = presz;\n     sz[par[pos]] -= sz[pos];\n     par[pos] = pos;\n   }\n   isBipar = preIsBipar;\n }\n void solve(int l, int r, int k) {\n   for (int i = 0; i < (int)add[k].size(); i++) {\n     addEdge(add[k][i]);\n   }\n   if (l == r) {\n     ans[l] = isBipar;\n   } else {\n     int mid = (l + r) >> 1;\n     solve(l, mid, k + k);\n     solve(mid + 1, r, k + k + 1);\n   }\n   for (int i = 0; i < (int)add[k].size(); i++) undo();\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> n >> q;\n   for (int i = 0; i < q; i++) {\n     cin >> x[i] >> y[i];\n     x[i]--, y[i]--;\n     if (x[i] > y[i]) swap(x[i], y[i]);\n   }\n   for (int i = 0; i < n; i++) par[i] = i, sz[i] = 1;\n   for (int i = 0; i < q; i++) {\n     pair<int, int> now = make_pair(x[i], y[i]);\n     if (!mp.count(now) || mp[now] < 0) {\n       mp[now] = i;\n     } else {\n       opSeg.push_back(make_pair(make_pair(mp[now], i), now));\n       mp[now] = -1;\n     }\n   }\n   for (map<pair<int, int>, int>::iterator it = mp.begin(); it != mp.end();\n        it++) {\n     if (it->second >= 0) {\n       opSeg.push_back(make_pair(make_pair(it->second, q), it->first));\n     }\n   }\n   for (int i = 0; i < (int)opSeg.size(); i++) {\n     addSeg(opSeg[i].first.first, opSeg[i].first.second - 1, opSeg[i].second, 0,\n            q - 1, 1);\n   }\n   solve(0, q - 1, 1);\n   for (int i = 0; i < q; i++) cout << (ans[i] ? 'YES' : 'NO') << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   string s;\n   cin >> s;\n   int count = 0;\n   for (int i = 0; i < n - 1; i++) {\n     if (s[i] == s[i + 1]) {\n       count++;\n     }\n   }\n   cout << count;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n stringstream ans;\n int final_sum;\n string print_line(string a0) {\n   int S = 0;\n   for (int i = 0; i < a0.size() - 1; i++) {\n     int digit = a0[i] - '0';\n     S += digit;\n     ans << digit << '+';\n   }\n   int digit = a0[a0.size() - 1] - '0';\n   S += digit;\n   ans << digit << endl;\n   final_sum = S;\n   return to_string(S);\n }\n void print289(string a0) { print_line(print_line(print_line(a0))); }\n void print999(string a0, int S, int offset = 0) {\n   ans.str('');\n   int i = 0;\n   int nz = 0;\n   int dt = 0;\n   int ddd = 0;\n   while (i < offset) {\n     ans << a0[i] << '+';\n     dt = 10 * dt + a0[i] - '0';\n     ddd += a0[i] - '0';\n     i++;\n   }\n   for (i += 1; i < a0.size() - 1; i += 2) {\n     int a = a0[i - 1] - '0';\n     int b = a0[i] - '0';\n     int dt = 10 * a + b - a - b;\n     S += dt;\n     ans << a << b << '+';\n     if (S >= 1000) break;\n   }\n   if (S < 1000 && i < a0.size()) {\n     int a = a0[i - 1] - '0';\n     int b = a0[i] - '0';\n     int dt = 10 * a + b - a - b;\n     S += dt;\n     ans << a << b;\n   }\n   i++;\n   for (i; i < a0.size() - 1; i++) ans << a0[i] << '+';\n   for (i; i < a0.size(); i++) ans << a0[a0.size() - 1];\n   ans << endl;\n   print_line(print_line(to_string(S)));\n }\n bool is_close(int S) {\n   if (S == 0) return true;\n   int div = 1;\n   while (S / div > 0) div *= 10;\n   if (S * 10 == div) return true;\n   return div - S < 1000;\n }\n bool is_mega_close(int S) {\n   if (S == 0) return true;\n   int div = 1;\n   while (S / div > 0) div *= 10;\n   if (S * 10 == div) return true;\n   return S - (div / 10) < 100;\n }\n void print(string a0, int S, int offset = 0) {\n   ans.str('');\n   int i = 0;\n   int nz = 0;\n   int dt = 0;\n   int ddd = 0;\n   while (i < offset) {\n     ans << a0[i] << '+';\n     dt = dt * 10 + a0[i];\n     ddd += a0[i] - '0';\n     i++;\n   }\n   if (!is_close(S)) {\n     for (i += 2; i < a0.size() - 2; i += 3) {\n       int a = a0[i - 2] - '0';\n       int b = a0[i - 1] - '0';\n       int c = a0[i] - '0';\n       int dt = 100 * a + 10 * b + c - a - b - c;\n       S += dt;\n       ans << a << b << c << '+';\n       if (is_close(S)) break;\n     }\n     if (i < a0.size() - 2) i++;\n   }\n   if (!is_mega_close(S))\n     for (i += 2; i < a0.size() - 2; i += 3) {\n       int a = a0[i - 2] - '0';\n       int b = a0[i - 1] - '0';\n       int c = a0[i] - '0';\n       int dt = 9 * a;\n       S += dt;\n       ans << a << b << '+' << c << '+';\n       if (is_mega_close(S)) break;\n     }\n   if (i >= a0.size() - 2)\n     i -= 2;\n   else\n     i++;\n   for (i; i < a0.size() - 1; i++) ans << a0[i] << '+';\n   for (i; i < a0.size(); i++) ans << a0[a0.size() - 1];\n   ans << endl;\n   print_line(print_line(to_string(S)));\n }\n int main() {\n   int n;\n   cin >> n;\n   string a0;\n   cin >> a0;\n   int S = 0;\n   for (int i = 0; i < a0.size(); i++) {\n     int digit = a0[i] - '0';\n     S += digit;\n   }\n   if (S < 199) {\n     print289(a0);\n     cout << ans.str();\n     return 0;\n   }\n   if (S < 1000) {\n     print999(a0, S);\n     int k = 1;\n     while (final_sum > 9 && k < 2) print999(a0, S, k++);\n     if (false && n == 155096) {\n       cout << k << endl;\n       cout << final_sum << endl;\n       return 0;\n     }\n     cout << ans.str();\n     return 0;\n   }\n   print(a0, S);\n   int k = 1;\n   while (final_sum > 9 && k < 3) print(a0, S, k++);\n   cout << ans.str();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline T read() {\n   T s = 0, f = 1;\n   char ch = getchar();\n   while (!isdigit(ch)) {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (isdigit(ch)) {\n     s = (s << 3) + (s << 1) + ch - 48;\n     ch = getchar();\n   }\n   return s * f;\n }\n template <typename T>\n inline void print(T x) {\n   if (x < 0) putchar('-'), x = -x;\n   if (x > 9) print(x / 10);\n   putchar(x % 10 + '0');\n }\n const int N = 2e5 + 100;\n const int mod = 1e9 + 7;\n long long h[N], w[N], sum[N];\n struct Segment {\n   static const int maxn = 2e5 + 100;\n   struct star {\n     long long lsum, rsum, sum;\n   } s[maxn << 2];\n   void pushup(int node, int l, int r) {\n     int mid = l + r >> 1;\n     s[node].lsum =\n         max(s[node << 1].lsum, h[l] + sum[mid - 1] - sum[l - 1] +\n                                    s[node << 1 | 1].lsum - h[mid + 1] + w[mid]);\n     s[node].lsum = max(s[node].lsum, h[l] + h[mid + 1] + sum[mid] - sum[l - 1]);\n     s[node].rsum =\n         max(s[node << 1 | 1].rsum,\n             h[r] + sum[r - 1] - sum[mid] + s[node << 1].rsum - h[mid] + w[mid]);\n     s[node].rsum = max(s[node].rsum, h[r] + h[mid] + sum[r - 1] - sum[mid - 1]);\n     s[node].sum = max(s[node << 1].rsum + s[node << 1 | 1].lsum - h[mid] -\n                           h[mid + 1] + w[mid],\n                       max(s[node << 1].sum, s[node << 1 | 1].sum));\n     s[node].sum = max(s[node].sum, max(s[node].lsum, s[node].rsum));\n     s[node].sum = max(s[node].sum, h[r] + h[l] + sum[r - 1] - sum[l - 1]);\n     s[node].sum = max(\n         s[node].sum, max(s[node << 1].rsum - h[mid] + h[mid + 1] + w[mid],\n                          s[node << 1 | 1].lsum - h[mid + 1] + h[mid] + w[mid]));\n     s[node].sum = max(s[node].sum, h[mid] + h[mid + 1] + w[mid]);\n   }\n   void build(int node, int l, int r) {\n     if (l == r) {\n       s[node].lsum = s[node].rsum = h[l];\n       s[node].sum = 0;\n       return;\n     }\n     int mid = l + r >> 1;\n     build(node << 1, l, mid);\n     build(node << 1 | 1, mid + 1, r);\n     pushup(node, l, r);\n   }\n   star query(int node, int l, int r, int L, int R) {\n     if (L == l && R == r) {\n       return s[node];\n     }\n     int mid = l + r >> 1;\n     if (R <= mid)\n       return query(node << 1, l, mid, L, R);\n     else if (L > mid)\n       return query(node << 1 | 1, mid + 1, r, L, R);\n     else {\n       star lnode = query(node << 1, l, mid, L, mid);\n       star rnode = query(node << 1 | 1, mid + 1, r, mid + 1, R);\n       star now;\n       now.lsum = max(lnode.lsum, h[L] + sum[mid - 1] - sum[L - 1] + rnode.lsum -\n                                      h[mid + 1] + w[mid]);\n       now.lsum = max(now.lsum, h[L] + h[mid + 1] + sum[mid] - sum[L - 1]);\n       now.rsum = max(rnode.rsum, h[R] + sum[R - 1] - sum[mid] + lnode.rsum -\n                                      h[mid] + w[mid]);\n       now.rsum = max(now.rsum, h[R] + h[mid] + sum[R - 1] - sum[mid - 1]);\n       now.sum = max(lnode.rsum + rnode.lsum - h[mid] - h[mid + 1] + w[mid],\n                     max(lnode.sum, rnode.sum));\n       now.sum = max(now.sum, max(now.lsum, now.rsum));\n       now.sum = max(now.sum, h[L] + h[R] + sum[R - 1] - sum[L - 1]);\n       now.sum = max(now.sum, max(lnode.rsum - h[mid] + h[mid + 1] + w[mid],\n                                  rnode.lsum - h[mid + 1] + h[mid] + w[mid]));\n       now.sum = max(now.sum, h[mid] + h[mid + 1] + w[mid]);\n       return now;\n     }\n   }\n } tree;\n int main() {\n   int n = read<int>(), m = read<int>();\n   for (int i = 1; i <= n; ++i) {\n     w[i] = read<long long>();\n     w[i + n] = w[i];\n     sum[i] = sum[i - 1] + w[i];\n   }\n   for (int i = 1; i <= n; ++i) {\n     h[i] = read<long long>();\n     h[i] = h[i] + h[i];\n     h[i + n] = h[i];\n   }\n   for (int i = n + 1; i <= n + n; ++i) {\n     sum[i] = sum[i - 1] + w[i];\n   }\n   tree.build(1, 1, n + n);\n   for (int i = 1; i <= m; ++i) {\n     int l = read<int>(), r = read<int>();\n     int lc, rc;\n     if (r >= l)\n       lc = r + 1, rc = l + n - 1;\n     else\n       lc = r + 1, rc = l - 1;\n     printf('%lld\n', tree.query(1, 1, n + n, lc, rc).sum);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, a[1001000], cnt[1001000], z[1001000];\n int main() {\n   ios::sync_with_stdio(false);\n   memset(cnt, 0, sizeof(cnt));\n   memset(z, 0, sizeof(z));\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n     if (a[i] <= m) cnt[a[i]]++;\n   }\n   int ans = 0, flag = 0;\n   for (int i = 1; i <= m; i++) {\n     if (cnt[i]) {\n       for (int k = 1; k * i <= m; k++) z[k * i] += cnt[i];\n     }\n   }\n   for (int i = 1; i <= m; i++) {\n     if (z[i] > ans) {\n       ans = z[i];\n       flag = i;\n     }\n   }\n   cout << (flag == 0 ? 1 : flag) << ' ' << ans << endl;\n   for (int i = 1; i <= n; i++) {\n     if (flag % a[i] == 0 && flag != 0) cout << i << ' ';\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n signed long long int n, m, k, x, y;\n signed long long int ct[3], myct;\n int main() {\n   cin >> n >> m >> k >> x >> y;\n   signed long long int f1, q, val, rem = k;\n   if (n == 1) {\n     f1 = m;\n     q = rem / f1;\n     rem -= q * f1;\n     myct = q;\n     ct[1] = q;\n     ct[2] = q;\n     if (y <= rem) myct++;\n     if (rem != 0) ct[1]++;\n     cout << ct[1] << ' ' << ct[2] << ' ' << myct << '\n';\n     return 0;\n   } else if (n == 2) {\n     f1 = 2 * m;\n     q = rem / f1;\n     rem -= q * f1;\n     myct = q;\n     ct[1] = ct[2] = q;\n     if (((x - 1) * m + y) <= rem) myct++;\n     if (rem != 0) ct[1]++;\n     cout << ct[1] << ' ' << ct[2] << ' ' << myct << '\n';\n     return 0;\n   }\n   f1 = ((n - 2) * m * 2) + (2 * m);\n   q = rem / f1;\n   rem -= q * f1;\n   ct[0] = 2 * q;\n   ct[1] = q;\n   ct[2] = q;\n   int grp = -1;\n   if (x == 1) {\n     myct = q;\n     grp = 1;\n   } else if (x == n) {\n     myct = q;\n     grp = 2;\n   } else {\n     myct = 2 * q;\n     grp = 0;\n   }\n   int stp = 0;\n   if (rem > 0 && rem <= m) {\n     ct[1]++;\n     if (((x - 1) * m + y) <= rem) myct++;\n   } else if (rem > m && rem <= (n - 1) * m) {\n     ct[0]++;\n     ct[1]++;\n     if (((x - 1) * m + y) <= rem) myct++;\n   } else if (rem > (n - 1) * m && rem <= n * m) {\n     ct[0]++;\n     ct[1]++;\n     stp = 3;\n     if (rem == n * m) ct[2]++;\n     if (((x - 1) * m + y) <= rem) myct++;\n   } else if (rem > n * m && rem <= f1) {\n     ct[0] += 2;\n     ct[1]++;\n     ct[2]++;\n     myct++;\n     stp = 4;\n     if (x == 1 || x == n) {\n     } else {\n       rem -= n * m;\n       val = (n - x - 1) * m + y;\n       if (val <= rem) myct++;\n     }\n   }\n   signed long long int mini = ct[0], maxi = ct[0];\n   for (int i = 1; i < 3; i++) {\n     mini = min(mini, ct[i]);\n     maxi = max(maxi, ct[i]);\n   }\n   cout << maxi << ' ' << mini << ' ' << myct << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, mncnt = 1000000000, cnt;\n   string a;\n   string c = 'ACTG';\n   cin >> n >> a;\n   for (int i = 0; i <= n - 4; i++) {\n     cnt = 0;\n     string b = a.substr(i, 4);\n     for (int j = 0; j < 4; j++) {\n       int x = c[j] - 'A';\n       int y = b[j] - 'A';\n       if (abs(y - x) <= 13)\n         cnt += abs(y - x);\n       else\n         cnt += 26 - (abs(y - x));\n     }\n     mncnt = min(mncnt, cnt);\n   }\n   cout << mncnt << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[12][12], nxt[110];\n int id(int x, int y) {\n   if (x & 1) return (10 - x) * 10 + 11 - y;\n   return (10 - x) * 10 + y;\n }\n double dp[120];\n int main() {\n   for (int i = 1; i <= 10; i++)\n     for (int j = 1; j <= 10; j++) a[i][j] = id(i, j);\n   for (int i = 1; i <= 10; i++) {\n     for (int j = 1, k; j <= 10; j++) {\n       scanf('%d', &k);\n       nxt[a[i][j]] = a[i - k][j];\n     }\n   }\n   for (int i = 1; i < 6; i++) dp[100 - i] = 6;\n   for (int i = 94; i; i--) {\n     double x = 0;\n     for (int j = 1; j <= 6; j++) {\n       x += min(dp[i + j], dp[nxt[i + j]]);\n     }\n     dp[i] = x / 6 + 1;\n   }\n   printf('%.10f\n', dp[1]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct data {\n   int x, h, p;\n } a[100005];\n int n, x[100005], kq[100005], st[4 * 100005];\n void update(int id, int l, int r, int p, int v) {\n   if (l > p || r < p) return;\n   if (l == p && l == r) {\n     st[id] = v;\n     return;\n   }\n   int m = (l + r) >> 1;\n   update(id << 1, l, m, p, v);\n   update((id << 1) + 1, m + 1, r, p, v);\n   st[id] = max(st[id << 1], st[(id << 1) + 1]);\n }\n int getmax(int id, int l, int r, int d, int c) {\n   if (l > c || r < d) return 0;\n   if (l >= d && r <= c) return st[id];\n   int m = (l + r) >> 1;\n   return max(getmax((id << 1), l, m, d, c),\n              getmax((id << 1) + 1, m + 1, r, d, c));\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n;\n   for (int i = 1; i <= n; ++i) {\n     cin >> a[i].x >> a[i].h;\n     a[i].p = i;\n     a[i].h = a[i].x + a[i].h - 1;\n   }\n   sort(a + 1, a + n + 1, [](data a, data b) { return a.x < b.x; });\n   for (int i = n; i >= 1; --i) {\n     x[i] = a[i].x;\n     int pos = upper_bound(x + i + 1, x + n + 1, a[i].h) - x - 1;\n     int t = getmax(1, 1, n, i + 1, pos);\n     if (t < i) t = i;\n     kq[a[i].p] = t - i + 1;\n     update(1, 1, n, i, t);\n   }\n   for (int i = 1; i <= n; ++i) cout << kq[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int now[15][3], ans[15][3], nA, nB, nC, minN = 12, cnt, t[13];\n void dfs(int a, int b, int c, int num, int jw, int cou, bool ifA, bool ifB) {\n   if (!a && !b && !c && !jw) {\n     minN = num;\n     cnt = cou;\n     memcpy(ans, now, sizeof(now));\n     return;\n   }\n   if (a % 10 + b % 10 - c % 10 + jw == 0 && c)\n     dfs(a / 10, b / 10, c / 10, num, 0, cou + 1, a ? 0 : 1, b ? 0 : 1);\n   else if (a % 10 + b % 10 - c % 10 + jw == 10 && c)\n     dfs(a / 10, b / 10, c / 10, num, 1, cou + 1, a ? 0 : 1, b ? 0 : 1);\n   else {\n     if (minN - ++num <= 0) return;\n     now[num][2] = ++cou;\n     if (!ifA && c) {\n       now[num][0] = 1;\n       now[num][1] = (c % 10 - b % 10 - jw + 10) % 10;\n       bool f = ifB;\n       if (!b) ifB = 1;\n       dfs(a, b / 10, c / 10, num, (now[num][1] + b % 10 + jw - c % 10) / 10,\n           cou, ifA, ifB);\n       ifB = f;\n     }\n     if (!ifB && c) {\n       now[num][0] = 2;\n       now[num][1] = (c % 10 - a % 10 + 10 - jw) % 10;\n       bool f = ifA;\n       if (a == 0) ifA = 1;\n       dfs(a / 10, b, c / 10, num, (now[num][1] + a % 10 + jw - c % 10) / 10,\n           cou, ifA, ifB);\n       ifA = f;\n     }\n     now[num][0] = 3;\n     now[num][1] = (a % 10 + b % 10 + jw) % 10;\n     if (!a) ifA = 1;\n     if (!b) ifB = 1;\n     dfs(a / 10, b / 10, c, num, (a % 10 + b % 10 + jw - now[num][1]) / 10, cou,\n         ifA, ifB);\n   }\n }\n int main() {\n   int a, b, c;\n   bool f;\n   scanf('%d+%d=%d', &a, &b, &c);\n   dfs(a, b, c, 0, 0, 0, 0, 0);\n   int p = 1;\n   while (p <= minN && ans[p][0] - 1) p++;\n   for (int i = 1; i <= cnt; i++)\n     if (p <= minN && ans[p][2] == i) {\n       t[i] = ans[p++][1];\n       while (p <= minN && ans[p][0] - 1) p++;\n     } else {\n       t[i] = a % 10;\n       a /= 10;\n     }\n   f = 0;\n   for (int i = cnt; i; i--)\n     if (f || t[i]) {\n       putchar(t[i] + '0');\n       f = 1;\n     }\n   putchar('+');\n   p = 1;\n   while (p <= minN && ans[p][0] - 2) p++;\n   for (int i = 1; i <= cnt; i++)\n     if (p <= minN && ans[p][2] == i) {\n       t[i] = ans[p++][1];\n       while (p <= minN && ans[p][0] - 2) p++;\n     } else {\n       t[i] = b % 10;\n       b /= 10;\n     }\n   f = 0;\n   for (int i = cnt; i; i--)\n     if (f || t[i]) {\n       putchar(t[i] + '0');\n       f = 1;\n     }\n   putchar('=');\n   p = 1;\n   while (p <= minN && ans[p][0] - 3) p++;\n   for (int i = 1; i <= cnt; i++)\n     if (p <= minN && ans[p][2] == i) {\n       t[i] = ans[p][1];\n       p++;\n       while (p <= minN && ans[p][0] - 3) p++;\n     } else {\n       t[i] = c % 10;\n       c /= 10;\n     }\n   f = 0;\n   for (int i = cnt; i; i--)\n     if (f || t[i]) {\n       putchar(t[i] + '0');\n       f = 1;\n     }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int mas[1010][1010];\n int main() {\n   int N, K;\n   cin >> N >> K;\n   for (int i = 1; i <= N; i++) {\n     int k = 0;\n     for (int j = 1; j <= N; j++) {\n       if (k == K)\n         break;\n       else if (i == j)\n         continue;\n       else if (mas[j][i] || mas[i][j])\n         continue;\n       else {\n         mas[i][j] = 1;\n         k++;\n       }\n     }\n     if (k < K) {\n       cout << -1 << endl;\n       return 0;\n     }\n   }\n   int cnt = 0;\n   for (int i = 1; i <= N; i++) {\n     for (int j = 1; j <= N; j++) {\n       if (mas[i][j]) cnt++;\n     }\n   }\n   cout << cnt << endl;\n   for (int i = 1; i <= N; i++) {\n     for (int j = 1; j <= N; j++) {\n       if (mas[i][j]) cout << i << ' ' << j << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, m, k, mod = 1e9 + 7;\n map<long long, long long> mp;\n string s;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   srand(time(0));\n   cin >> n >> k;\n   vector<long long> a(n + 2);\n   vector<long long> b(k + 2);\n   for (long long i = 1; i <= n; ++i) cin >> a[i], a[i] -= i;\n   a[0] = -2e9;\n   a[n + 1] = 2e9;\n   b[k + 1] = n + 1;\n   for (long long i = 1; i <= k; ++i) cin >> b[i];\n   long long ans = 0;\n   for (long long i = 0; i <= k; ++i) {\n     long long l = b[i];\n     long long r = b[i + 1];\n     if (a[l] > a[r]) {\n       cout << -1;\n       exit(0);\n     }\n     vector<long long> v;\n     for (long long j = l + 1; j < r; ++j) {\n       if (a[j] > a[r] || a[j] < a[l]) continue;\n       auto x = upper_bound(v.begin(), v.end(), a[j]);\n       if (x == v.end())\n         v.push_back(a[j]);\n       else\n         *x = a[j];\n     }\n     ans += r - l - 1 - v.size();\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int N, K, M, S;\n int arr[500000];\n int raito[500005];\n int seen[500005];\n int bucket[500005];\n int shift[500005];\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> M >> K >> N >> S;\n   for (int i = 0; i < M; i++) {\n     cin >> arr[i];\n   }\n   int t;\n   for (int i = 0; i < S; i++) {\n     cin >> t;\n     bucket[t]++;\n   }\n   for (int i = 0; i < 500005; i++) seen[i] = -1;\n   for (int i = M - 1; i >= 0; i--) {\n     raito[i] = seen[arr[i]];\n     seen[arr[i]] = i;\n   }\n   int maxima = 0;\n   for (int i = 0; i < 500005; i++) {\n     if (bucket[i] == 0) continue;\n     int cur = seen[i];\n     int p = 1;\n     while (cur != -1 && p < bucket[i]) {\n       cur = raito[cur];\n       p++;\n     }\n     if (cur == -1) {\n       cout << -1;\n       return 0;\n     }\n     shift[i] = cur;\n     maxima = max(maxima, cur);\n   }\n   vector<int> adj;\n   for (int i = 0; i < M;) {\n     int total = i / K + 1 + ((M - 1) - (maxima + 1) + 1) / K;\n     if (total >= N) {\n       int extra = K - S;\n       for (int j = i; j <= maxima; j++) {\n         if (extra <= 0 && bucket[arr[j]] == 0) {\n           adj.push_back(j + 1);\n         } else if (bucket[arr[j]] == 0) {\n           extra--;\n         } else {\n           bucket[arr[j]]--;\n         }\n       }\n       cout << adj.size() << '\n';\n       for (int j = 0; j < adj.size(); j++) {\n         cout << adj[j] << ' ';\n       }\n       return 0;\n     }\n     if (i + 1 == M) break;\n     int pp = 0;\n     if (bucket[arr[i]] != 0) {\n       shift[arr[i]] = raito[shift[arr[i]]];\n       maxima = max(maxima, shift[arr[i]]);\n       if (shift[arr[i]] == -1) {\n         cout << -1;\n         return 0;\n       }\n     }\n     i++;\n   }\n   cout << -1;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 400010;\n int n;\n int fa[MAXN][21];\n int dep[MAXN];\n int LCA(int x, int y) {\n   if (dep[x] < dep[y]) swap(x, y);\n   for (int i = 20; i >= 0; i--) {\n     if (dep[x] - (1 << i) >= dep[y]) {\n       x = fa[x][i];\n     }\n   }\n   if (x == y) return x;\n   for (int i = 20; i >= 0; i--) {\n     if (fa[x][i] != fa[y][i]) {\n       x = fa[x][i];\n       y = fa[y][i];\n     }\n   }\n   return fa[x][0];\n }\n int main() {\n   scanf('%d', &n);\n   int L, R;\n   L = R = 1;\n   int mx = 0;\n   int p;\n   for (int i = 2; i <= n; i++) {\n     scanf('%d', &p);\n     fa[i][0] = p;\n     dep[i] = dep[p] + 1;\n     for (int j = 1; j <= 20; j++) {\n       fa[i][j] = fa[fa[i][j - 1]][j - 1];\n     }\n     int z = LCA(i, L);\n     int ans1 = dep[i] + dep[L] - 2 * dep[z];\n     z = LCA(i, R);\n     int ans2 = dep[i] + dep[R] - 2 * dep[z];\n     if (ans1 > ans2 && ans1 > mx) {\n       mx = ans1;\n       R = i;\n     }\n     if (ans2 >= ans1 && ans2 > mx) {\n       L = i;\n       mx = ans2;\n     }\n     if (i == n)\n       printf('%d\n', mx);\n     else\n       printf('%d ', mx);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #pragma GCC optimize('Ofast,no-stack-protector')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native')\n #pragma GCC optimize('unroll-loops')\n long long fun(long long n, long long m, long long mid) {\n   long long val = 0;\n   for (long long i = 1; i <= n; i++) val += min(m, (mid - 1) / i);\n   return val;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   long long tst = 1;\n   for (long long tt = 1; tt <= tst; tt++) {\n     long long n, m, k;\n     cin >> n >> m >> k;\n     long long l = 1, r = (n * m) + 1;\n     while (l < r) {\n       long long mid = (l + r) / 2;\n       if (fun(n, m, mid) < k)\n         l = mid + 1;\n       else\n         r = mid;\n     }\n     cout << l - 1 << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }\n int main() {\n   long long a, b;\n   while (cin >> a >> b) {\n     long long suma = 0, sumb = 0;\n     long long ca = 0, cb = 0;\n     long long limit = lcm(a, b);\n     long long now = 0, prev = 0;\n     while (now <= limit) {\n       if (now % b != 0 || (now % a == 0 && a > b)) {\n         suma += now - prev;\n       } else {\n         sumb += now - prev;\n       }\n       prev = now;\n       now = min(a * (ca + 1), b * (cb + 1));\n       if (now % a == 0) ca++;\n       if (now % b == 0) cb++;\n     }\n     cout << (suma == sumb ? 'Equal' : suma > sumb ? 'Dasha' : 'Masha') << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, dp[2000 + 10][2000 + 10];\n bool v[2000 + 10][2000 + 10];\n vector<int> vec[2000 + 10];\n int solve(int curr, int kk) {\n   if (kk > k) return 0;\n   if (kk == k) return 1;\n   if (v[curr][kk]) return dp[curr][kk];\n   for (int i = 0; i < vec[curr].size(); i++) {\n     dp[curr][kk] += (solve(vec[curr][i], kk + 1)) % 1000000007;\n     dp[curr][kk] %= 1000000007;\n   }\n   v[curr][kk] = true;\n   return dp[curr][kk];\n }\n int main() {\n   ios::sync_with_stdio(false), cin.tie(0);\n   cin >> n >> k;\n   for (int i = 1; i <= n; i++) {\n     for (int j = i; j <= n; j += i) {\n       if (!(j % i)) vec[i].push_back(j);\n     }\n   }\n   cout << solve(1, 0) << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[100005];\n int dp[302][100005];\n int main() {\n   ios::sync_with_stdio(0);\n   int n, q;\n   cin >> n;\n   for (int i = 1; i <= n; ++i) cin >> a[i];\n   cin >> q;\n   memset(dp, 0, sizeof(dp));\n   for (int k = min(300, n); k >= 1; --k) {\n     for (int i = n; i >= 1; --i) {\n       if (i + a[i] + k > n)\n         dp[k][i] = 1;\n       else\n         dp[k][i] = 1 + dp[k][i + a[i] + k];\n     }\n   }\n   while (q--) {\n     int p, k;\n     cin >> p >> k;\n     if (k <= 300)\n       cout << dp[k][p] << endl;\n     else {\n       int ans = 0;\n       while (p <= n) {\n         p = p + a[p] + k;\n         ans++;\n       }\n       cout << ans << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, ans = 0, minm;\n long long A[10 * 100000 + 6];\n unordered_map<long long, long long> M;\n long long pos, neg, cc = 0, k = 0;\n int main() {\n   scanf('%lld', &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%lld', &A[i]);\n     M[A[i] - i]++;\n     ans += abs(A[i] - i);\n     if (A[i] <= i)\n       neg++;\n     else\n       pos++;\n   }\n   minm = ans;\n   for (long long i = 1, j = n; i <= n - 1; ++i, --j) {\n     if (A[j] - j - cc <= 0)\n       --neg;\n     else\n       --pos;\n     ans -= abs(A[j] - j - cc);\n     ans += A[j];\n     ++pos;\n     M[A[j] + cc]++;\n     M[A[j] - j]--;\n     ++cc;\n     ans -= pos;\n     ans += neg;\n     pos -= M[cc];\n     neg += M[cc];\n     if (ans <= minm) {\n       minm = ans;\n       k = i;\n     }\n   }\n   printf('%lld %lld\n', minm, k);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[200005], ans1 = 1, ans2 = 0;\n int main() {\n   int n, b, b1;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &a[i]);\n   }\n   sort(a + 1, a + 1 + n);\n   b1 = 0;\n   for (int i = 2; i <= n; ++i) {\n     b = a[i] - a[i - 1];\n     if (b == 0) {\n       continue;\n     } else if (b == 1) {\n       if (b1 == 2) {\n         ans1++;\n         b1 = 0;\n       } else if (b1 == 1) {\n         b1 = 2;\n       } else if (b1 == 0) {\n         b1 = 1;\n       }\n     } else if (b == 2) {\n       if (b1 == 0) {\n         b1 = 2;\n       } else if (b1 >= 1) {\n         b1 = 0;\n         ans1++;\n       }\n     } else {\n       b1 = 0;\n       ans1++;\n     }\n   }\n   for (int i = 1; i <= n; ++i) {\n     b = a[i] - a[i - 1];\n     if (i == 1) {\n       a[i]--;\n       ans2++;\n       continue;\n     }\n     if (b >= 1) ans2++;\n     if (b == 0 && a[i] != a[i + 1]) {\n       ans2++;\n       a[i]++;\n     } else if (b == 1 && a[i] == a[i + 1] - 1) {\n       continue;\n     } else if (b == 1 && a[i] == a[i + 1] - 2) {\n       continue;\n     } else if (b == 1 && a[i] != a[i + 1]) {\n       a[i]++;\n     } else if (b >= 2) {\n       a[i]--;\n     }\n   }\n   printf('%d %d\n', ans1, ans2);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main(int argc, const char* argv[]) {\n   int cases;\n   cin >> cases;\n   while (cases--) {\n     int num;\n     scanf('%d', &num);\n     vector<pair<int, int> > coords;\n     pair<int, int> z(0, 0);\n     coords.push_back(z);\n     for (int i = 0; i < num; ++i) {\n       int x, y;\n       scanf('%d%d', &x, &y);\n       coords.push_back({x, y});\n     }\n     sort(coords.begin(), coords.end());\n     string out;\n     bool ok = true;\n     for (int i = 1; i <= num; ++i) {\n       int diffx = coords[i].first - coords[i - 1].first;\n       int diffy = coords[i].second - coords[i - 1].second;\n       if (diffx < 0 || diffy < 0) {\n         ok = false;\n         break;\n       }\n       while (diffx--) out += 'R';\n       while (diffy--) out += 'U';\n     }\n     if (ok) {\n       cout << 'YES' << endl;\n       cout << out << endl;\n     } else {\n       cout << 'NO' << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int M = 110;\n int a[M];\n int main() {\n   int n, cnt = 0;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', a + i);\n     if (a[i] % 2 == 0) cnt++;\n   }\n   if (n % 2 == 0) {\n     printf('No\n');\n     return 0;\n   }\n   if (a[1] % 2 == 0 || a[n] % 2 == 0) {\n     printf('No\n');\n     return 0;\n   } else {\n     printf('Yes\n');\n     return 0;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n T mulmod(T a, T b) {\n   if (b == 0) return 0;\n   if (b == 1) return a;\n   T x = mulmod(a, b >> 1);\n   x = (x + x) % 1000000007;\n   if (b & 1) x = (x + a) % 1000000007;\n   return x;\n }\n template <class T>\n T larger(T a, T b) {\n   return (a > b ? a : b);\n }\n template <class T>\n T smaller(T a, T b) {\n   return (a < b ? a : b);\n }\n template <class T>\n T gcd(T a, T b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n template <class T>\n T lcm(T a, T b) {\n   return (a * b) / gcd(a, b);\n }\n template <class T>\n string converter(T n) {\n   stringstream x;\n   x << n;\n   return x.str();\n }\n template <class T>\n T pw(T a, T b) {\n   if (b == 0) return 1;\n   T x = pw(a, b >> 1);\n   x = mulmod(x, x);\n   if (b & 1) x = mulmod(x, a);\n   return x;\n }\n template <class T1>\n void deb(T1 e1) {\n   cout << e1 << endl;\n }\n template <class T1, class T2>\n void deb(T1 e1, T2 e2) {\n   cout << e1 << ' ' << e2 << endl;\n }\n template <class T1, class T2, class T3>\n void deb(T1 e1, T2 e2, T3 e3) {\n   cout << e1 << ' ' << e2 << ' ' << e3 << endl;\n }\n template <class T1, class T2, class T3, class T4>\n void deb(T1 e1, T2 e2, T3 e3, T4 e4) {\n   cout << e1 << ' ' << e2 << ' ' << e3 << ' ' << e4 << endl;\n }\n template <class T1, class T2, class T3, class T4, class T5>\n void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {\n   cout << e1 << ' ' << e2 << ' ' << e3 << ' ' << e4 << ' ' << e5 << endl;\n }\n template <class T1, class T2, class T3, class T4, class T5, class T6>\n void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {\n   cout << e1 << ' ' << e2 << ' ' << e3 << ' ' << e4 << ' ' << e5 << ' ' << e6\n        << endl;\n }\n void letsgo() {\n   long long int a, b, x, n;\n   cin >> a >> b >> n >> x;\n   if (a == 1) {\n     cout << (x + (n % 1000000007 * b) % 1000000007) % 1000000007;\n     return;\n   }\n   long long int aN = pw(a, n);\n   long long int ans = (aN * x) % 1000000007;\n   long long int z = ((aN - 1 + 1000000007) % 1000000007 * b) % 1000000007;\n   z = (z * pw(a - 1, 1000000007 - 2ll)) % 1000000007;\n   cout << (ans + z) % 1000000007;\n }\n int main() {\n   letsgo();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 0x3f3f3f3f;\n const double eps = 1e-8;\n const double PI = acos(-1.0);\n const int maxn = 200 + 10;\n char str[maxn];\n struct TwoSat {\n   int n;\n   vector<int> G[maxn * 2];\n   bool mark[maxn * 2];\n   int S[maxn * 2], c;\n   bool isv[maxn];\n   int sz;\n   bool dfs(int x) {\n     if (mark[x ^ 1]) return false;\n     if (mark[x]) return true;\n     if (x / 2 < xi) {\n       int id = str[x / 2] - 'a';\n       if (isv[id] != (x & 1)) return false;\n       tmp[x / 2] = str[x / 2];\n     } else if (x / 2 == xi) {\n       int t = get_min(str[xi] - 'a', (x & 1) ? true : false);\n       if (t == -1) return false;\n       tmp[x / 2] = t + 'a';\n     } else {\n       int t = get_min(-1, (x & 1) ? true : false);\n       if (t == -1) return false;\n       tmp[x / 2] = t + 'a';\n     }\n     mark[x] = true;\n     S[c++] = x;\n     for (int i = 0; i < G[x].size(); i++)\n       if (!dfs(G[x][i])) return false;\n     return true;\n   }\n   void init(int n, char *s) {\n     this->n = n;\n     for (int i = 0; i < n * 2; i++) G[i].clear();\n     memset(mark, false, sizeof(mark));\n     sz = strlen(s);\n     for (int i = 0; i < sz; i++) isv[i] = s[i] == 'V' ? true : false;\n   }\n   void add_clause(int x, int xval, int y, int yval) {\n     x = x * 2 + xval;\n     y = y * 2 + yval;\n     G[x ^ 1].push_back(y);\n     G[y ^ 1].push_back(x);\n   }\n   int get_min(int pos, bool c) {\n     for (int i = pos + 1; i < sz; i++) {\n       if (c == isv[i]) return i;\n     }\n     return -1;\n   }\n   char ans[maxn], tmp[maxn];\n   int xi;\n   void solve() {\n     bool OK = false;\n     for (int pos = 0; pos <= n; pos++) {\n       for (int x = 0; x <= 1; x++) {\n         xi = pos;\n         bool ok = false;\n         memset(mark, false, sizeof(mark));\n         strcpy(tmp, str);\n         if (pos < n) {\n           int t = get_min(str[pos] - 'a', (x & 1) ? true : false);\n           if (t == -1) continue;\n           tmp[pos] = t + 'a';\n         }\n         for (int i = pos + 1; i < n; i++) tmp[i] = 'a';\n         c = 0;\n         for (int i = 0; i < n; i++) {\n           int x1 = (i << 1) | (isv[tmp[i] - 'a']);\n           if (!dfs(x1)) {\n             ok = true;\n             break;\n           }\n         }\n         if (n == 200) {\n         }\n         if (ok) continue;\n         OK = true;\n         tmp[n] = 0;\n         if (ans[0] == 0)\n           strcpy(ans, tmp);\n         else if (strcmp(tmp, ans) < 0)\n           strcpy(ans, tmp);\n       }\n     }\n     if (OK)\n       printf('%s\n', ans);\n     else\n       printf('-1\n');\n   }\n } sat;\n int main() {\n   int n, m;\n   while (~scanf('%s', str)) {\n     scanf('%d%d', &n, &m);\n     sat.init(n, str);\n     for (int i = 0, x, y, xval, yval; i < m; i++) {\n       char t1[5], t2[5];\n       scanf('%d%s%d%s', &x, t1, &y, t2);\n       xval = t1[0] == 'V' ? 1 : 0;\n       yval = t2[0] == 'V' ? 1 : 0;\n       --x;\n       --y;\n       sat.add_clause(x, xval ^ 1, y, yval);\n     }\n     scanf('%s', str);\n     sat.solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int thien, n, tt, h;\n string s;\n int main() {\n   cin >> tt;\n   for (int ii = 1; ii <= tt; ii++) {\n     cin >> n;\n     thien = 0;\n     h = 0;\n     for (int i = 1; i <= n; i++) {\n       cin >> s;\n       if (s.length() % 2 != 0) thien++;\n       for (int j = 0; j < s.length(); j++)\n         if (s[j] == '1') h++;\n     }\n     if (h % 2 != 0 && thien == 0)\n       cout << n - 1 << endl;\n     else\n       cout << n << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 300010;\n int p1[maxn], p2[maxn], q[maxn];\n int main() {\n   int n, m;\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &p1[i]);\n     p1[i]--;\n     p2[p1[i]] = i;\n     q[i] = n;\n   }\n   for (int i = 0; i < m; i++) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     x--;\n     y--;\n     x = p2[x];\n     y = p2[y];\n     if (x > y) swap(x, y);\n     q[x] = min(q[x], y);\n   }\n   int r = n - 1;\n   long long ans = 0;\n   for (int i = n - 1; i >= 0; i--) {\n     r = min(q[i] - 1, r);\n     ans += r - i + 1;\n   }\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a[200001];\n const double esl = 1e-11;\n double cal(double x) {\n   double t = 0;\n   double ans = 0;\n   for (int i = 1; i <= n; i++) {\n     if (t + a[i] - x < 0) {\n       ans = max(ans, t);\n       t = 0;\n     } else {\n       t += ((double)a[i] - x);\n       ans = max(ans, t);\n     }\n   }\n   ans = max(ans, t);\n   double t1 = 0;\n   for (int i = 1; i <= n; i++) {\n     if (t1 + a[i] - x > 0) {\n       ans = max(ans, -t1);\n       t1 = 0;\n     } else {\n       t1 += ((double)a[i] - x);\n       ans = max(ans, -t1);\n     }\n   }\n   ans = max(ans, -t1);\n   return ans;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n   }\n   double l = -(1e5);\n   double r = 1e5;\n   for (int i = 1; i <= 500; i++) {\n     double d = (2.0 * l + r) / 3;\n     double c = (2.0 * r + l) / 3;\n     if (cal(d) > cal(c)) {\n       l = d;\n     } else\n       r = c;\n   }\n   printf('%.10f', cal(l));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = 5e4 + 10;\n int n, m;\n std::vector<char> a[N];\n int sx[N], sy[N];\n int main() {\n   int T;\n   scanf('%d', &T);\n   while (T--) {\n     scanf('%d%d', &n, &m);\n     for (int i = 1; i <= n; ++i) {\n       a[i].resize(m + 2);\n       getchar();\n       for (int j = 1; j <= m; ++j) scanf('%c', &a[i][j]);\n     }\n     int cnt_x = 0, cnt_y = 0, p_x = 1, p_y = 1;\n     for (int i = 1; i <= n; ++i) {\n       int sum = 0;\n       for (int j = 1; j <= m; ++j) sum += (a[i][j] == '*');\n       sx[i] = sum;\n     }\n     for (int i = 1; i <= m; ++i) {\n       int sum = 0;\n       for (int j = 1; j <= n; ++j) sum += (a[j][i] == '*');\n       sy[i] = sum;\n     }\n     int ans = 0x3f3f3f3f;\n     for (int i = 1; i <= n; ++i)\n       for (int j = 1; j <= m; ++j) {\n         int now = n + m - sx[i] - sy[j];\n         if (a[i][j] == '.') --now;\n         ans = std::min(ans, now);\n       }\n     printf('%d\n', ans);\n     for (int i = 1; i <= n; ++i) a[i].clear(), sx[i] = 0;\n     for (int i = 1; i <= m; ++i) sy[i] = 0;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n auto clk = clock();\n mt19937_64 rang(\n     chrono::high_resolution_clock::now().time_since_epoch().count());\n void test_case() {\n   long long int n;\n   cin >> n;\n   long long int a[n + 1];\n   long long int t = -1, b = -1, c = -1;\n   for (long long int i = 1; i <= n; i++) {\n     cin >> a[i];\n   }\n   for (long long int i = 2; i <= n - 1; i++) {\n     for (long long int j = i - 1; j >= 1; j--) {\n       if (a[j] < a[i]) {\n         t = j;\n         break;\n       }\n     }\n     for (long long int j = i + 1; j <= n; j++) {\n       if (a[j] < a[i]) {\n         c = j;\n         break;\n       }\n     }\n     if (t != -1 && c != -1) {\n       b = i;\n       break;\n     }\n     t = -1, c = -1;\n   }\n   if (b != -1) {\n     cout << 'YES' << endl;\n     cout << t << ' ' << b << ' ' << c << endl;\n   } else\n     cout << 'NO' << endl;\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   srand(chrono::high_resolution_clock::now().time_since_epoch().count());\n   cout << fixed << setprecision(10);\n   long long int t = 1;\n   cin >> t;\n   while (t--) {\n     test_case();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long nthRoot(long long A, long long N) {\n   float xPre = rand() % 10;\n   float eps = 1e-3;\n   float delX = LLONG_MAX;\n   float xK;\n   while (delX > eps) {\n     xK = ((N - 1.0) * xPre + (float)A / pow(xPre, N - 1)) / (float)N;\n     delX = abs(xK - xPre);\n     xPre = xK;\n   }\n   return ceil(xK);\n }\n int main() {\n   long long n;\n   cin >> n;\n   char a[] = {'c', 'o', 'd', 'e', 'f', 'o', 'r', 'c', 'e', 's'};\n   long long in = 0, num;\n   num = nthRoot(n, 10);\n   if (pow(num, 10) < n) num++;\n   for (int i = 0; i <= 10; i++) {\n     if (pow(num - 1, i) * pow(num, 10 - i) >= n) {\n       in = i;\n     } else\n       break;\n   }\n   if (in * (num - 1) + (10 - in) * num - 10 < n - 1) {\n     for (int i = 0; i < in; i++) {\n       long long t = num - 1;\n       while (t--) cout << a[i];\n     }\n     for (int i = in; i < 10; i++) {\n       long long t = num;\n       while (t--) cout << a[i];\n     }\n   } else {\n     for (int i = 0; i < 10; i++) cout << a[i];\n     long long t = n - 1;\n     while (t--) cout << a[9];\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline void amin(T& a, const T& b) {\n   if (a > b) a = b;\n }\n template <class T>\n inline void amax(T& a, const T& b) {\n   if (a < b) a = b;\n }\n template <class T>\n inline void rv(vector<T>& v, int n) {\n   vector<T>(n).swap(v);\n   for (int i = 0; i < (n); i++) cin >> v[i];\n }\n inline void rv(int* v, int n) {\n   for (int i = 0; i < (n); i++) scanf('%d', &v[i]);\n }\n inline void rv(long long* v, int n) {\n   for (int i = 0; i < (n); i++) scanf('%lld', &v[i]);\n }\n inline vector<int> rvi(int n) {\n   vector<int> v(n);\n   for (int i = 0; i < (n); i++) scanf('%d', &v[i]);\n   return v;\n }\n inline vector<long long> rvl(int n) {\n   vector<long long> v(n);\n   for (int i = 0; i < (n); i++) scanf('%lld', &v[i]);\n   return v;\n }\n inline vector<string> rvs(int n) {\n   vector<string> v(n);\n   for (int i = 0; i < (n); i++) scanf('%s', &v[i]);\n   return v;\n }\n template <class T>\n inline void readvv(vector<vector<T>>& v, int m, int n) {\n   vector<vector<T>>(m).swap(v);\n   for (int i = 0; i < (m); i++) readv(v[i], n);\n }\n inline void pvi(vector<int>& v) {\n   for (int i = 0; i < (v.size()); i++) printf('%d ', v[i]);\n   printf('\n');\n }\n inline void pvl(vector<long long>& v) {\n   for (int i = 0; i < (v.size()); i++) {\n     printf('%lld ', v[i]);\n   }\n   printf('\n');\n }\n inline void pvs(vector<string>& v) {\n   for (int i = 0; i < (v.size()); i++) {\n     printf('%s\n', v[i].c_str());\n   }\n }\n int main() {\n   long long n;\n   long double s;\n   cin >> n >> s;\n   vector<vector<long long>> g(n);\n   for (int i = 0; i < (n - 1); i++) {\n     long long u, v;\n     cin >> u >> v;\n     g[u - 1].push_back(v - 1);\n     g[v - 1].push_back(u - 1);\n   }\n   long double leaves = 0, two = 2;\n   for (int i = 0; i < (n); i++) {\n     if (g[i].size() == 1) leaves++;\n   }\n   cout << setprecision(20) << endl;\n   cout << ((two * s) / leaves) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include 'bits/stdc++.h'\n using namespace std;\n #define all(x) x.begin(),x.end()\n #define pb push_back\n #define ff first\n #define ss second\n #define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)\n #define ar array\n #define int long long \n #define F(i,a,b) for(i=a;i<b;++i)\n #define RF(i,b,a) for(i=b;i>=a;--i) \n #define NL cout<<'\n';\n #define INF LONG_LONG_MAX\n #define pii pair<int,int>\n #define vi vector<int>\n \n typedef long long ll;\n typedef long double ld;\n const ll mod=1e9+7;\n bool comp(ll a,ll b)\n {\n 	return a<b;\n }\n ll fpow(ll a, ll b) {\n \n 	ll res=1;\n 	while(b) {\n 		if(b&1)\n 			res=(res*a);\n 		a=(a*a);\n 		b>>=1;\n 	}\n 	return res;\n }\n \n ll minm(ll a,ll b){\n 	if(a<b) return a;\n 	return b;\n }\n \n ll maxm(ll a,ll b){\n 	if(a>b){ return a;}\n 	else return b;\n }\n \n int PHI(int k){\n 	// This is Euler's Totient Function.\n 	//This function returns no. of coprime numbers to N in range [1,2,....,N]\n \n 	  int ans=k;\n 	  for(int i=2;i*i<=k;++i){\n 	  	if(k%i==0){\n 	  		ans-=ans/i;\n 	  		while(k%i==0){\n 	  			k/=i;\n 	  		}\n 	  	}\n 	  }\n      if(k>1) ans-=ans/k;\n      return ans;\n  \n \n }\n \n void solve(){\n   \n    int n,i;\n    cin >> n;\n    \n    vector<pii>ecells;\n    vector<pii>ocells;\n    \n    for(i=1;i<=n;i++){\n    	for(int j=1;j<=n;j++){\n    		if((i+j)%2){\n    			ocells.pb({i,j});\n    		}\n    		else ecells.pb({i,j});\n    	}\n    }\n    \n    // 1 even\n    // 2,3 odd\n    // if not possible ie all odd are filled, fill 2,3 in even\n    \n    int cnt=0;\n    \n    while(cnt<n*n){\n    	int a; cin >> a;\n    	\n    	if(a==1){\n    		 // try to fill 2 in odd cell \n    		 // if not possible , fill 3 in even\n    		 if(ocells.empty()){\n    		 	cout<<'3 '<<ecells.back().ff<<' '<<ecells.back().ss<<endl;\n    		 	ecells.pop_back();\n    		 }\n    		 \n    		 else{\n    		 	cout<<'2 '<<ocells.back().ff<<' '<<ocells.back().ss<<endl;\n    		 	ocells.pop_back();\n    		 }\n    		 ++cnt;\n    	}\n    	\n    	else if(a==2){\n    		// fill 1 in even , if possible\n    		if(!ecells.empty()){\n    			cout<<'1 '<<ecells.back().ff<<' '<<ecells.back().ss<<endl;\n    			ecells.pop_back();\n    		}\n    		\n    		else{\n    			// fill 3 in ocells\n    			cout<<'3 '<<ocells.back().ff<<' '<<ocells.back().ss<<endl;\n    			ocells.pop_back();\n    		}\n    		cnt++;\n    	}\n    	else{\n    		// fill 1 in even if possible\n    		if(!ecells.empty()){\n    			cout<<'1 '<<ecells.back().ff<<' '<<ecells.back().ss<<endl;\n    			ecells.pop_back();\n    		}\n    		else{\n    			// fill 2 in odd\n    			cout<<'2 '<<ocells.back().ff<<' '<<ocells.back().ss<<endl;\n    			ocells.pop_back();\n    		}\n    		cnt++;\n    	}\n    }\n    \n    \n \n }\n \n \n signed main(void)     \n {\n \n 	fast;\n \n   \n 	int _=1;\n 	//cin>>_;\n  \n       for(int test_case=1;test_case<=_;++test_case){\n          solve();\n       }\n    \n 	\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   char str[3][100];\n   int i;\n   for (i = 0; i < 3; i++) {\n     scanf('%s ', &str[i][0]);\n   }\n   int r = 0, p = 0, s = 0;\n   for (i = 0; i < 3; i++) {\n     if (str[i][0] == 'r')\n       r++;\n     else if (str[i][0] == 'p')\n       p++;\n     else if (str[i][0] == 's')\n       s++;\n   }\n   char m = 'a';\n   if (r == 1 && s == 2)\n     m = 'r';\n   else if (s == 1 && p == 2)\n     m = 's';\n   else if (p == 1 && r == 2)\n     m = 'p';\n   if (m != 'a') {\n     for (i = 0; i < 3; i++) {\n       if (str[i][0] == m) break;\n     }\n     if (i == 0)\n       printf('F');\n     else if (i == 1)\n       printf('M');\n     else if (i == 2)\n       printf('S');\n   } else\n     printf('?');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int powe(long long int d, long long int s) {\n   if (s == 1)\n     return d;\n   else if (s == 0)\n     return 1;\n   else {\n     long long int u, v = d;\n     for (u = 1; u < s; u++) {\n       d = d * v;\n     }\n     return d;\n   }\n }\n bool isprime(long long int n) {\n   long long int i;\n   for (i = 2; i * i <= n; i++) {\n     if (n % i == 0) {\n       return false;\n     }\n   }\n   return true;\n }\n long long int a[2000005], c[10000005];\n int main() {\n   map<int, int> b;\n   long long int i, p, y, mx = -1, j, q;\n   cin >> p >> y;\n   for (i = y; i > p; i--) {\n     q = 1;\n     for (j = 2; j * j <= i && j <= p; j++) {\n       if (i % j == 0) {\n         q = 0;\n         break;\n       }\n     }\n     if (q == 1) {\n       cout << i;\n       return 0;\n     }\n   }\n   cout << -1;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using llint = long long;\n using par = pair<int, int>;\n const int MAXN = 200100;\n llint w[MAXN];\n vector<par> edges[MAXN];\n int p[MAXN], in[MAXN], out[MAXN], idx[MAXN], id;\n void dfs(int u) {\n   in[u] = ++id;\n   for (const auto& edge : edges[u]) {\n     if (edge.first == p[u]) continue;\n     p[edge.first] = u;\n     idx[edge.first] = edge.second;\n     dfs(edge.first);\n   }\n   out[u] = id;\n }\n int next(int u) { return w[idx[u]] == 1 ? p[u] = next(p[u]) : u; }\n void toLCA(int u, int v, llint& c) {\n   if (!u || !c) return;\n   if (in[u] <= in[v] && out[u] >= out[v]) return;\n   c /= w[idx[u]];\n   toLCA(p[u] = next(p[u]), v, c);\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   llint c;\n   int n, m, u, v;\n   cin >> n >> m;\n   for (int i = 1; i < n; ++i) {\n     cin >> u >> v >> w[i];\n     edges[u].emplace_back(v, i);\n     edges[v].emplace_back(u, i);\n   }\n   dfs(1);\n   while (m--) {\n     cin >> u;\n     if (u == 1) {\n       cin >> u >> v >> c;\n       toLCA(u, v, c);\n       toLCA(v, u, c);\n       cout << c << '\n';\n     } else {\n       cin >> u >> c;\n       w[u] = c;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n ll BASE_NUM = 998244353;\n class UnionFindTree {\n   map<ll, ll> union_tree_data;\n \n  public:\n   UnionFindTree() {}\n   UnionFindTree(vector<ll> verticals) {\n     for (auto v : verticals) {\n       union_tree_data[v] = v;\n     }\n   }\n   void add_vertical(ll v) { union_tree_data[v] = v; }\n   void reset() {\n     for (auto &pair : union_tree_data) {\n       pair.second = pair.first;\n     }\n   }\n   long long find(long long N) {\n     if (union_tree_data[N] == N) {\n       return N;\n     } else {\n       return union_tree_data[N] = find(union_tree_data[N]);\n     }\n   }\n   bool same(long long x, long long y) { return find(x) == find(y); }\n   void union_tree(long long x, long long y) {\n     x = find(x);\n     y = find(y);\n     if (x == y) return;\n     union_tree_data[x] = y;\n   }\n };\n class edge {\n  public:\n   ll from, to, cost;\n   bool operator<(const edge &another) const { return cost < another.cost; };\n   bool operator>(const edge &another) const { return cost > another.cost; };\n };\n class MST {\n   UnionFindTree uft;\n \n  public:\n   priority_queue<edge, vector<edge>, greater<edge>> que;\n   vector<edge> result;\n   ll cost = 0;\n   MST(vector<ll> &nodes, vector<edge> &edges) : uft(nodes) {\n     for (auto e : edges) {\n       que.push(e);\n     }\n     while (!que.empty()) {\n       edge e;\n       e = que.top();\n       if (!uft.same(e.from, e.to)) {\n         uft.union_tree(e.from, e.to);\n         result.push_back(e);\n         cost += e.cost;\n       }\n       que.pop();\n     }\n   }\n };\n int main() {\n   ll n;\n   vector<pair<ll, ll>> towns;\n   vector<ll> costs;\n   vector<ll> ks;\n   vector<edge> edges;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     pair<ll, ll> p;\n     cin >> p.first >> p.second;\n     towns.push_back(p);\n   }\n   for (int i = 0; i < n; i++) {\n     ll c;\n     cin >> c;\n     costs.push_back(c);\n   }\n   for (int i = 0; i < n; i++) {\n     ll k;\n     cin >> k;\n     ks.push_back(k);\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = i + 1; j < n; j++) {\n       edges.push_back({i, j,\n                        (abs(towns[i].first - towns[j].first) +\n                         abs(towns[i].second - towns[j].second)) *\n                            (ks[i] + ks[j])});\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     edges.push_back({i, n, costs[i]});\n   }\n   vector<ll> nodes(n + 1);\n   for (int i = 0; i < n + 1; i++) {\n     nodes[i] = i;\n   }\n   MST mst(nodes, edges);\n   vector<ll> stations;\n   vector<pair<ll, ll>> connections;\n   for (auto e : mst.result) {\n     if (e.to == n) {\n       stations.push_back(e.from);\n     } else {\n       connections.push_back(make_pair(e.from, e.to));\n     }\n   }\n   cout << mst.cost << '\n';\n   cout << stations.size() << '\n';\n   for (int i = 0; i < stations.size(); i++) {\n     if (i == 0) {\n       cout << stations[i] + 1;\n     } else {\n       cout << ' ' << stations[i] + 1;\n     }\n   }\n   cout << '\n';\n   cout << connections.size() << '\n';\n   for (int i = 0; i < connections.size(); i++) {\n     cout << connections[i].first + 1 << ' ' << connections[i].second + 1\n          << '\n';\n   }\n   cout << flush;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #define fi first\n #define se second\n #define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,size,stdin),p1==p2)?EOF:*p1++)\n #define mk make_pair\n #define pii pair<int, int>\n #define pll pair<ll, ll>\n #define pb push_back\n #define IT iterator\n #define V vector\n #define TP template <class o>\n #define TPP template <typename t1, typename t2>\n #define SZ(a) ((int)a.size())\n #define all(a) a.begin(), a.end()\n #define rep(i, a, b) for (int i = a; i <= b; i++)\n #define REP(i, a, b) for (int i = b; i >= a; i--)\n #define FOR(i,n) rep(i,1,n)\n #define debug(x) cerr << #x << ' = ' << x << endl\n using namespace std;\n typedef unsigned ui;\n typedef long long ll;\n typedef unsigned long long ull;\n typedef double db;\n typedef long double ld;\n const int N = 3010, size = 1 << 20, mod = 998244353, inf = 2e9;\n const ll INF = 1e15;\n \n // char buf[size],*p1=buf,*p2=buf;\n TP void qr(o& x) {\n     char c = gc;\n     x = 0;\n     int f = 1;\n     while (!isdigit(c)) {\n         if (c == '-')\n             f = -1;\n         c = gc;\n     }\n     while (isdigit(c))\n         x = x * 10 + c - '0', c = gc;\n     x *= f;\n }\n template<class o,class ... O> void qr(o& x, O& ... y) {qr(x); qr(y...);}\n TP void qw(o x) {\n     if (x / 10)\n         qw(x / 10);\n     putchar(x % 10 + '0');\n }\n TP void pr1(o x) {\n     if (x < 0)\n         x = -x, putchar('-');\n     qw(x);\n     putchar(' ');\n }\n template<class o,class ... O> void pr1(o x, O ... y) { pr1(x); pr1(y...);}\n TP void pr2(o x) {\n     if (x < 0)\n         x = -x, putchar('-');\n     qw(x);\n     putchar('\n');\n }\n template<class o,class ... O> void pr2(o x, O ... y) { pr2(x); pr2(y...);}\n \n // math\n ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }\n ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\n ll power(ll a, ll b = mod - 2, ll p = mod) {\n     ll c = 1;\n     while (b) {\n         if (b & 1) c = c * a % p;\n         b /= 2;\n         a = a * a % p;\n     }\n     return c;\n }\n ll exgcd(ll a,ll b,ll &x,ll &y) {\n 	if(!a) {x=0; y=1; return b;}\n 	ll d=exgcd(b%a,a,y,x); x -= b/a*y;\n 	return d;\n }\n ll INV(ll n,ll p=mod) {ll x,y; exgcd(n,p,x,y); return (x%p+p)%p;}\n \n TP void cmax(o& x, o y) {\n     if (x < y)\n         x = y;\n }\n TP void cmin(o& x, o y) {\n     if (x > y)\n         x = y;\n }\n TPP void ad(t1& x, t2 y) {\n     x += y;\n     if (x >= mod)\n         x -= mod;\n }\n TPP void dl(t1& x, t2 y) {\n     x -= y;\n     if (x < 0)\n         x += mod;\n }\n  \n int n, m, X[N], Y[N];\n V<int> e[N], g[N], E, P;\n bool v[N];\n #define DEBUG\n \n void dfs(int x) {\n 	int i, y;\n 	while(SZ(g[x])) {\n 		i = g[x].back(); g[x].pop_back();\n 		if(v[i]) continue;\n 		y = x ^ X[i] ^ Y[i];\n 		v[i] = 1; dfs(y);\n 	}\n 	P.pb(x);\n }\n \n void check(int s, int w = 0) {\n 	FOR(i, n) g[i] = e[i];\n 	FOR(i, m) v[i] = 0;\n 	int cnt = 0;\n 	FOR(i, n) if(i ^ s) cnt += SZ(e[i]) & 1;\n 	if(cnt > 1) return ;\n 	P.clear(); dfs(s);\n 	if(SZ(P) + SZ(E) - 1 - (w > 0) != m) return ;\n 	P.pb(-1);\n 	for(int i: E) if(i ^ w) P.pb(X[i] ^ Y[i] ^ s), P.pb(s); \n 	pr2(SZ(P));\n 	for(int i: P) pr1(i);\n 	exit(0);\n }\n \n void solve() {\n 	qr(n, m);\n 	FOR(i, m) qr(X[i], Y[i]);\n 	FOR(s, n) {\n 		FOR(i, n) e[i].clear();\n 		P.clear(); E.clear();\n 		FOR(i, m) {\n 			int x = X[i], y = Y[i];\n 			if(x == s || y == s) continue;\n 			e[x].pb(i); e[y].pb(i);\n 		}\n 		FOR(i, m) {\n 			int x = X[i], y = Y[i];\n 			if(x == s || y == s) {\n 				int v = s ^ x ^ y;\n 				if(SZ(e[v]) & 1) e[s].pb(i), e[v].pb(i);\n 				else E.pb(i);\n 			}\n 		}\n 		check(s);\n 		for(int i: E) {\n 			e[X[i]].pb(i); e[Y[i]].pb(i);\n 			check(s, i);\n 			e[X[i]].pop_back(); e[Y[i]].pop_back();\n 		}\n 	}\n 	puts('0');\n }\n \n int main() {\n     int T = 1;\n //    qr(T);\n     while (T--)\n         solve();\n     return 0;\n }\n \n \n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool found = false;\n long long b, A[10000], n, orig_a;\n void bfs(long long a, long long k) {\n   if (found) return;\n   if (a > b) return;\n   if (a == b) {\n     found = true;\n     n = k;\n     a = orig_a;\n     cout << 'YES' << endl;\n     cout << n + 1 << endl;\n     cout << a;\n     for (int i = 0; i < n; i++) {\n       if (A[i] == 1) {\n         a = a * 10 + 1;\n         cout << ' ' << a;\n       } else if (A[i] == 2) {\n         a = a * 2;\n         cout << ' ' << a;\n       }\n     }\n     cout << endl;\n     return;\n   }\n   A[k] = 2;\n   bfs(a * 2, k + 1);\n   A[k] = 1;\n   bfs((a * 10) + 1, k + 1);\n }\n int main() {\n   long long a, c, d, i, j, m;\n   string s;\n   cin >> a >> b;\n   orig_a = a;\n   bfs(a, 0);\n   if (!found) cout << 'NO' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n class Compare {\n  public:\n   bool operator()(pair<long long, long long> a, pair<long long, long long> b) {\n     return (a.first + a.second) > (b.first + b.second);\n   }\n };\n int main() {\n   long long test, x, n, m, k, w, d, f, y;\n   priority_queue<pair<long long, long long>,\n                  vector<pair<long long, long long> >, Compare>\n       pqw;\n   priority_queue<pair<long long, long long>,\n                  vector<pair<long long, long long> >, Compare>\n       pqd;\n   priority_queue<pair<long long, long long>,\n                  vector<pair<long long, long long> >, Compare>\n       pqf;\n   scanf('%lld%lld%lld%lld%lld%lld%lld', &x, &n, &m, &k, &w, &d, &f);\n   for (long long i = 0; i < n; i++) {\n     pqw.push(make_pair(0, w));\n   }\n   for (long long i = 0; i < m; i++) {\n     pqd.push(make_pair(0, d));\n   }\n   for (long long i = 0; i < k; i++) {\n     pqf.push(make_pair(0, f));\n   }\n   long long ans = 0;\n   for (long long i = 0; i < x; i++) {\n     pair<long long, long long> cur = pqw.top();\n     pqw.pop();\n     pqw.push(make_pair(cur.first + cur.second, cur.second));\n     pair<long long, long long> curd = pqd.top();\n     pqd.pop();\n     curd.first = max(cur.first + cur.second, curd.first) + d;\n     pqd.push(curd);\n     pair<long long, long long> curf = pqf.top();\n     pqf.pop();\n     curf.first = max(curd.first, curf.first) + f;\n     pqf.push(curf);\n     ans = curf.first;\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int P = 1e9 + 7;\n vector<int> b[200005];\n int L[200005], R[200005], u[200005], v[200005], opt[200005], size[200005];\n int m, n, ql, qr, upd, tot, now, ans, i, x;\n struct data {\n   int cnt, sum;\n   data() { cnt = 1; }\n   void multi(int x) {\n     cnt = 1ll * cnt * x % P;\n     sum = 1ll * sum * x % P;\n   }\n   int renew(int x) {\n     cnt = 1;\n     sum = x;\n     return 0;\n   }\n } a[200005 << 2];\n void DFS(int x, int Fa) {\n   L[x] = ++tot;\n   for (int i = 0, y; i < b[x].size(); i++)\n     if ((y = b[x][i]) != Fa) DFS(y, x);\n   R[x] = tot;\n }\n int INV(int a) {\n   int ret = 1, b = P - 2;\n   for (; b; b >>= 1, a = 1ll * a * a % P)\n     if (b & 1) ret = 1ll * ret * a % P;\n   return ret;\n }\n inline void down(int x) {\n   if (a[x].cnt == 1) return;\n   a[x << 1].multi(a[x].cnt);\n   a[x << 1 | 1].multi(a[x].cnt);\n   a[x].cnt = 1;\n }\n inline void up(int x) { a[x].sum = (a[x << 1].sum + a[x << 1 | 1].sum) % P; }\n void Multi(int x, int l, int r) {\n   if (ql <= l && r <= qr) {\n     a[x].multi(now);\n     return;\n   }\n   int mid = (l + r) >> 1;\n   down(x);\n   if (ql <= mid) Multi(x << 1, l, mid);\n   if (qr > mid) Multi(x << 1 | 1, mid + 1, r);\n   up(x);\n }\n int Update(int x, int l, int r, int pos) {\n   if (l == r) return (!upd) ? a[x].sum : a[x].renew(now);\n   int mid = (l + r) >> 1;\n   down(x);\n   int ret = (pos <= mid) ? Update(x << 1, l, mid, pos)\n                          : Update(x << 1 | 1, mid + 1, r, pos);\n   return up(x), ret;\n }\n void Query(int x, int l, int r) {\n   if (ql <= l && r <= qr) {\n     ans = (ans + a[x].sum) % P;\n     return;\n   }\n   int mid = (l + r) >> 1;\n   down(x);\n   if (ql <= mid) Query(x << 1, l, mid);\n   if (qr > mid) Query(x << 1 | 1, mid + 1, r);\n }\n int main() {\n   scanf('%d%d', &v[1], &m);\n   n = 1;\n   for (i = 1; i <= m; i++) {\n     scanf('%d%d', &opt[i], &u[i]);\n     if (opt[i] == 1) scanf('%d', &v[++n]), b[u[i]].push_back(n);\n   }\n   DFS(1, 0);\n   size[n = 1] = 1;\n   upd = 1;\n   now = v[1];\n   Update(1, 1, tot, L[1]);\n   for (i = 1; i <= m; i++)\n     if (opt[i] == 1) {\n       x = u[i];\n       size[++n] = 1;\n       ql = L[x];\n       qr = R[x];\n       now = 1ll * (size[x] + 1) * INV(size[x]) % P;\n       ++size[x];\n       Multi(1, 1, tot);\n       upd = 0;\n       now = Update(1, 1, tot, L[x]);\n       now = 1ll * now * INV(v[x]) % P;\n       now = 1ll * now * v[n] % P;\n       upd = 1;\n       Update(1, 1, tot, L[n]);\n     } else {\n       x = u[i];\n       ans = 0;\n       ql = L[x];\n       qr = R[x];\n       Query(1, 1, tot);\n       upd = 0;\n       now = Update(1, 1, tot, L[x]);\n       now = 1ll * now * INV(1ll * v[x] * size[x] % P) % P;\n       ans = 1ll * ans * INV(now) % P;\n       printf('%d\n', ans);\n     }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1000000007;\n const long double PI = 3.141592653589793;\n const long long maxn = 100005;\n long long x, y, z, n, k;\n void _print(long long t) { cerr << t; }\n void _print(string t) { cerr << t; }\n void _print(char t) { cerr << t; }\n void _print(long double t) { cerr << t; }\n void _print(double t) { cerr << t; }\n template <class T, class V>\n void _print(pair<T, V> p);\n template <class T>\n void _print(vector<T> v);\n template <class T>\n void _print(set<T> v);\n template <class T, class V>\n void _print(map<T, V> v);\n template <class T>\n void _print(multiset<T> v);\n template <class T, class V>\n void _print(pair<T, V> p) {\n   cerr << '{';\n   _print(p.first);\n   cerr << ',';\n   _print(p.second);\n   cerr << '}';\n }\n template <class T>\n void _print(vector<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T>\n void _print(set<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T>\n void _print(multiset<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T, class V>\n void _print(map<T, V> v) {\n   cerr << '[ ';\n   for (auto i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n void solve() {\n   string s, t;\n   cin >> s >> t;\n   long long f[26];\n   memset(f, 0, sizeof(f));\n   long long n = (long long)s.size(), m = (long long)t.size();\n   vector<vector<long long>> v(26);\n   for (long long i = 0; i <= n - 1; i++) {\n     f[s[i] - 'a']++;\n     v[s[i] - 'a'].push_back(i);\n   }\n   for (long long i = 0; i <= m - 1; i++) {\n     if (f[t[i] - 'a'] == 0) {\n       cout << -1 << '\n';\n       return;\n     }\n   }\n   long long ans = 1, last = -1;\n   for (long long i = 0; i <= m - 1; i++) {\n     long long prev = last;\n     long long val = t[i] - 'a';\n     long long pos =\n         lower_bound(v[val].begin(), v[val].end(), last + 1) - v[val].begin();\n     if (pos == v[val].size()) {\n       ans++;\n       last = v[val][0];\n     } else {\n       last = v[val][pos];\n     }\n   }\n   cout << ans << '\n';\n }\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   cout << setprecision(15) << fixed;\n   long long t;\n   t = 1;\n   cin >> t;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const double eps = 1e-8;\n const long long INF = 0x3f3f3f3f;\n const int mod = 20000311;\n const int maxn = 1e5 + 5;\n const int N = 1005;\n using namespace std;\n int a[maxn] = {0};\n int dp[maxn][305] = {0};\n int n;\n int dfs(int p, int k) {\n   if (p > n) return 0;\n   if (dp[p][k] != -1) return dp[p][k];\n   int num = p + a[p] + k;\n   return dp[p][k] = dfs(num, k) + 1;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]);\n   for (int j = 1; j <= 300; j++) {\n     for (int i = n; i >= 1; i--) {\n       int num = i + a[i] + j;\n       if (num > n)\n         dp[i][j] = 1;\n       else\n         dp[i][j] = dp[num][j] + 1;\n     }\n   }\n   int q;\n   scanf('%d', &q);\n   while (q--) {\n     int p, k;\n     scanf('%d %d', &p, &k);\n     if (k >= 300) {\n       int res = 0;\n       while (p <= n) {\n         p = a[p] + k + p;\n         res++;\n       }\n       cout << res << '\n';\n     } else\n       cout << dp[p][k] << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string Max(int n, int s) {\n   string str = '';\n   while (s >= 9 && n > 0) {\n     str += '9';\n     s -= 9;\n     n--;\n   }\n   if (n == 0 && s > 0) return '-1';\n   if (n > 0) {\n     str += char(s + 48);\n     for (int i = 1; i < n; i++) str += '0';\n   }\n   return str;\n }\n int main() {\n   int n, s;\n   string str = '';\n   cin >> n >> s;\n   if (n * 9 < s)\n     cout << '-1 -1';\n   else if (n > 1 and s == 0)\n     cout << '-1 -1';\n   else if (s == 1) {\n     cout << 1;\n     for (int i = 1; i < n; i++) cout << 0;\n     cout << ' 1';\n     for (int i = 1; i < n; i++) cout << 0;\n   } else {\n     for (int i = Max(n, s).size() - 1; i >= 0; i--) str += Max(n, s)[i];\n     if (str[0] == '0' and str.size() > 1) {\n       str[0] = '1';\n       for (int i = 1; i < str.size(); i++)\n         if (str[i] > '0') {\n           str[i] = char(int(str[i]) - 1);\n           break;\n         }\n     }\n     cout << str << ' ' << Max(n, s);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int max3(int a, int b, int c) { return max(a, max(b, c)); }\n inline int min3(int a, int b, int c) { return min(a, min(b, c)); }\n const int INF = 1e9;\n const long long LINF = 1e18;\n const double EPS = 1e-6;\n const double PI = acos(-1.0);\n const int maxn = 150;\n int n, m, k;\n int a[maxn][maxn][maxn];\n int ans;\n int main() {\n   scanf('%d %d %d\n', &n, &m, &k);\n   char b[maxn];\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < m; ++j) {\n       gets(b);\n       for (int p = 0; p < k; ++p) a[i][j][p] = b[p] == '1';\n     }\n     if (i < n - 1) gets(b);\n   }\n   ans = 0;\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < m; ++j) {\n       for (int p = 0; p < k; ++p) {\n         if (!a[i][j][p]) continue;\n         if ((p > 0 && p < k - 1 && a[i][j][p - 1] && a[i][j][p + 1]) ||\n             (p > 0 && j < m - 1 && a[i][j][p - 1] && a[i][j + 1][p] &&\n              !a[i][j + 1][p - 1]) ||\n             (p > 0 && i < n - 1 && a[i][j][p - 1] && a[i + 1][j][p] &&\n              !a[i + 1][j][p - 1]) ||\n             (j > 0 && j < m - 1 && a[i][j - 1][p] && a[i][j + 1][p]) ||\n             (j > 0 && p < k - 1 && a[i][j - 1][p] && a[i][j][p + 1] &&\n              !a[i][j - 1][p + 1]) ||\n             (j > 0 && i < n - 1 && a[i][j - 1][p] && a[i + 1][j][p] &&\n              !a[i + 1][j - 1][p]) ||\n             (i > 0 && i < n - 1 && a[i - 1][j][p] && a[i + 1][j][p]) ||\n             (i > 0 && j < m - 1 && a[i - 1][j][p] && a[i][j + 1][p] &&\n              !a[i - 1][j + 1][p]) ||\n             (i > 0 && p < k - 1 && a[i - 1][j][p] && a[i][j][p + 1] &&\n              !a[i - 1][j][p + 1]))\n           ++ans;\n       }\n     }\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int M = 1e9 + 7;\n const int MAX_N = 1002;\n int dp_end[MAX_N][MAX_N];\n int dp_not[MAX_N][MAX_N];\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     dp_end[0][i] = (i + 1) / 2;\n     dp_not[0][i] = i / 2;\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = i; j <= n; j++) {\n       dp_end[i][j] = 1 + dp_not[i - 1][j] + dp_end[i][j - 1];\n       if (i - 1 >= j) {\n         dp_end[i][j] =\n             max(dp_end[i][j], 1 + dp_not[i][j - 1] + dp_end[i - 1][j]);\n       }\n       dp_end[i][j] %= M;\n       dp_not[i][j] = dp_end[i][j - 1] + dp_end[i - 1][j];\n       dp_not[i][j] %= M;\n     }\n   }\n   cout << dp_end[n][n] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void c_p_c() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n }\n int32_t main() {\n   c_p_c();\n   long long n;\n   string s[222222];\n   map<string, bool> check;\n   cin >> n;\n   for (long long i = 1; i <= n; i++) {\n     cin >> ws;\n     getline(cin, s[i]);\n   }\n   for (long long i = n; i >= 1; i--) {\n     if (!check[s[i]]) {\n       check[s[i]] = 1;\n       cout << s[i] << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using std::max;\n using std::min;\n const int inf = 0x3f3f3f3f, Inf = 0x7fffffff;\n const long long INF = 0x3f3f3f3f3f3f3f3f;\n __inline__ __attribute__((always_inline)) unsigned int rnd() {\n   static unsigned int seed = 416;\n   return seed ^= seed >> 5, seed ^= seed << 17, seed ^= seed >> 13;\n }\n template <typename _Tp>\n _Tp gcd(const _Tp &a, const _Tp &b) {\n   return (!b) ? a : gcd(b, a % b);\n }\n template <typename _Tp>\n __inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) {\n   return a >= 0 ? a : -a;\n }\n template <typename _Tp>\n __inline__ __attribute__((always_inline)) void chmax(_Tp &a, const _Tp &b) {\n   (a < b) && (a = b);\n }\n template <typename _Tp>\n __inline__ __attribute__((always_inline)) void chmin(_Tp &a, const _Tp &b) {\n   (b < a) && (a = b);\n }\n template <typename _Tp>\n __inline__ __attribute__((always_inline)) void read(_Tp &x) {\n   char ch(getchar());\n   bool f(false);\n   while (!isdigit(ch)) f |= ch == 45, ch = getchar();\n   x = ch & 15, ch = getchar();\n   while (isdigit(ch)) x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar();\n   f && (x = -x);\n }\n template <typename _Tp, typename... Args>\n __inline__ __attribute__((always_inline)) void read(_Tp &t, Args &...args) {\n   read(t);\n   read(args...);\n }\n template <typename _Tp, typename... Args>\n __inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b,\n                                                   const Args &...args) {\n   return a < b ? min(a, args...) : min(b, args...);\n }\n template <typename _Tp, typename... Args>\n __inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b,\n                                                   const Args &...args) {\n   return a < b ? max(b, args...) : max(a, args...);\n }\n __inline__ __attribute__((always_inline)) int read_str(char *s) {\n   char ch(getchar());\n   while (ch == ' ' || ch == '\r' || ch == '\n') ch = getchar();\n   char *tar = s;\n   *tar = ch, ch = getchar();\n   while (ch != ' ' && ch != '\r' && ch != '\n' && ch != EOF)\n     *(++tar) = ch, ch = getchar();\n   return tar - s + 1;\n }\n const int N = 100005;\n const int MAXN = 10000005;\n bool pr[MAXN];\n int _p[MAXN >> 3], _pos;\n int md[MAXN];\n void sieve() {\n   for (int i = 2; i < MAXN; ++i) {\n     if (!pr[i]) {\n       _p[++_pos] = i;\n       md[i] = i;\n     }\n     for (int j = 1; j <= _pos && i * _p[j] < MAXN; ++j) {\n       pr[i * _p[j]] = true;\n       md[i * _p[j]] = _p[j];\n       if (!(i % _p[j])) break;\n     }\n   }\n }\n std::vector<int> p[N], d[N];\n int c[MAXN], cnt[1 << 8], mul[1 << 8];\n int calc(int id) {\n   int siz = ((int)p[id].size()), ans = 0;\n   for (int i = 0; i < siz; ++i) mul[1 << i] = p[id][i];\n   for (int i = 1; i < 1 << siz; ++i) {\n     cnt[i] = cnt[i >> 1] + (i & 1);\n     mul[i] = mul[i ^ ((i) & (-(i)))] * mul[((i) & (-(i)))];\n     if (cnt[i] & 1)\n       ans += c[mul[i]];\n     else\n       ans -= c[mul[i]];\n   }\n   return ans;\n }\n int a[N];\n int _val[11], _cnt[11], pos, cur_id;\n void dfs(int dep, int val) {\n   if (dep == pos + 1) {\n     d[cur_id].push_back(val);\n     return;\n   }\n   for (int i = 0; i <= _cnt[dep]; ++i) {\n     dfs(dep + 1, val);\n     if (i < _cnt[dep]) val *= _val[dep];\n   }\n }\n bool ban[N], vis[N];\n int deg[N];\n int f(int mid) {\n   while (ban[mid]) --mid;\n   if (!mid) return false;\n   int qwq = 0;\n   for (int i = 1; i <= mid; ++i)\n     if (!ban[i]) {\n       ++qwq;\n       for (auto it : d[i]) ++c[it];\n     }\n   int ans = 0;\n   for (int i = 1; i <= mid; ++i)\n     if (!ban[i] && calc(i) != qwq) ++ans;\n   for (int i = 1; i <= mid; ++i)\n     if (!ban[i])\n       for (auto it : d[i]) --c[it];\n   return ans;\n }\n std::vector<int> getnodes(int mid) {\n   while (ban[mid]) --mid;\n   std::vector<int> nd;\n   int qwq = 0;\n   for (int i = 1; i <= mid; ++i)\n     if (!ban[i]) {\n       ++qwq;\n       for (auto it : d[i]) ++c[it];\n     }\n   for (int i = 1; i <= mid; ++i)\n     if (!ban[i] && calc(i) != qwq) nd.push_back(i);\n   for (int i = 1; i <= mid; ++i)\n     if (!ban[i])\n       for (auto it : d[i]) --c[it];\n   return nd;\n }\n int main() {\n   mul[0] = 1;\n   sieve();\n   int n, k;\n   read(n, k);\n   for (int i = 1; i <= n; ++i) {\n     read(a[i]);\n     ++c[a[i]];\n     int cur = a[i], last = 0;\n     pos = 0;\n     while (cur > 1) {\n       if (md[cur] != last)\n         p[i].push_back(md[cur]), _val[++pos] = md[cur], _cnt[pos] = 1;\n       else\n         ++_cnt[pos];\n       last = md[cur];\n       cur /= last;\n     }\n     cur_id = i;\n     dfs(1, 1);\n   }\n   for (int j = 1; j <= _pos; ++j)\n     for (int i = (MAXN - 1) / _p[j]; i >= 1; --i) c[i] += c[i * _p[j]];\n   std::vector<int> nd;\n   for (int i = 1; i <= n; ++i) {\n     if ((deg[i] = calc(i)) <= n - 2) {\n       nd.push_back(i);\n       for (int j = 1; j <= n && ((int)nd.size()) < 3; ++j)\n         if (i != j && gcd(a[i], a[j]) == 1) nd.push_back(j);\n       break;\n     }\n   }\n   if (nd.empty()) {\n     std::vector<int> clique, rest;\n     for (int i = 1; i <= n; ++i)\n       if (deg[i] == n)\n         clique.push_back(i);\n       else\n         rest.push_back(i);\n     if (((int)clique.size()) > k) clique.resize(k);\n     for (int i = 1; i <= n && ((int)clique.size()) < k; ++i) {\n       if (!vis[i] && deg[i] == n - 1) {\n         clique.push_back(i);\n         for (auto it : rest)\n           if (gcd(a[it], a[i]) == 1) vis[it] = true;\n       }\n     }\n     for (auto it : clique) printf('%d ', it);\n     printf('\n');\n     return 0;\n   }\n   if (k == 3) {\n     for (auto it : nd) printf('%d ', it);\n     printf('\n');\n     return 0;\n   }\n   for (auto it : nd) ban[it] = true;\n   for (auto id : nd)\n     for (auto it : d[id]) --c[it];\n   std::vector<int> clique;\n   for (int i = 1; i <= n; ++i)\n     if (!ban[i] && ((deg[i] = calc(i)) == n - 3)) clique.push_back(i);\n   if (((int)clique.size()) >= k) {\n     clique.resize(k);\n     for (auto it : clique) printf('%d ', it);\n     printf('\n');\n     return 0;\n   }\n   memset(c, 0, sizeof(c));\n   int l = 1, r = n;\n   while (l < r) {\n     int mid = (l + r) >> 1;\n     if (f(mid) + 3 >= k)\n       r = mid;\n     else\n       l = mid + 1;\n   }\n   std::vector<int> v1 = getnodes(l - 1);\n   std::vector<int> v2 = getnodes(l);\n   std::sort(v1.begin(), v1.end());\n   std::vector<int> qwq;\n   for (auto it : v2) {\n     auto _ = std::lower_bound(v1.begin(), v1.end(), it);\n     if (_ == v1.end() || *_ != it) qwq.push_back(it);\n   }\n   std::sort(qwq.begin(), qwq.end());\n   if (((int)v1.size()) + 3 + 1 == k && ((int)qwq.size()) != 1)\n     v1.push_back(nd[0]), v1.push_back(nd[1]);\n   else\n     v1.push_back(nd[0]), v1.push_back(nd[1]), v1.push_back(nd[2]);\n   while (((int)v1.size()) < k) {\n     v1.push_back(qwq.back());\n     qwq.pop_back();\n   }\n   for (auto it : v1) printf('%d ', it);\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void fact(int n) {\n   const int N = 1e5;\n   vector<int> arr(N, 0);\n   int q = 2;\n   arr[0] = 1;\n   int len = 1;\n   int x = 0;\n   int carry = 0;\n   while (q <= n) {\n     x = 0;\n     carry = 0;\n     while (x < len) {\n       arr[x] = arr[x] * q + carry;\n       carry = arr[x] / 10;\n       arr[x] = arr[x] % 10;\n       x++;\n     }\n     while (carry) {\n       arr[len] = carry % 10;\n       carry = carry / 10;\n       len++;\n     }\n     q++;\n   }\n   len--;\n   for (int i = len; i >= 0; i--) {\n     cout << arr[i];\n   }\n   return;\n }\n long long int binary_exp(long long int x, long long int n) {\n   if (n == 0) {\n     return 1;\n   } else if (n == 1) {\n     return x % 1000000007;\n   } else {\n     long long int temp = binary_exp(x, n / 2);\n     temp = (temp * temp) % 1000000007;\n     if (n % 2 == 0) {\n       return temp;\n     } else {\n       return ((x % 1000000007) * temp) % 1000000007;\n     }\n   }\n }\n int main() {\n   int k, r;\n   cin >> k >> r;\n   int i = 1;\n   while (i * k % 10 != r and i * k % 10 != 0) {\n     i++;\n   }\n   cout << i;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool vis[100006];\n int main() {\n   int n, k;\n   while (cin >> n >> k) {\n     memset(vis, false, sizeof(vis));\n     int st = 1, ed = 1 + k;\n     int cnt = 0;\n     while (cnt < k && st <= ed) {\n       if (st != ed)\n         vis[st] = vis[ed] = true, cout << st << ' ' << ed << ' ';\n       else\n         vis[st] = true, cout << st << ' ';\n       st++, ed--;\n       cnt++;\n     }\n     for (int i = 1; i <= n; i++) {\n       if (!vis[i]) cout << i << ' ';\n     }\n     puts('');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 500023;\n bool vis[N];\n vector<int> adj[N];\n void solve() {\n   long long int n, m;\n   cin >> n >> m;\n   map<long long int, long long int> cntA;\n   map<long long int, long long int> cntB;\n   map<long long int, long long int> cntC;\n   map<long long int, long long int> cntD;\n   map<long long int, long long int> cntE;\n   for (long long int i = 0; i < n; i++) {\n     string s;\n     cin >> s;\n     for (int i = 0; i < s.length(); i++) {\n       if (s[i] == 'A')\n         cntA[i]++;\n       else if (s[i] == 'B')\n         cntB[i]++;\n       else if (s[i] == 'C')\n         cntC[i]++;\n       else if (s[i] == 'D')\n         cntD[i]++;\n       else if (s[i] == 'E')\n         cntE[i]++;\n     }\n   }\n   long long int ans = 0;\n   for (int i = 0; i < m; i++) {\n     long long int c;\n     cin >> c;\n     long long int maxi = 0;\n     maxi = max(max(cntA[i], cntB[i]), cntC[i]);\n     maxi = max(max(maxi, cntD[i]), cntE[i]);\n     long long int temp = maxi * c;\n     ans += temp;\n   }\n   cout << ans;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int T = 1;\n   int t = 0;\n   while (t++ < T) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, x;\n int cnt[100], b[105][105], sol[105][105], c[105][105], a[105][105];\n inline void Mult_Mat(int a[][105], int b[][105]) {\n   int i, j, k, s;\n   for (i = 0; i < x; ++i)\n     for (j = 0; j < x; ++j) {\n       s = 0;\n       for (k = 0; k < x; ++k)\n         s = (1LL * s + 1LL * a[i][k] * b[k][j]) % 1000000007;\n       c[i][j] = s;\n     }\n   for (i = 0; i < x; ++i)\n     for (j = 0; j < x; ++j) a[i][j] = c[i][j];\n }\n inline void Pow_Log(int a[][105], int p) {\n   int i, j;\n   for (i = 0; i < x; ++i) sol[i][i] = 1;\n   while (p) {\n     if (p & 1) {\n       --p;\n       Mult_Mat(sol, a);\n     }\n     p >>= 1;\n     Mult_Mat(a, a);\n   }\n   for (i = 0; i < x; ++i)\n     for (j = 0; j < x; ++j) a[i][j] = sol[i][j];\n }\n int main() {\n   int i, j, B, k, xx;\n   cin.sync_with_stdio(0);\n   cin >> n >> B >> k >> x;\n   for (i = 1; i <= n; ++i) {\n     cin >> xx;\n     ++cnt[xx];\n   }\n   for (i = 0; i < x; ++i)\n     for (j = 0; j < 10; ++j)\n       b[i][(i * 10 + j) % x] = (b[i][(i * 10 + j) % x] + cnt[j]) % 1000000007;\n   Pow_Log(b, B);\n   a[1][0] = 1;\n   Mult_Mat(a, b);\n   cout << a[1][k] << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n #define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);\n #define int long long\n #define ull unsigned long long\n #define FOR(i,a,b) for(int i=a;i<b;i++)\n #define all(x) (x).begin(), (x).end()\n #define pb push_back\n #define mp make_pair\n #define in insert\n #define ff first\n #define ss second\n #define endl '\n'\n #define pi pair<int,int>\n #define  deb1(a)         cout<<a<<'\n';\n #define  deb2(a,b)       cout<<a<<' '<<b<<'\n';\n #define  deb3(a,b,c)     cout<<a<<' '<<b<<' '<<c<<'\n';\n #define  debp(a)         cout<<a.ff<<' '<<a.ss<<'\n';\n #define  debvec(a)      for(auto it: a)cout<<it<<' ';cout<<' '; cout<<endl;\n #define  debvp(a)      for(auto it: a)cout<<it.ff<<' '<<it.ss<<endl;\n #define  debmap(a)      for(auto it: a)cout<<'{'<<it.ff<<','<<it.ss<<'}, ';newl;\n #define  debarr(a,n)    FOR(i,0,n)cout<<a[i]<<' ';cout<<endl;\n #define inf ((int)1<<60)\n #define mod 1000000007\n using namespace std;\n //int,char,float,double,bool,string,break,continue,endl,if,else,set,multiset,multimap,unordered_map,unordered_set,cout,cin,printf,scanf\n //strlen,strcmp,compar e,auto,while,return,true,false,sizeof,size,abs,INT_MAX,INT_MIN,itr,it,sort,YES,NO\n \n signed main() {\n #ifndef ONLINE_JUDGE\n 	freopen('input.txt', 'r', stdin);\n 	freopen('output.txt', 'w', stdout);\n #endif\n 	fast_io\n 	int test, i, j;\n // 	cin >> test;\n 	test = 1;\n 	while (test--) {\n 		int n, m;\n 		cin >> n >> m;\n 		string s, t;\n 		cin >> s >> t;\n 		int a[m], b[m];\n 		j = 0;\n 		for (int i = 0; i < n; ++i) {\n 			if (s[i] == t[j]) {\n 				a[j] = i;\n 				j++;\n 			}\n 		}\n 		j = m - 1;\n 		for (int i = n - 1; i >= 0 ; i--) {\n 			if (s[i] == t[j]) {\n 				b[j] = i;\n 				j--;\n 			}\n 		}\n 		int ans = 0;\n 		for (int i = 0; i < m - 1; ++i) {\n 			ans = max(ans, b[i + 1] - a[i]);\n 		}\n 		cout << ans << endl;\n 	}\n \n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 110;\n const int mo = 1e9 + 7;\n int n, k, a[N], num[3], nn, f = 0;\n long long ans, now[N][N], dp[N][N], aa[N];\n long long po(long long a, long long b) {\n   if (b == 0) return 1;\n   if (b == 1) return a;\n   long long c = po(a, b / 2);\n   if (b & 1)\n     return c * c % mo * a % mo;\n   else\n     return c * c % mo;\n }\n long long tmp[N][N];\n void multi(long long a[][N], long long b[][N], int n) {\n   memset(tmp, 0, sizeof tmp);\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < n; j++)\n       for (int k = 0; k < n; k++)\n         tmp[i][j] = (tmp[i][j] + a[i][k] * b[k][j] % mo) % mo;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < n; j++) a[i][j] = tmp[i][j];\n }\n long long res[N][N];\n void Pow(long long a[][N], long long n) {\n   memset(res, 0, sizeof res);\n   for (int i = 0; i < num[0] + 1; i++) res[i][i] = 1;\n   while (n) {\n     if (n & 1) multi(res, a, num[0] + 1);\n     multi(a, a, num[0] + 1);\n     n >>= 1;\n   }\n }\n int main() {\n   scanf('%d%d', &n, &k);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]), num[a[i]]++;\n   if (num[0] < num[1]) {\n     for (int i = 1; i <= num[0]; i++)\n       if (!a[i]) nn++;\n   } else {\n     swap(num[0], num[1]);\n     for (int i = n; i >= n - num[0] + 1; i--)\n       if (a[i]) nn++;\n   }\n   for (int j = 0; j <= num[0]; j++) {\n     now[j][j] += j * (num[0] - j);\n     now[j][j] += (num[0] - j) * (num[1] - num[0] + j);\n     now[j][j] += num[0] * (num[0] - 1) / 2ll;\n     now[j][j] += num[1] * (num[1] - 1) / 2ll;\n     if (j + 1 <= num[0]) now[j][j + 1] = (j + 1) * (num[1] - (num[0] - j - 1));\n     if (j) now[j][j - 1] = (num[0] - j + 1) * (num[0] - j + 1);\n   }\n   Pow(now, k);\n   for (int i = 0; i <= num[0]; i++) ans = (ans + res[i][nn]) % mo;\n   printf('%lld\n', res[num[0]][nn] * po(ans, mo - 2) % mo);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MX = 1000000000;\n int n, m, x, i, j, a[5050], f[5050];\n int main() {\n   scanf('%d%d', &n, &m);\n   for (i = 3; i <= n; i++) f[i] = f[i - 1] + (i - 1) / 2;\n   if (f[n] < m) {\n     puts('-1');\n     return 0;\n   }\n   for (i = 3; i <= n; i++)\n     if (f[i] > m) break;\n   m -= f[--i];\n   for (j = 1; j <= i; j++) a[j] = j;\n   if (m > 0) {\n     for (j = 1; j < i; j++) {\n       x = (i + j - 1) / 2 - j + 1;\n       if (x == m) {\n         a[i + 1] = i + j;\n         break;\n       }\n     }\n     if (j >= i) {\n       puts('-1~');\n       return 0;\n     }\n     ++i;\n   }\n   x = a[i] + 1;\n   for (j = 2; j <= i; j++)\n     if (a[j] != a[j - 1] + 1) {\n       x = a[j - 1] + 1;\n       break;\n     }\n   for (++i; i <= n; ++i) {\n     a[i] = a[i - 1] + x;\n     if (a[i] > MX) break;\n   }\n   if (i <= n) {\n     puts('-1#');\n     return 0;\n   }\n   for (i = 1; i <= n; i++) printf('%d ', a[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double eps = 1e-9;\n const int INF = (int)1e9 + 7;\n const long long linf = (long long)1e16 + 7;\n struct pnt {\n   double x, y;\n   pnt(double x, double y) : y(y), x(x) {}\n   pnt() = default;\n };\n int cmp(double a, double b) {\n   if (abs(a - b) < eps) return 0;\n   if (a > b) return 1;\n   return -1;\n }\n int main() {\n   int n;\n   cin >> n;\n   int ans = 0;\n   vector<int> a(n);\n   for (int i = 0; i < n; ++i) cin >> a[i];\n   vector<int> cnt0(n + 1);\n   vector<int> cnt1(n + 1);\n   for (int i = 0; i < n; ++i) {\n     if (a[i] == 0) cnt0[i]++;\n     if (i) cnt0[i] += cnt0[i - 1];\n   }\n   for (int i = n - 1; i >= 0; --i) {\n     if (a[i] == 1) cnt1[i]++;\n     if (i != n - 1) cnt1[i] += cnt1[i + 1];\n   }\n   for (int i = 0; i < n; ++i) {\n     ans = max(ans, cnt0[i] + cnt1[i + 1]);\n     ans = max(ans, cnt1[i]);\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n \n using namespace std;\n \n #define    pf               printf\n #define    PF(a)            printf('%d\n',(a))\n #define    PF2(a,b)         printf('%d %d\n',(a), (b))\n #define    PF3(a,b,c)       printf('%d %d %d\n',(a), (b), (c))\n #define    PFL(a)           printf('%lld\n',(a))\n #define    PFL2(a,b)        printf('%lld %lld\n',(a), (b))\n #define    PFL3(a,b,c)      printf('%lld %lld %lld\n',(a), (b), (c))\n #define    get(a)           cin>>a\n #define    sf               scanf\n #define    SF(a)            scanf('%d',&a)\n #define    SF2(a,b)         scanf('%d %d',&a, &b)\n #define    SF3(a,b,c)       scanf('%d %d %d',&a, &b, &c)\n #define    SFL(a)           scanf('%lld',&a)\n #define    SFL2(a,b)        scanf('%lld %lld',&a, &b)\n #define    SFL3(a,b,c)      scanf('%lld %lld %lld',&a, &b, &c)\n #define    gl(a)            getline(cin,(a))\n #define    gc()             getchar()\n #define    pb               push_back\n #define    m_p              make_pair\n #define    pc()             printf('Case %d: ',tt++)\n #define    tc()             cout<<'Case '<<tt++<<': '\n #define    dbg(x)           cout << #x << ' -> ' << x << endl;\n #define    SZ(a)            (int)(a).size()\n #define    all(a)           a.begin(),a.end()\n #define    FF               first\n #define    SS               second\n #define    MAX              2134567891\n #define    MOD              1000000007\n #define    MM               200005\n #define    PI               2*acos(0.0)\n #define    cond(n,m)        (xx>=0 && xx<(n) && yy>=0 && yy<(m))\n \n #define    mem(a)           memset((a),0,sizeof (a))\n #define    SET(a)           memset((a),-1,sizeof (a))\n #define    output           freopen('output.txt','w',stdout);\n #define    input            freopen('input.txt','r',stdin);\n #define    I_O              ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0)\n #define    rep(a)           for(int i=0;i<(a);i++)\n #define    FOR(a,b)         for(int i=(a);i<(b);i++)\n #define    REP(a)           for(int j=0;j<(a);j++)\n #define    rev(a)           for(int i=(a);i>=0;i--)\n #define    fr(i,n)          for(i=0;i<n;i++)\n #define    fr1(i,n,m)       for(i=n;i<m;i++)\n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n int dx[]  = {0, 0, 1, -1};\n int dy[]  = {1, -1, 0, 0};\n int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};\n int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};\n int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};\n int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};\n \n typedef long long ll;\n typedef unsigned long long llu;\n typedef priority_queue < int > PQ;\n typedef pair < ll , ll > pi;\n typedef pair <  ll, pi > pii;\n typedef vector < int > vi;\n typedef vector < ll > vl;\n typedef vector < string > vs;\n \n /*\n //FUNCTION//\n ll bigmod(ll a, ll b, ll c)\n {\n     if(b==0)return 1%c;ll x=bigmod(a,b/2,c);x=(x*x)%c;\n     if(b%2==1)x=(x*a)%c;return x;\n }\n ll mod_inverse(ll a, ll mod){return bigmod(a,mod-2,mod);}\n ll poww(ll a, ll b)\n {\n     if(b==0)return 1;ll x=poww(a,b/2);x=x*x;if(b%2==1)x=(x*a);return x;\n }\n \n \n \n ll LCM(ll a, ll b){ return a*b/ __gcd(a,b);}\n \n int pr = 100005;\n vi primelist;\n bool a[MM];\n void seive( )\n {\n     int i,j,k=sqrt(pr);\n     a[1]=1;\n     primelist.pb(2);\n     for(i=4;i<=pr;i+=2)a[i]=1;\n     for(i=3;i<=k;i+=2)if(!a[i])for(j=i*i;j<=pr;j+=2*i)a[j]=1;\n     for(i=3;i<=pr;i+=2)if(!a[i])primelist.pb(i);\n }\n int phi[MM];\n void calculatePhi() {\n   for (int i = 1; i < MM; i++) {\n     phi[i] = i;\n   }\n   for (int p = 2; p < M; p++) {\n     if (phi[p] == p) { // p is a prime\n       for (int k = p; k < M; k += p) {\n         phi[k] -= phi[k] / p;\n       }\n     }\n   }\n }\n \n ll fact_divs( ll n, ll p)\n {\n     ll cnt=0;while(p<=n){cnt += n/p;n /= p;}return cnt;\n }\n struct point{double x, y;};\n double area( point A, point B, point C){\n return 0.5*(A.x*(B.y-C.y) - A.y*(B.x-C.x) + B.x*C.y - C.x*B.y);\n }\n \n int Set(int N,int pos){return N=N | (1<<pos);}\n int reset(int N,int pos){return N= N & ~(1<<pos);}\n bool check(int N,int pos){return (bool)(N & (1<<pos));}\n \n //*/\n int a[MM];\n int main(){\n     I_O;\n     int t, tt = 1;\n     cin>>t;\n     while(t--){\n         int n; cin>>n;\n         int id = 0, mn = MAX;\n         for(int i=1; i<=n; i++){\n             cin>>a[i];\n             if(a[i] < mn){\n                 mn = a[i];\n                 id = i;\n             }\n         }\n         cout<<n-1<<endl;\n         for(int i=id+1, cnt=1; i<=n; i++, cnt++){\n             cout<<id<<' '<<i<<' '<<a[id]<<' '<<a[id]+cnt<<endl;\n         }\n         for(int i=id-1, cnt=1; i >=1; i--, cnt++){\n             cout<<id<<' '<<i<<' '<<a[id]<<' '<<a[id]+cnt<<endl;\n         }\n \n \n     }\n \n \n \n \n     return 0;\n }\n /*\n 2\n 5\n 9 6 3 11 15\n 3\n 7 5 13\n \n \n \n \n */\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, i;\n   cin >> n;\n   string s;\n   map<char, int> m;\n   for (i = 0; i < n; i++) {\n     cin >> s;\n     m[s[0]]++;\n   }\n   int ans = 0, f1, f2;\n   for (auto it = m.begin(); it != m.end(); it++) {\n     f1 = it->second / 2;\n     f2 = it->second - f1;\n     ans += f1 * (f1 - 1) / 2 + f2 * (f2 - 1) / 2;\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int Read() {\n   int x = 0;\n   char ch = getchar();\n   while (!isdigit(ch)) ch = getchar();\n   while (isdigit(ch)) x = (x << 3) + (x << 1) + ch - '0', ch = getchar();\n   return x;\n }\n void Write(int x) {\n   if (x < 0) putchar('-'), x = -x;\n   if (x == 0) putchar('0');\n   int stk[55], tp = 0;\n   while (x) stk[++tp] = x % 10, x /= 10;\n   for (int i = tp; i; i--) putchar(stk[i] + '0');\n }\n int Add(int a, int b) {\n   return (a + b >= 998244353) ? a + b - 998244353 : a + b;\n }\n int Dec(int a, int b) { return (a - b < 0) ? a - b + 998244353 : a - b; }\n int mul(int a, int b) { return 1ll * a * b % 998244353; }\n unsigned int qpow(unsigned int a, int b) {\n   unsigned int res = 1;\n   for (; b; b >>= 1, a = mul(a, a))\n     if (b & 1) res = mul(res, a);\n   return res;\n }\n namespace NTT {\n int sz;\n unsigned int w[2500005], w_mf[2500005];\n int mf(int x) { return (1ll * x << 32) / 998244353; }\n void init(int n) {\n   for (sz = 2; sz < n; sz <<= 1)\n     ;\n   unsigned int pr = qpow(3, (998244353 - 1) / sz);\n   w[sz / 2] = 1;\n   w_mf[sz / 2] = mf(1);\n   for (int i = 1; i <= sz / 2; i++)\n     w[sz / 2 + i] = mul(w[sz / 2 + i - 1], pr),\n                w_mf[sz / 2 + i] = mf(w[sz / 2 + i]);\n   for (int i = sz / 2 - 1; i; i--) w[i] = w[i << 1], w_mf[i] = w_mf[i << 1];\n }\n void ntt(vector<unsigned int>& A, int L) {\n   for (int d = L >> 1; d; d >>= 1)\n     for (int i = 0; i < L; i += (d << 1))\n       for (int j = 0; j < d; j++) {\n         unsigned int x = A[i + j] + A[i + d + j];\n         if (x >= 998244353 * 2) x -= 998244353 * 2;\n         long long t = A[i + j] + 998244353 * 2 - A[i + d + j],\n                   q = t * w_mf[d + j] >> 32, y = t * w[d + j] - q * 998244353;\n         A[i + j] = x;\n         A[i + d + j] = y;\n       }\n   for (int i = 0; i < L; i++)\n     if (A[i] >= 998244353) A[i] -= 998244353;\n }\n void intt(vector<unsigned int>& A, int L) {\n   for (int d = 1; d < L; d <<= 1)\n     for (int i = 0; i < L; i += (d << 1))\n       for (int j = 0; j < d; j++) {\n         unsigned int x = A[i + j];\n         if (x >= 998244353 * 2) x -= 998244353 * 2;\n         long long t = A[i + d + j], q = t * w_mf[d + j] >> 32,\n                   y = t * w[d + j] - q * 998244353;\n         A[i + j] = x + y, A[i + d + j] = x + 2 * 998244353 - y;\n       }\n   int k = __builtin_ctz(L);\n   reverse(A.begin() + 1, A.end());\n   for (int i = 0; i < L; i++) {\n     long long m = -A[i] & (L - 1);\n     A[i] = (A[i] + m * 998244353) >> k;\n     if (A[i] >= 998244353) A[i] -= 998244353;\n   }\n }\n }  // namespace NTT\n struct poly {\n   vector<unsigned int> a;\n   poly(int d = 0, int t = 0) {\n     a.resize(d + 1);\n     a[d] = t;\n   }\n   int deg() { return a.size() - 1; }\n   unsigned int& operator[](const int& b) { return a[b]; }\n   poly extend(int x) {\n     poly c = *this;\n     c.a.resize(x + 1);\n     return c;\n   }\n   void resize(int x) { a.resize(x); }\n   int size() { return a.size(); }\n   void Get(int n) {\n     a.resize(n + 1);\n     for (int i = 0; i <= n; i++) a[i] = Read();\n   }\n   void Print(int n) {\n     for (int i = 0; i <= n; i++) Write(a[i]), putchar(' ');\n     puts('');\n   }\n   friend poly operator*(poly A, poly B) {\n     int n = A.deg() + B.deg() + 1, lim = 2;\n     for (; lim < n; lim <<= 1)\n       ;\n     NTT::init(lim);\n     A.resize(lim);\n     B.resize(lim);\n     NTT::ntt(A.a, lim);\n     NTT::ntt(B.a, lim);\n     for (int i = 0; i < lim; i++) A[i] = mul(A[i], B[i]);\n     NTT::intt(A.a, lim);\n     return A.extend(n - 1);\n   }\n   poly inv(poly A) {\n     int n = A.a.size(), lim = 2;\n     if (n == 1) return A[0] = qpow(A[0], 998244353 - 2), A;\n     poly B = A;\n     B.resize((n + 1) >> 1);\n     B = inv(B);\n     for (; lim < (n << 1); lim <<= 1)\n       ;\n     NTT::init(lim);\n     A.resize(lim), B.resize(lim), NTT::ntt(A.a, lim);\n     NTT::ntt(B.a, lim);\n     for (int i = 0; i < lim; i++) A[i] = mul(Dec(2, mul(A[i], B[i])), B[i]);\n     NTT::intt(A.a, lim);\n     return A.extend(n - 1);\n   }\n   poly getinv() { return inv(*this); }\n   poly getdao() {\n     poly A = *this, B;\n     int n = A.a.size();\n     B.resize(n);\n     for (int i = 1; i < n; i++) B[i - 1] = mul(A[i], i);\n     B[n - 1] = 0;\n     return B;\n   }\n   poly getjf() {\n     poly A = *this, B;\n     int n = A.a.size();\n     B.resize(n);\n     for (int i = 1; i < n; i++) B[i] = mul(A[i - 1], qpow(i, 998244353 - 2));\n     B[0] = 0;\n     return B;\n   }\n   poly getln() {\n     poly A = *this;\n     return (A.getdao() * A.getinv()).extend(A.deg()).getjf();\n   }\n   poly exp(poly A) {\n     int n = A.a.size();\n     if (n == 1) return A[0] = 1, A;\n     poly B = A;\n     B.resize((n + 1) >> 1);\n     B = exp(B);\n     poly C = B.getln();\n     C.resize(n);\n     for (int i = 0; i < n; i++) C[i] = Dec(A[i], C[i]);\n     ++C[0];\n     return (B * C).extend(n - 1);\n   }\n   poly getexp() { return exp(*this); }\n   poly getmi(int k) {\n     poly A = *this;\n     int n = A.a.size();\n     poly B = A.getln();\n     for (int i = 0; i < n; i++) B[i] = mul(B[i], k);\n     return B.getexp();\n   }\n   poly sqrt(poly A) {\n     int n = A.size(), lim = 2;\n     if (n == 1) return A[0] = 1, A;\n     poly B = A;\n     B.resize((n + 1) >> 1);\n     B = sqrt(B);\n     poly C = A.extend(n - 1), D = B.getinv();\n     for (; lim < (n << 1); lim <<= 1)\n       ;\n     NTT::init(lim);\n     B.resize(lim), C.resize(lim), D.resize(lim), NTT::ntt(B.a, lim);\n     NTT::ntt(C.a, lim);\n     NTT::ntt(D.a, lim);\n     for (int i = 0; i < lim; i++)\n       B[i] = mul(Add(B[i], mul(C[i], D[i])), 499122177);\n     NTT::intt(B.a, lim);\n     return B.extend(n - 1);\n   }\n   poly getsqrt() { return sqrt(*this); }\n };\n signed main() {\n   int n = Read(), k = Read();\n   poly A, B;\n   A.resize(k * 3), B.resize(k * 3);\n   A[0] = 1;\n   A[1] = 6;\n   A[2] = 1;\n   A = A.getsqrt();\n   B = A.getinv();\n   ++A[1];\n   ++A[0];\n   for (int i = 0; i <= k; i++) A[i] = 1ll * A[i] * 499122177 % 998244353;\n   A = A.getmi(n + 1);\n   A = (A * B).extend(k * 3);\n   for (int i = 1; i <= k; i++) {\n     if (i <= n)\n       printf('%d ', A[i]);\n     else\n       printf('%d ', 0);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n, d, a, b;\n   cin >> n >> d >> a >> b;\n   vector<pair<long long, int> > v(n);\n   for (int i = 0; i < n; i++) {\n     long long x, y;\n     cin >> x >> y;\n     v[i].first = x * a + y * b;\n     v[i].second = i + 1;\n   }\n   sort(v.begin(), v.end());\n   int ans = 0, sum = 0, pos = 0;\n   for (int i = 0; i < n; i++) {\n     if (sum + v[i].first <= d) {\n       sum += v[i].first;\n       ans++;\n       pos = i;\n     }\n   }\n   cout << ans << endl;\n   if (ans)\n     for (int i = 0; i <= pos; i++) cout << v[i].second << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   long long x, y, p, q;\n   cin >> t;\n   while (t--) {\n     cin >> x >> y >> p >> q;\n     long long l = 0, h = 1e9, ans = -1, mid, a, b;\n     while (l <= h) {\n       mid = (l + h) / 2;\n       a = p * mid;\n       b = q * mid;\n       if (b >= y && a >= x && b - a >= y - x) {\n         ans = b - y;\n         h = mid - 1;\n       } else\n         l = mid + 1;\n     }\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long int mod = 1e9 + 7;\n const long long int N = 2 * (1e5);\n const long long int maxo = 1e14;\n const long long int inf = 1e17;\n int main(int argc, char const *argv[]) {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long int x0, y0, ax, ay, bx, by;\n   cin >> x0 >> y0 >> ax >> ay >> bx >> by;\n   long long int xs, ys, t;\n   cin >> xs >> ys >> t;\n   vector<pair<long long int, long long int> > v;\n   v.push_back({x0, y0});\n   for (long long int i = 0; i < 100; i++) {\n     if (v.back().first > (inf - bx) / (ax)) break;\n     if (v.back().second > (inf - by) / ay) break;\n     long long int x1 = v.back().first * ax + bx;\n     long long int y1 = v.back().second * ay + by;\n     v.push_back({x1, y1});\n   }\n   long long int n = v.size();\n   long long int ans = 0;\n   for (long long int l = 0; l < n; l++) {\n     for (long long int r = l; r < n; r++) {\n       long long int d1 = abs(xs - v[l].first) + abs(ys - v[l].second);\n       long long int d2 = abs(xs - v[r].first) + abs(v[r].second - ys);\n       long long int len =\n           abs(v[l].first - v[r].first) + abs(v[l].second - v[r].second);\n       if (d1 + len <= t) {\n         ans = max(ans, r - l + 1);\n       }\n       if (d2 + len <= t) {\n         ans = max(ans, r - l + 1);\n       }\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void setIO(string name = '') {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   if (int((name).size())) {\n     freopen((name + '.in').c_str(), 'r', stdin);\n     freopen((name + '.out').c_str(), 'w', stdout);\n   }\n }\n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }\n long long mcm(long long a, long long b) { return (a * b) / gcd(a, b); }\n bool prime(long long n, long long i) {\n   if (i > sqrt(n)) return true;\n   if (n % i == 0)\n     return false;\n   else\n     return prime(n, i + 1);\n }\n struct compii {\n   bool operator()(const pair<int, int> &a, const pair<int, int> &b) {\n     if (a.first == a.second) return a.second < b.second;\n     return a.first > b.first;\n   }\n };\n bool comp(int a, int b) { return a > b; }\n int dx[] = {1, 0, -1, 0};\n int dy[] = {0, 1, 0, -1};\n const int mod = 1e9 + 7;\n const long long inf = 1e18;\n bool check(string a, string b) {\n   if (a == 'rock' and b == 'scissors') return true;\n   if (a == 'paper' and b == 'rock') return true;\n   if (a == 'scissors' and b == 'paper') return true;\n   return false;\n }\n void solve() {\n   string first, m, second;\n   cin >> first >> m >> second;\n   if (check(first, m) and check(first, second))\n     cout << 'F';\n   else if (check(m, second) and check(m, first))\n     cout << 'M';\n   else if (check(second, first) and check(second, m))\n     cout << 'S';\n   else\n     cout << '?';\n }\n int main() {\n   setIO('');\n   int t = 1;\n   while (t-- > 0) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s = '';\n   for (int i = 1; i < 1000; i++) {\n     s += to_string(i);\n   }\n   int n;\n   cin >> n;\n   cout << s[n - 1];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int adj[8][2] = {{-1, 0},  {0, -1}, {1, 0}, {0, 1},\n                        {-1, -1}, {-1, 1}, {1, 1}, {1, -1}};\n const long long int LLINF = 9e18;\n const int INF = 2e9;\n const int MOD = 1e9 + 7;\n const double EPS = 1e-10;\n const double PI = acos(-1);\n const int SIZE = 100011;\n int N;\n int cnt[SIZE];\n map<string, int> Mp;\n string ts[8] = {'S', 'M', 'L', 'XL', 'XXL', 'XXXL'};\n string s;\n struct edge {\n   int v, f, c, u;\n };\n vector<edge> E[SIZE];\n int st[SIZE], lvl[SIZE];\n void init() {\n   for (int i = 0; i < SIZE; i++) {\n     cnt[i] = 0;\n     E[i].clear();\n   }\n }\n void addedge(int a, int b, int ca, int cb) {\n   edge A = {a, 0, ca, (int)E[a].size()};\n   edge B = {b, 0, cb, (int)E[b].size()};\n   E[a].push_back(B);\n   E[b].push_back(A);\n }\n bool BFS(int S, int T) {\n   memset(lvl, -1, sizeof(lvl));\n   queue<int> q;\n   q.push(S);\n   lvl[S] = 0;\n   while (!q.empty()) {\n     int indx = q.front();\n     q.pop();\n     for (unsigned int i = 0; i < E[indx].size(); i++) {\n       edge &t = E[indx][i];\n       int idx = t.v;\n       if (lvl[idx] < 0 && t.c > t.f) {\n         lvl[idx] = lvl[indx] + 1;\n         q.push(idx);\n       }\n     }\n   }\n   return lvl[T] >= 0;\n }\n int DFS(int indx, int T, int flow) {\n   if (indx == T) return flow;\n   for (int &i = st[indx]; i < (int)E[indx].size(); i++) {\n     edge &t = E[indx][i];\n     int idx = t.v;\n     if (lvl[idx] == lvl[indx] + 1 && t.c > t.f) {\n       int cur = min(flow, t.c - t.f);\n       int ret = DFS(idx, T, cur);\n       if (ret > 0) {\n         t.f += ret;\n         E[t.v][t.u].f -= ret;\n         return ret;\n       }\n     }\n   }\n   return 0;\n }\n int Dinic(int S, int T) {\n   int ret = 0;\n   while (BFS(S, T)) {\n     memset(st, 0, sizeof(st));\n     while (int flow = DFS(S, T, INF)) {\n       ret += flow;\n     }\n   }\n   return ret;\n }\n int main() {\n   ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n   int S = 0, T = SIZE - 1, a;\n   init();\n   for (int i = 1; i <= 6; i++) {\n     cin >> a;\n     Mp[ts[i - 1]] = i;\n     addedge(i, T, 0, a);\n   }\n   cin >> N;\n   for (int i = 1; i <= N; i++) {\n     cin >> s;\n     s += ',';\n     string temp = '';\n     for (unsigned int j = 0; j < s.size(); j++) {\n       if (s[j] == ',') {\n         addedge(i + 6, Mp[temp], 0, 1);\n         temp.clear();\n         cnt[i + 6]++;\n       } else\n         temp.push_back(s[j]);\n     }\n     addedge(S, i + 6, 0, 1);\n   }\n   int ans = Dinic(S, T);\n   if (ans != N)\n     cout << 'NO' << endl;\n   else {\n     cout << 'YES' << endl;\n     for (int i = 1; i <= N; i++) {\n       edge t1, t2;\n       if (cnt[i + 6] == 1) {\n         t1 = E[i + 6][0];\n         cout << ts[t1.v - 1] << endl;\n       } else {\n         t1 = E[i + 6][0];\n         t2 = E[i + 6][1];\n         if (t1.f == 1)\n           cout << ts[t1.v - 1] << endl;\n         else if (t2.f == 1)\n           cout << ts[t2.v - 1] << endl;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[101];\n int b[101];\n int storage[200001];\n int storage2[200001];\n int* value = storage + 100000;\n int* prevalue = storage2 + 100000;\n int n, k;\n int main() {\n   scanf('%d%d', &n, &k);\n   int gtzero = 0, lezero = 0;\n   for (int i = 0; i < n; i++) scanf('%d', &a[i]);\n   for (int i = 0; i < n; i++) scanf('%d', &b[i]), b[i] *= k;\n   for (int i = 0; i < n; i++) {\n     b[i] = a[i] - b[i];\n     if (b[i] > 0)\n       gtzero += b[i];\n     else\n       lezero += b[i];\n   }\n   for (int i = 0; i < sizeof(storage) / sizeof(int); i++) {\n     storage[i] = -19200000;\n     storage2[i] = -19200000;\n   }\n   value[0] = prevalue[0] = 0;\n   for (int i = 0; i < n; i++) {\n     int C = b[i];\n     for (int j = -10000; j <= 10000; j++) {\n       value[j] = max(prevalue[j], prevalue[j - b[i]] + a[i]);\n     }\n     memcpy(storage2, storage, sizeof(storage));\n   }\n   if (value[0] > 0)\n     printf('%d\n', value[0]);\n   else\n     printf('-1\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int num, a1, a2, b1, b2, c1, c2, d, a, b, c;\n   cin >> num >> a1 >> a2 >> b1 >> b2 >> c1 >> c2;\n   a = a2;\n   b = b2;\n   c = c2;\n   if (a + b + c == num)\n     cout << a << ' ' << b << ' ' << c;\n   else {\n     d = a + b + c - num;\n     if (c - d >= c1) {\n       c = c - d;\n       d = 0;\n     } else {\n       d = d - c + c1;\n       c = c1;\n     }\n     if (d > 0)\n       if (b - d >= b1) {\n         b = b - d;\n         d = 0;\n       } else {\n         d = d - b + b1;\n         b = b1;\n       }\n     if (d > 0)\n       if (a - d >= a1) {\n         a = a - d;\n         d = 0;\n       } else {\n         d = d - a + a1;\n         a = a1;\n       }\n     cout << a << ' ' << b << ' ' << c;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 500005;\n const int maxx = 1000005;\n int n, x, y, q, l, r;\n int a[N];\n struct Tree {\n   int ans, m, tag;\n } tr[maxx * 6];\n void pushdown(int rt) {\n   int lson = rt << 1;\n   int rson = rt << 1 | 1;\n   tr[lson].m += tr[rt].tag;\n   tr[rson].m += tr[rt].tag;\n   tr[lson].tag += tr[rt].tag;\n   tr[rson].tag += tr[rt].tag;\n   tr[rt].tag = 0;\n }\n void updata(int rt) {\n   int lson = rt << 1;\n   int rson = rt << 1 | 1;\n   if (tr[lson].m == tr[rson].m) {\n     tr[rt].m = tr[lson].m;\n     tr[rt].ans = tr[lson].ans + tr[rson].ans;\n   } else if (tr[lson].m < tr[rson].m) {\n     tr[rt].m = tr[lson].m;\n     tr[rt].ans = tr[lson].ans;\n   } else {\n     tr[rt].m = tr[rson].m;\n     tr[rt].ans = tr[rson].ans;\n   }\n }\n void change(int rt, int l, int r, int cl, int cr, int C) {\n   if (cl <= l && r <= cr) {\n     tr[rt].m += C;\n     tr[rt].tag += C;\n     return;\n   }\n   pushdown(rt);\n   int mid = (l + r) >> 1;\n   if (cl <= mid) change(rt << 1, l, mid, cl, cr, C);\n   if (cr > mid) change(rt << 1 | 1, mid + 1, r, cl, cr, C);\n   updata(rt);\n }\n void change2(int rt, int l, int r, int x, int C) {\n   if (l == r) {\n     tr[rt].ans += C;\n     return;\n   }\n   pushdown(rt);\n   int mid = (l + r) >> 1;\n   if (x <= mid) change2(rt << 1, l, mid, x, C);\n   if (x > mid) change2(rt << 1 | 1, mid + 1, r, x, C);\n   updata(rt);\n }\n int query(int rt, int l, int r, int ql, int qr) {\n   if (ql <= l && r <= qr) {\n     if (tr[rt].m == 1) return tr[rt].ans;\n     return 0;\n   }\n   pushdown(rt);\n   int mid = (l + r) >> 1, summ = 0;\n   if (ql <= mid) summ += query(rt << 1, l, mid, ql, qr);\n   if (qr > mid) summ += query(rt << 1 | 1, mid + 1, r, ql, qr);\n   updata(rt);\n   return summ;\n }\n int main() {\n   scanf('%d %d', &n, &q);\n   for (int i = 1; i <= n; ++i) scanf('%d', &a[i]);\n   a[0] = maxx;\n   a[n + 1] = 0;\n   for (int i = 1; i <= n; ++i) change2(1, 0, maxx, a[i], 1);\n   for (int i = 1; i <= n + 1; ++i) {\n     int l = a[i - 1];\n     int r = a[i];\n     if (l == r) continue;\n     if (l > r) swap(l, r);\n     change(1, 0, maxx, l, r - 1, 1);\n   }\n   for (int i = 1; i <= q; ++i) {\n     scanf('%d %d', &x, &y);\n     l = a[x];\n     r = a[x + 1];\n     if (l != r) {\n       if (l > r) swap(l, r);\n       change(1, 0, maxx, l, r - 1, -1);\n     }\n     l = a[x - 1];\n     r = a[x];\n     if (l != r) {\n       if (l > r) swap(l, r);\n       change(1, 0, maxx, l, r - 1, -1);\n     }\n     change2(1, 0, maxx, a[x], -1);\n     change2(1, 0, maxx, y, 1);\n     a[x] = y;\n     l = a[x];\n     r = a[x + 1];\n     if (l != r) {\n       if (l > r) swap(l, r);\n       change(1, 0, maxx, l, r - 1, 1);\n     }\n     l = a[x - 1];\n     r = a[x];\n     if (l != r) {\n       if (l > r) swap(l, r);\n       change(1, 0, maxx, l, r - 1, 1);\n     }\n     printf('%d\n', query(1, 0, maxx, 1, maxx - 1));\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n const int inf = 1e9 + 7;\n const ll longinf = 1LL << 60;\n const ll mod = 1e9 + 7;\n int main() {\n   int h, w, n, q;\n   cin >> h >> w >> n >> q;\n   vector<int> v[h];\n   for (int i = (int)(0); i < (int)(n); ++i) {\n     int x, y;\n     cin >> x >> y;\n     --x;\n     --y;\n     v[x].push_back(y);\n   }\n   for (int i = (int)(0); i < (int)(h); ++i) sort(v[i].begin(), v[i].end());\n   vector<ll> ok;\n   ok.push_back(-longinf);\n   ok.push_back(longinf);\n   for (int i = (int)(0); i < (int)(q); ++i) {\n     int x;\n     cin >> x;\n     --x;\n     ok.push_back(x);\n   }\n   sort(ok.begin(), ok.end());\n   ll pl = 0, pr = 0;\n   ll dp[2][202020];\n   for (int i = (int)(0); i < (int)(2); ++i)\n     for (int j = (int)(0); j < (int)(202020); ++j) dp[i][j] = longinf;\n   dp[0][1] = dp[1][1] = 0;\n   if (v[0].size()) {\n     pl = v[0][0];\n     pr = v[0].back();\n     dp[0][1] = 2 * pr - pl;\n     dp[1][1] = pr;\n   }\n   int maxh = 1;\n   for (int i = (int)(1); i < (int)(h); ++i) {\n     if (v[i].empty()) {\n       dp[0][i + 1] = dp[0][i] + 1;\n       dp[1][i + 1] = dp[1][i] + 1;\n       continue;\n     }\n     int nl = v[i][0], nr = v[i].back();\n     auto itr = lower_bound(ok.begin(), ok.end(), pl);\n     dp[0][i + 1] = min(dp[0][i + 1], dp[0][i] + abs(*itr - pl) +\n                                          abs(nr - *itr) + abs(nr - nl) + 1);\n     dp[1][i + 1] = min(dp[1][i + 1], dp[0][i] + abs(*itr - pl) +\n                                          abs(nl - *itr) + abs(nr - nl) + 1);\n     --itr;\n     dp[0][i + 1] = min(dp[0][i + 1], dp[0][i] + abs(*itr - pl) +\n                                          abs(nr - *itr) + abs(nr - nl) + 1);\n     dp[1][i + 1] = min(dp[1][i + 1], dp[0][i] + abs(*itr - pl) +\n                                          abs(nl - *itr) + abs(nr - nl) + 1);\n     itr = lower_bound(ok.begin(), ok.end(), pr);\n     dp[0][i + 1] = min(dp[0][i + 1], dp[1][i] + abs(*itr - pr) +\n                                          abs(nr - *itr) + abs(nr - nl) + 1);\n     dp[1][i + 1] = min(dp[1][i + 1], dp[1][i] + abs(*itr - pr) +\n                                          abs(nl - *itr) + abs(nr - nl) + 1);\n     --itr;\n     dp[0][i + 1] = min(dp[0][i + 1], dp[1][i] + abs(*itr - pr) +\n                                          abs(nr - *itr) + abs(nr - nl) + 1);\n     dp[1][i + 1] = min(dp[1][i + 1], dp[1][i] + abs(*itr - pr) +\n                                          abs(nl - *itr) + abs(nr - nl) + 1);\n     pl = nl;\n     pr = nr;\n     maxh = max(i + 1, maxh);\n   }\n   cout << min(dp[0][maxh], dp[1][maxh]) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   int cnt = 0;\n   cin >> n;\n   string a;\n   for (int i = 0; i < n; i++) {\n     cin >> a;\n     if (a == 'Tetrahedron')\n       cnt += 4;\n     else if (a == 'Cube')\n       cnt += 6;\n     else if (a == 'Octahedron')\n       cnt += 8;\n     else if (a == 'Dodecahedron')\n       cnt += 12;\n     else\n       cnt += 20;\n   }\n   cout << cnt;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #pragma comment(linker, '/STACK:20000000')\n string problem_name = 'a';\n void init() { freopen((problem_name + '.in').c_str(), 'rt', stdin); }\n long long res = 0;\n int ms[300100];\n int len;\n void mul(int val) {\n   int p = 0;\n   for (int i = 0; i < 300000; i++) {\n     p += ms[i] *= val;\n     ms[i] = p % 10;\n     p /= 10;\n   }\n }\n int main() {\n   string s;\n   cin >> s;\n   vector<int> u(255, 0);\n   res = 1;\n   int zero = 0;\n   long long col = 10;\n   int c = 0;\n   int c2 = 0;\n   for (int i = 0; i < int((s).size()); i++) {\n     if (s[i] == '?') {\n       c++;\n     } else if (isalpha(s[i])) {\n       if (u[s[i]]) continue;\n       u[s[i]] = 1;\n       if (col <= 0) {\n         res = 0;\n         zero = 1;\n         break;\n       }\n       c2++;\n       col--;\n     }\n   }\n   if (zero) {\n     cout << 0;\n     return 0;\n   }\n   if (c) {\n     if (s[0] == '?')\n       ms[c - 1] = 9;\n     else\n       ms[c] = 1;\n   } else\n     ms[0] = 1;\n   if (c2) {\n     for (int i = 10; i > 10 - c2; i--) {\n       if (i == 10 && isalpha(s[0]))\n         mul(9);\n       else\n         mul(i);\n     }\n   }\n   int len = 300000;\n   while (!ms[len]) len--;\n   for (int i = len; i >= 0; i--) printf('%d', ms[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long long mod = 1e9 + 7;\n using namespace std;\n const long long N = 102;\n const long long M = 1e4 + 2;\n long long dp[N][M], c[N][N], cnt[N];\n signed main() {\n   long long n, i, j, k, l, ans = 0, type = 0;\n   cin >> n;\n   dp[0][0] = 1;\n   c[0][0] = 1;\n   for (i = 1; i <= n; i++) {\n     cin >> j;\n     if (!cnt[j]) {\n       type++;\n     }\n     cnt[j]++;\n     for (l = i; l >= 1; l--) {\n       for (k = 10000; k >= j; k--) {\n         dp[l][k] += dp[l - 1][k - j];\n         if (dp[l][k] > mod) {\n           dp[l][k] -= mod;\n         }\n       }\n     }\n   }\n   if (type <= 2) {\n     cout << n;\n     return 0;\n   }\n   for (i = 1; i <= 100; i++) {\n     for (j = 0; j <= i; j++) {\n       c[j][i] = c[j][i - 1];\n       if (j) {\n         c[j][i] += c[j - 1][i - 1];\n       }\n       c[j][i] %= mod;\n     }\n   }\n   for (i = 1; i <= 100; i++) {\n     for (j = 1; j <= cnt[i]; j++) {\n       if (c[j][cnt[i]] == dp[j][i * j]) {\n         ans = max(ans, j);\n       }\n     }\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int dx[] = {0, 1, -1, 0, 1, -1, -1, 1};\n const int dy[] = {-1, 0, 0, 1, 1, 1, -1, -1};\n const int N = 0;\n const int MOD = 0;\n const int INF = 1e9 + 10;\n const long long int LLINF = 1e18 + 10;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int n, m;\n   cin >> n >> m;\n   int v[10010];\n   int l, r, x;\n   for (int i = 1; i <= n; i++) {\n     cin >> v[i];\n   }\n   int aux;\n   bool mudou;\n   int cnt = 0;\n   while (m--) {\n     cin >> l >> r >> x;\n     aux = x - l;\n     cnt = 0;\n     for (int i = l; i <= r; i++) {\n       if (v[i] < v[x]) cnt++;\n     }\n     if (cnt == aux)\n       cout << 'Yes\n';\n     else\n       cout << 'No\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int suma = 0, sumg = 0, a, g;\n   char *arr = new char[n];\n   for (int i = 0; i < n; i++) {\n     scanf('%d %d', &a, &g);\n     if (abs(suma + a - sumg) < abs(sumg + g - suma)) {\n       suma += a;\n       arr[i] = 'A';\n     } else {\n       sumg += g;\n       arr[i] = 'G';\n     }\n   }\n   if (abs(suma - sumg) > 500)\n     cout << '-1';\n   else\n     for (int i = 0; i < n; i++) cout << arr[i];\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool isPowerOfTwo(int x) { return (x && !(x & (x - 1))); }\n bool is_prime(int n) {\n   if (n == 1) return false;\n   for (int i = 2; i <= sqrt(n); i++) {\n     if (n % i == 0) {\n       return false;\n     }\n   }\n   return true;\n }\n void solve() {\n   int n;\n   cin >> n;\n   long long int a, b;\n   cin >> a >> b;\n   set<long long int> st;\n   st.insert(a);\n   st.insert(b);\n   for (int i = 2; i * i <= a; i++) {\n     if (a % i == 0) {\n       st.insert(i);\n       st.insert(a / i);\n     }\n   }\n   for (int i = 2; i * i <= b; i++) {\n     if (b % i == 0) {\n       st.insert(i);\n       st.insert(b / i);\n     }\n   }\n   map<pair<long long int, long long int>, long long int> ch;\n   ch[{a, b}]++;\n   for (int i = 1; i < n; i++) {\n     cin >> a >> b;\n     if (ch[{a, b}] >= 1) continue;\n     ch[{a, b}]++;\n     for (auto it = st.begin(); it != st.end();) {\n       long long int k = *it;\n       if (a % k == 0 || b % k == 0) {\n         it++;\n       } else {\n         it = st.erase(it++);\n       }\n     }\n   }\n   if (st.empty())\n     cout << '-1';\n   else\n     cout << (*st.begin());\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using int64 = long long;\n int64 bit_count(int64 n) {\n   int64 a{};\n   while (n) {\n     a += 1;\n     n >>= 1;\n   }\n   return a;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(nullptr);\n   int T;\n   cin >> T;\n   while (T--) {\n     int64 n, m;\n     cin >> n >> m;\n     vector<int64> P(m);\n     for (auto &p : P) cin >> p;\n     auto s = accumulate(begin(P), end(P), 0ll);\n     if (s < n) {\n       cout << -1 << '\n';\n       continue;\n     }\n     vector<int64> F(65);\n     for (auto p : P) F[bit_count(p) - 1]++;\n     int64 ans{};\n     for (int i = 0, j = -1; i < 64; i++) {\n       if (j >= 0 and F[i]) {\n         ans += i - j;\n         j = -1;\n         F[i]--;\n       }\n       if (n & (1 << i)) {\n         if (F[i]) {\n           F[i]--;\n         } else {\n           if (j == -1) j = i;\n         }\n       }\n       F[i + 1] += F[i] / 2;\n     }\n     cout << ans << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     if (i == 1)\n       printf('14\n');\n     else {\n       if (i == 2)\n         printf('16\n');\n       else\n         printf('%lld\n', (1LL * i * (i + 1) * (i + 1) - (i - 1)));\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast,no-stack-protector')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx')\n #pragma GCC target('avx,tune=native')\n using namespace std;\n const int inf = 0x3f3f3f3f;\n const double eps = 1e-6;\n const int mod = 1000000007;\n inline string getstr(string &s, int l, int r) {\n   string ret = '';\n   for (int i = l; i <= r; i++) ret.push_back(s[i]);\n   return ret;\n }\n int modpow(int x, int y, int md = mod) {\n   if (y == 0) return 1;\n   int ret = modpow(x, y >> 1, md);\n   ret = (long long)ret * ret % md;\n   if (y & 1) ret = (long long)ret * x % md;\n   return ret;\n }\n int n, m, t, ans;\n int a[10001];\n int cnt[10005];\n int in[11];\n inline int calc(int use) {\n   int ret = 1;\n   for (int i = 1; i <= use; i++) {\n     ret = (long long)ret * cnt[in[i]] % mod;\n   }\n   return ret;\n }\n void dfs(int use, int last, bitset<128> now) {\n   ans += calc(use);\n   if (ans >= mod) ans -= mod;\n   for (int i = last + 1; i <= m / 2; i++) {\n     if (cnt[i]) {\n       if (now[i] || now[m - i]) continue;\n       bitset<128> bs =\n           now | (now >> i) | (now << i) | (now >> (m - i)) | (now << (m - i));\n       in[use + 1] = i;\n       dfs(use + 1, i, bs);\n     }\n   }\n }\n bitset<128> bs;\n int main() {\n   bs.reset();\n   bs.set(0);\n   cin >> n >> m >> t;\n   for (int i = 0; i < t; i++) cin >> a[i], cnt[min(m - a[i] % m, a[i] % m)]++;\n   dfs(0, 0, bs);\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   long long t;\n   cin >> t;\n   while (t--) {\n     int n;\n     string a, b;\n     cin >> n >> a >> b;\n     vector<int> res;\n     for (int i = 0; i < n; i++) {\n       if (a[i] != b[i]) {\n         if (i != 0) res.push_back(i + 1);\n         res.push_back(1);\n         if (i != 0) res.push_back(i + 1);\n       }\n     }\n     cout << res.size() << ' ';\n     for (int x : res) {\n       cout << x << ' ';\n     }\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 2 * 1e5 + 5;\n const int INF = 1e9;\n const int MOD = 1e9 + 7;\n int N, K, A[MAX], table[20][MAX];\n int main() {\n   cin >> N >> K;\n   for (int i = 0; i < (N); ++i) cin >> A[i];\n   for (int i = 0; i < (N); ++i) table[0][i] = A[i];\n   vector<int> b(N, 0);\n   for (int i = 0; i < (N); ++i) {\n     for (int j = 0; j < (19); ++j) {\n       table[j + 1][i] = table[j][i] / 2;\n       b[i]++;\n       if (table[j + 1][i] == 0) break;\n     }\n   }\n   map<int, int> m, cost;\n   int ans = INF;\n   for (int i = 0; i < (20); ++i) {\n     for (int j = 0; j < (N); ++j) {\n       if (b[j] < i) continue;\n       int num = table[i][j];\n       m[num]++;\n       cost[num] += i;\n       if (m[num] >= K) ans = min(ans, cost[num]);\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int r, g, b, ck, maximum = 0, temp;\n   scanf('%d %d %d', &r, &g, &b);\n   if (r % 2 == 1) r++;\n   r = r / 2;\n   if (g % 2 == 1) g++;\n   g = g / 2;\n   if (b % 2 == 1) b++;\n   b = b / 2;\n   temp = 27 + r * 3;\n   if (temp > maximum) maximum = temp;\n   temp = 28 + g * 3;\n   if (temp > maximum) maximum = temp;\n   temp = 29 + b * 3;\n   if (temp > maximum) maximum = temp;\n   printf('%d\n', maximum);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s;\n   cin >> s;\n   for (int i = 0; i < s.size(); i++) {\n     for (char a = 'a'; a <= 'z'; a++) {\n       string t = '';\n       for (int j = 0; j < i; j++) {\n         t += s[j];\n       }\n       t += a;\n       for (int j = i; j < s.size(); j++) {\n         t += s[j];\n       }\n       string r = t;\n       reverse(t.begin(), t.end());\n       if (r == t) {\n         cout << r;\n         return 0;\n       }\n     }\n   }\n   for (char a = 'a'; a <= 'z'; a++) {\n     string t = s;\n     t += a;\n     string r = t;\n     reverse(t.begin(), t.end());\n     if (r == t) {\n       cout << r;\n       return 0;\n     }\n   }\n   cout << 'NA';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline void output(long long int x) {\n   if (x % 2)\n     cout << x / 2 << '\n';\n   else\n     cout << x / 2 - 1 << '\n';\n   return;\n }\n long long int N, K;\n int main() {\n   cin >> N >> K;\n   if (N >= K)\n     output(K);\n   else {\n     if ((N << 1) - 1 < K)\n       cout << 0 << '\n';\n     else\n       output(N - (K - N) + 2);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 5005;\n const int mod = 1000000007;\n int n, a, b, k;\n int dp[N][N];\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n >> a >> b >> k;\n   for (long long i = 1; i <= n; ++i) {\n     dp[0][i] = i;\n   }\n   for (int trip = 1; trip <= k; trip++) {\n     for (int floor = 1; floor <= n; floor++) {\n       int d = abs(b - floor);\n       dp[trip][floor] = dp[trip - 1][min(n, floor + d - 1)] -\n                         dp[trip - 1][max(0, floor - d)] - dp[trip - 1][floor] +\n                         dp[trip - 1][floor - 1];\n       while (dp[trip][floor] < 0) dp[trip][floor] += mod;\n       dp[trip][floor] %= mod;\n       dp[trip][floor] = (dp[trip][floor] + dp[trip][floor - 1]) % mod;\n     }\n   }\n   cout << (dp[k][a] - dp[k][a - 1] + mod) % mod;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int mdc(int a, int b) { return !b ? a : mdc(b, a % b); }\n int main() {\n   int n, m, x, y, a, b, p, d, x1, y1, x2, y2;\n   cin >> n >> m >> x >> y >> a >> b;\n   d = mdc(a, b);\n   a /= d;\n   b /= d;\n   p = min(n / a, m / b);\n   a *= p;\n   b *= p;\n   if (x + a / 2 > n) {\n     x2 = n;\n     x1 = n - a;\n   } else if (x - a / 2 < 0) {\n     x1 = 0;\n     x2 = a;\n   } else {\n     x2 = x + a / 2;\n     x1 = x2 - a;\n   }\n   if (y + b / 2 > m) {\n     y2 = m;\n     y1 = m - b;\n   } else if (y - b / 2 < 0) {\n     y1 = 0;\n     y2 = b;\n   } else {\n     y2 = y + b / 2;\n     y1 = y2 - b;\n   }\n   cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MOD = 1e9 + 7;\n const long long N = 3e5 + 10;\n long long pow(long long a, long long b, long long m) {\n   long long ans = 1;\n   while (b) {\n     if (b & 1) ans = (ans * a) % m;\n     b /= 2;\n     a = (a * a) % m;\n   }\n   return ans;\n }\n long long y[5], m[5];\n long long h, a, d;\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   for (long long i = 1; i <= 3; i++) {\n     cin >> y[i];\n   }\n   for (long long i = 1; i <= 3; i++) {\n     cin >> m[i];\n   }\n   cin >> h >> a >> d;\n   long long mn = 1e18;\n   for (long long i = y[1]; i <= 1000; i++) {\n     for (long long j = y[2]; j <= 201; j++) {\n       for (long long k = y[3]; k <= 201; k++) {\n         long long z = (i - y[1]) * h + (j - y[2]) * a + (k - y[3]) * d;\n         if (j <= m[3]) {\n           continue;\n         } else if (k >= m[2]) {\n           mn = min(mn, z);\n         } else {\n           long long sec_to_take_yong =\n               (m[1] / (j - m[3])) + (m[1] % (j - m[3]) != 0);\n           long long sec_to_take_m = (i / (m[2] - k)) + (i % (m[2] - k) != 0);\n           if (sec_to_take_yong < sec_to_take_m) mn = min(mn, z);\n         }\n       }\n     }\n   }\n   cout << mn << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n float distance(long long x, long long y, long long a, long long b) {\n   return sqrt((x - y) * (x - y) + (a - b) * (a - b));\n }\n int32_t main() {\n   float n, x1, y1, x2, y2;\n   cin >> n >> x1 >> y1 >> x2 >> y2;\n   if ((x1 == x2 && (x1 == n || x1 == 0)) ||\n       (y1 == y2 && (y1 == 0 || y2 == n))) {\n     cout << abs(x1 - x2) + abs(y1 - y2);\n     return 0;\n   }\n   long long path1 = 0, path2 = 0;\n   if (abs(x1 - x2) == n) {\n     path1 = 2 * n - (y1 + y2);\n     path2 = y1 + y2;\n     cout << (path1 > path2 ? path2 : path1) + n;\n     return 0;\n   }\n   if (abs(y1 - y2) == n) {\n     path1 = 2 * n - (x1 + x2);\n     path2 = x1 + x2;\n     cout << (path1 > path2 ? path2 : path1) + n;\n     return 0;\n   }\n   cout << abs(x1 - x2) + abs(y2 - y1);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long a, b, l, r, c, ans;\n   cin >> a >> b >> l >> r;\n   c = l % (a + b);\n   if (c > a) {\n     ans = 1;\n     l += (a + b - c + 1);\n     if (l <= r) ans += min(a, r - l + 1);\n     if (a > b) {\n       l += (2 * b);\n       if (l <= r) ans += min(a - b, r - l + 1);\n     }\n   } else {\n     ans = min(a - c + 1, r - l + 1);\n     l += (a - c + 1);\n     if (l <= r) {\n       ans++;\n       l += b;\n       if ((a <= b && a >= r - l + 1) || a > b) ans--;\n     }\n     if (l <= r) ans += min(c - 1, r - l + 1);\n     l += (c - 1);\n     if (a > b) {\n       if ((a - c + 1) > (a - b)) {\n         l += (b - c + 1);\n         if (l <= r) ans += min(a - b, r - l + 1);\n       } else {\n         if (l <= r) ans += min(a - c + 1, r - l + 1);\n         l += (a - c + 1);\n         l += (b + b);\n         if (l <= r) ans += min(c - b - 1, r - l + 1);\n       }\n     }\n   }\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 998244353;\n const int maxn = 1e3 + 10;\n int n, m, mp[maxn][maxn], cnt, dx[] = {0, 1, 0, -1}, dy[] = {-1, 0, 1, 0};\n bool vis[maxn][maxn];\n vector<int> ans;\n void dfs(int x, int y) {\n   if (vis[x][y] || x <= 0 || x > n || y <= 0 || y > m) return;\n   vis[x][y] = 1, ++cnt;\n   for (int i = 0; i < 4; ++i)\n     if (!(mp[x][y] & (1 << i))) dfs(x + dx[i], y + dy[i]);\n }\n void solve() {\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; ++i)\n     for (int j = 1; j <= m; ++j) scanf('%d', &mp[i][j]);\n   for (int i = 1; i <= n; ++i)\n     for (int j = 1; j <= m; ++j)\n       if (!vis[i][j]) cnt = 0, dfs(i, j), ans.push_back(cnt);\n   sort(ans.begin(), ans.end());\n   for (int i = ans.size() - 1; ~i; --i) printf('%d ', ans[i]);\n }\n int main() {\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, t;\n char v[500010];\n vector<pair<int, int> > inter;\n int memo[500010];\n int calcula(int ind) {\n   int res = 0;\n   int x = ind;\n   int ini = 0;\n   int fim = 0;\n   bool erro = false;\n   int lh = -1;\n   inter.clear();\n   for (int i = 0; i < (n); i++) {\n     if (v[i] == 'H') {\n       x--;\n       lh = i;\n     } else if (v[i] == 'S') {\n       x++;\n     }\n     if (x == -1 && !erro) {\n       ini = i;\n       erro = true;\n     }\n     if (x == 0 && erro) {\n       if (i < n && v[i + 1] == 'H') continue;\n       inter.push_back(make_pair(ini, i));\n       erro = false;\n     }\n   }\n   if (x < 0) return false;\n   if ((int)inter.size() == 0) {\n     if (lh < t) return true;\n     return false;\n   }\n   int i = 0;\n   res = inter[0].first;\n   fim = max(lh, inter[(int)inter.size() - 1].second);\n   memo[inter.size()] = 0;\n   int next;\n   for (int i = (int)inter.size() - 1; i >= 0; i--) {\n     if (i + 1 < (int)inter.size()) {\n       next = inter[i + 1].first - 1;\n     } else {\n       next = fim;\n     }\n     memo[i] = min((inter[i].second - inter[i].first + 1) * 3 - 2 + memo[i + 1] +\n                       (next - inter[i].second),\n                   (fim - inter[i].first + 1) * 2 - 1);\n   }\n   res += memo[0];\n   if (res <= t) return true;\n   return false;\n }\n int main() {\n   scanf('%d %d', &n, &t);\n   for (int i = 0; i < (n); i++) {\n     scanf(' %c', &v[i]);\n   }\n   int inicio = 0;\n   int fim = n;\n   int res = -1;\n   while (1) {\n     if (inicio > fim) break;\n     int meio = (inicio + fim) / 2;\n     if (calcula(meio)) {\n       res = meio;\n       fim = meio - 1;\n     } else {\n       inicio = meio + 1;\n     }\n   }\n   printf('%d\n', res);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int t = 1, i, n;\n   scanf('%d', &n);\n   for (i = 1; i <= n - 1; i++) {\n     t = (t + i - 1) % n + 1;\n     printf('%d ', t);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Point {\n   int x, y;\n   Point(int x = 0, int y = 0) : x(x), y(y) {}\n   Point operator-(const Point z) const { return Point(x - z.x, y - z.y); }\n   friend long long Cross(Point a, Point b) {\n     return 1ll * a.x * b.y - 1ll * a.y * b.x;\n   }\n } a[2010], b[2010];\n bool f[2010];\n char ch[2010];\n int main(int argc, char const *argv[]) {\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> a[i].x >> a[i].y;\n   cin >> ch;\n   int p = 0;\n   for (int i = 1; i < n; i++)\n     if (a[i].y < a[p].y || a[i].y == a[p].y && a[i].x < a[p].x) p = i;\n   f[p] = 1;\n   cout << p + 1 << ' ';\n   for (int i = 0; !i || ch[i - 1]; i++) {\n     int x = -1;\n     for (int j = 0; j < n; j++)\n       if (!f[j]) {\n         if (x == -1)\n           x = j;\n         else if (ch[i] == 'L')\n           if (Cross(a[j] - a[p], a[x] - a[p]) > 0)\n             x = j;\n           else\n             ;\n         else if (Cross(a[j] - a[p], a[x] - a[p]) < 0)\n           x = j;\n       }\n     cout << x + 1 << ' ';\n     f[x] = 1;\n     p = x;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n typedef pair<int, int> pii;\n typedef long long ll;\n typedef unsigned long long ull;\n template <typename T>\n bool umax(T& a, const T& b) {\n   return b <= a ? false : (a = b, true);\n }\n template <typename T>\n bool umin(T& a, const T& b) {\n   return b >= a ? false : (a = b, true);\n }\n template <typename T>\n void V2A(T a[], const vector<T>& b) {\n   for (int i = 0; i < b.size(); i++) a[i] = b[i];\n }\n template <typename T>\n void A2V(vector<T>& a, const T b[]) {\n   for (int i = 0; i < a.size(); i++) a[i] = b[i];\n }\n const double PI = acos(-1.0);\n const int INF = 1e9 + 7;\n const int maxn = 2e3 + 7;\n bool plot[maxn][maxn];\n int r[maxn][maxn];\n int n, m, k;\n int check(int row, int col) {\n   if (col >= 0 && col < m) return true;\n   return false;\n }\n int main() {\n   cin >> n >> m >> k;\n   for (int i = 0; i < k; i++) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     x--;\n     y--;\n     if (!plot[x][y]) {\n       printf('%d %d\n', x + 1, y + 1);\n       plot[x][y] = true;\n       continue;\n     }\n     for (int d = 1; d <= 3; d++) {\n       int Max = min(n, x + d + 1);\n       for (int row = max(0, x - d); row < Max; row++) {\n         int t = d - abs(x - row), col1 = y - t, col2 = y + t;\n         if (check(row, col1)) umax(r[x][y], r[row][col1] - d);\n         if (check(row, col2)) umax(r[x][y], r[row][col2] - d);\n       }\n     }\n     for (int d = r[x][y] + 1;; d++) {\n       int Max = min(n, x + d + 1);\n       bool ok = false;\n       for (int row = max(0, x - d); row < Max; row++) {\n         int t = d - abs(x - row), col1 = y - t, col2 = y + t;\n         if (check(row, col1) && !plot[row][col1]) {\n           ok = true;\n           printf('%d %d\n', row + 1, col1 + 1);\n           plot[row][col1] = true;\n           break;\n         }\n         if (check(row, col2) && !plot[row][col2]) {\n           ok = true;\n           printf('%d %d\n', row + 1, col2 + 1);\n           plot[row][col2] = true;\n           break;\n         }\n       }\n       if (ok) {\n         r[x][y] = d - 1;\n         break;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct node {\n   int p, q;\n } a[1009];\n bool cmp(node a, node b) {\n   if (a.p != b.p) return a.p < b.p;\n   if (a.p == b.p) return a.q > b.q;\n }\n int main() {\n   int m, n, i;\n   scanf('%d%d', &m, &n);\n   for (i = 1; i <= n; i++) {\n     scanf('%d%d', &a[i].p, &a[i].q);\n   }\n   sort(a + 1, a + 1 + n, cmp);\n   int sum = m;\n   for (i = 1; i <= n; i++) {\n     if (sum > a[i].p)\n       sum += a[i].q;\n     else\n       break;\n   }\n   if (i == n + 1)\n     printf('YES\n');\n   else\n     printf('NO\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s;\n   cin >> s;\n   int len = s.size();\n   cout << s[0];\n   int flag = 0;\n   for (int i = 1; i < len; i++) {\n     if (s[i] == 'd' && s[i + 1] == 'o' && s[i + 2] == 't' &&\n         (i + 2 != len - 1)) {\n       cout << '.';\n       i += 2;\n     } else if (s[i] == 'a' && s[i + 1] == 't' && flag == 0) {\n       cout << '@';\n       i++;\n       flag = 1;\n     } else\n       cout << s[i];\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   cerr.tie(nullptr);\n   long long n, k, a, z = 0;\n   cin >> n >> k;\n   vector<int> x(n), c(n);\n   for (int i = 0; i < n; i++) cin >> x[i];\n   cin >> a;\n   for (int i = 0; i < n; i++) cin >> c[i];\n   multiset<int> ms;\n   for (int i = 0; i < n; i++) {\n     ms.insert(c[i]);\n     while (k < x[i]) {\n       if (ms.size() == 0) {\n         cout << '-1\n';\n         return 0;\n       } else {\n         k += a;\n         z += *ms.begin();\n         ms.erase(ms.begin());\n       }\n     }\n   }\n   cout << z << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1e9 * 2;\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     string s;\n     cin >> s;\n     int l = 0, r = n - 1;\n     while (l <= n && s[l] == '0') l++;\n     while (r >= 0 && s[r] == '0') r--;\n     int ans;\n     if (l > r)\n       ans = n;\n     else\n       ans = max(r + 1, n - l) * 2;\n     cout << ans << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #pragma comment(linker, '/stack:200000000')\n #pragma GCC optimize('Ofast')\n #pragma GCC target( \\n     'sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native')\n #pragma GCC optimize('-ffloat-store')\n const long long INF = 0xFFFFFFFFFFFFFFFL;\n const long long N = 1e9 + 7;\n vector<long long> pri;\n void yo(int n) {\n   bool prime[n + 1];\n   memset(prime, true, sizeof(prime));\n   for (int p = 2; p * p <= n; p++) {\n     if (prime[p] == true) {\n       for (int i = p * p; i <= n; i += p) prime[i] = false;\n     }\n   }\n   for (int p = 2; p <= n; p++)\n     if (prime[p]) pri.push_back(p);\n }\n void solve() {\n   long long n;\n   cin >> n;\n   for (long long i = 1; i < 1001; i++) {\n     if (!binary_search((pri).begin(), (pri).end(), n * i + 1)) {\n       cout << i;\n       return;\n     }\n   }\n }\n int32_t main(int32_t argc, char **argv) {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   yo(1000003);\n   long long t;\n   t = 1;\n   while (t--) solve();\n   cerr << '\n'\n        << 'Time : ' << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC\n        << 'ms\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, k;\n   scanf('%d%d', &n, &k);\n   int mat[n + 1][n + 1];\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= n; j++) mat[i][j] = 0;\n   }\n   int br = 0;\n   for (int i = 1; i <= n; i += 2) {\n     for (int j = 1, x = i; j <= n && x <= n; j++, x++) {\n       mat[x][j] = 1;\n       br++;\n     }\n   }\n   for (int i = 3; i <= n; i += 2) {\n     for (int h = 1, j = i; h <= n && j <= n; h++, j++) {\n       mat[h][j] = 1;\n       br++;\n     }\n   }\n   if (br < k) {\n     printf('NO');\n     return 0;\n   }\n   printf('YES\n');\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= n; j++) {\n       if (k > 0) {\n         if (mat[i][j]) {\n           printf('L');\n           k--;\n         } else\n           printf('S');\n       } else\n         printf('S');\n     }\n     printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int a = 1;\n   int b = 2;\n   bool ok = true;\n   int k;\n   for (int i = 0; i < n; i++) {\n     cin >> k;\n     if (k != a && k != b) {\n       ok = false;\n     } else {\n       if (b == 3 && a == 1) {\n         a = min(2, k);\n         b = max(2, k);\n       } else if (b == 2 && a == 1) {\n         a = min(3, k);\n         b = max(3, k);\n       } else if (b == 3 && a == 2) {\n         a = min(1, k);\n         b = max(1, k);\n       }\n     }\n   }\n   if (ok) {\n     cout << 'YES';\n   } else {\n     cout << 'NO';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 5, M = 20;\n int n, m, a[N], b[M], ans[M];\n set<vector<int> > use[M + 1];\n void find(int y, vector<int>& current) {\n   if (y == m) {\n     for (int i = 0; i < n; i++)\n       if (a[i] != current[i]) return;\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < m; j++) cout << '.*'[(bool)(ans[j] & (1 << i))];\n       cout << endl;\n     }\n     exit(0);\n   }\n   if (use[y].find(current) != use[y].end()) return;\n   for (int i = 0; i < (1 << n); i++) {\n     if ((((((((i << 1) | i) ^ i) >> 1) >> 0)) & 1) +\n             (((((((i << 1) | i) ^ i) >> 1) >> 1)) & 1) +\n             (((((((i << 1) | i) ^ i) >> 1) >> 2)) & 1) +\n             (((((((i << 1) | i) ^ i) >> 1) >> 3)) & 1) +\n             (((((((i << 1) | i) ^ i) >> 1) >> 4)) & 1) !=\n         b[y])\n       continue;\n     ans[y] = i;\n     vector<int> newCur = current;\n     bool flag = true;\n     for (int j = 0; j < n; j++) {\n       if (ans[y] & (1 << j) && (!y || !(ans[y - 1] & (1 << j)))) newCur[j]++;\n       if (newCur[j] > a[j] || newCur[j] < a[j] - ((m - y) / 2)) {\n         flag = false;\n         break;\n       }\n     }\n     if (flag) find(y + 1, newCur);\n   }\n   use[y].insert(current);\n }\n int main() {\n   cin >> n >> m;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   for (int i = 0; i < m; i++) cin >> b[i];\n   vector<int> c(n + 1, 0);\n   find(0, c);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int N = 200005;\n const int D = 30;\n struct node {\n   int a, b;\n };\n vector<int> road[N], h[N];\n vector<node> 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 <bits/stdc++.h>\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<prog> 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 <bits/stdc++.h>\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<int> adj[maxN], pos[maxN];\n vector<pair<int, int> > query[maxN];\n pair<int, int> 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<int, int>(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<int, int>(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 <bits/stdc++.h>\n using namespace std;\n template <class T, class L>\n bool smax(T& x, L y) {\n   return x < y ? (x = y, 1) : 0;\n }\n template <class T, class L>\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<vector<int> > all;\n vector<int> 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 <bits/stdc++.h>\n using namespace std;\n set<pair<pair<int, int>, pair<int, int> > > s;\n vector<int> 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<int, int>, pair<int, int> > 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 <bits/stdc++.h>\n using namespace std;\n inline long long read() {\n   char ch = getchar();\n   long long x = 0, f = 1;\n   while (ch < '0' || ch > '9') f = ch == '-' ? -1 : 1, ch = getchar();\n   while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();\n   return x * f;\n }\n int main(int argc, char *argv[]) {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   long long base = (1LL << 7) - 1;\n   long long res = 0, cur;\n   printf('?');\n   for (long long i = (1); i <= (100); i += (1)) printf(' %lld', i);\n   putchar('\n');\n   fflush(stdout);\n   cur = read();\n   res += (cur >> 7) << 7;\n   printf('?');\n   for (long long i = (1); i <= (100); i += (1)) printf(' %lld', i << 7);\n   putchar('\n');\n   fflush(stdout);\n   cur = read();\n   res += cur & base;\n   printf('! %lld\n', res);\n   fflush(stdout);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 205, MAXL = 1 << 20;\n char qq[MAXL];\n char s[MAX][MAX];\n pair<int, int> kamo[MAX][MAX];\n vector<pair<int, int> > R[MAX][MAX];\n int indeg[MAX][MAX];\n int cik[MAX][MAX];\n int imacik[MAX * MAX][10];\n int brred, brstup;\n int pr[10], ps[10];\n int bio[MAX][MAX];\n int dokle[MAX][MAX];\n int imaq[MAXL][10];\n int brc = 1;\n int Vani(int red, int stup) {\n   return red < 0 || red >= brred || stup < 0 || stup >= brstup;\n }\n void Osisaj() {\n   queue<pair<int, int> > Q;\n   for (int i = 0; i < brred; i++)\n     for (int j = 0; j < brstup; j++)\n       if (!indeg[i][j]) Q.push(pair<int, int>(i, j));\n   for (; !Q.empty();) {\n     pair<int, int> tmp = Q.front();\n     bio[tmp.first][tmp.second] = 1;\n     Q.pop();\n     pair<int, int> nn = kamo[tmp.first][tmp.second];\n     indeg[nn.first][nn.second]--;\n     if (!indeg[nn.first][nn.second]) Q.push(nn);\n   }\n   for (int i = 0; i < brred; i++) {\n     for (int j = 0; j < brstup; j++) {\n       if (!bio[i][j]) {\n         int sz = 0;\n         for (pair<int, int> tmp = pair<int, int>(i, j);\n              tmp != pair<int, int>(i, j) || !sz;\n              sz++, tmp = kamo[tmp.first][tmp.second]) {\n           bio[tmp.first][tmp.second] = 1;\n           cik[tmp.first][tmp.second] = brc;\n           imacik[brc][s[tmp.first][tmp.second] - '0'] = 1;\n         }\n         brc++;\n       }\n     }\n   }\n }\n int Rijesi() {\n   queue<pair<int, int> > Q;\n   memset(dokle, 0, sizeof dokle);\n   int len = (int)strlen(qq);\n   for (int i = 0; i <= len; i++)\n     for (int j = 0; j < 10; j++) imaq[i][j] = 0;\n   for (int i = len - 1; i >= 0; i--) {\n     imaq[i][qq[i] - '0'] = 1;\n     for (int j = 0; j < 10; j++) imaq[i][j] |= imaq[i + 1][j];\n   }\n   for (int i = 0; i < brred; i++)\n     for (int j = 0; j < brstup; j++) {\n       indeg[i][j] = (int)R[i][j].size();\n       if (!indeg[i][j]) Q.push(pair<int, int>(i, j));\n     }\n   for (; !Q.empty();) {\n     pair<int, int> tmp = Q.front();\n     Q.pop();\n     int nd = dokle[tmp.first][tmp.second];\n     if (s[tmp.first][tmp.second] == qq[nd]) nd++;\n     if (nd == len) return 1;\n     pair<int, int> nn = kamo[tmp.first][tmp.second];\n     dokle[nn.first][nn.second] = max(dokle[nn.first][nn.second], nd);\n     indeg[nn.first][nn.second]--;\n     if (!indeg[nn.first][nn.second]) Q.push(nn);\n   }\n   for (int i = 0; i < brred; i++) {\n     for (int j = 0; j < brstup; j++) {\n       if (cik[i][j]) {\n         int da = 1;\n         int indc = cik[i][j];\n         for (int k = 0; k < 10; k++)\n           if (!imacik[indc][k] && imaq[dokle[i][j]][k]) da = 0;\n         if (da) return 1;\n       }\n     }\n   }\n   return 0;\n }\n int main() {\n   int brq;\n   scanf('%d%d%d', &brred, &brstup, &brq);\n   for (int i = 0; i < brred; i++) scanf('%s', s[i]);\n   for (int i = 0; i < 10; i++) scanf('%d%d', &pr[i], &ps[i]);\n   for (int i = 0; i < brred; i++) {\n     for (int j = 0; j < brstup; j++) {\n       int nr = i + pr[s[i][j] - '0'];\n       int ns = j + ps[s[i][j] - '0'];\n       if (Vani(nr, ns))\n         kamo[i][j] = pair<int, int>(i, j);\n       else\n         kamo[i][j] = pair<int, int>(nr, ns);\n       indeg[kamo[i][j].first][kamo[i][j].second]++;\n       R[kamo[i][j].first][kamo[i][j].second].push_back(pair<int, int>(i, j));\n     }\n   }\n   Osisaj();\n   for (int i = 0; i < brq; i++) {\n     scanf('%s', qq);\n     printf('%s\n', Rijesi() ? 'YES' : 'NO');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n struct Segtree {\n   int N;\n   vector<T> seg, lazy;\n   Segtree(int _n) : N(_n) {\n     seg.resize(4 * N, 0);\n     lazy.resize(4 * N, 0);\n   }\n   T join(T x, T y) { return max(x, y); }\n   void push(int x, int s, int e) {\n     if (!lazy[x]) return;\n     seg[x] = max(seg[x], lazy[x]);\n     if (s != e) {\n       lazy[2 * x] = max(lazy[2 * x], lazy[x]);\n       lazy[2 * x + 1] = max(lazy[2 * x + 1], lazy[x]);\n     }\n     lazy[x] = 0;\n   }\n   void build(int x, int s, int e) {\n     if (s == e) {\n       seg[x] = 0;\n       return;\n     }\n     int mid = (s + e) >> 1;\n     build(2 * x, s, mid);\n     build(2 * x + 1, mid + 1, e);\n     seg[x] = join(seg[2 * x], seg[2 * x + 1]);\n   }\n   void update(int x, int s, int e, int l, int r, T val) {\n     push(x, s, e);\n     if (s > r || e < l) return;\n     if (s >= l && e <= r) {\n       lazy[x] = val;\n       push(x, s, e);\n       return;\n     }\n     int mid = (s + e) >> 1;\n     update(2 * x, s, mid, l, r, val);\n     update(2 * x + 1, mid + 1, e, l, r, val);\n     seg[x] = join(seg[2 * x], seg[2 * x + 1]);\n   }\n   T query(int x, int s, int e, int l, int r) {\n     push(x, s, e);\n     if (e < l || s > r) return 0;\n     if (s >= l && e <= r) {\n       return seg[x];\n     }\n     int mid = (s + e) >> 1;\n     return join(query(2 * x, s, mid, l, r), query(2 * x + 1, mid + 1, e, l, r));\n   }\n   void update(int l, int r, T val) { update(1, 0, N - 1, l, r, val); }\n   T query(int l, int r) { return query(1, 0, N - 1, l, r); }\n };\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int n, q;\n   cin >> n >> q;\n   vector<int> x(q), y(q), d(q), cc(1, 0);\n   for (int i = 0; i < q; ++i) {\n     char c;\n     cin >> x[i] >> y[i] >> c;\n     d[i] = (c == 'U');\n     cc.push_back(x[i]);\n     cc.push_back(y[i]);\n     cc.push_back(n + 1 - x[i]);\n     cc.push_back(n + 1 - y[i]);\n   }\n   sort(cc.begin(), cc.end());\n   cc.erase(unique(cc.begin(), cc.end()), cc.end());\n   Segtree<int> left(cc.size() + 1), up(cc.size() + 1);\n   for (int i = 0; i < q; ++i) {\n     x[i] = lower_bound(cc.begin(), cc.end(), x[i]) - cc.begin();\n     y[i] = lower_bound(cc.begin(), cc.end(), y[i]) - cc.begin();\n     if (d[i]) {\n       int id = up.query(y[i], y[i]);\n       up.update(y[i], y[i], y[i]);\n       cout << cc[y[i]] - cc[id] << '\n';\n       id = lower_bound(cc.begin(), cc.end(), n + 1 - cc[id]) - cc.begin();\n       y[i] = lower_bound(cc.begin(), cc.end(), n + 1 - cc[y[i]]) - cc.begin();\n       left.update(y[i], id, x[i]);\n     } else {\n       int id = left.query(x[i], x[i]);\n       left.update(x[i], x[i], x[i]);\n       cout << cc[x[i]] - cc[id] << '\n';\n       id = lower_bound(cc.begin(), cc.end(), n + 1 - cc[id]) - cc.begin();\n       x[i] = lower_bound(cc.begin(), cc.end(), n + 1 - cc[x[i]]) - cc.begin();\n       up.update(x[i], id, y[i]);\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void addmod(int &a, long long b) {\n   a = (a + b);\n   if (a >= 1000000007) a -= 1000000007;\n }\n void mulmod(int &a, long long b) { a = (a * b) % 1000000007; }\n template <class T>\n bool domin(T &a, const T &b) {\n   return a > b ? a = b, 1 : 0;\n }\n template <class T>\n bool domax(T &a, const T &b) {\n   return a < b ? a = b, 1 : 0;\n }\n int gi() {\n   int a;\n   scanf('%d', &a);\n   return a;\n }\n long long gll() {\n   long long a;\n   scanf('%lld', &a);\n   return a;\n }\n int n;\n namespace treap {\n struct treap {\n   int val, size, lazy;\n   long long rnd;\n   treap *l, *r;\n   treap()\n       : val(0),\n         size(0),\n         lazy(0),\n         rnd((((long long)rand()) << 32) | rand()),\n         l(NULL),\n         r(NULL) {}\n   treap(int val)\n       : val(val),\n         size(1),\n         lazy(0),\n         rnd((((long long)rand()) << 32) | rand()),\n         l(NULL),\n         r(NULL) {}\n   void push() {\n     if (lazy == 0) return;\n     val += lazy;\n     if (l != NULL) l->lazy += lazy;\n     if (r != NULL) r->lazy += lazy;\n     lazy = 0;\n   }\n   void updateSz() {\n     size = 1;\n     if (l != NULL) size += l->size;\n     if (r != NULL) size += r->size;\n   }\n };\n typedef treap *ptreap;\n ptreap root = NULL;\n void split(ptreap tp, int key, ptreap &l, ptreap &r) {\n   if (tp == NULL) {\n     l = NULL, r = NULL;\n     return;\n   }\n   tp->push();\n   if (tp->val < key)\n     l = tp, split(tp->r, key, tp->r, r);\n   else\n     r = tp, split(tp->l, key, l, tp->l);\n   if (l != NULL) l->updateSz();\n   if (r != NULL) r->updateSz();\n }\n pair<ptreap, ptreap> split(int v) {\n   ptreap l, r;\n   split(root, v, l, r);\n   return {l, r};\n }\n pair<ptreap, ptreap> split(ptreap tp, int v) {\n   ptreap l, r;\n   split(tp, v, l, r);\n   return {l, r};\n }\n void insert(ptreap &tp, ptreap v) {\n   if (tp == NULL) {\n     tp = v;\n     return;\n   }\n   tp->push();\n   if (v->rnd < tp->rnd)\n     insert(v->val > tp->val ? tp->r : tp->l, v);\n   else\n     split(tp, v->val, v->l, v->r), tp = v;\n   tp->updateSz();\n }\n void insert(int v) {\n   ptreap tp = new treap(v);\n   insert(root, tp);\n }\n void merge(ptreap &t, ptreap l, ptreap r) {\n   if (l != NULL) l->push();\n   if (r != NULL) r->push();\n   if (l == NULL || r == NULL)\n     t = (l == NULL ? r : l);\n   else if (l->rnd > r->rnd)\n     t = l, merge(t->r, l->r, r);\n   else\n     t = r, merge(t->l, l, r->l);\n   if (t != NULL) t->updateSz();\n }\n void erase(ptreap &tp, int v) {\n   if (tp == NULL) return;\n   tp->push();\n   if (v == tp->val) {\n     merge(tp, tp->l, tp->r);\n   } else {\n     erase(v < tp->val ? tp->l : tp->r, v);\n     tp->updateSz();\n   }\n }\n int getmin(ptreap tp) {\n   if (tp == NULL) return 0;\n   tp->push();\n   return tp->l == NULL ? tp->val : getmin(tp->l);\n }\n int getmax(ptreap tp) {\n   if (tp == NULL) return 0;\n   tp->push();\n   return tp->r == NULL ? tp->val : getmax(tp->r);\n }\n void recalc(ptreap tp) {\n   if (tp == NULL) return;\n   tp->push();\n   recalc(tp->l);\n   recalc(tp->r);\n   tp->updateSz();\n }\n void debug(ptreap &tp) {\n   if (tp == NULL) return;\n   tp->push();\n   if (tp->l != NULL) debug(tp->l);\n   cout << '    ' << tp->val << ':' << tp->rnd << ':' << tp->size << endl;\n   if (tp->r != NULL) debug(tp->r);\n }\n }  // namespace treap\n int main() {\n   n = gi();\n   for (int i = 0; i < n; i++) {\n     int l = gi(), r = gi();\n     auto v = treap::split(l);\n     auto v2 = treap::split(v.second, r);\n     if (v2.first != NULL) v2.first->lazy++;\n     if (v2.second != NULL) {\n       auto v = treap::getmin(v2.second);\n       treap::erase(v2.second, v);\n     }\n     treap::merge(treap::root, v.first, v2.first);\n     treap::merge(treap::root, treap::root, v2.second);\n     treap::insert(l);\n   }\n   cout << treap::root->size << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 1e5 + 10;\n int l = 1, r = 0;\n int a[MAXN], b[MAXN], now[MAXN], num[MAXN << 1], cnt[MAXN], ans[MAXN];\n map<int, int> ms;\n struct Change {\n   int p, x, y;\n } c[MAXN];\n struct Query {\n   int l, r, t, id;\n   bool operator<(const Query &A) const {\n     if (b[l] == b[A.l]) return b[r] == b[A.r] ? t < A.t : b[r] < b[A.r];\n     return b[l] < b[A.l];\n   }\n } q[MAXN];\n void update(int x, int d) {\n   int &y = num[x];\n   if (y > 0) cnt[y]--;\n   y += d;\n   if (y > 0) cnt[y]++;\n }\n void modify(int p, int d) {\n   if (l <= p && p <= r) {\n     update(a[p], -1);\n     update(d, 1);\n   }\n   a[p] = d;\n }\n int get() {\n   for (int i = 1;; i++) {\n     if (!cnt[i]) return i;\n   }\n }\n int main() {\n   int n, m, id = 0, Time = 0, sz = 0;\n   scanf('%d%d', &n, &m);\n   int B = 2000;\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n     int &t = ms[a[i]];\n     if (!t) t = ++sz;\n     now[i] = a[i] = t;\n     b[i] = i / B + 1;\n   }\n   while (m--) {\n     int op, x, y;\n     scanf('%d%d%d', &op, &x, &y);\n     if (op == 1)\n       q[++id] = (Query){x, y, Time, id};\n     else {\n       int &t = ms[y];\n       if (!t) t = ++sz;\n       c[++Time] = (Change){x, y = t, now[x]};\n       now[x] = y;\n     }\n   }\n   sort(q + 1, q + id + 1);\n   int v = 0;\n   for (int i = 1; i <= id; i++) {\n     while (v < q[i].t) modify(c[v + 1].p, c[v + 1].x), v++;\n     while (v > q[i].t) modify(c[v].p, c[v].y), v--;\n     while (l < q[i].l) update(a[l], -1), l++;\n     while (l > q[i].l) update(a[l - 1], 1), l--;\n     while (r < q[i].r) update(a[r + 1], 1), r++;\n     while (r > q[i].r) update(a[r], -1), r--;\n     ans[q[i].id] = get();\n   }\n   for (int i = 1; i <= id; i++) {\n     printf('%d\n', ans[i]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long double PI = 4.0 * atan(1.0);\n void EnchomSolve() {\n   int l;\n   long double L;\n   long double ans = 0.0;\n   long double area;\n   long double height;\n   long double help, help2;\n   scanf('%d', &l);\n   L = (long double)l;\n   help = L / sqrt(3.0);\n   height = sqrt(L * L - help * help);\n   help = (sqrt(3.0) / 2.0) * L;\n   area = (help * L) / 2.0;\n   ans += area * height / 3.0;\n   scanf('%d', &l);\n   L = (long double)l;\n   help = (sqrt(2.0) / 2.0) * L;\n   height = sqrt(L * L - help * help);\n   area = L * L;\n   ans += area * height / 3.0;\n   scanf('%d', &l);\n   L = (long double)l;\n   help = L / (sqrt(2.0 - 2.0 * cos(72.0 * PI / 180.0)));\n   height = sqrt(L * L - help * help);\n   help2 = sqrt(help * help - (L / 2.0) * (L / 2.0));\n   area = L * help2 / 2.0;\n   area *= 5.0;\n   ans += area * height / 3.0;\n   printf('%.10f\n', (double)ans);\n   return;\n }\n int main() {\n   EnchomSolve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a, b, c;\n   cin >> a >> b >> c;\n   int x = min(a, b / 2);\n   int y = min(x, c / 4);\n   cout << y * 7;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct EDGE {\n   int to, next, w, co;\n } e[100000];\n int head[100], top, vis[100000];\n void add(int u, int v, int w, int co) {\n   e[top].to = v;\n   e[top].w = w;\n   e[top].co = co;\n   e[top].next = head[u];\n   head[u] = top++;\n }\n struct _ {\n   int max_flow, co;\n };\n int dis[100], vvis[100], prep[100], pree[100];\n queue<int> q;\n deque<int> node;\n void spfa(int s) {\n   memset(dis, 63, sizeof(dis));\n   memset(vvis, 0, sizeof(vvis));\n   dis[s] = 0;\n   q.push(s);\n   int i;\n   while (!q.empty()) {\n     s = q.front();\n     q.pop();\n     vvis[s] = 0;\n     int i;\n     for (i = head[s]; ~i; i = e[i].next) {\n       if (!e[i].w) continue;\n       if (dis[s] + e[i].co < dis[e[i].to]) {\n         dis[e[i].to] = dis[s] + e[i].co;\n         pree[e[i].to] = i;\n         prep[e[i].to] = s;\n         if (vvis[e[i].to]) continue;\n         vvis[e[i].to] = 1;\n         q.push(e[i].to);\n       }\n     }\n   }\n }\n _ dfs(int s, int t, int rest) {\n   int flow = 998244353, co = 0;\n   int temp = t;\n   _ rv;\n   while (t != s) {\n     flow = min(flow, e[pree[t]].w);\n     co += e[pree[t]].co;\n     t = prep[t];\n   }\n   if (co > 0) flow = min(flow, rest / co);\n   if (flow == 0) return rv = (_){0, 0};\n   t = temp;\n   while (t != s) {\n     temp = pree[t];\n     e[temp].w -= flow;\n     e[temp ^ 1].w += flow;\n     t = prep[t];\n   }\n   rv = (_){flow, co};\n   return rv;\n }\n long long EK(int s, int t, int rest) {\n   long long sum = 0;\n   _ _;\n   while (1) {\n     spfa(s);\n     if (dis[t] > 998244353) break;\n     _ = dfs(s, t, rest);\n     if (_.max_flow == 0) break;\n     sum += _.max_flow;\n     rest -= _.max_flow * _.co;\n   }\n   return sum;\n }\n int main() {\n   memset(head, 255, sizeof(head));\n   int n, k;\n   scanf('%d%d', &n, &k);\n   int i, j, t;\n   for (i = 1; i <= n; i++) {\n     for (j = 1; j <= n; j++) {\n       scanf('%d', &t);\n       if (t) {\n         add(i, j, t, 0);\n         add(j, i, 0, 0);\n         add(i, j, k, 1);\n         add(j, i, 0, -1);\n       }\n     }\n   }\n   long long ans = EK(1, n, k);\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct station {\n   int pos, price;\n } a[200003];\n int T[800008], d, n, m;\n long long cnt;\n bool comp(station A, station B) { return (A.pos < B.pos); }\n void Build_MinIT(int, int, int);\n int Find_Min(int, int, int, int, int);\n int main() {\n   scanf('%d %d %d', &d, &n, &m);\n   for (int i = 1; i <= m; i++) scanf('%d %d', &a[i].pos, &a[i].price);\n   sort(a + 1, a + 1 + m, comp);\n   a[++m].pos = d;\n   for (int i = 1; i <= m; i++) {\n     if (a[i].pos - a[i - 1].pos > n) {\n       cout << -1;\n       return 0;\n     }\n   }\n   if (n >= d) {\n     cout << 0;\n     return 0;\n   }\n   a[200002].price = 1E+9;\n   Build_MinIT(1, m, 1);\n   int i = 0, j = 1, t = n;\n   while (j <= m) {\n     while (a[i].price < a[j].price && a[j].pos - a[i].pos <= n && j <= m) j++;\n     if (a[j].pos - a[i].pos <= n) {\n       cnt += (long long)(a[j].pos - (a[i].pos + t)) * a[i].price;\n       t = 0;\n       i = j++;\n     } else {\n       int k = Find_Min(i + 1, j - 1, 1, m, 1);\n       cnt += (long long)(n - t) * a[i].price;\n       t = a[i].pos + n - a[k].pos;\n       i = k;\n     }\n   }\n   cout << cnt;\n   return 0;\n }\n void Build_MinIT(int L, int R, int v) {\n   if (L == R) {\n     T[v] = L;\n     return;\n   }\n   int m = (L + R) / 2;\n   Build_MinIT(L, m, v * 2);\n   Build_MinIT(m + 1, R, v * 2 + 1);\n   T[v] = (a[T[v * 2]].price < a[T[v * 2 + 1]].price ? T[v * 2] : T[v * 2 + 1]);\n }\n int Find_Min(int l, int r, int L, int R, int v) {\n   if (l > r) return 200002;\n   if (l == L && r == R) return T[v];\n   int m = (L + R) / 2;\n   int x = Find_Min(l, min(r, m), L, m, v * 2),\n       y = Find_Min(max(l, m + 1), r, m + 1, R, v * 2 + 1);\n   return (a[x].price < a[y].price ? x : y);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   double lo = 0.0, hi = 10000000.0;\n   for (int i = 1; i <= n; i++) {\n     int sta;\n     cin >> sta;\n     lo = max(lo, (double)10.0 * sta / i);\n     hi = min(hi, (double)10.0 * (sta + 1) / i);\n   }\n   int nextlo = floor(lo * (n + 1) / 10.0);\n   int nexthi = ceil(hi * (n + 1) / 10.0);\n   if (nextlo + 1 >= nexthi) {\n     cout << 'unique' << endl << nextlo << endl;\n   } else {\n     cout << 'not unique' << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/stack:102400000,102400000')\n using namespace std;\n int lowbit(int x) { return (x & -x); }\n template <class T_>\n T_ f_abs(T_ x) {\n   return x < 0 ? -x : x;\n }\n template <class T_>\n T_ f_max(T_ a, T_ b) {\n   return a > b ? a : b;\n }\n template <class T_>\n T_ f_min(T_ a, T_ b) {\n   return a < b ? a : b;\n }\n template <class T_>\n void chkmax(T_ &a, T_ b) {\n   if (a == -1 || a < b) a = b;\n }\n template <class T_>\n void chkmin(T_ &a, T_ b) {\n   if (a == -1 || a > b) a = b;\n }\n template <class T_>\n T_ gcd(T_ a, T_ b) {\n   while (T_ t = a % b) a = b, b = t;\n   return b;\n }\n template <class T_>\n void f_swap(T_ &a, T_ &b) {\n   T_ t = a;\n   a = b;\n   b = t;\n }\n const double eps = 1e-9;\n const int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1},\n           dy[] = {0, 0, -1, 1, -1, 1, -1, 1};\n const int inf = 0x7fffffff;\n const int mod = 1000000007;\n const int N = 100003;\n const int MAXV = 100003;\n int n, m, cnt, who[N], dsu[N];\n bool vis[N], tree[N << 2];\n vector<pair<int, int> > vt[N], qu[N];\n struct Oper {\n   int tp, x, y;\n   bool tag;\n   Oper() {}\n   Oper(int tp_, int x_, int y_) {\n     tp = tp_;\n     x = x_;\n     y = y_;\n   }\n } op[N];\n struct Edge {\n   int to, next;\n } edg[MAXV << 1];\n int total, idx, root, first[MAXV];\n int siz[MAXV];\n int dep[MAXV];\n int top[MAXV];\n int fa[MAXV];\n int son[MAXV];\n int id[MAXV];\n void Dfs_1(int u) {\n   int e, v, i;\n   siz[u] = 1;\n   son[u] = 0;\n   for (e = 0; e < (int)vt[u].size(); ++e) {\n     v = vt[u][e].first;\n     i = vt[u][e].second;\n     op[i].tag = !vis[v];\n   }\n   vis[u] = true;\n   for (e = first[u]; ~e; e = edg[e].next) {\n     v = edg[e].to;\n     if (v != fa[u]) {\n       fa[v] = u;\n       dep[v] = dep[u] + 1;\n       Dfs_1(v);\n       if (son[u] == 0 || siz[v] > siz[son[u]]) son[u] = v;\n       siz[u] += siz[v];\n     }\n   }\n   for (e = 0; e < (int)vt[u].size(); ++e) {\n     v = vt[u][e].first;\n     i = vt[u][e].second;\n     if (op[i].tag && !vis[v]) op[i].tag = false;\n   }\n }\n void Dfs_2(int u, int tp) {\n   id[u] = ++idx;\n   top[u] = tp;\n   if (son[u] != 0) Dfs_2(son[u], top[u]);\n   for (int e = first[u]; ~e; e = edg[e].next) {\n     int v = edg[e].to;\n     if (v != son[u] && v != fa[u]) Dfs_2(v, v);\n   }\n }\n void BuildChain() {\n   Dfs_1(root);\n   Dfs_2(root, root);\n }\n void Build(int l, int r, int root) {\n   tree[root] = false;\n   if (l == r) return;\n   int mid = ((l + r) >> 1);\n   Build(l, mid, (root << 1));\n   Build(mid + 1, r, (root << 1 | 1));\n }\n void Update(int p, int l, int r, int root) {\n   if (l == r) {\n     tree[root] = true;\n     return;\n   }\n   int mid = ((l + r) >> 1);\n   if (p <= mid)\n     Update(p, l, mid, (root << 1));\n   else\n     Update(p, mid + 1, r, (root << 1 | 1));\n   tree[root] = (tree[(root << 1)] && tree[(root << 1 | 1)]);\n }\n bool Query(int L, int R, int l, int r, int root) {\n   if (L <= l && r <= R) return tree[root];\n   int mid = ((l + r) >> 1);\n   bool res = true;\n   if (L <= mid) res = (res && Query(L, R, l, mid, (root << 1)));\n   if (R > mid) res = (res && Query(L, R, mid + 1, r, (root << 1 | 1)));\n   return res;\n }\n bool FindChain(int u, int v) {\n   int u_top = top[u], v_top = top[v], L, R;\n   while (u_top != v_top) {\n     if (dep[u_top] < dep[v_top]) {\n       f_swap(u_top, v_top);\n       f_swap(u, v);\n     }\n     L = id[u_top];\n     R = id[u];\n     if (!Query(L, R, 1, idx, 1)) return false;\n     u = fa[u_top];\n     u_top = top[u];\n   }\n   if (u != v) {\n     if (dep[u] > dep[v]) f_swap(u, v);\n     L = id[son[u]];\n     R = id[v];\n     if (!Query(L, R, 1, idx, 1)) return false;\n   }\n   return true;\n }\n void addedge(int from, int to) {\n   edg[total].to = to;\n   edg[total].next = first[from];\n   first[from] = total++;\n }\n void Init() {\n   cnt = 0;\n   root = n + 1;\n   total = idx = fa[root] = dep[root] = 0;\n   for (int i = 1; i <= n + 1; ++i) {\n     first[i] = -1;\n     dsu[i] = i;\n     vt[i].clear();\n     vis[i] = false;\n   }\n }\n void GetData() {\n   int tp, x, y;\n   for (int i = 0; i < m; ++i) {\n     scanf('%d%d', &tp, &x);\n     if (tp != 2) scanf('%d', &y);\n     if (tp == 1) {\n       dsu[x] = y;\n       addedge(y, x);\n     } else if (tp == 2) {\n       y = -1;\n       who[++cnt] = x;\n       qu[cnt].clear();\n     } else {\n       vt[x].push_back(make_pair(who[y], i));\n       qu[y].push_back(make_pair(x, i));\n     }\n     op[i] = Oper(tp, x, y);\n   }\n }\n void Solve() {\n   int i, j, tp, p;\n   bool flag;\n   for (i = 1; i <= n; ++i) {\n     if (dsu[i] == i) addedge(n + 1, i);\n   }\n   BuildChain();\n   Build(1, idx, 1);\n   for (i = cnt = 0; i < m; ++i) {\n     tp = op[i].tp;\n     if (tp == 1)\n       Update(id[op[i].x], 1, idx, 1);\n     else if (tp == 2) {\n       ++cnt;\n       for (j = 0; j < (int)qu[cnt].size(); ++j) {\n         p = qu[cnt][j].second;\n         if (op[p].tag)\n           flag = FindChain(who[cnt], qu[cnt][j].first);\n         else\n           flag = false;\n         vis[p] = flag;\n       }\n     }\n   }\n   for (i = 0; i < m; ++i) {\n     if (op[i].tp == 3) puts(vis[i] ? 'YES' : 'NO');\n   }\n }\n int main() {\n   while (~scanf('%d%d', &n, &m)) {\n     Init();\n     GetData();\n     Solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int arr[111];\n int main() {\n   int n;\n   scanf('%d', &n);\n   arr[0] = 0;\n   for (int i = (1); i < (n + 1); ++i) scanf('%d', &arr[i]);\n   int ans = 0;\n   if (n % 2 == 0 || n == 1) {\n     printf('-1\n');\n     return 0;\n   }\n   for (int i = n; i >= 1; i -= 2) {\n     int tmp = max(arr[i], arr[i - 1]);\n     ans += tmp;\n     arr[i] = arr[i - 1] = 0;\n     arr[(i - 1) / 2] = max(0, arr[(i - 1) / 2] - tmp);\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n namespace {};\n int sgn(int x) { return x >= 0 ? 1 : -1; }\n int arr[200001];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int n, k;\n   cin >> n >> k;\n   for (int i = 0; i < n; i++) {\n     cin >> arr[i];\n     arr[i] = sgn(arr[i]);\n     if (arr[i] == -1) k--;\n   }\n   if (k < 0) {\n     cout << '-1\n';\n     return 0;\n   }\n   vector<pair<int, int>> segs;\n   int flips = 0;\n   int curr = 1, c = 0;\n   for (int i = 0; i < n; i++) {\n     if (arr[i] == curr)\n       c++;\n     else {\n       flips++;\n       if (curr == 1 && i - c > 0) segs.emplace_back(c, -2);\n       c = 1;\n       curr = arr[i];\n     }\n   }\n   for (auto seg : segs) {\n     ;\n   }\n   sort(segs.begin(), segs.end());\n   ;\n   for (auto seg : segs) {\n     if (seg.first > k) break;\n     k -= seg.first;\n     flips += seg.second;\n   }\n   if (curr == 1 && c > 0) {\n     if (k >= c) flips--;\n   }\n   if (flips < 0) flips = 0;\n   cout << flips << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct info {\n   long long fs, sm, id;\n } bd[100001];\n int cmp(info a, info b) { return a.fs < b.fs; }\n int main() {\n   ios_base::sync_with_stdio(0);\n   long long int i, j, x, n, cnt = 0, m, y, k, ans = 0, cf, cm, a, rr1 = 0, l, r,\n                             md, r1, r2, xxx, flg;\n   cin >> n >> a >> cf >> cm >> m;\n   long long in[n + 1], bs[n + 1];\n   for (i = 1; i <= n; i++) {\n     cin >> in[i];\n     bd[i].fs = a - in[i];\n     bd[i].id = i;\n     bs[i] = a - in[i];\n   }\n   sort(bd + 1, bd + 1 + n, cmp);\n   sort(bs + 1, bs + 1 + n);\n   for (i = 2; i <= n; i++) {\n     bd[i].fs += bd[i - 1].fs;\n   }\n   bd[n].sm = 0;\n   for (i = n - 1; i >= 1; i--) {\n     x = abs(in[bd[i + 1].id] - in[bd[i].id]);\n     bd[i].sm = bd[i + 1].sm + x * (n - i);\n   }\n   bd[0].fs = bd[0].id = 0;\n   bd[0].sm = (a - in[bd[1].id]) * n + bd[1].sm;\n   for (i = 1; i <= n; i++) {\n     if (bs[i] > 0) break;\n     cnt++;\n   }\n   ans = cnt * cf + cm * in[bd[n].id];\n   for (i = n; i >= 0; i--) {\n     x = m;\n     y = cnt * cf;\n     rr1 = cnt;\n     flg = 0;\n     if (x >= bd[i].fs) {\n       flg = 1;\n       y = i * cf;\n       x -= bd[i].fs;\n       rr1 = i;\n     }\n     l = i;\n     r = n;\n     while (r - l > 1) {\n       md = (l + r) / 2;\n       if (bd[md].sm > x)\n         l = md;\n       else\n         r = md;\n     }\n     if (bd[l].sm <= x && i != 0) r = l;\n     x -= bd[r].sm;\n     if (r == i && flg) {\n       if (i == n) {\n         y = a * cm + n * cf;\n         if (ans <= y) {\n           ans = y;\n           r1 = n;\n           r2 = n + 1;\n         }\n       } else {\n         y += cm * (min(a, in[bd[r].id] + x / (n - r)));\n         if (ans <= y) {\n           ans = y;\n           r1 = i;\n           xxx = min(a, in[bd[r].id] + x / (n - r));\n           r2 = i + 1;\n         }\n       }\n       continue;\n     }\n     if (r - 1 > 0)\n       y += cm * (min(a, min(in[bd[r - 1].id], in[bd[r].id] + x / (n - r + 1))));\n     else\n       y += cm * (min(a, in[bd[r].id] + x / (n - r + 1)));\n     if (y >= ans) {\n       ans = y;\n       r1 = rr1;\n       r2 = r;\n       if (r - 1 > 0)\n         xxx = min(a, min(in[bd[r - 1].id], in[bd[r].id] + x / (n - r + 1)));\n       else\n         xxx = min(a, in[bd[r].id] + x / (n - r + 1));\n     }\n   }\n   for (i = 1; i <= r1; i++) {\n     in[bd[i].id] = a;\n   }\n   for (i = r2; i <= n; i++) {\n     in[bd[i].id] = xxx;\n   }\n   cout << ans << endl;\n   for (i = 1; i <= n; i++) cout << in[i] << ' ';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     vector<long long int> a(n);\n     vector<long long int> b(n);\n     for (int i = 0; i < n; i++) {\n       cin >> a[i];\n     }\n     for (int i = 0; i < n; i++) {\n       cin >> b[i];\n     }\n     long long int cnt = 0;\n     long long int min_a = *min_element(a.begin(), a.end());\n     long long int min_b = *min_element(b.begin(), b.end());\n     for (int i = 0; i < n; i++) {\n       if (a[i] > min_a && b[i] > min_b) {\n         long long int num;\n         num = min(a[i] - min_a, b[i] - min_b);\n         cnt += num;\n         a[i] -= num;\n         b[i] -= num;\n       }\n     }\n     for (int i = 0; i < n; i++) {\n       cnt += (a[i] - min_a);\n       cnt += (b[i] - min_b);\n     }\n     cout << cnt << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename A, typename B>\n string to_string(pair<A, B> p);\n template <typename A, typename B, typename C>\n string to_string(tuple<A, B, C> p);\n template <typename A, typename B, typename C, typename D>\n string to_string(tuple<A, B, C, D> p);\n string to_string(const string& s) { return ''' + s + '''; }\n string to_string(const char* s) { return to_string((string)s); }\n string to_string(bool b) { return (b ? 'true' : 'false'); }\n string to_string(vector<bool> v) {\n   bool first = true;\n   string res = '{';\n   for (int i = 0; i < static_cast<int>(v.size()); i++) {\n     if (!first) {\n       res += ', ';\n     }\n     first = false;\n     res += to_string(v[i]);\n   }\n   res += '}';\n   return res;\n }\n template <size_t N>\n string to_string(bitset<N> v) {\n   string res = '';\n   for (size_t i = 0; i < N; i++) {\n     res += static_cast<char>('0' + v[i]);\n   }\n   return res;\n }\n template <typename A>\n string to_string(A v) {\n   bool first = true;\n   string res = '{';\n   for (const auto& x : v) {\n     if (!first) {\n       res += ', ';\n     }\n     first = false;\n     res += to_string(x);\n   }\n   res += '}';\n   return res;\n }\n template <typename A, typename B>\n string to_string(pair<A, B> p) {\n   return '(' + to_string(p.first) + ', ' + to_string(p.second) + ')';\n }\n template <typename A, typename B, typename C>\n string to_string(tuple<A, B, C> p) {\n   return '(' + to_string(get<0>(p)) + ', ' + to_string(get<1>(p)) + ', ' +\n          to_string(get<2>(p)) + ')';\n }\n template <typename A, typename B, typename C, typename D>\n string to_string(tuple<A, B, C, D> p) {\n   return '(' + to_string(get<0>(p)) + ', ' + to_string(get<1>(p)) + ', ' +\n          to_string(get<2>(p)) + ', ' + to_string(get<3>(p)) + ')';\n }\n void debug_out() { cerr << endl; }\n template <typename Head, typename... Tail>\n void debug_out(Head H, Tail... T) {\n   cerr << ' ' << to_string(H);\n   debug_out(T...);\n }\n class dsu {\n  public:\n   vector<int> p;\n   int n;\n   dsu(int _n) : n(_n) {\n     p.resize(n);\n     iota(p.begin(), p.end(), 0);\n   }\n   inline int get(int x) { return (x == p[x] ? x : (p[x] = get(p[x]))); }\n   inline bool unite(int x, int y) {\n     x = get(x);\n     y = get(y);\n     if (x != y) {\n       p[x] = y;\n       return true;\n     }\n     return false;\n   }\n };\n const int MAX = 100010;\n int bound[MAX];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int tt;\n   cin >> tt;\n   assert(1 <= tt && tt <= 1000);\n   int x = 0;\n   while (tt--) {\n     int n;\n     cin >> n;\n     if (n == 0) {\n       continue;\n     }\n     assert(n >= 1);\n     vector<int> v(n);\n     for (int i = 0; i < n; i++) {\n       cin >> v[i];\n     }\n     sort(v.begin(), v.end());\n     v.resize(unique(v.begin(), v.end()) - v.begin());\n     n = (int)v.size();\n     for (int i = 0; i < n - 1; i++) {\n       assert(v[i] < v[i + 1]);\n     }\n     assert(0 <= v[0]);\n     assert(v[n - 1] <= 100000);\n     {\n       int ptr = -1;\n       for (int val = 0; val < MAX; val++) {\n         if (ptr + 1 < n && v[ptr + 1] == val) {\n           ++ptr;\n         }\n         bound[val] = ptr;\n       }\n     }\n     vector<vector<int>> who(1, vector<int>(n, -1));\n     vector<dsu> d(1, dsu(n + 1));\n     vector<bool> seen;\n     for (int i = n - 1; i >= 0; i--) {\n       int start = 0;\n       int j = 0;\n       while (start < i) {\n         if (j == (int)who.size()) {\n           who.emplace_back(n, -1);\n           d.emplace_back(n + 1);\n         }\n         int finish = i - 1;\n         int tmp = who[j][i];\n         if (tmp != -1) {\n           int val = v[i] - (v[tmp] - v[i]);\n           finish = (val < 0 ? -1 : bound[val]);\n         }\n         if (start <= finish) {\n           int pos = d[j].get(start);\n           while (pos <= finish) {\n             who[j][pos] = i;\n             d[j].unite(pos, pos + 1);\n             pos = d[j].get(pos);\n           }\n           start = finish + 1;\n         }\n         ++j;\n       }\n       int g = 0;\n       while (g < (int)who.size() && who[g][i] != -1) {\n         ++g;\n       }\n       if (g >= (int)seen.size()) {\n         seen.resize(g + 1);\n       }\n       seen[g] = true;\n     }\n     int g = 0;\n     while (g < (int)seen.size() && seen[g]) {\n       ++g;\n     }\n     x ^= g;\n     42;\n   }\n   cout << (x > 0 ? 'YES' : 'NO') << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 5;\n long long n, num;\n long long a[maxn];\n long long vis[maxn];\n priority_queue<long long> pq;\n void fnd(long long x) {\n   if (vis[a[x]] == 0) {\n     vis[a[x]] = 1;\n     num++;\n     fnd(a[x]);\n   } else\n     return;\n }\n int main() {\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n   }\n   memset(vis, 0, sizeof(vis));\n   for (int i = 1; i <= n; i++) {\n     num = 1;\n     if (vis[i] == 0) {\n       vis[i] = 1;\n       fnd(i);\n       pq.push(num);\n     }\n   }\n   long long t = pq.top();\n   pq.pop();\n   if (!pq.size()) {\n     cout << t * t << endl;\n   } else {\n     t += pq.top();\n     pq.pop();\n     long long ans = t * t;\n     while (pq.size()) {\n       t = pq.top();\n       pq.pop();\n       ans += t * t;\n     }\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxN = 1e5 + 5;\n vector<int> adj[maxN];\n int s[maxN], par[maxN];\n void dfs(int n, int p) {\n   par[n] = p;\n   for (int i = int(0); i < int((int)adj[n].size()); i++) {\n     if (adj[n][i] != p) dfs(adj[n][i], n);\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(0), cin.tie(0), cin.tie(0), cout.tie(0),\n       cout.precision(15);\n   int n, tmp;\n   cin >> n;\n   for (int i = int(0); i < int(n - 1); i++) {\n     cin >> tmp;\n     tmp -= 1;\n     adj[tmp].push_back(i + 1);\n   }\n   dfs(0, -1);\n   for (int i = int(0); i < int(n); i++) {\n     cin >> s[i];\n   }\n   long long ans = s[0];\n   for (int i = int(0); i < int(n); i++) {\n     if (s[i] == -1) {\n       int n = i, tt = s[par[i]];\n       int mini = 2000000000;\n       for (int j = int(0); j < int((int)adj[n].size()); j++) {\n         if (s[adj[n][j]] < tt) {\n           cout << -1;\n           return 0;\n         }\n         mini = min(mini, s[adj[n][j]] - tt);\n       }\n       if (mini != 2000000000) ans += mini;\n       for (int j = int(0); j < int((int)adj[n].size()); j++) {\n         ans += s[adj[n][j]] - tt - mini;\n       }\n     }\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1000000001;\n const long double EPS = 1e-9;\n const int MOD = 1000000007;\n const long long LLINF = 1000000000000000001;\n const int maxn = 1042;\n int n;\n int a[maxn];\n char ans[maxn][maxn];\n bool good[maxn];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n     for (int j = 1; j <= n; j++) ans[i][j] = '.';\n   }\n   bool none = true;\n   for (int i = 1; i <= n; i++)\n     if (a[i] != i) none = false;\n   if (none)\n     cout << n << '\n';\n   else {\n     cout << n - 1 << '\n';\n     int mostleft = 1;\n     while (a[mostleft] == mostleft) {\n       good[mostleft] = true;\n       mostleft++;\n     }\n     int row = 1;\n     int z = mostleft;\n     good[z] = true;\n     z = a[z];\n     while (!good[z]) {\n       good[z] = true;\n       char mirror = (z < a[z]) ? '/' : '\\';\n       ans[row][z] = mirror;\n       ans[row][a[z]] = mirror;\n       row++;\n       z = a[z];\n     }\n     good[z] = true;\n     for (int i = mostleft + 1; i <= n; i++) {\n       if (a[i] != i && !good[i]) {\n         int firstrow = row;\n         z = i;\n         while (a[z] > z) z = a[z];\n         z = a[z];\n         good[z] = true;\n         row++;\n         z = a[z];\n         while (!good[z]) {\n           good[z] = true;\n           char mirror = (z < a[z]) ? '/' : '\\';\n           ans[row][z] = mirror;\n           ans[row][a[z]] = mirror;\n           row++;\n           z = a[z];\n         }\n         ans[row - 1][mostleft] = '\\';\n         ans[firstrow][mostleft] = '/';\n         ans[firstrow][a[z]] = '/';\n       }\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= n; j++) cout << ans[i][j];\n     cout << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int h[n];\n   for (int i = 0; i < n; i++) cin >> h[i];\n   int max;\n   int a[n];\n   a[n - 1] = 0;\n   max = h[n - 1];\n   for (int i = n - 2; i >= 0; i--) {\n     if (h[i] > max) {\n       a[i] = 0;\n       max = h[i];\n     } else {\n       a[i] = max - h[i] + 1;\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     printf('%d ', a[i]);\n   }\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int read() {\n   int x = 0, f = 1;\n   char c;\n   do c = getchar(), f = c == '-' ? -1 : f;\n   while (!isdigit(c));\n   do x = (x << 3) + (x << 1) + c - '0', c = getchar();\n   while (isdigit(c));\n   return x * f;\n }\n struct Point {\n   int x, y, px, py, id;\n   Point() {}\n   Point(int x, int y, int px, int py) : x(x), y(y), px(px), py(py) {}\n } a[55], ans[100020];\n bool tab[55];\n int b[55][55], d[55][55];\n int n, m, cnt, tmp = 1, num;\n inline void Move(Point &a, int x, int y) {\n   assert(!b[a.x + x][a.y + y]);\n   b[a.x + x][a.y + y] = b[a.x][a.y];\n   b[a.x][a.y] = 0;\n   ans[++cnt] = Point(a.x, a.y, a.x + x, a.y + y);\n   a.x += x;\n   a.y += y;\n }\n inline void Move_to(Point &a, int pos) {\n   Move(a, 1, 0);\n   while (a.y < pos) Move(a, 0, 1);\n   while (a.y > pos) Move(a, 0, -1);\n   Move(a, -1, 0);\n }\n inline void Swap(Point &a, Point &b) {\n   if (a.id == b.id) return;\n   if (n == 2) {\n     if (a.y < b.y)\n       Move(a, 1, 0), Move(b, 0, -1), Move(a, 0, 1), Move(a, -1, 0);\n     else\n       Move(a, 1, 0), Move(b, 0, 1), Move(a, 0, -1), Move(a, -1, 0);\n     return;\n   }\n   Move(a, 1, 0);\n   Move(b, 1, 0);\n   Move(b, 1, 0);\n   int t = a.y;\n   while (a.y > b.y) Move(a, 0, -1);\n   while (a.y < b.y) Move(a, 0, 1);\n   while (b.y > t) Move(b, 0, -1);\n   while (b.y < t) Move(b, 0, 1);\n   Move(a, -1, 0);\n   Move(b, -1, 0);\n   Move(b, -1, 0);\n }\n inline void Move1(Point &a, int x) {\n   while (a.x <= tmp) Move(a, 1, 0);\n   while (a.y > x) Move(a, 0, -1);\n   while (a.y < x) Move(a, 0, 1);\n   while (!b[a.x - 1][a.y]) Move(a, -1, 0);\n   tmp = max(tmp, a.x);\n }\n inline void Move2(Point &a, int y) {\n   while (a.x < y) Move(a, 1, 0);\n }\n int main() {\n   n = read();\n   m = read();\n   if (n == 1) return printf('0'), 0;\n   assert(m <= n);\n   for (int i = 1; i <= m; i++) {\n     a[i].x = read();\n     a[i].y = read();\n     a[i].id = b[a[i].x][a[i].y] = i;\n   }\n   for (int i = 1; i <= m; i++) {\n     a[i].px = read();\n     a[i].py = read();\n     d[a[i].px][a[i].py] = i;\n   }\n   for (int i = 0; i <= n + 1; i++)\n     b[i][0] = b[0][i] = b[n + 1][i] = b[i][n + 1] = 2147483647;\n   for (int i = 1; i <= n; i++)\n     for (int j = n; j >= 1; j--) {\n       if (!b[i][j]) continue;\n       int t = b[i][j];\n       while (!b[i][a[t].y + 1]) Move(a[t], 0, 1);\n     }\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= n; j++) {\n       if (!b[i][j]) continue;\n       num++;\n       int t = b[i][j];\n       assert(a[t].y >= num);\n       while (a[t].y > num) Move(a[t], 0, -1);\n       while (a[t].x > 1) Move(a[t], -1, 0);\n     }\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= n; j++)\n       if (d[i][j] && !tab[j]) {\n         tab[j] = true;\n         if (b[1][j])\n           Swap(a[b[1][j]], a[d[i][j]]);\n         else\n           Move_to(a[d[i][j]], j);\n       }\n   for (int j = 1; j <= n; j++)\n     for (int i = 1; i <= n; i++)\n       if (d[i][j]) Move1(a[d[i][j]], j);\n   for (int i = n; i >= 1; i--)\n     for (int j = n; j >= 1; j--)\n       if (d[i][j]) Move2(a[d[i][j]], i);\n   printf('%d\n', cnt);\n   for (int i = 1; i <= cnt; i++)\n     printf('%d %d %d %d\n', ans[i].x, ans[i].y, ans[i].px, ans[i].py);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 50 + 5, maxL = (1 << 20) + 10;\n int N, L;\n char s[maxn][25];\n bool vis[maxL];\n long double F[maxL], R[25];\n long long dask[maxL];\n bool check(int tt, int k) {\n   if (dask[tt] & (1LL << k))\n     return false;\n   else\n     return true;\n }\n long double dfs(int tt, int g) {\n   if (g == 0) return 0.0;\n   if (vis[tt]) return F[tt];\n   long double ret = 0.0;\n   long double step = L - g + 1;\n   for (int i = 0; i < L; i++) {\n     if ((1 << i) & tt) continue;\n     int nt = (1 << i) | tt;\n     int wq = __builtin_popcountll(dask[nt] ^ dask[tt]);\n     ret += step * R[g] * wq;\n     ret += dfs(nt, g - 1);\n   }\n   vis[tt] = true;\n   F[tt] = ret;\n   return ret;\n }\n void Prepare() {\n   memset(dask, 0, sizeof(dask));\n   for (int i = (1), _i = (N); i <= _i; i++)\n     for (int j = (i + 1), _j = (N); j <= _j; j++) {\n       int same = 0;\n       for (int k = 0; k < L; k++)\n         if (s[i][k] == s[j][k]) same |= (1 << k);\n       dask[same] |= (1LL << j) | (1LL << i);\n     }\n   for (int i = (1 << L) - 1; i; i--)\n     for (int k = 0; k < L; k++)\n       if (i & (1 << k)) dask[i ^ (1 << k)] |= dask[i];\n }\n int main() {\n   for (; scanf('%d', &N) != EOF;) {\n     for (int i = (1), _i = (N); i <= _i; i++) scanf('%s', s[i]);\n     L = strlen(s[1]);\n     int gg = L;\n     R[L] = 1.0 / (long double)L;\n     for (int i = (L - 1), _i = (1); i >= _i; i--) {\n       gg--;\n       R[i] = R[i + 1] / (long double)gg;\n     }\n     memset(vis, 0, sizeof(vis));\n     long double ans = 0.0;\n     Prepare();\n     ans = dfs(0, L);\n     ans /= (long double)N;\n     printf('%.15lf\n', (double)ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int tot, n;\n int vis[110];\n int p[110];\n int dp[2][262144], cs[110][262144], pre[110][262144];\n int have[100];\n int a[110], b[110];\n string print(int sta) {\n   string x = '';\n   for (int i = tot - 1; i >= 0; i--) {\n     if (sta & (1 << i))\n       x += '1';\n     else\n       x += '0';\n   }\n   return x;\n }\n int main() {\n   for (int i = 2; i <= 59; i++) {\n     if (!vis[i]) p[tot++] = i;\n     for (int j = i; j <= 59; j += i) vis[j] = 1;\n   }\n   for (int i = 1; i <= 59; i++) {\n     for (int j = 0; j < tot; j++) {\n       if (i % p[j] == 0) have[i] |= (1 << j);\n     }\n   }\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n   }\n   memset(dp, 0x3f, sizeof(dp));\n   dp[0][0] = 0;\n   register int tmp;\n   register int nowt = 1, pret = 0;\n   for (int i = 1; i <= n; i++) {\n     for (int sta = 0; sta < (1 << tot); sta++) {\n       dp[nowt][sta] = 0x3f3f3f3f;\n       for (int j = 1; j <= 59; j++) {\n         if ((have[j] & sta) != have[j]) continue;\n         tmp = dp[pret][have[j] ^ sta] + abs(j - a[i]);\n         if (tmp < dp[nowt][sta]) {\n           dp[nowt][sta] = tmp;\n           pre[i][sta] = have[j] ^ sta;\n           cs[i][sta] = j;\n         }\n       }\n     }\n     nowt ^= 1;\n     pret ^= 1;\n   }\n   int mi = 0x3f3f3f3f;\n   for (int i = 0; i < (1 << tot); i++) {\n     mi = min(mi, dp[pret][i]);\n   }\n   int pp;\n   for (int i = 0; i < (1 << tot); i++) {\n     if (mi == dp[pret][i]) {\n       pp = i;\n       for (int now = n; now >= 1; now--) {\n         b[now] = cs[now][pp];\n         pp = pre[now][pp];\n       }\n       for (int now = 1; now <= n; now++) {\n         printf('%d ', b[now]);\n       }\n       puts('');\n       return 0;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, a, b;\n   cin >> n >> a >> b;\n   int c[100];\n   for (int i = 0; i < n; i++) cin >> c[i];\n   int ans = 0;\n   int min = a > b ? b : a;\n   for (int i = 0; i < n / 2; i++) {\n     if (c[i] == 0 && c[n - 1 - i] == 2 || c[i] == 2 && c[n - 1 - i] == 0)\n       ans += a;\n     else if (c[i] == 1 && c[n - 1 - i] == 2 || c[i] == 2 && c[n - 1 - i] == 1)\n       ans += b;\n     else if (c[i] == 2 && c[n - 1 - i] == 2)\n       ans += min * 2;\n     else if (c[i] == 0 && c[n - 1 - i] == 1 || c[i] == 1 && c[n - 1 - i] == 0) {\n       cout << -1 << endl;\n       return 0;\n     }\n   }\n   if (n % 2 == 1 && c[n / 2] == 2) ans += min;\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void read(long long a = 0) {\n   freopen('in', 'r', stdin);\n   if (a) freopen('out', 'w', stdout);\n }\n long long a[100009 * 10], b[100009 * 10];\n long long n, m;\n bool bs(long long num) {\n   bool vis[100009 * 10] = {};\n   long long space = 0;\n   for (int i = num; i >= 0; i--) {\n     if (a[i] && !vis[a[i]]) {\n       vis[a[i]] = 1;\n       space += b[a[i] - 1];\n     } else {\n       space--;\n       space = max(space, 0ll);\n     }\n   }\n   for (int i = 1; i <= m; i++)\n     if (!vis[i]) return 0;\n   if (space == 0)\n     return 1;\n   else\n     return 0;\n }\n int main() {\n   ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n   cin >> n >> m;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   for (int i = 0; i < m; i++) cin >> b[i];\n   long long lo = 0, hi = n + 1;\n   while (lo < hi) {\n     long long mid = (lo + hi - 1) >> 1;\n     if (bs(mid))\n       hi = mid;\n     else\n       lo = mid + 1;\n   }\n   if (hi == n + 1)\n     cout << '-1';\n   else\n     cout << hi + 1;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1e9 + 9;\n const int N = 4040;\n int n, w, b;\n long long fac[N], f[N][N], inv[N];\n long long qpow(long long x, long long p) {\n   long long res = 1ll;\n   while (p) {\n     if (p & 1) {\n       res = (res * x) % mod;\n     }\n     x = (x * x) % mod;\n     p >>= 1;\n   }\n   return res;\n }\n long long INV(long long k) { return qpow(k, mod - 2); }\n long long calc(int x, int y) {\n   return fac[x] * inv[y] % mod * inv[x - y] % mod;\n }\n void init() {\n   fac[0] = 1ll;\n   inv[0] = 1ll;\n   for (int i = 1; i < N; i++) {\n     fac[i] = (fac[i - 1] * 1ll * i) % mod;\n     inv[i] = INV(fac[i]);\n   }\n }\n int main() {\n   scanf('%d%d%d', &n, &w, &b);\n   init();\n   for (int i = 1; i <= n; i++) {\n     for (int j = i; j < N; j++) {\n       f[i][j] = (fac[j] * calc(j - 1, i - 1)) % mod;\n     }\n   }\n   long long ans = 0;\n   for (int i = 1; i < n - 1; i++) {\n     ans =\n         (ans + f[n - i][w] * f[i][b] % mod * (1ll * n - 1ll * i - 1ll) % mod) %\n         mod;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long f(string s, long long m) {\n   map<char, long long> a;\n   map<char, long long>::iterator ii;\n   long long i;\n   for (i = 0; i < s.size(); i++) {\n     a[s[i]]++;\n   }\n   long long best = 0;\n   for (ii = a.begin(); ii != a.end(); ii++) best = max(best, ii->second);\n   long long p = s.size();\n   if (best == p && m == 1) return p - 1;\n   return min(p, best + m);\n }\n int main() {\n   string s1, s2, s3;\n   long long n;\n   cin >> n;\n   cin >> s1 >> s2 >> s3;\n   if (f(s1, n) > f(s2, n) && f(s1, n) > f(s3, n)) {\n     cout << 'Kuro';\n     return 0;\n   }\n   if (f(s2, n) > f(s1, n) && f(s2, n) > f(s3, n)) {\n     cout << 'Shiro';\n     return 0;\n   }\n   if (f(s3, n) > f(s1, n) && f(s3, n) > f(s2, n)) {\n     cout << 'Katie';\n     return 0;\n   }\n   cout << 'Draw';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n template <class T>\n void rd(T &x) {\n   x = 0;\n   int f = 1;\n   char c;\n   while (!isdigit(c = getchar()))\n     if (c == '-') f = -1;\n   do {\n     x = (x << 3) + (x << 1) + (c ^ 48);\n   } while (isdigit(c = getchar()));\n   x *= f;\n }\n using namespace std;\n const int N = 1e5 + 5;\n int n, dp[N], s[N], p[N], cnt, tp;\n map<int, int> Map[N];\n int main() {\n   rd(n);\n   for (int i = 1; i <= n; i++) {\n     int v, c, l, r;\n     rd(v), rd(c), rd(l), rd(r);\n     if (r + c <= 1e5 && (!l || Map[l].find(r + c) != Map[l].end())) {\n       int t = Map[l][r + c];\n       dp[i] = dp[t] + v;\n       p[i] = t;\n       if (!r && dp[i] > dp[tp]) tp = i;\n       if (dp[i] > dp[Map[l + c][r]]) Map[l + c][r] = i;\n     }\n   }\n   while (tp) s[++cnt] = tp, tp = p[tp];\n   printf('%d\n', cnt);\n   for (; cnt > 0; cnt--) printf('%d ', s[cnt]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, v1, v2, L;\n bool can(double m) {\n   double bus = 0, nbus = 0;\n   for (int i = 0; i < (n + k - 1) / k; i++) {\n     if (i == 0)\n       bus += m * v2;\n     else\n       bus += m * v1;\n     nbus += m * v1;\n     if (bus > L) return false;\n     double sb = (bus - nbus) / (v1 + v2);\n     bus += sb * v1;\n     nbus += sb * v1;\n   }\n   return true;\n }\n int main() {\n   scanf('%d%d%d%d%d', &n, &L, &v1, &v2, &k);\n   double l = 0, r = (double)L / v2, m;\n   for (int i = 0; i < 100; i++) {\n     m = (l + r) / 2.0;\n     if (can(m))\n       l = m;\n     else\n       r = m;\n   }\n   printf('%.12f', m + (L - m * v2) / v1);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long Calc(const int &x) {\n   long long res = 0;\n   for (long long i = 1; i <= x; i *= 10) res += x - i + 1;\n   return res;\n }\n inline long long CalcSum(const int &x) {\n   long long res = 0;\n   for (long long i = 1; i <= x; i *= 10)\n     res += 1ll * (x - i + 1) * (x - i + 2) / 2;\n   return res;\n }\n inline int Pos(const int &x, const int &k) {\n   stringstream ss;\n   ss << x;\n   string s;\n   ss >> s;\n   return s[k - 1] - '0';\n }\n inline int Solve(long long k) {\n   int l = 1, r = 1000000000;\n   while (l <= r) {\n     int mid = (l + r) / 2;\n     if (CalcSum(mid) >= k)\n       r = mid - 1;\n     else\n       l = mid + 1;\n   }\n   k = k - CalcSum(r);\n   int block = l;\n   l = 1;\n   r = block;\n   while (l <= r) {\n     int mid = (l + r) / 2;\n     if (Calc(mid) >= k)\n       r = mid - 1;\n     else\n       l = mid + 1;\n   }\n   return Pos(l, k - Calc(r));\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int q;\n   cin >> q;\n   while (q--) {\n     long long k;\n     cin >> k;\n     cout << Solve(k) << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int INF = 1e9;\n using namespace std;\n void dfs(int v, int p, vector<vector<int> > &graph, vector<int> &sz) {\n   sz[v] = 1;\n   for (auto u : graph[v])\n     if (u != p) {\n       dfs(u, v, graph, sz);\n       sz[v] += sz[u];\n     }\n }\n void dfs(int v, int p, vector<vector<int> > &graph, vector<int> &c, int C) {\n   c[v] = C;\n   for (auto u : graph[v])\n     if (u != p) {\n       dfs(u, v, graph, c, C);\n     }\n }\n signed main() {\n   int n;\n   cin >> n;\n   vector<vector<int> > graph(n);\n   for (int i = 0; i < n - 1; i++) {\n     int a, b;\n     cin >> a >> b;\n     a--, b--;\n     graph[a].push_back(b);\n     graph[b].push_back(a);\n   }\n   vector<int> sz(n);\n   dfs(0, 0, graph, sz);\n   vector<int> cen;\n   long long ans = 0;\n   for (int i = 0; i < n; i++) {\n     if ((n - sz[i]) * 2 <= n) {\n       int t = 1;\n       for (auto u : graph[i]) {\n         if (sz[u] < sz[i]) {\n           if (2 * sz[u] <= n) continue;\n           t = 0;\n         }\n       }\n       if (t) cen.push_back(i);\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     ans += 2 * min(sz[i], n - sz[i]);\n   }\n   cout << ans << '\n';\n   if (cen.size() == 2) {\n     int v = cen[0], u = cen[1];\n     vector<int> c(n);\n     dfs(v, u, graph, c, 0);\n     dfs(u, v, graph, c, 1);\n     vector<int> p0, p1;\n     for (int i = 0; i < n; i++) {\n       if (c[i] == 0) p0.push_back(i);\n       if (c[i] == 1) p1.push_back(i);\n     }\n     vector<int> ans(n);\n     for (int i = 0; i < n / 2; i++) {\n       ans[p0[i]] = p1[i];\n       ans[p1[i]] = p0[i];\n     }\n     for (int i = 0; i < n; i++) {\n       cout << ans[i] + 1 << ' ';\n     }\n     return 0;\n   } else {\n     dfs(cen[0], cen[0], graph, sz);\n     int C = 0, idC = 0;\n     vector<int> c(n);\n     c[cen[0]] = -1;\n     int maxsz = 0;\n     for (auto u : graph[cen[0]]) {\n       dfs(u, cen[0], graph, c, C);\n       maxsz = max(maxsz, sz[u]);\n       if (maxsz == sz[u]) idC = C;\n       C++;\n     }\n     vector<pair<int, int> > q;\n     for (int i = 0; i < n; i++) {\n       if (i != cen[0] && c[i] != idC) q.push_back({c[i], i});\n     }\n     for (int i = 0; i < n; i++) {\n       if (i != cen[0] && c[i] == idC) q.push_back({INF, i});\n     }\n     q.push_back({INF + 1, cen[0]});\n     sort((q).begin(), (q).end());\n     vector<int> ans(n);\n     for (int i = 0; i < n; i++) {\n       ans[q[i].second] = q[(i + maxsz) % q.size()].second;\n     }\n     for (int i = 0; i < n; i++) {\n       assert(c[ans[i]] != c[i]);\n       cout << ans[i] + 1 << ' ';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 1e5;\n int n;\n double a[MAXN], b[4], t;\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   cin >> n;\n   b[3] = 1;\n   for (int i = 1; i <= n; i++) {\n     cin >> t;\n     b[0] += t;\n     b[1]++;\n     if (b[1] * b[2] <= b[0] * b[3]) b[2] = b[0], b[3] = b[1];\n   }\n   cout << fixed << setprecision(10) << b[2] / b[3] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 0x0f0f0f0f;\n template <class S, class T>\n inline pair<S, T> MP(S a, T b) {\n   return make_pair(a, b);\n }\n template <class T>\n inline auto LX(T &X) -> decltype((X.first)) {\n   return X.first;\n }\n template <class T>\n inline auto LX(const T &X) -> const decltype((X.first)) {\n   return X.first;\n }\n template <class T>\n inline auto RX(T &X) -> decltype((X.second)) {\n   return X.second;\n }\n template <class T>\n inline auto RX(const T &X) -> const decltype((X.second)) {\n   return X.second;\n }\n template <class T>\n inline void RST(T &a) {\n   memset(a, 0, sizeof(a));\n }\n template <class T>\n inline void RST1(T &a) {\n   memset(a, -1, sizeof(a));\n }\n template <class T>\n inline void SINF(T &a) {\n   memset(a, 0x0f, sizeof(a));\n }\n template <class S, class T>\n inline void RST(S &a, T b) {\n   fill((T *)a, (T *)a + (sizeof(a) / sizeof(b)), b);\n }\n template <class T>\n inline void CLR(T &a) {\n   a.clear();\n }\n template <class S, class T>\n inline void CPY(S &a, T &b) {\n   memcpy(a, b, sizeof(a));\n }\n template <class S, class T>\n inline bool chkmin(S &a, T b) {\n   return b < a ? a = b, 1 : 0;\n }\n template <class S, class T>\n inline bool chkmax(S &a, T b) {\n   return a < b ? a = b, 1 : 0;\n }\n template <class T>\n inline T sqr(T x) {\n   return x * x;\n }\n template <class T>\n inline int SZ(T &a) {\n   return (int)(a.size());\n }\n template <class T>\n inline bool EPT(T &a) {\n   return a.empty();\n }\n template <class T>\n inline auto FRT(T &a) -> decltype((a.front())) {\n   return a.front();\n }\n template <class T>\n inline auto FRT(const T &a) -> const decltype((a.front())) {\n   return a.front();\n }\n template <class T>\n inline auto BK(T &a) -> decltype(a.back()) & {\n   return a.back();\n }\n template <class T>\n inline auto BK(const T &a) -> const decltype((a.back())) {\n   return a.back();\n }\n template <class T>\n inline auto TOP(T &a) -> decltype((a.top())) {\n   return a.top();\n }\n template <class T>\n inline auto TOP(const T &a) -> const decltype((a.top())) {\n   return a.top();\n }\n int n, m, f[1010], g[1010], cnt;\n char buf[1010];\n double ans;\n void solve(int *c, int n, int m) {\n   int s = 0;\n   for (int i = 1; i <= n; i++)\n     if (c[i]) {\n       s += c[i] - 1, ans += (double)s * (m - c[i]);\n       if (!c[i + 1] || c[i + 1] < c[i]) s = 0;\n     }\n   s = 0;\n   for (int i = 1; i <= n; i++)\n     if (c[i]) {\n       ans += (double)s * (c[i] - 1);\n       s += m - c[i];\n       if (!c[i + 1] || c[i + 1] > c[i]) s = 0;\n     }\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; i++) {\n     scanf('%s', buf + 1);\n     for (int j = 1; j <= m; j++)\n       if (buf[j] == 'X') f[i] = j, g[j] = i, cnt++;\n   }\n   solve(f, n, m);\n   solve(g, m, n);\n   ans *= 2;\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= i; j++)\n       ans += 1. * (m - (f[i] ? 1 : 0)) * (m - (f[j] ? 1 : 0)) * (i - j);\n   for (int i = 1; i <= m; i++)\n     for (int j = 1; j <= i; j++)\n       ans += 1. * (n - (g[i] ? 1 : 0)) * (n - (g[j] ? 1 : 0)) * (i - j);\n   ans *= 2;\n   ans /= sqr((double)n * m - cnt);\n   printf('%.10lf\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int arr[101][1001];\n int n, m;\n int g[101][101];\n vector<int> col[1001];\n set<int> row[101];\n bool ans[101][101];\n int main() {\n   scanf('%d', &n), scanf('%d', &m);\n   for (int i = 0; i < m; ++i) {\n     int x, y;\n     scanf('%d', &x), scanf('%d', &y);\n     g[x][y] = g[y][x] = 1;\n   }\n   for (int i = 1; i <= n; ++i) g[i][i] = true;\n   for (int i = 1; i <= n; ++i) {\n     for (int j = i + 1; j <= n; ++j) {\n       if (g[i][j] && !ans[i][j]) {\n         for (int k = 0; k < 1001; ++k)\n           if (col[k].size() == 0) {\n             arr[i][k] = i;\n             arr[j][k] = j;\n             col[k].push_back(i), col[k].push_back(j);\n             break;\n           } else {\n             bool ok = true;\n             for (int l = 0; l < col[k].size(); ++l) {\n               int cur = col[k][l];\n               if (!g[cur][i] || !g[cur][j]) {\n                 ok = false;\n                 break;\n               }\n             }\n             if (ok) {\n               arr[i][k] = i;\n               arr[j][k] = j;\n               for (int l = 0; l < col[k].size(); ++l) {\n                 int cur = col[k][l];\n                 ans[cur][i] = ans[i][cur] = ans[j][cur] = ans[cur][j] = true;\n               }\n               col[k].push_back(i), col[k].push_back(j);\n               break;\n             }\n           }\n         ans[i][j] = true;\n         ans[j][i] = true;\n       }\n     }\n   }\n   for (int i = 0; i < 1001; ++i)\n     for (int j = 0; j < col[i].size(); ++j) row[col[i][j]].insert(i);\n   for (int i = 1; i < 101; ++i)\n     if (row[i].size() == 0) {\n       for (int j = 0; j < 1001; ++j)\n         if (col[j].size() == 0) {\n           col[j].push_back(i);\n           row[i].insert(j);\n           break;\n         }\n     }\n   for (int i = 1; i <= n; ++i) {\n     printf('%d\n', row[i].size());\n     for (set<int>::iterator it = row[i].begin(); it != row[i].end(); ++it)\n       printf('%d %d\n', i, (*it) + 1);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, p1, p2;\n   cin >> n;\n   cin >> p1;\n   int a1[p1];\n   for (int i = 0; i < p1; i++) cin >> a1[i];\n   cin >> p2;\n   int a2[p2];\n   for (int i = 0; i < p2; i++) cin >> a2[i];\n   sort(a1, a1 + p1);\n   sort(a2, a2 + p2);\n   vector<int>::iterator it;\n   vector<int> res(100);\n   it = set_union(a1, a1 + p1, a2, a2 + p2, res.begin());\n   res.resize(it - res.begin());\n   if (res.size() == n)\n     cout << 'I become the guy.';\n   else\n     cout << 'Oh, my keyboard!';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int v[5], p[5];\n int cnt[5], add[5];\n int getMaxScr(int acc, int tot) {\n   int MaxScr;\n   for (int i = 0; i < 6; i++) {\n     int t = 1 << i;\n     if (tot >= t * acc) MaxScr = (i + 1) * 500;\n   }\n   return MaxScr;\n }\n bool ok(int m) {\n   int vScr = 0, pScr = 0;\n   for (int i = 0; i < 5; i++) {\n     int MaxScr = getMaxScr(cnt[i] + m * add[i], n + m);\n     if (v[i] != -1) vScr += MaxScr / 250 * (250 - v[i]);\n     if (p[i] != -1) pScr += MaxScr / 250 * (250 - p[i]);\n   }\n   return vScr > pScr;\n }\n int main() {\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < 5; j++) {\n       int t;\n       cin >> t;\n       if (i == 0) v[j] = t;\n       if (i == 1) p[j] = t;\n       if (t != -1) cnt[j]++;\n     }\n   }\n   for (int i = 0; i < 5; i++)\n     if (v[i] != -1 && p[i] != -1 && p[i] < v[i]) add[i] = 1;\n   int ans = 0;\n   while (!ok(ans) && ans < 100000) ans++;\n   cout << (ans == 100000 ? -1 : ans) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long big = 1000000007;\n unsigned long long gcd(unsigned long long a, unsigned long long b) {\n   if (a == 0) return b;\n   return gcd(b % a, a);\n }\n string getbin(unsigned long long x) {\n   if (x == 0) return '0';\n   string ret = '';\n   while (x != 0) {\n     ret = (char)('0' + x % 2) + ret;\n     x /= 2;\n   }\n   return ret;\n }\n unsigned long long getdec(string b) {\n   unsigned long long ret = 0;\n   for (int i = 0; i < b.size(); i += 1) {\n     ret *= 2;\n     ret += b[i] - '0';\n   }\n   return ret;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     long long n;\n     cin >> n;\n     long long s = 0;\n     vector<int> a(n);\n     for (int i = 0; i < n; i += 1) cin >> a[i], s += a[i];\n     bool b = false;\n     for (int i = 0; !b && i < n; i += 1) {\n       if (a[i] > s / 2) b = true;\n     }\n     if (b)\n       cout << 'T';\n     else if (s % 2 == 0)\n       cout << 'HL';\n     else\n       cout << 'T';\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int d[10];\n   d[0] = 1;\n   d[1] = 5;\n   d[2] = 10;\n   d[3] = 25;\n   d[4] = 50;\n   d[5] = 100;\n   d[6] = 500;\n   d[7] = 1000;\n   d[8] = 5000;\n   d[9] = 10000;\n   int a[1000009];\n   a[0] = 1;\n   for (int j = 0; j < 10; j++) {\n     for (int i = 1; i <= 1000000; i++) {\n       if (i - d[j] >= 0) {\n         a[i] += a[i - d[j]];\n       }\n       if (a[i] == n) {\n         printf('%d %d\n', i, j + 1);\n         for (int k = 0; k <= j; k++) {\n           printf('%d ', d[k]);\n         }\n         return 0;\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long read() {\n   long long x = 0, f = 0;\n   char ch = getchar();\n   for (; ch < '0' || ch > '9'; ch = getchar()) f ^= (ch == '-');\n   for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';\n   return f ? -x : x;\n }\n const long long maxn = 200050;\n long long n, head[maxn], cnt = 0, siz[maxn], dep[maxn];\n long long ans = 0, qwq = 0;\n struct node {\n   long long to, nxt;\n } e[maxn * 2];\n inline void add(long long u, long long v) {\n   e[++cnt].to = v;\n   e[cnt].nxt = head[u];\n   head[u] = cnt;\n }\n void dfs(long long u, long long f, long long d) {\n   siz[u] = 1;\n   dep[u] = d;\n   for (long long i = head[u]; i; i = e[i].nxt) {\n     long long v = e[i].to;\n     if (v == f) continue;\n     dfs(v, u, d + 1);\n     siz[u] += siz[v];\n   }\n }\n signed main() {\n   n = read();\n   for (long long i = 1, a, b; i < n; ++i) {\n     a = read();\n     b = read();\n     add(a, b);\n     add(b, a);\n   }\n   dfs(1, 0, 0);\n   for (long long i = 1; i <= n; ++i) {\n     ans += siz[i] * (n - siz[i]);\n     if (dep[i] & 1) ++qwq;\n   }\n   ans += qwq * (n - qwq);\n   printf('%lld\n', ans / 2);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 5;\n long double p[N], k[N];\n int par[N];\n vector<int> v[N];\n bool vstd[N];\n void dfs(int node) {\n   if (vstd[node]) return;\n   vstd[node] = true;\n   for (auto u : v[node]) {\n     if (u != par[node]) {\n       k[node] += p[u];\n       par[u] = node;\n       dfs(u);\n     }\n   }\n   return;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cout << fixed << setprecision(6);\n   int n;\n   cin >> n;\n   long double tmp = 0.0;\n   for (int i = 0; i < n; i++) {\n     cin >> p[i];\n     p[i] = 1.0 - p[i];\n     tmp += p[i];\n   }\n   for (int i = 1; i < n; i++) {\n     int a, b;\n     cin >> a >> b;\n     v[a].push_back(b);\n     v[b].push_back(a);\n   }\n   long double pmt = 0.0;\n   dfs(0);\n   for (int i = 0; i < n; i++) pmt += k[i] * p[i];\n   int q;\n   cin >> q;\n   while (q--) {\n     int node;\n     cin >> node;\n     tmp -= p[node];\n     pmt -= k[node] * p[node];\n     if (node) {\n       pmt -= k[par[node]] * p[par[node]];\n       k[par[node]] -= p[node];\n     }\n     cin >> p[node];\n     p[node] = 1.0 - p[node];\n     tmp += p[node];\n     if (node) k[par[node]] += p[node];\n     pmt += k[node] * p[node];\n     if (node) pmt += k[par[node]] * p[par[node]];\n     cout << tmp - pmt << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   char next;\n   long long int neg = 0, pos = 0;\n   cin >> next;\n   bool estado = false;\n   string orden = '';\n   while (next != '=') {\n     if (next == ' ') {\n       cin >> next;\n     }\n     if (next == '-') {\n       estado = true;\n       cin >> next;\n     }\n     if (next == '+') {\n       estado = false;\n       cin >> next;\n     }\n     if (next == '?') {\n       if (estado) {\n         orden += '-';\n         neg++;\n       } else {\n         orden += '+';\n         pos++;\n       }\n     }\n     cin >> next;\n   }\n   long long int num;\n   cin >> num;\n   long long int coefs[neg + pos];\n   if ((neg > ((pos - 1) * num)) || ((pos - neg * num) > num)) {\n     cout << 'Impossible';\n     return 0;\n   }\n   long long int valpos = 0, valneg = 0;\n   cout << 'Possible' << endl;\n   if (neg == 0) {\n     long long int cv = trunc(num / pos);\n     long long int sum = 0;\n     for (int i = 0; i < pos; i++) {\n       coefs[i] = cv;\n     }\n     sum = cv * pos - num;\n     if (sum != 0) {\n       for (int i = 0; i < pos; i++) {\n         coefs[i]++;\n         sum++;\n         if (sum == 0) break;\n       }\n     }\n     cout << coefs[0];\n     for (int i = 1; i < pos; i++) {\n       cout << ' + ' << coefs[i];\n     }\n     cout << ' = ' << num;\n     return 0;\n   }\n   if (pos - 1 > neg) {\n     valpos = 1;\n     valneg = trunc((pos - 1) / neg);\n   } else {\n     valneg = 1;\n     valpos = trunc(neg / (pos - 1));\n   }\n   int ref;\n   for (int i = 0; i < orden.size(); i++) {\n     if (orden[i] == '-') {\n       coefs[i] = -valneg;\n     } else\n       coefs[i] = valpos;\n   }\n   coefs[0] = num;\n   long long int suma = 0;\n   for (int i = 0; i < neg + pos; i++) {\n     suma += coefs[i];\n   }\n   suma -= num;\n   if (suma < 0) {\n     for (int i = 1; i < neg + pos; i++) {\n       if (coefs[i] > 0 && (abs(coefs[i]) < num)) {\n         coefs[i]++;\n         suma++;\n       }\n       if (suma == 0) break;\n     }\n   }\n   if (suma > 0) {\n     for (int i = 1; i < neg + pos; i++) {\n       if (coefs[i] < 0 && (abs(coefs[i]) < num)) {\n         coefs[i]--;\n         suma--;\n       }\n       if (suma == 0) break;\n     }\n   }\n   for (int i = 1; i < neg + pos; i++) {\n     if (abs(coefs[i]) > num) {\n       if (coefs[i] < 0) {\n         suma += -num - coefs[i];\n         coefs[i] = -num;\n       } else {\n         suma += num - coefs[i];\n         coefs[i] = num;\n       }\n     }\n   }\n   if (suma > 0) {\n     coefs[0] -= suma;\n     suma -= suma;\n   }\n   if (suma < 0) {\n     coefs[0] += suma;\n     suma -= suma;\n   }\n   cout << coefs[0];\n   for (int i = 1; i < pos + neg; i++) {\n     if (coefs[i] < 0)\n       cout << ' - ' << abs(coefs[i]);\n     else\n       cout << ' + ' << coefs[i];\n   }\n   cout << ' = ' << suma + num;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   if (n == 1) {\n     cout << -1;\n   } else\n     cout << n << ' ' << n + 1 << ' ' << n * (n + 1);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, x, y, large = 2000000000, small = -2000000000;\n   string s1, s2;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> s1 >> x >> s2;\n     if ((s1 == '>' && s2 == 'Y') || (s1 == '<=' && s2 == 'N')) {\n       if (x >= small) {\n         small = x + 1;\n       }\n     } else if ((s1 == '<' && s2 == 'Y') || (s1 == '>=' && s2 == 'N')) {\n       if (x <= large) {\n         large = x - 1;\n       }\n     } else if ((s1 == '>=' && s2 == 'Y') || (s1 == '<' && s2 == 'N')) {\n       if (x >= small) {\n         small = x;\n       }\n     } else {\n       if (x <= large) {\n         large = x;\n       }\n     }\n   }\n   if (small > large) {\n     cout << 'Impossible';\n   } else {\n     cout << small;\n   }\n   return (0);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 405;\n char mp[30], s[N], a[5], b[5];\n int L, n, m, e[N][N], nxd[30], nxs[30], flg[30], lim[N], tmp[N], mx[2];\n vector<int> ans;\n bool chk(int pos, int v, int x, bool ff) {\n   if (lim[pos] != -1 && lim[pos] != flg[v]) return 0;\n   for (int i = 1; i <= n; i++)\n     if (e[x][i] && e[x][i + n]) return 0;\n   for (int i = 1; i <= n; i++) tmp[i] = (e[x][i] ? 0 : (e[x][i + n] ? 1 : -1));\n   if (ff) {\n     for (int i = 1; i <= n; i++) {\n       if (pos + i > n) break;\n       int t = max(lim[pos + i], tmp[pos + i]);\n       if (t == -1) break;\n       if (mx[t] < s[pos + i] - 'a' + 1) return 0;\n       if (mx[t] > s[pos + i] - 'a' + 1) break;\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     lim[i] = max(lim[i], tmp[i]);\n   }\n   return 1;\n }\n int main() {\n   scanf('%s', mp + 1);\n   L = strlen(mp + 1);\n   memset(lim, -1, sizeof(lim));\n   memset(mx, -1, sizeof(mx));\n   for (int i = 1; i <= L; i++) {\n     flg[i] = mp[i] == 'V';\n     mx[flg[i]] = i;\n   }\n   for (int i = 1; i <= L; i++)\n     for (int j = i + 1; j <= L; j++)\n       if (flg[i] != flg[j]) {\n         nxd[i] = j;\n         break;\n       }\n   for (int i = 1; i <= L; i++)\n     for (int j = i + 1; j <= L; j++)\n       if (flg[i] == flg[j]) {\n         nxs[i] = j;\n         break;\n       }\n   cin >> n >> m;\n   for (int i = 1; i <= m; i++) {\n     int x, y;\n     scanf('%d%s%d%s', &x, a, &y, b);\n     int a1 = a[0] == 'V', b1 = b[0] == 'V';\n     e[x + a1 * n][y + b1 * n] = 1;\n     e[y + !b1 * n][x + !a1 * n] = 1;\n   }\n   scanf('%s', s + 1);\n   for (int k = 1; k <= n * 2; k++)\n     for (int i = 1; i <= n * 2; i++)\n       for (int j = 1; j <= n * 2; j++) e[i][j] |= (e[i][k] & e[k][j]);\n   bool ff = 1;\n   for (int i = 1; i <= n; i++) {\n     int mn = ff ? s[i] - 'a' + 1 : 1;\n     if (chk(i, mn, i + flg[mn] * n, ff)) {\n       ans.push_back(mn);\n     } else if (mn < L && flg[mn] == flg[mn + 1] &&\n                chk(i, mn + 1, i + flg[mn + 1] * n, 0)) {\n       ans.push_back(mn + 1), ff = 0;\n     } else if (nxd[mn] && chk(i, nxd[mn], i + flg[nxd[mn]] * n, 0)) {\n       ans.push_back(nxd[mn]), ff = 0;\n     } else if (nxs[mn] && nxs[mn] > nxd[mn] &&\n                chk(i, nxs[mn], i + flg[nxs[mn]] * n, 0)) {\n       ans.push_back(nxs[mn]), ff = 0;\n     } else {\n       return puts('-1'), 0;\n     }\n   }\n   for (int i = 0; i <= n - 1; i++) printf('%c', ans[i] + 'a' - 1);\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double eps(1e-8);\n char s[1000010];\n int n, m, a, b;\n vector<int> vec[1000010];\n vector<int> p[1000010];\n int x[1000010], y[1000010], sum[1000010], ans[1000010];\n int Lowbit(int x) { return x & (-x); }\n void Update(int pos, int val) {\n   while (pos > 0) {\n     sum[pos] += val;\n     pos -= Lowbit(pos);\n   }\n }\n int Query(int pos) {\n   int ret = 0;\n   while (pos <= n) {\n     ret += sum[pos];\n     pos += Lowbit(pos);\n   }\n   return ret;\n }\n void Add(int l, int r, int val) {\n   Update(r, val);\n   Update(l - 1, -val);\n }\n int main() {\n   scanf('%s', s + 1);\n   for (n = 1; s[n]; n++)\n     ;\n   n--;\n   scanf('%d', &m);\n   for (int i = 1; i <= m; i++) {\n     scanf('%d%d', &a, &b);\n     vec[b].push_back(a);\n     p[b].push_back(i);\n   }\n   int len = 0;\n   for (int i = 1; i <= n; i++) {\n     len++;\n     if (s[i] == '(')\n       x[len] = 0;\n     else\n       x[len] = 1;\n     y[len] = i;\n     if (len >= 2 && x[len] == 1 && x[len - 1] == 0) {\n       Add(1, y[len - 1], 2);\n       len -= 2;\n     }\n     for (int j = 0; j < (int)vec[i].size(); j++) {\n       int tmp = vec[i][j];\n       ans[p[i][j]] = Query(tmp);\n     }\n   }\n   for (int i = 1; i <= m; i++) printf('%d\n', ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int a, b, c, min_cost, min_a, min_b, min_c;\n     cin >> a >> b >> c;\n     if (b % a == 0 && c % b == 0) {\n       cout << 0 << endl;\n       cout << a << ' ' << b << ' ' << c << endl;\n     } else {\n       min_cost = 10000000;\n       int max = 2 * c;\n       for (int i = 1; i < max; i++)\n         for (int j = i; j < max; j += i)\n           for (int k = j; k < max; k += j)\n             if (k % j == 0 && j % i == 0) {\n               int cost = abs(a - i) + abs(b - j) + abs(c - k);\n               if (cost < min_cost) {\n                 min_cost = cost;\n                 min_a = i;\n                 min_b = j;\n                 min_c = k;\n               }\n             }\n       cout << min_cost << endl;\n       cout << min_a << ' ' << min_b << ' ' << min_c << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n using namespace std;\n int dp[510][127010],mod,c[510][510],s[127010],jc[510];\n int sol(int n){\n 	s[0]=dp[n-1][0];\n 	for(int i=1;i<=n*(n-1)/2;i++)s[i]=(s[i-1]+dp[n-1][i])%mod;\n 	int ans=0;\n 	for(int i=1;i<n;i++)for(int j=i+1;j<=n*(n-1)/2;j++)(ans+=1ll*(n-i)*dp[n-1][j]%mod*s[j-(i+1)]%mod)%=mod;\n 	return ans;\n }\n int main(){\n 	int n;\n 	scanf('%d%d',&n,&mod);\n 	jc[0]=1;\n 	for(int i=1;i<=n;i++)jc[i]=1ll*jc[i-1]*i%mod;\n 	c[0][0]=dp[1][0]=1;\n 	for(int i=2;i<=n;i++)for(int j=0;j<=i*(i+1)/2;j++){\n 		if(!j)dp[i][j]=1;\n 		else dp[i][j]=(dp[i][j-1]+(dp[i-1][j]-((j>=i)?dp[i-1][j-i]:0))%mod)%mod;\n 	}\n 	for(int i=1;i<=n;i++){\n 		c[i][0]=1;\n 		for(int j=1;j<=i;j++)c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod;\n 	}\n 	int ans=0;\n 	for(int i=0;i<n;i++)(ans+=1ll*c[n][i]*jc[i]%mod*sol(n-i)%mod)%=mod;\n 	return printf('%d',(ans+mod)%mod),0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 100010;\n vector<pair<long long, int>> adj[10 * MAXN];\n long long dist[10 * MAXN];\n int par[10 * MAXN];\n int go1(int idx, int l, int r, int ds) {\n   if (idx > 1) {\n     int par = idx / 2;\n     adj[par + ds].push_back({0, idx + ds});\n   }\n   if (l == r) {\n     adj[idx + ds].push_back({0, l});\n     return idx;\n   }\n   int m = (l + r) / 2;\n   int ret =\n       max(idx, max(go1(2 * idx, l, m, ds), go1(2 * idx + 1, m + 1, r, ds)));\n   return ret;\n }\n void go2(int idx, int l, int r, int ds) {\n   for (int i = l; i < (r + 1); ++i) {\n     adj[i].push_back({0, idx + ds});\n   }\n   if (r > l) {\n     int m = (l + r) / 2;\n     go2(2 * idx, l, m, ds);\n     go2(2 * idx + 1, m + 1, r, ds);\n   }\n }\n void go3(int idx, int x, int y, int l, int r, function<void(int)> f) {\n   if (y < l || x > r) return;\n   if (x >= l && y <= r) {\n     f(idx);\n     return;\n   }\n   int m = (x + y) / 2;\n   go3(2 * idx, x, m, l, r, f);\n   go3(2 * idx + 1, m + 1, y, l, r, f);\n }\n void dijsktra(int src) {\n   memset(dist, 0x3f3f3f3f, sizeof(dist));\n   dist[src] = 0;\n   par[src] = src;\n   priority_queue<pair<long long, int>, vector<pair<long long, int>>,\n                  greater<pair<long long, int>>>\n       pq;\n   pq.push({dist[src], src});\n   while (!pq.empty()) {\n     int u = pq.top().second;\n     long long l = pq.top().first;\n     pq.pop();\n     if (dist[u] == l) {\n       for (auto p : adj[u]) {\n         long long ndist = l + p.first;\n         if (ndist < dist[p.second]) {\n           dist[p.second] = ndist;\n           par[p.second] = u;\n           pq.push({dist[p.second], p.second});\n         }\n       }\n     }\n   }\n }\n int main() {\n   int n, m, src;\n   scanf(' %d %d', &(n), &(m));\n   scanf(' %d', &(src));\n   --src;\n   int ds1 = n - 1 + 5;\n   int ds2 = go1(1, 0, n - 1, ds1) + ds1 + 5;\n   go2(1, 0, n - 1, ds2);\n   while (m--) {\n     int tp;\n     scanf(' %d', &(tp));\n     if (tp == 1) {\n       int u, v, w;\n       scanf(' %d %d', &(u), &(v));\n       scanf(' %d', &(w));\n       adj[u - 1].push_back({w, v - 1});\n     } else {\n       int vtx, l, r, w;\n       scanf(' %d %d', &(vtx), &(l));\n       scanf(' %d %d', &(r), &(w));\n       --l;\n       --r;\n       --vtx;\n       go3(1, 0, n - 1, l, r, [ds1, ds2, tp, w, vtx](int idx) {\n         if (tp == 2) {\n           adj[vtx].push_back({w, idx + ds1});\n         } else {\n           adj[idx + ds2].push_back({w, vtx});\n         }\n       });\n     }\n   }\n   dijsktra(src);\n   for (int i = 0; i < (n); ++i)\n     printf('%lld%c', (dist[i] == 0x3f3f3f3f3f3f3f3fll ? -1 : dist[i]),\n            ' \n'[i == n - 1]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n pair<long long, long long> a[300001];\n long long n, k, s, m;\n bool b[300001];\n inline long long read() {\n   long long sum = 0, x = 1;\n   char ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') x = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') {\n     sum = sum * 10 + ch - '0';\n     ch = getchar();\n   }\n   return sum * x;\n }\n inline void write(long long x) {\n   if (x < 0) {\n     putchar('-');\n     x = -x;\n   }\n   if (x > 9) write(x / 10);\n   putchar(x % 10 + '0');\n   return;\n }\n inline bool cmp(pair<long long, long long> a, pair<long long, long long> b) {\n   return a.first > b.first;\n }\n signed main() {\n   n = read();\n   k = read();\n   for (register long long i = 1; i <= n; ++i) a[i].second = i;\n   for (m = 1; m <= n; ++m) {\n     for (register long long j = m * 2; j <= n; j += m) ++a[j].first;\n     s += a[m].first;\n     if (s >= k) break;\n   }\n   if (s < k) {\n     puts('No');\n     return 0;\n   }\n   sort(a + 1, a + m, cmp);\n   long long t = m;\n   for (register long long i = 1; i <= m; ++i) {\n     if (a[i].second > m / 2 && s - a[i].first >= k) {\n       s -= a[i].first;\n       b[a[i].second] = true;\n       t--;\n     }\n     if (s == k) break;\n   }\n   puts('Yes');\n   write(t);\n   putchar('\n');\n   for (register long long i = 1; i <= m; ++i)\n     if (!b[i]) {\n       write(i);\n       putchar(' ');\n     }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int te;\n   cin >> te;\n   while (te--) {\n     int n, m, x, ji = 0, ou = 0;\n     cin >> n >> m;\n     for (int i = 0; i < n; ++i) {\n       cin >> x;\n       if (x & 1)\n         ji++;\n       else\n         ou++;\n     }\n     if (ji == 0) {\n       puts('No');\n       continue;\n     }\n     ji--;\n     m--;\n     int q = min(m / 2 * 2, ji / 2 * 2);\n     m -= q;\n     ou -= m;\n     if (ou < 0)\n       puts('No');\n     else\n       puts('Yes');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, q[1000010], a[1000010], del[1000010], sz[1000010], p[1000010];\n stack<int> res;\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= m; i++) scanf('%d', &a[i]);\n   if (a[m] <= n) a[m + 1] = n + 1;\n   for (int i = 1; i <= m; i++)\n     for (int j = a[i]; j < a[i + 1]; j++) p[j] = i;\n   for (int i = 1; i <= n; i++) scanf('%d', &q[i]);\n   for (int i = 0; i < a[1]; i++) del[i] = n;\n   for (int i = 1; i <= m; i++) {\n     del[a[i]] = 1;\n     for (int j = a[i] + 1; j < a[i + 1]; j++) del[j] = del[j - i] + 1;\n   }\n   for (int i = 1; i <= n; i++) {\n     if (q[i] == 1 || q[i] == 0)\n       sz[i] = sz[i - 1] + 1;\n     else\n       sz[i] = sz[i - 1] - p[sz[i - 1]];\n   }\n   if (!sz[n]) {\n     puts('Poor stack!');\n     return 0;\n   }\n   int k = 0;\n   for (int i = n; i >= 1; i--) {\n     if (q[i] == -1)\n       k++;\n     else if (del[sz[i]] > k)\n       res.push(q[i]);\n   }\n   while (!res.empty()) {\n     printf('%d', res.top());\n     res.pop();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int s0, t0, t1, n, m, Next[500000 + 5];\n char s[500000 + 5], t[500000 + 5];\n void GetNext() {\n   Next[0] = -1;\n   int j = 0, k = -1;\n   while (j < m) {\n     if (!~k || t[j] == t[k])\n       Next[++j] = ++k;\n     else\n       k = Next[k];\n   }\n }\n int main() {\n   scanf('%s%s', s, t);\n   n = strlen(s), m = strlen(t);\n   GetNext();\n   for (int i = 0; s[i]; i++) s0 += s[i] == '0';\n   for (int i = 0; t[i]; i++) t0 += t[i] == '0';\n   for (int i = Next[m]; t[i]; i++) t1 += t[i] == '0';\n   int A = t0, B = m - t0, l = m - Next[m], step = 0;\n   while (A + t1 <= s0 && B + l - t1 <= n - s0) A += t1, B += l - t1, step++;\n   if (t0 <= s0 && m - t0 <= n - s0) {\n     printf('%s', t);\n     for (int i = 0; i < step; i++) printf('%s', t + Next[m]);\n     for (int i = s0 - A; i; i--) putchar('0');\n     for (int i = n - s0 - B; i; i--) putchar('1');\n     puts('');\n   } else\n     printf('%s\n', s);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1000 * 100 + 10;\n vector<int> g[maxn];\n int a[maxn], b[maxn];\n bool p[maxn];\n int n, m;\n void input() {\n   cin >> n >> m;\n   for (int i = 0; i < m; i++) {\n     int u, v;\n     cin >> u >> v;\n     u--, v--;\n     g[u].push_back(v);\n     g[v].push_back(u);\n   }\n   for (int i = 0; i < n; i++) cin >> a[i];\n }\n void bfs(int v) {\n   queue<int> q;\n   q.push(v);\n   while (!q.empty()) {\n     p[q.front()] = true;\n     int u = q.front();\n     b[u]++;\n     for (int i = 0; i < g[u].size(); i++) {\n       b[g[u][i]]++;\n       if (b[g[u][i]] == a[g[u][i]]) q.push(g[u][i]);\n     }\n     q.pop();\n   }\n }\n int main() {\n   input();\n   for (int i = 0; i < n; i++)\n     if (b[i] == a[i]) bfs(i);\n   int ans = 0;\n   for (int i = 0; i < n; i++) ans += p[i];\n   cout << ans << endl;\n   ;\n   for (int i = 0; i < n; i++)\n     if (p[i]) cout << i + 1 << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mod = 1000000007;\n int main() {\n   string s;\n   cin >> s;\n   int k;\n   cin >> k;\n   unordered_set<string> st;\n   for (int i = 0; i < k; i++) {\n     string temp;\n     cin >> temp;\n     st.insert(temp);\n     string temp2 = '';\n     temp2 = temp2 + temp[1];\n     temp2 = temp2 + temp[0];\n     st.insert(temp2);\n   }\n   vector<pair<char, int> > arr;\n   for (int i = 0; i < s.size(); i++) {\n     int count = 1;\n     int j = i + 1;\n     while (j < s.size() && s[j] == s[i]) {\n       count++;\n       j++;\n     }\n     arr.push_back(make_pair(s[i], count));\n     i = j - 1;\n   }\n   int ans = 0;\n   for (int i = 0; i < arr.size() - 1; i++) {\n     string temp = '';\n     temp = temp + arr[i].first;\n     temp = temp + arr[i + 1].first;\n     if (st.find(temp) != st.end()) {\n       int c1 = arr[i].second, c2 = arr[i + 1].second;\n       int j = i + 2;\n       while (j < s.size()) {\n         if (arr[j].first == arr[i].first)\n           c1 += arr[j].second;\n         else if (arr[j].first == arr[i + 1].first)\n           c2 += arr[j].second;\n         else\n           break;\n         j++;\n       }\n       ans += min(c1, c2);\n       i = j - 1;\n     }\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, x, y;\n long long dp[10000005];\n int main(void) {\n   scanf('%lld%lld%lld', &n, &x, &y);\n   dp[1] = x;\n   for (int i = 2; i <= n; ++i) {\n     if (i & 1) {\n       dp[i] = min(dp[i - 1] + x, dp[(i + 1) >> 1] + x + y);\n     } else\n       dp[i] = min(dp[i - 1] + x, dp[i >> 1] + y);\n   }\n   printf('%lld\n', dp[n]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, nn, sum;\n vector<double> q;\n double x, ans, anss;\n int main() {\n   scanf('%d', &n);\n   sum = 0;\n   for (int i = 1; i <= 2 * n; i++) {\n     scanf('%lf', &x);\n     ans += (x - floor(x));\n     if (floor(x) == ceil(x)) sum++;\n   }\n   if (sum > n) n = n * 2 - sum;\n   sum = min(sum, n);\n   anss = 10000000;\n   for (int i = n - sum; i <= n; i++) anss = min(anss, fabs(ans - i));\n   printf('%.3lf', anss);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct TnT {\n   int k, f;\n } T[111];\n bool cmp(TnT a, TnT b) {\n   if (a.f == b.f) return a.k < b.k;\n   return a.f < b.f;\n }\n map<int, int> t;\n int main() {\n   ios::sync_with_stdio(false);\n   int n, m, ans = -1;\n   cin >> n >> m;\n   for (int i = 0; i < m; i++) cin >> T[i].k >> T[i].f;\n   sort(T, T + m, cmp);\n   for (int k = 1; k <= 100; k++) {\n     int cnt = 1;\n     for (int i = 1; i <= 110; i += k) {\n       for (int j = i; j <= i + k - 1; j++) t[j] = cnt;\n       cnt++;\n     }\n     int flag = 1;\n     for (int i = 0; i < m; i++) {\n       if (t[T[i].k] != T[i].f) flag = 0;\n     }\n     if (flag) {\n       if (ans == -1)\n         ans = t[n];\n       else if (ans != t[n]) {\n         cout << -1 << endl;\n         return 0;\n       }\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool distinct(int n) {\n   set<int> a;\n   int i, c = 0;\n   while (n > 0) {\n     int d = n % 10;\n     a.insert(d);\n     n /= 10;\n   }\n   int l = a.size();\n   for (int i = 0; i <= l - 1; i++) {\n     c++;\n   }\n   if (c == 4) {\n     return true;\n   } else {\n     return false;\n   }\n }\n int main() {\n   int y;\n   cin >> y;\n   for (int i = y; i <= 10000; i++) {\n     if (i > y) {\n       if (distinct(i)) {\n         cout << i;\n         break;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t, n;\n   cin >> t;\n   while (t--) {\n     cin >> n;\n     int a[n], sum = n - 1;\n     for (int i = 0; i < n; i++) {\n       cin >> a[i];\n       sum += a[i];\n     }\n     cout << sum / n << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char A[2005][2005], B[2005][2005];\n int last_valid;\n pair<int, int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<double, double> 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<double, double> 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<int> 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 <bits/stdc++.h>\n using namespace std;\n vector<int> 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 <bits/stdc++.h>\n using namespace std;\n int dx[] = {0, 0, 1, -1};\n int dy[] = {1, -1, 0, 0};\n template <class T>\n inline void smin(T &a, T b) {\n   if (a > b) a = b;\n }\n template <class T>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> 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<bits/stdc++.h>\n #define pairs pair<int,int>\n #define loop(i,a,n) for(int i=a;i<n;i++)\n #define m_p make_pair\n #define fi first\n #define se second\n #define pb push_back\n #define ll long long\n #define all(v) v.begin(),v.end()\n using namespace std;\n //vector<ll> 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<pairs,bool> mp;\n \n void solve(){\n ll n,k;\n cin>>n>>k;\n vector<ll> vec(n);\n vector<pairs> 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<n-1;i++){\n   ll a=range[i-1].fi;\n   ll b=range[i-1].se;\n   ll c= b+k-1;\n   ll d=a-(k-1);\n   range[i].fi=max(d,vec[i]);\n   range[i].se=min(c,vec[i]+(k-1));\n }\n \n loop(i,1,n){\n   ll a=range[i-1].fi;\n   ll b=range[i-1].se;\n   ll c=range[i].fi;\n   ll d=range[i].se;\n \n   if(a-k>=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<<endl;\n     }\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   while (cin >> n) {\n     string s;\n     cin >> s;\n     string res = '';\n     for (int i = 0; i < n; i++) {\n       if (s[i] <= '1')\n         continue;\n       else {\n         if (s[i] == '4')\n           res += '3', res += '2', res += '2';\n         else {\n           if (s[i] == '6')\n             res += '5', res += '3';\n           else {\n             if (s[i] == '8')\n               res += '7', res += '2', res += '2', res += '2';\n             else {\n               if (s[i] == '9')\n                 res += '3', res += '3', res += '2', res += '7';\n               else\n                 res += s[i];\n             }\n           }\n         }\n       }\n     }\n     sort(res.begin(), res.end());\n     reverse(res.begin(), res.end());\n     cout << res << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int W[21][11];\n void F() {\n   W[1][1] = 0;\n   W[1][2] = 0;\n   W[1][3] = 0;\n   W[1][4] = 0;\n   W[1][5] = 0;\n   W[1][6] = 0;\n   W[1][7] = 0;\n   W[1][8] = 0;\n   W[1][9] = 0;\n   W[1][10] = 0;\n   W[2][1] = 0;\n   W[2][2] = 0;\n   W[2][3] = 0;\n   W[2][4] = 0;\n   W[2][5] = 0;\n   W[2][6] = 0;\n   W[2][7] = 0;\n   W[2][8] = 0;\n   W[2][9] = 0;\n   W[2][10] = 0;\n   W[3][1] = 14;\n   W[3][2] = 0;\n   W[3][3] = 0;\n   W[3][4] = 0;\n   W[3][5] = 0;\n   W[3][6] = 0;\n   W[3][7] = 0;\n   W[3][8] = 0;\n   W[3][9] = 0;\n   W[3][10] = 0;\n   W[4][1] = 22;\n   W[4][2] = 0;\n   W[4][3] = 0;\n   W[4][4] = 0;\n   W[4][5] = 0;\n   W[4][6] = 0;\n   W[4][7] = 0;\n   W[4][8] = 0;\n   W[4][9] = 0;\n   W[4][10] = 0;\n   W[5][1] = 16;\n   W[5][2] = 70;\n   W[5][3] = 0;\n   W[5][4] = 0;\n   W[5][5] = 0;\n   W[5][6] = 0;\n   W[5][7] = 0;\n   W[5][8] = 0;\n   W[5][9] = 0;\n   W[5][10] = 0;\n   W[6][1] = 6;\n   W[6][2] = 232;\n   W[6][3] = 0;\n   W[6][4] = 0;\n   W[6][5] = 0;\n   W[6][6] = 0;\n   W[6][7] = 0;\n   W[6][8] = 0;\n   W[6][9] = 0;\n   W[6][10] = 0;\n   W[7][1] = 1;\n   W[7][2] = 380;\n   W[7][3] = 353;\n   W[7][4] = 0;\n   W[7][5] = 0;\n   W[7][6] = 0;\n   W[7][7] = 0;\n   W[7][8] = 0;\n   W[7][9] = 0;\n   W[7][10] = 0;\n   W[8][1] = 0;\n   W[8][2] = 396;\n   W[8][3] = 1786;\n   W[8][4] = 0;\n   W[8][5] = 0;\n   W[8][6] = 0;\n   W[8][7] = 0;\n   W[8][8] = 0;\n   W[8][9] = 0;\n   W[8][10] = 0;\n   W[9][1] = 0;\n   W[9][2] = 284;\n   W[9][3] = 4500;\n   W[9][4] = 1782;\n   W[9][5] = 0;\n   W[9][6] = 0;\n   W[9][7] = 0;\n   W[9][8] = 0;\n   W[9][9] = 0;\n   W[9][10] = 0;\n   W[10][1] = 0;\n   W[10][2] = 142;\n   W[10][3] = 7414;\n   W[10][4] = 12122;\n   W[10][5] = 0;\n   W[10][6] = 0;\n   W[10][7] = 0;\n   W[10][8] = 0;\n   W[10][9] = 0;\n   W[10][10] = 0;\n   W[11][1] = 0;\n   W[11][2] = 48;\n   W[11][3] = 8849;\n   W[11][4] = 41160;\n   W[11][5] = 8997;\n   W[11][6] = 0;\n   W[11][7] = 0;\n   W[11][8] = 0;\n   W[11][9] = 0;\n   W[11][10] = 0;\n   W[12][1] = 0;\n   W[12][2] = 10;\n   W[12][3] = 8028;\n   W[12][4] = 92226;\n   W[12][5] = 76878;\n   W[12][6] = 0;\n   W[12][7] = 0;\n   W[12][8] = 0;\n   W[12][9] = 0;\n   W[12][10] = 0;\n   W[13][1] = 0;\n   W[13][2] = 1;\n   W[13][3] = 5658;\n   W[13][4] = 152140;\n   W[13][5] = 328222;\n   W[13][6] = 45425;\n   W[13][7] = 0;\n   W[13][8] = 0;\n   W[13][9] = 0;\n   W[13][10] = 0;\n   W[14][1] = 0;\n   W[14][2] = 0;\n   W[14][3] = 3112;\n   W[14][4] = 195420;\n   W[14][5] = 928494;\n   W[14][6] = 467292;\n   W[14][7] = 0;\n   W[14][8] = 0;\n   W[14][9] = 0;\n   W[14][10] = 0;\n   W[15][1] = 0;\n   W[15][2] = 0;\n   W[15][3] = 1322;\n   W[15][4] = 201744;\n   W[15][5] = 1947581;\n   W[15][6] = 2402980;\n   W[15][7] = 229347;\n   W[15][8] = 0;\n   W[15][9] = 0;\n   W[15][10] = 0;\n   W[16][1] = 0;\n   W[16][2] = 0;\n   W[16][3] = 422;\n   W[16][4] = 170444;\n   W[16][5] = 3213988;\n   W[16][6] = 8205152;\n   W[16][7] = 2758896;\n   W[16][8] = 0;\n   W[16][9] = 0;\n   W[16][10] = 0;\n   W[17][1] = 0;\n   W[17][2] = 0;\n   W[17][3] = 96;\n   W[17][4] = 118912;\n   W[17][5] = 4322956;\n   W[17][6] = 20852648;\n   W[17][7] = 16594160;\n   W[17][8] = 1157954;\n   W[17][9] = 0;\n   W[17][10] = 0;\n   W[18][1] = 0;\n   W[18][2] = 0;\n   W[18][3] = 14;\n   W[18][4] = 68640;\n   W[18][5] = 4846524;\n   W[18][6] = 41920210;\n   W[18][7] = 66357900;\n   W[18][8] = 15946870;\n   W[18][9] = 0;\n   W[18][10] = 0;\n   W[19][1] = 0;\n   W[19][2] = 0;\n   W[19][3] = 1;\n   W[19][4] = 32632;\n   W[19][5] = 4594423;\n   W[19][6] = 69183464;\n   W[19][7] = 197939352;\n   W[19][8] = 109824208;\n   W[19][9] = 5846414;\n   W[19][10] = 0;\n   W[20][1] = 0;\n   W[20][2] = 0;\n   W[20][3] = 0;\n   W[20][4] = 12628;\n   W[20][5] = 3715462;\n   W[20][6] = 96046590;\n   W[20][7] = 468541040;\n   W[20][8] = 503245466;\n   W[20][9] = 90700276;\n   W[20][10] = 0;\n }\n int main() {\n   F();\n   int n, t;\n   scanf('%d %d', &n, &t);\n   printf('%d\n', W[n][t]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int t;\n   cin >> t;\n   while (t--) {\n     long long int i, j, n, ans = 0, k1, k2;\n     cin >> n;\n     long long int arr[n];\n     vector<vector<long long int> > vec(26);\n     for (i = 0; i < n; i++) {\n       cin >> arr[i];\n       vec[arr[i] - 1].push_back(i);\n     }\n     long long int dp1[n][26], dp2[n][26];\n     for (i = 0; i < n; i++)\n       for (j = 0; j < 26; j++) {\n         dp1[i][j] = 0;\n         dp2[i][j] = 0;\n       }\n     dp1[0][arr[0] - 1]++;\n     for (i = 1; i < n; i++) {\n       for (j = 0; j < 26; j++)\n         if (arr[i] == j + 1)\n           dp1[i][j] += dp1[i - 1][j] + 1;\n         else\n           dp1[i][j] += dp1[i - 1][j];\n     }\n     dp2[n - 1][arr[n - 1] - 1]++;\n     for (i = n - 2; i >= 0; i--) {\n       for (j = 0; j < 26; j++)\n         if (arr[i] == j + 1)\n           dp2[i][j] += dp2[i + 1][j] + 1;\n         else\n           dp2[i][j] += dp2[i + 1][j];\n     }\n     for (i = 0; i < 26; i++) {\n       long long int dd = vec[i].size();\n       ans = max(ans, dd);\n     }\n     for (i = 0; i < 26; i++) {\n       for (k1 = 0; k1 < vec[i].size(); k1++) {\n         for (k2 = k1; k2 < vec[i].size(); k2++) {\n           long long int d1 = vec[i][k1], d2 = vec[i][k2];\n           for (j = 0; j < 26; j++)\n             if (i != j)\n               ans = max(ans, k2 - k1 + 1 + 2 * min(dp1[d1][j], dp2[d2][j]));\n         }\n       }\n     }\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 500005;\n long long a[MAX], pre[MAX], suf[MAX], t;\n int main() {\n   int ans = -1, pos = 0, n;\n   scanf('%d', &n);\n   for (register int i = 1; i <= n; i++) {\n     scanf('%lld', &a[i]);\n     pre[i] = pre[i - 1] | a[i];\n   }\n   for (register int i = n; i >= 1; i--) suf[i] = suf[i + 1] | a[i];\n   for (register int i = 1; i <= n; i++) {\n     t = pre[i - 1] | suf[i + 1];\n     if ((a[i] | t) - t > ans) {\n       ans = (a[i] | t) - t;\n       pos = i;\n     }\n   }\n   printf('%lld ', a[pos]);\n   for (register int i = 1; i <= n; i++)\n     if (i != pos) printf('%lld ', a[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n priority_queue<pair<int, string> > all[10010];\n int main() {\n   int n, m;\n   cin >> n >> m;\n   string name;\n   int reg, sc;\n   for (int i = 0; i < n; i++) {\n     cin >> name >> reg >> sc;\n     all[reg].push(make_pair(sc, name));\n   }\n   for (int i = 1; i <= m; i++) {\n     int tt[4];\n     int tool = 0;\n     pair<int, string> p[4];\n     while (all[i].size()) {\n       p[tool] = all[i].top();\n       all[i].pop();\n       tt[tool++] = p[tool].first;\n       if (tool == 3) break;\n     }\n     if (tool == 2) {\n       cout << p[0].second << ' ' << p[1].second << endl;\n     } else {\n       if (p[0].first == p[2].first || p[1].first == p[2].first) {\n         cout << '?' << endl;\n       } else {\n         cout << p[0].second << ' ' << p[1].second << endl;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n = 1009;\n int LG2(int N) {\n   int ans = 0;\n   while (N) {\n     N >>= 1;\n     ans++;\n   }\n   return ans - 1;\n }\n int main() {\n   cin.tie(0);\n   cin.sync_with_stdio(0);\n   int n;\n   cin >> n;\n   map<string, int> M;\n   int o = 1;\n   vector<long long> v(n);\n   vector<string> vv(n);\n   int ans = 0;\n   for (int i = 0; i < (n); i++) {\n     string s;\n     cin >> s;\n     ans += s.length();\n     vv[i] = s;\n     if (M[s]) {\n       v[i] = M[s];\n     } else {\n       M[s] = o;\n       v[i] = o;\n       o++;\n     }\n   }\n   ans += n - 1;\n   int L = ans;\n   for (int f = 0; f < n; f++) {\n     int len = 0;\n     vector<long long> p;\n     for (int l = f; l < n; l++) {\n       len += vv[l].length();\n       if (l > f) len++;\n       p.push_back(v[l]);\n       int pL = l - f + 1;\n       int cntP = 0;\n       for (int i = l + 1; i < n; i++) {\n         int o = i + pL - 1;\n         if (o > n) continue;\n         int c = 0;\n         bool b = 1;\n         for (int j = i; j <= o; j++) {\n           if (v[j] == p[c]) {\n           } else {\n             b = 0;\n             break;\n           }\n           c++;\n         }\n         if (b) {\n           cntP++;\n           i = o;\n         }\n       }\n       if (!cntP) continue;\n       int rB = (len - pL) * (cntP + 1);\n       ans = min(ans, L - rB);\n     }\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #define INF 1000000009\n \n int get(int i){\n     cout << '? ' << i+1 << endl;\n     cout.flush();\n     int a; cin >> a;\n     int b;\n     if(i == 0) b = INF;\n     else{\n         cout << '? ' << i << endl;\n         cout.flush();\n         cin >> b;\n     }\n     return b-a;\n }\n \n int main(){\n     // freopen('input.txt', 'r', stdin);\n     // freopen('output.txt', 'w', stdout);\n     ios_base::sync_with_stdio(false);\n     cin.tie(0);\n     int n; cin >> n;\n     if(n == 1){\n         cout << '! ' << 1 << endl;\n         cout.flush();\n         return 0;\n     }\n     if(get(1) < 0){\n         cout << '! ' << 1 << endl;\n         cout.flush();\n         return 0;\n     }\n     if(get(n-1) > 0){\n         cout << '! ' << n << endl;\n         cout.flush();\n         return 0;\n     }\n     int lo = 0, hi = n-1;\n     while(lo < hi){\n         int mid = lo+(hi-lo)/2;\n         if(get(mid) > 0) lo = mid+1;\n         else hi = mid;\n     }\n     cout << '! ' << lo << endl;\n     cout.flush();\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int N, M;\n int timew, cnt;\n stack<int> si;\n int low[2000005], dep[2000005], siz[2000005], dfn[2000005], nex[2000005],\n     las[2000005], Arrive[2000005], st[2000005], cnt1;\n bool isin[2000005];\n void jt(int xx, int yy) {\n   cnt++;\n   nex[cnt] = las[xx];\n   las[xx] = cnt;\n   Arrive[cnt] = yy;\n }\n void tarjan(int noww) {\n   timew++;\n   low[noww] = dfn[noww] = timew;\n   si.push(noww);\n   isin[noww] = true;\n   for (int i = las[noww]; i; i = nex[i]) {\n     if (!dfn[Arrive[i]]) {\n       tarjan(Arrive[i]);\n       low[noww] = min(low[noww], low[Arrive[i]]);\n     } else if (isin[Arrive[i]])\n       low[noww] = min(low[noww], dfn[Arrive[i]]);\n   }\n   if (low[noww] == dfn[noww]) {\n     cnt1++;\n     int k = -1;\n     while (k != noww) {\n       k = si.top();\n       si.pop();\n       isin[k] = false;\n       st[k] = cnt1;\n       siz[cnt1]++;\n     }\n   }\n }\n void Clear() {\n   cnt = 0;\n   cnt1 = 0;\n   timew = 0;\n   for (int i = 1; i <= N; i++)\n     las[i] = dep[i] = st[i] = siz[i] = dfn[i] = low[i] = dep[i] = 0;\n }\n int main() {\n   int T;\n   scanf('%d', &T);\n   while (T--) {\n     scanf('%d%d', &N, &M);\n     Clear();\n     for (int i = 1; i <= M; i++) {\n       int u, v;\n       scanf('%d%d', &u, &v);\n       if (u != v) jt(u, v);\n     }\n     for (int i = 1; i <= N; i++)\n       if (!dfn[i]) tarjan(i);\n     if (siz[st[1]] == N) {\n       puts('No');\n       continue;\n     }\n     for (int i = 1; i <= N; i++)\n       for (int j = las[i]; j; j = nex[j])\n         if (st[i] != st[Arrive[j]]) dep[st[i]]++;\n     bool flag = false;\n     for (int i = 1; i <= cnt1; i++) {\n       if (!dep[i] && siz[i]) {\n         flag = true;\n         puts('Yes');\n         vector<int> ans[2];\n         for (int j = 1; j <= N; j++) ans[st[j] == i].push_back(j);\n         printf('%d %d\n', ans[1].size(), ans[0].size());\n         for (auto &i : ans[1]) printf('%d ', i);\n         cout << '\n';\n         for (auto &i : ans[0]) printf('%d ', i);\n         cout << '\n';\n         break;\n       }\n     }\n     if (!flag) puts('No');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6;\n const int inf = 1e9 + 100;\n int a[N + 100], b[N + 100];\n vector<pair<int, int> > mon[N + 100];\n int tree[N * 4 + 100], lazy[N * 4 + 100];\n void build(int v, int tl, int tr) {\n   if (tl == tr) {\n     tree[v] = -b[tl + 1];\n     return;\n   }\n   int tm = (tl + tr) / 2;\n   build(v * 2, tl, tm);\n   build(v * 2 + 1, tm + 1, tr);\n   tree[v] = max(tree[v * 2], tree[v * 2 + 1]);\n }\n void push(int v) {\n   tree[v * 2] += lazy[v];\n   tree[v * 2 + 1] += lazy[v];\n   lazy[v * 2] += lazy[v];\n   lazy[v * 2 + 1] += lazy[v];\n   lazy[v] = 0;\n }\n void update(int v, int tl, int tr, int l, int r, int addend) {\n   if (l > r) {\n     return;\n   }\n   if (tl == l && tr == r) {\n     tree[v] += addend;\n     lazy[v] += addend;\n     return;\n   }\n   push(v);\n   int tm = (tl + tr) / 2;\n   update(v * 2, tl, tm, l, min(r, tm), addend);\n   update(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, addend);\n   tree[v] = max(tree[v * 2], tree[v * 2 + 1]);\n }\n int query(int v, int tl, int tr, int l, int r) {\n   if (l > r) {\n     return -inf;\n   }\n   if (tl == l && tr == r) {\n     return tree[v];\n   }\n   push(v);\n   int tm = (tl + tr) / 2;\n   return max(query(v * 2, tl, tm, l, min(r, tm)),\n              query(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r));\n }\n int main() {\n   for (int i = 1; i <= N + 1; i++) {\n     a[i] = b[i] = inf;\n   }\n   int n, m, p;\n   scanf('%d%d%d', &n, &m, &p);\n   for (int i = 1; i <= n; i++) {\n     int cur, cost;\n     scanf('%d%d', &cur, &cost);\n     a[cur] = min(cost, a[cur]);\n   }\n   int mx = 0;\n   for (int i = 1; i <= m; i++) {\n     int cur, cost;\n     scanf('%d%d', &cur, &cost);\n     b[cur] = min(cost, b[cur]);\n     mx = max(mx, cur);\n   }\n   for (int i = 1; i <= p; i++) {\n     int x, y, z;\n     scanf('%d%d%d', &x, &y, &z);\n     mon[x].push_back(make_pair(y, z));\n   }\n   for (int i = 1; i <= N; i++) {\n     sort(mon[i].begin(), mon[i].end());\n   }\n   for (int i = N; i > 0; i--) {\n     a[i] = min(a[i], a[i + 1]);\n     b[i] = min(b[i], b[i + 1]);\n   }\n   build(1, 1, N);\n   int ans = -a[1] - b[1];\n   int total = 0;\n   for (int i = 1; i <= N; i++) {\n     if (a[i + 1] == inf) {\n       break;\n     }\n     for (auto it : mon[i]) {\n       update(1, 1, N, it.first, N, it.second);\n       ans = max(ans, query(1, 1, N, 1, mx - 1) - a[i + 1]);\n     }\n   }\n   printf('%d\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s[500][500];\n int di[4] = {-1, 1, 0, 0};\n int dj[4] = {0, 0, -1, 1};\n typedef int int2d[500][500];\n int2d p[26];\n int2d d;\n struct Pos {\n   int r, c;\n   Pos(int r = 0, int c = 0) : r(r), c(c) {}\n   void init(int r, int c) {\n     this->r = r;\n     this->c = c;\n   }\n   bool operator<(const Pos& p) const {\n     int d1 = d[r][c], d2 = d[p.r][p.c];\n     return d1 < d2 || d1 == d2 && (r < p.r || r == p.r && c < p.c);\n   }\n } wh[27];\n int n, m;\n bool isDigit(char c) { return c >= '0' && c <= '9'; }\n set<Pos> heap;\n void calc(int i, int j, int2d& par) {\n   memset(d, 127, sizeof(d));\n   d[i][j] = 0;\n   heap.insert(Pos(i, j));\n   while (!heap.empty()) {\n     Pos p = *heap.begin();\n     heap.erase(heap.begin());\n     char ch = s[p.r][p.c];\n     if (!isDigit(ch) && ch != s[i][j]) {\n       continue;\n     }\n     int cost = (isDigit(ch) ? ch - '0' : 1) + d[p.r][p.c];\n     for (int dir = 0; dir < 4; dir++) {\n       int r = p.r + di[dir], c = p.c + dj[dir];\n       if (r >= 0 && c >= 0 && r < n && c < m && s[r][c] != '#') {\n         if (d[r][c] > cost) {\n           heap.erase(Pos(r, c));\n           d[r][c] = cost;\n           heap.insert(Pos(r, c));\n           par[r][c] = dir;\n         }\n       }\n     }\n   }\n }\n char sm[10000];\n int main() {\n   int k;\n   cin >> n >> m >> k;\n   for (int i = 0; i < n; i++) {\n     scanf('%s', s[i]);\n   }\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       if (s[i][j] >= 'a' && s[i][j] <= 'z') {\n         wh[s[i][j] - 'a'].init(i, j);\n         calc(i, j, p[s[i][j] - 'a']);\n       }\n     }\n   }\n   int r, c;\n   int r2, c2;\n   scanf('%d %d %s %d %d', &r, &c, sm, &r2, &c2);\n   r--, c--;\n   r2--, c2--;\n   calc(r2, c2, p[26]);\n   int len = strlen(sm);\n   for (int i = 0; i < len && k;) {\n     char ch = s[r][c];\n     if (ch == sm[i]) {\n       i++;\n       continue;\n     }\n     int cost = (isDigit(ch) ? ch - '0' : 1);\n     int dir = p[sm[i] - 'a'][r][c];\n     if (cost > k) {\n       k = 0;\n       break;\n     }\n     k -= cost;\n     r -= di[dir];\n     c -= dj[dir];\n   }\n   while (k > 0 && (r != r2 || c != c2)) {\n     char ch = s[r][c];\n     int cost = (isDigit(ch) ? ch - '0' : 1);\n     if (cost > k) {\n       k = cost;\n       exit(1);\n       break;\n     }\n     k -= cost;\n     int dir = p[26][r][c];\n     r -= di[dir];\n     c -= dj[dir];\n   }\n   printf('%d %d\n', r + 1, c + 1);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n T abs(T x) {\n   return x > 0 ? x : -x;\n }\n const int tt = 75;\n int n;\n int m;\n int x[100];\n int y[100];\n int z[100];\n vector<int> v;\n vector<int> w[300];\n int res[301][301][2];\n int was[301][301][2];\n map<int, int> num;\n int f[300];\n int calc() {\n   vector<pair<int, int> > v;\n   for (int i = 0; i < n; i++)\n     if (z[i]) {\n       v.push_back(make_pair(x[i], 1));\n       v.push_back(make_pair(x[i] + y[i], -1));\n     } else {\n       v.push_back(make_pair(x[i] - y[i], 1));\n       v.push_back(make_pair(x[i], -1));\n     }\n   sort((v).begin(), (v).end());\n   int cur = 0, bal = 0;\n   for (int i = 0; i + 1 < 2 * n; i++) {\n     bal += v[i].second;\n     if (bal) cur += v[i + 1].first - v[i].first;\n   }\n   return cur;\n }\n int go(int i, int j, int t) {\n   if (j < i) {\n     t = 0;\n     j = i;\n   }\n   if (i == ((int)(v).size())) return 0;\n   if (was[i][j][t]) return res[i][j][t];\n   was[i][j][t] = 1;\n   int cur = go(i + 1, j, t);\n   if ((!t || i < j) && f[i] > j)\n     cur = max(cur, go((t ? j : i) + 1, f[i], 0) + (v[f[i]] - v[j]));\n   for (int k = 0; k < ((int)(w[i]).size()); k++)\n     if (w[i][k] > j)\n       cur = max(cur, go((t ? j : i) + 1, w[i][k], 1) + (v[w[i][k]] - v[j]));\n   return res[i][j][t] = cur;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     scanf('%d%d', &x[i], &y[i]);\n     v.push_back(x[i] - y[i]);\n     v.push_back(x[i]);\n     v.push_back(x[i] + y[i]);\n   }\n   sort((v).begin(), (v).end());\n   v.resize(unique((v).begin(), (v).end()) - v.begin());\n   for (int i = 0; i < ((int)(v).size()); i++) num[v[i]] = i;\n   for (int i = 0; i < n; i++) {\n     int a = num[x[i] - y[i]];\n     int b = num[x[i]];\n     int c = num[x[i] + y[i]];\n     f[b] = c;\n     w[a].push_back(b);\n   }\n   printf('%d\n', go(0, 0, 0));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main()\n {\n      ios_base :: sync_with_stdio(false); cin.tie(NULL);\n      int t ; cin >> t ; while(t--)\n      {\n          int a , b ; cin >> a >> b ;\n    a-=b ;\n    while(b--) cout << 'a' ;\n    string d = 'cba' ;\n    for(int i = 0 ; i < a ; i++)\n    {\n        cout << d[i % 3] ;\n    }\n    cout << endl ;\n      }\n \n }\n \n \n \n \n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, m, rr[10][10];\n long long func(long long), dp[(1 << 21)];\n map<long long, pair<long long, long long> > mr;\n long long check(long long i, long long j) {\n   return (abs(mr[i].first - mr[j].first) + abs(mr[i].second - mr[j].second)) ==\n          3;\n }\n int main() {\n   scanf('%lld %lld', &n, &m);\n   if (n > m) swap(n, m);\n   if (n * m <= 21) {\n     long long x = 0;\n     for (int i = 0; i < n; i++)\n       for (int j = 0; j < m; j++) {\n         mr[x++] = make_pair(i, j);\n       }\n     memset(dp, -1, sizeof(dp));\n     cout << func(0);\n   } else {\n     long long ans = 0;\n     if (n == 1) {\n       ans += m - m % 6;\n       m = m % 6;\n       ans += (m >= 3 ? 2 * (m - 3) : 0);\n     } else\n       ans = n * m - (n * m) % 2;\n     cout << ans << '\n';\n   }\n }\n long long func(long long mask) {\n   if (dp[mask] != -1) return dp[mask];\n   long long ans = 0;\n   for (int i = 0; i < n * m; i++) {\n     for (int j = i + 1; j < n * m; j++) {\n       if ((mask & (1 << i)) == 0 && (mask & (1 << j)) == 0 && check(i, j)) {\n         ans = max(ans, 2 + func(mask | (1 << i) | (1 << j)));\n       }\n     }\n   }\n   return dp[mask] = ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool f(int n, int h, int c, int t) {\n   return (2 * n + 1ll) * abs(1ll * n * (h + c - 2 * t) + t - c) <=\n          (2 * n - 1ll) * (1ll * n * (h + c - 2 * t) + h - t);\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(NULL);\n   long long t = 1;\n   cin >> t;\n   while (t--) {\n     int h, c, t;\n     cin >> h >> c >> t;\n     if (2 * t <= h + c)\n       cout << '2'\n            << '\n';\n     else {\n       int a = h - t;\n       int b = 2 * t - c - h;\n       int k = 2 * (a / b) + 1;\n       long long val1 =\n           abs(k / 2 * 1ll * c + (k + 1) / 2 * 1ll * h - t * 1ll * k);\n       long long val2 = abs((k + 2) / 2 * 1ll * c + (k + 3) / 2 * 1ll * h -\n                            t * 1ll * (k + 2));\n       if (val1 * (k + 2) <= val2 * k)\n         cout << k << '\n';\n       else\n         cout << k + 2 << '\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #define sim template < class c\n #define ris return * this\n #define dor > debug & operator <<\n #define eni(x) sim > typename \\n   enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {\n sim > struct rge { c b, e; };\n sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }\n sim > auto dud(c* x) -> decltype(cerr << *x, 0);\n sim > char dud(...);\n struct debug {\n #ifndef ONLINE_JUDGE\n ~debug() { cerr << endl; }\n eni(!=) cerr << boolalpha << i; ris; }\n eni(==) ris << range(begin(i), end(i)); }\n sim, class b dor(pair < b, c > d) {\n   ris << '(' << d.first << ', ' << d.second << ')';\n }\n sim dor(rge<c> d) {\n   *this << '[';\n   for (auto it = d.b; it != d.e; ++it)\n     *this << ', ' + 2 * (it == d.b) << *it;\n   ris << ']';\n }\n #else\n sim dor(const c&) { ris; }\n #endif\n };\n #define imie(...) ' [' << #__VA_ARGS__ ': ' << (__VA_ARGS__) << '] '\n \n #define ll long long\n \n const ll mod = 998244353;\n \n long long power(long long x, ll y, ll p)\n {\n     long long res = 1; // Initialize result\n  \n     x = x % p; // Update x if it is more than or\n     // equal to p\n  \n     while (y > 0)\n     {\n      \n         // If y is odd, multiply x with result\n         if (y & 1)\n             res = (res * x) % p;\n  \n         // y must be even now\n         y = y >> 1; // y = y/2\n         x = (x * x) % p;\n     }\n     return res;\n }\n  \n // Returns n^(-1) mod p\n long long modInverse(long long n, int p)\n {\n     return power(n, p - 2, p);\n }\n  \n // Returns nCr % p using Fermat's little\n // theorem.\n long long nCrModPFermat(long long n,int r, int p)\n {\n     // If n<r, then nCr should return 0\n     if (n < r)\n         return 0;\n     // Base case\n     if (r == 0)\n         return 1;\n  \n     // Fill factorial array so that we\n     // can find all factorial of r, n\n     // and n-r\n     long long fac[n + 1];\n     fac[0] = 1;\n     for (int i = 1; i <= n; i++)\n         fac[i] = (fac[i - 1] * i) % p;\n  \n     return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p;\n }\n \n void test_case() {\n     ll n;\n     cin >> n;\n     string s;\n     cin >> s;\n     ll cnt = 0, cnt2 = 0, tmp = 0;\n     for(ll i = 0; i < n; ++i) {\n         if(s[i] == '0') {\n             cnt2 = cnt2 + (tmp) / 2;\n             tmp = 0;\n             cnt++;\n         } else {\n             tmp++;\n         }\n     }\n     cnt2 = cnt2 + (tmp) / 2;\n     cout << nCrModPFermat(cnt + cnt2, cnt, mod) << endl;\n }\n  \n int main()\n {\n     ll T; \n     cin >> T;\n     for(ll i = 1; i <= T; ++i) {\n         test_case();\n     }\n     return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize(2)\n using namespace std;\n int rd() {\n   int k = 0;\n   char c = getchar();\n   while (c > '9' || c < '0') c = getchar();\n   while (c >= '0' && c <= '9') k = k * 10 + c - '0', c = getchar();\n   return k;\n }\n const int N = 300000, M = 600001;\n int T, x, y, f[M], sx[M], sy[M];\n long long ans;\n vector<pair<int, int> > v[M << 1];\n map<pair<int, int>, int> mp;\n pair<int, int> p;\n int F(int x) {\n   while (x != f[x]) x = f[x];\n   return x;\n }\n void Add(int x, int l, int r, int s, int t, pair<int, int> p) {\n   if (s <= l && r <= t) {\n     v[x].push_back(p);\n     return;\n   }\n   if (s <= ((l + r) >> 1)) Add((x << 1), l, ((l + r) >> 1), s, t, p);\n   if (((l + r) >> 1) < t) Add((x << 1 | 1), ((l + r) >> 1) + 1, r, s, t, p);\n }\n void Solve(int x, int l, int r) {\n   long long pre = ans;\n   stack<int> S;\n   for (int i = 0; i < v[x].size(); ++i) {\n     int a = F(v[x][i].first), b = F(v[x][i].second + N);\n     if (a == b) continue;\n     if (sx[a] + sy[a] > sx[b] + sy[b]) {\n       int t = a;\n       a = b, b = t;\n     }\n     ans -= (long long)sx[a] * sy[a] + (long long)sx[b] * sy[b],\n         f[a] = b, sx[b] += sx[a], sy[b] += sy[a];\n     ans += (long long)sx[b] * sy[b], S.push(a);\n   }\n   if (l == r)\n     printf('%lld ', ans);\n   else\n     Solve((x << 1), l, ((l + r) >> 1)),\n         Solve((x << 1 | 1), ((l + r) >> 1) + 1, r);\n   while (!S.empty()) {\n     int t = S.top(), z = f[t];\n     S.pop(), f[t] = t, sx[z] -= sx[t], sy[z] -= sy[t];\n   }\n   ans = pre;\n }\n int main() {\n   T = rd();\n   for (int i = 1; i <= T; ++i) {\n     x = rd(), y = rd(), p = make_pair(x, y);\n     if (mp.count(p))\n       Add(1, 1, T, mp[p], i - 1, p), mp.erase(p);\n     else\n       mp[p] = i;\n   }\n   for (auto t : mp) Add(1, 1, T, t.second, T, t.first);\n   for (int i = 1; i <= N; ++i) sx[f[i] = i] = 1;\n   for (int i = N + 1; i < M; ++i) sy[f[i] = i] = 1;\n   Solve(1, 1, T);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<long long> adj[100007][2];\n long long ecnt[100007][2] = {0};\n long long ss[100007] = {0};\n long long sum = 0;\n long long n, m, q;\n int main() {\n   cin >> n >> m;\n   for (long long i = 0; i < m; i++) {\n     long long a, b;\n     cin >> a >> b;\n     --a;\n     --b;\n     if (a > b) swap(a, b);\n     adj[a][0].push_back(b);\n     adj[b][1].push_back(a);\n     ecnt[a][0]++;\n     ecnt[b][1]++;\n   }\n   for (long long i = 0; i < n; i++) {\n     ss[i] = ecnt[i][0] * ecnt[i][1];\n     sum += ss[i];\n   }\n   cin >> q;\n   cout << sum << endl;\n   while (q--) {\n     long long v;\n     cin >> v;\n     --v;\n     sum -= ss[v];\n     ss[v] = 0;\n     ecnt[v][1] += ecnt[v][0];\n     ecnt[v][0] = 0;\n     for (auto i : adj[v][0]) {\n       sum -= ecnt[i][0] * ecnt[i][1];\n       ecnt[i][1]--;\n       ecnt[i][0]++;\n       sum += ecnt[i][0] * ecnt[i][1];\n       ss[i] = ecnt[i][0] * ecnt[i][1];\n       adj[i][0].push_back(v);\n     }\n     adj[v][0].clear();\n     cout << sum << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 5;\n int maxdp[27];\n int dp[N];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int n;\n   string str;\n   cin >> n >> str;\n   for (int i = 0; i < n; ++i) {\n     for (int c = 26; c > str[i] - 'a'; --c)\n       maxdp[str[i] - 'a'] = max(maxdp[c] + 1, maxdp[str[i] - 'a']);\n     dp[i] = maxdp[str[i] - 'a'];\n   }\n   cout << *max_element(dp, dp + n) << endl;\n   for (int i = 0; i < n; ++i) {\n     cout << dp[i] << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int SIZE = 1e2 + 5;\n int main() {\n   int n, m, c;\n   string s[SIZE], extract, f;\n   c = 0, f = 'acef';\n   cin >> n >> m;\n   for (int i = 0; i < n; i++) cin >> s[i];\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       extract.push_back(s[i][j]);\n       extract.push_back(s[i + 1][j]);\n       extract.push_back(s[i][j + 1]);\n       extract.push_back(s[i + 1][j + 1]);\n       sort(extract.begin(), extract.end());\n       if (extract == f) c++;\n       extract.clear();\n     }\n   }\n   cout << c << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long t, n, m, i, j;\n   cin >> n >> m;\n   string a[n];\n   for (long long i = 0; i < n; i++) cin >> a[i];\n   long long f = 0;\n   for (long long i = 0; i < n; i++) {\n     for (long long j = 0; j < m; j++) {\n       if (a[i][j] == '.') continue;\n       if (i - 1 >= 0 && j - 1 >= 0 && a[i - 1][j] == 'X' &&\n           a[i][j - 1] == 'X' && a[i - 1][j - 1] == '.') {\n         f = 1;\n         break;\n       }\n       if (i - 1 >= 0 && j + 1 < n && a[i - 1][j] == 'X' && a[i][j + 1] == 'X' &&\n           a[i - 1][j + 1] == '.') {\n         f = 1;\n         break;\n       }\n       if (i + 1 < n && j - 1 >= 0 && a[i][j - 1] == 'X' && a[i + 1][j] == 'X' &&\n           a[i + 1][j - 1] == '.') {\n         f = 1;\n         break;\n       }\n       if (i + 1 < n && j + 1 < n && a[i + 1][j] == 'X' && a[i][j + 1] == 'X' &&\n           a[i + 1][j + 1] == '.') {\n         f = 1;\n         break;\n       }\n     }\n     if (f) break;\n   }\n   for (long long i = 0; i < n; i++) {\n     for (long long j = 0; j < m; j++) {\n       if (a[i][j] == '.') continue;\n       if (i - 1 >= 0 && j - 1 >= 0 && a[i - 1][j - 1] == 'X' &&\n           (a[i - 1][j] == '.' || a[i][j - 1] == '.')) {\n         f = 1;\n         break;\n       }\n       if (i - 1 >= 0 && j + 1 < n && a[i - 1][j + 1] == 'X' &&\n           (a[i - 1][j] == '.' || a[i][j + 1] == '.')) {\n         f = 1;\n         break;\n       }\n       if (i + 1 < n && j - 1 >= 0 && a[i + 1][j - 1] == 'X' &&\n           (a[i + 1][j] == '.' || a[i][j - 1] == '.')) {\n         f = 1;\n         break;\n       }\n       if (i + 1 < n && j + 1 < n && a[i + 1][j + 1] == 'X' &&\n           (a[i + 1][j] == '.' || a[i][j + 1] == '.')) {\n         f = 1;\n         break;\n       }\n     }\n     if (f) break;\n   }\n   if (f)\n     cout << 'NO\n';\n   else\n     cout << 'YES\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e6 + 7;\n pair<int, pair<int, int> > A[maxn];\n map<int, int> X;\n map<int, int> Y;\n int Hx[maxn], Hy[maxn];\n int ans[maxn];\n int fa[maxn];\n int fi(int u) {\n   if (fa[u] == u) return u;\n   return fa[u] = fi(fa[u]);\n }\n void un(int u, int v) {\n   int p1 = fi(u), p2 = fi(v);\n   if (p1 != p2) fa[p1] = p2;\n }\n int main() {\n   int n, m;\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < n * m; i++) {\n     fa[i] = i;\n     scanf('%d', &A[i].first);\n     A[i].second.first = i / m;\n     A[i].second.second = i % m;\n   }\n   int j = -1;\n   sort(A, A + n * m);\n   for (int i = 0; i < n * m; i++) {\n     if (i != n * m - 1 && A[i].first == A[i + 1].first) continue;\n     for (int k = j + 1; k <= i; k++) {\n       int p = A[k].second.first * m + A[k].second.second;\n       int x = A[k].second.first, y = A[k].second.second;\n       Hx[x] = p;\n       Hy[y] = p;\n     }\n     for (int k = j + 1; k <= i; k++) {\n       int p = A[k].second.first * m + A[k].second.second;\n       int x = A[k].second.first, y = A[k].second.second;\n       un(Hx[x], p);\n       un(Hy[y], p);\n     }\n     for (int k = j + 1; k <= i; k++) {\n       int p = A[k].second.first * m + A[k].second.second;\n       int x = A[k].second.first, y = A[k].second.second;\n       int pa = fi(p);\n       ans[pa] = max(ans[pa], max(X[x], Y[y]) + 1);\n     }\n     for (int k = j + 1; k <= i; k++) {\n       int p = A[k].second.first * m + A[k].second.second;\n       int x = A[k].second.first, y = A[k].second.second;\n       X[x] = max(X[x], ans[fi(p)]);\n       Y[y] = max(Y[y], ans[fi(p)]);\n     }\n     j = i;\n   }\n   for (int i = 0; i < n * m; i++) {\n     printf('%d ', ans[fi(i)]);\n     if (i % m == m - 1) printf('\n');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n vector<int> adj[100005], stx, sty;\n long long mx = 0ll, ans[100005];\n int sz[100005], par[100005];\n pair<int, int> centroid = {0, 0};\n bool cmp(int u, int v) { return sz[u] < sz[v]; }\n void dfs(int nw, int bf) {\n   par[nw] = bf;\n   sz[nw] = 1;\n   for (int nx : adj[nw])\n     if (nx != bf) {\n       dfs(nx, nw);\n       sz[nw] += sz[nx];\n     }\n   sort(adj[nw].begin(), adj[nw].end(), cmp);\n   mx += 2 * min(sz[nw], n - sz[nw]);\n   centroid = max(centroid, {min(sz[nw], n - sz[nw]), nw});\n }\n void get_subtree(int nw, int bf, vector<int> &v) {\n   v.push_back(nw);\n   for (int nx : adj[nw])\n     if (nx != bf) get_subtree(nx, nw, v);\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n;\n   for (int u, v, i = 1; i < n; i++) {\n     cin >> u >> v;\n     adj[u].push_back(v);\n     adj[v].push_back(u);\n   }\n   dfs(1, 0);\n   int x = centroid.second, y = par[x];\n   if (sz[x] * 2 > n) swap(x, y);\n   get_subtree(x, y, stx);\n   get_subtree(y, x, sty);\n   for (int i = 0; i < stx.size(); i++) {\n     ans[stx[i]] = sty[i];\n     ans[sty[sty.size() - stx.size() + i]] = stx[i];\n   }\n   for (int i = 0; i < sty.size() - stx.size(); i++)\n     ans[sty[i]] = sty[stx.size() + i];\n   cout << mx << endl;\n   for (int i = 1; i <= n; i++) cout << ans[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int a, b;\n bool temp = false;\n int main() {\n   cin >> a;\n   for (b = 1; b <= 500; b++)\n     if ((b * (b + 1)) / 2 == a) {\n       temp = true;\n       break;\n     }\n   if (temp)\n     cout << 'YES';\n   else\n     cout << 'NO';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 1e5 + 9, lg = 20;\n int n, q, timer = 1;\n vector<int> adj[inf], level[inf];\n int depth[inf], in[inf], out[inf], parent[inf][lg];\n void dfs(int u, int par) {\n   in[u] = timer++;\n   level[depth[u]].push_back(in[u]);\n   for (auto v : adj[u])\n     if (v != par) parent[v][0] = u, depth[v] = depth[u] + 1, dfs(v, u);\n   out[u] = timer++;\n }\n int KthParent(int u, int k) {\n   for (int j = lg - 1; j >= 0; j--)\n     if (k & (1ll << j)) u = parent[u][j];\n   return u;\n }\n int CntLevelInSubtree(int u, int h) {\n   return upper_bound(level[h].begin(), level[h].end(), out[u]) -\n          lower_bound(level[h].begin(), level[h].end(), in[u]);\n }\n int main() {\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     int tmp;\n     cin >> tmp;\n     if (tmp) adj[tmp].push_back(i), adj[i].push_back(tmp);\n   }\n   for (int i = 1; i <= n; i++)\n     if (!in[i]) dfs(i, 0);\n   for (int j = 1; j < lg; j++)\n     for (int i = 1; i <= n; i++) parent[i][j] = parent[parent[i][j - 1]][j - 1];\n   cin >> q;\n   while (q--) {\n     int v, p;\n     cin >> v >> p;\n     if (depth[v] < p) {\n       cout << 0 << ' ';\n       continue;\n     }\n     int u = KthParent(v, p);\n     cout << CntLevelInSubtree(u, depth[v]) - 1 << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n const int maxn = 1000000 + 5;\n int f[maxn], inv[maxn], finv[maxn];\n void init() {\n   inv[1] = 1;\n   for (int i = 2; i < maxn; i++)\n     inv[i] = (mod - mod / i) * 1ll * inv[mod % i] % mod;\n   f[0] = finv[0] = 1;\n   for (int i = 1; i < maxn; i++) {\n     f[i] = f[i - 1] * 1ll * i % mod;\n     finv[i] = finv[i - 1] * 1ll * inv[i] % mod;\n   }\n }\n int C(int n, int m) {\n   if (m < 0 || m > n) return 0;\n   return f[n] * 1ll * finv[n - m] % mod * finv[m] % mod;\n }\n long long qpow(long long x, long long n) {\n   long long r = 1;\n   while (n > 0) {\n     if (n & 1) r = r * x % mod;\n     n >>= 1;\n     x = x * x % mod;\n   }\n   return r;\n }\n long long T(long long n, long long k) {\n   if (k == n) return 1;\n   return k * qpow(n, n - k - 1) % mod;\n }\n int n, m, a, b;\n int main() {\n   init();\n   cin >> n >> m >> a >> b;\n   long long ans = 0;\n   for (int i = 1; i < n; i++) {\n     long long tot = 1ll * C(m - 1, i - 1) * C(n - 2, i - 1) % mod * f[i - 1] %\n                     mod * qpow(m, n - i - 1) % mod * T(n, i + 1) % mod;\n     ans += tot;\n     if (ans >= mod) ans -= mod;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int func1(long long int i) {\n   long long int m = i;\n   return i * (i + 1) * (2 * i + 1) / 6 - (m + m + 2) * i * (i + 1) / 2 +\n          (m + m + 1 + m * m) * i;\n }\n long long int func2(long long int x, long long int i) {\n   return x * (i + i * i - i * (i + 1) / 2);\n }\n int main() {\n   long long int inp, tem, ans = 0, tem2;\n   cin >> inp;\n   vector<pair<long long int, long long int> > v;\n   bool flag = 0;\n   for (int i = 0; i < 100000000; i++)\n     if (ans > 0) ans += 1;\n   ans = 0;\n   for (long long int i = 1; func1(i) <= inp; i++) {\n     tem = inp - func1(i);\n     if (!tem) {\n       flag = 1;\n       v.push_back(make_pair(i, i));\n     } else {\n       tem2 = func2(1, i);\n       if (tem % tem2 == 0) v.push_back(make_pair(i, i + tem / tem2));\n     }\n   }\n   if (!flag)\n     cout << 2 * v.size();\n   else\n     cout << 2 * v.size() - 1;\n   cout << '\n';\n   for (int i = 0; i < v.size(); i++)\n     cout << v[i].first << ' ' << v[i].second << '\n';\n   int i = v.size() - 1;\n   if (flag) i--;\n   for (; i >= 0; i--) cout << v[i].second << ' ' << v[i].first << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n void chkMax(T &x, T y) {\n   if (y > x) x = y;\n }\n template <typename T>\n void chkMin(T &x, T y) {\n   if (y < x) x = y;\n }\n template <typename T>\n void inline read(T &x) {\n   int f = 1;\n   x = 0;\n   char s = getchar();\n   while (s < '0' || s > '9') {\n     if (s == '-') f = -1;\n     s = getchar();\n   }\n   while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();\n   x *= f;\n }\n const int N = 2005;\n int n, f[10][10][10][10][10], g[10][10][10][10][10];\n int ans = 2e9;\n int main() {\n   read(n);\n   memset(f, 0x3f, sizeof f);\n   f[1][0][0][0][0] = 0;\n   for (int i = 1; i <= n; i++) {\n     int x, y;\n     read(x), read(y);\n     memcpy(g, f, sizeof f);\n     memset(f, 0x3f, sizeof f);\n     for (int p = 1; p <= 9; p++) {\n       for (int a = 0; a <= 9; a++) {\n         for (int b = 0; b <= 9; b++) {\n           for (int c = 0; c <= 9; c++) {\n             for (int d = 0; d <= 9; d++) {\n               if (a == 0) {\n                 chkMin(f[x][y][b][c][d], g[p][a][b][c][d] + abs(p - x));\n               }\n               if (b == 0) {\n                 chkMin(f[x][a][y][c][d], g[p][a][b][c][d] + abs(p - x));\n               }\n               if (c == 0) {\n                 chkMin(f[x][a][b][y][d], g[p][a][b][c][d] + abs(p - x));\n               }\n               if (d == 0) {\n                 chkMin(f[x][a][b][c][y], g[p][a][b][c][d] + abs(p - x));\n               }\n             }\n           }\n         }\n       }\n     }\n     for (int a = 9; ~a; a--) {\n       for (int b = 9; ~b; b--) {\n         for (int c = 9; ~c; c--) {\n           for (int d = 9; ~d; d--) {\n             for (int p = 1; p <= 9; p++) {\n               if (a) chkMin(f[a][0][b][c][d], f[p][a][b][c][d] + abs(p - a));\n               if (b) chkMin(f[b][a][0][c][d], f[p][a][b][c][d] + abs(p - b));\n               if (c) chkMin(f[c][a][b][0][d], f[p][a][b][c][d] + abs(p - c));\n               if (d) chkMin(f[d][a][b][c][0], f[p][a][b][c][d] + abs(p - d));\n             }\n           }\n         }\n       }\n     }\n   }\n   for (int i = 1; i <= 9; i++) chkMin(ans, f[i][0][0][0][0]);\n   printf('%d\n', ans + 2 * n);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n #pragma GCC optimize('O3')\n #pragma GCC target('sse4')\n using namespace std;\n template <class T>\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<int> 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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n int main() {\n   unsigned short x;\n   std::cin >> x;\n   (x > 1) ? std::cout << x << ' ' << x : std::cout << -1;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, k, a[300005], b[300005];\n int main() {\n   cin >> n >> k;\n   k--;\n   for (int i = 1; i <= n; i++) cin >> a[i];\n   for (int i = 1; i < n; i++) b[i] = a[i + 1] - a[i];\n   long long res = a[n] - a[1];\n   sort(b + 1, b + n);\n   for (int i = n - 1; i >= n - k; i--) res -= b[i];\n   cout << res;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   char a[3][4];\n   int i, f;\n   for (i = 0; i < 3; i++) scanf('%s', a[i]);\n   if (a[0][0] == a[2][2] && a[0][1] == a[2][1] && a[0][2] == a[2][0] &&\n       a[1][0] == a[1][2])\n     f = 1;\n   else\n     f = 0;\n   if (f == 1)\n     printf('YES\n');\n   else\n     printf('NO\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int T = 31;\n const int mod = 1000000007;\n const long long oo = 1LL << 60;\n long long N;\n int K;\n long long B[T][T];\n long long power[70];\n long long dp[70][T][T];\n bool bio[70];\n long long rot[T][T][T];\n long long mult(long long a, long long b) {\n   if (a == 0) return 0;\n   if (b >= oo / a + 1) return oo;\n   return a * b;\n }\n void mult(long long A[T][T], long long B[T][T]) {\n   static long long C[T][T];\n   for (int i = (0); i < (T); ++i)\n     for (int j = (0); j < (T); ++j) C[i][j] = 0;\n   for (int i = (0); i < (T); ++i)\n     for (int j = (0); j < (T); ++j)\n       for (int k = (0); k < (T); ++k)\n         C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % mod;\n   for (int i = (0); i < (T); ++i)\n     for (int j = (0); j < (T); ++j) A[i][j] = C[i][j];\n }\n void rec(long long prefix, int n, long long A[T][T]) {\n   long long lo = mult(prefix, power[n]);\n   long long hi = lo + power[n] - 1;\n   if (lo >= N) return;\n   long long z = prefix % K;\n   mult(A, rot[z]);\n   if (n == 0) {\n     mult(A, B);\n   } else {\n     bool memo = hi < N;\n     auto AA = memo ? dp[n] : A;\n     if (!bio[n] && memo)\n       for (int i = (0); i < (T); ++i) AA[i][i] = 1;\n     if (!bio[n] || !memo)\n       for (int i = (0); i < (K); ++i) rec(prefix * K + i, n - 1, AA);\n     if (memo) bio[n] = true, mult(A, AA);\n   }\n   mult(A, rot[(K - z) % K]);\n }\n int main() {\n   scanf('%lld%d', &N, &K);\n   for (int i = (0); i < (K); ++i) B[i][i] = 1;\n   for (int i = (1); i < (K); ++i) B[i][0] = 1;\n   B[K][0] = 1;\n   B[K][K] = 1;\n   for (int x = (0); x < (K); ++x)\n     for (int i = (0); i < (K); ++i) rot[x][i][(i + x) % K] = 1;\n   for (int x = (0); x < (K); ++x)\n     for (int i = (K); i < (T); ++i) rot[x][i][i] = 1;\n   static long long A[T][T];\n   A[0][K] = 1;\n   power[0] = 1;\n   for (int i = (1); i < (70); ++i) power[i] = mult(power[i - 1], K);\n   rec(0, 69, A);\n   long long ans = 1;\n   for (int i = (0); i < (K); ++i) ans = (ans + A[0][i]) % mod;\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base ::sync_with_stdio(false);\n   cin.tie(NULL);\n   int n, p, q;\n   cin >> n;\n   vector<pair<int, int>> v1;\n   int x1, x2;\n   for (size_t i = 0; i < n; i++) {\n     cin >> x1 >> x2;\n     v1.push_back(make_pair(x1, x2));\n   }\n   bool s = true;\n   sort(v1.begin(), v1.end());\n   for (size_t i = 0; i < n; i++) {\n     if (v1[i].second > v1[i + 1].second && i + 1 < n) {\n       s = false;\n       break;\n     }\n   }\n   if (s == true) {\n     cout << 'Poor Alex';\n   } else {\n     cout << 'Happy Alex';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100010;\n int n;\n double f1[N], f2[N], f3[N], a[N], ans;\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> n;\n   for (int i = 1; i <= n; ++i) {\n     cin >> a[i];\n     f1[i] = a[i] * (f1[i - 1] + 1);\n     f2[i] = a[i] * (f2[i - 1] + 1 + 2 * f1[i - 1]);\n     f3[i] = a[i] * (f3[i - 1] + 3 * f2[i - 1] + 3 * f1[i - 1] + 1);\n   }\n   for (int i = 1; i <= n + 1; ++i) ans += (1 - a[i]) * f2[i - 1];\n   printf('%.10lf\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n;\n   scanf('%d', &n);\n   printf('%d', n % 2);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> t;\n int n, x, i, j, h, sol, temp;\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> x;\n     t.push_back(x);\n   }\n   cin >> h;\n   sort(t.begin(), t.end());\n   sol = 0;\n   for (i = 0; i < n; i++) {\n     temp = 1;\n     for (j = i + 1; j < n; j++) {\n       if (t[j] - t[i] <= h) temp++;\n     }\n     sol = max(sol, temp);\n   }\n   cout << sol << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 305;\n int n, m;\n class Point {\n  public:\n   long long x, y;\n   Point() : x(0), y(0) {}\n   Point(long long _x, long long _y) : x(_x), y(_y) {}\n   void read() { scanf('%lld%lld', &x, &y); }\n   Point operator+(const Point &o) const { return Point(x + o.x, y + o.y); }\n   Point operator-(const Point &o) const { return Point(x - o.x, y - o.y); }\n   long long operator*(const Point &o) const { return x * o.y - y * o.x; }\n   bool operator<(const Point &o) const {\n     int c = (y == 0 && x > 0) || (y > 0);\n     int oc = (o.y == 0 && o.x > 0) || (o.y > 0);\n     if (c != oc) return c > oc;\n     return (*this) * o > 0;\n   }\n } p[maxn];\n class Edge {\n  public:\n   Point w;\n   int u, v;\n   Edge() {}\n   Edge(Point _w, int _u, int _v) : w(_w), u(_u), v(_v) {}\n   bool operator<(const Edge &o) const { return w < o.w; }\n } e[maxn * maxn];\n long long dp[maxn][maxn][6];\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) p[i].read();\n   for (int i = 0; i < n; i++)\n     for (int j = i + 1; j < n; j++) {\n       e[m++] = Edge(p[j] - p[i], i, j);\n       e[m++] = Edge(p[i] - p[j], j, i);\n     }\n   sort(e, e + m);\n   for (int i = 0; i < n; i++) dp[i][i][0] = 1;\n   for (int i = 0; i < m; i++)\n     for (int j = 0; j < n; j++)\n       for (int k = 0; k < 5; k++) dp[j][e[i].v][k + 1] += dp[j][e[i].u][k];\n   long long ans = 0;\n   for (int i = 0; i < n; i++) ans += dp[i][i][5];\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve() {\n   long long n, x;\n   cin >> n >> x;\n   string second;\n   cin >> second;\n   long long ans = 0;\n   long long sm = 0;\n   for (long long i = 0; i < n; i++) {\n     if (second[i] == '0')\n       sm++;\n     else\n       sm--;\n   }\n   long long c = 0;\n   for (long long i = 0; i < n; i++) {\n     if (sm == 0 && c == x) {\n       cout << -1 << endl;\n       return;\n     }\n     if ((x - c) % sm == 0 && (x - c) / sm >= 0 && sm != 0) ans++;\n     if (second[i] == '0')\n       c++;\n     else\n       c--;\n   }\n   cout << ans << endl;\n }\n int main() {\n   long long t;\n   cin >> t;\n   while (t--) solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct sort_pred {\n   bool operator()(const std::pair<int, int> &left,\n                   const std::pair<int, int> &right) {\n     return right.first > left.first;\n   }\n };\n int n, m, k, t;\n int r = 0;\n vector<bool> visited;\n vector<vector<int>> v;\n vector<int> distanc;\n queue<int> q;\n map<pair<int, int>, int> mp;\n vector<bool> chosen;\n void bfs(int first) {\n   visited[first] = true;\n   q.push(first);\n   while (!q.empty()) {\n     int s = q.front();\n     q.pop();\n     for (auto u : v[s]) {\n       if (distanc[s] - mp[make_pair(s, u)] >= 0 &&\n           distanc[s] - mp[make_pair(s, u)] > distanc[u]) {\n         if (!visited[u]) r++;\n         visited[u] = true;\n         distanc[u] = distanc[s] - mp[make_pair(s, u)];\n         if (chosen[u]) distanc[u] = t;\n         q.push(u);\n       }\n     }\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   map<int, int> mp;\n   vector<int> b(n);\n   for (int i = 0; i < n; i++) {\n     int first;\n     cin >> first;\n     mp[first] = i + 1;\n   }\n   for (int i = 0; i < n; i++) {\n     int first;\n     cin >> first;\n     cout << mp[first] << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n const int inf = 1e9 + 5;\n long long powmod(long long a, long long b) {\n   long long ret = 1;\n   while (b) {\n     if (b & 1) ret = (ret * a) % mod;\n     a = (a * a) % mod;\n     b >>= 1;\n   }\n   return ret;\n }\n const int maxn = 3e5 + 5;\n long long a[maxn];\n int n, m;\n int q[maxn];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   cin >> n;\n   long long tot = 0;\n   for (int i = 0; i <= n - 1; i++) {\n     cin >> a[i];\n     tot += a[i];\n   }\n   sort(a, a + n);\n   cin >> m;\n   for (int i = 0; i <= m - 1; i++) {\n     cin >> q[i];\n     cout << tot - a[n - q[i]] << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 1002000, CAN = 34;\n int n, m, p, vis[MAXN], pr[MAXN], pcnt;\n char w1[MAXN], w2[MAXN];\n vector<int> can[300];\n int muln(int x, int y) { return 1LL * x * y % p; }\n int mo(int x) {\n   while (x >= p) x -= p;\n   while (x < 0) x += p;\n   return x;\n }\n int qpow(int x, int y) {\n   int ret = 1;\n   for (; y; y >>= 1, x = muln(x, x))\n     if (y & 1) ret = muln(ret, x);\n   return ret;\n }\n struct poly {\n   int deg;\n   vector<int> a;\n   poly(int x = 0) : deg(x) { a.resize(x + 1, 0); }\n   int& operator[](int idx) { return a[idx]; }\n   void print(string s) {\n     cerr << 'Poly ' << s << ': ';\n     for (auto g : a) printf('%d ', g);\n     cerr << endl;\n   }\n   int at(int x) {\n     x = mo(x);\n     int ret = 0;\n     for (int i = deg; i >= 0; --i) ret = mo(muln(ret, x) + mo(a[i]));\n     return ret;\n   }\n   void norm() {\n     for (auto& g : a) g = mo(g);\n   }\n } I;\n void sieve() {\n   for (int i = 2; i <= 1000000; ++i) {\n     if (!vis[i]) {\n       pr[++pcnt] = i;\n     }\n     for (int j = 1; j <= pcnt && i * pr[j] <= 1000000; ++j) {\n       vis[i * pr[j]] = true;\n       if (i % pr[j] == 0) break;\n     }\n   }\n   for (int k = 1, i = pr[k]; k <= pcnt; i = pr[++k]) {\n     if (i > m)\n       for (int j = 1; j <= CAN; ++j)\n         if ((i - 1) % pr[j] == 0) can[j].push_back(i);\n   }\n }\n void sol(int opt) {\n   int d = pr[opt];\n   poly a(d - 1);\n   for (int i = 0; i < n; ++i) a[i % d] += I[i];\n   for (auto pri : can[opt]) {\n     p = pri;\n     int rr = 2;\n     while (qpow(rr, (p - 1) / d) == 1) rr++;\n     rr = qpow(rr, (p - 1) / d);\n     for (int Cnt = 1; Cnt < d; ++Cnt) {\n       int r = qpow(rr, Cnt);\n       if (r < 2 || r > p - 2) continue;\n       int val = a.at(r);\n       if (val == 0) {\n         printf('%d %d\n', p, r);\n         exit(0);\n       }\n     }\n   }\n }\n int main() {\n   scanf('%d%d%s%s', &n, &m, w1, w2);\n   sieve();\n   I = poly(n - 1);\n   for (int i = 0; i < n; ++i) I[i] = w1[i] - w2[i];\n   for (int i = 1; i <= CAN; ++i) sol(i);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int a[100007], ans[100007], vis[100007];\n int count(int x) {\n   int cnt = 0, now = 0;\n   memset(vis, 255, sizeof(vis));\n   for (int i = 1; i <= n; i++) {\n     if (vis[a[i]] == now) continue;\n     vis[a[i]] = now;\n     if (++cnt > x) {\n       cnt = 1;\n       vis[a[i]] = ++now;\n     }\n   }\n   return now + 1;\n }\n void work(int l, int r) {\n   if (l > r) return;\n   int cnt1 = count(l), cnt2 = count(r);\n   if (cnt1 == cnt2) {\n     for (int i = l; i <= r; i++) ans[i] = cnt1;\n     return;\n   }\n   ans[l] = cnt1;\n   ans[r] = cnt2;\n   int mid = (l + r) >> 1;\n   work(l + 1, mid);\n   work(mid + 1, r - 1);\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]);\n   work(1, n);\n   for (int i = 1; i <= n; i++) printf('%d ', ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 1e5 + 5;\n int32_t main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   long long n;\n   cin >> n;\n   long long a[n];\n   for (long long i = 0; i < n; i++) cin >> a[i];\n   vector<long long> good, bad;\n   for (long long i = 0; i < n; i++) {\n     long long val = sqrt(a[i]);\n     if (val * val == a[i])\n       good.push_back(a[i]);\n     else\n       bad.push_back(a[i]);\n   }\n   long long sz1 = good.size(), sz2 = bad.size();\n   if (sz1 == sz2) {\n     cout << 0 << '\n';\n   } else if (sz1 > sz2) {\n     long long nz = 0;\n     for (auto it : good) {\n       if (it) nz++;\n     }\n     long long req = (sz1 - sz2) / 2;\n     if (nz >= req)\n       cout << req << '\n';\n     else\n       cout << nz + (req - nz) * 2 << '\n';\n   } else {\n     vector<long long> ans;\n     long long req = (sz2 - sz1) / 2;\n     for (auto it : bad) {\n       long long val = sqrt(it);\n       long long down = it - val * val, up = (val + 1) * (val + 1) - it;\n       ans.push_back(min(down, up));\n     }\n     sort(ans.begin(), ans.end());\n     long long fans = 0;\n     for (long long i = 0; i < req; i++) {\n       fans += ans[i];\n     }\n     cout << fans << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = (1 << 22) + 5;\n int n, m;\n bool is[MAX], seen[MAX];\n int conj(int x) {\n   int r = 0;\n   for (int i = 0; i < n; ++i)\n     if (!(x & (1 << i))) r += (1 << i);\n   return r;\n }\n void dfs(int st, bool p = 0) {\n   if (seen[st]) return;\n   seen[st] = 1;\n   if (is[st]) dfs(conj(st), 1);\n   if (p) {\n     for (int i = 0; i < n; ++i)\n       if (st & (1 << i)) {\n         dfs(st - (1 << i), 1);\n       }\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0), cout.tie(0);\n   cin >> n >> m;\n   vector<int> st((1 << n) + 1, 0);\n   vector<bool> lz((1 << n) + 1, 0);\n   for (int i = 0; i < m; ++i) {\n     int x;\n     cin >> x;\n     is[x] = 1;\n   }\n   int cnt = 0;\n   for (int i = 0; i < (1 << n); ++i) {\n     if (!seen[i] && is[i]) {\n       dfs(i);\n       ++cnt;\n     }\n   }\n   cout << cnt << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main(void) {\n   long long int n, x;\n   cin >> n;\n   vector<vector<long long int> > a(n);\n   for (long long int i = 0; i < n; i++) {\n     cin >> x;\n     for (long long int j = 0; j < x; j++) {\n       long long int tp;\n       cin >> tp;\n       a[i].push_back(tp);\n     }\n   }\n   long long int a1 = 0, b = 0;\n   vector<long long int> q;\n   for (long long int i = 0; i < n; i++) {\n     long long int f = a[i].size();\n     if (f % 2 != 0) {\n       for (long long int j = 0; j < (f - 1) / 2; j++) {\n         a1 += a[i][j];\n       }\n       for (long long int j = (f - 1) / 2 + 1; j < f; j++) {\n         b += a[i][j];\n       }\n       q.push_back(a[i][(f - 1) / 2]);\n     } else {\n       for (long long int j = 0; j < f / 2; j++) {\n         a1 += a[i][j];\n       }\n       for (long long int j = f / 2; j < f; j++) {\n         b += a[i][j];\n       }\n     }\n   }\n   sort(q.begin(), q.end(), greater<long long int>());\n   for (long long int k = 0; k < q.size(); k++) {\n     if (k % 2 == 0)\n       a1 += q[k];\n     else\n       b += q[k];\n   }\n   cout << a1 << ' ' << b;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxN = 3 * (int)1e5 + 100;\n int b[maxN];\n int t[4 * maxN];\n int a[maxN];\n void build(int v, int tl, int tr) {\n   if (tl == tr) {\n     t[v] = a[tl];\n     return;\n   }\n   int tm = (tl + tr) / 2;\n   build(v + v, tl, tm);\n   build(v + v + 1, tm + 1, tr);\n   t[v] = min(t[v + v], t[v + v + 1]);\n }\n void upd(int v, int tl, int tr, int pos, int val) {\n   if (tl == tr) {\n     t[v] = val;\n     return;\n   }\n   int tm = (tl + tr) / 2;\n   if (pos <= tm)\n     upd(v + v, tl, tm, pos, val);\n   else\n     upd(v + v + 1, tm + 1, tr, pos, val);\n   t[v] = min(t[v + v], t[v + v + 1]);\n }\n const int INF = (int)1e9 + 100;\n int get(int v, int tl, int tr, int l, int r) {\n   if (l > r) return INF;\n   if (tl == l && tr == r) {\n     return t[v];\n   }\n   int tm = (tl + tr) / 2;\n   return min(get(v + v, tl, tm, l, min(r, tm)),\n              get(v + v + 1, tm + 1, tr, max(l, tm + 1), r));\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   int q;\n   cin >> q;\n   while (q--) {\n     int n;\n     cin >> n;\n     set<pair<int, int> > s;\n     for (int i = 1; i <= n; i++) {\n       cin >> a[i];\n       s.insert(make_pair(a[i], i));\n     }\n     bool ok = true;\n     build(1, 1, n);\n     for (int i = 1; i <= n; i++) {\n       cin >> b[i];\n       if (!ok) continue;\n       auto it = s.lower_bound(make_pair(b[i], -1));\n       if (it == s.end() || ((it->first) != b[i])) {\n         ok = false;\n         continue;\n       }\n       int ind = (it->second);\n       s.erase(it);\n       if (b[i] != get(1, 1, n, 1, ind)) {\n         ok = false;\n       }\n       upd(1, 1, n, ind, INF);\n     }\n     if (ok)\n       cout << 'YES' << '\n';\n     else\n       cout << 'NO' << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[11];\n int main() {\n   int i, n, m, x;\n   while (scanf('%d', &a[0]) > 0) {\n     int c[33] = {0};\n     c[a[0]]++;\n     for ((i) = 0; (i) < (5); (i)++) {\n       scanf('%d', &a[i + 1]);\n       c[a[i + 1]]++;\n     }\n     bool f = 0;\n     int mx = 0;\n     for ((i) = 0; (i) < (11); (i)++) {\n       mx = max(mx, c[i]);\n       c[i] = c[i] % 4;\n       if (c[i] == 2) f = 1;\n     }\n     if (mx < 4)\n       printf('Alien\n');\n     else if (f)\n       printf('Elephant\n');\n     else\n       printf('Bear\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int MAXN = 2000 + 10;\n const int INF = std::numeric_limits<int>::max();\n const double EPS = 1e-6;\n const int dx[] = {1, 0, -1, 0};\n const int dy[] = {0, 1, 0, -1};\n int a[MAXN][MAXN];\n std::deque<std::pair<std::pair<int, int>, int>> q;\n using std::cin;\n using std::cout;\n using std::endl;\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   std::cin.tie(0);\n   std::cout.tie(0);\n   int n, m;\n   cin >> n >> m;\n   int r, c;\n   cin >> r >> c;\n   int x, y;\n   cin >> x >> y;\n   for (int i = 0; i <= n + 1; ++i) {\n     for (int j = 0; j <= m + 1; ++j) {\n       a[i][j] = -1;\n     }\n   }\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= m; ++j) {\n       char c;\n       cin >> c;\n       if (c == '.') a[i][j] = INF;\n     }\n   }\n   q.push_back({{r, c}, 0});\n   a[r][c] = 0;\n   while (!q.empty()) {\n     int cur_x = q.front().first.first, cur_y = q.front().first.second,\n         cur_step = q.front().second;\n     q.pop_front();\n     for (int i = 0; i < 4; ++i) {\n       if (a[cur_x + dx[i]][cur_y + dy[i]] > cur_step + (dy[i] == -1)) {\n         a[cur_x + dx[i]][cur_y + dy[i]] = cur_step + (dy[i] == -1);\n         if (dy[i] == -1)\n           q.push_back({{cur_x + dx[i], cur_y + dy[i]}, cur_step + 1});\n         else\n           q.push_front({{cur_x + dx[i], cur_y + dy[i]}, cur_step});\n       }\n     }\n   }\n   int ans = 0;\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= m; ++j) {\n       if (a[i][j] != -1) {\n         if (a[i][j] <= x && a[i][j] + j - c <= y) {\n           ++ans;\n         }\n       }\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast,unroll-loops,no-stack-protector,fast-math,inline')\n #pragma GCC target( \\n     'sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native')\n using namespace std;\n template <typename T>\n ostream &operator<<(ostream &os, const vector<T> &v) {\n   os << '{';\n   string sep;\n   for (const auto &x : v) os << sep << x, sep = ', ';\n   return os << '}';\n }\n template <typename A, typename B>\n ostream &operator<<(ostream &os, const pair<A, B> &p) {\n   return os << '(' << p.first << ', ' << p.second << ')';\n }\n void dbg_out() { cerr << endl; }\n template <typename Head, typename... Tail>\n void dbg_out(Head H, Tail... T) {\n   cerr << ' ' << H;\n   dbg_out(T...);\n }\n template <const int &MOD>\n struct _m_int {\n   int val;\n   _m_int(int64_t v = 0) {\n     if (v < 0) v = v % MOD + MOD;\n     if (v >= MOD) v %= MOD;\n     val = v;\n   }\n   static int inv_mod(int a, int m = MOD) {\n     int g = m, r = a, x = 0, y = 1;\n     while (r != 0) {\n       int q = g / r;\n       g %= r;\n       swap(g, r);\n       x -= q * y;\n       swap(x, y);\n     }\n     return x < 0 ? x + m : x;\n   }\n   explicit operator int() const { return val; }\n   explicit operator int64_t() const { return val; }\n   _m_int &operator+=(const _m_int &other) {\n     val -= MOD - other.val;\n     if (val < 0) val += MOD;\n     return *this;\n   }\n   _m_int &operator-=(const _m_int &other) {\n     val -= other.val;\n     if (val < 0) val += MOD;\n     return *this;\n   }\n   static unsigned fast_mod(uint64_t x, unsigned m = MOD) {\n     return x % m;\n     unsigned x_high = x >> 32, x_low = (unsigned)x;\n     unsigned quot, rem;\n     asm('divl %4\n' : '=a'(quot), '=d'(rem) : 'd'(x_high), 'a'(x_low), 'r'(m));\n     return rem;\n   }\n   _m_int &operator*=(const _m_int &other) {\n     val = fast_mod((uint64_t)val * other.val);\n     return *this;\n   }\n   _m_int &operator/=(const _m_int &other) { return *this *= other.inv(); }\n   friend _m_int operator+(const _m_int &a, const _m_int &b) {\n     return _m_int(a) += b;\n   }\n   friend _m_int operator-(const _m_int &a, const _m_int &b) {\n     return _m_int(a) -= b;\n   }\n   friend _m_int operator*(const _m_int &a, const _m_int &b) {\n     return _m_int(a) *= b;\n   }\n   friend _m_int operator/(const _m_int &a, const _m_int &b) {\n     return _m_int(a) /= b;\n   }\n   _m_int &operator++() {\n     val = val == MOD - 1 ? 0 : val + 1;\n     return *this;\n   }\n   _m_int &operator--() {\n     val = val == 0 ? MOD - 1 : val - 1;\n     return *this;\n   }\n   _m_int operator++(int) {\n     _m_int before = *this;\n     ++*this;\n     return before;\n   }\n   _m_int operator--(int) {\n     _m_int before = *this;\n     --*this;\n     return before;\n   }\n   _m_int operator-() const { return val == 0 ? 0 : MOD - val; }\n   bool operator==(const _m_int &other) const { return val == other.val; }\n   bool operator!=(const _m_int &other) const { return val != other.val; }\n   _m_int inv() const { return inv_mod(val); }\n   _m_int pow(int64_t p) const {\n     if (p < 0) return inv().pow(-p);\n     _m_int a = *this, result = 1;\n     while (p > 0) {\n       if (p & 1) result *= a;\n       a *= a;\n       p >>= 1;\n     }\n     return result;\n   }\n   friend ostream &operator<<(ostream &os, const _m_int &m) {\n     return os << m.val;\n   }\n };\n extern const int MOD = 998244353;\n using mod_int = _m_int<MOD>;\n const int BITS = 53;\n template <typename T>\n struct xor_basis {\n   T basis[BITS];\n   int n = 0;\n   T min_value(T start) const {\n     if (n == BITS) return 0;\n     for (int i = 0; i < n; i++) start = min(start, start ^ basis[i]);\n     return start;\n   }\n   T max_value(T start = 0) const {\n     if (n == BITS) return ((T)1 << BITS) - 1;\n     for (int i = 0; i < n; i++) start = max(start, start ^ basis[i]);\n     return start;\n   }\n   bool add(T x) {\n     x = min_value(x);\n     if (x == 0) return false;\n     basis[n++] = x;\n     for (int k = n - 1; k > 0 && basis[k] > basis[k - 1]; k--)\n       swap(basis[k], basis[k - 1]);\n     return true;\n   }\n   void merge(const xor_basis<T> &other) {\n     for (int i = 0; i < other.n && n < BITS; i++) add(other.basis[i]);\n   }\n   void merge(const xor_basis<T> &a, const xor_basis<T> &b) {\n     if (a.n > b.n) {\n       *this = a;\n       merge(b);\n     } else {\n       *this = b;\n       merge(a);\n     }\n   }\n };\n int N, M, B;\n vector<int64_t> basis;\n vector<int64_t> answers;\n void generate_all() {\n   vector<int64_t> change(B + 1, 0);\n   int64_t prefix = 0;\n   for (int i = 0; i < B; i++) {\n     prefix ^= basis[i];\n     change[i] = prefix;\n   }\n   change[B] = prefix;\n   int64_t value = 0;\n   for (unsigned mask = 0; mask < 1U << B; mask++) {\n     answers[__builtin_popcountll(value)]++;\n     value ^= change[__builtin_ctz(mask + 1)];\n   }\n }\n void dp_on_repeats() {\n   ;\n   for (int i = 0; i < B; i++)\n     for (int j = i + 1; j < B; j++)\n       basis[i] = min(basis[i], basis[i] ^ basis[j]);\n   ;\n   vector<int> repeats;\n   for (int bit = 0; bit < M; bit++) {\n     int count = 0;\n     for (int i = 0; i < B; i++)\n       if (basis[i] >> bit & 1) count++;\n     if (count > 1) repeats.push_back(bit);\n   }\n   int R = repeats.size();\n   vector<pair<int, int>> options(B);\n   int count_sum = 0;\n   for (int i = 0; i < B; i++) {\n     int64_t value = basis[i];\n     int count = __builtin_popcountll(value);\n     int repeat_mask = 0;\n     for (int r = 0; r < R; r++)\n       if (value >> repeats[r] & 1) {\n         count--;\n         repeat_mask |= 1 << r;\n       }\n     options[i] = {count, repeat_mask};\n     count_sum += count;\n   };\n   sort(options.begin(), options.end());\n   if (R <= 20) {\n     vector<vector<int64_t>> dp(count_sum + 1, vector<int64_t>(1 << R, 0));\n     dp[0][0] = 1;\n     int max_count = 0;\n     for (pair<int, int> &option : options) {\n       int opt_count = option.first;\n       int opt_mask = option.second;\n       for (int count = max_count; count >= 0; count--)\n         for (int mask = 0; mask < 1 << R; mask++)\n           dp[count + opt_count][mask ^ opt_mask] += dp[count][mask];\n       max_count += opt_count;\n     }\n     for (int count = 0; count <= count_sum; count++)\n       for (int mask = 0; mask < 1 << R; mask++)\n         if (dp[count][mask] > 0)\n           answers[count + __builtin_popcount(mask)] += dp[count][mask];\n   } else {\n     vector<vector<unsigned>> dp(count_sum - 1, vector<unsigned>(1 << R, 0));\n     int max_count = 0;\n     for (pair<int, int> &option : options) {\n       int opt_count = option.first;\n       int opt_mask = option.second;\n       for (int count = min(max_count - 1, count_sum - 1 - opt_count - 1);\n            count >= 0; count--)\n         for (int mask = 0; mask < 1 << R; mask++)\n           dp[count + opt_count][mask ^ opt_mask] += dp[count][mask];\n       dp[opt_count - 1][opt_mask]++;\n       max_count += opt_count;\n     }\n     for (int count = 0; count < count_sum - 1; count++)\n       for (int mask = 0; mask < 1 << R; mask++)\n         if (dp[count][mask] > 0)\n           answers[count + 1 + __builtin_popcount(mask)] += dp[count][mask];\n     int everything = 0;\n     for (int i = 0; i < B; i++) everything ^= options[i].second;\n     answers[count_sum + __builtin_popcount(everything)]++;\n     answers[0]++;\n   }\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cin >> N >> M;\n   xor_basis<int64_t> basis_obj;\n   for (int i = 0; i < N; i++) {\n     int64_t a;\n     cin >> a;\n     basis_obj.add(a);\n   }\n   B = basis_obj.n;\n   basis.resize(B);\n   for (int i = 0; i < B; i++) basis[i] = basis_obj.basis[i];\n   answers.assign(M + 1, 0);\n   if (B <= 0.57 * M)\n     generate_all();\n   else\n     dp_on_repeats();\n   for (int i = 0; i <= M; i++) {\n     mod_int answer = answers[i];\n     answer *= mod_int(2).pow(N - B);\n     cout << answer << (i < M ? ' ' : '\n');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n int g[405][405];\n vector<int> v[405];\n double ans;\n double gai[405];\n double pos[405];\n double suan(int yi, int juli) {\n   memset(gai, 0, sizeof(gai));\n   for (int i = 1; i <= n; i++) {\n     if (g[i][yi] == juli) {\n       for (int j = 0; j < (int)v[i].size(); j++) {\n         gai[v[i][j]] += 1.0 / n / (int)v[i].size();\n       }\n     }\n   }\n   vector<int> r;\n   r.clear();\n   for (int i = 1; i <= n; i++)\n     if (gai[i]) r.push_back(i);\n   double ret = 0;\n   for (int i = 1; i <= n; i++) {\n     double tmp = 0;\n     for (int j = 0; j < (int)r.size(); j++) {\n       pos[g[i][r[j]]] = max(pos[g[i][r[j]]], gai[r[j]]);\n     }\n     for (int j = 0; j < (int)r.size(); j++) {\n       tmp += pos[g[i][r[j]]];\n       pos[g[i][r[j]]] = 0;\n     }\n     ret = max(ret, tmp);\n   }\n   return ret;\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= n; j++)\n       if (i != j) g[i][j] = 199912310;\n   }\n   for (int i = 1; i <= m; i++) {\n     int x, y, z;\n     scanf('%d%d', &x, &y);\n     g[x][y] = 1;\n     g[y][x] = 1;\n     v[x].push_back(y);\n     v[y].push_back(x);\n   }\n   for (int k = 1; k <= n; k++) {\n     for (int i = 1; i <= n; i++) {\n       for (int j = 1; j <= n; j++)\n         g[i][j] = g[j][i] = min(g[i][j], g[i][k] + g[k][j]);\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     double now = 0;\n     for (int dist = 0; dist < n; dist++) {\n       int cnt = 0;\n       for (int j = 1; j <= n; j++) {\n         if (g[i][j] == dist) cnt++;\n       }\n       if (!cnt) continue;\n       double p = 1.0 / n;\n       double q = suan(i, dist);\n       now += max(p, q);\n     }\n     ans = max(ans, now);\n   }\n   printf('%.8lf\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool voltea;\n int A[100005], B[100005], I[100005], D[100005], R[100005], ctos, hay, x, y, mid,\n     en;\n int Z[100005], grande;\n void lis() {\n   B[1] = A[1];\n   if (voltea)\n     D[ctos] = 1;\n   else\n     I[1] = 1;\n   hay = 1;\n   for (int i = 2; i <= ctos; i++) {\n     if (A[i] > B[hay]) {\n       ++hay;\n       B[hay] = A[i];\n       en = hay;\n     } else {\n       x = 1;\n       y = hay;\n       while (x < y) {\n         mid = (x + y) / 2;\n         if (B[mid] < A[i]) {\n           x = mid + 1;\n         } else {\n           y = mid;\n         }\n       }\n       B[x] = A[i];\n       en = x;\n     }\n     if (voltea) {\n       D[ctos - i + 1] = en;\n     } else {\n       I[i] = en;\n     }\n   }\n }\n int main() {\n   scanf('%d', &ctos);\n   for (int i = 1; i <= ctos; i++) {\n     scanf('%d', &A[i]);\n   }\n   lis();\n   voltea = true;\n   x = 1;\n   y = ctos;\n   while (x < y) {\n     swap(A[x], A[y]);\n     A[x] *= -1;\n     A[y] *= -1;\n     ++x;\n     --y;\n   }\n   if (x == y) {\n     A[x] *= -1;\n   }\n   lis();\n   grande = 1;\n   for (int i = 1; i <= ctos; i++) {\n     if (I[i] + D[i] - 1 > grande) {\n       grande = I[i] + D[i] - 1;\n     }\n   }\n   for (int i = 1; i <= ctos; i++) {\n     if (I[i] + D[i] - 1 == grande) {\n       Z[I[i]]++;\n     } else {\n       R[i] = 1;\n     }\n   }\n   for (int i = 1; i <= ctos; i++) {\n     if (R[i] == 0) {\n       R[i] = 2;\n       if (Z[I[i]] == 1) {\n         R[i] = 3;\n       }\n     }\n     printf('%d', R[i]);\n   }\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int a, b, c;\n   cin >> a >> b >> c;\n   if (a >= c || b >= c) {\n     cout << '0';\n   } else if (a <= 0 && b <= 0) {\n     cout << '-1';\n   } else {\n     long long int count = 0;\n     while (a < c && b < c) {\n       if (a > b) {\n         swap(a, b);\n       } else if (a < 0) {\n         count += (abs(a) / b + (abs(a) % b != 0));\n         if (abs(a) % b) {\n           long long int r = abs(a) % b;\n           a = (b - r);\n         } else {\n           a = 0;\n         }\n       } else {\n         long long int p = b;\n         b += a;\n         a = p;\n         count++;\n       }\n     }\n     cout << count;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n char map[2][9][9];\n int now[2][9][9], dx[] = {-1, -1, 0, 1, 1, 1, 0, -1, 0},\n                   dy[] = {0, 1, 1, 1, 0, -1, -1, -1, 0};\n int main() {\n   for (int i = 0; i < 8; i++) scanf('%s', map[0][i]);\n   bool a = 0;\n   now[a][7][0] = 1;\n   int sta = 0;\n   while (sta == 0) {\n     memset(now[!a], 0, sizeof(now[!a]));\n     memset(map[!a], 0, sizeof(map[!a]));\n     for (int i = 1; i < 8; i++)\n       for (int j = 0; j < 8; j++)\n         if (map[a][i - 1][j] == 'S') map[!a][i][j] = 'S';\n     for (int i = 0; i < 8; i++)\n       for (int j = 0; j < 8; j++)\n         if (now[a][i][j])\n           for (int k = 0; k < 9; k++) {\n             int x = i + dx[k], y = j + dy[k];\n             if (x < 0 || x > 7 || y < 0 || y > 7 || map[a][x][y] == 'S')\n               continue;\n             now[!a][x][y] = 1;\n           }\n     if (now[!a][0][7]) {\n       sta = 1;\n       continue;\n     }\n     bool alive = 0;\n     for (int i = 0; i < 8; i++)\n       for (int j = 0; j < 8; j++)\n         if (map[!a][i][j] == 'S')\n           now[!a][i][j] = 0;\n         else if (now[!a][i][j] == 1)\n           alive = 1;\n     if (alive == 0) sta = 2;\n     a = !a;\n   }\n   puts(sta == 1 ? 'WIN' : 'LOSE');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1000000000;\n const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\n const int dir_8[8][2] = {{1, 0},  {1, 1},   {0, 1},  {-1, 1},\n                          {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\n int par[200010], r[200010], lar[200010];\n void init() {\n   for (int i = 0; i < 200010; i++) {\n     par[i] = i;\n     r[i] = 0;\n     lar[i] = 1;\n   }\n }\n int find(int x) {\n   if (par[x] == x) return x;\n   return par[x] = find(par[x]);\n }\n bool same(int x, int y) { return find(x) == find(y); }\n void unit(int x, int y) {\n   if (same(x, y)) return;\n   x = find(x);\n   y = find(y);\n   if (r[x] < r[y]) {\n     par[x] = y;\n     lar[y] += lar[x];\n   } else {\n     par[y] = x;\n     lar[x] += lar[y];\n     if (r[x] == r[y]) {\n       r[x]++;\n     }\n   }\n }\n int main() {\n   static int n;\n   static int a[200010];\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n   }\n   init();\n   bool used[200010];\n   for (int i = 0; i < 200010; i++) {\n     used[i] = false;\n   }\n   vector<pair<int, int> > vec;\n   for (int i = 1; i <= n; i++) {\n     vec.push_back(pair<int, int>(a[i], i));\n   }\n   sort(vec.begin(), vec.end());\n   reverse(vec.begin(), vec.end());\n   int ans[200010];\n   int k = 1;\n   for (int i = 0; i < vec.size(); i++) {\n     pair<int, int> p = vec[i];\n     used[p.second] = true;\n     if (used[p.second - 1]) {\n       unit(p.second, p.second - 1);\n     }\n     if (used[p.second + 1]) {\n       unit(p.second, p.second + 1);\n     }\n     for (; k <= lar[find(p.second)]; k++) {\n       ans[k] = p.first;\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     printf('%d ', ans[i]);\n   }\n   puts('');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100 + 7;\n int n;\n map<pair<int, int>, int> id;\n vector<int> g[N];\n long double rep(long double x) {\n   if (x >= 2) {\n     x -= 2;\n   }\n   return x;\n }\n void dfs(int a, int p = 0, long double t = 0) {\n   int deg = (int)g[a].size();\n   long double jump = 2 / (long double)deg;\n   for (auto &b : g[a]) {\n     if (b == p) continue;\n     t = rep(t + jump);\n     cout << 1 << ' ' << id[{a, b}] << ' ';\n     if (t <= 1) {\n       cout << b << ' ' << a << ' ' << fixed << setprecision(6) << 1 - t << '\n';\n     } else {\n       cout << a << ' ' << b << ' ' << fixed << setprecision(6) << 1 - rep(t + 1)\n            << '\n';\n     }\n     dfs(b, a, rep(t + 1));\n   }\n }\n signed main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n;\n   for (int i = 1; i < n; i++) {\n     int x, y;\n     cin >> x >> y;\n     id[{x, y}] = i;\n     id[{y, x}] = i;\n     g[x].push_back(y);\n     g[y].push_back(x);\n   }\n   int root = 1;\n   cout << n - 1 << '\n';\n   dfs(root);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const double eps = 1e-8;\n const double pi = acos(-1.0);\n const int INF = 0x7f7f7f7f;\n const double inf = 1e50;\n template <class T>\n inline T minx(T a, T b) {\n   return (a == -1 || b < a) ? b : a;\n }\n template <class T>\n inline T gcd(T a, T b) {\n   return b ? gcd(b, a % b) : a;\n }\n template <class T>\n inline T lcm(T a, T b) {\n   return a * (b / gcd(a, b));\n }\n template <class T>\n inline T getbit(T n) {\n   return n ? (1 + getbit(n & (n - 1))) : 0;\n }\n template <class T>\n inline T lowbit(T n) {\n   return n & (-n);\n }\n using namespace std;\n pair<double, double> parse(double x, double y) { return make_pair(x, y); }\n int main() {\n   int i, j, k;\n   pair<double, double> A, B, C;\n   double x, y;\n   double dx, dy, tx, ty;\n   while (cin >> x >> y) {\n     A = parse(x, y);\n     cin >> x >> y;\n     B = parse(x, y);\n     cin >> x >> y;\n     C = parse(x, y);\n     dx = B.first - A.first;\n     dy = B.second - A.second;\n     tx = C.first - B.first;\n     ty = C.second - B.second;\n     double res = dx * ty - dy * tx;\n     if (res == 0)\n       puts('TOWARDS');\n     else if (res > 0)\n       puts('LEFT');\n     else\n       puts('RIGHT');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1000000009;\n const int maxn = 1000010;\n long long p[maxn], q[maxn];\n int main() {\n   int i, n;\n   long long nAns = 0;\n   cin >> n;\n   n /= 2;\n   p[1] = 2;\n   q[1] = 1;\n   for (i = 2; i <= n; i++) {\n     p[i] = p[i - 1] * 2 % mod;\n     q[i] = q[i - 1] * (p[i] - 3) % mod;\n     nAns = (nAns + q[i] * 4) % mod;\n   }\n   cout << (2 * nAns * nAns % mod + nAns * 8 % mod + 10) % mod << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int maxn = 1e5 + 7;\n int main(int argc, char *argv[]) {\n   std::ios::sync_with_stdio(false);\n   std::cin.tie(0);\n   int n, k;\n   std::set<std::pair<int, int> > t[maxn], s;\n   std::cin >> n >> k;\n   int u, v, w;\n   int ans = 0;\n   for (int i = 0; i < n - 1; i++) {\n     std::cin >> u >> v >> w;\n     t[u].insert(std::make_pair(v, w));\n     t[v].insert(std::make_pair(u, w));\n   }\n   for (int i = 1; i <= n; i++) {\n     if (t[i].size() == 1) {\n       s.insert(std::make_pair((*t[i].begin()).second, i));\n     }\n   }\n   while (n > k || s.size() > 2) {\n     auto i = *s.begin();\n     s.erase(i);\n     int cur = i.second;\n     ans = i.first;\n     n--;\n     int nxt = (*t[cur].begin()).first;\n     t[nxt].erase(t[nxt].lower_bound(std::make_pair(cur, 0)));\n     if (t[nxt].size() == 1) {\n       s.insert(std::make_pair((*t[nxt].begin()).second + ans, nxt));\n     }\n   }\n   std::cout << ans << std::endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 3e3 + 5;\n const int MOD = 1e9 + 7;\n int N, M, A, B;\n int G[MAXN * MAXN], X, Y, Z;\n int H[MAXN][MAXN];\n int P[MAXN][MAXN];\n int T[MAXN][MAXN];\n long long ans;\n deque<pair<int, int> > qu;\n void reset() { qu.clear(); }\n void push(int v, int p) {\n   while (qu.size() && qu.back().first >= v) {\n     qu.pop_back();\n   }\n   qu.push_back({v, p});\n }\n int pop(int p) {\n   while (qu.size() && qu.front().second < p) {\n     qu.pop_front();\n   }\n   assert(qu.size());\n   return qu.front().first;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> N >> M >> A >> B;\n   cin >> G[0] >> X >> Y >> Z;\n   for (int i = 1; i < N * M; i++) {\n     G[i] = (1LL * G[i - 1] * X + Y) % Z;\n   }\n   for (int i = 0; i < N; i++) {\n     for (int j = 0; j < M; j++) {\n       H[i][j] = G[i * M + j];\n     }\n   }\n   for (int i = 0; i < N; i++) {\n     reset();\n     for (int j = 0; j < B; j++) push(H[i][j], j);\n     P[i][B - 1] = pop(0);\n     for (int j = B; j < M; j++) {\n       push(H[i][j], j);\n       P[i][j] = pop(j - B + 1);\n     }\n   }\n   for (int j = B - 1; j < M; j++) {\n     reset();\n     for (int i = 0; i < A; i++) push(P[i][j], i);\n     ans += pop(0);\n     for (int i = A; i < N; i++) {\n       push(P[i][j], i);\n       ans += pop(i - A + 1);\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int withoutzero(int x);\n int main() {\n   int a, b, c, d, e, f;\n   cin >> a >> b;\n   d = withoutzero(a);\n   e = withoutzero(b);\n   c = a + b;\n   f = withoutzero(c);\n   if ((d + e) == f) {\n     cout << 'YES';\n   } else {\n     cout << 'NO';\n   }\n }\n int withoutzero(int x) {\n   int arr[10], i = 0, t = 0, k = 0;\n   while (x > 0) {\n     arr[i] = x % 10;\n     x = x / 10;\n     i++;\n   }\n   for (int j = 0; j < i; j++) {\n     if (arr[j] != 0) {\n       t += arr[j] * pow(10, k);\n       k++;\n     }\n   }\n   return t;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long f[100000 + 1], a[100000 + 1], n, d, b;\n int main() {\n   scanf('%lld%lld%lld', &n, &d, &b);\n   for (int i = 1; i <= n; i++) scanf('%lld', &a[i]);\n   f[0] = 0;\n   for (int i = 1; i <= n; i++) f[i] += f[i - 1] + a[i];\n   long long a1 = 0, a2 = 0;\n   for (long long i = 1; i <= n / 2; i++) {\n     if (f[min(n, i + i * d)] >= (a1 + 1) * b) ++a1;\n     if (f[n] - f[max((long long)1, n - i - i * d)] >= (a2 + 1) * b) ++a2;\n   }\n   printf('%lld', n / 2 - min(a1, a2));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, i, j, k, ans1, ans2;\n long long a[1010][1010];\n long long c[1010], x, y, s, t, temp;\n \n int main() {\n     scanf('%d%d', &n, &m);\n     for (i = 0; i < m; i++) {\n         for (j = 1; j <= n; j++) {\n             scanf('%lld', &a[i][j]);\n             c[i] += a[i][j];\n         }\n     }\n     x = (c[m - 1] - c[0]) / (m - 1);\n     for (i = 1; i < m; i++) {\n         if ((c[i] - c[0]) != x * i) {\n             ans1 = i;\n             y = c[i] - c[0] - x * i;\n             break;\n         }\n     }\n     for (i = 1; i < m - 1; i++) {\n         if (i - 1 != ans1 && i != ans1 && i + 1 != ans1) {\n             x = 0;\n             for (j = 1; j <= n; j++) {\n                 x += a[i - 1][j] * a[i - 1][j] + a[i + 1][j] * a[i + 1][j] -\n                      a[i][j] * a[i][j] * 2;\n             }\n             break;\n         }\n     }\n     i = ans1;\n     t = s = 0;\n     for (j = 1; j <= n; j++) {\n         s += a[i - 1][j] * a[i - 1][j] + a[i + 1][j] * a[i + 1][j];\n         t += a[i][j] * a[i][j] * 2;\n     }\n     s -= x;\n     for (j = 1; j <= n; j++) {\n         temp = t - a[i][j] * a[i][j] * 2 + (a[i][j] - y) * (a[i][j] - y) * 2;\n         if (temp == s) {\n             ans2 = a[i][j] - y;\n             break;\n         }\n     }\n     cout << ans1 << ' ' << ans2 << endl;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long N = 500005;\n long long MAX = 9223372036854775807;\n long long MOD = 1000000007;\n long double PI = 4 * atan(1);\n long long int t, a, b, res;\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   cin >> t;\n   while (t--) {\n     cin >> a >> b;\n     res = 0;\n     a = abs(a - b);\n     res += a / 5;\n     a = a % 5;\n     res += a / 2 + a % 2;\n     cout << res << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n signed main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(NULL);\n   long long int T;\n   cin >> T;\n   while (T--) {\n     long long int n;\n     cin >> n;\n     long long int a[n];\n     for (long long int i = 0; i < n; i++) cin >> a[i];\n     if (a[n - 1] > a[0])\n       cout << 'YES'\n            << '\n';\n     else\n       cout << 'NO'\n            << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, siz[200005], l[200005], r[200005], a[200005], p[200005], an = 0,\n                                                                 b[200005];\n bool vis[200005];\n vector<int> vt[200005], vec;\n set<int> st;\n set<int>::iterator it;\n int root(int node) {\n   while (p[node] != node) {\n     p[node] = p[p[node]];\n     node = p[node];\n   }\n   return node;\n }\n int merging(int n1, int n2) {\n   int p1 = root(n1), p2 = root(n2);\n   if (p1 == 0) return p2;\n   if (p2 == 200005 - 1) return p1;\n   if (p1 == p2) return p1;\n   if (siz[p1] > siz[p2]) {\n     siz[p1] += siz[p2];\n     p[p2] = p[p1];\n     l[p1] = min(l[p1], l[p2]);\n     r[p1] = max(r[p1], r[p2]);\n     return p1;\n   } else {\n     siz[p2] += siz[p1];\n     p[p1] = p[p2];\n     l[p2] = min(l[p2], l[p1]);\n     r[p2] = max(r[p1], r[p2]);\n     return p2;\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   scanf('%d', &n);\n   int lef = 1, cur = 1, ri;\n   st.insert(0);\n   st.insert(200005 - 1);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n     if (i != 1 && a[i] != a[i - 1]) {\n       l[cur] = lef, r[cur] = i - 1;\n       siz[cur] = r[cur] - l[cur] + 1;\n       vt[siz[cur]].push_back(l[cur]);\n       p[cur] = cur;\n       cur++;\n       lef = i;\n     }\n     st.insert(i);\n     b[i] = cur;\n   }\n   l[cur] = lef, r[cur] = n, siz[cur] = n - lef + 1;\n   vt[siz[cur]].push_back(l[cur]);\n   p[cur] = cur;\n   for (int i = 200005 - 1; i >= 1; i--) {\n     sort(vt[i].begin(), vt[i].end());\n     for (int j = 0, par, tmp, tpp, lol, now; j < vt[i].size(); j++) {\n       now = vt[i][j];\n       if (vis[now]) continue;\n       par = root(b[now]);\n       it = st.lower_bound(l[par]);\n       it--;\n       tmp = *it;\n       it = st.lower_bound(r[par]);\n       it++;\n       tpp = *it;\n       if (a[tmp] == a[tpp] && a[tmp]) {\n         lol = merging(b[tmp], b[tpp]);\n         if (siz[lol] >= i) {\n           vt[i][j] = l[lol];\n           j--;\n         } else\n           vt[siz[lol]].push_back(l[lol]);\n       }\n       for (it = st.lower_bound(l[par]); *it <= r[par]; it++) vec.push_back(*it);\n       for (int k = 0; k < vec.size(); k++) {\n         st.erase(vec[k]), vis[vec[k]] = true;\n       }\n       vec.clear();\n       an++;\n     }\n   }\n   printf('%d\n', an);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   string s;\n   cin >> s;\n   int maxi = 0;\n   int ind = 0;\n   string ret = '';\n   for (int i = 0; i < n; i++) {\n     string temp;\n     int d = 10 - (s[i] - 48);\n     int j = i;\n     int ctr = 0;\n     while (ctr < n) {\n       ctr++;\n       temp += ((s[j] - 48 + d) % 10) + 48;\n       j = (j + 1) % s.length();\n     }\n     if (ret == '')\n       ret = temp;\n     else if (temp < ret)\n       ret = temp;\n   }\n   cout << ret;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   long long n;\n   cin >> n;\n   vector<vector<long long> > p(2, vector<long long>(n)),\n       suf(2, vector<long long>(n + 1)), ebalVLevo(2, vector<long long>(n + 1)),\n       ebalVPravo(2, vector<long long>(n + 1));\n   for (long long i = 0; i < 2; i++) {\n     for (long long j = 0; j < n; j++) {\n       cin >> p[i][j];\n     }\n   }\n   for (long long i = 0; i < 2; i++) {\n     suf[i][n - 1] = p[i][n - 1];\n     for (long long j = n - 2; j >= 0; j--) {\n       suf[i][j] = suf[i][j + 1] + p[i][j];\n     }\n   }\n   for (long long i = 0; i < 2; i++) {\n     ebalVPravo[i][0] = (n)*p[i][0];\n     for (long long j = 1; j < n; j++) {\n       ebalVPravo[i][j] = ebalVPravo[i][j - 1] + p[i][j] * (n + j);\n     }\n   }\n   for (long long i = 0; i < 2; i++) {\n     ebalVLevo[i][n - 1] = p[i][n - 1];\n     for (long long j = n - 2; j >= 0; j--) {\n       ebalVLevo[i][j] = ebalVLevo[i][j + 1] + p[i][j] * (n - j);\n     }\n   }\n   long long sum = 0;\n   long long ans = 0;\n   long long i = 0, j = 0;\n   bool lastI = false;\n   for (long long t = 0; t < 2 * n; t++) {\n     sum += t * p[i][j];\n     long long tmp = sum;\n     long long tmpR =\n         ebalVPravo[i][n - 1] - ebalVPravo[i][j] - (n - t + j) * suf[i][j + 1];\n     long long tmpL = 0;\n     long long tmpLL = 0;\n     if (t == 0) {\n       tmpL = ebalVLevo[1][j] + (t + (n - j) - 1) * suf[1][j];\n     } else if (i == 0) {\n       tmpL = ebalVLevo[1][j + 1] + (t + (n - j) - 1) * suf[1][j + 1];\n     } else if (i == 1) {\n       tmpL = ebalVLevo[0][j + 1] + (t + (n - j) - 1) * suf[0][j + 1];\n     }\n     ans = max(ans, tmp + tmpL + tmpR);\n     if (!lastI) {\n       if (!i) {\n         i++;\n       } else {\n         i--;\n       }\n       lastI = true;\n     } else {\n       j++;\n       lastI = false;\n     }\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long dp[300005];\n vector<long long> g[300005];\n long long ans = 1;\n long long subs[300005];\n long long f[300005][2];\n void dfs(long long s, long long p) {\n   dp[s] = 0;\n   long long mx1 = 0;\n   long long mx2 = 0;\n   long long cnt = 0;\n   for (auto it : g[s]) {\n     if (it != p) {\n       dfs(it, s);\n       if (mx1 < dp[it]) {\n         mx2 = mx1;\n         mx1 = dp[it];\n       } else if (mx2 < dp[it])\n         mx2 = dp[it];\n       cnt++;\n     }\n   }\n   f[s][0] = mx1;\n   f[s][1] = mx2;\n   subs[s] = cnt;\n   dp[s] += mx1 + cnt;\n }\n void ans_dfs(long long s, long long p) {\n   for (auto it : g[s]) {\n     if (it != p) ans_dfs(it, s);\n   }\n   if (s == p) {\n     ans = max(ans, 1 + dp[s] + f[s][1]);\n     return;\n   }\n   long long y = f[p][0];\n   if (y == dp[s]) y = f[p][1];\n   long long z = max(y, f[s][1]);\n   ans = max(ans, 1 + dp[s] + z + 1);\n }\n int32_t main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   long long t;\n   cin >> t;\n   while (t--) {\n     long long n;\n     cin >> n;\n     for (long long i = 1; i <= n; i++) {\n       dp[i] = 0;\n       g[i].clear();\n     }\n     for (long long i = 0; i < n - 1; i++) {\n       long long a, b;\n       cin >> a >> b;\n       g[a].push_back(b);\n       g[b].push_back(a);\n     }\n     ans = 1;\n     dfs(1, 1);\n     ans_dfs(1, 1);\n     cout << ans << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 18;\n long long dp[(1 << N)][105];\n string n;\n int qwq;\n int m, pw[20];\n bool used[10];\n void init() {\n   pw[0] = 1;\n   for (int i = 1; i <= n.size(); i++) pw[i] = pw[i - 1] * 10 % m;\n }\n int main() {\n   cin >> n >> m;\n   dp[0][0] = 1;\n   init();\n   for (int i = 1; i < (1 << n.size()); i++) {\n     int sz = n.size() - __builtin_popcount(i);\n     for (int k = 0; k < m; k++) {\n       for (int j = 0; j < 10; j++) used[j] = false;\n       for (int j = 0; j < n.size(); j++)\n         if (((i >> j) & 1) && !used[n[j] - '0'])\n           if (sz != (int)n.size() - 1 || n[j] != '0')\n             dp[i][k] +=\n                 dp[i - (1 << j)][(m + k - (n[j] - '0') * pw[sz] % m) % m],\n                 used[n[j] - '0'] = true;\n     }\n   }\n   cout << dp[(1 << n.size()) - 1][0] << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXM = 500 + 5;\n const int MAXN = 500 + 5;\n const int MAXQ = 300 + 5;\n const int MAXK = 800 + 5;\n const int P = 5;\n const int MOD = 1e9 + 7;\n int n, m, q, a[MAXN][MAXK];\n int inv[P], ans = 1;\n char buf[MAXM];\n int main() {\n   for (int i = 0; i < P; i++) inv[i] = i * i * i % P;\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; i++) {\n     scanf('%s', buf + 1);\n     for (int j = 1; j <= m; j++) a[j][i] = buf[j] - 'a';\n   }\n   scanf('%d', &q);\n   for (int i = 1; i <= q; i++) {\n     scanf('%s', buf + 1);\n     for (int j = 1; j <= m; j++) a[j][i + n] = buf[j] - 'a';\n   }\n   int cur = 1, r = 0;\n   for (int i = 1; i <= m && cur <= n; i++) {\n     while (cur <= n) {\n       int t = i;\n       for (int j = i + 1; j <= m; j++)\n         if (a[j][cur]) t = j;\n       for (int j = 1; j <= n + q; j++) swap(a[i][j], a[t][j]);\n       if (a[i][cur]) break;\n       cur++;\n     }\n     if (cur == n + 1) break;\n     for (int j = cur + 1; j <= n + q; j++)\n       a[i][j] = a[i][j] * inv[a[i][cur]] % P;\n     a[i][cur] = 1;\n     for (int j = i + 1; j <= m; j++) {\n       for (int k = cur + 1; k <= n + q; k++) {\n         a[j][k] -= a[j][cur] * a[i][k] % P;\n         if (a[j][k] < 0) a[j][k] += P;\n       }\n       a[j][cur] = 0;\n     }\n     r++;\n   }\n   for (int i = 1; i <= n - r; i++) ans = ans * 5ll % MOD;\n   for (int i = 1; i <= q; i++) {\n     int x = ans;\n     for (int j = 1; j <= m; j++) {\n       bool flg = 1;\n       for (int k = 1; k <= n; k++) flg &= (a[j][k] == 0);\n       flg &= (a[j][n + i] > 0);\n       if (flg) x = 0;\n     }\n     printf('%d\n', x);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> st[100000], edge[200000], topo;\n vector<pair<int, int> > ps;\n int incnt[200000], tol;\n priority_queue<int> que;\n bool visit[200000];\n int main(void) {\n   int n, m, in;\n   while (scanf('%d %d', &n, &m) == 2) {\n     for (int i = 0; i < m; ++i) st[i].clear();\n     for (int i = 0; i < n; ++i)\n       for (int j = 0; j < m; ++j) {\n         scanf('%d', &in);\n         st[j].push_back(in);\n       }\n     memset(incnt, 0, sizeof(incnt));\n     tol = m;\n     for (int i = 0; i < 200000; ++i) edge[i].clear();\n     for (int i = 0; i < n; ++i) {\n       ps.clear();\n       for (int j = 0; j < m; ++j)\n         if (st[j][i] >= 0) ps.push_back(make_pair(st[j][i], j));\n       sort(ps.begin(), ps.end());\n       for (int a = 0, b, k = ps.size(), pre = -1; a < k; a = b) {\n         for (b = a; (b < k) && (ps[b].first == ps[a].first); ++b) {\n           int now = ps[b].second;\n           if (pre >= 0) {\n             edge[pre].push_back(now);\n             ++incnt[now];\n           }\n           edge[now].push_back(tol);\n           ++incnt[tol];\n         }\n         pre = tol++;\n       }\n     }\n     topo.clear();\n     for (int i = 0; i < tol; ++i)\n       if (!incnt[i]) que.push(-i);\n     while (!que.empty()) {\n       int now = -que.top();\n       que.pop();\n       if (now < m) topo.push_back(now + 1);\n       for (int i = 0, j = edge[now].size(); i < j; ++i) {\n         --incnt[edge[now][i]];\n         if (!incnt[edge[now][i]]) que.push(-edge[now][i]);\n       }\n     }\n     if (topo.size() != m)\n       puts('-1');\n     else {\n       printf('%d', topo[0]);\n       for (int i = 1, j = topo.size(); i < j; ++i) printf(' %d', topo[i]);\n       putchar('\n');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<string, int> mp;\n map<int, string> mp_back;\n vector<int> way[5005 * 2];\n int n, j, i, ans[5005 * 2] = {};\n int main() {\n   cin >> n;\n   int w = 0;\n   for (i = 1; i <= n; i++) {\n     int v1, v2;\n     string s1, s2;\n     cin >> s1 >> s2;\n     if (!mp[s1])\n       ++w, mp[s1] = w, v1 = w, mp_back[w] = s1;\n     else\n       v1 = mp[s1];\n     if (!mp[s2])\n       ++w, mp[s2] = w, v2 = w, mp_back[w] = s2;\n     else\n       v2 = mp[s2];\n     way[v1].push_back(v2);\n     way[v2].push_back(v1);\n   }\n   for (i = 1; i <= w; i++) {\n     int friends[5005 * 2] = {}, friends2[5005 * 2] = {};\n     for (j = 0; j < way[i].size(); j++) friends[way[i][j]] = 1;\n     int maxf = 0;\n     for (j = 1; j <= w; j++)\n       if (!friends[j] && j != i) {\n         int size = 0;\n         for (int h = 0; h < way[j].size(); h++)\n           if (friends[way[j][h]]) ++size;\n         maxf = max(maxf, size);\n         friends2[j] = size;\n       }\n     for (j = 1; j <= w; j++)\n       if (friends2[j] == maxf && !friends[j] && j != i) ans[i]++;\n   }\n   cout << w << endl;\n   for (i = 1; i <= w; i++) cout << mp_back[i] << ' ' << ans[i] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n #pragma GCC target('avx2')\n #pragma comment(linker, '/stack:200000000')\n #pragma GCC optimize('Ofast')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native')\n using namespace std;\n void solve() {\n   int n;\n   cin >> n;\n   vector<int> ans;\n   for (int i = 1; i <= 1000; i += 2) {\n     ans.push_back(i);\n     ans.push_back(i);\n   }\n   if (ans.size() < n) {\n     for (int i = 0; i < ans.size(); i++) {\n       cout << ans[i] << ' ';\n     }\n     n -= ans.size();\n     for (int i = 0; i < n; i++) {\n       cout << ans[i] << ' ';\n     }\n     cout << endl;\n     return;\n   }\n   for (int i = int(0); i < int(n); i++) {\n     cout << ans[i] << ' ';\n   }\n   cout << endl;\n }\n signed main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a, b, c, i, j, sum, p[3][3];\n   stack<int> s;\n   queue<int> q1, q2;\n   for (i = 0; i < 3; i++)\n     for (j = 0; j < 3; j++) p[i][j] = (j + 3 - i) % 3;\n   while (s.size()) s.pop();\n   while (q1.size()) q1.pop();\n   while (q2.size()) q2.pop();\n   scanf('%d%d', &a, &b);\n   while (a) {\n     q1.push(a % 3);\n     a /= 3;\n   }\n   while (b) {\n     q2.push(b % 3);\n     b /= 3;\n   }\n   if (q1.size() > q2.size())\n     for (i = q2.size(); i < q1.size(); i++) q2.push(0);\n   else {\n     if (q2.size() > q1.size())\n       for (i = q1.size(); i < q2.size(); i++) q1.push(0);\n   }\n   while (q1.size()) {\n     a = q1.front();\n     q1.pop();\n     b = q2.front();\n     q2.pop();\n     s.push(p[a][b]);\n   }\n   sum = 0;\n   while (s.size()) {\n     c = s.top();\n     s.pop();\n     sum = sum * 3 + c;\n   }\n   printf('%d\n', sum);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double eps = 1e-7;\n const int MOD = 1e9 + 7;\n const long long INFLL = 0x3f3f3f3f3f3f3f3f;\n const int INF = 0x3f3f3f3f;\n const int MAXN = 4e5 + 5;\n char s[MAXN];\n int vis[200], t[200];\n int check(int n, int l) {\n   int need = (l / 2) * n, cnt = 0;\n   for (int i = 0; i < 200; i++) cnt += vis[i] / 2;\n   if (cnt >= need) return 1;\n   return 0;\n }\n void solve(int n, int l) {\n   vector<char> v1, v2;\n   printf('%d\n', n);\n   for (int i = 0; i < 200; i++) {\n     while (vis[i] >= 2) v1.push_back((char)i), vis[i] -= 2;\n     if (vis[i]) v2.push_back((char)i);\n   }\n   for (int i = 0; i < n; i++) {\n     int p = 0;\n     while (p < l / 2) {\n       s[p] = s[l - 1 - p] = v1[v1.size() - 1];\n       v1.pop_back();\n       p++;\n     }\n     if (l & 1) {\n       if (v2.empty())\n         s[p] = v1[v1.size() - 1], v2.push_back(v1[v1.size() - 1]),\n         v1.pop_back();\n       else\n         s[p] = v2[v2.size() - 1], v2.pop_back();\n     }\n     s[l] = 0;\n     printf('%s ', s);\n   }\n }\n int main() {\n   int n;\n   cin >> n;\n   scanf('%s', s + 1);\n   for (int i = 1; i <= n; i++) vis[s[i]]++;\n   int maxn = INF;\n   for (int i = 1; i * i <= n; i++) {\n     if (n % i == 0) {\n       if (check(i, n / i)) maxn = min(i, maxn);\n       if (check(n / i, i)) maxn = min(n / i, maxn);\n     }\n   }\n   solve(maxn, n / maxn);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a[100001];\n vector<vector<pair<int, int>>> o[6], ans;\n void relax(vector<int>& m) {\n   o[m.size()].push_back({});\n   for (size_t i = 0; i < m.size(); i++)\n     o[m.size()].back().push_back({m[i], m[(i + 1) % m.size()]});\n   m.resize(1);\n }\n void gao(int x, int y) {\n   if (!y) ans.insert(ans.end(), o[x].begin(), o[x].end());\n   while (o[x].size() > (x == y) && o[y].size()) {\n     ans.push_back(o[x].back());\n     o[x].pop_back();\n     ans.back().insert(ans.back().end(), o[y].back().begin(), o[y].back().end());\n     o[y].pop_back();\n   }\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) scanf('%d', a + i);\n   for (int i = 1; i <= n; i++)\n     if (a[i] != i) {\n       vector<int> u = {i}, m = {i};\n       while (a[u.back()] != i) u.push_back(a[u.back()]);\n       for (size_t c = 1; c < u.size(); c++) {\n         if (m.size() == 5) relax(m);\n         m.push_back(a[u[c]] = u[c]);\n       }\n       relax(m);\n     }\n   gao(5, 0);\n   gao(4, 0);\n   gao(2, 3);\n   while (o[3].size() >= 2) {\n     auto u = o[3].back();\n     o[3].pop_back();\n     o[2].push_back({{u[0].first, u[1].first}, {u[1].first, u[0].first}});\n     o[2].push_back({{u[1].first, u[2].first}, {u[2].first, u[1].first}});\n     gao(2, 3);\n   }\n   gao(2, 2);\n   gao(3, 0);\n   gao(2, 0);\n   printf('%d\n', ans.size());\n   for (auto& c : ans) {\n     printf('%d\n', c.size());\n     for (auto x : c) printf('%d ', x.first);\n     puts('');\n     for (auto x : c) printf('%d ', x.second);\n     puts('');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, tot, a[100010], ans[100010];\n vector<pair<int, int> > q[100010];\n set<int> s;\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]);\n   for (int i = 1, l, x; i <= m; i++) {\n     scanf('%d%d', &l, &x);\n     q[l].emplace_back(i, x);\n   }\n   s.insert(0);\n   tot = 1;\n   for (int i = 1; i <= n; i++) {\n     if (s.count(a[i]))\n       tot = 1ll * tot * 2 % 1000000007;\n     else {\n       vector<int> v;\n       for (int u : s) v.push_back(u ^ a[i]);\n       for (int u : v) s.insert(u);\n     }\n     for (auto &p : q[i]) ans[p.first] = s.count(p.second) ? tot : 0;\n   }\n   for (int i = 1; i <= m; i++) printf('%d\n', ans[i]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename Arg1>\n void __f(const char* name, Arg1&& arg1) {\n   std::cerr << name << ' : ' << arg1 << endl;\n }\n template <typename Arg1, typename... Args>\n void __f(const char* names, Arg1&& arg1, Args&&... args) {\n   const char* comma = strchr(names + 1, ',');\n   std::cerr.write(names, comma - names) << ' : ' << arg1 << ' | ';\n   __f(comma + 1, args...);\n }\n long long int solve() {\n   long long int n;\n   cin >> n;\n   std::vector<long long int> v;\n   long long int seg = 0;\n   long long int count = 0;\n   for (long long int i = 0; i < n; i++) {\n     long long int a;\n     cin >> a;\n     v.push_back(a);\n     if (a != i + 1) {\n       count++;\n     } else {\n       if (count) {\n         seg++;\n         count = 0;\n       }\n     }\n   }\n   if (count) {\n     seg++;\n   }\n   if (seg == 0) {\n     cout << 0 << '\n';\n   } else if (seg == 1) {\n     cout << 1 << '\n';\n   } else {\n     cout << 2 << '\n';\n   }\n   return 0;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long int T = 1;\n   cin >> T;\n   while (T--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, sav, mn = 1e9;\n struct point {\n   long long x, y, uz;\n } p[2005];\n string s;\n int det(point A, point B, point C) {\n   if (A.x * B.y + A.y * C.x + B.x * C.y - A.x * C.y - A.y * B.x - B.y * C.x < 0)\n     return -1;\n   return 1;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> p[i].x >> p[i].y;\n     if (p[i].y < mn) {\n       mn = p[i].y;\n       sav = i;\n     }\n   }\n   cin >> s;\n   p[sav].uz = 1;\n   cout << sav << ' ';\n   for (int i = 0; i < s.size(); i++) {\n     int crt = 1, j, sgn;\n     while (p[crt].uz) crt++;\n     j = crt + 1;\n     if (s[i] == 'R')\n       sgn = 1;\n     else\n       sgn = -1;\n     while (j <= n) {\n       while (j <= n && p[j].uz) j++;\n       if (j > n) break;\n       if (det(p[sav], p[crt], p[j]) == sgn) crt = j;\n       j++;\n     }\n     sav = crt;\n     p[crt].uz = 1;\n     cout << sav << ' ';\n   }\n   for (int i = 1; i <= n; i++)\n     if (!p[i].uz) cout << i << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct node {\n   int va, id;\n } a[200015], b[200015];\n int n, Q, rv[200015];\n long long dp[200015];\n inline bool cmp(node x, node y) { return x.va > y.va; }\n int main() {\n   scanf('%d%d', &n, &Q);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i].va), a[i].id = i;\n   for (int i = 1; i <= n; i++) scanf('%d', &b[i].va), b[i].id = i;\n   sort(a + 1, a + 1 + n, cmp);\n   sort(b + 1, b + 1 + n, cmp);\n   for (int i = 1; i <= n; i++) rv[b[i].id] = i;\n   while (Q--) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     swap(rv[x], rv[y]);\n     b[rv[x]].id = x, b[rv[y]].id = y;\n     for (int i = 1; i <= n; i++) {\n       dp[i] = 0;\n       if (a[i].id ^ b[i].id)\n         dp[i] = max(dp[i], dp[i - 1] + 1ll * a[i].va * b[i].va);\n       if (i > 1) {\n         if ((a[i].id ^ b[i - 1].id) && (a[i - 1].id ^ b[i].id)) {\n           dp[i] = max(dp[i], dp[i - 2] + 1ll * a[i].va * b[i - 1].va +\n                                  1ll * a[i - 1].va * b[i].va);\n         }\n       }\n       if (i > 2) {\n         if ((a[i].id ^ b[i - 2].id) && (a[i - 1].id ^ b[i].id) &&\n             (a[i - 2].id ^ b[i - 1].id)) {\n           dp[i] = max(dp[i], dp[i - 3] + 1ll * a[i - 2].va * b[i - 1].va +\n                                  1ll * a[i - 1].va * b[i].va +\n                                  1ll * a[i].va * b[i - 2].va);\n         }\n         if ((a[i - 2].id ^ b[i].id) && (a[i - 1].id ^ b[i - 2].id) &&\n             (a[i].id ^ b[i - 1].id)) {\n           dp[i] = max(dp[i], dp[i - 3] + 1ll * a[i - 2].va * b[i].va +\n                                  1ll * a[i - 1].va * b[i - 2].va +\n                                  1ll * a[i].va * b[i - 1].va);\n         }\n         if ((a[i].id ^ b[i - 2].id) && (a[i - 2].id ^ b[i].id) &&\n             (a[i - 1].id ^ b[i - 1].id)) {\n           dp[i] = max(dp[i], dp[i - 3] + 1ll * a[i].va * b[i - 2].va +\n                                  1ll * a[i - 1].va * b[i - 1].va +\n                                  1ll * a[i - 2].va * b[i].va);\n         }\n       }\n     }\n     printf('%lld\n', dp[n]);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   vector<int> a;\n   vector<string> ss;\n   bool possible = false;\n   for (int i = 0; i < n; ++i) {\n     string s;\n     cin >> s;\n     if (!possible) {\n       if (s.substr(0, 2) == 'OO') {\n         possible = true;\n         s[0] = '+';\n         s[1] = '+';\n       } else if (s.substr(3, 2) == 'OO') {\n         possible = true;\n         s[3] = '+';\n         s[4] = '+';\n       }\n     }\n     ss.push_back(s);\n   }\n   if (possible) {\n     cout << 'YES\n';\n     for (int j = 0; j < n; ++j) {\n       cout << ss[j] << '\n';\n     }\n   } else {\n     cout << 'NO';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int maxd(long long int n) {\n   long long int temp = 10 * n, mm = 0;\n   while (temp /= 10) mm = max(mm, temp % 10);\n   return mm;\n }\n int main() {\n   long long int n, ans = 0;\n   cin >> n;\n   while (n) {\n     n -= maxd(n);\n     ans++;\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 1e9 + 1;\n const int N = 100123;\n int z, n;\n int a[N];\n int best[N];\n long long ans[N];\n long long res;\n pair<int, int> tree[N << 2];\n void build(int v, int l, int r) {\n   if (l == r) {\n     tree[v] = {a[l], l};\n     return;\n   }\n   int mid = (l + r) >> 1;\n   build(2 * v, l, mid);\n   build(2 * v + 1, mid + 1, r);\n   tree[v] = max(tree[2 * v], tree[2 * v + 1]);\n }\n pair<int, int> query(int v, int l, int r, int ql, int qr) {\n   if (ql <= l && qr >= r) {\n     return tree[v];\n   }\n   int mid = (l + r) >> 1;\n   pair<int, int> res = {0, 0};\n   if (ql <= mid) res = max(res, query(2 * v, l, mid, ql, qr));\n   if (qr >= mid + 1) res = max(res, query(2 * v + 1, mid + 1, r, ql, qr));\n   return res;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n;\n   for (int i = 1; i <= n - 1; i++) {\n     cin >> a[i];\n   }\n   a[n] = n;\n   build(1, 1, n);\n   for (int i = 1; i <= n; i++) {\n     pair<int, int> b = query(1, 1, n, i, a[i]);\n     best[i] = b.second;\n   }\n   ans[n - 1] = 1;\n   res++;\n   for (int i = n - 2; i >= 1; i--) {\n     ans[i] = ans[best[i]] + (best[i] - i) + (n - a[i]);\n     res += ans[i];\n   }\n   cout << res << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long md = 1e9 + 7;\n const int N = 2e6 + 34;\n char s[N];\n long long p[N];\n int n, k, m;\n int lst[100];\n int c, cur, mn;\n int main() {\n   scanf('%d %d\n', &n, &k);\n   gets(s);\n   m = strlen(s);\n   for (int i = 0; i < k; i++) lst[i] = -1;\n   p[0] = 0;\n   p[1] = 1;\n   for (int i = 0; i < m; i++) {\n     c = s[i] - 'a';\n     cur = p[i + 1] - p[lst[c] + 1];\n     p[i + 2] = (p[i + 1] + cur + md) % md;\n     lst[c] = i;\n   }\n   for (int i = m; i < m + n; i++) {\n     mn = 0;\n     for (int j = 1; j < k; j++)\n       if (lst[j] < lst[mn]) mn = j;\n     c = mn;\n     cur = p[i + 1] - p[lst[c] + 1];\n     p[i + 2] = (p[i + 1] + cur + md) % md;\n     lst[c] = i;\n   }\n   cout << p[n + m + 1];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<string, string> mp;\n set<string> st;\n int n;\n char in[30];\n string read() {\n   scanf(' %s', in);\n   return (string)in;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i += 1) {\n     string a = read();\n     string b = read();\n     if (st.find(b) != st.end()) {\n       continue;\n     }\n     st.insert(a);\n     if (mp.find(a) != mp.end()) {\n       mp[b] = mp[a];\n       mp.erase(a);\n       continue;\n     }\n     mp[b] = a;\n   }\n   printf('%d\n', mp.size());\n   for (auto x : mp) {\n     if (x.second == '_') {\n       continue;\n     }\n     printf('%s %s\n', x.second.c_str(), x.first.c_str());\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n vector<vector<int>> p;\n bool is(int val) {\n   int c = 0;\n   vector<bool> pres(n, 0);\n   bool flag = 0;\n   for (int i = 0; i < m; i++) {\n     c = 0;\n     for (int j = 0; j < n; j++) {\n       if (p[i][j] >= val) {\n         pres[j] = true;\n         c++;\n       }\n     }\n     if (c > 1) flag = 1;\n   }\n   if (!flag) return false;\n   bool ans = 1;\n   for (bool i : pres)\n     if (!i) return false;\n   return true;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int t;\n   cin >> t;\n   while (t--) {\n     cin >> m >> n;\n     p.assign(m, vector<int>(n));\n     int minn = INT_MAX, maxx;\n     for (int i = 0; i < m; i++)\n       for (int j = 0; j < n; j++) cin >> p[i][j];\n     for (int i = 0; i < n; i++) {\n       maxx = -1;\n       for (int j = 0; j < m; j++) {\n         maxx = max(maxx, p[j][i]);\n       }\n       minn = min(maxx, minn);\n     }\n     int l = 1, r = minn + 3;\n     while (r - l > 1) {\n       int mid = (l + r) / 2;\n       if (is(mid))\n         l = mid;\n       else\n         r = mid;\n     }\n     cout << l << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dp[80][80][80][80];\n int dfs(int l1, int r1, int l2, int r2, int dep) {\n   if (l1 > r1 || l2 > r2) return 0;\n   if (l1 == l2 && r1 == r2) return r1 - l1 + 1;\n   if (r1 < 80 && r2 < 80 && dp[l1][r1][l2][r2] != -1) return dp[l1][r1][l2][r2];\n   int mid = (1 << dep - 1) - 1;\n   int res = 0;\n   if (l1 <= mid && mid <= r1 && l2 <= mid && mid <= r2) {\n     res = max(res, min(r1, r2) - max(l1, l2) + 1);\n   }\n   int l1_next[] = {l1, max(l1, mid + 1) - (mid + 1)};\n   int r1_next[] = {min(r1, mid - 1), r1 - (mid + 1)};\n   int l2_next[] = {l2, max(l2, mid + 1) - (mid + 1)};\n   int r2_next[] = {min(r2, mid - 1), r2 - (mid + 1)};\n   for (int i = 0; i < (2); i++)\n     for (int j = 0; j < (2); j++)\n       res = max(res,\n                 dfs(l1_next[i], r1_next[i], l2_next[j], r2_next[j], dep - 1));\n   if (r1 < 80 && r2 < 80) dp[l1][r1][l2][r2] = res;\n   return res;\n }\n int main() {\n   int l1, r1, l2, r2;\n   scanf('%d%d%d%d', &l1, &r1, &l2, &r2);\n   l1--;\n   r1--;\n   l2--;\n   r2--;\n   memset(dp, -1, sizeof dp);\n   printf('%d\n', dfs(l1, r1, l2, r2, 30));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 4e5 + 123;\n long long n, m, k;\n int num[maxn];\n int dp[maxn][5];\n int presum[maxn];\n int tmp[maxn];\n int main(int argc, char const *argv[]) {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   std::cin >> n;\n   for (int i = 1; i <= n; i++) {\n     long long u;\n     std::cin >> u;\n     int one = 0;\n     while (u) {\n       if (u % 2 == 1) {\n         one++;\n       }\n       u /= 2;\n     }\n     num[i] = one;\n   }\n   long long ans = 0;\n   for (int i = 1; i <= n; i++) {\n     dp[i][1] = dp[i - 1][1];\n     dp[i][0] = dp[i - 1][0];\n     presum[i] = presum[i - 1] + num[i];\n     if (presum[i] % 2 == 1) {\n       dp[i][1] += 1;\n     } else {\n       dp[i][0] += 1;\n     }\n   }\n   int cur = n + 1;\n   for (int i = n; i >= 0; --i) {\n     tmp[i] = cur;\n     if (num[i] != 0) {\n       cur = i;\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     int k = presum[i - 1] % 2;\n     int cur = i;\n     int sum = num[i];\n     int maxx = num[i];\n     for (int j = 1; j < 71; j++) {\n       int kk = tmp[cur];\n       if (maxx <= sum / 2) {\n         ans += dp[kk - 1][k] - dp[cur - 1][k];\n       }\n       maxx = max(maxx, num[kk]);\n       sum += num[kk];\n       cur = kk;\n       if (cur > n) {\n         break;\n       }\n     }\n     ans += dp[n][k] - dp[cur - 1][k];\n   }\n   std::cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int cnt(long long int x) {\n   long long int ans = 0;\n   while (x) {\n     x /= 2;\n     ans++;\n   }\n   return ans;\n }\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     long long int d, m;\n     cin >> d >> m;\n     long long int temp = cnt(d) - 1;\n     long long int ans = d - pow(2, temp) + 2;\n     for (long long int i = temp - 1; i >= 0; i--) {\n       ans = ans * (pow(2, i) + 1);\n       ans %= m;\n     }\n     ans = (ans - 1) % m;\n     if (ans < 0) ans = m + ans;\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int nextint() {\n   int res = 0;\n   char c = 0;\n   while (c < '0' || c > '9') c = getchar();\n   while (c >= '0' && c <= '9') {\n     res = res * 10 + c - '0';\n     c = getchar();\n   }\n   return res;\n }\n int n;\n long long a[200000], b[200000];\n bool good[200000];\n bool ans[200000];\n long long diff[200000];\n const int maxh = 17;\n const int maxn = (1 << maxh);\n long long tree[2 * maxn];\n void build() {\n   for (int i = maxn - 1; i; i--) tree[i] = min(tree[i + i], tree[i + i + 1]);\n }\n long long get(int i, int j) {\n   long long result = (long long)1e18;\n   for (i += maxn - 1, j += maxn; i + 1 != j; i >>= 1, j >>= 1) {\n     if (!(i & 1)) result = min(result, tree[i + 1]);\n     if (j & 1) result = min(result, tree[j - 1]);\n   }\n   return result;\n }\n long long get_min(int i, int j) {\n   long long result = (long long)1e18;\n   if (i <= j) result = get(i + 1, j + 2);\n   return result;\n }\n void go() {\n   memset(tree, 0, sizeof(tree));\n   for (int i = 0; i < (int)(n); ++i)\n     tree[maxn + i + 1] = tree[maxn + i] + diff[i];\n   build();\n   for (int i = 0; i < (int)(n); ++i) {\n     long long presum = tree[maxn + i];\n     long long postsum = tree[maxn + n] - presum;\n     long long m_main = get_min(i, n - 1);\n     long long m_oth = get_min(0, i - 1);\n     bool ok = true;\n     if (-presum + m_main < 0) ok = false;\n     if (postsum + m_oth < 0) ok = false;\n     good[i] = ok;\n   }\n }\n int main() {\n   cin >> n;\n   for (int i = 0; i < (int)(n); ++i) {\n     int _a;\n     scanf('%d', &_a);\n     a[i] = _a;\n   }\n   for (int i = 0; i < (int)(n); ++i) {\n     int _b;\n     scanf('%d', &_b);\n     b[i] = _b;\n   }\n   for (int i = 0; i < (int)(n); ++i) diff[i] = a[i] - b[i];\n   go();\n   for (int i = 0; i < (int)(n); ++i)\n     if (good[i]) ans[i] = true;\n   memset(good, 0, sizeof(good));\n   reverse(a + 1, a + n);\n   reverse(b, b + n);\n   for (int i = 0; i < (int)(n); ++i) diff[i] = a[i] - b[i];\n   go();\n   for (int i = 0; i < (int)(n); ++i)\n     if (good[i]) ans[(n - i) % n] = true;\n   int ans_size = 0;\n   for (int i = 0; i < (int)(n); ++i)\n     if (ans[i]) ans_size++;\n   cout << ans_size << endl;\n   for (int i = 0; i < (int)(n); ++i)\n     if (ans[i]) cout << (i + 1) << ' ';\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> edges[8];\n int calc(int a, int b) {\n   vector<int> cnt(8);\n   for (auto e : edges[a]) cnt[e]++;\n   for (auto e : edges[b]) cnt[e]++;\n   int sol = 0;\n   for (int i = 1; i <= 7; i++)\n     if (cnt[i] == 2) sol++;\n   return sol;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int n, m, a, b;\n   cin >> n >> m;\n   for (int i = 0; i < m; i++) {\n     cin >> a >> b;\n     edges[a].push_back(b);\n     edges[b].push_back(a);\n   }\n   if (n <= 6) {\n     cout << m << '\n';\n     return 0;\n   }\n   int mmin = 1e9;\n   for (int i = 1; i <= n; i++) {\n     for (int j = i + 1; j <= n; j++) {\n       mmin = min(mmin, calc(i, j));\n     }\n   }\n   cout << m - mmin << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 300010;\n const int M = 1000010;\n const int MOD = 1000000007;\n const int INF = 2e9;\n const double eps = 1e-8;\n const double PI = acos(-1.0);\n int fx[] = {1, -1, 0, 0};\n int fy[] = {0, 0, 1, -1};\n int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }\n int lcm(int x, int y) {\n   x /= gcd(x, y);\n   return x * y;\n }\n int Min(int a, int b) { return a < b ? a : b; }\n int Max(int a, int b) { return a > b ? a : b; }\n bool prime[M + 5], isprime[M + 5];\n vector<int> v;\n int n, m, q, cs, ar[123456];\n void sieve() {\n   v.push_back(2);\n   prime[1] = 1;\n   int limit = (int)sqrt(M);\n   for (int i = 4; i <= M; i += 2) prime[i] = 1;\n   for (int i = 3; i <= M; i += 2) {\n     if (!prime[i]) {\n       v.push_back(i);\n       if (i <= limit) {\n         for (int j = i * i; j <= M; j += 2 * i) prime[j] = 1;\n       }\n     }\n   }\n }\n int br[123456];\n int main() {\n   long long n, tot = 0;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> ar[i];\n     tot += ar[i];\n   }\n   for (int i = 0; i < n; i++) cin >> br[i];\n   sort(br, br + n);\n   long long a = br[n - 1], b = br[n - 2];\n   if (tot <= a + b)\n     cout << 'YES';\n   else\n     cout << 'NO';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, e = 0, st[100005], d[100005], T[100005], s[100005], Time;\n struct Node {\n   int v, t;\n   double p;\n };\n struct {\n   int v, t, nx;\n } edge[200005];\n vector<Node> E[100005];\n bool cmp(Node a, Node b) { return a.p < b.p; }\n void add(int u, int v, int t) {\n   edge[e].v = v;\n   edge[e].t = t;\n   edge[e].nx = st[u];\n   st[u] = e++;\n }\n void dfs(int u, int fa, int t) {\n   s[u] = 1;\n   d[u] = 2 * t;\n   for (int i = st[u]; ~i; i = edge[i].nx) {\n     int v = edge[i].v;\n     if (v != fa) {\n       Node tmp;\n       t = edge[i].t;\n       tmp.v = v;\n       tmp.t = t;\n       E[u].push_back(tmp);\n       dfs(v, u, t);\n       s[u] += s[v];\n       d[u] += d[v];\n     }\n   }\n }\n void Dfs(int u) {\n   int m = E[u].size();\n   for (int i = 0; i < m; i++)\n     E[u][i].p = (double)d[E[u][i].v] / (double)s[E[u][i].v];\n   sort(E[u].begin(), E[u].end(), cmp);\n   for (int i = 0; i < m; i++) {\n     int v = E[u][i].v;\n     int t = E[u][i].t;\n     Time += t;\n     T[v] = Time;\n     Dfs(v);\n     Time += t;\n   }\n }\n int main() {\n   while (~scanf('%d', &n)) {\n     e = 0;\n     memset(st, -1, sizeof(st));\n     int a, b, t;\n     for (int i = 1; i < n; i++) {\n       scanf('%d%d%d', &a, &b, &t);\n       add(a, b, t);\n       add(b, a, t);\n     }\n     dfs(1, -1, 0);\n     Time = 0;\n     Dfs(1);\n     double ans = 0;\n     for (int i = 2; i <= n; i++) ans += 1.0 * T[i];\n     printf('%.12f\n', ans / 1.0 / (n - 1));\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int INT_INF = 0x3f3f3f3f;\n const int INT_M_INF = 0x7f7f7f7f;\n const long long LL_INF = 0x3f3f3f3f3f3f3f3f;\n const long long LL_M_INF = 0x7f7f7f7f7f7f7f7f;\n const double pi = acos(-1.0);\n using namespace std;\n inline void debug(char ch) {\n   for (int __ii = 0; __ii < 20; ++__ii) putchar(ch);\n   printf('\n');\n }\n const double eps = 1e-8;\n inline int dcmp(double a, double b) {\n   if (fabs(a - b) < eps) return 0;\n   return a < b ? -1 : 1;\n }\n const int dr[] = {0, 0, -1, 1, -1, -1, 1, 1};\n const int dc[] = {-1, 1, 0, 0, -1, 1, -1, 1};\n const int MAXN = 4000 + 10;\n const int MAXT = 10000 + 10;\n char s[MAXN], t[MAXN];\n int main() {\n   memset(s, 0, sizeof s);\n   memset(t, 0, sizeof t);\n   while (scanf('%s%s', s, t) == 2) {\n     int slen = strlen(s), tlen = strlen(t), ans = 0;\n     for (int i = 0; i < slen; ++i) {\n       int num = 0;\n       for (int j = 0; j < tlen; ++j)\n         if (s[i + j] == t[j]) ++num;\n       ans = max(ans, num);\n     }\n     for (int i = 0; i < tlen; ++i) {\n       int num = 0;\n       for (int j = 0; j < slen; ++j)\n         if (t[i + j] == s[j]) ++num;\n       ans = max(ans, num);\n     }\n     printf('%d\n', tlen - ans);\n     memset(s, 0, sizeof s);\n     memset(t, 0, sizeof t);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const long long inf = 2000000002;\n pair<long long, long long> 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 <bits/stdc++.h>\n int map[2001][2001] = {0};\n int ans[2001] = {0};\n int n, m, k;\n char ss[2001];\n void show() {\n   int i, j;\n   for (i = 0; i < n; i++) {\n     for (j = 0; j < m; j++) {\n       printf('%d', map[i][j]);\n     }\n     printf('\n');\n   }\n }\n int main() {\n   int i, j, k;\n   scanf('%d %d %d', &n, &m, &k);\n   for (i = 0; i < n; i++) {\n     scanf('%s', ss);\n     for (j = 0; j < m; j++) {\n       if (ss[j] == '.') {\n         map[i][j] = 0;\n       } else if (ss[j] == 'L') {\n         map[i][j] = 1;\n       } else if (ss[j] == 'R') {\n         map[i][j] = 2;\n       } else if (ss[j] == 'U') {\n         map[i][j] = 4;\n       } else {\n         map[i][j] = 8;\n       }\n     }\n   }\n   for (i = 0; i < n; i++) {\n     for (j = 0; j < m; j++) {\n       if (map[i][j] == 1) {\n         if (i <= j) ans[j - i]++;\n       } else if (map[i][j] == 2) {\n         if (i < m - j) ans[i + j]++;\n       } else if (map[i][j] == 4) {\n         if (!(i & 1)) ans[j]++;\n       } else if (map[i][j] == 8) {\n       }\n     }\n   }\n   printf('%d', ans[0]);\n   for (i = 1; i < m; i++) {\n     printf(' %d', ans[i]);\n   }\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   if (n & 1)\n     cout << (n - 1) / 2;\n   else {\n     int v = 1;\n     while (v * 2 <= n) v = v * 2;\n     cout << (n - v) / 2;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MOD = 1e9 + 7;\n const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;\n int main() {\n   int n, m, array1[100][100], mini, maxi = -OO, i, j;\n   scanf('%d %d', &n, &m);\n   for (i = 0; i < n; ++i) {\n     for (j = 0; j < m; ++j) {\n       scanf(' %d', &array1[i][j]);\n     }\n   }\n   for (i = 0; i < n; ++i) {\n     mini = OO;\n     for (j = 0; j < m; ++j) {\n       mini = min(mini, array1[i][j]);\n     }\n     maxi = max(maxi, mini);\n   }\n   printf('%d', maxi);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   long long i, j, k, l, n, m;\n   long long t;\n   cin >> t;\n   while (t--) {\n     cin >> n >> m;\n     for (i = 1; i <= n; i++) {\n       for (j = 1; j <= m; j++) {\n         if (i == 1 && j == 1)\n           cout << 'B';\n         else if (i == 1 && j >= 2)\n           cout << 'W';\n         else\n           cout << 'B';\n       }\n       cout << '\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<vector<int> > bord(312345);\n vector<int> ans;\n int main() {\n   std::ios::sync_with_stdio(false);\n   int n, a, b, k;\n   cin >> n >> a >> b >> k;\n   string s;\n   cin >> s;\n   int i, sumi = 0, counter = 0;\n   for (i = 0; i < n; i++) {\n     if (s[i] == '1') {\n       counter++;\n     } else {\n       bord[counter].push_back(i + 1);\n     }\n   }\n   for (i = 0; i < counter + 1; i++) {\n     sumi += bord[i].size() / b;\n   }\n   sumi -= a;\n   sumi++;\n   cout << sumi << endl;\n   for (i = 0; i < counter + 1; i++) {\n     int val = bord[i].size();\n     int j = b - 1;\n     while (sumi) {\n       if (j < val) {\n         ans.push_back(bord[i][j]);\n         j += b;\n         sumi--;\n       } else {\n         break;\n       }\n     }\n   }\n   for (i = 0; i < ans.size(); i++) {\n     cout << ans[i] << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1000000 + 10;\n const int INF = 1e9 + 7;\n const int MOD = 1e9 + 7;\n const double eps = 1e-10;\n const double pi = acos(-1);\n int T, cases, n, m;\n int main() {\n   ios::sync_with_stdio(false);\n   ;\n   cin >> n >> m;\n   int ans;\n   if (n == 1 || m == 1)\n     ans = n * m;\n   else if (n == 2 || m == 2) {\n     if (m == 2) swap(n, m);\n     if (m % 4 == 1)\n       ans = m / 4 * 4 + 2;\n     else\n       ans = (m + 3) / 4 * 4;\n   } else\n     ans = max((n * m) / 2, (n * m) - (n * m / 2));\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1610;\n typedef int MAP[maxn][maxn];\n int n, m;\n MAP A, B, flag, used;\n int total;\n int num[maxn * maxn], que[maxn * maxn * 2];\n MAP temp;\n int px[] = {0, 0, 1, -1, 0}, py[] = {1, -1, 0, 0, 0};\n bool isok(int x, int y) { return x >= 1 && x <= n && y >= 1 && y <= m; }\n void zoomin(MAP X) {\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) {\n       int value = 1;\n       for (int x = 0; x < 5; x++)\n         if (isok(i + px[x], j + py[x]) && X[i + px[x]][j + py[x]] == 0)\n           value = 0;\n       temp[i][j] = value;\n     }\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) X[i][j] = temp[i][j];\n }\n void zoomout(MAP X) {\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) {\n       int value = 0;\n       for (int x = 0; x < 5; x++)\n         if (isok(i + px[x], j + py[x]) && X[i + px[x]][j + py[x]] == 1)\n           value = 1;\n       temp[i][j] = value;\n     }\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) X[i][j] = temp[i][j];\n }\n void bfs(int x, int y, int& index) {\n   index++;\n   int start = 1, tail = 0, sum = 0;\n   que[++tail] = x;\n   que[++tail] = y;\n   used[x][y] = 1;\n   while (start <= tail) {\n     x = que[start++];\n     y = que[start++];\n     flag[x][y] = index;\n     sum++;\n     for (int i = 0; i < 4; i++)\n       if (isok(x + px[i], y + py[i]) && !used[x + px[i]][y + py[i]] &&\n           B[x + px[i]][y + py[i]] == 1) {\n         used[x + px[i]][y + py[i]] = 1;\n         que[++tail] = x + px[i];\n         que[++tail] = y + py[i];\n       }\n   }\n   if (sum < 100) index--;\n }\n void bfs(int x, int y) {\n   int start = 1, tail = 0, sum = 0, index = 0;\n   que[++tail] = x;\n   que[++tail] = y;\n   used[x][y] = 1;\n   while (start <= tail) {\n     x = que[start++];\n     y = que[start++];\n     sum++;\n     for (int i = 0; i < 4; i++)\n       if (isok(x + px[i], y + py[i]) && !used[x + px[i]][y + py[i]] &&\n           A[x + px[i]][y + py[i]] == 1) {\n         if (!flag[x + px[i]][y + py[i]]) {\n           used[x + px[i]][y + py[i]] = 1;\n           que[++tail] = x + px[i];\n           que[++tail] = y + py[i];\n         } else {\n           index = flag[x + px[i]][y + py[i]];\n         }\n       }\n   }\n   if (sum > 2) num[index]++;\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) scanf('%d', &A[i][j]);\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) B[i][j] = A[i][j];\n   for (int i = 1; i <= 3; i++) zoomin(B);\n   for (int i = 1; i <= 4; i++) zoomout(B);\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++)\n       if (!used[i][j] && B[i][j]) bfs(i, j, total);\n   memset(used, 0, sizeof(used));\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++)\n       if (!used[i][j] && A[i][j] && !flag[i][j]) bfs(i, j);\n   sort(num + 1, num + 1 + total);\n   cout << total << endl;\n   for (int i = 1; i <= total; i++) cout << num[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main(void) {\n   int n, sum = 0;\n   scanf('%d', &n);\n   getchar();\n   char str[n];\n   gets(str);\n   for (int i = 0; i < n; i++) {\n     if (str[i] == '+')\n       sum++;\n     else if (str[i] == '-' && sum != 0)\n       sum--;\n   }\n   printf('%d\n', sum);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n, m;\n     cin >> n >> m;\n     int a[n], s = 0;\n     for (int i = 0; i < n; i++) {\n       cin >> a[i];\n       s += a[i];\n     }\n     if (s >= m)\n       cout << m << endl;\n     else\n       cout << s << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 10, inf = 0x3f3f3f3f;\n int sa[N];\n int rk[N];\n int tmp[N];\n int lcp[N];\n char s[N], t[N];\n int n, k;\n bool cmp(int i, int j) {\n   if (rk[i] != rk[j])\n     return rk[i] < rk[j];\n   else {\n     int ri = i + k <= n ? rk[i + k] : -1;\n     int rj = j + k <= n ? rk[j + k] : -1;\n     return ri < rj;\n   }\n }\n void build(char *s, int *sa) {\n   n = strlen(s);\n   for (int i = 0; i <= n; i++) {\n     sa[i] = i;\n     rk[i] = i < n ? s[i] : -1;\n   }\n   for (k = 1; k <= n; k *= 2) {\n     sort(sa, sa + n + 1, cmp);\n     tmp[sa[0]] = 0;\n     for (int i = 1; i <= n; i++) {\n       tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0);\n     }\n     for (int i = 0; i <= n; i++) {\n       rk[i] = tmp[i];\n     }\n   }\n }\n void LCP(char *s, int *sa, int *lcp) {\n   n = strlen(s);\n   for (int i = 0; i <= n; i++) rk[sa[i]] = i;\n   int h = 0;\n   lcp[0] = 0;\n   for (int i = 0; i < n; i++) {\n     int j = sa[rk[i] - 1];\n     for (h ? h-- : 0; j + h < n && i + h < n && s[j + h] == s[i + h]; h++)\n       ;\n     lcp[rk[i] - 1] = h;\n   }\n }\n int st[N], pos[N];\n int main() {\n   int T;\n   scanf('%d', &T);\n   while (T--) {\n     scanf('%s', s);\n     int n = strlen(s);\n     build(s, sa);\n     LCP(s, sa, lcp);\n     for (int i = 0; i < n; i++) {\n     }\n     int now = 0;\n     lcp[n] = 0;\n     long long ans = 0;\n     for (int i = 1; i <= n; i++) {\n       int newpos = i, len = lcp[i];\n       while (now > 0 && st[now] > len) {\n         long long v1 = st[now] - max(st[now - 1], len);\n         long long v2 = i - pos[now] + 1;\n         ans += v1 * v2 * v2;\n         newpos = pos[now--];\n       }\n       st[++now] = len;\n       pos[now] = newpos;\n     }\n     for (int i = 0; i < n; i++) {\n       ans += n - i - max(lcp[rk[i] - 1], lcp[rk[i]]);\n     }\n     printf('%lld\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX_N = 2000;\n int n, m, k, t, a[MAX_N + 1], b[MAX_N + 1], p[MAX_N + 1];\n vector<int> x;\n vector<int> y;\n int main() {\n   int i, j, ans = 0;\n   scanf('%d', &n);\n   for (i = 1; i <= n; i++) scanf('%d', a + i);\n   for (i = 1; i <= n; i++) scanf('%d', b + i), p[b[i]] = i;\n   for (i = 1; i <= n; i++) {\n     for (k = i;; k++)\n       if (p[a[k]] == i) break;\n     while (k != i) {\n       for (j = i; j <= k; j++)\n         if (p[a[j]] >= k) {\n           x.push_back(k);\n           y.push_back(j);\n           ans += k - j;\n           swap(a[j], a[k]);\n           k = j;\n         }\n     }\n   }\n   printf('%d\n%d\n', ans, x.size());\n   for (i = 0; i < x.size(); i++) printf('%d %d\n', x[i], y[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char c;\n int v[300], a;\n int main() {\n   v['>'] = 0;\n   v['<'] = 1;\n   v['+'] = 2;\n   v['-'] = 3;\n   v['.'] = 4;\n   v[','] = 5;\n   v['['] = 6;\n   v[']'] = 7;\n   while (cin >> c) a = (a * 16 + 8 + v[c]) % 1000003;\n   cout << a << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long a, b;\n   cin >> a >> b;\n   cout << fixed << setprecision(7) << a * pow(double(1.000000011), b) << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 1000000000;\n long long mod = 1000000007LL;\n long long mod2 = 998244353LL;\n int n, m, k;\n bool a[1000005];\n int main() {\n   cin >> n >> m >> k;\n   memset(a, false, sizeof(a));\n   for (int i = 1; i <= n; ++i) {\n     int ai;\n     scanf('%d', &ai);\n     a[ai] = true;\n   }\n   int ans = 0;\n   deque<int> dq;\n   for (int i = 1; i <= 1000001; ++i) {\n     if (a[i]) {\n       dq.push_back(i);\n     }\n     while (!dq.empty() && i - dq.front() >= m) {\n       dq.pop_front();\n     }\n     if (i >= m) {\n       int det = dq.size() - (k - 1);\n       if (det > 0) {\n         for (int j = 1; j <= det; ++j) {\n           dq.pop_back();\n           ans++;\n         }\n       }\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int cnt[5005][5005];\n int len;\n char st[5005];\n bool palin[5005][5005];\n void updateFreq(int r, int c) {\n   int cc;\n   while (r <= len) {\n     cc = c;\n     while (cc <= len) {\n       cnt[r][cc]++;\n       cc += (cc & (-cc));\n     }\n     r += (r & (-r));\n   }\n }\n int readFreq(int r, int c) {\n   int ret = 0;\n   int cc;\n   while (r > 0) {\n     cc = c;\n     while (cc > 0) {\n       ret += cnt[r][cc];\n       cc -= (cc & (-cc));\n     }\n     r -= (r & (-r));\n   }\n   return ret;\n }\n int main() {\n   scanf('%s', st + 1);\n   len = strlen(st + 1);\n   int q;\n   scanf('%d', &q);\n   for (int d = 0, lets_stop_here = (int)len + 1; d < lets_stop_here; d++) {\n     for (int i = 1, lets_stop_here = (int)len; i <= lets_stop_here; i++) {\n       int j = i + d;\n       if (j > len) break;\n       if (i == j)\n         palin[i][j] = true;\n       else if (j - i == 1)\n         palin[i][j] = st[i] == st[j] ? true : false;\n       else if (palin[i + 1][j - 1])\n         palin[i][j] = st[i] == st[j] ? true : false;\n       else\n         palin[i][j] = false;\n       if (palin[i][j]) updateFreq(i, j);\n     }\n   }\n   while (q--) {\n     int l, r;\n     scanf('%d %d', &l, &r);\n     int ans = readFreq(r, r) - readFreq(r, l - 1) - readFreq(l - 1, r) +\n               readFreq(l - 1, l - 1);\n     printf('%d\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int maxn = 1e5 + 51;\n const int mod1 = 1e9 + 7;\n const int mod2 = 1e9 + 9;\n std::vector<std::pair<int, int>> g[maxn];\n int dfn[maxn], idx = 0;\n int f[maxn], fw[maxn];\n int xr;\n std::vector<std::vector<int>> V;\n void dfs(int u, int fa) {\n   dfn[u] = ++idx;\n   for (auto x : g[u]) {\n     int v = x.first, w = x.second;\n     if (v == fa) continue;\n     if (!dfn[v]) {\n       f[v] = u, fw[v] = w;\n       dfs(v, u);\n     } else if (dfn[v] > dfn[u]) {\n       std::vector<int> vec;\n       int cur = w;\n       for (int now = v; now ^ u; now = f[now]) cur ^= fw[now];\n       vec.push_back(cur ^ w);\n       for (int now = v; now ^ u; now = f[now]) vec.push_back(cur ^ fw[now]);\n       xr ^= cur;\n       V.push_back(vec);\n     }\n   }\n }\n int add(int x, int y, const int& mod) {\n   x += y;\n   return (x >= mod) ? x - mod : x;\n }\n int dec(int x, int y, const int& mod) {\n   x -= y;\n   return (x < 0) ? x + mod : x;\n }\n int n, m;\n int main() {\n   std::ios::sync_with_stdio(false);\n   std::cin.tie(nullptr);\n   std::cout.tie(nullptr);\n   std::cin >> n >> m;\n   for (int i = 1; i <= m; i++) {\n     int u, v, w;\n     std::cin >> u >> v >> w;\n     g[u].push_back({v, w});\n     g[v].push_back({u, w});\n     xr ^= w;\n   }\n   dfs(1, 0);\n   static int a[1 << 17 | 3], b[1 << 17 | 3];\n   auto fwt = [&](int* f, int lim, const int& inv, const int& mod) {\n     for (int len = 1; len < lim; len <<= 1) {\n       for (int i = 0; i < lim; i += len << 1) {\n         for (int j = 0; j < len; j++) {\n           int x = f[i + j], y = f[i + j + len];\n           f[i + j] = add(x, y, mod);\n           f[i + j + len] = dec(x, y, mod);\n           if (inv > 1)\n             f[i + j] = 1ll * f[i + j] * inv % mod,\n                   f[i + j + len] = 1ll * f[i + j + len] * inv % mod;\n         }\n       }\n     }\n   };\n   a[xr] = 1, b[xr] = 1;\n   fwt(a, 1 << 17, 1, mod1);\n   fwt(b, 1 << 17, 1, mod2);\n   static int c[1 << 17 | 3], d[1 << 17 | 3];\n   for (auto v : V) {\n     memset(c, 0, sizeof(c));\n     memset(d, 0, sizeof(d));\n     for (auto x : v) c[x]++, d[x]++;\n     fwt(c, 1 << 17, 1, mod1);\n     fwt(d, 1 << 17, 1, mod2);\n     for (int i = 0; i < (1 << 17); i++) {\n       a[i] = 1ll * a[i] * c[i] % mod1;\n       b[i] = 1ll * b[i] * d[i] % mod2;\n     }\n   }\n   fwt(a, 1 << 17, (mod1 + 1) >> 1, mod1);\n   fwt(b, 1 << 17, (mod2 + 1) >> 1, mod2);\n   for (int i = 0; i < (1 << 17); i++)\n     if (a[i] || b[i]) {\n       std::cout << i << ' ' << a[i] << '\n';\n       return 0;\n     }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 9;\n const long long mod = 998244353;\n long long dp[N][1 << 7];\n int s[N][1 << 7], st[N], Log[1 << 7];\n struct node {\n   int v, id;\n } a[N];\n bool cmp(node a, node b) { return a.v > b.v; }\n void upd(long long &a, long long b) {\n   if (a < b) a = b;\n }\n int main() {\n   int n, p, k;\n   for (int i = (1); i < (N); ++i) st[i] = st[i >> 1] + (i & 1);\n   for (int i = (0); i < (7); ++i) Log[1 << i] = i;\n   scanf('%d%d%d', &n, &p, &k);\n   for (int i = (1); i < (n + 1); ++i) {\n     scanf('%d', &a[i].v);\n     a[i].id = i;\n   }\n   sort(a + 1, a + 1 + n, cmp);\n   int op = (1 << p) - 1;\n   for (int i = (1); i < (n + 1); ++i)\n     for (int j = (0); j < (p); ++j) scanf('%d', &s[i][j]);\n   for (int i = (1); i < (p + k + 1); ++i) {\n     for (int mask = (0); mask < (1 << p); ++mask) {\n       if (st[mask] > i - 1) continue;\n       upd(dp[i - st[mask]][mask], dp[i - st[mask] - 1][mask] + a[i].v);\n       int pos = op ^ mask;\n       while (pos) {\n         upd(dp[i - st[mask] - 1][mask | ((pos) & (-pos))],\n             dp[i - st[mask] - 1][mask] + s[a[i].id][Log[((pos) & (-pos))]]);\n         pos ^= ((pos) & (-pos));\n       }\n     }\n   }\n   for (int i = (p + k + 1); i < (n + 1); ++i) {\n     for (int mask = (1 << p) - 1; mask >= (0); --mask) {\n       int pos = mask;\n       while (pos) {\n         upd(dp[k][mask],\n             dp[k][mask ^ ((pos) & (-pos))] + s[a[i].id][Log[((pos) & (-pos))]]);\n         pos ^= ((pos) & (-pos));\n       }\n     }\n   }\n   printf('%lld', dp[k][op]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long ans[100010];\n long long ans2[100010];\n int main() {\n   int n, p;\n   int l, r;\n   while (cin >> n >> p) {\n     for (int i = 0; i < n; i++) {\n       scanf('%d%d', &l, &r);\n       ans[i] = r / p - l / p;\n       ans2[i] = r - l + 1;\n       if (l % p == 0) ans[i]++;\n     }\n     ans[n] = ans[0];\n     ans2[n] = ans2[0];\n     double anss = 0;\n     for (int i = 0; i < n; i++)\n       anss += ((ans[i] * (ans2[i + 1] - ans[i + 1]) +\n                 (ans2[i] - ans[i]) * ans[i + 1] + ans[i] * ans[i + 1]) *\n                1.0) /\n               (ans2[i] * ans2[i + 1] * 1.0) * 2000;\n     printf('%.10llf', anss);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma warning(disable : 4996)\n using namespace std;\n int IT_MAX = 1 << 17;\n const long long MOD = 5000000;\n const int INF = 1034567891;\n const long long LL_INF = 1234567890123456789ll;\n const double PI = 3.141592653589793238;\n const double ERR = 1E-11;\n int in[200050];\n int lr[200050][2];\n int v[200050];\n int main() {\n   int N, T, K, i, j;\n   scanf('%d %d %d', &N, &T, &K);\n   for (i = 1; i <= T; i++) scanf('%d', &in[i]);\n   in[0] = 1;\n   for (i = 1; i < T; i++) {\n     lr[i][1] = in[i] - 1;\n     lr[i][0] = max(0, in[i] - in[i + 1]);\n   }\n   lr[T][0] = lr[T][1] = in[T];\n   int mn = 0, mx = 0;\n   for (i = 1; i <= T; i++) mn += lr[i][0], mx += lr[i][1];\n   if (K < mn || mx < K) return !printf('-1\n');\n   int t = K - mn;\n   for (i = 1; i <= T; i++) {\n     int t2 = min(t, lr[i][1] - lr[i][0]);\n     t -= t2;\n     v[i] = in[i] - (lr[i][0] + t2);\n   }\n   v[0] = 1;\n   printf('%d\n', N);\n   int pst = 1;\n   for (i = 1; i <= T; i++) {\n     int st = pst + in[i - 1];\n     for (j = 0; j < v[i - 1]; j++) printf('%d %d\n', pst + j, st + j);\n     for (j = v[i - 1]; j < in[i]; j++) printf('%d %d\n', pst, st + j);\n     pst = st;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n #define LL long long\n #define dl double\n #define P pair<int,int>\n using namespace std;\n \n const int N = 2e5 + 10;\n \n int n;\n struct ghb{\n   int a,b;\n   bool operator < (const ghb &o)const{\n     return min(a,b) < min(o.a,o.b);\n   }\n }f[N];\n LL ans;\n int mx;\n \n int main(){\n   // freopen('in.txt','r',stdin);\n   // freopen('o.txt','w',stdout);\n   std::ios::sync_with_stdio(false);\n   std::cin.tie(nullptr);\n   cin >> n;\n   for(int i = 1;i <= n;i++)cin >> f[i].a;\n   for(int i = 1;i <= n;i++)cin >> f[i].b;\n   for(int i = 1;i <= n;i++)ans += abs(f[i].a - f[i].b);\n   sort(f + 1,f + n + 1);\n   int mx_1 = 0,mx_2 = 0;\n   for(int i = 1;i <= n;i++){\n     if(f[i].a > f[i].b){\n       if(mx_1)mx = max(mx,min(mx_1,f[i].a) - f[i].b);\n       mx_2 = max(mx_2,f[i].a);\n     }\n     else {\n       if(mx_2)mx = max(mx,min(mx_2,f[i].b) - f[i].a);\n       mx_1 = max(mx_1,f[i].b);\n     }\n   }\n   cout << ans - 2 * mx << endl;\n   return 0;\n }\n /**/"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long GCD(long long a, long long b) { return (b == 0) ? a : GCD(b, a % b); }\n bool isPrime(int x) {\n   for (int i = 2; i <= sqrt(x); i++)\n     if (x % i == 0) return 0;\n   return 1;\n }\n bool C[26];\n int main() {\n   int n, a;\n   cin >> n >> a;\n   vector<int> v(n);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &v[i]);\n   }\n   int ans = 0;\n   if (a - 1 < n - a) {\n     reverse(v.begin(), v.end());\n     a = n - a + 1;\n   }\n   a--;\n   for (int i = 0; i < a + 1; i++) {\n     if (v[i] == 1 && ((2 * a - i) >= n || i == a))\n       ans++;\n     else if (v[i] == 1 && v[2 * a - i] == 1)\n       ans += 2;\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a, b;\n long long c, d;\n int main() {\n   while (cin >> a >> b) {\n     cin >> c >> d;\n     for (int i = 0; i <= 1000; ++i) {\n       for (int j = 0; j <= 1000; ++j) {\n         if ((b + a * i) == (d + c * j)) {\n           cout << b + a * i << endl;\n           return 0;\n         }\n       }\n     }\n     cout << '-1' << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int mid, i, j;\n     string a;\n     cin >> a;\n     if ((a.length()) % 2) {\n       cout << 'NO\n';\n       continue;\n     }\n     mid = (a.length()) / 2;\n     j = mid;\n     i = 0;\n     while (i < mid) {\n       if (a[i] == a[j]) {\n         i++;\n         j++;\n       } else {\n         cout << 'NO\n';\n         break;\n       }\n     }\n     if (i == mid) {\n       cout << 'YES\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = 100100;\n const long long mod = 1e9 + 7;\n using namespace std;\n int n, Xa, Ya, Xb, Yb;\n int Smallest(int a, int b, int c, int d) {\n   int min_ = a;\n   if (min_ > b) min_ = b;\n   if (min_ > c) min_ = c;\n   if (min_ > d) min_ = d;\n   return min_;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n >> Xa >> Ya >> Xb >> Yb;\n   if ((Xa == Xb && (Xa == 0 || Xa == n)) || (Ya == Yb && (Ya == 0 || Ya == n)))\n     cout << abs(Xa - Xb) + abs(Ya - Yb) << '\n';\n   else\n     cout << Smallest(abs(0 - Xa) + abs(0 - Ya) + abs(0 - Xb) + abs(0 - Yb),\n                      abs(0 - Xa) + abs(n - Ya) + abs(0 - Xb) + abs(n - Yb),\n                      abs(n - Xa) + abs(0 - Ya) + abs(n - Xb) + abs(0 - Yb),\n                      abs(n - Xa) + abs(n - Ya) + abs(n - Xb) + abs(n - Yb))\n          << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, k;\n   scanf('%d %d', &n, &k);\n   int a[500005];\n   map<int, vector<int>> m;\n   set<int> s;\n   for (int i = 0; i < n; i++) s.insert(i);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &a[i]);\n     m[a[i]].push_back(i);\n   }\n   int llast = n + k;\n   int last = n;\n   int cnt = 0;\n   for (auto it : m) {\n     if (!cnt && it.second[0] < last - k) {\n       auto it = s.lower_bound(llast - k);\n       if (it != s.end()) last = *it;\n       cnt = 1;\n     }\n     if (it.second[0] < last - k) {\n       printf('NO\n');\n       return 0;\n     }\n     for (auto it2 : it.second) {\n       s.erase(it2);\n     }\n     llast = last;\n     last = min(it.second[0], last);\n   }\n   printf('YES\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<int, int> glosy;\n map<pair<int, int>, int> parki;\n int main() {\n   int n, m;\n   scanf('%d%d', &n, &m);\n   for (int i = (0); i < (n); i++) {\n     int a, b;\n     scanf('%d%d', &a, &b);\n     if (a > b) swap(a, b);\n     if (glosy.find(a) != glosy.end())\n       glosy[a]++;\n     else\n       glosy.insert(make_pair(a, 1));\n     if (glosy.find(b) != glosy.end())\n       glosy[b]++;\n     else\n       glosy.insert(make_pair(b, 1));\n     if (parki.find(make_pair(a, b)) != parki.end())\n       parki[make_pair(a, b)]++;\n     else\n       parki.insert(make_pair(make_pair(a, b), 1));\n   }\n   if (m == 0) {\n     cout << (n * 1LL * (n - 1LL)) / 2LL << endl;\n     return 0;\n   }\n   long long int res = 0LL;\n   vector<int> v;\n   for (map<int, int>::iterator it = glosy.begin(); it != glosy.end(); it++)\n     v.push_back(it->second);\n   int jeszcze = n - v.size();\n   sort(v.begin(), v.end());\n   int k = v.size();\n   for (int i = (0); i < (k); i++) {\n     vector<int>::iterator it2 = lower_bound(v.begin(), v.end(), m - v[i]);\n     int ile = (v.end() - it2);\n     if (v[i] + v[i] >= m) ile--;\n     if (v[i] >= m) ile += 2 * jeszcze;\n     res += ile * 1LL;\n   }\n   res = res / 2;\n   for (map<pair<int, int>, int>::iterator it = parki.begin(); it != parki.end();\n        it++) {\n     pair<int, int> para = it->first;\n     int a = para.first;\n     int b = para.second;\n     int x = glosy[a] + glosy[b] - it->second;\n     if (x < m && ((glosy[a] + glosy[b]) >= m)) res--;\n   }\n   cout << res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int LG = 21;\n const int N = 500005;\n const long long MOD = 1e9 + 7;\n const long long INF = 1e9;\n const long long INFLL = 1e18;\n using namespace std;\n void dfs(int v, int paint, vector<int> &col,\n          vector<vector<pair<int, int> > > &graph, vector<int> &need, int &cnt0,\n          int &cnt1, int &fl) {\n   col[v] = paint;\n   if (paint == -1)\n     cnt0++;\n   else\n     cnt1++;\n   if (need[v] != 0) {\n     if (paint == need[v])\n       fl = 1;\n     else\n       fl = -1;\n   }\n   for (auto p : graph[v]) {\n     if (col[p.first] == 0) {\n       dfs(p.first, p.second * paint, col, graph, need, cnt0, cnt1, fl);\n     }\n   }\n }\n int root[N];\n vector<int> suns[N];\n int cntsame[N];\n int sametoroot[N];\n int fl[N];\n int ans;\n int Root(int x) { return root[x] == x ? x : Root(root[x]); }\n void complete_data(int v, int FL) {\n   int x = Root(v);\n   if (fl[x] != 0) return;\n   FL *= sametoroot[v];\n   int took_before = min(cntsame[x], (int)suns[x].size() - cntsame[x]);\n   ans -= took_before;\n   fl[x] = FL;\n   if (FL == 1)\n     ans += cntsame[x];\n   else\n     ans += suns[x].size() - cntsame[x];\n }\n void Merge(int v, int u, int w) {\n   int x = Root(v), y = Root(u);\n   if (x == y) return;\n   if (suns[x].size() > suns[y].size()) {\n     swap(v, u);\n     swap(x, y);\n   }\n   w *= sametoroot[v];\n   w *= sametoroot[u];\n   if (fl[x] == 0 && fl[y] == 0) {\n     ans -= min(cntsame[x], (int)suns[x].size() - cntsame[x]);\n     ans -= min(cntsame[y], (int)suns[y].size() - cntsame[y]);\n   }\n   if (fl[x] == 0 && fl[y] != 0) {\n     complete_data(x, fl[y] * w);\n   }\n   if (fl[x] != 0 && fl[y] == 0) {\n     complete_data(y, fl[x] * w);\n   }\n   for (auto u : suns[x]) {\n     suns[y].push_back(u);\n     sametoroot[u] *= w;\n     if (sametoroot[u] == 1) cntsame[y]++;\n   }\n   if (fl[x] == 0 && fl[y] == 0) {\n     ans += min(cntsame[y], (int)suns[y].size() - cntsame[y]);\n   }\n   root[x] = y;\n }\n signed main() {\n   srand(time(NULL));\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int n, k;\n   cin >> n >> k;\n   string s;\n   cin >> s;\n   vector<vector<int> > contains(n);\n   for (int i = 0; i < k; i++) {\n     int c;\n     cin >> c;\n     for (int j = 0; j < c; j++) {\n       int x = 0;\n       cin >> x;\n       x--;\n       contains[x].push_back(i);\n     }\n   }\n   vector<vector<pair<int, int> > > graph(k);\n   vector<int> need(k, 0);\n   for (int i = 0; i < k; i++) root[i] = i;\n   for (int i = 0; i < k; i++) suns[i].push_back(i);\n   for (int i = 0; i < k; i++) cntsame[i] = 1;\n   for (int i = 0; i < k; i++) sametoroot[i] = 1;\n   for (int i = 0; i < n; i++) {\n     if (contains[i].size() == 1) {\n       if (s[i] == '1') {\n         need[contains[i][0]] = -1;\n         complete_data(contains[i][0], -1);\n       } else {\n         need[contains[i][0]] = 1;\n         complete_data(contains[i][0], 1);\n       }\n     }\n     if (contains[i].size() == 2) {\n       if (s[i] == '0') {\n         graph[contains[i][0]].push_back({contains[i][1], -1});\n         graph[contains[i][1]].push_back({contains[i][0], -1});\n         Merge(contains[i][0], contains[i][1], -1);\n       } else {\n         graph[contains[i][0]].push_back({contains[i][1], 1});\n         graph[contains[i][1]].push_back({contains[i][0], 1});\n         Merge(contains[i][0], contains[i][1], 1);\n       }\n     }\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 10;\n vector<int> v;\n set<pair<int, int> > st;\n int bfs(int x) {\n   queue<int> q;\n   q.push(x);\n   int cnt = 0;\n   while (!q.empty()) {\n     int u = q.front();\n     q.pop();\n     cnt++;\n     int len = v.size();\n     for (int i = 0; i < len; i++, len = v.size()) {\n       int p = v[i];\n       if (st.find(make_pair(u, p)) != st.end())\n         continue;\n       else\n         swap(v[i], v.back()), v.pop_back(), q.push(p), i--;\n     }\n   }\n   return cnt;\n }\n int main() {\n   int n, m;\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < m; i++) {\n     int u, v;\n     scanf('%d%d', &u, &v);\n     st.insert(make_pair(u, v));\n     st.insert(make_pair(v, u));\n   }\n   for (int i = 1; i <= n; i++) v.push_back(i);\n   int ans = 0;\n   while (!v.empty()) {\n     int x = v.back();\n     v.pop_back();\n     bfs(x);\n     ans++;\n   }\n   printf('%d\n', ans - 1);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool essentiallyEqual(float a, float b) {\n   return fabs(a - b) <= ((fabs(a) > fabs(b) ? fabs(b) : fabs(a)) * 1e-6);\n }\n struct TVector {\n   long long x, y;\n   TVector operator+(TVector q) const { return {x + q.x, y + q.y}; }\n   TVector operator-(TVector q) const { return {x - q.x, y - q.y}; }\n   TVector operator*(int t) const { return {x * t, y * t}; }\n   long long operator*(TVector q) const { return {x * q.x + y * q.y}; }\n   long long operator^(TVector q) const { return {x * q.y - q.x * y}; }\n   long double operator~() const { return {hypot(x, y)}; }\n   long double disPointLine(TVector p, TVector q) {\n     TVector r = *this;\n     if (((r - p) * (q - p) >= 0) && ((r - q) * (p - q) >= 0)) {\n       return abs((q - p) ^ (r - p)) / ~(p - q);\n     } else {\n       return min(~(r - p), ~(r - q));\n     }\n   }\n   bool onLine(TVector p, TVector q) {\n     TVector r = *this;\n     long double dis = r.disPointLine(p, q);\n     return essentiallyEqual(dis, 0);\n   }\n   long double sqrdDist(TVector p) {\n     return (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y);\n   }\n   int orientation(TVector b, TVector c) {\n     TVector a = *this;\n     int val = (c - a) ^ (b - a);\n     return val;\n   }\n   int orientationV2(TVector b, TVector c) {\n     TVector a = *this;\n     int val = (c - a) ^ (b - a);\n     if (val == 0) return 0;\n     return (val > 0) ? 1 : 2;\n   }\n   void imprimePonto() { printf('%lld %lld', x, y); }\n };\n vector<TVector> stormtroopers;\n vector<int> isShot;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int n, x0, y0;\n   cin >> n >> x0 >> y0;\n   TVector gun;\n   gun.x = x0;\n   gun.y = y0;\n   for (int i = 0; i < n; ++i) {\n     int x, y;\n     cin >> x >> y;\n     stormtroopers.push_back({x, y});\n     isShot.push_back(0);\n   }\n   int tiros = 0;\n   for (int i = 0; i < n; ++i) {\n     if (!isShot[i]) {\n       tiros++;\n       for (int j = i + 1; j < n; ++j) {\n         if (!isShot[j]) {\n           if (!gun.orientationV2(stormtroopers[i], stormtroopers[j]))\n             isShot[j] = 1;\n         }\n       }\n     }\n   }\n   cout << tiros << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <vector>\n #include <iostream>\n #include <algorithm>\n #include <string>\n #include <cmath>\n #include <map>\n #define ll long long\n using namespace std;\n \n \n int main()\n {\n     ll t;\n     cin >> t;\n     while (t--) {\n         ll n, m;\n         cin >> n >> m;\n         string s;\n         vector<ll> a(n, 0);\n         vector<ll> b(n, 0);\n         vector<ll> c(m, 0);\n         vector<ll> result(m, 0);\n         vector<vector<ll>> bucket(n + 1, vector<ll>(0));\n \n         for (auto& e : a)cin >> e;\n         for (auto& e : b)cin >> e;\n         for (auto& e : c)cin >> e;\n \n         for (ll i = 0; i < n; i++)\n         {\n             if (b[i] != a[i]) {\n                 bucket[b[i]].push_back(i);\n             }\n         }\n \n         ll lastC = -1;\n         if (bucket[c[m - 1]].size() > 0) {\n             lastC = bucket[c[m - 1]].back();\n             bucket[c[m - 1]].pop_back();\n         }\n         else {\n             for (ll i = 0; i < n; i++)\n             {\n                 if (b[i] == c[m - 1]) {\n                     lastC = i;\n                     break;\n                 }\n             }\n         }\n \n         if (lastC == -1) {\n             cout << 'NO' << endl;\n         }\n         else {\n             result[m - 1] = lastC;\n             for (ll i = 0; i < m - 1; i++)\n             {\n                 if (bucket[c[i]].size() == 0) {\n                     result[i] = lastC;\n                 }\n                 else {\n                     result[i] = bucket[c[i]].back();\n                     bucket[c[i]].pop_back();\n                 }\n             }\n \n             auto res = true;\n             for (ll i = 0; i < n + 1; i++)\n             {\n                 if (bucket[i].size() > 0) {\n                     res = false;\n                 }\n             }\n \n             if (res == false) {\n                 cout << 'NO' << endl;\n             }\n             else {\n                 cout << 'YES' << endl;\n                 for (ll i = 0; i < m; i++)\n                 {\n                     cout << result[i] + 1;\n                     if (i < m - 1) {\n                         cout << ' ';\n                     }\n                     else {\n                         cout << endl;\n                     }\n                 }\n             }\n         }\n     }\n     return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int nmax = 1010;\n const int inf = 1000000007;\n int n;\n pair<int, int> a[nmax];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin >> n;\n   for (int i = 1; i <= n; ++i) cin >> a[i].first >> a[i].second;\n   long double ans = 1e15;\n   a[n + 1] = a[1];\n   a[n + 2] = a[2];\n   for (int i = 1; i <= n; ++i) {\n     pair<int, int> a1 = a[i], a2 = a[i + 1], a3 = a[i + 2];\n     long double A = a3.second - a1.second, B = a1.first - a3.first,\n                 C = -A * a3.first - a3.second * B;\n     long double d =\n         abs(A * a2.first + B * a2.second + C) / (sqrt((A * A + B * B)));\n     if (ans > d) ans = d;\n   }\n   cout << fixed << setprecision(15) << ans / (long double)2.0 << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long maxn = 1e6 + 666;\n long long saveori[maxn];\n long long save[maxn];\n long long getcnt(long long x) {\n   long long cnt = 0;\n   while (x) {\n     if (x & 1) cnt++;\n     x = x >> 1;\n   }\n   return cnt;\n }\n long long cnt[maxn][2];\n long long pre[maxn];\n signed main() {\n   long long n;\n   cin >> n;\n   for (long long i = 1; i <= n; i++) {\n     scanf('%lld', &saveori[i]);\n     save[i] = getcnt(saveori[i]);\n   }\n   long long sum = 0;\n   for (long long i = 1; i <= n; i++) {\n     cnt[i][0] = cnt[i - 1][0];\n     cnt[i][1] = cnt[i - 1][1];\n     cnt[i][sum % 2]++;\n     sum += save[i];\n     pre[i] = sum;\n   }\n   long long ans = 0;\n   for (long long i = n; i >= 1; i--) {\n     long long maxval = -1;\n     sum = 0;\n     for (long long j = i; j >= i - 64 && j > 0; j--) {\n       sum += save[j];\n       maxval = max(maxval, save[j]);\n       if (maxval * 2 <= sum && sum % 2 == 0) {\n         ans++;\n       }\n     }\n     if (i - 65 >= 1) {\n       ans += cnt[i - 65][pre[i] % 2];\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n #define int long long int\n void next(char &x){\n     if(x<='b'){\n         x++;\n     }else{\n         x='a';\n     }\n }\n void solve() {\n     int n,k;\n     cin>>n>>k;\n     char cur='a';\n     for(int i=0;i<n;i++){\n         cout<<cur;\n         next(cur);\n     }\n     cout<<endl;\n }\n signed main() {\n     ios::sync_with_stdio(false);\n     cin.tie(nullptr);\n     cout.tie(nullptr);\n     int t;\n     cin >> t;\n     while (t--){\n         solve();\n     }\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC target('avx,avx2,fma')\n #pragma GCC optimization('unroll-loops')\n const int mod = 1e9 + 7;\n using ll = int64_t;\n using namespace std;\n template <int MOD_>\n struct modnum {\n   static constexpr int MOD = MOD_;\n   static_assert(MOD_ > 0, 'MOD must be positive');\n   int v;\n \n  private:\n   using ll = long long;\n   static int minv(int a, int m) {\n     a %= m;\n     assert(a);\n     return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a);\n   }\n \n  public:\n   modnum() : v(0) {}\n   modnum(ll v_) : v(int(v_ % MOD)) {\n     if (v < 0) v += MOD;\n   }\n   explicit operator int() const { return v; }\n   friend std::ostream& operator<<(std::ostream& out, const modnum& n) {\n     return out << int(n);\n   }\n   friend std::istream& operator>>(std::istream& in, modnum& n) {\n     ll v_;\n     in >> v_;\n     n = modnum(v_);\n     return in;\n   }\n   friend bool operator==(const modnum& a, const modnum& b) {\n     return a.v == b.v;\n   }\n   friend bool operator!=(const modnum& a, const modnum& b) {\n     return a.v != b.v;\n   }\n   modnum inv() const {\n     modnum res;\n     res.v = minv(v, MOD);\n     return res;\n   }\n   friend modnum inv(const modnum& m) { return m.inv(); }\n   modnum neg() const {\n     modnum res;\n     res.v = v ? MOD - v : 0;\n     return res;\n   }\n   friend modnum neg(const modnum& m) { return m.neg(); }\n   modnum operator-() const { return neg(); }\n   modnum operator+() const { return modnum(*this); }\n   modnum& operator++() {\n     v++;\n     if (v == MOD) v = 0;\n     return *this;\n   }\n   modnum& operator--() {\n     if (v == 0) v = MOD;\n     v--;\n     return *this;\n   }\n   modnum& operator+=(const modnum& o) {\n     v += o.v;\n     if (v >= MOD) v -= MOD;\n     return *this;\n   }\n   modnum& operator-=(const modnum& o) {\n     v -= o.v;\n     if (v < 0) v += MOD;\n     return *this;\n   }\n   modnum& operator*=(const modnum& o) {\n     v = int(ll(v) * ll(o.v) % MOD);\n     return *this;\n   }\n   modnum& operator/=(const modnum& o) { return *this *= o.inv(); }\n   friend modnum operator++(modnum& a, int) {\n     modnum r = a;\n     ++a;\n     return r;\n   }\n   friend modnum operator--(modnum& a, int) {\n     modnum r = a;\n     --a;\n     return r;\n   }\n   friend modnum operator+(const modnum& a, const modnum& b) {\n     return modnum(a) += b;\n   }\n   friend modnum operator-(const modnum& a, const modnum& b) {\n     return modnum(a) -= b;\n   }\n   friend modnum operator*(const modnum& a, const modnum& b) {\n     return modnum(a) *= b;\n   }\n   friend modnum operator/(const modnum& a, const modnum& b) {\n     return modnum(a) /= b;\n   }\n };\n using mi = modnum<mod>;\n void solve() {\n   int n, m;\n   cin >> n;\n   vector<vector<int>> adj(n);\n   for (int i = 0; i < n - 1; i++) {\n     int a, b;\n     cin >> a >> b;\n     a--, b--;\n     adj[a].push_back(b);\n     adj[b].push_back(a);\n   }\n   cin >> m;\n   vector<mi> fac(m);\n   for (int i = 0; i < m; i++) {\n     cin >> fac[i];\n   }\n   auto comp = [&](mi X, mi Y) -> bool { return X.v < Y.v; };\n   sort(fac.begin(), fac.end(), comp);\n   if (int(fac.size()) < n - 1) {\n     reverse(fac.begin(), fac.end());\n     while (int(fac.size()) < n - 1) {\n       if (int(fac.size()) < n - 1) {\n         fac.push_back(mi(1));\n       }\n     }\n     reverse(fac.begin(), fac.end());\n   }\n   if (int(fac.size()) > n - 1) {\n     mi cur = 1;\n     while (int(fac.size()) >= n - 1) {\n       cur *= fac.back();\n       fac.pop_back();\n     }\n     fac.push_back(cur);\n   }\n   vector<ll> sz(n, 0), num;\n   function<void(int, int)> dfs = [&](int node, int par) -> void {\n     sz[node] = 1;\n     for (auto i : adj[node]) {\n       if (i != par) {\n         dfs(i, node);\n         sz[node] += sz[i];\n         num.push_back((ll)sz[i] * (n - sz[i]));\n       }\n     }\n   };\n   mi answer = 0;\n   dfs(0, 0);\n   sort(num.begin(), num.end());\n   assert(int(num.size()) >= n - 1);\n   assert(int(fac.size()) == n - 1);\n   for (int i = 0; i < n - 1; i++) {\n     mi cur = (fac[i] * num[i]);\n     answer += cur;\n   }\n   cout << answer << '\n';\n }\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   std::cin.tie(nullptr);\n   int t(1);\n   cin >> t;\n   while (t--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a[105], z, x;\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', a + i);\n     if (a[i] % 2) x++;\n     z += a[i];\n   }\n   if (z % 2)\n     printf('%d', x);\n   else\n     printf('%d', n - x);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1000005, mod = 1000000007;\n vector<int> pri;\n bool vis[80];\n int pos[80], a[maxn], n;\n long long w[80];\n long long dp[1 << 21], dp2[1 << 21], f[maxn];\n void prework() {\n   for (int i = 2; i < (71); ++i) {\n     if (!vis[i]) {\n       pri.push_back(i);\n       pos[i] = (int)pri.size() - 1;\n       for (int j = i; j <= 70; j += i) vis[j] = 1;\n     }\n   }\n   f[0] = 1;\n   for (int i = 1; i < (maxn); ++i) f[i] = 2 * f[i - 1] % mod;\n }\n void init() {\n   scanf('%d', &n);\n   for (int i = 0; i < (n); ++i) {\n     scanf('%d', &a[i]);\n     w[a[i]]++;\n   }\n }\n int gao(int n) {\n   int tmp[30] = {0};\n   for (int i = 2; i <= n; ++i) {\n     while (n % i == 0) {\n       n /= i;\n       tmp[pos[i]] ^= 1;\n     }\n   }\n   if (n > 1) tmp[pos[n]] ^= 1;\n   int res = 0;\n   for (int i = 0; i < (21); ++i)\n     if (tmp[i]) res |= (1 << i);\n   return res;\n }\n inline int get_nx(int st1, int st2) { return st1 ^ st2; }\n void solve() {\n   dp[0] = 1;\n   for (int i = 2; i < (71); ++i) {\n     if (!w[i]) continue;\n     int st = gao(i);\n     for (int pre = 0; pre < (1 << 19); ++pre) {\n       int nx_st = get_nx(st, pre);\n       dp2[nx_st] += dp[pre] * f[w[i] - 1] % mod;\n       dp2[pre] += dp[pre] * f[w[i] - 1] % mod;\n       dp2[nx_st] %= mod;\n       dp2[pre] %= mod;\n     }\n     for (int k = 0; k < (1 << 19); ++k) dp[k] = dp2[k], dp2[k] = 0;\n   }\n   long long ans = dp[0] - 1;\n   if (w[1]) ans = (f[w[1]]) * ans % mod + f[w[1]] - 1;\n   cout << ans % mod << endl;\n }\n int main() {\n   prework();\n   init();\n   solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1000000007;\n ;\n const int maxn = 410;\n unsigned long long powmod(unsigned long long n, unsigned long long k) {\n   unsigned long long ret = 1;\n   while (k) {\n     if (k & 1) ret = ret * n % mod;\n     n = n * n % mod;\n     k >>= 1;\n   }\n   return ret;\n }\n int nxt[maxn][26];\n int dp[maxn][maxn];\n void upd(int& n, int k) {\n   if (n < 0 || n > k) n = k;\n }\n bool gao(const string& s, const string& t1, const string& t2) {\n   memset(dp, -1, sizeof(dp));\n   for (int i = 0; i <= t1.size(); i++)\n     for (int j = 0; j <= t2.size(); j++)\n       if (dp[i][j] >= 0 || i + j == 0) {\n         int p = dp[i][j] + 1;\n         if (i < t1.size()) {\n           int n = nxt[p][t1[i] - 'a'];\n           if (n >= 0) upd(dp[i + 1][j], n);\n         }\n         if (j < t2.size()) {\n           int n = nxt[p][t2[j] - 'a'];\n           if (n >= 0) upd(dp[i][j + 1], n);\n         }\n       }\n   return dp[t1.size()][t2.size()] >= 0;\n }\n char str[maxn];\n char tt[maxn];\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     cin >> str >> tt;\n     memset(nxt, -1, sizeof(nxt));\n     for (int i = strlen(str) - 1; i >= 0; i--) {\n       memcpy(nxt[i], nxt[i + 1], sizeof(nxt[i]));\n       nxt[i][str[i] - 'a'] = i;\n     }\n     bool yes = false;\n     if (strlen(tt) == 1)\n       yes = (nxt[0][tt[0] - 'a'] >= 0);\n     else {\n       for (int i = 0; tt[i + 1]; i++) {\n         char tmp = tt[i + 1];\n         tt[i + 1] = 0;\n         string t1 = tt;\n         tt[i + 1] = tmp;\n         string t2 = tt + i + 1;\n         if (gao(str, t1, t2)) {\n           yes = true;\n           break;\n         }\n       }\n     }\n     if (yes)\n       puts('YES');\n     else\n       puts('NO');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n long long Query(long long L, long long R) {\n   cout << L << ' ' << R << endl;\n   fflush(stdout);\n   string s;\n   cin >> s;\n   if (L == R && s == 'Yes') exit(0);\n   return s == 'Yes';\n }\n int32_t main() {\n   long long n, k;\n   cin >> n >> k;\n   long long L = 1, R = n;\n   while (true) {\n     if (R - L + 1 <= 4 * k + 7) {\n       long long M = L + rng() % (R - L + 1);\n       if (Query(M, M)) {\n         return 0;\n       } else {\n         L = max(1LL, L - k);\n         R = min(n, R + k);\n       }\n     } else {\n       long long M = L + ((R - L) >> 1);\n       if (Query(L, M)) {\n         L = max(1LL, L - k);\n         R = min(n, M + k);\n       } else {\n         L = max(1LL, M - k);\n         R = min(n, R + k);\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MOD = (1e9 + 7);\n const long long INF = (1e9 + 123456789);\n const long long INFL = (INF * INF);\n inline long long addm(long long a, long long b, long long m = MOD) {\n   return ((a + b) % m);\n }\n inline long long subm(long long a, long long b, long long m = MOD) {\n   return (((a - b) % m + m) % m);\n }\n inline long long mulm(long long a, long long b, long long m = MOD) {\n   return ((a * b) % m);\n }\n long long powm(long long a, long long b, long long m = MOD) {\n   long long ret = (!b) ? 1 : powm(a, b / 2, m);\n   return (!b) ? 1 : mulm(mulm(ret, ret, m), b % 2 ? a : 1, m);\n }\n long long gcd(long long a, long long b) { return (!b) ? a : gcd(b, a % b); }\n long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }\n long long inv(long long x, long long m = MOD) { return powm(x, m - 2, m); }\n const int N = 1000500;\n int a[N], lft[N], nxt[N];\n vector<int> nodes, g[N];\n struct SegmentTree {\n   int f, t;\n   SegmentTree *lc, *rc;\n   bool has_child, has_lazy = false;\n   int upd = 0;\n   int vmax = 0;\n   SegmentTree(int l, int r) {\n     if (l == r) {\n       f = t = l;\n       lc = rc = NULL;\n       has_child = false;\n     } else {\n       f = l;\n       t = r;\n       int mid = (l + r) / 2;\n       lc = new SegmentTree(l, mid);\n       rc = new SegmentTree(mid + 1, r);\n       has_child = true;\n     }\n   }\n   void change(int v) {\n     vmax += v;\n     upd += v;\n     has_lazy = true;\n   }\n   void push() {\n     if (!has_lazy) return;\n     lc->change(upd);\n     rc->change(upd);\n     upd = 0;\n     has_lazy = false;\n   }\n   void update(int l, int r, int x) {\n     if (r < f || l > t) return;\n     if (l <= f && t <= r) {\n       change(x);\n       return;\n     }\n     push();\n     lc->update(l, r, x);\n     rc->update(l, r, x);\n     vmax = max(lc->vmax, rc->vmax);\n   }\n   int query(int l, int r) {\n     if (r < f || l > t) return 0;\n     if (l <= f && t <= r) return vmax;\n     return vmax = max(lc->query(l, r), rc->query(l, r));\n   }\n };\n void solve() {\n   int n, k;\n   cin >> n >> k;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   stack<int> st;\n   for (int i = n - 1; i >= 0; i--) {\n     while (!st.empty() && a[st.top()] <= a[i]) st.pop();\n     if (!st.empty())\n       nxt[i] = st.top();\n     else\n       nxt[i] = n;\n     st.push(i);\n   }\n   for (int i = 0; i < n; i++) g[nxt[i]].push_back(i);\n   function<void(int)> post = [&](int v) {\n     int l = (int)(nodes).size();\n     for (int u : g[v]) post(u);\n     lft[(int)(nodes).size()] = l;\n     nodes.push_back(v);\n   };\n   post(n);\n   SegmentTree root(0, n);\n   for (int i = 0; i < k; i++) root.update(lft[i], i, 1);\n   vector<int> ans;\n   ans.push_back(root.query(0, n));\n   for (int i = k; i < n; i++) {\n     root.update(lft[i - k], i - k, -1);\n     root.update(lft[i], i, 1);\n     ans.push_back(root.query(0, n));\n   }\n   for (int i = 0; i < (int)(ans).size(); i++) {\n     if (i) cout << ' ';\n     cout << ans[i];\n   }\n   cout << '\n';\n }\n int main(int argc, char *argv[]) {\n   cin.sync_with_stdio(0);\n   cin.tie(NULL);\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 2e5 + 100;\n long long a[N];\n pair<long long, long long> ask(long long l, long long r) {\n   cout << '? ' << l << ' ' << r << endl;\n   long long first;\n   cin >> first;\n   if (first == -1) exit(0);\n   long long f;\n   cin >> f;\n   return {first, f};\n }\n void solve(long long l, long long r) {\n   if (l > r) return;\n   long long first, f;\n   tie(first, f) = ask(l, r);\n   long long l1 = r + 1 - f, r1 = l - 1 + f;\n   if (l1 <= r1) {\n     for (long long i = l1; i <= r1; i++) a[i] = first;\n     solve(l, l1 - 1);\n     solve(r1 + 1, r);\n   } else {\n     long long m = (l + r) / 2;\n     solve(l, m);\n     solve(m + 1, r);\n   }\n }\n signed main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long n;\n   cin >> n;\n   solve(1, n);\n   cout << '! ';\n   for (long long i = 1; i <= n; i++) cout << a[i] << ' ';\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast,unroll-loops,fast-math')\n using namespace std;\n const int MAXN = 102, K = 900;\n int n, m, k, u, v, x, y, t, a, b;\n int A[MAXN];\n short F1[MAXN][MAXN][2 * MAXN];\n short F2[MAXN][MAXN][2 * MAXN];\n short F3[MAXN][MAXN][2 * MAXN];\n double dp[2][MAXN][MAXN];\n int C(int x) { return x * (x + 1) / 2; }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n >> k;\n   k = min(k, K);\n   for (int i = 0; i < n; i++) cin >> A[i];\n   for (int l = 0; l < n; l++)\n     for (int r = l; r < n; r++) {\n       for (int i = 0; i < n; i++)\n         for (int j = i + 1; j < n; j++) {\n           bool ii = (l <= i && i <= r);\n           bool jj = (l <= j && j <= r);\n           if (ii && !jj) F1[i][j][l + r]++;\n           if (!ii && jj) F2[i][j][l + r]++;\n           if (ii && jj) F3[i][j][l + r]++;\n         }\n     }\n   int prev = 0, curr = 1;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < i; j++) dp[0][i][j] = 1;\n   for (int x = 1; x <= k; x++) {\n     for (int i = 0; i < n; i++)\n       for (int j = i + 1; j < n; j++) {\n         dp[curr][i][j] = (C(i) + C(j - i - 1) + C(n - j - 1)) * dp[prev][i][j];\n         for (int cent = i; cent < n + i; cent++)\n           dp[curr][i][j] += F1[i][j][cent] * dp[prev][cent - i][j];\n         for (int cent = j; cent < n + j; cent++)\n           dp[curr][i][j] += F2[i][j][cent] * dp[prev][i][cent - j];\n         for (int cent = j; cent < n + i; cent++)\n           dp[curr][i][j] += F3[i][j][cent] * dp[prev][cent - i][cent - j];\n         dp[curr][i][j] /= C(n);\n         dp[curr][j][i] = 1. - dp[curr][i][j];\n       }\n     swap(prev, curr);\n   }\n   double ans = 0;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < n; j++)\n       if (A[i] < A[j]) ans += dp[prev][i][j];\n   cout << setprecision(12) << fixed << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int tab[n];\n   long long s = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> tab[i];\n     if (i == tab[i]) {\n       s++;\n       tab[i] = -1;\n     }\n   }\n   bool bo = false;\n   for (int i = 0; i < n; i++) {\n     if (tab[i] != -1) {\n       if (tab[tab[i]] == i) {\n         s += 2;\n         bo = false;\n         break;\n       }\n       bo = true;\n     }\n   }\n   if (bo) s++;\n   cout << s;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O2')\n using namespace std;\n string conv(int n) {\n   string kq = '';\n   while (n != 0) {\n     int r = n % 26;\n     if (r == 0) r = 26;\n     kq = char(r - 1 + 'A') + kq;\n     n = (n - r) / 26;\n   }\n   return kq;\n }\n int conv(string s) {\n   int kq = 0;\n   int n = s.size();\n   int tmp = 1;\n   for (int i = n - 1; i >= 0; i--) {\n     int k = int(s[i] - 'A') + 1;\n     kq += tmp * k;\n     tmp *= 26;\n   }\n   return kq;\n }\n int type(string s) {\n   if (s[0] != 'R') return 1;\n   if (s[1] >= 'A' && s[1] <= 'Z') return 1;\n   bool kt = false;\n   int n = s.size();\n   for (int i = 0; i <= n - 1; i++)\n     if (s[i] == 'C') {\n       kt = true;\n       break;\n     }\n   if (!kt) return 1;\n   return 2;\n }\n void chuyen(string s) {\n   if (type(s) == 1) {\n     int n = s.size();\n     string x1 = '';\n     int j = 0;\n     while (s[j] >= 'A' && s[j] <= 'Z') {\n       x1 += s[j];\n       j++;\n     }\n     cout << 'R';\n     for (int i = j; i <= n - 1; i++) cout << s[i];\n     cout << 'C' << conv(x1) << '\n';\n   }\n   if (type(s) == 2) {\n     int kq = 0;\n     int tmp = 1;\n     int j = s.size() - 1;\n     while (s[j] >= '0' && s[j] <= '9') {\n       kq += (s[j] - '0') * tmp;\n       tmp *= 10;\n       j--;\n     }\n     cout << conv(kq);\n     for (int i = 1; i <= j - 1; i++) cout << s[i];\n     cout << '\n';\n   }\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   while (n--) {\n     string s;\n     cin >> s;\n     chuyen(s);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solution() {\n   long long n;\n   cin >> n;\n   vector<vector<long long>> v(n, vector<long long>(n, 0));\n   if (n % 2 != 0) {\n     v[n - 1][(n - 1) / 2] = 1;\n     v[(n - 1) / 2][n - 1] = 1;\n   }\n   for (long long i = 0; i < n; i++) {\n     for (long long j = 0; j < n; j++) {\n       if (i == j || i == n - j - 1) v[i][j] = 1;\n       cout << v[i][j] << ' ';\n     }\n     cout << '\n';\n   }\n }\n int32_t main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   long long t;\n   cin >> t;\n   while (t--) solution();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n std::vector<int> V[200010], V2[200010];\n int check[200010];\n std::stack<int> St;\n void init(int k) {\n   if (check[k] == 1) return;\n   check[k] = 1;\n   for (int i = 0; i < V[k].size(); i++) init(V[k][i]);\n   St.push(k);\n }\n int color[200010];\n void makeSCC(int k, int c) {\n   if (color[k] > 0) return;\n   color[k] = c;\n   for (int i = 0; i < V2[k].size(); i++) makeSCC(V2[k][i], c);\n }\n int x[200010], cost[200010];\n std::vector<int> V3[200010];\n int main() {\n   int a;\n   scanf('%d', &a);\n   for (int i = 1; i <= a; i++) scanf('%d', &x[i]);\n   for (int i = 1; i <= a; i++) {\n     int b;\n     scanf('%d', &b);\n     V[i].push_back(b);\n     V2[b].push_back(i);\n   }\n   for (int i = 1; i <= a; i++) init(i);\n   int c = 1;\n   while (!St.empty()) {\n     int k = St.top();\n     St.pop();\n     if (color[k] == 0) makeSCC(k, c++);\n   }\n   for (int i = 1; i <= a; i++) cost[i] = 123456789;\n   for (int i = 1; i <= a; i++)\n     cost[color[i]] = cost[color[i]] < x[i] ? cost[color[i]] : x[i];\n   for (int i = 1; i <= a; i++)\n     if (color[i] != color[V[i][0]]) V3[color[i]].push_back(color[V[i][0]]);\n   long long int ans = 0;\n   for (int i = 1; i <= a; i++)\n     if (V3[i].size() == 0 && cost[i] < 123456789) ans += cost[i];\n   printf('%lld', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int n, ust, x, y, mark[10];\n int main() {\n   scanf('%d', &n);\n   scanf('%d', &ust);\n   for (int i = 0; i < n; i++) {\n     scanf('%d %d', &x, &y);\n     mark[x] = 1;\n     mark[y] = 1;\n     mark[7 - x] = 1;\n     mark[7 - y] = 1;\n     if (!mark[7 - ust])\n       for (int j = 0; j < 7; j++) mark[j] = 0;\n     else {\n       printf('NO\n');\n       return 0;\n     }\n   }\n   printf('YES\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n;\n   cin >> n;\n   cout << n / (2520LL);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1000001;\n int n, kt[N], a[N], cnt, x[N];\n long long k, s;\n long long cal(int i) {\n   long long res = i;\n   return res * (res + 1) / 2;\n }\n int main() {\n   scanf('%d%lld', &n, &k);\n   if (k < cal(n)) {\n     printf('-1');\n     return 0;\n   }\n   for (int i = n; i > 0; i--) {\n     int h = n - (n - i) / 2;\n     if (k - h < cal(i - 1)) h = k - cal(i - 1);\n     k -= h;\n     kt[h]++;\n     if (kt[h] == 2) a[++cnt] = h;\n   }\n   for (int i = 1; i <= n; i++) s += kt[i] * i;\n   printf('%lld\n', s);\n   for (int i = 1; i <= n; i++) {\n     if (kt[i] == 1)\n       x[i] = i;\n     else if (kt[i] == 0) {\n       x[a[cnt]] = i;\n       x[i] = a[cnt];\n       cnt--;\n     }\n   }\n   for (int i = 1; i <= n; i++) printf('%d ', i);\n   printf('\n');\n   for (int i = 1; i <= n; i++) printf('%d ', x[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   int n, m, q;\n   cin >> n >> m >> q;\n   vector<vector<int>> r(n), c(m);\n   for (int i = 0; i < q; ++i) {\n     int x, y;\n     cin >> x >> y;\n     --x;\n     --y;\n     r[x].push_back(y);\n     c[y].push_back(x);\n   }\n   if (n == 1) {\n     cout << m - q;\n     return 0;\n   }\n   if (m == 1) {\n     cout << n - q;\n     return 0;\n   }\n   vector<char> used_row(n, false);\n   vector<char> used_col(m, false);\n   int ans = 0;\n   vector<int> cols_to_add(r[0]), next_cols_to_add;\n   used_row[0] = true;\n   for (int i = 0; i < m; ++i) {\n     if (used_col[i]) continue;\n     while (!cols_to_add.empty()) {\n       next_cols_to_add.clear();\n       for (int col : cols_to_add) {\n         if (used_col[col]) continue;\n         used_col[col] = true;\n         for (int row : c[col]) {\n           if (used_row[row]) continue;\n           used_row[row] = true;\n           for (int new_col : r[row]) {\n             next_cols_to_add.push_back(new_col);\n           }\n         }\n       }\n       cols_to_add = next_cols_to_add;\n     }\n     if (!used_col[i]) {\n       ++ans;\n       cols_to_add.push_back(i);\n     }\n   }\n   while (!cols_to_add.empty()) {\n     next_cols_to_add.clear();\n     for (int col : cols_to_add) {\n       if (used_col[col]) continue;\n       used_col[col] = true;\n       for (int row : c[col]) {\n         if (used_row[row]) continue;\n         used_row[row] = true;\n         for (int new_col : r[row]) {\n           next_cols_to_add.push_back(new_col);\n         }\n       }\n     }\n     cols_to_add = next_cols_to_add;\n   }\n   for (int i = 1; i < n; ++i) {\n     if (!used_row[i]) {\n       ++ans;\n     }\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n bool canWin(long long b, long long e) {\n   if (e % 2 == 1) {\n     return b % 2 == 0;\n   } else if (e < 2 * b) {\n     return b % 2 == 1;\n   } else if (e < 4 * b) {\n     return 1;\n   } else {\n     return canWin(b, e / 4);\n   }\n }\n bool canLose(long long b, long long e) {\n   if (e < 2 * b) {\n     return 1;\n   } else if (e / 2 % 2 == 1) {\n     return b % 2 == 0;\n   } else if (e < 4 * b) {\n     return b % 2 == 1;\n   } else {\n     return canLose(b, e / 4);\n   }\n }\n int main() {\n   int t;\n   scanf('%d', &t);\n   bool canBeWinner, canBeLoser;\n   bool canBeFirst = true;\n   bool canBeSecond = false;\n   for (int i = 0; i < t; i++) {\n     long long b, e;\n     scanf('%lld%lld', &b, &e);\n     bool cWin = canWin(b, e);\n     bool cLose = canLose(b, e);\n     canBeWinner = (canBeFirst && cWin) || (canBeSecond && !cWin);\n     canBeLoser = (canBeFirst && cLose) || (canBeSecond && !cLose);\n     canBeFirst = canBeLoser;\n     canBeSecond = canBeWinner;\n   }\n   printf('%d %d\n', canBeWinner, canBeLoser);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<N> 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<int> 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<int>(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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\n using namespace std;\n vector<int> g[100100];\n int aa[100100];\n long long dfs(int u, int fa) {\n   vector<long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int limit = 10000;\n int query(vector<long long> &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<vector<long long>> dp(6, vector<long long>(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<long long> hoge;\n     long long x = lb;\n     for (int i = 0; i < min(10000LL, lb); i++) {\n       x += dp[q - 1][min((long long)10000, x)];\n       hoge.push_back(x);\n       x++;\n     }\n     x += dp[q - 1][min(10000LL, x)];\n     int k = query(hoge);\n     if (k == 0) {\n       ub = hoge[0] - 1;\n     } else if (k == (int)hoge.size()) {\n       lb = hoge.back() + 1;\n     } else {\n       lb = hoge[k - 1] + 1;\n       ub = hoge[k] - 1;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = (int)1e5 + 10;\n int sx[MAXN], sy[MAXN], sz[MAXN];\n char s[MAXN];\n void solve(int x, int y, int z) {\n   if (x + y + z < 3) {\n     printf('YES\n');\n     return;\n   }\n   int e = (x + y + z) / 3;\n   vector<int> v;\n   v.push_back(x);\n   v.push_back(y);\n   v.push_back(z);\n   sort(v.begin(), v.end());\n   if ((x + y + z) % 3 == 0) {\n     if (x == e && y == e && z == e)\n       printf('YES\n');\n     else\n       printf('NO\n');\n     return;\n   } else if ((x + y + z) % 3 == 1) {\n     if (v[2] == e + 1 && v[1] == e)\n       printf('YES\n');\n     else\n       printf('NO\n');\n     return;\n   } else {\n     if (v[2] == e + 1 && v[1] == e + 1)\n       printf('YES\n');\n     else\n       printf('NO\n');\n     return;\n   }\n }\n int main() {\n   scanf('%s', s);\n   int n = strlen(s);\n   for (int i = 1; i <= n; i++) {\n     sx[i] = sx[i - 1] + (s[i - 1] == 'x');\n     sy[i] = sy[i - 1] + (s[i - 1] == 'y');\n     sz[i] = sz[i - 1] + (s[i - 1] == 'z');\n   }\n   int m;\n   scanf('%d', &m);\n   for (int i = 1; i <= m; i++) {\n     int l, r;\n     scanf('%d%d', &l, &r);\n     int x = sx[r] - sx[l - 1], y = sy[r] - sy[l - 1], z = sz[r] - sz[l - 1];\n     solve(x, y, z);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long int siz = 3e5 + 5;\n map<int, vector<int>> adjList;\n long long int ans[siz] = {0};\n long long int cum[siz] = {0};\n map<long long int, long long int> q[siz];\n void dfs(int cur, int parent, int level, long long int val) {\n   for (pair<long long int, long long int> temp : q[cur]) {\n     cum[level] += temp.second;\n     cum[min(level + temp.first + 1, siz - 1)] -= temp.second;\n   }\n   val += cum[level];\n   ans[cur] = val;\n   for (int child : adjList[cur]) {\n     if (child != parent) {\n       dfs(child, cur, level + 1, val);\n     }\n   }\n   for (pair<long long int, long long int> temp : q[cur]) {\n     cum[level] -= temp.second;\n     cum[min(level + temp.first + 1, siz - 1)] += temp.second;\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   ;\n   int n;\n   cin >> n;\n   int y;\n   long long int x;\n   for (int i = 0; i < (int)(n - 1); i++) {\n     cin >> x >> y;\n     adjList[x].push_back(y);\n     adjList[y].push_back(x);\n   }\n   int m;\n   cin >> m;\n   int d, v;\n   for (int i = 0; i < (int)(m); i++) {\n     cin >> v >> d >> x;\n     q[v][d] += x;\n   }\n   dfs(1, -1, 1, 0);\n   for (int i = 1; i <= (int)(n); i++) {\n     cout << ans[i] << ' ';\n   }\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n unsigned long long n, a[130], i, b = 1, f[10002];\n int main() {\n   cin >> n;\n   for (i = 1; i <= n; i++) {\n     cin >> a[i];\n     f[a[i]]++;\n   }\n   sort(a + 1, a + n + 1);\n   cout << a[n] << ' ';\n   for (i = 1; i < n; i++) {\n     if (f[a[i]] == 1 && a[n] % a[i] != 0) {\n       b = a[i];\n     } else if (f[a[i]] == 2) {\n       b = a[i];\n     }\n   }\n   cout << b;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long MOD = 998244353;\n inline long long Msum(long long x) { return x; }\n template <typename... Rest>\n inline long long Msum(long long x, Rest... rest) {\n   return (x + Msum(rest...)) % MOD;\n }\n inline long long Mprod(long long x) { return x; }\n template <typename... Rest>\n inline long long Mprod(long long x, Rest... rest) {\n   return x * Mprod(rest...) % MOD;\n }\n inline long long Mnorm(long long x) { return (x % MOD + MOD) % MOD; }\n long long Msq(long long x) { return x * x % MOD; }\n long long Mpow(long long b, long long e) {\n   return e ? Mprod(Msq(Mpow(b, e >> 1)), (e & 1 ? b : 1)) : 1;\n }\n long long Minv(long long x) { return Mpow(x, MOD - 2); }\n const int MAXN = 51;\n int sns[MAXN], w[MAXN];\n int wi, sn;\n int sl, sd, S;\n long long dp[MAXN][MAXN][MAXN];\n long long f(int h, int hl, int hd, int t) {\n   if (!t) return 0;\n   long long &ret = dp[h][hl][hd];\n   if (ret != -1) return ret;\n   ret = 0;\n   long long cS = S + hl - hd + sn * h;\n   ret += Mprod(wi + sn * h, Minv(cS), 1 + f(h + 1, hl, hd, t - 1));\n   ret = Mnorm(ret);\n   ret += Mprod(sl + hl, Minv(cS), f(h, hl + 1, hd, t - 1));\n   ret = Mnorm(ret);\n   ret += Mprod(sd - hd, Minv(cS), f(h, hl, hd + 1, t - 1));\n   ret = Mnorm(ret);\n   assert(sd - hd + sl + hl + wi + sn * h == cS);\n   return ret;\n }\n int main() {\n   int n, m;\n   scanf('%d %d', &n, &m);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &sns[i]);\n     sns[i] = sns[i] * 2 - 1;\n   }\n   for (int i = 0; i < n; i++) {\n     scanf('%d', &w[i]);\n   }\n   for (int i = 0; i < n; i++) {\n     S = sl = sd = 0;\n     wi = w[i];\n     sn = sns[i];\n     for (int j = 0; j < (int)n; j++) {\n       S += w[j];\n       if (j != i) {\n         if (sns[j] == 1)\n           sl += w[j];\n         else\n           sd += w[j];\n       }\n     }\n     memset(dp, -1, sizeof(dp));\n     printf('%lld\n', Mnorm(wi + sn * f(0, 0, 0, m)));\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1111111;\n int a[N];\n int n, k;\n vector<int> prime, p;\n void Getprime() {\n   for (int i = 2; i <= 1000; i++) {\n     bool bo = 1;\n     for (int j = 2; j * j <= i; j++) {\n       if (i % j == 0) {\n         bo = 0;\n         break;\n       }\n     }\n     if (bo) {\n       prime.push_back(i);\n     }\n   }\n }\n int main() {\n   Getprime();\n   scanf('%d%d', &n, &k);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &a[i]);\n   }\n   int K = k;\n   for (int i = 0; i < prime.size() && prime[i] * prime[i] <= k; ++i) {\n     int t = prime[i];\n     if (k % t == 0) {\n       int m = 1;\n       while (K % t == 0 && K) {\n         m *= t;\n         K /= t;\n       }\n       p.push_back(m);\n     }\n   }\n   if (K != 1) {\n     p.push_back(K);\n   }\n   for (int i = 0; i < p.size(); ++i) {\n     int pr = p[i];\n     bool flag = false;\n     for (int j = 1; j <= n; ++j) {\n       if (a[j] % pr == 0) {\n         flag = true;\n         break;\n       }\n     }\n     if (!flag) {\n       puts('No');\n       return 0;\n     }\n   }\n   puts('Yes');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline void smn(T &a, const T &b) {\n   if (b < a) a = b;\n }\n template <class T>\n inline void smx(T &a, const T &b) {\n   if (b > a) a = b;\n }\n template <class T>\n inline T gcd(T x, T y) {\n   return y ? gcd(y, x % y) : x;\n }\n namespace std {\n template <class T, class U>\n struct hash<pair<T, U>> {\n   inline size_t operator()(const pair<T, U> &p) const {\n     return hash<T>()(p.first) * 701 + hash<U>()(p.second);\n   }\n };\n }  // namespace std\n const double eps = 1e-8;\n const int key = 701;\n const int MN = 1000 * 1000 + 1000;\n string s;\n long long h1[MN], pw1[MN], h2[MN], pw2[MN];\n const int MOD = 1000 * 1000 * 1000 + 7;\n long long add[MN];\n int n, k;\n pair<long long, long long> get(int s, int e) {\n   long long res1 = h1[e];\n   if (s != 0) res1 -= pw1[e - s + 1] * h1[s - 1];\n   long long res2 = h2[e];\n   if (s != 0) res2 -= pw2[e - s + 1] * h2[s - 1], res2 %= MOD;\n   if (res2 < 0) res2 += MOD;\n   return make_pair(res1, res2);\n }\n bool check(int l) {\n   auto v = get(0, l - 1);\n   int now = l;\n   for (int i = 1; i < k; i++) {\n     if (get(now, now + l - 1) != v) return 0;\n     now += l;\n   }\n   return 1;\n }\n int fnd(int p) {\n   int s = 1, e = n - p, res = 0;\n   while (s <= e) {\n     int m = (s + e) / 2;\n     if (get(0, m - 1) == get(p, p + m - 1))\n       res = m, s = m + 1;\n     else\n       e = m - 1;\n   }\n   return res;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin >> n >> k >> s;\n   long long now = 0;\n   for (int i = 0; i < n; i++) now = now * 701 + s[i], h1[i] = now;\n   pw1[0] = 1;\n   for (int i = 1; i <= n; i++) pw1[i] = 701 * pw1[i - 1];\n   now = 0;\n   for (int i = 0; i < n; i++) now = (now * 701 + s[i]) % MOD, h2[i] = now;\n   pw2[0] = 1;\n   for (int i = 1; i <= n; i++) pw2[i] = (701 * pw2[i - 1]) % MOD;\n   for (int i = 1; i <= n; i++)\n     if (n / i >= k && check(i)) {\n       int t = i * k;\n       int b = fnd(t);\n       smn(b, i);\n       add[t - 1] += 1;\n       add[t + b] += -1;\n     }\n   now = 0;\n   for (int i = 0; i < n; i++) {\n     now += add[i];\n     cout << (now ? 1 : 0);\n   }\n   cout << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int upd(int& a, int b) { return a = min(a, b); }\n inline int _abs(int x) { return x > 0 ? x : -x; }\n char c;\n int n, cnt[3], type[80];\n int pos[3][80], leq[3][80];\n int dp[80][80][80][80];\n void getpos(void) {\n   for (int p = 0; p <= 2; p++) {\n     cnt[p] = 0;\n     for (int y = 1; y <= n; y++) {\n       while (y <= n && type[y] != p) y++;\n       if (y <= n) pos[p][++cnt[p]] = y;\n     }\n     leq[p][0] = 0;\n     for (int i = 1; i <= n; i++) leq[p][i] = leq[p][i - 1] + (type[i] == p);\n   }\n   return;\n }\n void trans(int i, int j, int k, int lst) {\n   int p0 = pos[0][i], p1 = pos[1][j], p2 = pos[2][k];\n   if (i > 0)\n     upd(dp[0][i][j][k],\n         dp[lst][i - 1][j][k] + _abs(j - leq[1][p0]) + _abs(k - leq[2][p0]));\n   if (j > 0)\n     upd(dp[1][i][j][k],\n         dp[lst][i][j - 1][k] + _abs(i - leq[0][p1]) + _abs(k - leq[2][p1]));\n   if (k > 0 && lst != 1)\n     upd(dp[2][i][j][k],\n         dp[lst][i][j][k - 1] + _abs(i - leq[0][p2]) + _abs(j - leq[1][p2]));\n   return;\n }\n int main(void) {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf(' %c', &c);\n     type[i] = (c == 'V' ? 1 : (c == 'K' ? 2 : 0));\n   }\n   getpos();\n   memset(dp, 0x1f, sizeof(dp));\n   dp[0][0][0][0] = 0;\n   for (int i = 0; i <= cnt[0]; i++)\n     for (int j = 0; j <= cnt[1]; j++)\n       for (int k = 0; k <= cnt[2]; k++)\n         for (int lst = 0; lst <= 2; lst++) trans(i, j, k, lst);\n   int ans = n * n;\n   for (int i = 0; i <= 2; i++) upd(ans, dp[i][cnt[0]][cnt[1]][cnt[2]]);\n   printf('%d\n', ans >> 1);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 2000000;\n int xx[1111111], yy[1111111];\n int pos[1111111], n, m, op[1111111], np[1111111], ff;\n int owner[3333333], first[3333333];\n int ans[1111111];\n bool used[1111111];\n void imp() {\n   puts('-1');\n   exit(0);\n }\n inline int sum(int x) {\n   int r = 0;\n   while (x >= 0) {\n     r += first[x];\n     x = (x & (x + 1)) - 1;\n   }\n   return r;\n }\n inline void add(int x, int d) {\n   while (x <= maxn) {\n     first[x] += d;\n     x = (x | (x + 1));\n   }\n }\n inline int getFirst(int x) {\n   int l = -1, r = maxn;\n   while (r - l > 1) {\n     int mid = ((l + r) >> 1);\n     if (sum(mid) >= x) {\n       r = mid;\n     } else {\n       l = mid;\n     }\n   }\n   return r;\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < m; ++i) {\n     scanf('%d%d', &xx[i], &yy[i]);\n     --xx[i];\n   }\n   memset(owner, -1, sizeof(owner));\n   memset(pos, -1, sizeof(pos));\n   int ff = m;\n   for (int i = 1; i <= n; ++i) {\n     add(ff + i, 1);\n   }\n   for (int i = 0; i < m; ++i) {\n     int &oldPlace = op[i];\n     int &newPlace = np[i];\n     int &x = xx[i];\n     int &y = yy[i];\n     oldPlace = getFirst(y);\n     if ((pos[x] != -1 && oldPlace != pos[x]) ||\n         (owner[oldPlace] != -1 && owner[oldPlace] != x)) {\n       imp();\n     }\n     newPlace = ff--;\n     owner[oldPlace] = -1;\n     add(oldPlace, -1);\n     add(newPlace, 1);\n     pos[x] = newPlace;\n     owner[newPlace] = x;\n   }\n   for (int i = m - 1; i >= 0; --i) {\n     int &oldPlace = op[i];\n     int &newPlace = np[i];\n     int &x = xx[i];\n     int &y = yy[i];\n     pos[x] = oldPlace;\n     owner[oldPlace] = x;\n     add(oldPlace, 1);\n     owner[newPlace] = -1;\n     add(newPlace, -1);\n   }\n   memset(ans, -1, sizeof(ans));\n   for (int i = 0; i < n; ++i)\n     if (pos[i] != -1) {\n       int p = sum(pos[i]);\n       ans[p - 1] = i;\n       used[i] = true;\n     }\n   int fx = 0;\n   for (int i = 0; i < n; ++i)\n     if (ans[i] == -1) {\n       while (used[fx]) {\n         ++fx;\n       }\n       ans[i] = fx;\n       used[fx] = true;\n     }\n   for (int i = 0; i < n; ++i) {\n     if (i > 0) {\n       putchar(' ');\n     }\n     printf('%d', ans[i] + 1);\n   }\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long spf[100001];\n bool isPrime(long long n) {\n   if (n <= 1) return false;\n   if (n <= 3) return true;\n   if (n % 2 == 0 || n % 3 == 0) return false;\n   for (long long i = 5; i * i <= n; i = i + 6)\n     if (n % i == 0 || n % (i + 2) == 0) return false;\n   return true;\n }\n long long power(long long a, long long b) {\n   long long res = 1;\n   while (b > 0) {\n     if (b & 1) res = (res * a);\n     a = (a * a);\n     b >>= 1;\n   }\n   return res;\n }\n long long modpow(long long a, long long b, long long x) {\n   long long res = 1;\n   while (b > 0) {\n     if (b & 1) res = (res * a) % x;\n     a = (a * a) % x;\n     b >>= 1;\n   }\n   return res;\n }\n void sieve() {\n   spf[1] = 1;\n   for (long long i = 2; i < 100001; i++) spf[i] = i;\n   for (long long i = 4; i < 100001; i += 2) spf[i] = 2;\n   for (long long i = 3; i * i < 100001; i++)\n     if (spf[i] == i)\n       for (long long j = i * i; j < 100001; j += i)\n         if (spf[j] == j) spf[j] = i;\n }\n vector<long long> getFactorization(long long x) {\n   vector<long long> ret;\n   while (x != 1) {\n     ret.push_back(spf[x]);\n     x = x / spf[x];\n   }\n   return ret;\n }\n void solve() {\n   long long n, m;\n   cin >> n >> m;\n   vector<long long> adj[n + 1];\n   for (int i = 0; i < m; i++) {\n     long long a, b;\n     cin >> a >> b;\n     adj[a].push_back(b);\n     adj[b].push_back(a);\n   }\n   vector<pair<long long, long long>> topic(n);\n   for (int i = 0; i < n; i++) {\n     long long a;\n     cin >> a;\n     topic[i] = {a, i + 1};\n   }\n   sort(topic.begin(), topic.end());\n   vector<long long> res;\n   vector<set<long long>> around(n + 1);\n   for (int i = 0; i < topic.size(); i++) {\n     long long u = topic[i].second;\n     res.push_back(u);\n     if (around[u].find(topic[i].first) != around[u].end() ||\n         around[u].size() != topic[i].first - 1) {\n       cout << -1 << '\n';\n       return;\n     }\n     for (auto j : adj[u]) {\n       around[j].insert(topic[i].first);\n     }\n   }\n   for (auto i : res) cout << i << ' ';\n   cout << '\n';\n   ;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long t = 1;\n   while (t--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 5;\n vector<long long> v[N];\n long long vis[N];\n long long col[N];\n set<long long> che;\n void dfs(long long x) {\n   vis[x] = 1;\n   che.insert(x);\n   for (auto it : v[x]) {\n     if (!vis[it]) {\n       dfs(it);\n     }\n   }\n }\n void solve() {\n   long long n;\n   cin >> n;\n   long long i, x, y;\n   vector<pair<long long, long long> > e, spe;\n   for (i = 0; i < n - 1; i++) {\n     cin >> x >> y;\n     x--, y--;\n     e.push_back(make_pair(x, y));\n   }\n   for (i = 0; i < n; i++) {\n     cin >> col[i];\n   }\n   for (auto it : e) {\n     if (col[it.first] != col[it.second]) {\n       spe.push_back(make_pair(it.first, it.second));\n     }\n   }\n   long long m = spe.size();\n   long long f = 0, ind = 0;\n   long long cnt[n];\n   memset(cnt, 0, sizeof(cnt));\n   if (m == 0) {\n     cout << 'YES\n1';\n     return;\n   }\n   for (auto it : spe) {\n     cnt[it.first]++;\n     cnt[it.second]++;\n   }\n   for (i = 0; i < n; i++) {\n     if (cnt[i] == m) {\n       cout << 'YES\n' << i + 1;\n       return;\n     }\n   }\n   cout << 'NO\n';\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   if (fopen('input.txt', 'r')) {\n     freopen('input.txt', 'r', stdin);\n     freopen('output.txt', 'w', stdout);\n   }\n   long long t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n;\n   cin >> n;\n   int zD = 1;\n   int zABC = 0;\n   for (int i = 1; i <= n; i++) {\n     int nzD = zABC * 3LL % 1000000007;\n     int nzABC = (zABC * 2LL + zD) % 1000000007;\n     zD = nzD;\n     zABC = nzABC;\n   }\n   cout << zD;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     int n, m;\n     cin >> n >> m;\n     auto chk = [&](int x, int y) { return 0 <= x && x < n && 0 <= y && y < m; };\n     vector<int> nxt(n * m, -1), deg(n * m), dp(n * m), dp2(n * m);\n     for (int i = 0; i < n; ++i) {\n       for (int j = 0; j < m; ++j) {\n         char c;\n         cin >> c;\n         int x = i, y = j;\n         if (c == 'L') --y;\n         if (c == 'R') ++y;\n         if (c == 'U') --x;\n         if (c == 'D') ++x;\n         if (chk(x, y)) {\n           nxt[i * m + j] = x * m + y;\n           deg[x * m + y] += 1;\n         }\n       }\n     }\n     for (int i = 0; i < n * m; ++i) dp2[i] = i;\n     queue<int> q;\n     for (int i = 0; i < n * m; ++i)\n       if (deg[i] == 0) q.push(i);\n     while (!q.empty()) {\n       int u = q.front();\n       q.pop();\n       if (nxt[u] != -1) {\n         int v = nxt[u];\n         if (dp[v] < dp[u] + 1) {\n           dp[v] = dp[u] + 1;\n           dp2[v] = dp2[u];\n         }\n         if (--deg[v] == 0) q.push(v);\n       }\n     }\n     int ans = 0;\n     for (int i = 0; i < n * m; ++i) {\n       if (deg[i] == 0) continue;\n       int p = nxt[i];\n       vector<int> loop;\n       while (p != i) {\n         loop.push_back(p);\n         p = nxt[p];\n       }\n       loop.push_back(i);\n       for (int j : loop) dp[j] += loop.size() - 1, deg[j] = 0;\n     }\n     int mx = -1, x = -1, y = -1;\n     for (int i = 0; i < n; ++i) {\n       for (int j = 0; j < m; ++j) {\n         if (dp[i * m + j] > mx) {\n           mx = dp[i * m + j];\n           x = dp2[i * m + j] / m;\n           y = dp2[i * m + j] % m;\n         }\n       }\n     }\n     cout << x + 1 << ' ' << y + 1 << ' ' << mx + 1 << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void addmod(int &a, long long b) {\n   a = (a + b);\n   if (a >= 1000000007) a -= 1000000007;\n }\n void mulmod(int &a, long long b) { a = (a * b) % 1000000007; }\n int gi() {\n   int a;\n   scanf('%d', &a);\n   return a;\n }\n long long gll() {\n   long long a;\n   scanf('%lld', &a);\n   return a;\n }\n class rangesum {\n   vector<long long> s;\n \n  public:\n   rangesum(const vector<int> &inp, const int &n) {\n     s.resize(n + 1);\n     for (int i = 0; i < n; i++) s[i + 1] = s[i] + inp[i];\n   }\n   long long get(int x, int y) { return s[y + 1] - s[x]; }\n };\n int main() {\n   int n = gi(), l, u;\n   vector<int> a(n);\n   for (auto i = 0; i < n; i++) {\n     a[i] = gi();\n   }\n   rangesum rs(a, n);\n   set<int> rm;\n   multiset<long long, greater<long long>> v;\n   rm.insert(-1);\n   rm.insert(n);\n   v.insert(rs.get(0, n - 1));\n   for (int i = 0; i < n; i++) {\n     int ix = gi() - 1;\n     auto it = rm.upper_bound(ix);\n     u = (*it) - 1;\n     it--;\n     l = (*it) + 1;\n     auto mit = v.find(rs.get(l, u));\n     assert(mit != v.end());\n     v.erase(mit);\n     if (ix > l) v.insert(rs.get(l, ix - 1));\n     if (ix < u) v.insert(rs.get(ix + 1, u));\n     rm.insert(ix);\n     printf('%lld\n', (v.size() ? *v.begin() : 0));\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long BIG = 1000000000000000000LL;\n void solve();\n signed main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   solve();\n   return 0;\n }\n long long nbBoxes;\n long long reqSom = 0;\n bool cycor[1 << 15];\n pair<long long, pair<long long, long long> > cymem[1 << 15];\n long long dpGo[1 << 15];\n long long origSom[15];\n vector<long long> yolo[15];\n map<long long, long long> loc;\n map<long long, long long> ds;\n vector<long long> maskOk;\n pair<long long, long long> finRes[15];\n long long osef[15];\n long long getMap(long long x) {\n   auto it = loc.find(x);\n   if (it == loc.end())\n     return -1;\n   else\n     return it->second;\n }\n void tester(long long dep, long long valEnvoi, long long suiv,\n             bool act = false) {\n   if (dep == suiv) {\n     if (origSom[dep] == reqSom) {\n       cycor[1LL << dep] = true;\n       cymem[1LL << dep] = {dep, {valEnvoi, suiv}};\n       if (act) finRes[dep] = {dep, osef[dep]};\n     }\n     return;\n   }\n   long long gauche = dep;\n   long long cg = reqSom - (origSom[dep] - valEnvoi);\n   long long mask = (1LL << gauche);\n   if (act) finRes[dep] = {suiv, valEnvoi};\n   while (true) {\n     long long prev = gauche;\n     gauche = getMap(cg);\n     if (gauche != -1 && act) finRes[gauche] = {prev, cg};\n     if (gauche == -1 || gauche == dep) break;\n     if (mask & (1LL << gauche)) break;\n     cg = reqSom - (origSom[gauche] - cg);\n     mask |= (1LL << gauche);\n   }\n   if (gauche == dep && cg == valEnvoi) {\n     cycor[mask] = true;\n     cymem[mask] = {dep, {valEnvoi, suiv}};\n   }\n }\n void solve() {\n   cin >> nbBoxes;\n   for (long long i = (0); i < (nbBoxes); ++i) {\n     long long ni;\n     cin >> ni;\n     for (long long i00 = (0); i00 < (ni); ++i00) {\n       long long x;\n       cin >> x;\n       yolo[i].push_back(x);\n       reqSom += x;\n       origSom[i] += x;\n       loc[x] = i;\n       osef[i] = x;\n     }\n   }\n   if (reqSom % nbBoxes != 0) {\n     cout << 'No\n';\n     return;\n   }\n   reqSom /= nbBoxes;\n   for (long long i = (0); i < (nbBoxes); ++i) {\n     for (long long x : yolo[i]) {\n       tester(i, x, -1);\n       tester(i, x, i);\n     }\n   }\n   for (long long i = (0); i < ((1 << 15)); ++i) {\n     dpGo[i] = -1;\n   }\n   dpGo[0] = 0;\n   for (long long mask = 1; mask < (1 << 15); ++mask) {\n     for (long long s = mask; s > 0; s = ((s - 1) & mask)) {\n       if (cycor[s] && dpGo[mask ^ s] != -1) {\n         dpGo[mask] = s;\n         break;\n       }\n     }\n   }\n   long long cur = (1LL << nbBoxes) - 1;\n   while (dpGo[cur] != 0) {\n     if (dpGo[cur] == -1) {\n       cout << 'No\n';\n       return;\n     }\n     long long ret = dpGo[cur];\n     long long dep = cymem[ret].first, valEnv = cymem[ret].second.first,\n               suiv = cymem[ret].second.second;\n     tester(dep, valEnv, suiv, true);\n     cur ^= ret;\n   }\n   cout << 'Yes\n';\n   for (long long i = (0); i < (nbBoxes); ++i)\n     cout << finRes[i].second << ' ' << finRes[i].first + 1 << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, k, a[300010], sum[300010], ans;\n int main() {\n   scanf('%lld%lld', &n, &k);\n   for (int i = 1; i <= n; i++) scanf('%lld', &a[i]);\n   for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];\n   ans += k * sum[n];\n   sort(sum + 1, sum + n);\n   for (int i = 1; i < k; i++) ans -= sum[i];\n   printf('%lld', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using LL = long long;\n using LD = long double;\n using ULL = unsigned long long;\n template <class T1, class T2>\n using P = pair<T1, T2>;\n using PII = P<int, int>;\n using PLL = P<LL, LL>;\n using PLD = P<LD, LD>;\n template <class T>\n using V = vector<T>;\n using VI = V<int>;\n using VLL = V<LL>;\n using VLD = V<LD>;\n using VB = V<bool>;\n using VS = V<string>;\n template <class T, class Comp = greater<T>>\n using PQ = priority_queue<T, V<T>, Comp>;\n template <class T>\n int sz(const T& x) {\n   return (int)size(x);\n }\n template <class T>\n bool amin(T& a, const T& b) {\n   if (b < a) {\n     a = b;\n     return true;\n   }\n   return false;\n }\n template <class T>\n bool amax(T& a, const T& b) {\n   if (b > a) {\n     a = b;\n     return true;\n   }\n   return false;\n }\n const size_t rseed =\n     std::chrono::high_resolution_clock::now().time_since_epoch().count();\n mt19937 rnd(rseed);\n int randint(int lo, int hi) {\n   return uniform_int_distribution<int>{lo, hi}(rnd);\n }\n int main() {\n   int T;\n   scanf('%d', &T);\n   for (int t = (1); t <= (T); t++) {\n     int n;\n     scanf('%d', &n);\n     string s(n + 1, ' ');\n     scanf('%s', &s[0]);\n     string a(n, ' '), b(n, ' ');\n     bool f = false;\n     for (int i = (0); i <= (n - 1); i++) {\n       if (f) {\n         a[i] = '0';\n         b[i] = s[i];\n       } else {\n         if (s[i] == '1') {\n           f = true;\n           a[i] = '1';\n           b[i] = '0';\n         } else if (s[i] == '2')\n           a[i] = b[i] = '1';\n         else\n           a[i] = b[i] = '0';\n       }\n     }\n     printf('%s\n%s\n', a.c_str(), b.c_str());\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int seq[100];\n int main() {\n   int n;\n   int acc, t, pen;\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     scanf('%d', seq + i);\n   }\n   sort(seq, seq + n);\n   acc = 10;\n   t = 0;\n   pen = 0;\n   for (int i = 0; i < n; i++) {\n     acc += seq[i];\n     if (acc > 720) {\n       break;\n     }\n     t++;\n     if (acc > 360) {\n       pen += ((acc - 360) < 0 ? -(acc - 360) : (acc - 360));\n     }\n   }\n   printf('%d %d\n', t, pen);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n;\n   cin >> n;\n   if ((n * n) % 2 == 0) {\n     cout << '2\n';\n   } else {\n     cout << '1\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long maxx = 1e5 + 20, sqr = 150, mod = 1e9 + 7;\n long long len, n, dp[maxx][sqr][2], q, pw25[maxx], pw26[maxx], pwmod[maxx],\n     fac[maxx], tmp[maxx];\n string s;\n long long pw(long long a, long long b) {\n   if (!b) return 1ll;\n   long long x = pw(a, b / 2);\n   x = (x * x) % mod;\n   if (b % 2) x = (x * a) % mod;\n   return x;\n }\n long long sel(long long a, long long b) {\n   long long x = 1ll;\n   x = (x * fac[a]) % mod;\n   x = (x * pwmod[b]) % mod;\n   x = (x * pwmod[a - b]) % mod;\n   return x;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   pw25[0] = pw26[0] = 1;\n   for (long long i = 1; i < maxx; i++)\n     pw25[i] = (pw25[i - 1] * 25) % mod, pw26[i] = (pw26[i - 1] * 26) % mod;\n   fac[0] = 1;\n   for (long long i = 1; i < maxx; i++) fac[i] = (fac[i - 1] * i) % mod;\n   for (long long i = 0; i < maxx; i++) pwmod[i] = pw(fac[i], mod - 2);\n   for (long long j = 0; j < sqr; j++) {\n     dp[j][j][1] = dp[j][j][0] = 1;\n     for (long long i = j + 1; i < maxx; i++) {\n       dp[i][j][0] = (((dp[i - 1][j][0] * 26) % mod) +\n                      (j >= 1 ? dp[i - 1][j - 1][1] : 0)) %\n                     mod;\n       dp[i][j][1] = (((dp[i - 1][j][1] * 25) % mod) +\n                      (j >= 1 ? dp[i - 1][j - 1][1] : 0)) %\n                     mod;\n     }\n   }\n   long long c = 0;\n   cin >> n >> s;\n   len = s.length();\n   if (len >= sqr) {\n     fill(tmp, tmp + maxx, 0);\n     tmp[len - 1] = 1;\n     for (long long j = len; j < maxx; j++)\n       tmp[j] = (((tmp[j - 1] * 26ll) % mod) +\n                 (((long long)sel(j, len - 1) * pw25[j + 1 - len]) % mod)) %\n                mod;\n   }\n   for (long long i = 0; i < n; i++) {\n     long long type;\n     cin >> type;\n     if (type == 1) {\n       cin >> s, len = s.length();\n       if (len >= sqr) {\n         fill(tmp, tmp + maxx, 0);\n         tmp[len - 1] = 1;\n         for (long long j = len; j < maxx; j++)\n           tmp[j] = (((tmp[j - 1] * 26ll) % mod) +\n                     (((long long)sel(j, len - 1) * pw25[j + 1 - len]) % mod)) %\n                    mod;\n       }\n     } else {\n       c++;\n       cin >> q;\n       if (len < sqr) {\n         if (len > q)\n           cout << 0 << '\n';\n         else\n           cout << dp[q][len][0] << '\n';\n         continue;\n       }\n       long long ans = 0ll;\n       cout << tmp[q - 1] << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<array<int, 2>> tree(1);\n int terminal[110];\n unsigned long long inf = (1ull << 63) - 1;\n int s;\n struct Mat {\n   vector<unsigned long long> data;\n   Mat() { data.assign(s * s, inf); }\n };\n Mat operator*(const Mat& a, const Mat& b) {\n   Mat r;\n   for (int i = 0; i < s; i++) {\n     for (int k = 0; k < s; k++) {\n       for (int j = 0; j < s; j++) {\n         r.data[i * s + j] =\n             min(r.data[i * s + j], a.data[i * s + k] + b.data[k * s + j]);\n       }\n     }\n   }\n   return r;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int g, n, m;\n   cin >> g >> n >> m;\n   vector<pair<int, vector<int>>> mut;\n   vector<vector<vector<int>>> node(g);\n   for (int i = 0; i < n; i++) {\n     int a, k;\n     cin >> a >> k;\n     node[a].push_back(vector<int>(k));\n     mut.emplace_back(a, vector<int>());\n     for (int& v : node[a].back()) {\n       cin >> v;\n       mut.back().second.push_back(v);\n     }\n   }\n   for (int i = 0; i < m; i++) {\n     int k;\n     cin >> k;\n     int p = 0;\n     while (k--) {\n       int c;\n       cin >> c;\n       if (!tree[p][c]) {\n         tree[p][c] = tree.size();\n         tree.push_back({0, 0});\n       }\n       p = tree[p][c];\n     }\n     terminal[p] = 1;\n   }\n   {\n     vector<int> link(tree.size());\n     queue<int> q;\n     q.push(0);\n     while (q.size()) {\n       int p = q.front();\n       q.pop();\n       int par = link[p];\n       terminal[p] |= terminal[par];\n       for (int c : {0, 1}) {\n         if (!tree[p][c]) {\n           tree[p][c] = tree[par][c];\n         } else {\n           link[tree[p][c]] = p ? tree[par][c] : 0;\n           q.push(tree[p][c]);\n         }\n       }\n     }\n   }\n   s = tree.size();\n   for (int p = 0; p < s; p++)\n     if (terminal[p]) tree[p][0] = tree[p][1] = p;\n   vector<Mat> mat(g);\n   for (int c : {0, 1}) {\n     for (int i = 0; i < s; i++) {\n       mat[c].data[i * s + tree[i][c]] = 1;\n     }\n   }\n   vector<int> changed(g, 1);\n   while (1) {\n     int found = 0;\n     vector<int> nchanged(g);\n     for (auto& [a, v] : mut) {\n       int need = 0;\n       for (int b : v)\n         if (changed[b]) need = 1;\n       if (!need) continue;\n       Mat prod = mat[v[0]];\n       for (int i = 1; i < (int)v.size(); i++) {\n         prod = prod * mat[v[i]];\n       }\n       for (int i = 0; i < s * s; i++) {\n         if (prod.data[i] < mat[a].data[i]) {\n           mat[a].data[i] = prod.data[i];\n           nchanged[a] = 1;\n           found = 1;\n         }\n       }\n     }\n     changed = nchanged;\n     if (!found) break;\n   }\n   for (int a = 2; a < g; a++) {\n     unsigned long long mi = inf;\n     for (int i = 0; i < s; i++) {\n       if (!terminal[i]) mi = min(mi, mat[a].data[i]);\n     }\n     if (mi < inf)\n       cout << 'NO ' << mi << endl;\n     else\n       cout << 'YES' << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize '-O3'\n using namespace std;\n const int MAXN = 310000;\n int n;\n int a[MAXN];\n vector<int> pr;\n int bb[MAXN];\n int go[MAXN];\n int cc[MAXN];\n int ans[MAXN];\n vector<int> fc[MAXN];\n int gcd(int a, int b) {\n   while (b) {\n     int q = a % b;\n     a = b;\n     b = q;\n   }\n   return a;\n }\n int dp[1 << 7];\n int gg;\n int gog[1 << 7];\n void run(int x, int msk, int ml, int k) {\n   if (x == k) {\n     dp[msk] = cc[ml];\n     gog[msk] = ml;\n     return;\n   }\n   run(x + 1, msk, ml, k);\n   run(x + 1, msk + (1 << x), ml * fc[gg][x], k);\n }\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   for (int i = 0; i < MAXN; ++i) bb[i] = i;\n   for (int i = 2; i < MAXN; ++i) {\n     if (bb[i] == i) pr.push_back(i);\n     for (int j : pr) {\n       if (j * i >= MAXN || bb[i] < j) break;\n       bb[j * i] = j;\n     }\n   }\n   for (int i = 1; i < MAXN; ++i) {\n     int cur = 1;\n     int x = i;\n     while (x != 1) {\n       int d = bb[x];\n       while (x % d == 0) x /= d;\n       cur *= d;\n       fc[i].push_back(d);\n     }\n     go[i] = cur;\n   }\n   cin >> n;\n   int now = 0;\n   fill(ans, ans + MAXN, 1000);\n   for (int i = 0; i < n; ++i) {\n     cin >> a[i];\n     now = gcd(now, a[i]);\n     a[i] = go[a[i]];\n     ++cc[a[i]];\n     ans[a[i]] = 1;\n   }\n   if (now != 1) {\n     cout << -1 << '\n';\n     return 0;\n   }\n   for (int i = 1; i < MAXN; ++i) {\n     for (int j = 2 * i; j < MAXN; j += i) cc[i] += cc[j];\n   }\n   for (int i = MAXN - 1; i > 1; --i) {\n     if (go[i] != i) continue;\n     int k = fc[i].size();\n     gg = i;\n     run(0, 0, 1, k);\n     for (int i = (1 << k) - 1; i > 0; --i) {\n       for (int j = (i - 1) & i; j > 0; j = (j - 1) & i) dp[j] -= dp[i];\n       dp[0] -= dp[i];\n     }\n     for (int j = 0; j < (1 << k); ++j)\n       if (dp[j]) ans[gog[j]] = min(ans[gog[j]], ans[i] + 1);\n   }\n   cout << ans[1] << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, x, m;\n priority_queue<int> s;\n int main() {\n   scanf('%d', &n);\n   m = n;\n   for (int i = 0; i < int(n); i++) {\n     scanf('%d', &x);\n     if (x < m) {\n       s.push(x);\n       cout << ' ';\n     } else if (x == m) {\n       cout << x << ' ';\n       m--;\n       while (!s.empty() && m == s.top()) {\n         cout << s.top() << ' ';\n         s.pop();\n         m--;\n       }\n     }\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s[12000];\n int n, i, j;\n vector<int> ans;\n int cek(int v, int t, string e) {\n   if (v >= strlen(s) - 1) return v;\n   int i = v;\n   do {\n     string tmp = '';\n     for (i = i;; i++) {\n       tmp.push_back(s[i]);\n       if (s[i] == '>') break;\n     }\n     i++;\n     if (e == '<table>' && tmp == '</table>') break;\n     if (e == '<tr>' && tmp == '</tr>') break;\n     if (e == '<td>' && tmp == '</td>') {\n       ans[t]++;\n       break;\n     }\n     if (tmp == '<table>') {\n       ans.push_back(0);\n       i = cek(i, ans.size() - 1, tmp);\n     } else if (tmp == '<tr>') {\n       i = cek(i, t, tmp);\n     } else if (tmp == '<td>') {\n       i = cek(i, t, tmp);\n     }\n   } while (i < strlen(s));\n   return i;\n }\n int main() {\n   n = 0;\n   bool f = 1;\n   while (scanf('%c', &s[n]) != EOF) {\n     if (s[n] != '\n') n++;\n   }\n   int k = cek(0, -1, ' ');\n   sort(ans.begin(), ans.end());\n   for (i = 0; i < ans.size(); i++) {\n     if (f)\n       f = 0;\n     else\n       printf(' ');\n     cout << ans[i];\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n using namespace std;\n long double scal(long double x, long double y, long double x1, long double y1) {\n   return x * y1 - x1 * y;\n }\n int n, m;\n int a[20][2], b[20][2];\n int aa[20][10], bb[20][10];\n int p[10];\n int main() {\n   cin >> n >> m;\n   for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1];\n   for (int i = 0; i < m; i++) cin >> b[i][0] >> b[i][1];\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       if ((a[i][0] == b[j][0] && a[i][1] == b[j][1]) ||\n           (a[i][1] == b[j][0] && a[i][0] == b[j][1]))\n         continue;\n       if (a[i][0] == b[j][0]) {\n         aa[i][a[i][0]] = 1;\n         bb[j][a[i][0]] = 1;\n       }\n       if (a[i][0] == b[j][1]) {\n         aa[i][a[i][0]] = 1;\n         bb[j][a[i][0]] = 1;\n       }\n       if (a[i][1] == b[j][1]) {\n         aa[i][a[i][1]] = 1;\n         bb[j][a[i][1]] = 1;\n       }\n       if (a[i][1] == b[j][0]) {\n         aa[i][a[i][1]] = 1;\n         bb[j][a[i][1]] = 1;\n       }\n     }\n   }\n   for (int i = 0; i < n; i++)\n     for (int j = 1; j <= 9; j++)\n       if (aa[i][j] == 1) p[j] = 1;\n   int anss = 0;\n   for (int i = 1; i <= 9; i++) anss += p[i];\n   if (anss == 1) {\n     for (int i = 1; i <= 9; i++)\n       if (p[i]) cout << i;\n     return 0;\n   }\n   int ans1 = 1, ans2 = 1;\n   for (int i = 0; i < n; i++) {\n     int t = 0;\n     for (int j = 1; j <= 9; j++) t += aa[i][j];\n     if (t > 1) ans1 = 0;\n   }\n   for (int i = 0; i < m; i++) {\n     int t = 0;\n     for (int j = 1; j <= 9; j++) t += bb[i][j];\n     if (t > 1) ans2 = 0;\n   }\n   if (ans1 && ans2)\n     cout << 0;\n   else\n     cout << -1;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, p, k;\n int a[333333];\n long long ans;\n map<int, int> mp, mpb;\n int main() {\n   scanf('%d%d%d', &n, &p, &k);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]);\n   for (int i = 1; i <= n; i++) {\n     mp[a[i]]++;\n   }\n   for (map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) {\n     if (1ll * ((it->first) + (it->first)) *\n             (2ll * (it->first) * (it->first) % p) % p !=\n         k)\n       ans -= (1ll * (it->second) * ((it->second) - 1));\n   }\n   for (int i = 1; i <= n; i++) {\n     mpb[((1ll * a[i] * a[i] % p * a[i] % p * a[i] - 1ll * k * a[i]) % p + p) %\n         p]++;\n   }\n   for (map<int, int>::iterator it = mpb.begin(); it != mpb.end(); it++) {\n     ans += (1ll * (it->second) * ((it->second) - 1));\n   }\n   printf('%lld\n', ans / 2);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using namespace std::chrono;\n long long fac[1000006];\n inline long long exp(long long x, long long n) {\n   long long r = 1;\n   x = x;\n   while (n) {\n     if (n % 2) r = (r * x) % 10000000000000007;\n     x = (x * x) % 10000000000000007;\n     n = n / 2;\n   }\n   return r;\n }\n inline long long mmi(long long a) {\n   return exp(a, 10000000000000007 - 2) % 10000000000000007;\n }\n inline long long fact(long long n) {\n   long long res = 1;\n   for (long long i = 1; i < (n + 1); ++i) {\n     res = (res * i) % 10000000000000007;\n   }\n   return res;\n }\n inline void fact_a() {\n   fac[0] = 1;\n   fac[1] = 1;\n   for (long long i = 1; i < (105); ++i) {\n     fac[i] = (fac[i - 1] * i) % 10000000000000007;\n   }\n }\n inline long long inv_fact(long long n) {\n   long long par = fac[n];\n   long long res = mmi(par);\n   return res;\n }\n inline long long comb(long long n, long long r) {\n   if (n == r && r == 0) return 1;\n   if (n < r) return 0;\n   return ((fac[n] * inv_fact(r)) % 10000000000000007 * inv_fact(n - r)) %\n          10000000000000007;\n }\n struct triplet {\n   long long a, b, c;\n };\n bool operator<(const triplet &t1, const triplet &t2) {\n   if (t1.a < t2.a) return true;\n   if (t1.a == t2.a && t1.b < t2.b) return true;\n   if (t1.a == t2.a && t1.b == t2.b && t1.c < t2.c) return true;\n   return false;\n }\n pair<long long, pair<long long, long long> > ex_gcd(long long a, long long b) {\n   if (b == 0) {\n     return make_pair(a, make_pair(1, 0));\n   }\n   pair<long long, pair<long long, long long> > p = ex_gcd(b, a % b);\n   long long gcd = p.first;\n   long long x1 = p.second.first;\n   long long y1 = p.second.second;\n   long long x = y1;\n   long long y = x1 - (a / b) * y1;\n   return make_pair(gcd, make_pair(x, y));\n }\n long long prime[3000006];\n long long spf_prime[3000006];\n void sieve() {\n   prime[1] = 1;\n   for (long long i = 2; i * i <= 3000000; i++)\n     if (prime[i] == 0)\n       for (long long j = i * i; j <= 3000000; j += i) prime[j] = 1;\n }\n void spf() {\n   for (long long i = 2; i * i <= 3000000; i++)\n     if (!spf_prime[i])\n       for (long long j = i * i; j <= 3000000; j += i)\n         if (!spf_prime[j]) spf_prime[j] = i;\n   for (long long i = 2; i <= 3000000; i++)\n     if (!spf_prime[i]) spf_prime[i] = i;\n }\n long long getparent_BIT(long long idx) { return idx - (idx & -idx); }\n long long getnext_BIT(long long idx) { return idx + (idx & -idx); }\n long long getsum_BIT(long long idx, long long BIT[], long long n) {\n   long long sum = 0;\n   while (idx > 0) {\n     sum += BIT[idx];\n     idx = getparent_BIT(idx);\n   }\n   return sum;\n }\n void update_BIT(long long idx, long long BIT[], long long val, long long n) {\n   while (idx <= n) {\n     BIT[idx] += val;\n     idx = getnext_BIT(idx);\n   }\n }\n void build_BIT(long long BIT[], long long a[], long long n) {\n   for (long long i = 0; i < (n); ++i) {\n     update_BIT(i, BIT, a[i], n);\n   }\n }\n void comp_lps(string s, long long lps[], long long n) {\n   long long i = 1, j = 0;\n   while (i < n) {\n     if (s[i] == s[j]) {\n       lps[i++] = ++j;\n     } else {\n       if (j != 0)\n         j = lps[j - 1];\n       else\n         lps[i++] = 0;\n     }\n   }\n }\n void dfs_l(long long u, vector<vector<long long> > &adj, long long status[]) {\n   if (status[u] == 1) return;\n   status[u] = 1;\n   for (long long i = 0; i < (adj[u].size()); ++i) dfs_l(adj[u][i], adj, status);\n }\n long long dij(long long u, long long n,\n               vector<vector<pair<long long, long long> > > &adj,\n               long long status[]) {\n   long long dist[n];\n   for (long long i = 0; i < (n); ++i) dist[i] = 1000000000;\n   dist[0] = 0;\n   priority_queue<pair<long long, long long>,\n                  vector<pair<long long, long long> >,\n                  greater<pair<long long, long long> > >\n       q;\n   q.push(make_pair(0, 0));\n   while (!q.empty()) {\n     pair<long long, long long> p;\n     p = q.top();\n     q.pop();\n     long long x = p.second;\n     long long w = p.first;\n     if (status[x] == 1) continue;\n     status[x] = 1;\n     for (long long i = 0; i < (adj[x].size()); ++i) {\n       long long ww = adj[x][i].first;\n       long long y = adj[x][i].second;\n       if (dist[x] + ww < dist[y]) {\n         dist[y] = dist[x] + ww;\n         q.push(make_pair(dist[y], y));\n       }\n     }\n   }\n   if (dist[n - 1] >= 1000000000) return -1;\n   return dist[n - 1];\n }\n long long phi(long long n) {\n   vector<long long> v;\n   long long k = n;\n   ;\n   for (long long i = 2; i * i <= n; i++) {\n     if (k % i == 0) {\n       v.push_back(i);\n       while (k % i == 0) k /= i;\n     }\n   }\n   if (k > 1) v.push_back(k);\n   long long ans = n;\n   for (long long i = 0; i < (v.size()); ++i) ans -= (ans / v[i]);\n   return ans;\n }\n struct trie {\n   struct trie *left, *right;\n   bool isend;\n };\n trie *get_trie() {\n   trie *ptr = new trie;\n   ptr->left = NULL;\n   ptr->right = NULL;\n   ptr->isend = false;\n   return ptr;\n }\n bool isempty(trie *root) {\n   if (root->left == NULL && root->right == NULL) return true;\n   return false;\n }\n void insert_trie(trie *root, string key) {\n   trie *ptr = root;\n   for (long long i = 0; i < (key.size()); ++i) {\n     if (key[i] == '0') {\n       if (ptr->left == NULL) {\n         ptr->left = get_trie();\n       }\n       ptr = ptr->left;\n     } else {\n       if (ptr->right == NULL) ptr->right = get_trie();\n       ptr = ptr->right;\n     }\n   }\n   ptr->isend = true;\n }\n trie *remove_trie(trie *root, string key, long long idx = 0) {\n   if (root == NULL) return NULL;\n   if (idx == key.size()) {\n     if (isempty(root)) {\n       delete (root);\n       root = NULL;\n     }\n     return root;\n   }\n   if (key[idx] == '0')\n     root->left = remove_trie(root->left, key, idx + 1);\n   else\n     root->right = remove_trie(root->right, key, idx + 1);\n   if (isempty(root)) {\n     delete (root);\n     root = NULL;\n   }\n   return root;\n }\n long long search_trie(trie *root, string key) {\n   trie *ptr = root;\n   string s = '';\n   for (long long i = 0; i < (key.size()); ++i) {\n     if (key[i] == '0') {\n       if (ptr->right != NULL) {\n         ptr = ptr->right;\n         s += '1';\n       } else {\n         ptr = ptr->left;\n         s += '0';\n       }\n     } else {\n       if (ptr->left != NULL) {\n         ptr = ptr->left;\n         s += '1';\n       } else {\n         ptr = ptr->right;\n         s += '0';\n       }\n     }\n   }\n   long long res = 0;\n   reverse(s.begin(), s.end());\n   for (long long i = s.length() - 1; i >= (0); --i)\n     res = res * 2 + (s[i] - '0');\n   return res;\n }\n struct Comp {\n   bool operator()(const std::pair<int, int> &a, const std::pair<int, int> &b) {\n     if (a.first != b.first) {\n       return a.first < b.first;\n     }\n     return a.second > b.second;\n   }\n };\n void dearr() {\n   long long dar[1005];\n   dar[0] = 1;\n   dar[1] = 0;\n   dar[2] = 1;\n   for (long long i = 3; i < (1002); ++i) {\n     dar[i] = (i - 1) * (dar[i - 1] + dar[i - 2]);\n   }\n }\n int main() {\n   long long n;\n   cin >> n;\n   if (n % 2 == 0) {\n     cout << 'white'\n          << '\n';\n     cout << 1 << ' ' << 2 << '\n';\n   } else\n     cout << 'black'\n          << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       if (i % 2 == 0) {\n         if (j % 2 == 0) {\n           cout << 'W';\n         } else {\n           cout << 'B';\n         }\n       } else {\n         if (j % 2 != 0) {\n           cout << 'W';\n         } else {\n           cout << 'B';\n         }\n       }\n     }\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int first, second;\n   cin >> second >> first;\n   if ((second == 1 && first == 0) || first == 0) {\n     cout << 'NO';\n     return 0;\n   } else if (first == 1 && second == 0) {\n     cout << 'YES';\n     return 0;\n   }\n   int tot = first;\n   int co = first - 1;\n   if (first == 1 && second >= 0) {\n     cout << 'NO';\n     return 0;\n   }\n   if ((second - co) % 2 == 0 && (second - co) >= 0)\n     cout << 'YES';\n   else\n     cout << 'NO';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, x, k, lb, ub, ans = -1;\n int main() {\n   long long l, r;\n   scanf('%lld%lld%lld%lld', &n, &l, &r, &k);\n   x = (r >= l ? r - l + 1 : r + n - l + 1) % n;\n   for (long long i = k, j, r; i; i = j) {\n     j = k / (k / i + 1);\n     r = k / i;\n     ub = min(2 * n, i);\n     lb = max(n, j + 1);\n     ub = min(ub, min((2 * n + k - 2 * x + 1) / (r + 1), (k - x) / r));\n     lb = max(lb, (k - 2 * x + r - 1) / r);\n     if (ub >= lb) ans = max(ans, ub);\n   }\n   if (x <= k && k <= x * 2) ans = max(ans, n + min(k - x, x - 1) + n - x + 1);\n   if (!x && k == n) ans = max(ans, n + 1);\n   printf('%lld\n', ~ans ? ans - n : ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char p[][20] = {'vaporeon', 'jolteon', 'flareon', 'espeon',\n                 'umbreon',  'leafeon', 'glaceon', 'sylveon'};\n char s[20];\n int main() {\n   int n, k, i;\n   scanf('%d', &n);\n   scanf('%s', s);\n   for (k = 0; k < 8; k++) {\n     int fl = 1;\n     for (i = 0; fl && i < n; i++) {\n       if (p[k][i] == '\0' || (p[k][i] != s[i] && s[i] != '.')) fl = 0;\n     }\n     if (fl && p[k][i] == '\0') printf('%s\n', p[k]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long double epsilon = 1e-9;\n int main() {\n   int n;\n   cin >> n;\n   vector<int> a(n), b(n);\n   for (int i = 0; i < n; i++) cin >> a[i];\n   for (int i = 0; i < n; i++) cin >> b[i];\n   vector<pair<int, int> > moves;\n   for (int i = 0; i < n; i++) {\n     if (b[i] != a[i]) {\n       for (int j = i + 1; j < n; j++) {\n         if (b[j] == a[i]) {\n           for (int k = j; k > i; k--) {\n             moves.push_back(make_pair(k - 1, k));\n             swap(b[k], b[k - 1]);\n           }\n           break;\n         }\n       }\n     }\n   }\n   cout << moves.size() << endl;\n   for (int i = 0; i < moves.size(); i++)\n     cout << moves[i].first + 1 << ' ' << moves[i].second + 1 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long a, b, c, d, e, first;\n   cin >> a >> b >> c >> d >> e >> first;\n   b = min(c, b);\n   if (d < a && d < b)\n     cout << d * max(e, first);\n   else {\n     long long p = min(a, d) * e + min(d - min(d, a), b) * first;\n     long long q = min(b, d) * first + min(d - min(d, b), a) * e;\n     cout << max(p, q);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n   long long n;\n   cin >> n;\n   string s;\n   cin >> s;\n   for (long long i = 0; i < n - 1; i++) {\n     if (s[i] > s[i + 1]) {\n       cout << 'YES' << endl;\n       cout << i + 1 << ' ' << i + 2 << endl;\n       return 0;\n     }\n   }\n   cout << 'NO' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 21;\n int a[1 << maxn], n;\n long long ans[maxn][2];\n void mergesort(int l, int r, int dep) {\n   if (r - l <= 1) return;\n   int m = (l + r) / 2;\n   mergesort(l, m, dep - 1);\n   mergesort(m, r, dep - 1);\n   for (int i = l; i < m; i++) {\n     ans[dep][0] += lower_bound(a + m, a + r, a[i]) - a - m;\n   }\n   for (int i = m; i < r; i++) {\n     ans[dep][1] += lower_bound(a + l, a + m, a[i]) - a - l;\n   }\n   inplace_merge(a + l, a + m, a + r);\n }\n long long solve(int q) {\n   long long res = 0;\n   while (q) swap(ans[q][0], ans[q][1]), q--;\n   for (int i = 1; i <= n; i++) {\n     res += ans[i][0];\n   }\n   return res;\n }\n int main() {\n   int m, q;\n   cin >> n;\n   for (int i = 0; i < 1 << n; i++) scanf('%d', &a[i]);\n   cin >> m;\n   mergesort(0, 1 << n, n);\n   for (int i = 0; i < m; i++) {\n     scanf('%d', &q);\n     cout << solve(q) << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double eps = 1e-8;\n const double pi = acos(-1.0);\n const int INF = 0x3f3f3f3f;\n const long long inf = (((long long)1) << 61) + 5;\n const int N = 100005;\n int f[N];\n int g[N];\n int a[N];\n int bit[N];\n int ans[N];\n int sum1(int x) {\n   int ans = 0;\n   for (int i = x; i > 0; i -= i & -i) ans = max(bit[i], ans);\n   return ans;\n }\n void add1(int x, int val) {\n   for (int i = x; i <= N; i += i & -i) bit[i] = max(bit[i], val);\n }\n int sum2(int x) {\n   int ans = 0;\n   for (int i = x; i <= N; i += i & -i) ans = max(bit[i], ans);\n   return ans;\n }\n void add2(int x, int val) {\n   for (int i = x; i > 0; i -= i & -i) bit[i] = max(bit[i], val);\n }\n int main() {\n   int n, res = 0;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n     int x = sum1(a[i] - 1);\n     f[i] = x + 1;\n     if (f[i] > res) res = f[i];\n     add1(a[i], f[i]);\n   }\n   memset(bit, 0, sizeof bit);\n   for (int i = n; i >= 1; i--) {\n     int x = sum2(a[i] + 1);\n     g[i] = x + 1;\n     add2(a[i], g[i]);\n   }\n   vector<int> q[N];\n   for (int i = 1; i <= n; i++) {\n     if (f[i] + g[i] - 1 < res)\n       ans[i] = 1;\n     else\n       q[f[i]].push_back(i);\n   }\n   for (int i = 1; i <= res; i++) {\n     int sz = q[i].size();\n     for (int j = 0; j < sz; j++) {\n       int v = q[i][j];\n       if (sz == 1)\n         ans[v] = 3;\n       else\n         ans[v] = 2;\n     }\n   }\n   for (int i = 1; i <= n; i++) printf('%d', ans[i]);\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 0x3f3f3f3f;\n template <typename T>\n inline void read(T &x) {\n   x = 0;\n   T fl = 1;\n   char ch = 0;\n   for (; ch < '0' || ch > '9'; ch = getchar())\n     if (ch == '-') fl = -1;\n   for (; ch >= '0' && ch <= '9'; ch = getchar())\n     x = (x << 1) + (x << 3) + (ch ^ 48);\n   x *= fl;\n }\n template <typename T, typename... Args>\n inline void read(T &x, Args &...args) {\n   read(x);\n   read(args...);\n }\n const int N = 1e5 + 5;\n struct data {\n   int s, m, r, t;\n   data(int x = 0) { t = x; }\n   bool operator<(const data &b) const { return t < b.t; }\n   long long calc(long long tim) { return min(s + tim * r, m * 1ll); }\n } a[18][N];\n struct seg {\n   int trt[N << 2];\n   long long trm[18][N << 2], trr[18][N << 2];\n   void pushdown(int nod) {\n     if (trt[nod] >= 0) trt[(nod << 1)] = trt[(nod << 1 | 1)] = trt[nod];\n   }\n   void pushup(int nod) {\n     if (trt[(nod << 1)] != trt[(nod << 1 | 1)])\n       trt[nod] = -1;\n     else\n       trt[nod] = trt[(nod << 1)];\n   }\n   void build(int nod, int l, int r, int dep) {\n     trt[nod] = -2;\n     if (l == r) {\n       read(a[dep][l].s, a[dep][l].m, a[dep][l].r);\n       if (a[dep][l].r == 0)\n         a[dep][l].t = inf;\n       else\n         a[dep][l].t = a[dep][l].m % a[dep][l].r == 0\n                           ? a[dep][l].m / a[dep][l].r\n                           : a[dep][l].m / a[dep][l].r + 1;\n       trm[dep][l] = trm[dep][l - 1] + a[dep][l].m;\n       trr[dep][l] = trr[dep][l - 1] + a[dep][l].r;\n       return;\n     }\n     int mid = (l + r) >> 1;\n     build((nod << 1), l, mid, dep + 1);\n     build((nod << 1 | 1), mid + 1, r, dep + 1);\n     for (int i = (l); i <= (r); i++) a[dep][i] = a[dep + 1][i];\n     sort(a[dep] + l, a[dep] + r + 1);\n     for (int i = (l); i <= (r); i++) {\n       trm[dep][i] = trm[dep][i - 1] + a[dep][i].m;\n       trr[dep][i] = trr[dep][i - 1] + a[dep][i].r;\n     }\n   }\n   long long query(int tim, int nod, int l, int r, int ql, int qr, int dep) {\n     long long res = 0;\n     if (ql <= l && r <= qr && trt[nod] != -1) {\n       if (trt[nod] == -2)\n         for (int i = (l); i <= (r); i++) res += a[dep][i].calc(tim);\n       else {\n         int i = upper_bound(a[dep] + l, a[dep] + 1 + r, data(tim - trt[nod])) -\n                 a[dep] - 1;\n         res = (tim - trt[nod]) * (trr[dep][r] - trr[dep][i]) + trm[dep][i] -\n               trm[dep][l - 1];\n       }\n       trt[nod] = tim;\n       return res;\n     }\n     pushdown(nod);\n     int mid = (l + r) >> 1;\n     if (ql <= mid) res += query(tim, (nod << 1), l, mid, ql, qr, dep + 1);\n     if (qr > mid)\n       res += query(tim, (nod << 1 | 1), mid + 1, r, ql, qr, dep + 1);\n     pushup(nod);\n     return res;\n   }\n } sgt;\n int n, m;\n int main() {\n   read(n);\n   sgt.build(1, 1, n, 0);\n   read(m);\n   for (int _ = (1); _ <= (m); _++) {\n     int t, l, r;\n     read(t);\n     read(l);\n     read(r);\n     printf('%lld\n', sgt.query(t, 1, 1, n, l, r, 0));\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a, i, j, n, aux, cnt, ans, div1[10000010], v[10000010];\n int main() {\n   cin >> a >> n;\n   v[1] = 1;\n   for (i = 3; i * i <= a + n - 1; i += 2)\n     if (!div1[i]) {\n       div1[i] = i;\n       for (j = i * i; j <= a + n - 1; j += 2 * i) div1[j] = i;\n     }\n   for (i = 2; i <= a + n - 1; i += 2) div1[i] = 2;\n   for (i = 2; i <= a + n - 1; i++) {\n     aux = i;\n     cnt = 0;\n     if (!div1[i]) div1[i] = i;\n     while (aux % div1[i] == 0) aux /= div1[i], cnt++;\n     v[i] = v[aux];\n     if (cnt & 1) v[i] *= div1[i];\n   }\n   for (i = a; i <= a + n - 1; i++) ans += v[i];\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC optimize('unroll-loops')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native')\n using namespace std;\n vector<long long> v;\n unordered_map<long long, long long> m;\n long long falla(long long n) {\n   if (m.count(n)) {\n     return m[n];\n   }\n   long long ans;\n   long long k = 0;\n   for (int j = n - 1; j >= 1; j--) {\n     if (n % j == 0) {\n       ans = j;\n       break;\n     }\n     if (n % (n - j + 1) == 0) {\n       ans = n / (n - j + 1);\n       break;\n     }\n   }\n   m[ans] = ans;\n   return ans;\n }\n int main() {\n   long long casos;\n   cin >> casos;\n   long long num = pow(2, 25) - 1;\n   for (int i = 1; i < 30; i++) {\n     v.push_back((1 << i) - 1);\n   }\n   long long flag = 0;\n   while (casos--) {\n     long long num;\n     long long ans1;\n     cin >> num;\n     if (m.count(num)) {\n       cout << m[num] << endl;\n       flag = 1;\n     }\n     if (flag == 0) {\n       ans1 = lower_bound((v).begin(), (v).end(), num) - v.begin();\n       if (num == v[ans1]) {\n         ans1 = falla(num);\n         m[num] = ans1;\n         cout << ans1 << endl;\n       } else {\n         m[num] = v[ans1];\n         cout << v[ans1] << endl;\n       }\n     }\n     flag = 0;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> G[maxn], tree[maxn];\n int d[maxn];\n int A[maxn], B[maxn];\n bool vis[maxn];\n vector<int> 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 <bits/stdc++.h>\n using namespace std;\n pair<long long, long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int maxn = 3e5 + 10;\n vector<int> e[maxn];\n int dp[maxn], root[maxn], d[maxn], sz[maxn];\n pair<int, int> dfs(int v, int st, int par) {\n   if (root[v] == -1) sz[st]++;\n   root[v] = st;\n   pair<int, int> p = make_pair(0, -1);\n   for (int i = 0; i < e[v].size(); i++)\n     if (e[v][i] != par) p = max(p, dfs(e[v][i], st, v));\n   if (par != -1) p.first++;\n   if (p.second == -1) p.second = v;\n   return p;\n }\n int get_root(int v) { return root[v] == v ? v : root[v] = get_root(root[v]); }\n void merge(int v, int u) {\n   v = get_root(v);\n   u = get_root(u);\n   if (sz[v] > sz[u]) swap(v, u);\n   if (v == u) return;\n   root[v] = u;\n   sz[u] += sz[v];\n   d[u] = max((d[v] + 1) / 2 + (d[u] + 1) / 2 + 1, max(d[v], d[u]));\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int n, m, q;\n   cin >> n >> m >> q;\n   memset(root, -1, sizeof root);\n   for (int i = 0; i < m; i++) {\n     int u, v;\n     cin >> v >> u;\n     v--;\n     u--;\n     e[v].push_back(u);\n     e[u].push_back(v);\n   }\n   for (int i = 0; i < n; i++)\n     if (root[i] == -1) d[i] = dfs(dfs(i, i, -1).second, i, -1).first;\n   for (int i = 0; i < q; i++) {\n     int t;\n     cin >> t;\n     if (t == 1) {\n       int x;\n       cin >> x;\n       x--;\n       cout << d[get_root(x)] << '\n';\n     } else {\n       int x, y;\n       cin >> x >> y;\n       x--;\n       y--;\n       merge(x, y);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long int t;\n   t = 1;\n   for (long long int _ = 0; _ < t; _++) {\n     long long int n, m, b, mod;\n     cin >> n >> m >> b >> mod;\n     vector<long long int> v(n + 1);\n     for (long long int i = 1; i <= n; i++) cin >> v[i];\n     long long int dp[2][m + 1][b + 1];\n     for (long long int i = 0; i <= 1; i++) {\n       for (long long int j = 0; j <= m; j++) {\n         for (long long int k = 0; k <= b; k++) dp[i][j][k] = 0;\n       }\n     }\n     dp[0][0][0] = 1;\n     for (long long int i = 1; i <= n; i++) {\n       for (long long int j = 0; j <= m; j++) {\n         for (long long int k = 0; k <= b; k++) {\n           if (k >= v[i] && j > 0)\n             dp[i % 2][j][k] =\n                 (dp[1 - (i % 2)][j][k] + dp[i % 2][j - 1][k - v[i]]) % mod;\n           else\n             dp[i % 2][j][k] = dp[1 - (i % 2)][j][k];\n         }\n       }\n     }\n     long long int ans = 0;\n     for (long long int k = 0; k <= b; k++) ans = (ans + dp[n % 2][m][k]) % mod;\n     cout << ans << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n set<string> a, b, c;\n void solve() {\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++) {\n     string s;\n     cin >> s;\n     a.insert(s);\n   }\n   for (int i = 1; i <= m; i++) {\n     string s;\n     cin >> s;\n     if (a.count(s)) c.insert(s);\n     b.insert(s);\n   }\n   while (1) {\n     if (a.empty()) {\n       cout << 'NO\n';\n       return;\n     }\n     if (!c.empty()) {\n       a.erase(*c.begin());\n       b.erase(*c.begin());\n       c.erase(c.begin());\n     } else {\n       if (b.count(*a.begin())) b.erase(*a.begin());\n       a.erase(a.begin());\n     }\n     if (b.empty()) {\n       cout << 'YES\n';\n       return;\n     }\n     if (!c.empty()) {\n       a.erase(*c.begin());\n       b.erase(*c.begin());\n       c.erase(c.begin());\n     } else {\n       if (a.count(*b.begin())) a.erase(*b.begin());\n       b.erase(b.begin());\n     }\n   }\n }\n int main() {\n   int t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, d, res = 0, a = 0, b;\n   cin >> n >> d;\n   for (int i = 0; i < n; i++) {\n     cin >> b;\n     if (a >= b) {\n       res += ceil((a - b + 1) / (double)d);\n       b += ceil((a - b + 1) / (double)d) * d;\n     }\n     a = b;\n   }\n   cout << res << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<pair<int, int> > g[100010];\n int N, K, in[100010], dp[100010][2];\n vector<pair<int, int> > num[100010];\n void dfs(int u, int fa) {\n   for (pair<int, int>& e : g[u]) {\n     int v = e.first, cost = e.second;\n     if (v == fa) continue;\n     dfs(v, u);\n     num[u].push_back(pair<int, int>(dp[v][1] + cost, v));\n   }\n   sort(num[u].begin(), num[u].end(), greater<pair<int, int> >());\n   dp[u][1] = 0;\n   int sum = 0;\n   for (size_t i = 0; (int)i < K - 1 && i < num[u].size(); i++) {\n     dp[u][1] += num[u][i].first;\n     sum += num[u][i].first;\n   }\n   if ((int)num[u].size() <= K - 1) {\n     for (size_t i = 0; i < num[u].size(); i++) {\n       int v = num[u][i].second;\n       dp[u][0] = max(dp[u][0], sum - dp[v][1] + dp[v][0]);\n     }\n   } else {\n     for (size_t i = 0; i < (int)K - 1; i++) {\n       int v = num[u][i].second;\n       dp[u][0] = max(dp[u][0], sum + num[u][K - 1].first - dp[v][1] + dp[v][0]);\n     }\n     for (size_t i = K - 1; i < num[u].size(); i++) {\n       int v = num[u][i].second;\n       dp[u][0] = max(dp[u][0], sum + num[u][i].first - dp[v][1] + dp[v][0]);\n     }\n   }\n }\n int main() {\n   int u, v, c;\n   scanf('%d%d', &N, &K);\n   for (int i = 1; i < N; i++) {\n     scanf('%d%d%d', &u, &v, &c);\n     g[u].push_back(pair<int, int>(v, c));\n     g[v].push_back(pair<int, int>(u, c));\n   }\n   dfs(0, -1);\n   printf('%d\n', max(dp[0][0], dp[0][1]));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long GCD(long long a, long long b) {\n   while (b) b ^= a ^= b ^= a %= b;\n   return a;\n }\n long long LCM(long long a, long long b) { return a * (b / GCD(a, b)); }\n const double EPS = 10e-9;\n const long long INF = (1LL << 30);\n using namespace std;\n template <typename T>\n string toString(T t) {\n   stringstream ss;\n   ss << t;\n   return ss.str();\n }\n long long isSquare(long long N) {\n   long long lo = 1, hi = 2 * sqrt(N);\n   while (hi - lo > 1) {\n     long long mid = (hi + lo) >> 1;\n     long long res = mid * mid;\n     if (res < N) {\n       lo = mid;\n     } else if (res > N) {\n       hi = mid;\n     } else {\n       return mid;\n     }\n   }\n   return lo;\n }\n int main() {\n   long long N;\n   cin >> N;\n   if (N % 3 != 0) {\n     cout << 0 << endl;\n   } else {\n     N /= 3;\n     int options = 0;\n     for (long long i = 1; i * i * i <= N; i++) {\n       if (N % i == 0) {\n         long long left = N / i, to = i / 2;\n         for (long long a = 1; a <= to; a++) {\n           long long c = i - a;\n           long long d = (a - c) * (a - c);\n           long long sqr = isSquare(d + 4 * left);\n           if (sqr * sqr == d + 4 * left) {\n             long long b = (-(a + c) + sqr) >> 1;\n             if (c <= b) {\n               if (a == c) {\n                 if (b == c) {\n                   options += 1;\n                 } else {\n                   options += 3;\n                 }\n               } else {\n                 if (b == c) {\n                   options += 3;\n                 } else {\n                   options += 6;\n                 }\n               }\n             }\n           }\n         }\n       }\n     }\n     cout << options << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long int mod = 1000000007;\n const long long int inf = 1e17;\n const long long int N = 5005;\n long long int n;\n long long int a[N];\n long long int dp[N][N];\n long long int go(long long int idx, long long int flag) {\n   long long int &ans = dp[idx][flag];\n   if (ans != -1) return ans;\n   if (idx > n) {\n     return 0;\n   }\n   if (flag == 0 or flag == 2) {\n     ans = max(go(idx + 1, flag), go(idx + 1, flag + 1)) + a[idx];\n   } else {\n     ans = max(go(idx + 1, flag), go(idx + 1, flag + 1)) - a[idx];\n   }\n   return ans;\n }\n vector<long long int> res;\n void backtrack(long long int idx, long long int flag) {\n   if (idx > n) {\n     return;\n   }\n   if (flag == 0 or flag == 2) {\n     long long int tmp1 = go(idx + 1, flag) + a[idx];\n     long long int tmp2 = go(idx + 1, flag + 1) + a[idx];\n     res.push_back(1);\n     if (tmp1 >= tmp2) {\n       backtrack(idx + 1, flag);\n     } else {\n       backtrack(idx + 1, flag + 1);\n     }\n   } else {\n     long long int tmp1 = go(idx + 1, flag) - a[idx];\n     long long int tmp2 = go(idx + 1, flag + 1) - a[idx];\n     res.push_back(0);\n     if (tmp1 >= tmp2) {\n       backtrack(idx + 1, flag);\n     } else {\n       backtrack(idx + 1, flag + 1);\n     }\n   }\n }\n int32_t main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   memset(dp, -1, sizeof(dp));\n   cin >> n;\n   for (long long int i = 1; i <= n; i++) {\n     cin >> a[i];\n   }\n   long long int ans = go(0, 0);\n   backtrack(0, 0);\n   res.erase(res.begin());\n   long long int cnt = 0, idx = 0;\n   while (res[idx] and idx < n) {\n     cnt++;\n     idx++;\n   }\n   vector<long long int> vec;\n   vec.push_back(cnt);\n   cnt = 0;\n   idx = vec.back();\n   while (idx < n and !res[idx]) {\n     cnt++;\n     idx++;\n   }\n   vec.push_back(cnt);\n   idx = vec[0] + vec[1];\n   cnt = 0;\n   while (idx < n and res[idx]) {\n     cnt++;\n     idx++;\n   }\n   vec.push_back(cnt);\n   idx = 0, cnt = 0;\n   for (auto to : vec) {\n     cnt = to;\n     if (cnt == 0LL) {\n       cout << idx << ' ';\n     } else {\n       cout << idx + cnt << ' ';\n       idx += cnt;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 10;\n bool chk(string s) {\n   int l = s.size();\n   for (int i = 0, j = l - 1; i <= j; i++, j--) {\n     if (s[i] != s[j]) return false;\n   }\n   return true;\n }\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     string s;\n     cin >> s;\n     string ans;\n     int mx = 0;\n     string res;\n     for (int i = 0; i < s.size(); i++) {\n       ans += s[i];\n       if (chk(ans)) {\n         int l = ans.size();\n         if (l > mx) {\n           mx = ans.size();\n           res = ans;\n         }\n       }\n     }\n     ans = '';\n     for (int i = s.size() - 1; i >= 0; i--) {\n       ans += s[i];\n       if (chk(ans)) {\n         int l = ans.size();\n         if (l > mx) {\n           mx = ans.size();\n           res = ans;\n         }\n       }\n     }\n     int p1 = 0;\n     int p2 = 0;\n     for (int i = 0, j = s.size() - 1; i < j; i++, j--) {\n       if (s[i] != s[j]) {\n         p1 = i - 1;\n         p2 = j + 1;\n         break;\n       }\n     }\n     ans = '';\n     string rev = '';\n     for (int i = 0; i <= p1; i++) ans += s[i];\n     for (int i = p2; i < s.size(); i++) rev += s[i];\n     string ss = '';\n     for (int i = p1 + 1; i < p2; i++) {\n       ss += s[i];\n       string tmp = ans + ss + rev;\n       int l = tmp.size();\n       if (l <= mx) continue;\n       if (chk(tmp)) {\n         if (l > mx) {\n           mx = l;\n           res = tmp;\n         }\n       }\n     }\n     ss = '';\n     for (int j = p2 - 1; j > p1; j--) {\n       ss = s[j] + ss;\n       string tmp = ans + ss + rev;\n       int l = tmp.size();\n       if (chk(tmp)) {\n         if (l > mx) {\n           mx = l;\n           res = tmp;\n         }\n       }\n     }\n     cout << res << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<char> ache;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   ulta['U'] = 'D';\n   ulta['D'] = 'U';\n   ulta['R'] = 'L';\n   ulta['L'] = 'R';\n   string s;\n   long long n, i, j, k, ans = 2;\n   cin >> n >> s;\n   for (auto ch : s) {\n     auto x = ache.find(ulta[ch]);\n     if (x != ache.end()) {\n       ans++;\n       ache.clear();\n     }\n     ache.insert(ch);\n   }\n   cout << ans - 1 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct State {\n   int len, link;\n   map<char, int> nxtc;\n } SA[2 * 2006];\n bool vis[2 * 2006];\n char str[2006], pref[2 * 2006], suf[2006];\n class SuffixAutomata {\n   int sz, last;\n   void init(int idx) {\n     SA[idx].len = 0, SA[idx].link = -1;\n     SA[idx].nxtc.clear();\n   }\n   bool traverse(int cur, char *ch) {\n     if (*ch == 0) return true;\n     if (SA[cur].nxtc.count(*ch) == 0) return false;\n     int p = SA[cur].nxtc[*ch];\n     return traverse(p, ++ch);\n   }\n   int findState(int cur, char *ch) {\n     if (*ch == 0) return cur;\n     int p = SA[cur].nxtc[*ch];\n     return findState(p, ++ch);\n   }\n \n  public:\n   SuffixAutomata() {\n     sz = last = 0;\n     init(0);\n     ++sz;\n   }\n   int size() { return sz; }\n   void extend(char ch) {\n     int p, q, clone, cur = sz++;\n     init(cur);\n     SA[cur].len = SA[last].len + 1;\n     for (p = last; p != -1 && SA[p].nxtc.count(ch) == 0; p = SA[p].link)\n       SA[p].nxtc[ch] = cur;\n     if (p == -1)\n       SA[cur].link = 0;\n     else {\n       q = SA[p].nxtc[ch];\n       if (SA[p].len + 1 == SA[q].len)\n         SA[cur].link = q;\n       else {\n         clone = sz++;\n         init(clone);\n         SA[clone] = SA[q];\n         SA[clone].len = SA[p].len + 1;\n         for (; p != -1 && SA[p].nxtc[ch] == q; p = SA[p].link)\n           SA[p].nxtc[ch] = clone;\n         SA[cur].link = SA[q].link = clone;\n       }\n     }\n     last = cur;\n   }\n   bool traverse(char *str) { return traverse(0, str); }\n   int findState(char *str) { return findState(0, str); }\n };\n int lenp, lens, dp[2 * 2006][2006];\n int rec(int cur, int idx) {\n   if (suf[idx] == 0) return 1;\n   if (dp[cur][idx] != -1) return dp[cur][idx];\n   int &ret = dp[cur][idx];\n   ret = 0;\n   char ch;\n   int p;\n   if (idx) {\n     ch = suf[idx];\n     if (SA[cur].nxtc.count(ch) == 0) return ret = 0;\n     p = SA[cur].nxtc[ch];\n     return ret = rec(p, idx + 1);\n   }\n   map<char, int> &M = SA[cur].nxtc;\n   map<char, int>::iterator im;\n   for (im = M.begin(); im != M.end(); ++im) {\n     ch = im->first;\n     p = im->second;\n     ret += rec(p, idx);\n     if (ch == suf[idx]) ret += rec(p, idx + 1);\n   }\n   return ret;\n }\n int main() {\n   int i, j, ans, n;\n   while (scanf('%s', str) != EOF) {\n     SuffixAutomata sa;\n     for (i = 0; str[i]; ++i) sa.extend(str[i]);\n     ans = 0;\n     scanf('%s %s', pref, suf);\n     lenp = strlen(pref), lens = strlen(suf);\n     if (!sa.traverse(pref)) {\n       puts('0');\n       continue;\n     }\n     for (i = 0; i < lenp; ++i) {\n       if (i + lens < lenp) continue;\n       for (j = 0; j < lens; ++j) {\n         if (pref[i + j] != suf[j]) break;\n       }\n       if (i + j == lenp) {\n         strcat(pref, &suf[lenp - i]);\n         ans += sa.traverse(pref);\n         pref[lenp] = 0;\n       }\n     }\n     n = sa.findState(pref);\n     memset(dp, -1, sizeof(dp));\n     ans += rec(n, 0);\n     printf('%d\n', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 200005;\n int main() {\n   int n, k, q, i, a, b, p[MAX] = {0}, c[MAX] = {0};\n   scanf('%d %d %d', &n, &k, &q);\n   while (n--) {\n     scanf('%d %d', &a, &b);\n     p[a]++;\n     p[b + 1]--;\n   }\n   for (i = 1; i < MAX; i++) {\n     p[i] += p[i - 1];\n     c[i] += c[i - 1] + (p[i] >= k);\n   }\n   while (q--) {\n     scanf('%d %d', &a, &b);\n     printf('%d\n', c[b] - c[a - 1]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n class base {\n  public:\n   long double a, b;\n   base(void) {\n     a = 0;\n     b = 0;\n   }\n   base(long double _a, long double _b) {\n     a = _a;\n     b = _b;\n   }\n   base(long double _a) {\n     a = _a;\n     b = 0;\n   }\n   base operator*(const base& b2) {\n     base ret(a * b2.a - b * b2.b, b * b2.a + a * b2.b);\n     return ret;\n   }\n   base operator+(const base& b2) {\n     base ret(a + b2.a, b + b2.b);\n     return ret;\n   }\n   base operator-(const base& b2) {\n     base ret(a - b2.a, b - b2.b);\n     return ret;\n   }\n   base operator/(const base& b2) {\n     long double c = b2.a, d = b2.b;\n     base ret((a * c + b * d) / (c * c + d * d),\n              (b * c - a * d) / (c * c + d * d));\n     return ret;\n   }\n   void operator*=(const base& b2) {\n     long double tmp = a * b2.a - b * b2.b;\n     b = b * b2.a + a * b2.b;\n     a = tmp;\n   }\n   void operator/=(const base& b2) {\n     long double c = b2.a, d = b2.b;\n     long double tmp = (a * c + b * d) / (c * c + d * d);\n     b = (b * c - a * d) / (c * c + d * d);\n     a = tmp;\n   }\n   inline long double real(void) { return a; }\n };\n void fft(vector<base>& a, bool invert) {\n   int n = (int)a.size();\n   for (int i = 1, j = 0; i < n; ++i) {\n     int bit = n >> 1;\n     for (; j >= bit; bit >>= 1) j -= bit;\n     j += bit;\n     if (i < j) swap(a[i], a[j]);\n   }\n   base ww[n];\n   long double ang = 2 * 3.14159265358979323846l / n * (invert ? -1 : 1);\n   base wi(cos(ang), sin(ang));\n   ww[0] = 1;\n   for (int i = 1; i < n; i++) {\n     ww[i] = ww[i / 2] * ww[i / 2];\n     if (i % 2 == 1) ww[i] *= wi;\n   }\n   for (int len = 2; len <= n; len <<= 1) {\n     int k = n / len;\n     for (int i = 0; i < n; i += len) {\n       int wn = 0;\n       for (int j = 0; j < len / 2; ++j) {\n         base u = a[i + j], v = a[i + j + len / 2] * ww[wn];\n         a[i + j] = u + v;\n         a[i + j + len / 2] = u - v;\n         wn += k;\n       }\n     }\n   }\n   if (invert)\n     for (int i = 0; i < n; ++i) a[i] /= n;\n }\n vector<int> multiply(const vector<int>& a, const vector<int>& b) {\n   vector<base> fa(a.begin(), a.end());\n   size_t n = 1;\n   while (n < (a.size() + b.size())) n <<= 1;\n   fa.resize(n);\n   vector<int> res;\n   fft(fa, false);\n   for (size_t i = 0; i < n; ++i) fa[i] *= fa[i];\n   fft(fa, true);\n   res.resize(n);\n   long long int carry = 0;\n   for (size_t i = 0; i < n; ++i) {\n     carry += (long long int)(fa[i].real() + 0.5);\n     res[i] = carry % 1000;\n     carry /= 1000;\n   }\n   int i;\n   for (i = n - 1; i > 0; i--) {\n     if (res[i] != 0) break;\n   }\n   res.resize(i + 1);\n   return res;\n }\n void small_mult(vector<int>& a, int b) {\n   int carry = 0;\n   for (int i = 0; i < (int)a.size() || carry; i++) {\n     if (i == (int)a.size()) a.push_back(0);\n     int cur = carry + a[i] * b;\n     a[i] = cur % 1000;\n     carry = cur / 1000;\n   }\n   while (a.size() > 1 && !a.back()) a.pop_back();\n }\n void fast_3_pow(long long int k, vector<int>& ans) {\n   ans = {1};\n   if (k <= 0) return;\n   long long int r = 0, kk = 0;\n   for (long long int t = k; t > 0; t /= 2) {\n     r = (2 * r + t % 2);\n     kk++;\n   }\n   for (long long int i = 0; i < kk; i++) {\n     ans = multiply(ans, ans);\n     if (r % 2) small_mult(ans, 3);\n     r /= 2;\n   }\n }\n bool first_is_BE(vector<int>& v1, vector<int>& v2) {\n   if (v1.size() > v2.size()) return 1;\n   if (v1.size() < v2.size()) return 0;\n   for (long long int i = ((long long int)v1.size()) - 1; i >= 0; i--) {\n     if (v1[i] > v2[i]) return 1;\n     if (v1[i] < v2[i]) return 0;\n   }\n   return 1;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   string s;\n   cin >> s;\n   if (s == '1') {\n     cout << '1';\n     return 0;\n   }\n   if (s == '2') {\n     cout << '2';\n     return 0;\n   }\n   if (s == '3') {\n     cout << '3';\n     return 0;\n   }\n   if (s == '4') {\n     cout << '4';\n     return 0;\n   }\n   if (s == '5') {\n     cout << '5';\n     return 0;\n   }\n   if (s == '6') {\n     cout << '5';\n     return 0;\n   }\n   if (s == '7') {\n     cout << '6';\n     return 0;\n   }\n   if (s == '8') {\n     cout << '6';\n     return 0;\n   }\n   if (s == '9') {\n     cout << '6';\n     return 0;\n   }\n   vector<int> n;\n   int tmp = 0;\n   while (s.size() % 3 != 0) s = '0' + s;\n   for (int i = 0; i < (int)s.size(); i++) {\n     tmp *= 10;\n     tmp += s[i] - '0';\n     if ((i + 1) % 3 == 0) {\n       n.push_back(tmp);\n       tmp = 0;\n     }\n   }\n   reverse(n.begin(), n.end());\n   vector<int> v1, vt;\n   int k;\n   k = max((int)(s.size() * logl(10) / logl(3) - 8), (int)0);\n   fast_3_pow(k, v1);\n   vt = v1;\n   small_mult(v1, 4);\n   while (1) {\n     if (first_is_BE(v1, n)) {\n       break;\n     }\n     k++;\n     small_mult(v1, 3);\n   }\n   int ans3 = 3 * k + 4;\n   k = max((int)(s.size() * logl(10) / logl(3) - 8), (int)0);\n   v1 = vt;\n   while (1) {\n     if (first_is_BE(v1, n)) {\n       break;\n     }\n     k++;\n     small_mult(v1, 3);\n   }\n   int ans1 = 3 * k;\n   k = max((int)(s.size() * logl(10) / logl(3) - 8), (int)0);\n   v1 = vt;\n   small_mult(v1, 2);\n   while (1) {\n     if (first_is_BE(v1, n)) {\n       break;\n     }\n     k++;\n     small_mult(v1, 3);\n   }\n   int ans2 = 3 * k + 2;\n   cout << min(min(ans1, ans2), ans3);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);\n #define ll long long int\n #define pb push_back\n #define pob pop_back\n #define ub upper_bound\n #define lb lower_bound\n #define mp make_pair\n #define f0(i,n) for(i=0;i<n;i++)\n #define rf0(i,n) for(i=n-1;i>=0;i--)\n #define f2(i,n) for(i=1;i<n;i++)\n #define f1(i,n) for(i=1;i<=n;i++)\n #define fab(i,a,b) for(i=a;i<=b;i++)\n #define shr  ll t;cin>>t; while(t--)\n #define fi first\n #define sc second\n #define pll pair<ll,ll>\n #define vll vector<ll>\n #define vpll vector<pll>\n #define all(v) v.begin(),v.end()\n #define mod 1000000007\n #define dev(a) for(auto it:a)cout<<it<<' '\n #define prec(nm,prc) cout<<fixed << setprecision(nm)<<prc\n #define print(a) cout<<a<<endl;\n #define nl '\n'\n using namespace std;\n bool comp(pll &a,pll &b)\n {\n     return (a.sc<b.sc);\n }\n ll power(ll n,ll p)\n {\n 	if(p==0)\n 	return 1;\n 	else\n 	{\n 		ll ans=power(n,p/2)%mod;\n 		ans=(ans*ans)%mod;\n 		if(p%2==0)\n 		return ans;\n 		else\n 		return ans=(ans*n)%mod;\n 	}\n }\n bool isPrime(ll n) \n { \n     if (n <= 1) \n         return false; \n     if (n <= 3) \n         return true; \n   \n     if (n % 2 == 0 || n % 3 == 0) \n         return false; \n   \n     for (ll i = 5; i * i <= n; i = i + 6) \n         if (n % i == 0 || n % (i + 2) == 0) \n             return false; \n   \n     return true; \n } \n \n \n     /********************HAR HAR MAHADEV***********JAI BAJRANG BALI************************/\n   int main()\n  {\n   	FAST;\n   	/* ifstream cin;\n     cin.open('input.txt');\n     ofstream cout;\n     cout.open('output.txt');\n                       */\n   	shr\n   	  {  \n   	  	ll i,j,n,a,b,c,c1,d,m,sum=0,temp,k,k2,k1,ans=0,cnt=0,r=0,e=0,f;\n   	  	string str,stri,om,s;\n   	     map<ll,ll>mp,mp1;\n   	     set<ll>st; vector<vll> v;\n   	     cin>>n>>k; ll x[n][2];\n   	     f0(i,n)\n   	     {\n   	         cin>>x[i][0]>>x[i][1];\n   	     }\n   	    f0(i,n)\n   	    {\n           vll vk;\n            f0(j,n)\n           {\n               \n               if(i!=j)\n               {\n                   vk.pb(abs(x[i][0]-x[j][0])+abs(x[i][1]-x[j][1]));\n               }\n              \n           }\n            v.pb(vk);\n           r++;\n       }\n   	   f0(i,v.size())\n   	   {\n       ll p=*max_element(all(v[i]));\n       if(p<=k){e=1;break;}\n       }\n       if(e==1)cout<<1;\n       else cout<<-1;\n       cout<<endl;\n   	  }\n   	  \n    	return 0;\n   }                     \n  "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n const double pi = acos(-1);\n const int MOD = 1e9 + 7;\n const int INF = 1e9 + 7;\n const int MAXN = 10000;\n const double eps = 1e-9;\n using namespace std;\n int n, m, cur;\n set<int> s;\n void dfs(int x, int y) {\n   if (y == 0) {\n     int tmp = abs(abs(x) - n);\n     if (tmp < MAXN) {\n       if (s.size() < m) s.insert(cur * MAXN + tmp);\n       if (s.size() < m) s.insert(cur + MAXN * tmp);\n     }\n     return;\n   }\n   dfs(x + (y % 10), y / 10);\n   dfs(x - (y % 10), y / 10);\n   dfs(x * (y % 10), y / 10);\n }\n int main() {\n   scanf('%d', &(n)), scanf('%d', &(m));\n   for (int i = 0; i < MAXN; i++) {\n     cur = i;\n     dfs(i % 10, i / 10);\n   }\n   auto it = s.begin();\n   for (; it != s.end(); it++) printf('%08d\n', *it);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1000000000;\n const int MAX = 400005;\n const int MAX1 = 2007;\n const int MAX2 = 4007;\n const int LEN = 21;\n const int BASE = 1000000000;\n const double EPS = 1e-7;\n const int MOD = 1234567891;\n vector<pair<char, int> > vec;\n int main(void) {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   ifstream in('');\n   ofstream out('');\n   int n, k;\n   cin >> n >> k;\n   string s;\n   cin >> s;\n   for (int i = (0); i < ((int)s.size()); ++i) {\n     vec.push_back(make_pair(s[i], i));\n   }\n   sort(vec.begin(), vec.end());\n   char ans[MAX];\n   memset(ans, '\0', sizeof(ans));\n   for (int i = (k); i < ((int)vec.size()); ++i) {\n     ans[vec[i].second] = vec[i].first;\n   }\n   for (int i = (0); i < (n); ++i) {\n     if (ans[i] != '\0') cout << ans[i];\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int num;\n int likes[7][7];\n map<string, int> 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<int> 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 <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   vector<int> v;\n   vector<int>::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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <class T, class V>\n void _print(pair<T, V> p);\n template <class T>\n void _print(vector<T> v);\n template <class T>\n void _print(set<T> v);\n template <class T, class V>\n void _print(map<T, V> v);\n template <class T>\n void _print(multiset<T> v);\n template <class T, class V>\n void _print(pair<T, V> p) {\n   cerr << '{';\n   _print(p.first);\n   cerr << ',';\n   _print(p.second);\n   cerr << '}';\n }\n template <class T>\n void _print(vector<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T>\n void _print(set<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T>\n void _print(multiset<T> v) {\n   cerr << '[ ';\n   for (T i : v) {\n     _print(i);\n     cerr << ' ';\n   }\n   cerr << ']';\n }\n template <class T, class V>\n void _print(map<T, V> 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<long long int> sieve(int n) {\n   int *arr = new int[n + 1]();\n   vector<long long int> 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 <bits/stdc++.h>\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<int>());\n   sort(p, p + m);\n   int l = 0, h = ((n) < (m) ? (n) : (m)), ans = 0;\n   while (l < h) {\n     int mid = (l + h + 1) / 2;\n     if (check(mid) == true) {\n       l = mid;\n     } else {\n       h = mid - 1;\n     }\n     ans = l;\n   }\n   int ans2 = 0;\n   for (__typeof((ans)) i = (0); i < (ans); i += 1) {\n     ans2 += p[i];\n   }\n   ans2 -= a;\n   if (ans2 < 0) {\n     ans2 = 0;\n   }\n   cout << ans << ' ' << ans2;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a00, a01, a10, a11;\n char *s;\n bool isSquare(long long x, long long &res) {\n   long long t = sqrt(x);\n   for (long long i = max(t - 10, 1LL); i <= t + 10; i++) {\n     if (i * i == x) {\n       res = i;\n       return true;\n     }\n   }\n   return false;\n }\n bool getS(long long n0, long long n1, long long n) {\n   s = new char[n + 1];\n   long long A01 = a01, A10 = a10;\n   for (long long i = 0; i < n; i++) {\n     if (A01 - n1 >= 0) {\n       s[i] = '0';\n       n0 -= 1;\n       A01 -= n1;\n     } else if (A10 - n0 >= 0) {\n       s[i] = '1';\n       n1 -= 1;\n       A10 -= n0;\n     } else\n       return false;\n   }\n   s[n] = '\0';\n   if (n0 != 0 || n1 != 0 || A01 != 0 || A10 != 0) return false;\n   return true;\n }\n bool solve() {\n   long long t;\n   if (!isSquare(1 + 8 * a00, t)) return false;\n   vector<long long> n0;\n   n0.push_back((1 + t) / 2);\n   n0.push_back((1 - t) / 2);\n   if (!isSquare(1 + 8 * a11, t)) return false;\n   vector<long long> n1;\n   n1.push_back((1 + t) / 2);\n   n1.push_back((1 - t) / 2);\n   for (auto i : n0)\n     for (auto j : n1) {\n       long long n = i + j;\n       if (i < 0 || j < 0 || n <= 0) continue;\n       if (!getS(i, j, n)) continue;\n       return true;\n     }\n   return false;\n }\n int main() {\n   while (cin >> a00 >> a01 >> a10 >> a11) {\n     bool can = solve();\n     printf('%s\n', can ? s : 'Impossible');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n using vi = vector<long long>;\n using pii = pair<long long, long long>;\n const signed INF_ = 1001001001;\n const long long INF = 1001001001001001001LL;\n const long long DX[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0},\n                 DY[9] = {-1, 0, 1, 0, -1, 1, 1, -1, 0};\n template <class T>\n ostream &operator<<(ostream &os, const vector<T> &v) {\n   for (auto i = (begin(v)); i != (end(v)); ++i)\n     os << *i << (i == end(v) - 1 ? '' : ' ');\n   return os;\n }\n template <class T>\n istream &operator>>(istream &is, vector<T> &v) {\n   for (auto i = (begin(v)); i != (end(v)); ++i) is >> *i;\n   return is;\n }\n template <class T, class U>\n istream &operator>>(istream &is, pair<T, U> &p) {\n   is >> p.first >> p.second;\n   return is;\n }\n template <class T, class U>\n bool chmax(T &a, const U &b) {\n   return a < b ? a = b, 1 : 0;\n }\n template <class T, class U>\n bool chmin(T &a, const U &b) {\n   return a > b ? a = b, 1 : 0;\n }\n template <class T>\n void PSUM(T &c) {\n   partial_sum(begin(c), end(c), begin(c));\n }\n template <class T>\n using heap = priority_queue<T, vector<T>, greater<T>>;\n struct before_main_function {\n   before_main_function() {\n     cin.tie(0);\n     ios::sync_with_stdio(0);\n     cout << setprecision(15) << fixed;\n   }\n } before_main_function;\n signed main() {\n   long long N, M;\n   cin >> N >> M;\n   vector<vector<long long>> g(N);\n   vector<long long> deg(N);\n   for (long long i = 0, ilen = (long long)(M); i < ilen; ++i) {\n     long long a, b;\n     cin >> a >> b;\n     a--, b--;\n     g[a].push_back(b);\n     g[b].push_back(a);\n     deg[a]++;\n     deg[b]++;\n   }\n   vector<pii> ans;\n   vector<bool> vis(N);\n   {\n     queue<long long> q;\n     long long st = max_element(begin(deg), end(deg)) - begin(deg);\n     q.push(st);\n     vis[st] = true;\n     while (q.size()) {\n       long long v = q.front();\n       q.pop();\n       for (auto &&w : g[v]) {\n         if (vis[w]) continue;\n         vis[w] = true;\n         ans.push_back({v + 1, w + 1});\n         q.push(w);\n       }\n     }\n   }\n   for (auto &&p : ans) {\n     cout << p.first << ' ' << p.second << endl;\n   }\n   return (0 ^ 0 ^ 0);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int rep[2000005];\n int sz[2000005];\n void dsu(int n) {\n   for (int i = 0; i < n; i++) rep[i] = i, sz[i] = 1;\n }\n int findSet(int a) { return ((rep[a] == a) ? a : rep[a] = findSet(rep[a])); }\n int mergeSet(int a, int b) {\n   int y = findSet(b);\n   int x = findSet(a);\n   if (x != y) {\n     rep[x] = y;\n     sz[y] += sz[x];\n     sz[x] = 0;\n   }\n }\n long long int grid[1005][1005];\n int vis[1005][1005] = {0};\n vector<pair<long long int, pair<int, int> > > v;\n int n, m;\n long long int k;\n int dx[] = {-1, 0, 0, 1};\n int dy[] = {0, -1, 1, 0};\n int solx = -1;\n int soly = -1;\n long long int sol;\n int cnt;\n void floodfill(int x, int y) {\n   if (cnt < 1) return;\n   vis[x][y] = 1;\n   grid[x][y] = sol;\n   cnt--;\n   for (int i = 0; i < 4; i++) {\n     int newx = x + dx[i];\n     int newy = y + dy[i];\n     if (newx >= 0 && newx < n && newy >= 0 && newy < m && !vis[newx][newy] &&\n         grid[newx][newy] >= sol) {\n       floodfill(newx, newy);\n     }\n   }\n }\n void solve() {\n   cin >> n >> m;\n   cin >> k;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       cin >> grid[i][j];\n       v.push_back(make_pair(grid[i][j], make_pair(i, j)));\n     }\n   }\n   sort(v.begin(), v.end(), greater<pair<long long int, pair<int, int> > >());\n   dsu(n * m);\n   int i = 0, j = 0;\n   while (i < v.size()) {\n     j = i;\n     while (j < v.size()) {\n       if (v[i].first == v[j].first) {\n         int x = v[j].second.first;\n         int y = v[j].second.second;\n         for (int k = 0; k < 4; k++) {\n           int newx = x + dx[k];\n           int newy = y + dy[k];\n           if (newx >= 0 && newx < n && newy >= 0 && newy < m &&\n               grid[newx][newy] >= v[j].first) {\n             mergeSet(newx * m + newy, x * m + y);\n           }\n         }\n       } else\n         break;\n       j++;\n     }\n     for (int l = i; l < j; l++) {\n       if (v[l].first && (k % v[l].first == 0) &&\n           sz[findSet(v[l].second.first * m + v[l].second.second)] >=\n               k / v[l].first) {\n         solx = v[l].second.first;\n         soly = v[l].second.second;\n         sol = v[l].first;\n         cnt = k / v[l].first;\n         break;\n       }\n     }\n     i = j;\n   }\n   if (solx == -1 || soly == -1)\n     cout << 'NO\n';\n   else {\n     floodfill(solx, soly);\n     cout << 'YES\n';\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < m - 1; j++) {\n         if (vis[i][j])\n           cout << grid[i][j] << ' ';\n         else\n           cout << '0 ';\n       }\n       if (vis[i][m - 1])\n         cout << grid[i][m - 1] << '\n';\n       else\n         cout << '0\n';\n     }\n   }\n }\n int main() {\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   int k = 0;\n   while (1) {\n     k++;\n     if (k % m == 0) n++;\n     n--;\n     if (n == 0) break;\n   }\n   cout << k;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 1e5;\n int edges[MAXN] = {0};\n int main() {\n   int n, s;\n   cin >> n >> s;\n   for (int i = 0; i < n - 1; i++) {\n     int a, b;\n     cin >> a >> b;\n     a--, b--;\n     edges[a]++, edges[b]++;\n   }\n   int amt = 0;\n   for (int i = 0; i < n; i++) {\n     if (edges[i] == 1) amt++;\n   }\n   double ans = ((double)s) / ((double)amt);\n   cout << fixed << setprecision(10) << ans * 2 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int v[100];\n bool cmp(int a, int b) { return a > b; }\n int highest(int n) {\n   int i = 1, fact = 0;\n   while (2 * i <= n) {\n     i *= 2;\n     fact++;\n   }\n   return fact;\n }\n void permute(int left, int right, int pos, int last) {\n   if (!pos || (!last && pos == 1)) return;\n   int t = highest(pos);\n   pos -= (1 << t);\n   if (!last) {\n     left = right - t - 1;\n     swap(v[left + 1], v[right]);\n     sort(v + left + 2, v + right, cmp);\n     permute(left, right, pos, t);\n     return;\n   }\n   swap(v[left], v[right]);\n   --right;\n   if (last - t != 1) {\n     ++left;\n     sort(v + left, v + right + 1);\n     permute(left, right, pos + (1 << t), 0);\n     return;\n   }\n   permute(left, right, pos, t);\n }\n int main() {\n   int n, m, num = 1, piv = 0, pos, t;\n   cin >> n >> m;\n   for (int i = 0; i < n; ++i) v[i] = i + 1;\n   permute(0, n - 1, m, 0);\n   for (int i = 0; i < n; ++i) cout << v[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n class Solver {\n  public:\n   Solver() = default;\n   void read() {\n     int n;\n     std::cin >> n;\n     int left = 0;\n     int right = 0;\n     for (int i = 0; i < n; ++i) {\n       int x, y;\n       std::cin >> x >> y;\n       if (x < 0)\n         left++;\n       else\n         right++;\n     }\n     if (left <= 1 || right <= 1)\n       std::cout << 'Yes\n';\n     else\n       std::cout << 'No\n';\n   }\n   void solve() {}\n   void write() {}\n };\n int main() {\n   Solver solver;\n   solver.read();\n   solver.solve();\n   solver.write();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int flow, n, m, S, T, tot, x, y;\n int g[3000], dis[3000], pre[3000];\n int Next[50000], adj[50000], f[50000], c[50000];\n bool used[3000];\n queue<int> q;\n int ans = 0;\n int calc[110][30];\n string t, s;\n void add(int x, int y, int flow, int cost) {\n   adj[tot] = y;\n   c[tot] = cost;\n   f[tot] = flow;\n   Next[tot] = g[x];\n   g[x] = tot++;\n   adj[tot] = x;\n   c[tot] = -cost;\n   f[tot] = 0;\n   Next[tot] = g[y];\n   g[y] = tot++;\n }\n bool spfa() {\n   for (int i = 1; i <= T; i++) dis[i] = 1 << 23;\n   dis[S] = 0;\n   memset(used, 0, sizeof(used));\n   while (!q.empty()) q.pop();\n   q.push(S);\n   used[S] = true;\n   int p;\n   while (!q.empty()) {\n     x = q.front();\n     used[x] = false;\n     p = g[x];\n     while (p != -1) {\n       y = adj[p];\n       if (f[p] && dis[x] + c[p] < dis[y]) {\n         dis[y] = dis[x] + c[p];\n         pre[y] = p;\n         if (!used[y]) {\n           used[y] = true;\n           q.push(y);\n         }\n       }\n       p = Next[p];\n     }\n     q.pop();\n   }\n   return dis[T] != 1 << 23;\n }\n int path() {\n   int del = 1 << 23;\n   int p = T;\n   while (p != S) {\n     if (f[pre[p]] < del) del = f[pre[p]];\n     p = adj[pre[p] ^ 1];\n   }\n   p = T;\n   while (p != S) {\n     f[pre[p]] -= del;\n     f[pre[p] ^ 1] += del;\n     p = adj[pre[p] ^ 1];\n   }\n   flow += del;\n   return del * dis[T];\n }\n void solve() {\n   memset(pre, 0, sizeof(pre));\n   while (spfa()) ans += path();\n   if (flow != t.size())\n     cout << -1 << endl;\n   else\n     cout << ans << endl;\n }\n int main() {\n   cin >> t;\n   cin >> n;\n   memset(g, -1, sizeof(g));\n   tot = 0;\n   S = 26 * (n + 1) + n + 1;\n   T = S + 1;\n   for (int i = 1; i <= n; i++) {\n     cin >> s >> x;\n     for (int j = 0; j < s.size(); j++) calc[i][s[j] - 'a']++;\n     add(S, 26 * (n + 1) + i, x, 0);\n   }\n   for (int i = 0; i < t.size(); i++) calc[n + 1][t[i] - 'a']++;\n   for (int i = 0; i < 26; i++) add(26 * n + i + 1, T, calc[n + 1][i], 0);\n   for (int i = 1; i <= n; i++)\n     for (int j = 0; j < 26; j++) {\n       add(26 * (n + 1) + i, (i - 1) * 26 + j + 1, 1 << 23, 0);\n       add((i - 1) * 26 + j + 1, 26 * n + j + 1, calc[i][j], i);\n     }\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   clock_t clk_begin = clock();\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int n;\n   cin >> n;\n   string s;\n   cin >> s;\n   int c = 0;\n   for (int i = 0; i < n; ++i)\n     if (s[i] == '8') c++;\n   n /= 11;\n   cout << min(n, c) << '\n';\n   ;\n   cerr << 'Time taken: ' << (double)(clock() - clk_begin) / CLOCKS_PER_SEC\n        << '\n';\n   return 0;\n   ;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int form[9], piece[9][2];\n map<int, int> res;\n string result[] = {\n     'illegal', 'the first player won', 'the second player won', 'draw', 'first',\n     'second'};\n void pre() {\n   form[0] = 3;\n   piece[0][0] = 1;\n   piece[0][1] = 1 << 1;\n   for (int i = 1; i < 9; i++) {\n     form[i] = form[i - 1] << 2;\n     piece[i][0] = piece[i - 1][0] << 2;\n     piece[i][1] = piece[i - 1][1] << 2;\n   }\n }\n int add(int now, int p, int who, bool end) {\n   int px = p / 3 * 3, py = p % 3;\n   if ((piece[px][who] & now) && (piece[px + 1][who] & now) &&\n       (piece[px + 2][who] & now))\n     return who + 1;\n   if ((piece[py][who] & now) && (piece[py + 3][who] & now) &&\n       (piece[py + 6][who] & now))\n     return who + 1;\n   if ((p == 0 || p == 4 || p == 8) && (piece[0][who] & now) &&\n       (piece[4][who] & now) && (piece[8][who] & now))\n     return who + 1;\n   if ((p == 2 || p == 4 || p == 6) && (piece[2][who] & now) &&\n       (piece[4][who] & now) && (piece[6][who] & now))\n     return who + 1;\n   return end ? 3 : 5 - who;\n }\n void enumeration(int now, int who, int round) {\n   for (int p = 0; p < 9; p++) {\n     if (now & form[p]) continue;\n     now ^= piece[p][who];\n     if (!res[now]) {\n       res[now] = add(now, p, who, round == 9);\n       if (res[now] > 3) enumeration(now, who ^ 1, round + 1);\n     }\n     now ^= piece[p][who];\n   }\n }\n int main() {\n   int now = 0;\n   char ch;\n   pre();\n   enumeration(now, 0, 1);\n   for (int p = 0; p < 9; p++) {\n     cin >> ch;\n     if (ch == 'X')\n       now ^= piece[p][0];\n     else if (ch == '0')\n       now ^= piece[p][1];\n   }\n   cout << result[res[now]] << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int parent(int x, vector<int> &v) {\n   return v[x] = (v[x] == x ? x : parent(v[x], v));\n }\n void u(int x, int y, vector<int> &v, vector<int> &r) {\n   x = parent(x, v);\n   y = parent(y, v);\n   if (r[x] == r[y]) {\n     if (x == y) {\n       return;\n     }\n     r[x]++;\n   }\n   if (r[x] > r[y]) {\n     v[y] = x;\n   } else {\n     v[x] = y;\n   }\n   return;\n }\n int main() {\n   int n;\n   scanf('%d\n', &n);\n   vector<int> v(26, -1);\n   vector<int> r(26);\n   string s;\n   for (int i = 0; i < n; i++) {\n     cin >> s;\n     if (v[s[0] - 'a'] == -1) {\n       v[s[0] - 'a'] = s[0] - 'a';\n     }\n     for (int i = 1; i < (int)s.size(); i++) {\n       if (v[s[i] - 'a'] == -1) {\n         v[s[i] - 'a'] = s[i] - 'a';\n       }\n       u(s[i] - 'a', s[0] - 'a', v, r);\n     }\n   }\n   unordered_map<int, int> h;\n   for (int i = 0; i < 26; i++) {\n     if (v[i] != -1) {\n       h[parent(v[i], v)] = 1;\n     }\n   }\n   cout << h.size();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[105], b[105];\n int main() {\n   int n, i, j, k, x, y;\n   while (~scanf('%d', &n)) {\n     for (i = 1; i <= n; i++) {\n       scanf('%d', &a[i]);\n     }\n     scanf('%d%d', &x, &y);\n     for (i = 1, j = 0; i <= n; i++) {\n       int count1 = 0, count2 = 0;\n       for (k = 1; k <= n; k++) {\n         if (k >= i)\n           count1 += a[k];\n         else\n           count2 += a[k];\n       }\n       if ((count1 >= x && count1 <= y) && (count2 >= x && count2 <= y)) {\n         b[j++] = i;\n         break;\n       }\n     }\n     if (j == 0) {\n       printf('0\n');\n       continue;\n     }\n     printf('%d\n', b[0]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   vector<vector<int>> a(n, vector<int>(m, 0));\n   vector<vector<int>> b(n, vector<int>(m, 0));\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       cin >> a[i][j];\n     }\n   }\n   vector<pair<int, int>> ans;\n   for (int i = 0; i < n - 1; i++) {\n     for (int j = 0; j < m - 1; j++) {\n       if (a[i][j] == 1 && a[i][j + 1] == 1 && a[i + 1][j + 1] == 1 &&\n           a[i + 1][j] == 1) {\n         ans.push_back(make_pair(i, j));\n         b[i][j] = 1;\n         b[i][j + 1] = 1;\n         b[i + 1][j + 1] = 1;\n         b[i + 1][j] = 1;\n       }\n     }\n   }\n   bool flag = true;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       if (a[i][j] != b[i][j]) {\n         flag = false;\n         i = n;\n         break;\n       }\n     }\n   }\n   if (flag) {\n     cout << ans.size() << endl;\n     for (auto it = ans.begin(); it != ans.end(); it++) {\n       cout << (*it).first + 1 << ' ' << (*it).second + 1 << endl;\n     }\n   } else\n     cout << -1 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T, typename U>\n inline void smin(T &a, const U &b) {\n   if (a > b) a = b;\n }\n template <typename T, typename U>\n inline void smax(T &a, const U &b) {\n   if (a < b) a = b;\n }\n template <class T>\n inline void gn(T &first) {\n   char c, sg = 0;\n   while (c = getchar(), (c > '9' || c < '0') && c != '-')\n     ;\n   for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';\n        c = getchar())\n     first = (first << 1) + (first << 3) + c - '0';\n   if (sg) first = -first;\n }\n template <class T1, class T2>\n inline void gn(T1 &x1, T2 &x2) {\n   gn(x1), gn(x2);\n }\n int power(int a, int b, int m, int ans = 1) {\n   for (; b; b >>= 1, a = 1LL * a * a % m)\n     if (b & 1) ans = 1LL * ans * a % m;\n   return ans;\n }\n vector<int> adj[500500];\n int can0[500500], can1[500500], dp0[500500], dp1[500500];\n int dp[4];\n int n, sz[500500];\n void dfs(int u, int f = 0) {\n   sz[u] = 1;\n   for (int v : adj[u])\n     if (v != f) dfs(v, u), sz[u] += sz[v];\n   can0[u] = 1;\n   dp[0] = 1, dp[1] = 0;\n   for (int v : adj[u]) {\n     if (v == f) continue;\n     can0[u] &= can1[v];\n     int t[2] = {dp[0], dp[1]};\n     dp[0] = t[0] * can1[v];\n     dp[1] = t[0] * can0[v] + t[1] * can1[v];\n   }\n   can1[u] = dp[1];\n   dp[0] = 1, dp[1] = 0;\n   for (int v : adj[u]) {\n     if (v == f) continue;\n     int t[2] = {dp[0], dp[1]};\n     dp[0] = t[0] * can1[v];\n     dp[1] = t[1] * can1[v] + t[0] * dp1[v];\n   }\n   dp0[u] = dp[1];\n   dp1[u] = can0[u];\n   dp[0] = 1, dp[1] = 0;\n   for (int v : adj[u]) {\n     if (v == f) continue;\n     int t[2] = {dp[0], dp[1]};\n     dp[0] = t[0] * can1[v];\n     dp[1] = t[1] * can1[v] + t[0] * dp0[v];\n   }\n   dp1[u] += dp[1];\n   dp[0] = 1, dp[1] = dp[2] = dp[3] = 0;\n   for (int v : adj[u]) {\n     if (v == f) continue;\n     int t[4] = {dp[0], dp[1], dp[2], dp[3]};\n     dp[0] = t[0] * can1[v];\n     dp[1] = t[0] * can0[v] + t[1] * can1[v];\n     dp[2] = t[0] * dp1[v] + t[2] * can1[v];\n     dp[3] = t[1] * dp1[v] + t[2] * can0[v] + t[3] * can1[v];\n   }\n   dp1[u] += dp[3];\n }\n long long ans;\n int c0[500500], c1[500500], d0[500500], d1[500500];\n int R[500500], Rdp[500500][4];\n void redfs(int u, int f = 0) {\n   if (f) {\n     if (can1[u] && c1[u])\n       ans += (long long)sz[u] * (n - sz[u]);\n     else\n       ans += (long long)dp1[u] * d1[u];\n   }\n   R[adj[u].size()] = 1;\n   Rdp[adj[u].size()][0] = 1;\n   Rdp[adj[u].size()][1] = 0;\n   for (int i = adj[u].size(); i--;) {\n     int v = adj[u][i];\n     R[i] = R[i + 1] & (v == f ? c1[u] : can1[v]);\n     Rdp[i][0] = Rdp[i + 1][0] * (v == f ? c1[u] : can1[v]);\n     Rdp[i][1] = Rdp[i + 1][0] * (v == f ? c0[u] : can0[v]) +\n                 Rdp[i + 1][1] * (v == f ? c1[u] : can1[v]);\n   }\n   int cur = 1;\n   dp[0] = 1, dp[1] = 0;\n   for (int i = 0; i < adj[u].size(); i++) {\n     int v = adj[u][i];\n     if (v != f) {\n       c0[v] = cur & R[i + 1];\n       c1[v] = dp[0] & Rdp[i + 1][1] | dp[1] & Rdp[i + 1][0];\n     }\n     int t[2] = {dp[0], dp[1]};\n     cur &= (v == f ? c1[u] : can1[v]);\n     dp[0] = t[0] * (v == f ? c1[u] : can1[v]);\n     dp[1] =\n         t[0] * (v == f ? c0[u] : can0[v]) + t[1] * (v == f ? c1[u] : can1[v]);\n   }\n   Rdp[adj[u].size()][0] = 1;\n   Rdp[adj[u].size()][1] = 0;\n   for (int i = adj[u].size(); i--;) {\n     int v = adj[u][i];\n     Rdp[i][0] = Rdp[i + 1][0] * (v == f ? c1[u] : can1[v]);\n     Rdp[i][1] = Rdp[i + 1][0] * (v == f ? d1[u] : dp1[v]) +\n                 Rdp[i + 1][1] * (v == f ? c1[u] : can1[v]);\n   }\n   dp[0] = 1, dp[1] = 0;\n   for (int i = 0; i < adj[u].size(); i++) {\n     int v = adj[u][i];\n     if (v != f) d0[v] = dp[0] * Rdp[i + 1][1] + dp[1] * Rdp[i + 1][0];\n     int t[2] = {dp[0], dp[1]};\n     dp[0] = t[0] * (v == f ? c1[u] : can1[v]);\n     dp[1] =\n         t[1] * (v == f ? c1[u] : can1[v]) + t[0] * (v == f ? d1[u] : dp1[v]);\n   }\n   for (int v : adj[u])\n     if (v != f) d1[v] = c0[v];\n   Rdp[adj[u].size()][0] = 1;\n   Rdp[adj[u].size()][1] = 0;\n   for (int i = adj[u].size(); i--;) {\n     int v = adj[u][i];\n     Rdp[i][0] = Rdp[i + 1][0] * (v == f ? c1[u] : can1[v]);\n     Rdp[i][1] = Rdp[i + 1][0] * (v == f ? d0[u] : dp0[v]) +\n                 Rdp[i + 1][1] * (v == f ? c1[u] : can1[v]);\n   }\n   dp[0] = 1, dp[1] = 0;\n   for (int i = 0; i < adj[u].size(); i++) {\n     int v = adj[u][i];\n     if (v != f) d1[v] += dp[0] * Rdp[i + 1][1] + dp[1] * Rdp[i + 1][0];\n     int t[2] = {dp[0], dp[1]};\n     dp[0] = t[0] * (v == f ? c1[u] : can1[v]);\n     dp[1] =\n         t[1] * (v == f ? c1[u] : can1[v]) + t[0] * (v == f ? d0[u] : dp0[v]);\n   }\n   Rdp[adj[u].size()][0] = 1;\n   Rdp[adj[u].size()][1] = 0;\n   Rdp[adj[u].size()][2] = 0;\n   Rdp[adj[u].size()][3] = 0;\n   for (int i = adj[u].size(); i--;) {\n     int v = adj[u][i];\n     Rdp[i][0] = Rdp[i + 1][0] * (v == f ? c1[u] : can1[v]);\n     Rdp[i][1] = Rdp[i + 1][0] * (v == f ? c0[u] : can0[v]) +\n                 Rdp[i + 1][1] * (v == f ? c1[u] : can1[v]);\n     Rdp[i][2] = Rdp[i + 1][0] * (v == f ? d1[u] : dp1[v]) +\n                 Rdp[i + 1][2] * (v == f ? c1[u] : can1[v]);\n     Rdp[i][3] = Rdp[i + 1][1] * (v == f ? d1[u] : dp1[v]) +\n                 Rdp[i + 1][2] * (v == f ? c0[u] : can0[v]) +\n                 Rdp[i + 1][3] * (v == f ? c1[u] : can1[v]);\n   }\n   dp[0] = 1, dp[1] = dp[2] = dp[3] = 0;\n   for (int i = 0; i < adj[u].size(); i++) {\n     int v = adj[u][i];\n     if (v != f)\n       d1[v] += dp[0] * Rdp[i + 1][3] + dp[1] * Rdp[i + 1][2] +\n                dp[2] * Rdp[i + 1][1] + dp[3] * Rdp[i + 1][0];\n     int t[4] = {dp[0], dp[1], dp[2], dp[3]};\n     dp[0] = t[0] * (v == f ? c1[u] : can1[v]);\n     dp[1] =\n         t[0] * (v == f ? c0[u] : can0[v]) + t[1] * (v == f ? c1[u] : can1[v]);\n     dp[2] =\n         t[0] * (v == f ? d1[u] : dp1[v]) + t[2] * (v == f ? c1[u] : can1[v]);\n     dp[3] = t[1] * (v == f ? d1[u] : dp1[v]) +\n             t[2] * (v == f ? c0[u] : can0[v]) +\n             t[3] * (v == f ? c1[u] : can1[v]);\n   }\n   for (int v : adj[u])\n     if (v != f) redfs(v, u);\n }\n int main() {\n   cin >> n;\n   for (int i = 1; i < n; i++) {\n     int u, v;\n     gn(u, v);\n     adj[u].push_back(v);\n     adj[v].push_back(u);\n   }\n   dfs(1);\n   redfs(1);\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using pii = pair<int, int>;\n \n void solve() {\n 	int m, k;\n 	cin >> m >> k;\n \n 	vector<pii> a;\n \n 	int ai;\n 	for (int i = 1; i <= k; i++) {\n 		cin >> ai;\n 		a.push_back({ai, i});\n 	}\n \n 	sort(a.begin(), a.end(), greater<pii>());\n \n 	int n = 1;\n 	for (; ; n++) {\n 		if (m > n * n - (n / 2) * (n / 2)) continue;\n 		if (a[0].first > n * ((n + 1) / 2)) continue;\n 		break;\n 	}\n 	\n 	vector<pii> pos[3];\n 	for (int i = 0; i < n; i++) {\n 		for (int j = 0; j < n; j++) {\n 			int idx = ((i & 1) << 1) + (j & 1);\n 			if (idx != 3) \n 				pos[idx].push_back({i, j});\n 		}\n 	}\n \n 	vector<vector<int>> ans(n, vector<int>(n, 0));\n \n 	for (auto [cnt, val] : a) {\n 		vector<pii> &curr = pos[1].empty() ? pos[2] : pos[1];\n \n 		for (; !curr.empty() && cnt > 0; cnt--) {\n 			auto [x, y] = curr.back();\n 			curr.pop_back();\n 			ans[x][y] = val;\n 		}\n 		for (; cnt > 0; cnt--) {\n 			auto [x, y] = pos[0].back();\n 			pos[0].pop_back();\n 			ans[x][y] = val;\n 		}\n 	}\n \n 	cout << n << '\n';\n 	for (int i = 0; i < n; i++) {\n 		for (int j = 0; j < n; j++) {\n 			cout << ans[i][j] << ' ';\n 		}\n 		cout << '\n';\n 	}\n }\n \n int main() {\n 	ios_base::sync_with_stdio(0);\n 	cin.tie(0);\n \n 	int t;\n 	cin >> t;\n \n 	while (t--) {\n 		solve();\n 	}\n \n 	return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 211, M = N * N / 2;\n int u[M], v[M], w[M];\n int f[N][N];\n bool check(int n, int m, int lim) {\n   for (int i = 1; i <= m; i++) {\n     vector<pair<int, int>> v;\n     bool t = 1;\n     for (int j = 1; j <= n; j++) {\n       int l = f[j][u[i]], r = f[j][::v[i]];\n       if (lim >= l && lim >= r) {\n         if (2 * lim - l - r >= w[i]) {\n           v.push_back({0, 1});\n           v.push_back({w[i] + 1, -1});\n         } else {\n           v.push_back({0, 1});\n           v.push_back({min(w[i], lim - l) + 1, -1});\n           v.push_back({w[i] - min(w[i], lim - r), 1});\n           v.push_back({w[i] + 1, -1});\n         }\n       } else if (lim >= l) {\n         v.push_back({0, 1});\n         v.push_back({min(w[i], lim - l) + 1, -1});\n       } else if (lim >= r) {\n         v.push_back({w[i] - min(w[i], lim - r), 1});\n         v.push_back({w[i] + 1, -1});\n       } else {\n         t = 0;\n         break;\n       }\n     }\n     if (!t) continue;\n     sort(v.begin(), v.end());\n     int cnt = 0;\n     for (auto e : v) {\n       cnt += e.second;\n       if (cnt == n) return 1;\n     }\n   }\n   return 0;\n }\n int main() {\n   ios ::sync_with_stdio(0);\n   int n, m;\n   cin >> n >> m;\n   memset(f, 0x3f, sizeof f);\n   for (int i = 1; i <= n; i++) f[i][i] = 0;\n   for (int i = 1; i <= m; i++) {\n     cin >> u[i] >> v[i] >> w[i];\n     w[i] *= 2;\n     f[u[i]][v[i]] = f[v[i]][u[i]] = w[i];\n   }\n   for (int k = 1; k <= n; k++)\n     for (int i = 1; i <= n; i++)\n       for (int j = 1; j <= n; j++) f[i][j] = min(f[i][j], f[i][k] + f[k][j]);\n   int l = 0, r = 1e8L;\n   while (l + 1 < r) {\n     int im = (l + r) / 2;\n     if (check(n, m, im - 1))\n       r = im;\n     else\n       l = im;\n   }\n   cout << fixed << setprecision(1);\n   cout << l / 2.0 << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int ans1, ans2;\n int t[4], v[4][10], T[10][10], A, B, C;\n map<string, int> mymap;\n const char *help[] = {'Anka',   'Chapay', 'Cleo',       'Troll',\n                       'Dracul', 'Snowy',  'Hexadecimal'};\n int countT() {\n   int ret = 0;\n   for (int k = 0; k < 3; k++) {\n     for (int i = 0; i < t[k]; i++)\n       for (int j = 0; j < t[k]; j++)\n         if (T[v[k][i]][v[k][j]]) ret++;\n   }\n   return ret;\n }\n void go(int x) {\n   if (x == 8) {\n     if (!t[0] || !t[1] || !t[2]) return;\n     int h[4];\n     h[0] = A / t[0];\n     h[1] = B / t[1];\n     h[2] = C / t[2];\n     sort(h, h + 3);\n     int d = h[2] - h[0];\n     int p = countT();\n     if (d < ans1) {\n       ans1 = d;\n       ans2 = p;\n     } else if (d == ans1) {\n       ans2 = max(ans2, p);\n     }\n     return;\n   }\n   for (int i = 0; i < 3; i++) {\n     v[i][t[i]++] = x;\n     go(x + 1);\n     t[i]--;\n   }\n   return;\n }\n int main() {\n   char s1[30], s2[30], s3[30];\n   for (int i = 0; i < 7; i++) mymap[help[i]] = i + 1;\n   memset(T, 0, sizeof(T));\n   int m;\n   cin >> m;\n   while (m--) {\n     cin >> s1 >> s2 >> s3;\n     int u, v;\n     u = mymap[s1];\n     v = mymap[s3];\n     T[u][v] = 1;\n   }\n   cin >> A >> B >> C;\n   ans1 = 2000000001;\n   ans2 = 0;\n   memset(t, 0, sizeof(t));\n   go(1);\n   cout << ans1 << ' ' << ans2 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n typedef long long ll ;\n using namespace std;\n const int maxn=2e5+5;\n const int maxm=5e6+5;\n #define P pair<int,int>\n #define fi first\n #define se second\n int t,n;\n int a[maxn];\n int vis[maxm*2];\n P mp[maxm];\n \n \n int main() {\n     ios::sync_with_stdio(false);\n     cin.tie(nullptr), cout.tie(nullptr);\n     cin>>n;\n     for(int i=1;i<=n;i++){\n         cin>>a[i];\n     }\n     int sum1;\n     for(int i=1;i<=n;i++){\n         for(int j=i+1;j<=n;j++){\n             sum1=a[i]+a[j];\n             if(mp[sum1].fi==0 &&mp[sum1].se==0){\n                 mp[sum1]={i,j};\n             }else if(i!=mp[sum1].fi&&i!=mp[sum1].se&&j!=mp[sum1].fi&&j!=mp[sum1].se){\n                 cout<<'YES'<<endl;\n                 cout<<i<<' '<<j<<' '<<mp[sum1].fi<<' '<<mp[sum1].se<<endl;\n                 return 0;\n             }\n         }\n     }\n     cout<<'NO'<<endl;\n     return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n T BigMod(T b, T p, T m) {\n   if (p == 0) return 1;\n   if (p % 2 == 0) {\n     T s = BigMod(b, p / 2, m);\n     return ((s % m) * (s % m)) % m;\n   }\n   return ((b % m) * (BigMod(b, p - 1, m) % m)) % m;\n }\n template <typename T>\n T ModInv(T b, T m) {\n   return BigMod(b, m - 2, m);\n }\n template <typename T>\n T in() {\n   char ch;\n   T n = 0;\n   bool ng = false;\n   while (1) {\n     ch = getchar();\n     if (ch == '-') {\n       ng = true;\n       ch = getchar();\n       break;\n     }\n     if (ch >= '0' && ch <= '9') break;\n   }\n   while (1) {\n     n = n * 10 + (ch - '0');\n     ch = getchar();\n     if (ch < '0' || ch > '9') break;\n   }\n   return (ng ? -n : n);\n }\n template <typename T>\n T POW(T B, T printf) {\n   if (printf == 0) return 1;\n   if (printf & 1)\n     return B * POW(B, printf - 1);\n   else\n     return (POW(B, printf / 2) * POW(B, printf / 2));\n }\n template <typename T>\n T Bigmod(T b, T p, T m) {\n   if (p == 0)\n     return 1;\n   else if (!(p & 1))\n     return (Bigmod(b, p / 2, m) * Bigmod(b, p / 2, m)) % m;\n   else\n     return ((b % m) * Bigmod(b, p - 1, m)) % m;\n }\n template <typename T>\n T Dis(T x1, T y1, T x2, T y2) {\n   return sqrt((x1 - x2 * x1 - x2) + (y1 - y2 * y1 - y2));\n }\n template <typename T>\n T Angle(T x1, T y1, T x2, T y2) {\n   return atan(double(y1 - y2) / double(x1 - x2));\n }\n template <typename T>\n T DIFF(T a, T b) {\n   T d = a - b;\n   if (d < 0)\n     return -d;\n   else\n     return d;\n }\n template <typename T>\n T ABS(T a) {\n   if (a < 0)\n     return -a;\n   else\n     return a;\n }\n template <typename T>\n T gcd(T a, T b) {\n   if (a < 0) return gcd(-a, b);\n   if (b < 0) return gcd(a, -b);\n   return (b == 0) ? a : gcd(b, a % b);\n }\n template <typename T>\n T lcm(T a, T b) {\n   if (a < 0) return lcm(-a, b);\n   if (b < 0) return lcm(a, -b);\n   return a * (b / gcd(a, b));\n }\n template <typename T>\n T euclide(T a, T b, T &x, T &y) {\n   if (a < 0) {\n     T d = euclide(-a, b, x, y);\n     x = -x;\n     return d;\n   }\n   if (b < 0) {\n     T d = euclide(a, -b, x, y);\n     y = -y;\n     return d;\n   }\n   if (b == 0) {\n     x = 1;\n     y = 0;\n     return a;\n   } else {\n     T d = euclide(b, a % b, x, y);\n     T t = x;\n     x = y;\n     y = t - (a / b) * y;\n     return d;\n   }\n }\n template <typename T>\n void ia(T a[], int n) {\n   for (int i = 0; i < n; i++) cin >> a[i];\n }\n template <typename T>\n void pa(T a[], int n) {\n   for (int i = 0; i < n - 1; i++) cout << a[i] << ' ';\n   cout << a[n - 1] << endl;\n }\n template <typename T>\n long long int isLeft(T a, T b, T c) {\n   return (a.x - b.x) * (b.y - c.y) - (b.x - c.x) * (a.y - b.y);\n }\n int Set(int N, int pos) { return N = N | (1 << pos); }\n int Reset(int N, int pos) { return N = N & ~(1 << pos); }\n bool Check(int N, int pos) { return (bool)(N & (1 << pos)); }\n template <class T, class first>\n inline T togglebit(T a, first i) {\n   T t = 1;\n   return (a ^ (t << i));\n }\n int toInt(string s) {\n   int sm;\n   stringstream ss(s);\n   ss >> sm;\n   return sm;\n }\n int toLlint(string s) {\n   long long int sm;\n   stringstream ss(s);\n   ss >> sm;\n   return sm;\n }\n int cdigittoint(char ch) { return ch - '0'; }\n bool isVowel(char ch) {\n   ch = toupper(ch);\n   if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')\n     return true;\n   return false;\n }\n bool isConst(char ch) {\n   if (isalpha(ch) && !isVowel(ch)) return true;\n   return false;\n }\n double DEG(double x) { return (180.0 * x) / (2.0 * acos(0.0)); }\n double RAD(double x) { return (x * (double)2.0 * acos(0.0)) / (180.0); }\n vector<int> adj[200007], dag[200007], par[200007];\n int DP[200007][18], siz[200007];\n long long int dis[200007];\n int L[200007];\n int inDeg[200007];\n bool vis[200007];\n void Init(int n) {\n   for (int i = 0; i <= n; i++) {\n     dis[i] = 1LL << 60;\n     adj[i].clear();\n     dag[i].clear();\n     par[i].clear();\n     inDeg[i] = siz[i] = vis[i] = 0;\n     for (int j = 0; j < 18; j++) DP[i][j] = -1;\n   }\n }\n void Update(int u, int p) {\n   DP[u][0] = p;\n   L[u] = L[p] + 1;\n   adj[p].push_back(u);\n   for (int i = 1; i < 18; i++)\n     if (DP[u][i - 1] != -1) DP[u][i] = DP[DP[u][i - 1]][i - 1];\n }\n int LCA(int p, int q) {\n   if (L[p] < L[q]) swap(p, q);\n   for (int i = 18 - 1; i >= 0; i--)\n     if (L[p] - (1 << i) >= L[q]) p = DP[p][i];\n   if (p == q) return p;\n   for (int i = 18 - 1; i >= 0; i--)\n     if (DP[p][i] != -1 && DP[p][i] != DP[q][i]) {\n       p = DP[p][i];\n       q = DP[q][i];\n     }\n   return DP[p][0];\n }\n void Dijkstra(int n, int s) {\n   set<pair<long long int, long long int> > pq;\n   pq.insert(make_pair(0, s));\n   dis[s] = 0;\n   L[s] = 1;\n   while (!pq.empty()) {\n     pair<long long int, long long int> tmp = *pq.begin();\n     pq.erase(pq.begin());\n     int u = tmp.second;\n     for (int i = 0; i < adj[u].size(); i += 2) {\n       int v = adj[u][i];\n       int w = adj[u][i + 1];\n       if (dis[v] > dis[u] + w) {\n         dis[v] = dis[u] + w;\n         pq.insert(make_pair(dis[v], v));\n       }\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     for (int j = 0; j < adj[i].size(); j += 2) {\n       int v = adj[i][j];\n       int w = adj[i][j + 1];\n       if (dis[i] + w == dis[v]) {\n         inDeg[v]++;\n         dag[i].push_back(v);\n         par[v].push_back(i);\n       }\n     }\n     adj[i].clear();\n   }\n }\n void TopSort(int s) {\n   queue<int> q;\n   q.push(s);\n   L[s] = 1;\n   while (!q.empty()) {\n     int u = q.front();\n     q.pop();\n     if (!par[u].empty()) {\n       int lca = par[u][0];\n       for (int i = 1; i < par[u].size(); i++) {\n         lca = LCA(lca, par[u][i]);\n       }\n       Update(u, lca);\n     }\n     for (int i = 0; i < dag[u].size(); i++) {\n       int v = dag[u][i];\n       inDeg[v]--;\n       if (!inDeg[v]) q.push(v);\n     }\n   }\n }\n void Dfs(int u) {\n   siz[u] = 1;\n   vis[u] = 1;\n   for (int i = 0; i < adj[u].size(); i++) {\n     Dfs(adj[u][i]);\n     siz[u] += siz[adj[u][i]];\n   }\n }\n int main() {\n   int n, m, s;\n   scanf('%d%d%d', &n, &m, &s);\n   Init(n);\n   for (int i = 1; i <= m; i++) {\n     int u, v, w;\n     scanf('%d%d%d', &u, &v, &w);\n     adj[u].push_back(v);\n     adj[u].push_back(w);\n     adj[v].push_back(u);\n     adj[v].push_back(w);\n   }\n   Dijkstra(n, s);\n   TopSort(s);\n   Dfs(s);\n   int mx = 0;\n   for (int i = 1; i <= n; i++) {\n     if (i != s) mx = max(mx, siz[i]);\n   }\n   cout << mx << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int M = 2048;\n char s[M], b[M], e[M], fb[M], fe[M];\n int r[2][M], *p = r[0], *q = r[1], h[M];\n int main(void) {\n   cin >> s >> b >> e;\n   int ns = strlen(s), nb = strlen(b), ne = strlen(e), nn = nb > ne ? nb : ne,\n       w = 0;\n   for (int i = ns; i-- > 0;) {\n     if (!strncmp(s + i, b, nb)) fb[i] = 1;\n     if (!strncmp(s + i, e, ne)) fe[i] = 1;\n   }\n   for (int i = 0, *t; i < ns; ++i, t = p, p = q, q = t)\n     for (int j = i; j-- > 0;) {\n       q[j + 1] = (s[i] == s[j]) ? (p[j] + 1) : 0;\n       if (h[i] < q[j + 1]) h[i] = q[j + 1];\n     }\n   for (int i = ns; i-- > 0;)\n     if (fb[i])\n       for (int j = i + nn; j <= ns; ++j)\n         if (fe[j - ne] && h[j - 1] < j - i) ++w;\n   cout << w << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n int inv[25];\n long long a[25];\n int power(int a, int b) {\n   int c = 1;\n   for (; b; b >>= 1) {\n     if (b & 1) c = (long long)c * a % mod;\n     a = (long long)a * a % mod;\n   }\n   return c;\n }\n int C(long long y, int x) {\n   if (y < 0 || x < 0 || y < x) return 0;\n   y %= mod;\n   if (y == 0 || x == 0) return 1;\n   int ans = 1;\n   for (int i = 0; i < x; i++) ans = (long long)ans * (y - i) % mod;\n   for (int i = 1; i <= x; i++) ans = (long long)ans * inv[i] % mod;\n   return ans;\n }\n int main() {\n   int n;\n   long long m;\n   long long ans = 0;\n   for (int i = 1; i <= 20; i++) inv[i] = power(i, mod - 2);\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++) cin >> a[i];\n   for (int x = 0; x < (1 << n); x++) {\n     if (x == 0)\n       ans = (ans + C(n + m - 1, n - 1)) % mod;\n     else {\n       long long t = n + m;\n       int p = 0;\n       for (int i = 0; i < n; i++)\n         if ((x >> i) & 1) {\n           p++;\n           t -= a[i + 1];\n         }\n       t -= (p + 1);\n       if (p & 1)\n         ans = (ans - C(t, n - 1)) % mod;\n       else\n         ans = (ans + C(t, n - 1)) % mod;\n     }\n   }\n   cout << (ans + mod) % mod << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T1, typename T2>\n string print_iterable(T1 begin_iter, T2 end_iter, int counter) {\n   bool done_something = false;\n   stringstream res;\n   res << '[';\n   for (; begin_iter != end_iter and counter; ++begin_iter) {\n     done_something = true;\n     counter--;\n     res << *begin_iter << ', ';\n   }\n   string str = res.str();\n   if (done_something) {\n     str.pop_back();\n     str.pop_back();\n   }\n   str += ']';\n   return str;\n }\n vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {\n   vector<int> ord(size);\n   for (int i = 0; i < size; i++) ord[i] = i;\n   sort(ord.begin(), ord.end(), compare);\n   return ord;\n }\n template <typename T>\n bool MinPlace(T& a, const T& b) {\n   if (a > b) {\n     a = b;\n     return true;\n   }\n   return false;\n }\n template <typename T>\n bool MaxPlace(T& a, const T& b) {\n   if (a < b) {\n     a = b;\n     return true;\n   }\n   return false;\n }\n const int MAXN = 100100;\n int a[MAXN];\n int pr[MAXN];\n int last_apparizione[MAXN];\n int N;\n int res[MAXN];\n int EasyCalc(int k) {\n   if (res[k]) return res[k];\n   int ris = 1;\n   int curr_start = 0;\n   int curr_size = 1;\n   for (int i = 1; i < N; i++) {\n     curr_size += curr_start > pr[i];\n     if (curr_size > k) {\n       curr_size = 1;\n       curr_start = i;\n       ris++;\n     }\n   }\n   return ris;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> N;\n   for (int i = 0; i < N; i++) cin >> a[i];\n   for (int i = 0; i < MAXN; i++) last_apparizione[i] = -1;\n   for (int i = 0; i < N; i++) {\n     pr[i] = last_apparizione[a[i]];\n     last_apparizione[a[i]] = i;\n   }\n   int rad = min((int)(2 * sqrt(N)), N);\n   for (int k = 1; k <= rad; k++) res[k] = EasyCalc(k);\n   int curr = rad;\n   while (curr <= N) {\n     int l = curr + 1;\n     int r = N + 1;\n     while (l < r) {\n       int m = (l + r) / 2;\n       res[m] = EasyCalc(m);\n       if (res[m] == res[curr])\n         l = m + 1;\n       else\n         r = m;\n     }\n     int prox = l;\n     for (int i = curr + 1; i < prox; i++) res[i] = res[curr];\n     curr = prox;\n   }\n   for (int k = 1; k <= N; k++) cout << res[k] << ' ';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, ans = 0;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     int x, y, z;\n     cin >> x >> y >> z;\n     ans += (x + y + z >= 2);\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char str[1010];\n int pri[510][510];\n int pre[510][510];\n int f[510][510];\n bool v[510] = {0};\n int N;\n void init() {\n   gets(str);\n   scanf('%d', &N);\n }\n void prework() {\n   int len = strlen(str);\n   for (int i = 0; i < len; ++i)\n     for (int j = 0; j < len; ++j) {\n       int p = 0;\n       int tmp = 0;\n       while (i + p < j - p) {\n         if (str[i + p] != str[j - p]) tmp++;\n         p++;\n       }\n       pri[i + 1][j + 1] = tmp;\n     }\n }\n void dp() {\n   int len = strlen(str);\n   memset(f, 10, sizeof(f));\n   f[0][0] = 0;\n   for (int i = 1; i <= len; ++i) {\n     for (int j = 1; j <= N; ++j)\n       for (int k = 0; k < i; ++k) {\n         if (f[i][j] > f[k][j - 1] + pri[k + 1][i]) {\n           f[i][j] = f[k][j - 1] + pri[k + 1][i];\n           pre[i][j] = k;\n         }\n       }\n   }\n   int Ans = 1000000000;\n   int p;\n   for (int i = 1; i <= N; ++i)\n     if (f[len][i] < Ans) {\n       Ans = f[len][i];\n       p = i;\n     }\n   printf('%d\n', Ans);\n   int q = len;\n   while (q != 0) {\n     v[pre[q][p]] = 1;\n     int x = 0;\n     while (pre[q][p] + x < q - 1 - x) {\n       str[pre[q][p] + x] = str[q - 1 - x];\n       x++;\n     }\n     q = pre[q][p];\n     p--;\n   }\n   v[0] = 0;\n   for (int i = 0; i < len; ++i) {\n     if (v[i]) putchar('+');\n     putchar(str[i]);\n   }\n }\n int main() {\n   init();\n   prework();\n   dp();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC optimize('unroll-loops')\n #pragma GCC target( \\n     'sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native')\n using namespace std;\n template <typename T1, typename T2>\n void ckmin(T1 &a, T2 b) {\n   if (a > b) a = b;\n }\n template <typename T1, typename T2>\n void ckmax(T1 &a, T2 b) {\n   if (a < b) a = b;\n }\n int read() {\n   int x = 0, f = 0;\n   char ch = getchar();\n   while (!isdigit(ch)) f |= ch == '-', ch = getchar();\n   while (isdigit(ch)) x = 10 * x + ch - '0', ch = getchar();\n   return f ? -x : x;\n }\n template <typename T>\n void print(T x) {\n   if (x < 0) putchar('-'), x = -x;\n   if (x >= 10) print(x / 10);\n   putchar(x % 10 + '0');\n }\n template <typename T>\n void print(T x, char let) {\n   print(x), putchar(let);\n }\n const int mod = 998244353;\n const int G = 3, Gi = 332748118;\n int add(int x, int y) {\n   if ((x += y) >= mod) x -= mod;\n   return x;\n }\n int sub(int x, int y) {\n   if ((x -= y) < 0) x += mod;\n   return x;\n }\n int qpow(int a, int b = mod - 2) {\n   int res = 1;\n   while (b > 0) {\n     if (b & 1) res = 1ll * res * a % mod;\n     a = 1ll * a * a % mod;\n     b >>= 1;\n   }\n   return res;\n }\n namespace Poly {\n vector<int> Rev, W;\n int lim, L;\n void getR(int len) {\n   lim = 1, L = 0;\n   while (lim <= len) lim <<= 1, L++;\n   Rev.resize(lim), W.resize(lim), W[0] = 1;\n   for (int i = 0; i < lim; i++)\n     Rev[i] = (Rev[i >> 1] >> 1) | ((i & 1) << L - 1);\n }\n void wf(vector<int> &a) {\n   int n = a.size();\n   for (int i = 0; i < n; i++) a[i] = 1ll * (i + 1) * a[i + 1] % mod;\n   a[n - 1] = 0;\n }\n void jf(vector<int> &a) {\n   int n = a.size();\n   for (int i = n - 1; i >= 1; i--) a[i] = 1ll * a[i - 1] * qpow(i) % mod;\n   a[0] = 0;\n }\n void NTT(vector<int> &a, int opt) {\n   for (int i = 0; i < lim; i++)\n     if (i < Rev[i]) swap(a[i], a[Rev[i]]);\n   for (int mid = 1; mid < lim; mid <<= 1) {\n     int Wn = qpow(opt == 1 ? G : Gi, (mod - 1) / (mid << 1));\n     for (int k = 1; k < mid; k++) W[k] = 1ll * W[k - 1] * Wn % mod;\n     for (int j = 0; j < lim; j += mid << 1) {\n       for (int k = 0; k < mid; k++) {\n         int x = a[j + k], y = 1ll * W[k] * a[j + k + mid] % mod;\n         a[j + k] = add(x, y);\n         a[j + k + mid] = sub(x, y);\n       }\n     }\n   }\n   if (opt == -1) {\n     int linv = qpow(lim);\n     for (int i = 0; i < lim; i++) a[i] = 1ll * a[i] * linv % mod;\n   }\n }\n vector<int> operator*(vector<int> a, vector<int> b) {\n   int len = a.size() + b.size() - 1;\n   getR(len);\n   a.resize(lim), b.resize(lim);\n   NTT(a, 1), NTT(b, 1);\n   for (int i = 0; i < lim; i++) a[i] = 1ll * a[i] * b[i] % mod;\n   NTT(a, -1);\n   a.resize(len);\n   return a;\n }\n vector<int> Inv(vector<int> a) {\n   if ((int(a.size())) == 1) return vector<int>(1, qpow(a[0]));\n   int len = a.size();\n   vector<int> ta = a;\n   ta.resize((len + 1) / 2);\n   vector<int> tb = Inv(ta);\n   getR(2 * len), a.resize(lim), tb.resize(lim);\n   NTT(a, 1), NTT(tb, 1);\n   for (int i = 0; i < lim; i++)\n     tb[i] = 1ll * tb[i] * (mod + 2 - 1ll * a[i] * tb[i] % mod) % mod;\n   NTT(tb, -1);\n   tb.resize(len);\n   return tb;\n }\n vector<int> Ln(vector<int> a) {\n   vector<int> ta = a;\n   wf(ta);\n   int len = a.size();\n   a = ta * Inv(a), jf(a);\n   a.resize(len);\n   return a;\n }\n vector<int> Exp(vector<int> a) {\n   if ((int(a.size())) == 1) return vector<int>(1, 1);\n   int len = a.size();\n   vector<int> ta = a;\n   ta.resize((len + 1) / 2);\n   vector<int> tb = Exp(ta);\n   tb.resize(len);\n   vector<int> Lnb = Ln(tb);\n   assert(Lnb.size() == len);\n   for (int i = 0; i < len; i++) Lnb[i] = (a[i] - Lnb[i] + mod) % mod;\n   Lnb[0] = (Lnb[0] + 1) % mod;\n   tb = tb * Lnb;\n   tb.resize(len);\n   return tb;\n }\n }  // namespace Poly\n using namespace Poly;\n const int N = 250005;\n const int B = 15;\n vector<int> adj[N];\n int n;\n int son[N];\n void dfs1(int u, int fa) {\n   for (auto v : adj[u]) {\n     if (v == fa) continue;\n     son[u]++;\n     dfs1(v, u);\n   }\n }\n int two[N], len;\n vector<int> solve(int l, int r) {\n   if (l > r) return {1};\n   if (l == r) return {1, mod - two[l]};\n   int mid = l + r >> 1;\n   return solve(l, mid) * solve(mid + 1, r);\n }\n int fac[N], inv[N];\n int fuck[N];\n int main() {\n   n = read();\n   inv[1] = 1;\n   for (int i = 2; i <= n; i++)\n     inv[i] = 1ull * (mod - mod / i) * inv[mod % i] % mod;\n   fac[0] = 1;\n   for (int i = 1; i <= n; i++) fac[i] = 1ull * fac[i - 1] * i % mod;\n   for (int i = 1; i <= n - 1; i++) {\n     int u = read(), v = read();\n     adj[u].push_back(v), adj[v].push_back(u);\n   }\n   dfs1(1, 0);\n   vector<int> ONE(n + 1);\n   for (int i = 1; i <= n; i++) {\n     if (son[i] > B) {\n       two[++len] = son[i];\n     } else {\n       fuck[son[i]]++;\n     }\n   }\n   for (int i = 1; i <= B; i++) {\n     int coef = 1;\n     for (int j = 1; j <= n; j++) {\n       coef = 1ull * coef * i % mod;\n       ONE[j] = sub(ONE[j], 1ull * fuck[i] * coef % mod * inv[j] % mod);\n     }\n   }\n   ONE = Exp(ONE);\n   vector<int> TWO = solve(1, len);\n   vector<int> f = ONE * TWO;\n   int ans = 0;\n   for (int i = 0; i <= n - 1; i++) ans = (ans + 1ll * fac[n - i] * f[i]) % mod;\n   print(ans, '\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, arr[200005];\n   string swaps;\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> arr[i];\n   cin >> swaps;\n   int m = 0, flag = 0;\n   for (int i = 1; i < n; i++) {\n     m = max(m, arr[i]);\n     if (swaps[i - 1] == '0' && m > i) {\n       flag = 1;\n       break;\n     }\n   }\n   (flag) ? cout << 'NO\n' : cout << 'YES\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int n;\n   cin >> n;\n   char s;\n   int d = 1, j = 1;\n   for (int i = 1; i <= n; i++) {\n     cin >> s;\n     j -= 1;\n     if (j == 0) {\n       cout << s;\n       d += 1;\n       j = d;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mod = 1e9 + 7;\n const int N = 1e5 + 5;\n const double pi = acos(-1);\n long long n, m, ans;\n char arr[55][55];\n bool inrange(int i, int j) {\n   if (i < n && i >= 0 && j < m && j >= 0) return true;\n   return false;\n }\n void solve(int i, int j) {\n   int cntr1 = 0, cntr2 = 0, cntr3 = 0;\n   if (inrange(i + 1, j) && inrange(i + 1, j + 1) && inrange(i, j + 1)) {\n     if (arr[i + 1][j] == 'a' || arr[i + 1][j + 1] == 'a' ||\n         arr[i][j + 1] == 'a')\n       cntr1++;\n     if (arr[i + 1][j] == 'e' || arr[i + 1][j + 1] == 'e' ||\n         arr[i][j + 1] == 'e')\n       cntr2++;\n     if (arr[i + 1][j] == 'c' || arr[i + 1][j + 1] == 'c' ||\n         arr[i][j + 1] == 'c')\n       cntr3++;\n   }\n   if (cntr1 == 1 && cntr3 == 1 && cntr2 == 1) ans++;\n   cntr1 = 0, cntr2 = 0, cntr3 = 0;\n   if (inrange(i + 1, j) && inrange(i + 1, j - 1) && inrange(i, j - 1)) {\n     if (arr[i + 1][j] == 'a' || arr[i + 1][j - 1] == 'a' ||\n         arr[i][j - 1] == 'a')\n       cntr1++;\n     if (arr[i + 1][j] == 'e' || arr[i + 1][j - 1] == 'e' ||\n         arr[i][j - 1] == 'e')\n       cntr2++;\n     if (arr[i + 1][j] == 'c' || arr[i + 1][j - 1] == 'c' ||\n         arr[i][j - 1] == 'c')\n       cntr3++;\n   }\n   if (cntr1 == 1 && cntr3 == 1 && cntr2 == 1) ans++;\n   cntr1 = 0, cntr2 = 0, cntr3 = 0;\n   if (inrange(i - 1, j) && inrange(i - 1, j - 1) && inrange(i, j - 1)) {\n     if (arr[i - 1][j] == 'a' || arr[i - 1][j - 1] == 'a' ||\n         arr[i][j - 1] == 'a')\n       cntr1++;\n     if (arr[i - 1][j] == 'e' || arr[i - 1][j - 1] == 'e' ||\n         arr[i][j - 1] == 'e')\n       cntr2++;\n     if (arr[i - 1][j] == 'c' || arr[i - 1][j - 1] == 'c' ||\n         arr[i][j - 1] == 'c')\n       cntr3++;\n   }\n   if (cntr1 == 1 && cntr3 == 1 && cntr2 == 1) ans++;\n   cntr1 = 0, cntr2 = 0, cntr3 = 0;\n   if (inrange(i - 1, j) && inrange(i - 1, j + 1) && inrange(i, j + 1)) {\n     if (arr[i - 1][j] == 'a' || arr[i - 1][j + 1] == 'a' ||\n         arr[i][j + 1] == 'a')\n       cntr1++;\n     if (arr[i - 1][j] == 'e' || arr[i - 1][j + 1] == 'e' ||\n         arr[i][j + 1] == 'e')\n       cntr2++;\n     if (arr[i - 1][j] == 'c' || arr[i - 1][j + 1] == 'c' ||\n         arr[i][j + 1] == 'c')\n       cntr3++;\n   }\n   if (cntr1 == 1 && cntr3 == 1 && cntr2 == 1) ans++;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n >> m;\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++) cin >> arr[i][j];\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       if (arr[i][j] == 'f') solve(i, j);\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int main() {\n   cin >> n;\n   cout << n / 2 + n << endl;\n   if (n & 1) {\n     for (int i = 1; i <= n; i++) {\n       if (!(i & 1)) cout << i << ' ';\n     }\n     for (int i = 1; i <= n; i++) {\n       if (i & 1) cout << i << ' ';\n     }\n     for (int i = 1; i <= n; i++) {\n       if (!(i & 1)) cout << i << ' ';\n     }\n   } else {\n     for (int i = 1; i <= n; i++) {\n       if (i & 1) cout << i << ' ';\n     }\n     for (int i = 1; i <= n; i++) {\n       if (!(i & 1)) cout << i << ' ';\n     }\n     for (int i = 1; i <= n; i++) {\n       if (i & 1) cout << i << ' ';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 5, M = 20;\n int n, m;\n string s;\n int pos[(1 << M) - 1], a[M + 5][M + 5], f[(1 << M) + 5], g[(1 << M) + 5][M + 5];\n int main() {\n   memset(a, 0, sizeof(a));\n   memset(f, 0x3f, sizeof(f));\n   memset(g, 0, sizeof(g));\n   cin >> n >> m >> s;\n   for (int i = 0; i < n - 1; i++) {\n     a[s[i] - 'a'][s[i + 1] - 'a']++;\n     a[s[i + 1] - 'a'][s[i] - 'a']++;\n   }\n   for (int i = 0; i < m; i++) pos[1 << i] = i;\n   for (int i = 1; i < (1 << m); i++)\n     for (int j = 0; j < m; j++) {\n       int k = i & (-i);\n       g[i][j] = g[i ^ k][j] + a[j][pos[k]];\n     }\n   f[0] = 0;\n   for (int i = 0; i < (1 << m) - 1; i++) {\n     long long sum = 0;\n     for (int j = 0; j < m; j++)\n       if ((i & (1 << j)) == 0) sum += g[i][j];\n     for (int j = 0; j < m; j++)\n       if ((i & (1 << j)) == 0)\n         f[i | (1 << j)] = min(f[i] + sum, (long long)f[i | (1 << j)]);\n   }\n   cout << f[(1 << m) - 1];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long dp[31][31][51];\n void Cal() {\n   for (int i = 0; i <= 30; i++)\n     for (int j = 0; j <= 30; j++)\n       for (int k = 0; k <= 50; k++) {\n         dp[i][j][k] = (k == 0 || k == i * j) ? 0 : 10000000000000000;\n         for (int kk = 0; kk <= k; kk++) {\n           for (int ii = 1; ii < i; ii++)\n             dp[i][j][k] =\n                 min(dp[i][j][k], dp[ii][j][kk] + dp[i - ii][j][k - kk] + j * j);\n           for (int jj = 1; jj < j; jj++)\n             dp[i][j][k] =\n                 min(dp[i][j][k], dp[i][jj][kk] + dp[i][j - jj][k - kk] + i * i);\n         }\n       }\n }\n int main() {\n   int T;\n   scanf('%d', &T);\n   Cal();\n   while (T--) {\n     int n, m, k;\n     scanf('%d%d%d', &n, &m, &k);\n     cout << dp[n][m][k] << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int m, n;\n   cin >> m;\n   int a[m];\n   for (int i = 0; i < m; i++) {\n     a[i] = 0;\n   }\n   cin >> n;\n   int p = 0, q = 0, r = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> p;\n     cin >> q;\n     cin >> r;\n     a[p - 1] -= r;\n     a[q - 1] += r;\n   }\n   int res = 0;\n   for (int i = 0; i < m; i++) {\n     if (a[i] > 0) res += a[i];\n   }\n   cout << res;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 10;\n vector<pair<long long, long long> > v[3];\n vector<pair<long long, int> > segment[3];\n struct matrix {\n   int arr[3][3];\n   matrix(array<int, 3> a1, array<int, 3> a2) {\n     for (int i = 0; i <= 2; i++) {\n       for (int j = 0; j <= 2; j++) {\n         if (!a1[i] and !a2[j] and abs(i - j) < 2) {\n           arr[i][j] = 1;\n         } else\n           arr[i][j] = 0;\n       }\n     }\n   }\n   matrix() {\n     for (int i = 0; i <= 2; i++) {\n       for (int j = 0; j <= 2; j++) {\n         if (i == j)\n           arr[i][j] = 1;\n         else\n           arr[i][j] = 0;\n       }\n     }\n   }\n };\n matrix mul(matrix a, matrix b) {\n   matrix c;\n   for (int i = 0; i <= 2; i++) {\n     for (int j = 0; j <= 2; j++) {\n       c.arr[i][j] = 0;\n       for (int k = 0; k <= 2; k++) {\n         c.arr[i][j] = (0ll + c.arr[i][j] +\n                        (1ll * a.arr[i][k] * b.arr[k][j]) % 1000000007) %\n                       1000000007;\n       }\n     }\n   }\n   return c;\n }\n matrix matexpo(matrix a, long long int steps) {\n   if (!steps) {\n     return matrix();\n   }\n   matrix temp = matexpo(a, steps / 2);\n   temp = mul(temp, temp);\n   if (steps % 2) {\n     temp = mul(temp, a);\n   }\n   return temp;\n }\n vector<int> get(vector<int> old_ans, array<int, 3> oldcur, array<int, 3> newcur,\n                 long long int steps) {\n   matrix alpha(oldcur, newcur);\n   matrix temp = matexpo(alpha, steps);\n   vector<int> loop_ans(3);\n   for (int i = 0; i <= 2; i++) {\n     for (int j = 0; j <= 2; j++) {\n       loop_ans[j] = (0ll + loop_ans[j] +\n                      (1ll * temp.arr[i][j] * old_ans[i]) % 1000000007) %\n                     1000000007;\n     }\n   }\n   return loop_ans;\n }\n void solve() {\n   long long int n, m;\n   scanf('%lld', &n);\n   scanf('%lld', &m);\n   vector<int> ans = {0, 1, 0};\n   array<int, 3> cur = {0, 0, 0};\n   for (int i = 1; i <= n; i++) {\n     long long int a, l, r;\n     scanf('%lld', &a);\n     scanf('%lld', &l);\n     scanf('%lld', &r);\n     v[a - 1].push_back({l, r});\n   }\n   for (int i = 0; i <= 2; i++) {\n     sort((v[i]).begin(), (v[i]).end());\n     stack<pair<long long, long long> > s1;\n     for (int j = 0; j <= (int)v[i].size() - 1; j++) {\n       if (s1.empty() or s1.top().second < (v[i][j].first - 1)) {\n         s1.push(v[i][j]);\n       } else {\n         s1.top().second = max(v[i][j].second, s1.top().second);\n       }\n     }\n     v[i].clear();\n     v[i].reserve(s1.size());\n     while (!s1.empty()) {\n       v[i].push_back(s1.top());\n       s1.pop();\n     }\n     reverse((v[i]).begin(), (v[i]).end());\n   }\n   for (int i = 0; i <= 2; i++) {\n     for (int j = 0; j <= (int)v[i].size() - 1; j++) {\n       segment[i].push_back({v[i][j].first, 1});\n       segment[i].push_back({v[i][j].second + 1, 0});\n     }\n     segment[i].push_back({m + 1, 0});\n   }\n   int i = 0, j = 0, k = 0;\n   long long int pos = 1;\n   while (true) {\n     long long int next =\n         min({segment[0][i].first, segment[1][j].first, segment[2][k].first});\n     long long int steps = next - pos - 1;\n     ans = get(ans, cur, cur, steps);\n     if (next == (m + 1)) {\n       printf('%d\n', ans[1]);\n       return;\n     }\n     pos = next - 1;\n     array<int, 3> newcur = cur;\n     if (next == segment[0][i].first) {\n       newcur[0] = segment[0][i].second;\n       i++;\n     }\n     if (next == segment[1][j].first) {\n       newcur[1] = segment[1][j].second;\n       j++;\n     }\n     if (next == segment[2][k].first) {\n       newcur[2] = segment[2][k].second;\n       k++;\n     }\n     ans = get(ans, cur, newcur, 1);\n     cur = newcur;\n     pos++;\n   }\n }\n int main() {\n   int t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long co[100];\n int main() {\n   long long a, l = 0;\n   long long ans = 1;\n   cin >> a;\n   while (a > 1) {\n     long long c = 0;\n     for (int s = 2; s <= sqrt(a); s++) {\n       if (a % s == 0) {\n         a /= s, co[l] = s, l++, c = 1;\n         break;\n       }\n     }\n     if (c == 0) break;\n   }\n   if (l == 0)\n     cout << 1 << endl << 0;\n   else if (l == 1)\n     cout << 2;\n   else {\n     cout << 1 << endl;\n     for (int s = 0; s < 2; s++) ans *= co[s];\n     cout << ans;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, d, ans = 0;\n   scanf('%d%d', &n, &d);\n   int maxi, t, l;\n   scanf('%d', &maxi);\n   for (int i = 1; i < n; i++) {\n     scanf('%d', &t);\n     if (t > maxi) {\n       maxi = t;\n       continue;\n     } else {\n       l = (int)ceil((maxi + 1 - t) / (double)d);\n       ans += l;\n       maxi = t + d * l;\n     }\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5, M = 1e5;\n int dfn, cur[M + 1], in[N + 1], pre[N + 1], fin[N + 1], r[N + 1], sz[N + 1];\n vector<int> adj[N + 1];\n int dfs(int u, int a) {\n   sz[u] = 1;\n   r[u] = a;\n   pre[u] = ++dfn;\n   for (auto v : adj[u]) sz[u] += dfs(v, a);\n   fin[u] = ++dfn;\n   return sz[u];\n }\n int main() {\n   int n, m, k, q;\n   scanf('%d%d%d%d', &n, &m, &k, &q);\n   for (int i = (0), i_end = (k); i < i_end; ++i) {\n     int a, b;\n     scanf('%d%d', &a, &b);\n     if (cur[b]) {\n       ++in[a];\n       adj[cur[b]].push_back(a);\n     }\n     cur[b] = a;\n   }\n   for (int i = (1), i_end = (n + 1); i < i_end; ++i)\n     if (!in[i]) dfs(i, i);\n   for (int i = (0), i_end = (q); i < i_end; ++i) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     y = cur[y];\n     if (r[x] == r[y] && pre[y] > pre[x] && fin[y] < fin[x])\n       printf('%d\n', sz[x]);\n     else\n       puts('0');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double PI = acos(-1.0);\n const int INF = 1000 * 1000 * 1000 + 7;\n const long long LINF = INF * (long long)INF;\n const int MAX = 2 * 1000 * 100 + 47;\n struct Item {\n   int a, t, ind;\n   bool operator<(const Item& a) const { return t < a.t; }\n };\n Item A[MAX];\n int n, t;\n bool ok(int k) {\n   long long time = 0;\n   int cnt = 0;\n   for (int i = (0); i < (n); i++) {\n     int a = A[i].a;\n     int tt = A[i].t;\n     if (a >= k && time + tt <= t) {\n       cnt++;\n       time += tt;\n     }\n   }\n   return cnt >= k;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n >> t;\n   for (int i = (0); i < (n); i++) {\n     cin >> A[i].a >> A[i].t;\n     A[i].ind = i;\n   }\n   sort(A, A + n);\n   int l = 0, r = n + 1;\n   while (r - l > 1) {\n     int c = (r + l) / 2;\n     if (ok(c)) {\n       l = c;\n     } else {\n       r = c;\n     }\n   }\n   int cnt = l;\n   cout << cnt << '\n' << cnt << '\n';\n   for (int i = (0); i < (n); i++) {\n     if (cnt == 0) break;\n     if (A[i].a >= l) {\n       cnt--;\n       cout << A[i].ind + 1 << ' ';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n double a, b, c, d;\n int main() {\n   scanf('%d%d%d%d', &a, &b, &c, &d);\n   printf('%.12lf\n', a / b / (1 - (1 - a / b) * (1 - c / d)));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 7;\n int n, p[N];\n deque<pair<int, int> > deq;\n bool mrk[N];\n vector<int> dor[2];\n int dfs(int v, int d) {\n   mrk[v] = 1;\n   if (!mrk[p[v]]) return dfs(p[v], d + 1);\n   return d;\n }\n void add(int v, int l) {\n   dor[l].clear();\n   int pnt = v;\n   do {\n     dor[l].push_back(pnt);\n     pnt = p[pnt];\n   } while (pnt != v);\n }\n void remake(int l) {\n   int go = dor[l].size() / 2 + 1;\n   for (int i = 0; i < dor[l].size(); i++) {\n     p[dor[l][i]] = dor[l][(i + go) % dor[l].size()];\n   }\n }\n void merge() {\n   for (int i = 0; i < dor[0].size(); i++) {\n     p[dor[0][i]] = dor[1][i];\n     p[dor[1][i]] = dor[0][(1 + i) % dor[0].size()];\n   }\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> p[i];\n   for (int i = 1; i <= n; i++) {\n     if (!mrk[i]) {\n       deq.push_back({dfs(i, 1), i});\n     }\n   }\n   sort(deq.begin(), deq.end());\n   while (deq.size()) {\n     if (deq[0].first % 2) {\n       add(deq[0].second, 0);\n       remake(0);\n       deq.pop_front();\n       continue;\n     }\n     if (deq.size() == 1 || deq[1].first != deq[0].first) {\n       cout << -1;\n       return 0;\n     }\n     add(deq[0].second, 0);\n     add(deq[1].second, 1);\n     merge();\n     deq.pop_front();\n     deq.pop_front();\n   }\n   for (int i = 1; i <= n; i++) cout << p[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 200001;\n int MAX[N];\n vector<int> A[N];\n int main() {\n   ios::sync_with_stdio(false);\n   set<pair<int, int> > S;\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     int u, v;\n     cin >> u >> v;\n     MAX[u] = v;\n     A[u].push_back(v);\n   }\n   for (int i = 1; i <= n; i++) {\n     if (MAX[i] > 0) S.insert({MAX[i], i});\n   }\n   int q;\n   cin >> q;\n   for (int i = 0; i < q; i++) {\n     int c;\n     cin >> c;\n     vector<int> temp;\n     for (int j = 0; j < c; j++) {\n       int u;\n       cin >> u;\n       temp.push_back(u);\n       S.erase({MAX[u], u});\n     }\n     if (S.size() > 1) {\n       pair<int, int> p = *S.rbegin(), p2;\n       S.erase(p);\n       temp.push_back(p.second);\n       p2 = *S.rbegin();\n       int l_lim = 0, u_lim = A[p.second].size();\n       while (l_lim < u_lim - 1) {\n         int cur = (l_lim + u_lim) / 2;\n         if (A[p.second][cur] > p2.first) {\n           u_lim = cur;\n         } else {\n           l_lim = cur;\n         }\n       }\n       if (A[p.second][l_lim] > p2.first) {\n         cout << p.second << ' ' << A[p.second][l_lim] << '\n';\n       } else {\n         cout << p.second << ' ' << A[p.second][l_lim + 1] << '\n';\n       }\n     } else if (S.size() == 1) {\n       pair<int, int> p = *S.rbegin();\n       cout << p.second << ' ' << A[p.second][0] << '\n';\n     } else {\n       cout << '0 0\n';\n     }\n     while (!temp.empty()) {\n       if (MAX[temp.back()] > 0) S.insert({MAX[temp.back()], temp.back()});\n       temp.pop_back();\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using i64 = long long;\n using u64 = unsigned long long;\n using u32 = unsigned;\n int main() {\n   std::ios::sync_with_stdio(false);\n   std::cin.tie(nullptr);\n   int n;\n   std::cin >> n;\n   std::vector<int> c0(n, 0);\n   std::vector<int> c1(n, 0);\n   for (int i = 0; i < n; i++) {\n     std::cin >> c0[i] >> c1[i];\n   }\n   std::vector<int> tmp{0};\n   for (int i = 0; i < n; i++) {\n     tmp.emplace_back(c0[i]);\n     tmp.emplace_back(c1[i]);\n   }\n   std::sort(tmp.begin(), tmp.end());\n   tmp.resize(std::unique(tmp.begin(), tmp.end()) - tmp.begin());\n   for (int i = 0; i < n; i++) {\n     c0[i] = std::lower_bound(tmp.begin(), tmp.end(), c0[i]) - tmp.begin();\n     c1[i] = std::lower_bound(tmp.begin(), tmp.end(), c1[i]) - tmp.begin();\n   }\n   std::vector<int> p(tmp.size(), 0);\n   std::iota(p.begin(), p.end(), 0);\n   auto find = [&](int x) {\n     while (x != p[x]) {\n       x = p[x] = p[p[x]];\n     }\n     return x;\n   };\n   int ans = 0;\n   for (int i = 0; i < n; i++) {\n     int x = c0[i];\n     int y = c1[i];\n     x = find(x);\n     y = find(y);\n     if (!x && !y) {\n       std::cout << -1, exit(0);\n     } else {\n       if (x == y || !x || !y) {\n         ans = std::max({ans, x, y});\n         p[x] = p[y] = 0;\n       } else {\n         ans = std::max(ans, std::min(x, y));\n         p[std::min(x, y)] = std::max(x, y);\n       }\n     }\n   }\n   std::cout << tmp[ans] << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct compare {\n   bool operator()(const std::string& first, const std::string& second) {\n     return first.size() > second.size();\n   }\n };\n int main() {\n   ios_base::sync_with_stdio(false);\n   int n, k, i;\n   cin >> n >> k;\n   string arr[110];\n   for (i = 0; i < n; i++) {\n     cin >> arr[i];\n   }\n   string password;\n   cin >> password;\n   long long int tries = 0, equallen = 0;\n   int plen = password.length();\n   for (i = 0; i < n; i++) {\n     if (arr[i].length() < plen) {\n       tries++;\n     } else if (arr[i].length() == plen) {\n       equallen++;\n     }\n   }\n   long long int ans = 0;\n   ans = ((tries) / k) * 5 + tries + 1;\n   cout << ans << ' ';\n   ans = ((tries + equallen - 1) / k) * 5 + (tries + equallen);\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s[10] = {'O-|-OOOO', 'O-|O-OOO', 'O-|OO-OO', 'O-|OOO-O', 'O-|OOOO-',\n                   '-O|-OOOO', '-O|O-OOO', '-O|OO-OO', '-O|OOO-O', '-O|OOOO-'};\n   string num;\n   while (cin >> num) {\n     int i = num.size();\n     while (i--) cout << s[num[i] - '0'] << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, k;\n int main() {\n   cin >> n >> k;\n   cout << (n + k - n % k);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1e9 + 7;\n const int N = 2e5 + 10;\n int a[N];\n int main() {\n   string str;\n   string s;\n   while (cin >> s) str += s;\n   for (auto& c : str) {\n     if (c == '<') c = ' ';\n     if (c == '>') c = ' ';\n   }\n   vector<string> vs;\n   vector<int> ans;\n   stringstream sin(str);\n   while (sin >> str) {\n     if (str[0] == '/') {\n       if (str == '/table') {\n         ans.push_back(a[vs.size() - 1]);\n       } else {\n         a[vs.size() - 2] += a[vs.size() - 1];\n       }\n       vs.pop_back();\n       a[vs.size()] = 0;\n     } else {\n       if (str == 'td')\n         a[vs.size()] = 1;\n       else\n         a[vs.size()] = 0;\n       vs.push_back(str);\n     }\n   }\n   sort(ans.begin(), ans.end());\n   for (auto& x : ans) printf('%d ', x);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int N;\n char field[110][110];\n bool check_solution(bool do_print, bool swapped) {\n   for (int r = 0; r < N; ++r) {\n     int c;\n     for (c = 0; c < N; ++c) {\n       if (field[r][c] == '.') break;\n     }\n     if (c == N) return false;\n     if (do_print) {\n       if (swapped)\n         printf('%d %d\n', c + 1, r + 1);\n       else\n         printf('%d %d\n', r + 1, c + 1);\n     }\n   }\n   return true;\n }\n int main(void) {\n   scanf('%d', &N);\n   for (int r = 0; r < N; ++r) scanf('%s', field[r]);\n   if (check_solution(false, false)) {\n     check_solution(true, false);\n   } else {\n     for (int r = 0; r < N; ++r) {\n       for (int c = r + 1; c < N; ++c) {\n         swap(field[r][c], field[c][r]);\n       }\n     }\n     if (check_solution(false, true))\n       check_solution(true, true);\n     else\n       puts('-1');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct nade {\n   int pos, tag, sum, l, r;\n } tree[600005 * 2];\n int n;\n void puup(int x) {\n   if (tree[x * 2].sum > tree[x * 2 + 1].sum) {\n     tree[x].pos = tree[x * 2].pos;\n     tree[x].sum = tree[x * 2].sum;\n   } else {\n     tree[x].pos = tree[x * 2 + 1].pos;\n     tree[x].sum = tree[x * 2 + 1].sum;\n   }\n }\n void pudo(int x) {\n   tree[x * 2].tag += tree[x].tag;\n   tree[x * 2].sum += tree[x].tag;\n   tree[x * 2 + 1].tag += tree[x].tag;\n   tree[x * 2 + 1].sum += tree[x].tag;\n   tree[x].tag = 0;\n }\n void build(int x, int l, int r) {\n   tree[x].l = l;\n   tree[x].r = r;\n   if (l == r) {\n     tree[x].pos = l;\n     return;\n   }\n   int mid = (l + r) / 2;\n   build(x * 2, l, mid);\n   build(x * 2 + 1, mid + 1, r);\n   tree[x].pos = tree[x * 2].pos;\n }\n void add(int l, int r, int val, int x) {\n   if (tree[x].l >= l && tree[x].r <= r) {\n     tree[x].sum += val;\n     tree[x].tag += val;\n     return;\n   }\n   pudo(x);\n   if (tree[x * 2].r >= l) add(l, r, val, x * 2);\n   if (tree[x * 2 + 1].l <= r) add(l, r, val, x * 2 + 1);\n   puup(x);\n }\n int l[200005], r[200005], v[200005];\n struct node {\n   int x, u, d;\n   bool b;\n } s[200005];\n bool cmp(node a, node b) {\n   if (a.x != b.x) return a.x < b.x;\n   return a.b < b.b;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     scanf('%d%d%d', &l[i], &v[i], &r[i]);\n     s[i * 2].x = l[i];\n     s[i * 2].u = r[i];\n     s[i * 2].d = v[i];\n     s[i * 2].b = 0;\n     s[i * 2 + 1].x = v[i];\n     s[i * 2 + 1].u = r[i];\n     s[i * 2 + 1].d = v[i];\n     s[i * 2 + 1].b = 1;\n   }\n   build(1, 1, 3e5 + 1);\n   sort(s, s + 2 * n, cmp);\n   int ans = 0, ansp = 0, ansx = 0;\n   for (int i = 0; i < n * 2; i++) {\n     add(s[i].d, s[i].u, s[i].b ? -1 : 1, 1);\n     if (tree[1].sum > ans) {\n       ans = tree[1].sum;\n       ansp = tree[1].pos;\n       ansx = s[i].x;\n     }\n   }\n   printf('%d\n', ans);\n   for (int i = 0; i < n; i++)\n     if (l[i] <= ansx && ansx <= v[i] && v[i] <= ansp && ansp <= r[i])\n       printf('%d ', i + 1);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using lld = long long int;\n int n, m;\n int a[200009];\n int b[200009];\n int c[420009];\n int main() {\n   int t = 1, tv = 0;\n   int i, j, k;\n   scanf('%d', &t);\n   while (t--) {\n     scanf('%d %d', &n, &m);\n     b[0] = 0;\n     bool nom = true;\n     for (i = 0; i < n; i++) {\n       scanf('%d', &a[i]);\n       if (a[i] >= m) {\n         b[i + 1] = b[i] + 1;\n       } else {\n         b[i + 1] = b[i] - 1;\n       }\n       if (a[i] == m) {\n         nom = false;\n       }\n     }\n     bool valid = false;\n     if (n == 1 && a[0] == m) {\n       valid = true;\n       goto HELL;\n     }\n     if (!nom && !valid) {\n       for (i = 200009 - n - 9; i <= 200009 + n + 9; i++) {\n         c[i] = 0;\n       }\n       for (i = 0; i < n; i++) {\n         if (a[i] >= m) {\n           if (c[b[i] + 200009] == 1 || c[b[i] + 200009 - 1] == 1) {\n             valid = true;\n             goto HELL;\n           }\n         }\n         c[b[i] + 200009] = 1;\n       }\n       for (i = 200009 - n - 9; i <= 200009 + n + 9; i++) {\n         c[i] = 0;\n       }\n       for (i = n - 1; i >= 0; i--) {\n         if (a[i] >= m) {\n           if (c[b[i + 1] + 200009] == 1 || c[b[i + 1] + 200009 + 1] == 1) {\n             valid = true;\n             goto HELL;\n           }\n         }\n         c[b[i + 1] + 200009] = 1;\n       }\n     }\n   HELL:\n     printf('%s\n', valid ? 'yes' : 'no');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 100500;\n const int infi = (1 << 30);\n const long long infl = (1LL << 62);\n const double eps = 1e-9;\n const long long mod = 1000000007LL;\n const double pi = acos(-1.0);\n int n, k;\n int a[maxn], c[maxn];\n int main() {\n   cin >> n >> k;\n   for (int i = 1; i < n; i++) a[i] = 1;\n   a[0] = 0;\n   for (int i = 0; i < k; i++) {\n     for (int j = 0; j < n; j++) {\n       int second = int(upper_bound(a, a + n, j - a[j] - 1) - a);\n       if (second == n) second = n - 1;\n       c[j] = second;\n     }\n     for (int j = 0; j < n; j++) {\n       a[j] += a[c[j]];\n     }\n     for (int j = n - 1; j >= 0; --j) cout << n - c[j] << ' ';\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> divs[1000009];\n bool p[1000009];\n vector<int> primes;\n void pre() {\n   for (int i = 2; i <= (1000000); ++i) {\n     if (!p[i]) {\n       primes.push_back(i);\n       for (int j = i; j <= 1000000; j += i) divs[j].push_back(i), p[j] = true;\n     }\n   }\n }\n int L(int x, int p) {\n   int s = (int)(divs[p]).size();\n   int tot = (1 << s) - 1;\n   long long ans = 0;\n   for (int i = 1; i <= (tot); ++i) {\n     int cnt = 0;\n     int var = 1;\n     for (int j = 0; j < (s); ++j)\n       if (i & (1 << j)) cnt++, var *= divs[p][j];\n     if (cnt % 2)\n       ans += x / var;\n     else\n       ans -= x / var;\n   }\n   return x - ans;\n }\n int main() {\n   cin.sync_with_stdio(0);\n   cin.tie(0);\n   cin.exceptions(cin.failbit);\n   pre();\n   int q;\n   cin >> q;\n   for (int aa = 0; aa < (q); ++aa) {\n     int x, p, k;\n     cin >> x >> p >> k;\n     if (p == 1)\n       cout << k + x << '\n';\n     else {\n       k += L(x, p);\n       int l = 1, r = 1e8;\n       while (l < r) {\n         int m = (l + r) >> 1;\n         if (L(m, p) >= k)\n           r = m;\n         else\n           l = m + 1;\n       }\n       cout << l << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n class Solution {\n  public:\n   long long count(long long _m, long long _x) {\n     if (_m < 3) {\n       return max(0LL, _m);\n     }\n     m = _m;\n     x = _x;\n     vector<pair<long long, int>> cnts = factorize(m);\n     long long res = 0;\n     search(0, 1, cnts, res);\n     return res;\n   }\n \n  private:\n   map<long long, vector<pair<long long, int>>> fs;\n   long long m, x;\n   long long gcd(long long x, long long y) {\n     while (x != 0) {\n       y %= x;\n       swap(x, y);\n     }\n     return y;\n   }\n   vector<pair<long long, int>>& factorize(long long n) {\n     if (fs.count(n) > 0) {\n       return fs[n];\n     }\n     vector<pair<long long, int>>& res = fs[n];\n     for (long long i = 2; i * i <= n; ++i) {\n       int cnt = 0;\n       while (n % i == 0) {\n         ++cnt;\n         n /= i;\n       }\n       if (cnt > 0) {\n         res.emplace_back(i, cnt);\n       }\n     }\n     if (n > 1) {\n       res.emplace_back(n, 1);\n     }\n     return res;\n   }\n   void search(int i, long long dv, vector<pair<long long, int>>& cnts,\n               long long& ans) {\n     if (i >= cnts.size()) {\n       vector<pair<long long, int>> dvcnts;\n       dvcnts.reserve(cnts.size());\n       for (auto& pc : cnts) {\n         if (pc.second <= 1) {\n           continue;\n         }\n         dvcnts.emplace_back(pc.first, pc.second - 1);\n       }\n       long long phi = dv;\n       for (auto& pc : cnts) {\n         long long p = pc.first;\n         int c = pc.second;\n         if (c == 0) {\n           continue;\n         }\n         dvcnts = merge(dvcnts, factorize(p - 1));\n         phi = phi - phi / p;\n       }\n       ans += phi / calcPeriod(x % dv, dv, dvcnts);\n       return;\n     }\n     long long p = fs[m][i].first;\n     long long n = fs[m][i].second;\n     for (int j = 0; j <= n; ++j) {\n       cnts[i].second = j;\n       search(i + 1, dv, cnts, ans);\n       dv *= p;\n     }\n   }\n   vector<pair<long long, int>> merge(vector<pair<long long, int>>& list1,\n                                      vector<pair<long long, int>>& list2) {\n     vector<pair<long long, int>> res;\n     res.reserve(list1.size() + list2.size());\n     int n = list1.size(), m = list2.size();\n     int i = 0, j = 0;\n     while (i < n && j < m) {\n       if (list1[i].first < list2[j].first) {\n         res.emplace_back(list1[i].first, list1[i].second);\n         ++i;\n       } else if (list1[i].first > list2[j].first) {\n         res.emplace_back(list2[j].first, list2[j].second);\n         ++j;\n       } else {\n         res.emplace_back(list1[i].first, list1[i].second + list2[j].second);\n         ++i;\n         ++j;\n       }\n     }\n     while (i < n) {\n       res.emplace_back(list1[i].first, list1[i].second);\n       ++i;\n     }\n     while (j < m) {\n       res.emplace_back(list2[j].first, list2[j].second);\n       ++j;\n     }\n     return res;\n   }\n   long long calcPeriod(long long x, long long mod,\n                        vector<pair<long long, int>>& factors) {\n     long long phi = 1;\n     for (auto& pc : factors) {\n       long long p = pc.first;\n       int c = pc.second;\n       for (int i = 0; i < c; ++i) {\n         phi *= p;\n       }\n     }\n     long long res = 1;\n     for (auto& pc : factors) {\n       long long p = pc.first;\n       int c = pc.second;\n       long long base = phi;\n       for (int i = 0; i < c; ++i) {\n         base /= p;\n       }\n       long long val = powM(x, base, mod);\n       int j = c;\n       for (int i = 1; i <= c; ++i) {\n         if (val == 1) {\n           j = i - 1;\n           break;\n         }\n         val = powM(val, p, mod);\n       }\n       res *= powI(p, j);\n     }\n     return res;\n   }\n   long long mulM(long long a, long long b, long long m) {\n     long long res = 0;\n     while (b > 0) {\n       if (b & 0x1) {\n         res = (res + a) % m;\n       }\n       a = (a + a) % m;\n       b >>= 1;\n     }\n     return res;\n   }\n   long long powM(long long x, long long e, long long m) {\n     long long res = 1;\n     while (e > 0) {\n       if (e & 0x1) {\n         res = mulM(res, x, m);\n       }\n       x = mulM(x, x, m);\n       e >>= 1;\n     }\n     return res;\n   }\n   long long powI(long long x, long long e) {\n     long long res = 1;\n     for (int i = 0; i < e; ++i) {\n       res *= x;\n     }\n     return res;\n   }\n };\n int main(int argc, char** argv) {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   long long m, x;\n   cin >> m >> x;\n   Solution sol;\n   cout << sol.count(m, x) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n ll dx[] = {0, 0, 1, -1};\n ll dy[] = {1, -1, 0, 0};\n void solve() {\n   ll n;\n   cin >> n;\n   vector<ll> v(n);\n   for (ll i = 0; i < (n); ++i) cin >> v[i];\n   vector<pair<ll, ll>> aux(n);\n   ll i = n - 1;\n   stack<ll> s;\n   while (i >= 0) {\n     while (!s.empty() && s.top() < v[i]) s.pop();\n     if (s.empty())\n       aux[i].first = -1;\n     else\n       aux[i].first = s.top();\n     s.push(v[i]);\n     i--;\n   }\n   i = 0;\n   while (!s.empty()) s.pop();\n   while (i < n) {\n     while (!s.empty() && s.top() < v[i]) s.pop();\n     if (s.empty())\n       aux[i].second = -1;\n     else\n       aux[i].second = s.top();\n     s.push(v[i]), i++;\n   }\n   ll res = 0;\n   for (ll i = 0; i < (n); ++i) {\n     if (aux[i].first != -1) res = max(res, aux[i].first ^ v[i]);\n     if (aux[i].second != -1) res = max(res, aux[i].second ^ v[i]);\n   }\n   cout << res << '\n';\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   ll t = 1;\n   while (t--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, i;\n double p[2], poly[100005][2], minD = 1e18, maxD = 0, d, answer, lo, hi,\n                               EPS = 1e-12, mid1, mid2, x, y, d1, d2;\n int main() {\n   scanf('%d %lf %lf', &n, &p[0], &p[1]);\n   for (i = 0; i < n; i++) {\n     scanf('%lf %lf', &poly[i][0], &poly[i][1]);\n     d = (poly[i][0] - p[0]) * (poly[i][0] - p[0]) +\n         (poly[i][1] - p[1]) * (poly[i][1] - p[1]);\n     maxD = max(maxD, d);\n   }\n   for (i = 0; i < n; i++) {\n     lo = 0;\n     hi = 1;\n     while (hi - lo > EPS) {\n       mid1 = lo + (hi - lo) / 3;\n       mid2 = mid1 + (hi - lo) / 3;\n       x = poly[i][0] + (poly[(i + 1) % n][0] - poly[i][0]) * mid1;\n       y = poly[i][1] + (poly[(i + 1) % n][1] - poly[i][1]) * mid1;\n       d1 = (x - p[0]) * (x - p[0]) + (y - p[1]) * (y - p[1]);\n       x = poly[i][0] + (poly[(i + 1) % n][0] - poly[i][0]) * mid2;\n       y = poly[i][1] + (poly[(i + 1) % n][1] - poly[i][1]) * mid2;\n       d2 = (x - p[0]) * (x - p[0]) + (y - p[1]) * (y - p[1]);\n       if (d1 < d2)\n         hi = mid2;\n       else\n         lo = mid1;\n     }\n     d = d1;\n     minD = min(minD, d);\n   }\n   answer = acos(-1.0) * (maxD - minD);\n   printf('%.18lf\n', answer);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1010;\n void solve() {\n   int n, m;\n   cin >> n >> m;\n   vector<vector<long long>> a =\n       vector<vector<long long>>(n, vector<long long>(m, 0));\n   for (int i = 0; i < n; ++i)\n     for (int j = 0; j < m; ++j) cin >> a[i][j];\n   vector<long long> col(m, 0), row(n, 0);\n   for (int i = 0; i < m; ++i)\n     for (int j = 0; j < n; ++j) col[i] += a[j][i];\n   for (int i = 0; i < n; ++i)\n     for (int j = 0; j < m; ++j) row[i] += a[i][j];\n   vector<long long> x(m + 1), y(n + 1);\n   long long mn = LLONG_MAX;\n   long long ans = 0;\n   int ansx = 0;\n   for (int i = 0; i <= m; ++i) {\n     long long curx = i * 4;\n     for (int j = 0; j < m; ++j) {\n       long long curpos = j * 4 + 2;\n       long long dx = curx - curpos;\n       x[i] += dx * dx * col[j];\n     }\n     if (x[i] < mn) {\n       mn = x[i];\n       ansx = i;\n     }\n   }\n   ans += mn;\n   mn = LLONG_MAX;\n   int ansy = 0;\n   for (int i = 0; i <= n; ++i) {\n     int cury = i * 4;\n     for (int j = 0; j < n; ++j) {\n       long long curpos = j * 4 + 2;\n       long long dy = cury - curpos;\n       y[i] += dy * dy * row[j];\n     }\n     if (y[i] < mn) {\n       mn = y[i];\n       ansy = i;\n     }\n   }\n   ans += mn;\n   cout << ans << '\n';\n   cout << ansy << ' ' << ansx << '\n';\n }\n int main(void) {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int tc = 1;\n   while (tc--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long inf = 1LL << 60;\n const long long md = 1e9 + 7;\n const long double eps = 1e-14;\n const int mx = 3010;\n int t[mx];\n void upd(int p) {\n   for (++p; p < mx; p += p & -p) ++t[p];\n }\n int que(int p) {\n   int res = 0;\n   for (; p > 0; p -= p & -p) res += t[p];\n   return res;\n }\n char zey[mx][mx];\n int le[mx][mx], ri[mx][mx];\n int solve(vector<int> &a, vector<int> &b) {\n   int sz = a.size();\n   if (sz == 0) return 0;\n   int res = 0;\n   fill(t, t + sz + 5, 0);\n   vector<pair<int, int> > bb(sz);\n   for (int i = (0); i < int(sz); ++i) bb[i] = pair<int, int>(i - b[i] + 1, i);\n   sort(bb.begin(), bb.end());\n   int ix = 0;\n   for (int i = (0); i < int(sz); ++i) {\n     while (ix < sz && bb[ix].first <= i) upd(bb[ix++].second);\n     res += que(min(sz, i + a[i])) - i;\n   }\n   return res;\n }\n int main() {\n   memset(t, 0, sizeof(t));\n   int n, m;\n   cin >> n >> m;\n   for (int i = (0); i < int(n); ++i) scanf(' %s ', zey[i]);\n   for (int i = (0); i < int(n); ++i) {\n     le[i][0] = zey[i][0] == 'z';\n     ri[i][m - 1] = zey[i][m - 1] == 'z';\n   }\n   for (int i = (0); i < int(n); ++i)\n     for (int j = (1); j < int(m); ++j)\n       le[i][j] = zey[i][j] == 'z' ? 1 + le[i][j - 1] : 0;\n   for (int i = (0); i < int(n); ++i)\n     for (int j = (m - 1); j-- > int(0);)\n       ri[i][j] = zey[i][j] == 'z' ? 1 + ri[i][j + 1] : 0;\n   long long ans = 0;\n   for (int s = (0); s < int(m + n - 1); ++s) {\n     vector<int> a, b;\n     for (int d = (max(0, s - m + 1)); d < int(min(n, s + 1)); ++d) {\n       if (zey[d][s - d] == 'z') {\n         a.push_back(le[d][s - d]);\n         b.push_back(ri[d][s - d]);\n       } else {\n         ans += solve(a, b);\n         a.clear();\n         b.clear();\n       }\n     }\n     ans += solve(a, b);\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n unsigned long long val(int i) { return i + 1; }\n unsigned long long pot1[100001], pot2[100001], prec1[10][100001],\n     prec2[10][100001];\n int v[100000];\n struct Node {\n   unsigned long long h1, h2;\n   int flag;\n   bool valid;\n   int sz;\n   Node() {\n     sz = h1 = h2 = 0;\n     flag = -1;\n     valid = true;\n   }\n   Node(unsigned long long a, unsigned long long b, int c) {\n     h1 = a;\n     h2 = b;\n     sz = c;\n     flag = -1;\n     valid = true;\n   }\n   Node(unsigned long long a, unsigned long long b, int c, bool d) {\n     h1 = a;\n     h2 = b;\n     sz = c;\n     valid = d;\n     flag = -1;\n   }\n   void set(int c) { flag = c; }\n   void reset() { flag = -1; }\n   void update(int c) {\n     if (c == -1) return;\n     h1 = prec1[c][sz];\n     h2 = prec2[c][sz];\n   }\n   bool operator!=(const Node& n) { return h1 != n.h1 || h2 != n.h2; }\n };\n Node st[400000];\n inline int left(int i) { return 2 * i + 1; }\n inline int right(int i) { return 2 * i + 2; }\n void initialize(int r, int beg, int end) {\n   if (beg == end) {\n     st[r] = Node(val(v[beg]), val(v[beg]), 1);\n   } else {\n     int h = (beg + end) / 2;\n     initialize(left(r), beg, h);\n     initialize(right(r), h + 1, end);\n     st[r] = Node(\n         (st[left(r)].h1 * pot1[st[right(r)].sz] + st[right(r)].h1) % 1000000009,\n         (st[left(r)].h2 * pot2[st[right(r)].sz] + st[right(r)].h2) % 1000000007,\n         st[left(r)].sz + st[right(r)].sz);\n   }\n }\n void update(int r, int beg, int end, int qbeg, int qend, char c) {\n   if (end < qbeg || beg > qend) {\n     if (st[r].flag != -1) {\n       st[r].update(st[r].flag);\n       if (beg != end) {\n         st[2 * r + 1].set(st[r].flag);\n         st[2 * r + 2].set(st[r].flag);\n       }\n       st[r].reset();\n     }\n     return;\n   }\n   if (beg >= qbeg && end <= qend) {\n     st[r].update(c);\n     if (beg != end) {\n       st[left(r)].set(c);\n       st[right(r)].set(c);\n     }\n     st[r].reset();\n   } else {\n     int h = (beg + end) / 2;\n     if (st[r].flag != -1) {\n       st[r].update(st[r].flag);\n       st[2 * r + 1].set(st[r].flag);\n       st[2 * r + 2].set(st[r].flag);\n       st[r].reset();\n     }\n     update(left(r), beg, h, qbeg, qend, c);\n     update(right(r), h + 1, end, qbeg, qend, c);\n     st[r] = Node(\n         (st[left(r)].h1 * pot1[st[right(r)].sz] + st[right(r)].h1) % 1000000009,\n         (st[left(r)].h2 * pot2[st[right(r)].sz] + st[right(r)].h2) % 1000000007,\n         st[right(r)].sz + st[left(r)].sz);\n   }\n }\n Node query(int r, int beg, int end, int qbeg, int qend) {\n   if (end < qbeg || beg > qend) return Node(0, 0, false);\n   if (beg >= qbeg && end <= qend) {\n     if (st[r].flag != -1) {\n       st[r].update(st[r].flag);\n       if (beg != end) {\n         st[left(r)].set(st[r].flag);\n         st[right(r)].set(st[r].flag);\n       }\n       st[r].reset();\n     }\n     return st[r];\n   } else {\n     if (st[r].flag != -1) {\n       st[r].update(st[r].flag);\n       st[left(r)].set(st[r].flag);\n       st[right(r)].set(st[r].flag);\n       st[r].reset();\n     }\n     Node le = query(left(r), beg, (beg + end) / 2, qbeg, qend);\n     Node ri = query(right(r), (beg + end) / 2 + 1, end, qbeg, qend);\n     if (le.valid && ri.valid)\n       return Node((le.h1 * pot1[ri.sz] + ri.h1) % 1000000009,\n                   (le.h2 * pot2[ri.sz] + ri.h2) % 1000000007, le.sz + ri.sz);\n     else if (le.valid)\n       return le;\n     else\n       return ri;\n   }\n }\n bool qquery(int r, int beg, int end, int qbeg, int qend, int d) {\n   int sz = qend - qbeg + 1;\n   if (sz <= d) return true;\n   if (qbeg > qend) return 0;\n   int sobra = sz % d;\n   if (sobra) {\n     if (query(r, beg, end, qbeg, qbeg + sobra - 1) !=\n         query(r, beg, end, qend - sobra + 1, qend))\n       return false;\n   }\n   qend -= sobra;\n   sz = qend - qbeg + 1;\n   int n = sz / d;\n   if (sz == d) return true;\n   if (n & 1) {\n     int b0 = qbeg, b1 = qbeg + n / 2 * d, b2 = qbeg + (n / 2 + 1) * d;\n     int e0 = b1 - 1, e1 = b2 - 1, e2 = qend;\n     if (query(r, beg, end, b0, e0) != query(r, beg, end, b2, e2) ||\n         query(r, beg, end, b0, b0 + d - 1) != query(r, beg, end, b1, e1))\n       return false;\n     return qquery(r, beg, end, b0, e0, d);\n   } else {\n     int b0 = qbeg, b1 = qbeg + (n + 1) / 2 * d;\n     int e0 = b1 - 1, e1 = qend;\n     if (query(r, beg, end, b0, e0) != query(r, beg, end, b1, e1)) return false;\n     return qquery(r, beg, end, b0, e0, d);\n   }\n }\n void precalc() {\n   pot1[0] = 1;\n   pot2[0] = 1;\n   for (int i = 1; i <= 100000; i++) {\n     pot1[i] = (pot1[i - 1] * 33) % 1000000009;\n     pot2[i] = (pot2[i - 1] * 33) % 1000000007;\n   }\n   for (int i = 0; i < 10; i++) {\n     prec1[i][0] = 0;\n     prec2[i][0] = 0;\n     for (int j = 1; j <= 100000; j++) {\n       prec1[i][j] = (prec1[i][j - 1] * 33 + val(i)) % 1000000009;\n       prec2[i][j] = (prec2[i][j - 1] * 33 + val(i)) % 1000000007;\n     }\n   }\n }\n int main(void) {\n   int n, m, k;\n   char s[100001];\n   precalc();\n   scanf('%d%d%d', &n, &m, &k);\n   scanf('%s', s);\n   for (int i = 0; i < n; i++) {\n     v[i] = s[i] - '0';\n   }\n   initialize(0, 0, n - 1);\n   for (int i = 0; i < m + k; i++) {\n     int cmd;\n     int l, r, x;\n     scanf('%d%d%d%d', &cmd, &l, &r, &x);\n     if (cmd == 1) {\n       l--;\n       r--;\n       update(0, 0, n - 1, l, r, x);\n     } else {\n       l--;\n       r--;\n       printf('%s\n', qquery(0, 0, n - 1, l, r, x) ? 'YES' : 'NO');\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100005, M = 500005;\n vector<int> gr[N], path, odd;\n pair<int, int> ed[M];\n bool us[M];\n void GetEulerCircuit(int u) {\n   while (true) {\n     while (!gr[u].empty() && us[gr[u].back()]) {\n       gr[u].pop_back();\n     }\n     if (gr[u].empty()) {\n       break;\n     }\n     us[gr[u].back()] = true;\n     int v = u ^ ed[gr[u].back()].first ^ ed[gr[u].back()].second;\n     gr[u].pop_back();\n     GetEulerCircuit(v);\n   }\n   path.push_back(u);\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cout.tie(0);\n   int n, m;\n   scanf('%d %d ', &n, &m);\n   for (int i = 0; i < m; i++) {\n     int u, v;\n     scanf('%d %d ', &u, &v);\n     ed[i] = make_pair(u, v);\n     gr[u].push_back(i);\n     gr[v].push_back(i);\n   }\n   for (int u = 1; u <= n; u++) {\n     if (gr[u].size() % 2) {\n       odd.push_back(u);\n     }\n   }\n   for (int i = 0; i < odd.size(); i += 2) {\n     int u = odd[i], v = odd[i + 1];\n     ed[m] = make_pair(u, v);\n     gr[u].push_back(m);\n     gr[v].push_back(m);\n     m++;\n   }\n   if (m % 2) {\n     ed[m] = make_pair(1, 1);\n     gr[1].push_back(m);\n     gr[1].push_back(m);\n     m++;\n   }\n   GetEulerCircuit(1);\n   for (int i = 0; i < m; i++) {\n     int u = path[i], v = path[i + 1];\n     if (i % 2) {\n       swap(u, v);\n     }\n     ed[i] = make_pair(u, v);\n   }\n   printf('%d\n', m);\n   for (int i = 0; i < m; i++) {\n     int u = ed[i].first, v = ed[i].second;\n     printf('%d %d\n', u, v);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n inline void read(T &x) {\n   x = 0;\n   T f = 1;\n   char c = getchar();\n   for (; !isdigit(c); c = getchar())\n     if (c == '-') f = -1;\n   for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48);\n   x *= f;\n }\n int main() {\n   int n;\n   read(n);\n   for (int i = 1; i <= n; i++) {\n     int x;\n     read(x);\n     cout << x / 6 + (x % 6 == 0 ? 0 : 1) << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e6;\n int q[maxn], fin, razbeg, jump, n;\n pair<int, int> ans[maxn];\n int sz = 0;\n int main() {\n   cin >> n >> fin >> razbeg >> jump;\n   for (int i = 0; i < n; i++) cin >> q[i];\n   q[n] = 0;\n   q[n + 1] = fin;\n   n += 2;\n   sort(q, q + n);\n   int i = 0, now = 0;\n   while (i < n - 1)\n     if (i == n - 2) {\n       if (fin - now > 0) ans[sz] = make_pair(0, fin - now), sz++;\n       break;\n     } else if (q[i + 1] - 1 - now < razbeg) {\n       cout << 'IMPOSSIBLE';\n       return 0;\n     } else {\n       if (q[i + 1] - 1 - now > 0)\n         ans[sz] = make_pair(0, q[i + 1] - 1 - now), sz++;\n       now = q[i + 1] - 1;\n       while (1) {\n         i++;\n         if (q[i] + 1 - now > jump) {\n           cout << 'IMPOSSIBLE';\n           return 0;\n         }\n         if (i == n - 2) {\n           ans[sz] = make_pair(1, q[i] + 1 - now), sz++, now = q[i] + 1;\n           break;\n         } else if (q[i + 1] - 1 - q[i] - 1 >= razbeg) {\n           ans[sz] = make_pair(1, q[i] + 1 - now), sz++, now = q[i] + 1;\n           break;\n         }\n       }\n     }\n   for (int i = 0; i < sz; i++)\n     if (ans[i].first == 0)\n       cout << 'RUN ' << ans[i].second << '\n';\n     else\n       cout << 'JUMP ' << ans[i].second << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, q, c[100005], v[100005], f[100005];\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n >> q;\n   for (int i = 1; i <= n; i++) cin >> v[i];\n   for (int i = 1; i <= n; i++) cin >> c[i];\n   while (q--) {\n     long long a, b, ans = 0, mx = 0, smx = 0;\n     memset(f, -6, sizeof(f));\n     cin >> a >> b;\n     for (int i = 1; i <= n; i++) {\n       long long cur = max(v[i] * b, f[c[i]] + v[i] * a);\n       if (c[i] != mx)\n         cur = max(cur, f[mx] + v[i] * b);\n       else\n         cur = max(cur, f[smx] + v[i] * b);\n       if (cur > f[mx]) {\n         if (mx != c[i]) smx = mx;\n         mx = c[i];\n       } else if (cur > f[smx] && c[i] != mx)\n         smx = c[i];\n       f[c[i]] = max(f[c[i]], cur);\n       ans = max(ans, cur);\n     }\n     cout << ans << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[4010][4010];\n int n, m;\n int u[4010], v[4010], sz[4010];\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= m; i++) {\n     scanf('%d%d', &u[i], &v[i]);\n     a[u[i]][v[i]] = a[v[i]][u[i]] = 1;\n     sz[u[i]]++;\n     sz[v[i]]++;\n   }\n   int ans = 1e9;\n   for (int i = 1; i <= m; i++) {\n     int x = u[i], y = v[i];\n     for (int j = i + 1; j <= m; j++) {\n       int c = u[j], d = v[j];\n       if (x == c && a[y][d] == 1) {\n         ans = min(ans, sz[x] + sz[y] + sz[d] - 6);\n       } else if (x == d && a[y][c] == 1) {\n         ans = min(ans, sz[x] + sz[c] + sz[y] - 6);\n       } else if (y == c && a[x][d] == 1) {\n         ans = min(ans, sz[y] + sz[x] + sz[d] - 6);\n       } else if (y == d && a[x][c] == 1) {\n         ans = min(ans, sz[y] + sz[x] + sz[c] - 6);\n       }\n     }\n   }\n   if (ans == 1e9)\n     cout << -1 << endl;\n   else\n     cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long> v(n);\n   for (int i = 0; i < n; i++) cin >> v[i];\n   long long total = 0;\n   vector<long long> 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 <bits/stdc++.h>\n using namespace std;\n using namespace std;\n int main() {\n   int n, k, q;\n   cin >> n >> k >> q;\n   vector<long long> vec(n + 1);\n   vector<long long> pq;\n   map<long long, long long> 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 <bits/stdc++.h>\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<int, int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   map<char, int> 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 <bits/stdc++.h>\n using namespace std;\n const int MAXN = 20;\n long long int dp[MAXN][MAXN];\n long long int tav[MAXN];\n long long int n;\n string s;\n long long int dtoc(char x) { return x - '0'; }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   tav[0] = 1;\n   for (int i = 1; i < MAXN; i++) {\n     tav[i] = 10 * tav[i - 1];\n   }\n   cin >> n;\n   cin >> s;\n   for (int i = 0; i <= n; i++) {\n     for (int j = 0; j <= n; j++) {\n       if (i) {\n         dp[i][j] = dp[i - 1][j] + dtoc(s[2 * n - i - j]) * tav[i - 1];\n       }\n       if (j) {\n         dp[i][j] =\n             max(dp[i][j], dp[i][j - 1] + dtoc(s[2 * n - i - j]) * tav[j - 1]);\n       }\n     }\n   }\n   int i = n;\n   int j = n;\n   while (i > 0 || j > 0) {\n     if (i && dp[i - 1][j] + dtoc(s[2 * n - i - j]) * tav[i - 1] == dp[i][j]) {\n       i--;\n       cout << 'H';\n     } else {\n       j--;\n       cout << 'M';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int v[300123], n, ans, g[300123], f[300123], a, b, m, op;\n queue<int> q;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin >> n;\n   for (int i = 1; i <= n; ++i) {\n     cin >> v[i];\n     if (~v[i])\n       g[v[i]]++;\n     else {\n       g[0]++;\n     }\n   }\n   ans = 1;\n   for (int i = 1; i <= n; ++i) {\n     if (g[i] == 0) {\n       q.push(i);\n       f[i] = 1;\n     }\n   }\n   while (!q.empty()) {\n     int u = q.front();\n     q.pop();\n     g[v[u]]--;\n     if (g[v[u]] == 0) {\n       f[v[u]] = f[u] + 1;\n       q.push(v[u]);\n       ans = max(ans, f[v[u]]);\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int t;\n   cin >> t;\n   for (int i = 0; i < t; i++) {\n     int x;\n     cin >> x;\n     int ans = (x % 10 - 1) * 10;\n     ans += 1;\n     if (x / 10 > 0) ans += 2;\n     if (x / 100 > 0) ans += 3;\n     if (x / 1000 > 0) ans += 4;\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(NULL);\n   cin.tie(0);\n   cout.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     int a, b, c, m;\n     cin >> a >> b >> c >> m;\n     int len = a + b + c;\n     int maxi = len - 3;\n     int valMax = max(a, max(b, c));\n     int mini = max(0, ((2 * valMax) - len - 1));\n     if (m < mini || m > maxi)\n       cout << 'NO\n';\n     else\n       cout << 'YES\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename A, typename B>\n ostream &operator<<(ostream &os, const pair<A, B> &p) {\n   return os << '(' << p.first << ', ' << p.second << ')';\n }\n template <typename T_container, typename T = typename enable_if<\n                                     !is_same<T_container, string>::value,\n                                     typename T_container::value_type>::type>\n ostream &operator<<(ostream &os, const T_container &v) {\n   os << '{';\n   string sep;\n   for (const T &x : v) os << sep << x, sep = ', ';\n   return os << '}';\n }\n void dbg_out() { cerr << endl; }\n template <typename Head, typename... Tail>\n void dbg_out(Head H, Tail... T) {\n   cerr << ' ' << H;\n   dbg_out(T...);\n }\n const int INF = 1 << 30;\n const int MOD = 1e9 + 7;\n const int MAXN = 2e5 + 5;\n string asignar(int n) {\n   if (n == 0) return 'S';\n   if (n == 1) return 'M';\n   if (n == 2) return 'L';\n   if (n == 3) return 'XL';\n   if (n == 4) return 'XXL';\n   if (n == 5) return 'XXXL';\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   vector<int> stock(6);\n   for (long long i = (0); i < (long long)(6); i++) cin >> stock[i];\n   int n;\n   cin >> n;\n   vector<pair<pair<int, int>, int>> quiero(n);\n   for (long long j = (0); j < (long long)(n); j++) {\n     string s;\n     cin >> s;\n     string curr = '';\n     pair<int, int> x = make_pair(-1, -1);\n     for (long long i = (0); i < (long long)(s.size()); i++) {\n       if (s[i] != ',') {\n         curr += s[i];\n       } else {\n         if (curr == 'S') x.first = 0;\n         if (curr == 'M') x.first = 1;\n         if (curr == 'L') x.first = 2;\n         if (curr == 'XL') x.first = 3;\n         if (curr == 'XXL') x.first = 4;\n         if (curr == 'XXXL') x.first = 5;\n         curr = '';\n       }\n     }\n     if (curr == 'S') x.second = 0;\n     if (curr == 'M') x.second = 1;\n     if (curr == 'L') x.second = 2;\n     if (curr == 'XL') x.second = 3;\n     if (curr == 'XXL') x.second = 4;\n     if (curr == 'XXXL') x.second = 5;\n     if (x.first == -1) x.first = x.second;\n     if (x.first > x.second) swap(x.first, x.second);\n     quiero[j] = make_pair(x, j);\n   }\n   sort((quiero).begin(), (quiero).end());\n   ;\n   vector<string> ans(n);\n   for (long long i = (0); i < (long long)(n); i++) {\n     if (stock[quiero[i].first.first] > 0) {\n       ans[quiero[i].second] = asignar(quiero[i].first.first);\n       stock[quiero[i].first.first]--;\n     } else if (stock[quiero[i].first.second] > 0) {\n       ans[quiero[i].second] = asignar(quiero[i].first.second);\n       stock[quiero[i].first.second]--;\n     } else {\n       cout << 'NO\n';\n       return 0;\n     }\n   }\n   cout << 'YES\n';\n   for (long long i = (0); i < (long long)(n); i++) cout << ans[i] << '\n';\n   cout << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int in() {\n   int x;\n   scanf('%d', &x);\n   return x;\n }\n const int N = 1e6 + 7;\n int n, m, a[N], Q;\n long long SUM, psr[N], psl[N];\n int en[N], st[N];\n pair<int, long long> dpl[N], dpr[N];\n int solve(long long maax) {\n   if (maax >= SUM) return 1;\n   long long sum = 0, cur = 0;\n   for (int i = 0; i < n; i++) {\n     sum += a[i];\n     while (sum > maax) {\n       en[cur] = i - 1;\n       sum -= a[cur];\n       cur++;\n     }\n   }\n   while (cur < n) en[cur++] = n - 1;\n   sum = 0, cur = n - 1;\n   for (int i = n - 1; i >= 0; i--) {\n     sum += a[i];\n     while (sum > maax) {\n       st[cur] = i + 1;\n       sum -= a[cur];\n       cur--;\n     }\n   }\n   while (cur >= 0) st[cur--] = 0;\n   for (int i = 0; i < n; i++) {\n     if (st[i] == 0)\n       dpl[i] = {1, psl[i + 1]};\n     else\n       dpl[i] = dpl[st[i] - 1], dpl[i].first++;\n   }\n   for (int i = n - 1; i >= 0; --i) {\n     if (en[i] == n - 1)\n       dpr[i] = {1, psr[i]};\n     else\n       dpr[i] = dpr[en[i] + 1], dpr[i].first++;\n   }\n   int mn = dpr[0].first;\n   for (int i = 1; i < n; i++)\n     mn = min(mn, dpr[i].first + dpl[i - 1].first -\n                      ((dpr[i].second + dpl[i - 1].second) <= maax));\n   return mn;\n }\n int32_t main() {\n   n = in(), Q = in();\n   for (int i = 0; i < n; i++) {\n     a[i] = in();\n     SUM += a[i];\n     psl[i + 1] = a[i] + psl[i];\n   }\n   for (int i = n - 1; i >= 0; --i) psr[i] = psr[i + 1] + a[i];\n   while (Q--) {\n     long long x;\n     cin >> x;\n     cout << solve(x) << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[1005][1005], used[1005][1005];\n const int dx[4] = {0, 0, 1, -1};\n const int dy[4] = {1, -1, 0, 0};\n void DFS(int i, int j, int N, int M) {\n   if (i == 0 || i == N + 1 || j == 0 || j == M + 1 || used[i][j]) return;\n   used[i][j] = 1;\n   for (int d = 0; d < 4; ++d)\n     if (a[i + dx[d]][j + dy[d]] == 1) DFS(i + dx[d], j + dy[d], N, M);\n }\n int main() {\n   int N, M;\n   scanf('%d%d', &N, &M);\n   int numberBlacks = 0;\n   for (int i = 1; i <= N; ++i) {\n     char s[1005];\n     scanf('%s', s + 1);\n     for (int j = 1; j <= M; ++j)\n       if (s[j] == '#') {\n         a[i][j] = 1;\n         ++numberBlacks;\n       }\n   }\n   if (numberBlacks == 0) {\n     printf('0\n');\n     return 0;\n   }\n   int emptyLines = 0;\n   for (int i = 1; i <= N; ++i) {\n     int cnt = 0, numberLineSegments = 0;\n     for (int j = 1; j <= M; ++j) {\n       cnt += a[i][j];\n       if (a[i][j - 1] == 0 && a[i][j] == 1) ++numberLineSegments;\n     }\n     if (numberLineSegments > 1) {\n       printf('-1\n');\n       return 0;\n     }\n     if (cnt == 0) ++emptyLines;\n   }\n   int emptyColumns = 0;\n   for (int j = 1; j <= M; ++j) {\n     int cnt = 0, numberColumnSegments = 0;\n     for (int i = 1; i <= N; ++i) {\n       cnt += a[i][j];\n       if (a[i - 1][j] == 0 && a[i][j] == 1) ++numberColumnSegments;\n     }\n     if (numberColumnSegments > 1) {\n       printf('-1\n');\n       return 0;\n     }\n     if (cnt == 0) ++emptyColumns;\n   }\n   if (emptyLines == 0 && emptyColumns > 0 ||\n       emptyLines > 0 && emptyColumns == 0) {\n     printf('-1\n');\n     return 0;\n   }\n   int connectedComponents = 0;\n   for (int i = 1; i <= N; ++i)\n     for (int j = 1; j <= M; ++j)\n       if (used[i][j] == 0 && a[i][j] == 1) {\n         ++connectedComponents;\n         DFS(i, j, N, M);\n       }\n   printf('%d\n', connectedComponents);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n T scani(T &n) {\n   n = 0;\n   bool negative = false;\n   char c = getchar();\n   while (c < '0' || c > '9') {\n     if (c == '-') negative = true;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') {\n     n = n * 10 + c - 48;\n     c = getchar();\n   }\n   if (negative) n = ~(n - 1);\n   return n;\n }\n template <typename T>\n void write(T n, int type = true) {\n   if (n < 0) {\n     putchar('-');\n     n = -n;\n   }\n   if (!n) {\n     putchar('0');\n     if (type == 32)\n       putchar(' ');\n     else if (type)\n       putchar('\n');\n     return;\n   }\n   char buff[22];\n   int len = 0;\n   while (n) buff[len++] = n % 10 + 48, n /= 10;\n   for (int i = len - 1; i >= 0; i--) putchar(buff[i]);\n   if (type == 32)\n     putchar(' ');\n   else if (type)\n     putchar('\n');\n }\n int scans(char *a) {\n   int i = 0;\n   char c = 0;\n   while (c < 33) c = getchar();\n   while (c > 33) {\n     a[i++] = c;\n     c = getchar();\n   }\n   a[i] = 0;\n   return i;\n }\n const int N = 100005;\n int main() {\n   int n, k;\n   scani(n), scani(k);\n   int ans;\n   ans = (2 * n + k - 1) / k + (5 * n + k - 1) / k + (8 * n + k - 1) / k;\n   write(ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline bool uin(T& a, T b) {\n   return a > b ? (a = b, true) : false;\n }\n template <class T>\n inline bool uax(T& a, T b) {\n   return a < b ? (a = b, true) : false;\n }\n const int nax = 5123;\n pair<int, int> edge[nax];\n vector<int> g[nax];\n int col[nax];\n int N, M;\n bool cycle_found = false;\n int dfs_num[nax];\n void dfs(int v) {\n   dfs_num[v] = 1;\n   for (int i : g[v]) {\n     int ch = edge[i].first ^ edge[i].second ^ v;\n     if (dfs_num[ch] == 2) {\n       continue;\n     } else if (dfs_num[ch] == 1) {\n       col[i] = 1;\n       cycle_found = true;\n       continue;\n     }\n     dfs(ch);\n   }\n   dfs_num[v] = 2;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> N >> M;\n   for (int u, v, i = 0; i < M; ++i) {\n     cin >> u >> v;\n     --u, --v;\n     edge[i] = make_pair(u, v);\n     g[u].push_back(i);\n   }\n   for (int i = 0; i < N; ++i)\n     if (dfs_num[i] != 2) dfs(i);\n   cout << (cycle_found ? 2 : 1) << '\n';\n   for (int i = 0; i < M; ++i) cout << col[i] + 1 << ' \n'[i == M - 1];\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, mid, rt, res, a[200010], f[200010], sz[200010];\n vector<int> e[200010];\n void dfs(int u, int fa) {\n   f[u] = sz[u] = 1;\n   int m1 = 0, m2 = 0;\n   for (auto v : e[u]) {\n     if (v == fa) continue;\n     dfs(v, u);\n     sz[u] += sz[v];\n     if (f[v] == sz[v])\n       f[u] += f[v];\n     else {\n       if (f[v] > m1) swap(f[v], m1);\n       if (f[v] > m2) swap(f[v], m2);\n     }\n   }\n   f[u] = a[u] < mid ? 0 : f[u] + m1;\n   res = max(res, f[u] + m2);\n }\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]);\n   for (int i = 1; i < n; i++) {\n     int u, v;\n     scanf('%d%d', &u, &v);\n     e[u].push_back(v);\n     e[v].push_back(u);\n   }\n   rt = min_element(a + 1, a + 1 + n) - a;\n   int l = 0, r = 1000010, ans;\n   while (l <= r) {\n     mid = (l + r) >> 1;\n     res = 0;\n     dfs(rt, 0);\n     if (res >= m)\n       l = mid + 1, ans = mid;\n     else\n       r = mid - 1;\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool used[10000005];\n int ans[105];\n bool comp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {\n   if (a.first.second == b.first.second) return a.first.first < b.first.first;\n   return a.first.second < b.first.second;\n }\n void solve() {\n   int N;\n   cin >> N;\n   vector<pair<pair<int, int>, int>> x(N);\n   for (int i = 0; i < N; i++) {\n     cin >> x[i].first.first >> x[i].first.second;\n     x[i].second = i;\n   }\n   sort(x.begin(), x.end(), comp);\n   for (int i = 0; i < N; i++) {\n     for (int j = x[i].first.first; j < x[i].first.second + 1; j++) {\n       if (!used[j]) {\n         used[j] = true;\n         ans[x[i].second] = j;\n         break;\n       }\n     }\n   }\n   for (int i = 0; i < N; i++) {\n     cout << ans[i] << ' ';\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int t = 1;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MAXN = 200100, M = 1000000009;\n string s;\n long long n, ans = 0, a[MAXN], b[MAXN];\n void obra(long long v) {\n   long long tc = 0, k = a[v];\n   for (long long i = 0; i < n; i++) {\n     b[i] = a[i] + k / n;\n     if (i == v) b[i] -= a[i];\n   }\n   k %= 14;\n   for (long long i = 0; i < k; i++) {\n     b[(v + 1 + i) % n]++;\n   }\n   for (long long i = 0; i < n; i++) {\n     if (b[i] % 2 == 0) {\n       tc += b[i];\n     }\n   }\n   if (ans < tc) ans = tc;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   n = 14;\n   for (long long i = 0; i < n; i++) {\n     cin >> a[i];\n   }\n   for (long long i = 0; i < n; i++) obra(i);\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   long long arr[n];\n   for (int i = 0; i < n; i++) scanf('%lld', &arr[i]);\n   map<long long, int> mp;\n   long long sum = 0;\n   for (int i = n - 1; i >= 0; i--) {\n     sum += arr[i];\n     mp[sum] = i;\n   }\n   long long ans = 0;\n   long long cnt = 0;\n   for (int i = 0; i < n; i++) {\n     cnt += arr[i];\n     if (mp[cnt] > i && mp[cnt] != 0) {\n       ans = max(cnt, ans);\n     }\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n using ld = long double;\n template <typename T>\n T &chmin(T &a, const T &b) {\n   return a = min(a, b);\n }\n template <typename T>\n T &chmax(T &a, const T &b) {\n   return a = max(a, b);\n }\n template <typename T>\n T inf;\n template <>\n constexpr int inf<int> = 1e9;\n template <>\n constexpr ll inf<ll> = 1e18;\n template <>\n constexpr ld inf<ld> = 1e30;\n struct yes_no : numpunct<char> {\n   string_type do_truename() const { return 'Yes'; }\n   string_type do_falsename() const { return 'No'; }\n };\n int N, K;\n int A[501000];\n int main() {\n   locale loc(locale(), new yes_no);\n   cout << boolalpha;\n   cout.imbue(loc);\n   scanf('%d%d', &K, &N);\n   for (int i = 0; i < (int)(N); i++) scanf('%d', &A[i]);\n   sort(A, A + N);\n   set<pair<ll, ll>> index_value, value_index;\n   for (int i = 0; i < (int)(N - 1); i++) {\n     const int val = A[i + 1] - A[i];\n     index_value.emplace(i, val);\n     value_index.emplace(val, i);\n   }\n   index_value.emplace(-1, inf<ll>);\n   index_value.emplace(N, inf<ll>);\n   value_index.emplace(inf<ll>, -1);\n   value_index.emplace(inf<ll>, N);\n   ll res = 0;\n   for (int loop = 0; loop < (int)(K); loop++) {\n     int v, l, r;\n     ll val, lval, rval;\n     tie(val, v) = *begin(value_index);\n     auto it = index_value.lower_bound(make_pair(v, val));\n     tie(l, lval) = *prev(it);\n     tie(r, rval) = *next(it);\n     index_value.erase(make_pair(v, val));\n     index_value.erase(make_pair(l, lval));\n     index_value.erase(make_pair(r, rval));\n     value_index.erase(make_pair(val, v));\n     value_index.erase(make_pair(lval, l));\n     value_index.erase(make_pair(rval, r));\n     index_value.emplace(v, lval + rval - val);\n     value_index.emplace(lval + rval - val, v);\n     res += val;\n   }\n   cout << res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> childs[100000 + 1];\n long long s[100000 + 1];\n int p[100000 + 1];\n long long a[100000 + 1];\n bool flag = false;\n void fill(int v, long long prevsum) {\n   if (s[v] != -1) {\n     a[v] = s[v] - prevsum;\n     if (a[v] < 0) flag = true;\n     for (int i = 0; i < childs[v].size(); ++i) {\n       fill(childs[v][i], s[v]);\n     }\n   } else {\n     long long mi = 1000000001;\n     for (int i = 0; i < childs[v].size(); ++i) {\n       mi = min(mi, s[childs[v][i]]);\n     }\n     if (mi == 1000000001) mi = prevsum;\n     a[v] = mi - prevsum;\n     if (a[v] < 0) flag = true;\n     for (int i = 0; i < childs[v].size(); ++i) {\n       fill(childs[v][i], mi);\n     }\n   }\n }\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; ++i) {\n     childs[i].clear();\n   }\n   for (int i = 2; i < n + 1; ++i) {\n     cin >> p[i];\n     childs[p[i]].push_back(i);\n   }\n   for (int i = 1; i < n + 1; ++i) {\n     cin >> s[i];\n   }\n   fill(1, 0);\n   if (flag)\n     cout << -1 << endl;\n   else {\n     long long sum = 0;\n     for (int i = 1; i < n + 1; ++i) {\n       sum += a[i];\n     }\n     cout << sum << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string a, b;\n int i, ax, ay, bx, by;\n int main() {\n   cin >> a >> b;\n   for (i = 0; i < a.length(); i++)\n     if (a[i] == '1')\n       ax++;\n     else\n       ay++;\n   for (i = 0; i <= b.length(); i++)\n     if (b[i] == '1')\n       bx++;\n     else\n       by++;\n   if (ax % 2 == 1) ax++;\n   if (ax < bx)\n     cout << 'NO';\n   else\n     cout << 'YES';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/STACK:200000')\n const int INF = 1e9 + 7;\n const double EPS = 1e-6;\n const double pi = acos(-1);\n const int MOD = 1e9 + 7;\n const int N = 1e5 + 1000;\n using namespace std;\n double mid;\n struct node {\n   int pos, val;\n   node() { pos = val = 0; }\n   node(int a, int b) {\n     pos = a;\n     val = b;\n   }\n   bool operator<(node a) const {\n     if (val != a.val) return val < a.val;\n     if (abs(mid - pos * 1.0) != abs(mid - a.pos * 1.0))\n       return abs(mid - pos * 1.0) < abs(mid - a.pos * 1.0);\n     return pos < a.pos;\n   }\n };\n int n, m, ans[N];\n set<node> st;\n int main() {\n   cin >> n >> m;\n   mid = (m + 1) * 0.5;\n   for (int i = 1; i <= m; i++) {\n     st.insert(node(i, 0));\n   }\n   for (int i = 1; i <= n; i++) {\n     auto it = *st.begin();\n     st.erase(it);\n     it.val++;\n     ans[i] = it.pos;\n     st.insert(it);\n   }\n   for (int i = 1; i <= n; i++) cout << ans[i] << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, x, y;\n int b[1005], a[1005];\n int F1[1005], F2[1005];\n int main() {\n   char ch;\n   cin >> n >> m >> x >> y;\n   for (int i = 1; i <= n; ++i)\n     for (int j = 1; j <= m; ++j) {\n       cin >> ch;\n       if (ch == '#') b[j]++;\n     }\n   for (int i = 1; i <= m; ++i) a[i] = a[i - 1] + b[i];\n   for (int i = 1; i <= m; ++i) {\n     F1[i] = 10000000;\n     F2[i] = 10000000;\n   }\n   for (int i = x; i <= y; ++i) {\n     F1[i] = a[i];\n     F2[i] = n * i - a[i];\n   }\n   for (int i = x + 1; i <= m; ++i) {\n     for (int j = x; j <= y; ++j)\n       if (i - j >= x) {\n         if (F1[i] > F2[i - j] + a[i] - a[i - j])\n           F1[i] = F2[i - j] + a[i] - a[i - j];\n         if (F2[i] > F1[i - j] + n * j - a[i] + a[i - j])\n           F2[i] = F1[i - j] + n * j - a[i] + a[i - j];\n       }\n   }\n   if (F1[m] > F2[m])\n     cout << F2[m];\n   else\n     cout << F1[m];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, op;\n string tes;\n int main() {\n   cin >> n >> k >> ws >> tes;\n   op = 0;\n   for (int i = 1; i < n; i++)\n     if (tes.substr(0, i) == tes.substr(n - i, i)) op = i;\n   cout << tes;\n   tes = tes.substr(op, tes.length());\n   for (int i = 1; i < k; i++) cout << tes;\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char x[100100];\n long x2[100100];\n long mes[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n long wr = 0;\n long res, cur, repsmax = -1;\n long reps = 0;\n long tmp1, tmp2, tmp3;\n string s1;\n int compare(const void *a, const void *b) { return (*(long *)a - *(long *)b); }\n long check(long z) {\n   if ((isdigit(x[z])) && (isdigit(x[z + 1])) && (isdigit(x[z + 3])) &&\n       (isdigit(x[z + 4])) && (isdigit(x[z + 6])) && (isdigit(x[z + 7])) &&\n       (isdigit(x[z + 8])) && (isdigit(x[z + 9]))) {\n     if ((x[z + 2] == x[z + 5]) && (x[z + 2] == '-')) {\n       tmp1 =\n           ((long)(x[z]) - (long)('0')) * 10 + ((long)(x[z + 1]) - (long)('0'));\n       tmp2 = ((long)(x[z + 3]) - (long)('0')) * 10 +\n              ((long)(x[z + 4]) - (long)('0'));\n       tmp3 = ((long)(x[z + 6]) - (long)('0')) * 1000 +\n              ((long)(x[z + 7]) - (long)('0')) * 100 +\n              (((long)(x[z + 8]) - (long)('0')) * 10) +\n              ((long)(x[z + 9]) - (long)('0'));\n       if ((tmp2 <= 12) && (tmp3 <= 2015) && (tmp3 >= 2013)) {\n         if ((tmp1 <= mes[tmp2]) && (tmp2 != 0) && (tmp1 != 0)) {\n           x2[wr++] = tmp1 + tmp2 * 100 + tmp3 * 10000;\n         }\n       }\n     }\n   }\n   if ((!isdigit(x[z + 9])) && (x[z + 9] != '-')) {\n     return -2;\n   }\n }\n int main(int argc, char *argv[]) {\n   scanf('%s', &x);\n   long j = 0;\n   while (check(j++) > -2) {\n   }\n   qsort(x2, wr - 1, sizeof(long), compare);\n   cur = x2[0];\n   for (long j = 0; j < wr; j++) {\n     if (cur == x2[j]) {\n       reps++;\n     } else {\n       if (reps > repsmax) {\n         repsmax = reps;\n         res = cur;\n       }\n       cur = x2[j];\n       reps = 1;\n     }\n   }\n   if (reps > repsmax) {\n     repsmax = reps;\n     res = cur;\n   }\n   cur = x2[j];\n   reps = 1;\n   ldiv_t divresult1;\n   divresult1 = ldiv(res, 100);\n   if (divresult1.rem < 10) {\n     cout << '0';\n   }\n   cout << divresult1.rem << '-';\n   ldiv_t divresult2;\n   divresult2 = ldiv(res, 10000);\n   if (((divresult2.rem - divresult1.rem) / 100) < 10) {\n     cout << '0';\n   }\n   cout << (divresult2.rem - divresult1.rem) / 100 << '-';\n   ldiv_t divresult3;\n   divresult3 = ldiv(res, 100000000);\n   cout << (divresult3.rem - divresult2.rem) / 10000;\n   return EXIT_SUCCESS;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100005;\n int n, m;\n vector<pair<int, int> > e[N];\n vector<int> ans[2];\n bool fla[2], flag;\n int E[N], d[N];\n vector<int> cnt[2];\n void DFS(int first, int o, int res) {\n   if (flag) return;\n   d[first] = o;\n   cnt[o].push_back(first);\n   for (auto& i : e[first]) {\n     if (flag) return;\n     int second = (i.second + o) % 2;\n     if (d[i.first] == -1)\n       DFS(i.first, second != res, res);\n     else if (d[i.first] != (second != res))\n       flag = true;\n   }\n }\n void SOLVE(int res) {\n   memset(d, -1, sizeof(d));\n   flag = false;\n   for (int i(1); i <= n; i++)\n     if (d[i] == -1) {\n       cnt[0].clear();\n       cnt[1].clear();\n       DFS(i, 0, res);\n       if (flag) {\n         fla[res] = true;\n         return;\n       }\n       for (bool ___ = 1; ___; ___ = 0) {\n         int mx = (cnt[1].size() < cnt[0].size());\n         for (auto& i : cnt[mx]) ans[res].push_back(i);\n       }\n     }\n }\n int main() {\n   n = ({\n     long long first = 0;\n     int n = 0, c = getchar();\n     for (; !isdigit(c); c = getchar()) n = c == '-';\n     for (; isdigit(c); c = getchar()) first = first * 10 + c - '0';\n     n ? -first : first;\n   }),\n   m = ({\n     long long first = 0;\n     int n = 0, c = getchar();\n     for (; !isdigit(c); c = getchar()) n = c == '-';\n     for (; isdigit(c); c = getchar()) first = first * 10 + c - '0';\n     n ? -first : first;\n   });\n   for (int i(1); i <= m; i++) {\n     int first = ({\n       long long first = 0;\n       int n = 0, c = getchar();\n       for (; !isdigit(c); c = getchar()) n = c == '-';\n       for (; isdigit(c); c = getchar()) first = first * 10 + c - '0';\n       n ? -first : first;\n     }),\n         second = ({\n           long long first = 0;\n           int n = 0, c = getchar();\n           for (; !isdigit(c); c = getchar()) n = c == '-';\n           for (; isdigit(c); c = getchar()) first = first * 10 + c - '0';\n           n ? -first : first;\n         });\n     int c = ({\n               char c = getchar();\n               while (c == ' ' || c == '\n') c = getchar();\n               c;\n             }) == 'R';\n     e[first].push_back({second, c});\n     e[second].push_back({first, c});\n   }\n   SOLVE(0);\n   SOLVE(1);\n   for (bool ___ = 1; ___; ___ = 0) {\n     int res;\n     if (fla[0] && fla[1])\n       return cout << -1 << '\n', 0;\n     else if (fla[0])\n       res = 1;\n     else if (fla[1])\n       res = 0;\n     else if (ans[0].size() < ans[1].size())\n       res = 0;\n     else\n       res = 1;\n     cout << ans[res].size() << '\n';\n     for (auto& i : ans[res]) cout << i << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n class BLongtailHedgehog {\n  public:\n   int N, M;\n   vector<int> dist, deg_in, deg;\n   vector<vector<int>> G;\n   void input(std::istream& in, std::ostream& out) {\n     ios_base::sync_with_stdio(false);\n     in >> N >> M;\n     dist = vector<int>(N, -1);\n     deg_in = vector<int>(N, 0);\n     deg = vector<int>(N, 0);\n     G = vector<vector<int>>(N, vector<int>());\n     for (int(i) = (0); (i) < (M); ++(i)) {\n       int u, v;\n       in >> u >> v;\n       u--, v--;\n       if (u > v) swap(u, v);\n       G[u].push_back(v);\n       deg_in[v]++, deg[u]++, deg[v]++;\n     }\n   }\n   void bfs(int s) {\n     queue<int> q;\n     dist[s] = 1, q.push(s);\n     while (!q.empty()) {\n       int u = q.front();\n       q.pop();\n       for (auto v : G[u]) {\n         deg_in[v]--;\n         dist[v] = max(dist[v], dist[u] + 1);\n         if (deg_in[v] == 0) {\n           q.push(v);\n         }\n       }\n     }\n   }\n   void solve(std::istream& in, std::ostream& out) {\n     input(in, out);\n     for (int(i) = (0); (i) < (N); ++(i)) {\n       if (dist[i] == -1) bfs(i);\n     }\n     long long ans = 0;\n     for (int(i) = (0); (i) < (N); ++(i)) ans = max(ans, 1LL * dist[i] * deg[i]);\n     out << ans << '\n';\n   }\n };\n int main() {\n   BLongtailHedgehog solver;\n   std::istream& in(std::cin);\n   std::ostream& out(std::cout);\n   solver.solve(in, out);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void hi() {\n   static long long i = 0;\n   cout << 'Check Point : ' << ++i << '\n';\n   return;\n }\n signed main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   long long t;\n   t = 1;\n   while (t--) {\n     string str;\n     cin >> str;\n     long long n = str.length();\n     stack<char> stk;\n     for (long long i = 0; i < n; i++) {\n       if (!stk.empty() && ((stk.top() == '+' && str[i] == '+') ||\n                            ((stk.top() == '-' && str[i] == '-')))) {\n         stk.pop();\n       } else {\n         stk.push(str[i]);\n       }\n     }\n     if (stk.empty()) {\n       cout << 'Yes'\n            << '\n';\n     } else {\n       cout << 'No'\n            << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 400010;\n int gcds[N], a[N], b[N];\n int c[N], mx[N];\n int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i - 1]);\n     gcds[i] = gcd(i, n);\n   }\n   long long ans = 0;\n   for (int i = 1; i < n; i++) {\n     if (n % i) continue;\n     for (int j = 1; j <= n; j++) c[j] = c[j - 1] + (i == gcds[j]);\n     for (int j = 0; j < i; j++) mx[j] = a[j];\n     for (int j = i; j < n; j++) mx[j % i] = max(mx[j % i], a[j]);\n     for (int j = 0; j < n; j++) b[j] = b[j + n] = mx[j % i] == a[j];\n     for (int j = 2 * n - 2; j >= 0; j--)\n       if (b[j]) b[j] += b[j + 1];\n     for (int j = 0; j < n; j++) ans += c[min(n - 1, b[j])];\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[23][23];\n char s[23][23];\n int dp[1 << 23];\n int n, m;\n int cost[23][23];\n int st[23][23];\n int main() {\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < n; i++) scanf('%s', s[i]);\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++) scanf('%d', &a[i][j]);\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++) {\n       int mx = -0x3f3f3f3f;\n       int ans = 0;\n       for (int k = 0; k < n; k++) {\n         if (s[i][j] == s[k][j]) {\n           ans += a[k][j];\n           mx = max(mx, a[k][j]);\n           st[i][j] |= 1 << k;\n         }\n       }\n       ans -= mx;\n       cost[i][j] = ans;\n     }\n   for (int i = 1; i < (1 << n); i++) dp[i] = 0x3f3f3f3f;\n   dp[0] = 0;\n   for (int i = 0; i < (1 << n); i++)\n     for (int j = 0; j < n; j++)\n       if ((i & (1 << j)) == 0) {\n         for (int k = 0; k < m; k++) {\n           dp[i | (1 << j)] = min(dp[i | (1 << j)], dp[i] + a[j][k]);\n           dp[i | st[j][k]] = min(dp[i | st[j][k]], dp[i] + cost[j][k]);\n         }\n       }\n   printf('%d\n', dp[(1 << n) - 1]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n long long int a[300000];\n int main() {\n   long long int n, i, hei, bai;\n   while (scanf('%lld', &n) != EOF) {\n     hei = bai = 0;\n     for (i = 0; i < n; i++) {\n       scanf('%lld', &a[i]);\n       if (i % 2) {\n         hei += (a[i] + 1) / 2;\n         bai += a[i] / 2;\n       } else {\n         bai += (a[i] + 1) / 2;\n         hei += a[i] / 2;\n       }\n     }\n     printf('%lld\n', bai < hei ? bai : hei);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = INT_MAX;\n const long long INFL = LLONG_MAX;\n const int output_precision = 15;\n const long double pi = acos(-1);\n const bool debug = true;\n int N;\n int A[5];\n int check() {\n   vector<int> B(4);\n   for (int(i) = 1, j1234 = 4; (i) <= j1234; (i)++) B[i - 1] = A[i];\n   sort(B.begin(), B.end());\n   int x1 = B[0] + B[1] + B[2] + B[3];\n   int x2 = 2 * (B[1] + B[2]);\n   int x3 = 4 * (B[3] - B[0]);\n   return x1 == x2 && x2 == x3;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cout.precision(output_precision);\n   cout << fixed;\n   cout.tie(0);\n   cin >> N;\n   for (int(i) = 1, j1234 = N; (i) <= j1234; (i)++) cin >> A[i];\n   if (N == 0) {\n     cout << 'YES' << '\n';\n     cout << 1 << '\n';\n     cout << 1 << '\n';\n     cout << 3 << '\n';\n     cout << 3 << '\n';\n     return 0;\n   }\n   if (N == 1) {\n     int a = A[1];\n     cout << 'YES' << '\n';\n     cout << a << '\n';\n     cout << 3 * a << '\n';\n     cout << 3 * a << '\n';\n     return 0;\n   }\n   if (N == 2) {\n     for (int(x) = 1, j1234 = 1500; (x) <= j1234; (x)++)\n       for (int(y) = 1, j1234 = 1500; (y) <= j1234; (y)++) {\n         A[3] = x;\n         A[4] = y;\n         if (check()) {\n           cout << 'YES' << '\n';\n           cout << x << '\n';\n           cout << y << '\n';\n           return 0;\n         }\n       }\n     cout << 'NO' << '\n';\n     return 0;\n   }\n   if (N == 3) {\n     for (int(i) = 1, j1234 = 1500; (i) <= j1234; (i)++) {\n       A[4] = i;\n       if (check()) {\n         cout << 'YES' << '\n';\n         cout << i << '\n';\n         return 0;\n       }\n     }\n     cout << 'NO' << '\n';\n     return 0;\n   }\n   if (N == 4) {\n     if (check()) {\n       cout << 'YES' << '\n';\n     } else {\n       cout << 'NO' << '\n';\n     }\n     return 0;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void islam() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n }\n void get(long long &x) { cin >> x; }\n class ghost {\n  public:\n   ghost() {\n     get(n);\n     for (int i = 0; i < n; i++) {\n       get(arr[i]);\n       s += arr[i];\n     }\n     s /= n;\n   }\n   void solve() {\n     long long c = 0;\n     for (int i = 0; i < n; i++) {\n       c += s - arr[i];\n       a += abs(c);\n     }\n   }\n   void print() { cout << a; }\n \n  private:\n   long long n, s;\n   long long arr[50000 + 10], a = 0;\n };\n int main() {\n   islam();\n   ghost x;\n   x.solve();\n   x.print();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool isAscending(const vector<int64_t>& vec) {\n   for (int i = 1; i < vec.size(); ++i) {\n     if (vec[i - 1] >= vec[i]) {\n       return false;\n     }\n   }\n   return true;\n }\n bool Requal(const vector<int64_t>& av, const vector<int64_t>& bv) {\n   for (int i = 0; i < av.size(); ++i) {\n     if (av[i] != bv[bv.size() - i - 1]) {\n       return false;\n     }\n   }\n   return true;\n }\n bool Equal(const vector<int64_t>& av, const vector<int64_t>& bv) {\n   for (int i = 0; i < av.size(); ++i) {\n     if (av[i] != bv[i]) {\n       return false;\n     }\n   }\n   return true;\n }\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   std::cin.tie(nullptr);\n   int len;\n   cin >> len;\n   vector<int64_t> av(len), bv(len);\n   for (auto&& e : av) {\n     cin >> e;\n   }\n   for (auto&& e : bv) {\n     cin >> e;\n   }\n   if (len == 1) {\n     if (av[0] == bv[0]) {\n       cout << 'SMALL' << endl;\n       cout << 0 << endl;\n       cout << endl;\n     } else {\n       cout << 'IMPOSSIBLE' << endl;\n     }\n     return 0;\n   }\n   if (len == 2) {\n     int64_t total = 0;\n     vector<pair<char, int64_t>> buf;\n     string res;\n     if (av[0] > av[1]) {\n       swap(av[0], av[1]);\n       res += 'R';\n     }\n     while (1) {\n       if (bv[0] > bv[1]) {\n         swap(bv[0], bv[1]);\n         buf.push_back({'R', 1});\n       }\n       if (bv[0] == av[0]) {\n         if (bv[1] >= av[1] && ((bv[1] - av[1]) % bv[0]) == 0) {\n           buf.push_back({'P', (bv[1] - av[1]) / bv[0]});\n           total += (bv[1] - av[1]) / bv[0];\n         } else {\n           total = -1;\n         }\n         break;\n       }\n       if (bv[0] == bv[1]) {\n         total = -1;\n         break;\n       }\n       buf.push_back({'P', bv[1] / bv[0]});\n       bv[1] = bv[1] % bv[0];\n       total += buf.back().second;\n       if (bv[1] == 0) {\n         bv[1] = bv[0];\n         total--;\n         buf.back().second--;\n       }\n     }\n     if (total < 0) {\n       cout << 'IMPOSSIBLE' << endl;\n       return 0;\n     }\n     if (total > 200000) {\n       cout << 'BIG' << endl;\n       cout << total << endl;\n     } else {\n       cout << 'SMALL' << endl;\n       for (auto it = buf.rbegin(); it != buf.rend(); ++it) {\n         for (int i = 0; i < it->second; ++i) {\n           res += it->first;\n         }\n       }\n       cout << res.size() << endl;\n       cout << res << endl;\n     }\n     return 0;\n   }\n   int64_t total = 0;\n   string res;\n   while (1) {\n     if (Equal(av, bv)) {\n       break;\n     }\n     if (Requal(av, bv)) {\n       res += 'R';\n       break;\n     }\n     if (bv[0] > bv[1]) {\n       reverse(begin(bv), end(bv));\n       res += 'R';\n     }\n     if (isAscending(bv) and bv[0] > 0) {\n       for (int i = len; i-- > 1;) {\n         bv[i] -= bv[i - 1];\n       }\n       res += 'P';\n       ++total;\n     } else {\n       res = '';\n       break;\n     }\n   }\n   if (res == '') {\n     cout << 'IMPOSSIBLE' << endl;\n   } else if (total > 200000) {\n     cout << 'BIG' << endl;\n     cout << total << endl;\n   } else {\n     cout << 'SMALL' << endl;\n     reverse(begin(res), end(res));\n     cout << res.size() << endl;\n     cout << res << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, i, j, k, l, m, t;\n int a[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n int main() {\n   cin >> m >> t;\n   a[m] -= 7 - t + 1;\n   if (a[m] % 7 == 0) {\n     cout << a[m] / 7 + 1;\n   } else {\n     cout << a[m] / 7 + 2;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n queue<int> fila;\n struct G {\n   double d;\n   int m, p, r;\n } g[250002];\n bool mk[250002];\n int a2[9000000];\n bool cmp2(int a, int b) { return g[a].d < g[b].d; }\n int pos = 0;\n int ind = 0;\n struct T {\n   int m;\n   int* e;\n   void pdt(int a, int* b) { m = a, e = b; }\n } mas[2 * 250002];\n bool cmp(T a, T b) { return a.m < b.m; }\n int ls[4 * 250002];\n int s[4 * 250002][2];\n int r[4 * 250002];\n int build(int a, int b, int f) {\n   int p = ind++;\n   ls[p] = pos;\n   r[p] = b;\n   int i = ls[f];\n   for (int i = ls[f]; a2[i] >= 0; i++) {\n     if (g[a2[i]].m >= a && g[a2[i]].m <= b) a2[pos] = a2[i], pos++;\n   }\n   a2[pos] = -1;\n   pos++;\n   if (a != b)\n     s[p][0] = build(a, (a + b) / 2, p),\n     s[p][1] = build(((a + b) / 2) + 1, b, p);\n   else\n     s[p][0] = s[p][1] = -1;\n   return p;\n }\n void get(int p, int power, int ray) {\n   if (r[p] <= power) {\n     for (int i = ls[p]; a2[i] >= 0; i++) {\n       if (g[a2[i]].d <= ray + 1e-2) {\n         if (!mk[a2[i]]) fila.push(a2[i]), mk[a2[i]] = true;\n         ls[p] = i + 1;\n       } else\n         break;\n     }\n   } else {\n     get(s[p][0], power, ray);\n     if (power > r[s[p][0]]) get(s[p][1], power, ray);\n   }\n }\n int main() {\n   double x0, y0;\n   int pp, rr, n;\n   scanf('%lf %lf %d %d %d', &x0, &y0, &pp, &rr, &n);\n   int tot = 0;\n   mas[tot++].pdt(pp, &pp);\n   double x, y;\n   for (int i = 0; i < n; i++) {\n     scanf('%lf %lf %d %d %d', &x, &y, &g[i].m, &g[i].p, &g[i].r);\n     x -= x0;\n     y -= y0;\n     g[i].d = sqrt(x * x + y * y);\n     mk[i] = false;\n     a2[i] = i;\n     mas[tot++].pdt(g[i].m, &g[i].m), mas[tot++].pdt(g[i].p, &g[i].p);\n   }\n   a2[n] = -1;\n   sort(mas, mas + tot, cmp);\n   int v = 1;\n   int tmp = mas[0].m;\n   *mas[0].e = v;\n   for (int i = 1; i < tot; i++) {\n     if (mas[i].m != tmp) v++;\n     tmp = mas[i].m;\n     *mas[i].e = v;\n   }\n   sort(a2, a2 + n, cmp2);\n   r[0] = v;\n   ls[0] = 0;\n   ind = 1;\n   pos = n + 1;\n   if (n >= 2) s[0][0] = build(1, v / 2, 0), s[0][1] = build((v / 2) + 1, v, 0);\n   get(0, pp, rr);\n   int resp = 0;\n   while (fila.size()) {\n     resp++;\n     int u = fila.front();\n     fila.pop();\n     get(0, g[u].p, g[u].r);\n   }\n   printf('%d\n', resp);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int run(int n) {\n   int i, a[n];\n   for (i = 0; i < n; i++) cin >> a[i];\n   sort(a, a + i);\n   int ans = 0;\n   int tempCount = 0;\n   for (i = 0; i < n; i++) {\n     tempCount++;\n     if (a[i] == tempCount) {\n       ans++;\n       tempCount = 0;\n     }\n   }\n   return ans;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int t;\n   cin >> t;\n   int n;\n   while (t--) {\n     cin >> n;\n     cout << run(n) << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n, s = 1;\n   char a;\n   string b[10], c;\n   cin >> n;\n   b[0] = '';\n   b[1] = '';\n   b[2] = '2';\n   b[3] = '3';\n   b[4] = '322';\n   b[5] = '5';\n   b[6] = '53';\n   b[7] = '7';\n   b[8] = '7222';\n   b[9] = '7332';\n   int k = 0;\n   int d = 0;\n   for (int i = 1; i <= n; i++) {\n     cin >> a;\n     s = a - 48;\n     if (s != 1 && s != 0) c = c + b[s];\n   }\n   sort(c.begin(), c.end());\n   k = c.size();\n   for (int i = k - 1; i >= 0; i--) cout << c[i];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t, n, k;\n   cin >> t;\n   while (t--) {\n     cin >> n >> k;\n     for (int i = 0; i < n; ++i) cout << (char)(i % k + 'a');\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n;\n   scanf('%lld', &n);\n   long long int a[n];\n   long long int i, j, k;\n   long long int ans = 0;\n   k = 0;\n   for (i = 0; i < n; i++) {\n     scanf('%lld', &j);\n     if (j == 1) {\n       a[k++] = i;\n     }\n   }\n   if (k == 0) {\n     ans = 0;\n   } else if (k == 1) {\n     ans = 1;\n   } else {\n     ans = 1;\n     for (i = 1; i < k; i++) {\n       if ((a[i] - a[i - 1]) == 1) {\n         ans++;\n       } else {\n         ans += 2;\n       }\n     }\n   }\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int b[1000005], a[1000005];\n int main() {\n   int n, i;\n   scanf('%d', &n);\n   for (i = 0; i < n; i++) scanf('%d', &a[i]);\n   b[n - 1] = a[n - 1];\n   for (i = n - 2; i >= 0; i--) b[i] = a[i] + a[i + 1];\n   for (i = 0; i < n; i++) printf('%d ', b[i]);\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n namespace io {\n template <typename T>\n inline void read(T &x) {\n   bool flag = false;\n   char c = getchar();\n   while ((c < '0' || c > '9') && c != '-') c = getchar();\n   c == '-' ? flag = true, x = 0 : x = c - '0';\n   c = getchar();\n   while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0', c = getchar();\n   if (flag) x = -x;\n }\n template <typename T>\n inline void write(T x) {\n   char st[10010];\n   int cnt = 0;\n   if (x < 0) x = -x, putchar('-');\n   if (x == 0) putchar('0');\n   while (x) {\n     st[++cnt] = x % 10 + 48;\n     x /= 10;\n   }\n   while (cnt) {\n     putchar(st[cnt--]);\n   }\n }\n }  // namespace io\n using namespace io;\n int main() {\n   int a, ans = 0;\n   read(a);\n   while (a) {\n     ans += (a % 8 == 1);\n     a /= 8;\n   }\n   write(ans);\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = 300010;\n const int MOD = 1e9 + 7;\n struct xxx {\n   int id;\n   char c;\n } s[N];\n std::string a, b, c;\n int gap, n;\n int sa[N], lcp[N], rank[N], tmp[N], bucket[N], cnt[N][3], ans[N], dp[19][N],\n     fw[N];\n void update(int i, int v) {\n   while (i < N) {\n     fw[i] = (fw[i] + v) % MOD;\n     i += i & -i;\n   }\n }\n int query(int i) {\n   int res = 0;\n   while (i) {\n     res = (res + fw[i]) % MOD;\n     i -= i & -i;\n   }\n   if (res < 0) res += MOD;\n   return res;\n }\n int rmq(int f, int t) {\n   int k = 31 - __builtin_clz(t - f + 1);\n   int x = dp[k][f];\n   int y = dp[k][t - (1 << k) + 1];\n   if (lcp[x] < lcp[y]) return x;\n   return y;\n }\n void solve(int f, int t, int h) {\n   if (t - f + 1 < 3) return;\n   int m = rmq(f, t - 1);\n   int c0 = cnt[t][0] - cnt[f - 1][0];\n   int c1 = cnt[t][1] - cnt[f - 1][1];\n   int c2 = cnt[t][2] - cnt[f - 1][2];\n   int v = lcp[m];\n   int num = 1ll * c0 * c1 % MOD * c2 % MOD;\n   update(v + 1, -num);\n   update(h + 1, num);\n   solve(f, m, v);\n   solve(m + 1, t, v);\n }\n bool cmp2(int i, int j) {\n   i += gap;\n   j += gap;\n   if (i < n && j < n) return rank[i] < rank[j];\n   return i > j;\n }\n bool cmp(int i, int j) {\n   if (rank[i] != rank[j]) return rank[i] < rank[j];\n   i += gap;\n   j += gap;\n   if (i < n && j < n) return rank[i] < rank[j];\n   return i > j;\n }\n int main() {\n   std::cin >> a >> b >> c;\n   int an = int(a.size()), bn = int(b.size()), cn = int(c.size());\n   for (int i = 0; i < an; ++i) s[i].id = 0, s[i].c = a[i];\n   for (int i = 0; i < bn; ++i) s[i + an + 1].id = 1, s[i + an + 1].c = b[i];\n   for (int i = 0; i < cn; ++i)\n     s[i + an + bn + 2].id = 2, s[i + an + bn + 2].c = c[i];\n   s[an].c = 1;\n   s[an + bn + 1].c = 2;\n   n = an + bn + cn + 2;\n   int rn = 255;\n   for (int i = 0; i < n; ++i) {\n     sa[i] = i;\n     rank[i] = s[i].c;\n   }\n   for (gap = 1;; gap <<= 1) {\n     int p = 0;\n     for (int i = n - 1; i + gap >= n; --i) tmp[p++] = i;\n     std::fill(bucket, bucket + rn, 0);\n     for (int i = 0; i + gap < n; ++i) ++bucket[rank[i + gap]];\n     for (int i = 1; i < rn; ++i) bucket[i] += bucket[i - 1];\n     for (int i = 0; i + gap < n; ++i) tmp[--bucket[rank[i + gap]] + p] = i;\n     std::fill(bucket, bucket + rn, 0);\n     for (int i = 0; i < n; ++i) ++bucket[rank[i]];\n     for (int i = 1; i < rn; ++i) bucket[i] += bucket[i - 1];\n     for (int i = n - 1; i >= 0; --i) sa[--bucket[rank[tmp[i]]]] = tmp[i];\n     tmp[0] = 0;\n     for (int i = 1; i < n; ++i) tmp[i] = tmp[i - 1] + cmp(sa[i - 1], sa[i]);\n     for (int i = 0; i < n; ++i) rank[sa[i]] = tmp[i];\n     if (tmp[n - 1] == n - 1) break;\n     rn = tmp[n - 1] + 1;\n   }\n   for (int i = 0, k = 0; i < n; ++i) {\n     if (rank[i] == n - 1) continue;\n     for (int j = sa[rank[i] + 1]; s[i + k].c == s[j + k].c;) ++k;\n     lcp[rank[i]] = k;\n     if (k) --k;\n   }\n   for (int i = 0; i < n - 1; ++i) dp[0][i] = i;\n   for (int j = 1; 1 << j < n; ++j)\n     for (int i = 0; i + (1 << j) - 1 < n - 1; ++i) {\n       int x = dp[j - 1][i];\n       int y = dp[j - 1][i + (1 << (j - 1))];\n       dp[j][i] = lcp[x] < lcp[y] ? x : y;\n     }\n   assert(s[sa[0]].c == 1);\n   assert(s[sa[1]].c == 2);\n   for (int i = 2; i < n; ++i) {\n     cnt[i][0] = cnt[i - 1][0];\n     cnt[i][1] = cnt[i - 1][1];\n     cnt[i][2] = cnt[i - 1][2];\n     ++cnt[i][s[sa[i]].id];\n   }\n   int sz = std::min(an, std::min(bn, cn));\n   solve(2, n - 1, 0);\n   for (int i = 1; i <= sz; ++i) std::cout << query(i) << ' ';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/STACK:1073741824')\n using namespace std;\n const int N = 3e5 + 100;\n int col[N], d[N][2];\n vector<int> v[N];\n int main() {\n #pragma warning(disable : 4996)\n   int n, m;\n   scanf('%d%d', &n, &m);\n   for (int i = 0; i < m; i++) {\n     int a, b;\n     scanf('%d%d', &a, &b);\n     a--, b--;\n     v[a].push_back(b);\n     v[b].push_back(a);\n   }\n   queue<int> q;\n   for (int i = 0; i < n; i++) {\n     d[i][0] = v[i].size();\n     if (d[i][0] > 1) q.push(i);\n   }\n   while (!q.empty()) {\n     int node = q.front();\n     q.pop();\n     if (d[node][col[node]] > 1) {\n       col[node] ^= 1;\n       for (int to : v[node]) {\n         d[to][col[node]]++;\n         d[to][col[node] ^ 1]--;\n         if (d[to][col[to]] > 1) q.push(to);\n       }\n     }\n   }\n   for (int i = 0; i < n; i++) printf('%d', col[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1000005;\n const long long mod = 1e9 + 7;\n const int N = 1e6;\n vector<int> rec[maxn];\n long long fac[maxn], ans;\n int n, m;\n int ord[maxn], bit;\n bool comp(int a, int b) { return rec[a][bit] < rec[b][bit]; }\n void mysort(int l, int r, int j) {\n   if (l == r) return;\n   bit = j;\n   sort(ord + l, ord + r + 1, comp);\n   int p = l;\n   while (p <= r && rec[ord[p]][j] == -1) ++p;\n   int cnt = 1;\n   for (int i = l + 1; i < p; i++)\n     if (rec[ord[i]][j - 1] == rec[ord[i - 1]][j - 1])\n       ++cnt;\n     else {\n       (ans *= fac[cnt]) %= mod;\n       cnt = 1;\n     }\n   (ans *= fac[cnt]) %= mod;\n   int t = p;\n   while (t <= r) {\n     p = t;\n     while (p <= r && rec[ord[p]][j] == rec[ord[t]][j]) ++p;\n     mysort(t, p - 1, j + 1);\n     t = p;\n   }\n }\n int main() {\n   fac[0] = 1ll;\n   for (int i = 1; i <= N; i++) fac[i] = fac[i - 1] * i % mod;\n   scanf('%d %d', &n, &m);\n   for (int i = 1; i <= m; i++) rec[i].push_back(0);\n   for (int g, i = 1; i <= n; i++) {\n     scanf('%d', &g);\n     for (int v, j = 1; j <= g; j++) scanf('%d', &v), rec[v].push_back(i);\n   }\n   for (int i = 1; i <= m; i++) {\n     sort(rec[i].begin(), rec[i].end());\n     rec[i].push_back(-1);\n     ord[i] = i;\n   }\n   ans = 1ll;\n   mysort(1, m, 1);\n   printf('%lld\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int Power(int base, int exp) {\n   int ans = 1;\n   while (exp > 0) {\n     if (exp & 1) ans = (1LL * ans * base) % 1000000007;\n     exp = exp >> 1;\n     base = (1LL * base * base) % 1000000007;\n   }\n   return ans;\n }\n vector<map<long double, int> > p_CntS(2005);\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long int n;\n   cin >> n;\n   long double x[n], y[n];\n   for (int i = 0; i < n; i += 1) cin >> x[i] >> y[i];\n   long double slope;\n   for (int p1 = 0; p1 < n; p1 += 1)\n     for (int p2 = 0; p2 < n; p2 += 1) {\n       if (p1 == p2) continue;\n       slope = y[p2] - y[p1];\n       if (x[p2] - x[p1] == 0)\n         p_CntS[p1][600.0]++;\n       else\n         p_CntS[p1][300.0 + slope / (x[p2] - x[p1])]++;\n     }\n   long long int ans = (1LL * n * (n - 1) * (n - 2)) / 6, ans_ = 0;\n   int cnt;\n   for (int i = 0; i < n; i += 1) {\n     map<long double, int>::iterator it = p_CntS[i].begin();\n     while (it != p_CntS[i].end()) {\n       cnt = (*it).second;\n       ans_ += 1LL * cnt * (cnt - 1) / 2;\n       it++;\n     }\n   }\n   cout << ans - ans_ / 3 << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int ans = 0;\n double H = 100, len = 100000;\n int F[110000], T[110000], FF[110000], TT[110000];\n bool vis[110000];\n int judge(bool fuck, double st, double t) {\n   int ret = 0;\n   int top, flo;\n   double point = st;\n   memset(vis, 0, sizeof(vis));\n   while (point < len) {\n     top = (int)ceil(point);\n     flo = (int)floor(point);\n     if (fuck) {\n       if (T[top] < 0 || T[flo] < 0 || T[top] != T[flo]) {\n         return -1;\n       }\n       if (vis[TT[top]] == 1) return -1;\n       ret += T[top];\n       vis[TT[top]] = 1;\n       fuck = !fuck;\n     } else {\n       if (F[top] < 0 || F[flo] < 0 || F[top] != F[flo]) {\n         return -1;\n       }\n       if (vis[FF[top]] == 1) return -1;\n       ret += F[top];\n       vis[FF[top]] = 1;\n       fuck = !fuck;\n     }\n     point += t;\n   }\n   if (ans < ret) ans = ret;\n   return ret;\n }\n int work() {\n   int n, i, j, val, x, y;\n   char c;\n   double A, B, t;\n   double hl, hr;\n   scanf('%lf%lf%d', &hl, &hr, &n);\n   memset(T, -1, sizeof(T));\n   memset(F, -1, sizeof(F));\n   for (i = 1; i <= n; i++) {\n     scanf('%d %c%d%d', &val, &c, &x, &y);\n     if (c == 'T') {\n       for (j = x; j <= y; j++) T[j] = val, TT[j] = i;\n     } else {\n       for (j = x; j <= y; j++) F[j] = val, FF[j] = i;\n     }\n   }\n   A = hl / H;\n   B = hr / H;\n   for (i = 0; i <= 100; i++) {\n     if ((i & 1) == 0) {\n       t = len / (A + B + i);\n       judge(0, A * t, t);\n     }\n     if ((i & 1) == 1) {\n       t = len / ((1 - A) + B + i);\n       judge(1, (1 - A) * t, t);\n     }\n     if ((i & 1) == 1) {\n       t = len / (A + (1 - B) + i);\n       judge(0, A * t, t);\n     }\n     if ((i & 1) == 0) {\n       t = len / ((1 - A) + (1 - B) + i);\n       judge(1, (1 - A) * t, t);\n     }\n   }\n   printf('%d\n', ans);\n   return 1;\n }\n int main() {\n   work();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct point {\n   int x, y;\n   point() {}\n   point(int x, int y) : x(x), y(y) {}\n } p[1010];\n point operator-(const point &a, const point &b) {\n   return point(a.x - b.x, a.y - b.y);\n }\n long long operator*(const point &a, const point &b) {\n   return (long long)a.x * b.y - (long long)a.y * b.x;\n }\n int main() {\n   int n, i, x, y, low, high;\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> x >> y;\n     p[i] = point(x, y);\n   }\n   low = p[0].x;\n   high = p[1].x;\n   if (low > high) swap(low, high);\n   p[n] = p[0];\n   for (i = 0; i < n; i++) {\n     while (low <= high && (p[i + 1] - p[i]) * (point(low, p[0].y) - p[i]) > 0)\n       low++;\n     while (low <= high && (p[i + 1] - p[i]) * (point(high, p[0].y) - p[i]) > 0)\n       high--;\n   }\n   cout << high - low + 1 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 500000;\n const long long minx = -0x5fffffffffffffff;\n struct nn {\n   long long x, y;\n   nn() { y = minx; }\n };\n int n, u, v;\n nn num[N];\n vector<int> node[N];\n long long dfs(int f, int x) {\n   for (int i = 0; i < node[x].size(); i++) {\n     if (node[x][i] == f) continue;\n     long long r = dfs(x, node[x][i]);\n     num[x].y += r;\n   }\n   return num[x].y;\n }\n long long dfs1(int f, int x, long long &ans) {\n   long long m1 = minx;\n   long long m2 = minx;\n   for (int i = 0; i < node[x].size(); i++) {\n     if (node[x][i] == f) continue;\n     long long r = dfs1(x, node[x][i], ans);\n     if (m1 < r) {\n       m2 = m1;\n       m1 = r;\n     } else if (m2 < r) {\n       m2 = r;\n     }\n   }\n   if (m2 != minx) {\n     if (ans < m1 + m2) ans = m1 + m2;\n   }\n   return m1 > num[x].y ? m1 : num[x].y;\n }\n int main() {\n   long long ans;\n   while (scanf('%d', &n) != EOF) {\n     ans = minx;\n     for (int i = 0; i < N; i++) node[i].clear();\n     for (int i = 1; i <= n; i++) {\n       scanf('%lld', &num[i].x);\n       num[i].y = num[i].x;\n     }\n     for (int i = 0; i < n - 1; i++) {\n       scanf('%d%d', &u, &v);\n       node[u].push_back(v);\n       node[v].push_back(u);\n     }\n     dfs(0, 1);\n     dfs1(0, 1, ans);\n     if (ans != minx)\n       printf('%lld\n', ans);\n     else\n       printf('Impossible\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   int n, k;\n   cin >> n >> k;\n   if (k > (n * n + 1) / 2) {\n     cout << 'NO';\n     return 0;\n   }\n   cout << 'YES\n';\n   int tmp = 0;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < n; j++) {\n       if (j % 2 == i % 2 && tmp != k) {\n         cout << 'L';\n         tmp++;\n       } else\n         cout << 'S';\n     }\n     cout << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using namespace chrono;\n const int infinity = (int)1e9 + 42;\n const int64_t llInfinity = (int64_t)1e18 + 256;\n const int module = (int)1e9 + 7;\n const long double eps = 1e-8;\n mt19937_64 randGen(system_clock().now().time_since_epoch().count());\n inline void raiseError(string errorCode) {\n   cerr << 'Error : ' << errorCode << endl;\n   exit(42);\n }\n inline int readAns(int req) {\n   cout << req << endl;\n   int q;\n   cin >> q;\n   if (q == 0) {\n     exit(0);\n   }\n   return q;\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   int m, n;\n   cin >> m >> n;\n   vector<int> v(n);\n   for (int i = 0; i < n; i++) {\n     v[i] = readAns(m) * -1;\n   }\n   int l = 1, r = m - 1;\n   int p = 0;\n   while (l != r) {\n     int m = (l + r) / 2;\n     int ans = readAns(m) * v[p];\n     p++;\n     p %= n;\n     if (ans < 0) {\n       r = m - 1;\n     } else {\n       l = m + 1;\n     }\n   }\n   readAns(l);\n   assert(false);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int n, m;\n   string s, t;\n   cin >> n >> m >> s >> t;\n   bool can = false;\n   if (s == t)\n     can = true;\n   else {\n     if (n <= m + 1) {\n       for (int i = 0; i < int(n); i++) {\n         if (s[i] == '*') {\n           if (s.substr(0, i) == t.substr(0, i) &&\n               s.substr(i + 1, string::npos) ==\n                   t.substr(m - (n - (i + 1)), string::npos))\n             can = true;\n         }\n       }\n     }\n   }\n   cout << (can ? 'YES' : 'NO') << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[200001], b[200001], c[200001];\n int main() {\n   long long n, ans = 0;\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   for (int i = 0; i < n; i++) cin >> b[i];\n   for (int i = 0; i < n; i++) c[i] = a[i] - b[i];\n   sort(c, c + n);\n   for (int i = n - 1;; i--) {\n     if (c[i] <= 0) break;\n     int ans1 = &c[i] - upper_bound(c, c + n, 0 - c[i]);\n     ans += ans1;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 10;\n unsigned long long preLef[N], preRig[N], sum[N], a[N];\n map<unsigned long long, unsigned long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<string, int> m;\n   int ans = 0;\n   do {\n     bool flg = true;\n     map<string, int> 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 <iostream>\n #include <iosfwd>\n #include <iomanip>\n #include <cstdio>\n #include <cstring>\n #include <cstdlib>\n #include <ctime>\n #include <cmath>\n #include <cassert>\n #include <cctype>\n #include <climits>\n #include <vector>\n #include <bitset>\n #include <set>\n #include <queue>\n #include <math.h>\n #include <stack>\n #include <map>\n #include <deque>\n #include <string>\n #include <list>\n #include <iterator>\n #include <sstream>\n #include <complex>\n #include <fstream>\n #include <functional>\n #include <numeric>\n #include <utility>\n #include <algorithm>\n #include <assert.h>\n #include <unordered_map>\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 <bits/stdc++.h>\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<long long> 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<int> adj[300100];\n vector<pair<int, long long> > query[300100];\n SumSegTree segt(300005);\n long long ans[300100];\n void dfs(int u, int prev, int h) {\n   for (int(i) = 0; (i) < (int((query[u]).size())); (i)++) {\n     int dist = query[u][i].first;\n     long long value = query[u][i].second;\n     segt.add(h, min(N, h + dist), value);\n   }\n   ans[u] = segt.get_sum(h, h);\n   for (int(i) = 0; (i) < (int((adj[u]).size())); (i)++) {\n     int v = adj[u][i];\n     if (v == prev) continue;\n     dfs(v, u, h + 1);\n   }\n   for (int(i) = 0; (i) < (int((query[u]).size())); (i)++) {\n     int dist = query[u][i].first;\n     long long value = query[u][i].second;\n     segt.add(h, min(N, h + dist), -value);\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cout.precision(15);\n   cout << fixed;\n   cout.tie(0);\n   cin.tie(0);\n   cin >> N;\n   for (int(i) = 1; (i) <= (N - 1); (i)++) {\n     int a, b;\n     cin >> a >> b;\n     adj[a].push_back(b);\n     adj[b].push_back(a);\n   }\n   cin >> M;\n   for (int(i) = 1; (i) <= (M); (i)++) {\n     int v, d;\n     long long x;\n     cin >> v >> d >> x;\n     query[v].push_back(make_pair(d, x));\n   }\n   dfs(1, 0, 0);\n   for (int(i) = 1; (i) <= (N); (i)++)\n     cout << ans[i] << (i + 1 <= N ? ' ' : '\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   pair<int, int> home, uni;\n   cin >> home.first >> home.second >> uni.first >> uni.second;\n   int count;\n   cin >> count;\n   int solution = 0;\n   int64_t a, b, c;\n   for (int i = 0; i < count; i++) {\n     cin >> a >> b >> c;\n     bool h_p = a * home.first + b * home.second + c > 0;\n     bool u_p = a * uni.first + b * uni.second + c > 0;\n     if ((h_p && !u_p) || (!h_p && u_p)) {\n       solution++;\n     }\n   }\n   cout << solution << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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<long long int> 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<pair<long long int, pair<int, int>>> 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 <bits/stdc++.h>\n using namespace std;\n int L[100010];\n int P[100010][20];\n vector<int> pp[100010][20];\n int T[100010];\n vector<int> tt[100010];\n int arr[100010];\n vector<int> graph[100010];\n vector<int> fnc(vector<int> &a, vector<int> &b) {\n   vector<int> 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<int> 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<int> 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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int n, m;\n int a[107];\n map<string, int> f;\n vector<pair<int, string>> b;\n bool cmp(pair<int, string> u, pair<int, string> 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<string, int>::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 <bits/stdc++.h>\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<node> 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 <bits/stdc++.h>\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<int, int> &a, const pair<int, int> &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 <bits/stdc++.h>\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<edge> 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<nd> 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 <bits/stdc++.h>\n using namespace std;\n const int N = 1000008;\n int n, m, k, d, i, j, e;\n int tmp[N], pos[N], p[N], c[N];\n char s[N];\n int main() {\n   scanf('%s %d', s, &m);\n   n = strlen(s);\n   while (m--) {\n     scanf('%d%d', &k, &d);\n     for (i = 0; i < n; i++) {\n       c[i] = (i + 1) % n;\n       pos[i] = p[i] = i;\n     }\n     int t = 0;\n     for (i = 0; i < d; i++)\n       for (j = i; j < k; t++, j += d) p[t] = j;\n     for (i = 0; i < n; ++i) {\n       c[i] = p[c[i]];\n     }\n     for (e = n - k + 1; e; e >>= 1) {\n       for (i = 0; i < n; ++i) tmp[i] = c[i];\n       if (e & 1)\n         for (i = 0; i < n; ++i) pos[i] = c[pos[i]];\n       for (i = 0; i < n; ++i) c[i] = tmp[c[i]];\n     }\n     for (i = 0; i < n; ++i) tmp[(i + n - k + 1) % n] = s[pos[i]];\n     for (i = 0; i < n; ++i) putchar(s[i] = (char)tmp[i]);\n     putchar('\n');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n vector<int> ke[1000010];\n bool cx[1000010], visited[1000010];\n void dfs(int u) {\n   visited[u] = true;\n   for (int v : ke[u])\n     if (!visited[v]) dfs(v);\n }\n long long c2(int x) { return (1LL * x * (x - 1)) >> 1; }\n int main() {\n   if (fopen('a.txt', 'r')) {\n     freopen('a.txt', 'r', stdin);\n   } else\n     ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cin >> n >> m;\n   int own = 0;\n   for (int i = 1; i <= m; i++) {\n     int u, v;\n     cin >> u >> v;\n     cx[u] = true;\n     cx[v] = true;\n     if (u != v) {\n       ke[u].push_back(v);\n       ke[v].push_back(u);\n     } else\n       own++;\n   }\n   int cnt = 0;\n   for (int u = 1; u <= n; u++)\n     if (cx[u] && !visited[u]) {\n       dfs(u);\n       cnt++;\n     }\n   if (cnt != 1) {\n     cout << 0;\n     exit(0);\n   };\n   long long res = 0;\n   for (int i = 1; i <= n; i++) res += c2(int(ke[i].size()));\n   res += c2(own);\n   res += 1LL * own * (m - own);\n   cout << res;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int get_point(int N) {\n   int score[10] = {25, 18, 15, 12, 10, 8, 6, 4, 2, 1};\n   if (N > 10) return 0;\n   return score[N - 1];\n }\n int main() {\n   int T;\n   map<string, int> n_map;\n   map<string, string> n_win;\n   cin >> T;\n   for (int i = 0; i < (T); ++i) {\n     int N;\n     cin >> N;\n     for (int j = 0; j < (N); ++j) {\n       string t_s;\n       cin >> t_s;\n       n_map[t_s] += get_point(j + 1);\n       if (n_win[t_s] == '')\n         n_win[t_s] = '0000000000000000000000000000000000000000000000000000';\n       n_win[t_s][j] += 1;\n     }\n   }\n   map<string, int>::iterator it;\n   int n_max1 = 0, n_max2 = 0;\n   string n_ret1 = '', n_ret2 = '';\n   n_win[''] = '0000000000000000000000000000000000000000000000000000';\n   for (it = n_map.begin(); it != n_map.end(); it++) {\n     if (n_max1 < (*it).second) {\n       n_ret1 = (*it).first;\n       n_max1 = (*it).second;\n     }\n     if (n_max1 == (*it).second && n_win[n_ret1] < n_win[(*it).first]) {\n       n_ret1 = (*it).first;\n       n_max1 = (*it).second;\n     }\n     if (n_win[n_ret2][0] < n_win[(*it).first][0]) {\n       n_ret2 = (*it).first;\n       n_max2 = (*it).second;\n     }\n     if (n_win[n_ret2][0] == n_win[(*it).first][0] && n_max2 < (*it).second) {\n       n_ret2 = (*it).first;\n       n_max2 = (*it).second;\n     }\n     if (n_win[n_ret2][0] == n_win[(*it).first][0] && n_max2 == (*it).second) {\n       if (n_win[n_ret2] < n_win[(*it).first]) {\n         n_ret2 = (*it).first;\n         n_max2 = (*it).second;\n       }\n     }\n   }\n   cout << n_ret1 << endl;\n   cout << n_ret2 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 300005;\n int n, m, ans, two, one, l, r, k, a[N], dp[N][205];\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n     a[i] /= 100;\n   }\n   memset(dp, 127, sizeof(dp));\n   dp[0][0] = 0;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j <= 200; j++)\n       if (dp[i][j] <= 2e8) {\n         if (j + a[i + 1] / 10 <= 200)\n           dp[i + 1][j + a[i + 1] / 10] =\n               min(dp[i + 1][j + a[i + 1] / 10], dp[i][j] + a[i + 1]);\n         if (j >= a[i + 1])\n           dp[i + 1][j - a[i + 1]] = min(dp[i + 1][j - a[i + 1]], dp[i][j]);\n         else\n           dp[i + 1][0] = min(dp[i + 1][0], dp[i][j] + (a[i + 1] - j));\n       }\n   }\n   int ans = 2e9;\n   for (int i = 0; i <= 200; i++) {\n     ans = min(ans, dp[n][i]);\n   }\n   printf('%d00\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 40;\n const int F = N / 2 + N % 2;\n const int S = N - F;\n const long long N_MASKS = (1ll << N);\n const long long F_MASKS = (1ll << F);\n const long long S_MASKS = (1ll << S);\n double liquid;\n int n, f, s;\n long long adj[N];\n int firstSizes[F_MASKS];\n long long firstAvailables[F_MASKS];\n int secondSizes[S_MASKS];\n long long secondAvailables[S_MASKS];\n int maxPossible[S_MASKS];\n void readData() {\n   cin >> n >> liquid;\n   f = n / 2 + n % 2;\n   s = n - f;\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < n; ++j) {\n       long long a;\n       cin >> a;\n       adj[i] |= (a << j);\n     }\n   }\n }\n void findCliques(int sta, int cur, int fin, long long mask, int size,\n                  long long available, int* sizes, long long* availables) {\n   if (cur == fin) {\n     return;\n   }\n   findCliques(sta, cur + 1, fin, mask, size, available, sizes, availables);\n   if ((1ll << cur) & available) {\n     mask |= (1ll << cur);\n     ++size;\n     available &= adj[cur];\n     sizes[mask >> sta] = size;\n     availables[mask >> sta] = available;\n     findCliques(sta, cur + 1, fin, mask, size, available, sizes, availables);\n   }\n }\n int findPossibles(long long available) {\n   if (maxPossible[available]) {\n     return maxPossible[available];\n   }\n   if (available == 0) {\n     return 0;\n   }\n   if (secondSizes[available]) {\n     return maxPossible[available] = secondSizes[available];\n   }\n   for (int i = 0; i < s; ++i) {\n     if (available & (1ll << i)) {\n       maxPossible[available] =\n           max(maxPossible[available], findPossibles(available & ~(1ll << i)));\n     }\n   }\n   return maxPossible[available];\n }\n int findMaxClique() {\n   findCliques(0, 0, f, 0, 0, (1ll << n) - 1, firstSizes, firstAvailables);\n   findCliques(f, f, n, 0, 0, (1ll << n) - 1, secondSizes, secondAvailables);\n   int res = findPossibles((1 << s) - 1);\n   for (int mask = 0; mask < (1 << f); ++mask) {\n     if (firstSizes[mask]) {\n       res = max(res,\n                 firstSizes[mask] + findPossibles(firstAvailables[mask] >> f));\n     }\n   }\n   return res;\n }\n double solve() {\n   int x = findMaxClique();\n   return 0.5 * liquid * liquid * (x - 1.) / x;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cout << setprecision(20) << fixed;\n   readData();\n   cout << solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};\n long long power(long long a, long long b) {\n   long long res = 1;\n   while (b) {\n     if (b % 2) res = (res * a) % 5;\n     b = b >> 1;\n     a = (a * a) % 5;\n   }\n   return res;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long i, n, t;\n   cin >> n >> t;\n   long long ans = 1e16;\n   pair<long long, long long> p;\n   for (i = 0; i < t; i++) {\n     long long a, b;\n     cin >> a >> b;\n     if (b - a + 1 < ans) {\n       ans = b - a + 1;\n     }\n   }\n   cout << ans << '\n';\n   long long c = 0;\n   for (i = 0; i < n; i++) {\n     if (i % ans == 0) {\n       c = 0;\n       cout << c << ' ';\n       c++;\n     } else {\n       cout << c << ' ';\n       c++;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 200005;\n vector<int> lk[maxn];\n int fa[maxn], dep[maxn], a[maxn], b[maxn], n;\n void dfs(int now, int pre) {\n   fa[now] = pre;\n   dep[now] = dep[pre] + 1;\n   for (auto p : lk[now])\n     if (p != pre) dfs(p, now);\n }\n vector<int> cir;\n int rt, lp, lq;\n bool find_circle() {\n   cir.clear();\n   static bool vis[maxn];\n   int p = 0;\n   for (int i = 1; i <= n; i++)\n     if (a[i] != b[i] && dep[i] > dep[p]) p = i;\n   if (!p) return 1;\n   for (int u = p; vis[u] = 1, cir.push_back(u), a[fa[u]] != b[fa[u]]; u = fa[u])\n     ;\n   int q = 0;\n   for (int i = 1; i <= n; i++)\n     if (a[i] != b[i] && !vis[i] && dep[i] > dep[q]) q = i;\n   if (q) {\n     reverse(cir.begin(), cir.end());\n     for (int u = q; vis[u] = 1, cir.push_back(u), a[fa[u]] != b[fa[u]];\n          u = fa[u])\n       ;\n   } else\n     q = fa[cir.back()];\n   for (int i = 1; i <= n; i++)\n     if (a[i] != b[i] && !vis[i]) return 0;\n   int u, v;\n   for (u = p, v = q; u != v; u = fa[u])\n     if (dep[u] < dep[v]) swap(u, v);\n   rt = u;\n   if (cir.size() != dep[p] + dep[q] - 2 * dep[rt]) return 0;\n   lp = p, lq = q;\n   return 1;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]);\n   for (int i = 1; i <= n; i++) scanf('%d', &b[i]);\n   for (int i = 1, u, v; i < n; i++) {\n     scanf('%d%d', &u, &v);\n     lk[u].push_back(v), lk[v].push_back(u);\n   }\n   int pa = find(a + 1, a + n + 1, 0) - a, pb = find(b + 1, b + n + 1, 0) - b;\n   dep[0] = -1;\n   dfs(pb, 0);\n   for (int u = pa; u != pb; u = fa[u]) swap(a[u], a[fa[u]]);\n   long long ans = dep[pa];\n   if (!find_circle()) {\n     printf('-1\n');\n     return 0;\n   }\n   if (!cir.size()) {\n     printf('0 %d\n', ans);\n     return 0;\n   }\n   int gap = 0, len = cir.size();\n   for (int i = 0; i < len; i++)\n     if (b[cir[i]] == a[cir[0]]) gap = i;\n   for (int i = 1; i < len; i++)\n     if (b[cir[(i + gap) % len]] != a[cir[i]]) {\n       printf('-1\n');\n       return 0;\n     }\n   static bool vis[maxn];\n   for (int i = pa; i; i = fa[i]) vis[i] = 1;\n   if (vis[cir[0]] || vis[cir.back()]) {\n     if (vis[cir.back()]) reverse(cir.begin(), cir.end()), gap = len - gap;\n     int po = cir.size();\n     for (int i = 0; i < cir.size(); i++)\n       if (!vis[cir[i]]) {\n         po = i;\n         break;\n       }\n     ans = ans - po +\n           min(po + gap * 1ll * (len + 1),\n               abs((len - gap) * 1ll * (len + 1) - po));\n   } else\n     ans = (ans + min(gap, len - gap) * 1ll * (len + 1));\n   for (; !vis[rt]; rt = fa[rt]) ans += 2;\n   if (lp > lq) swap(lq, lp);\n   printf('%d %d %lld\n', lp, lq, ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 5010;\n struct Edge {\n   int v, u, f, r, c;\n   Edge() {}\n   Edge(int v, int u, int f, int c, int r) : v(v), u(u), f(f), c(c), r(r) {}\n };\n const int inf = 1e9;\n const int C = 4000;\n int n, m, k, nflow, s, t, parent[N], number[N], a[N], b[N];\n int dist[N], pl[N];\n vector<Edge> g[N];\n queue<pair<int, int> > q;\n vector<int> ga, gb;\n void addEdge(int a, int b, int u, int c) {\n   g[a].push_back(Edge(b, u, 0, c, g[b].size()));\n   g[b].push_back(Edge(a, 0, 0, -c, g[a].size() - 1));\n }\n int MinCostFlow() {\n   int flow = 0;\n   int cost = 0;\n   while (true) {\n     for (int i = 1; i <= nflow; i++) dist[i] = inf;\n     dist[s] = 0;\n     q.push(make_pair(0, s));\n     while (!q.empty()) {\n       int v = (q.front()).second;\n       int d = -(q.front()).first;\n       q.pop();\n       if (dist[v] != d) continue;\n       if (d == inf) break;\n       for (int i = 0; i < g[v].size(); i++)\n         if (g[v][i].f < g[v][i].u && dist[g[v][i].v] > d + g[v][i].c) {\n           dist[g[v][i].v] = d + g[v][i].c;\n           q.push(make_pair(-dist[g[v][i].v], g[v][i].v));\n           number[g[v][i].v] = i;\n           parent[g[v][i].v] = v;\n         }\n     }\n     if (dist[t] == inf) break;\n     int v = t, addflow = 1e9;\n     while (v != s) {\n       int u = parent[v];\n       addflow = min(addflow, g[u][number[v]].u - g[u][number[v]].f);\n       v = u;\n     }\n     v = t;\n     while (v != s) {\n       int u = parent[v];\n       cost += addflow * g[u][number[v]].c;\n       g[u][number[v]].f += addflow;\n       g[v][g[u][number[v]].r].f -= addflow;\n       v = u;\n     }\n     flow += addflow;\n   }\n   return cost;\n }\n int main() {\n   scanf('%d%d%d', &n, &m, &k);\n   for (int i = 1; i <= n; i++) scanf('%d', &a[i]);\n   for (int i = 1; i <= n; i++) scanf('%d', &b[i]);\n   s = n + 3;\n   t = n + 4;\n   for (int i = 1; i <= n; i++) {\n     addEdge(n + 1, i, 1, -a[i]);\n     addEdge(n + 2, i, 1, -b[i]);\n   }\n   addEdge(s, n + 1, m, 0);\n   addEdge(s, n + 2, k, 0);\n   for (int i = 1; i <= n; i++) {\n     addEdge(i, t, 1, 0);\n   }\n   nflow = n + 4;\n   int ans = -MinCostFlow();\n   cout << ans << endl;\n   for (int j = 0; j < g[n + 1].size(); j++) {\n     int v = g[n + 1][j].v;\n     if (v >= 1 && v <= n && g[n + 1][j].f == 1) {\n       ga.push_back(v);\n     }\n   }\n   for (int j = 0; j < g[n + 2].size(); j++) {\n     int v = g[n + 2][j].v;\n     if (v >= 1 && v <= n && g[n + 2][j].f == 1) {\n       gb.push_back(v);\n     }\n   }\n   for (int i = 0; i < ga.size(); i++) cout << ga[i] << ' ';\n   cout << endl;\n   for (int i = 0; i < gb.size(); i++) cout << gb[i] << ' ';\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 5;\n int n;\n double a[N];\n double max_poor(double x) {\n   int i;\n   double pre, mpre, ret = 0;\n   pre = mpre = 0;\n   for (i = 0; i < n; i++) {\n     pre += a[i] - x;\n     ret = max(ret, abs(pre - mpre));\n     mpre = min(mpre, pre);\n   }\n   pre = mpre = 0;\n   for (i = 0; i < n; i++) {\n     pre += a[i] - x;\n     ret = max(ret, abs(pre - mpre));\n     mpre = max(mpre, pre);\n   }\n   return ret;\n }\n int main() {\n   cin.tie(0);\n   ios::sync_with_stdio(0);\n   int i;\n   double l = 0.0, h = 0.0, m1, m2;\n   cin >> n;\n   for (i = 0; i < n; h = max(h, abs(a[i])), i++) cin >> a[i];\n   l = -h;\n   for (i = 0; i < 300; i++) {\n     m1 = l + (h - l) / 3;\n     m2 = h - (h - l) / 3;\n     if (max_poor(m1) > max_poor(m2))\n       l = m1;\n     else\n       h = m2;\n   }\n   printf('%.17f\n', max_poor(l));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long long MOD = 1000000007;\n const int MAX = 1e9 + 7;\n const int MIN = -1e9 + 7;\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long b, g;\n   cin >> b >> g;\n   long long n;\n   cin >> n;\n   if (b >= n && g >= n) {\n     cout << n + 1;\n   } else if (b + g == n) {\n     cout << 1;\n   } else if (b >= n || g >= n) {\n     cout << min(b, g) + 1;\n   } else {\n     cout << b + g - n + 1;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<pt>& 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<pt> reorganize(vector<pt>& P) {\n   int n = int(P.size());\n   vector<pt> 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<pt> convexPolygonSum(vector<pt>& P, vector<pt>& Q) {\n   P = reorganize(P);\n   Q = reorganize(Q);\n   int n = int(P.size()), m = int(Q.size());\n   vector<pt> 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<pt> 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<pt>& 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<pt> P1(l + 1);\n     for (int i = 0; i < l; ++i) {\n       cin >> P1[i];\n     }\n     cin >> n;\n     vector<pt> P2(n + 1);\n     for (int i = 0; i < n; ++i) {\n       cin >> P2[i];\n     }\n     cin >> m;\n     vector<pt> 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<pt> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n template <typename T>\n using min_heap = priority_queue<T, vector<T>, greater<T>>;\n struct RangeIncrement {\n   vector<long long> 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 <class T>\n struct DisjointRanges {\n   struct Range {\n     int l, r;\n     T x;\n     Range(int l, const pair<int, T>& p) : l(l), r(p.first), x(p.second) {}\n   };\n   map<int, pair<int, T>> s;\n   vector<Range> update(int l, int r, T x) {\n     vector<Range> 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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n const ll INF = 1e14 + 7;\n using vi = vector<int>;\n using pii = pair<int, int>;\n using pli = pair<ll, int>;\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 <bits/stdc++.h>\n using namespace std;\n int a[200005];\n int b[200005];\n bool f[200005];\n int main() {\n   int q, n;\n   cin >> q;\n   while (q--) {\n     cin >> n;\n     for (int i = 1; i <= n; i++) {\n       cin >> a[i];\n       b[i] = 1;\n       f[i] = 0;\n     }\n     for (int i = 1; i <= n; i++) {\n       int j = i;\n       if (f[i] == 1) continue;\n       f[i] = 1;\n       int ctr = 1;\n       while (a[j] != i) {\n         ctr++;\n         f[j] = 1;\n         j = a[j];\n       }\n       j = i;\n       while (a[j] != i) {\n         b[j] = ctr;\n         j = a[j];\n       }\n     }\n     for (int i = 1; i <= n; i++) cout << b[i] << ' ';\n     cout << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n inline int readChar();\n template <class T = int>\n inline T readInt();\n template <class T>\n inline void writeInt(T x, char end = 0);\n inline void writeChar(int x);\n inline void writeWord(const char* s);\n static const int buf_size = 4096;\n inline int getChar() {\n   static char buf[buf_size];\n   static int len = 0, pos = 0;\n   if (pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin);\n   if (pos == len) return -1;\n   return buf[pos++];\n }\n inline int readChar() {\n   int c = getChar();\n   while (c <= 32) c = getChar();\n   return c;\n }\n template <class T>\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 <class T>\n inline void writeInt(T x, char end) {\n   if (x < 0) writeChar('-'), x = -x;\n   char s[24];\n   int n = 0;\n   while (x || !n) s[n++] = '0' + x % 10, x /= 10;\n   while (n--) writeChar(s[n]);\n   if (end) writeChar(end);\n }\n inline void writeWord(const char* s) {\n   while (*s) writeChar(*s++);\n }\n struct Flusher {\n   ~Flusher() {\n     if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;\n   }\n } flusher;\n using namespace std;\n struct static_graph {\n   int colors[500000];\n   int firstv[500000];\n   set<int> pool;\n   static const int N = 500000;\n   static const int M = 900000;\n   struct edge {\n     int v;\n     edge* next;\n   } edges[M];\n   int nedges;\n   struct node {\n     vector<int>* ice;\n     int prev_colors;\n     bool depth_use;\n     edge* firstedge;\n     inline void init() { firstedge = NULL; };\n     inline edge* add_edge(edge* e) {\n       e->next = firstedge;\n       firstedge = e;\n       return firstedge;\n     };\n   } nodes[N];\n   int nnodes;\n   static_graph() { nnodes = 0, nedges = 0; };\n   inline node& new_node() {\n     node& r = nodes[nnodes++];\n     return r;\n   }\n   inline edge* new_edge() { return &(edges[nedges++]); };\n   inline edge* add_edge(int a, int b) {\n     edge* e = new_edge();\n     e->v = b;\n     return nodes[a].add_edge(e);\n   };\n   inline void add_bi_edge(int a, int b) {\n     add_edge(a, b);\n     add_edge(b, a);\n   };\n   void depth_go(int index, int prev) {\n     node& cur = nodes[index];\n     if (cur.depth_use++) return;\n     for (int x : (*cur.ice))\n       if (colors[x]) pool.erase(colors[x]);\n     for (int x : (*cur.ice))\n       if (!colors[x]) {\n         colors[x] = (*pool.upper_bound(0));\n         firstv[x] = index;\n         pool.erase(colors[x]);\n       }\n     for (int x : (*cur.ice)) pool.insert(colors[x]);\n     for (edge* e = cur.firstedge; e; e = e->next) {\n       depth_go(e->v, index);\n     };\n   };\n   void depth_run(int first) {\n     chrono::time_point<chrono::high_resolution_clock> start, end;\n     start = std::chrono::high_resolution_clock::now();\n     for (int i = 0; i < nnodes; i++) {\n       node& cur = nodes[i];\n       cur.depth_use = false;\n     };\n     depth_go(first, -1);\n   };\n   vector<node*> depth_to_wide(int first) {}\n   void read_graph(istream* f){};\n };\n static_graph g;\n int main() {\n   istream& f = cin;\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   chrono::time_point<chrono::high_resolution_clock> start, end;\n   start = std::chrono::high_resolution_clock::now();\n   int n, m, c, x = 0;\n   n = readInt<int>();\n   m = readInt<int>();\n   for (int i = 0; i < n; i++) {\n     c = readInt<int>();\n     static_graph::node& cur = g.new_node();\n     cur.ice = new vector<int>();\n     cur.ice->resize(c);\n     cur.prev_colors = 0;\n     for (int t = 0; t < c; t++) {\n       x = readInt<int>();\n       (*cur.ice)[t] = x - 1;\n     };\n     sort((*cur.ice).begin(), (*cur.ice).end());\n     ;\n   };\n   for (int i = 0; i < n - 1; i++) {\n     int a, b;\n     a = readInt<int>(), b = readInt<int>();\n     g.add_bi_edge(a - 1, b - 1);\n   };\n   for (int i = 0; i < m; i++) g.colors[i] = 0;\n   for (int i = 0; i < m; i++) g.pool.insert(i + 1);\n   g.depth_run(0);\n   int mx = 1;\n   for (int i = 0; i < m; i++) {\n     mx = max(mx, g.colors[i]);\n     if (!g.colors[i]) g.colors[i] = 1;\n   }\n   cout << mx << endl;\n   for (int i = 0; i < m; i++) cout << g.colors[i] << ' ';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long pw(long long a, long long b) {\n   if (b == 0) return 1;\n   if (b % 2 == 1)\n     return (a * pw(a * a, b / 2));\n   else\n     return (1 * pw(a * a, b / 2));\n }\n void solve() {\n   long long n, k;\n   cin >> n >> k;\n   long long a[n], b[k];\n   for (int i = 0; i < n; i++) cin >> a[i];\n   sort(a, a + n);\n   int n1 = 0;\n   for (int i = 0; i < k; i++) {\n     cin >> b[i];\n     if (b[i] == 1) n1++;\n   }\n   sort(b, b + k);\n   long long ans = 0;\n   for (int i = 0; i < n1; i++) ans += (a[n - 1 - i] * 2);\n   long long st = 0, en = n - 1 - n1;\n   for (long long i = k - 1; i >= n1; i--) {\n     if (b[i] == 1) {\n       ans += (a[en] * 2);\n       en--;\n     } else {\n       ans += a[en];\n       b[i]--;\n       en--;\n       ans += a[st];\n       st += b[i];\n     }\n   }\n   cout << ans << endl;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long t = 1;\n   cin >> t;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct node {\n   long long lvl1, lvl2, id;\n };\n node t[500005];\n bool cmp(struct node x, struct node y) {\n   if (x.lvl1 < y.lvl1)\n     return true;\n   else\n     return false;\n }\n vector<node> sh;\n vector<long long> adj[500005];\n long long vis[500005], lvl1[500005], lvl2[500005];\n void bfs1(long long n = 1) {\n   queue<long long> q;\n   q.push(n);\n   vis[n] = 1;\n   lvl1[n] = 0;\n   while (!q.empty()) {\n     long long x = q.front();\n     q.pop();\n     for (auto &cv : adj[x]) {\n       if (vis[cv]) continue;\n       q.push(cv);\n       vis[cv] = 1;\n       lvl1[cv] = lvl1[x] + 1;\n     }\n   }\n }\n void bfs2(long long n) {\n   queue<long long> q;\n   q.push(n);\n   vis[n] = 1;\n   lvl2[n] = 0;\n   while (!q.empty()) {\n     long long x = q.front();\n     q.pop();\n     for (auto &cv : adj[x]) {\n       if (vis[cv]) continue;\n       q.push(cv);\n       vis[cv] = 1;\n       lvl2[cv] = lvl2[x] + 1;\n     }\n   }\n }\n node combine(node x, node y) {\n   if (x.lvl2 > y.lvl2)\n     return x;\n   else\n     return y;\n }\n void build(long long n) {\n   for (long long i = n - 1; i > 0; --i)\n     t[i] = combine(t[i << 1], t[i << 1 | 1]);\n }\n node query(long long l, long long r, long long n) {\n   node res;\n   res.lvl2 = res.lvl1 = res.id = 0;\n   for (l += n, r += n; l < r; l >>= 1, r >>= 1) {\n     if (l & 1) res = (combine(t[l++], res));\n     if (r & 1) res = combine(t[--r], res);\n   }\n   return res;\n }\n long long arr[500005];\n int32_t main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   long long i, j, k, l, m, n, x, y;\n   cin >> n >> m >> k;\n   for (i = 0; i < k; i++) {\n     cin >> arr[i];\n   }\n   for (i = 0; i < m; i++) {\n     cin >> x;\n     cin >> y;\n     adj[x].push_back(y);\n     adj[y].push_back(x);\n   }\n   bfs1();\n   memset(vis, 0, sizeof vis);\n   bfs2(n);\n   for (i = 0; i < k; i++) {\n     node temp;\n     temp.id = arr[i];\n     temp.lvl1 = lvl1[arr[i]];\n     temp.lvl2 = lvl2[arr[i]];\n     sh.push_back(temp);\n   }\n   sort(sh.begin(), sh.end(), cmp);\n   for (i = 0; i < sh.size(); i++) {\n     t[i + k].lvl1 = sh[i].lvl1;\n     t[i + k].lvl2 = sh[i].lvl2;\n     t[i + k].id = sh[i].id;\n   }\n   build(k);\n   long long ans = 0;\n   for (i = 0; i + 1 < sh.size(); i++) {\n     long long temp;\n     temp = sh[i].lvl1;\n     temp++;\n     temp += query(i + 1, sh.size(), sh.size()).lvl2;\n     ans = max(ans, temp);\n   }\n   cout << min(lvl2[1], ans) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma warning(disable : 4786)\n #pragma comment(linker, '/STACK:102400000,102400000')\n using namespace std;\n const double eps = 1e-8;\n const double PI = acos(-1.0);\n const int MAXN = 200005;\n const int mod = 1000000007;\n const long long llinf = (long long)(1e18) + 500;\n const int inf = 0x3f3f3f3f;\n int x[1005];\n double y[1005];\n int main() {\n   int i, j, k, m;\n   int n, r;\n   scanf('%d%d', &n, &r);\n   for (i = 1; i <= n; i++) {\n     scanf('%d', x + i);\n     y[i] = r * 1.0;\n   }\n   for (i = 2; i <= n; i++) {\n     for (j = i - 1; j >= 1; j--) {\n       int dx = abs(x[i] - x[j]);\n       if (dx > 2 * r) continue;\n       y[i] = max(y[i], y[j] + sqrt(4 * r * r * 1.0 - dx * 1.0 * dx));\n     }\n   }\n   for (i = 1; i <= n; i++) {\n     printf('%.10lf%c', y[i], i == n ? '\n' : ' ');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char str[1000005 + 1];\n int main() {\n   int ans = 0, i;\n   stack<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n map<long long int, int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int n, m, a, b;\n set<pair<int, int> > s;\n set<int> sc;\n vector<int> 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<int> 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<int>::iterator it;\n         set<int> 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 <bits/stdc++.h>\n #pragma comment(linker, '/STACK:10000000')\n using namespace std;\n template <typename T>\n inline T abs(T a) {\n   return ((a < 0) ? -a : a);\n }\n template <typename T>\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<pair<int, int> > 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<int, int>(-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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const long long MAX = 10e5;\n vector<long long> graph[MAX];\n queue<long long> 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 <bits/stdc++.h>\n using namespace std;\n void solve() {\n   string s;\n   cin >> s;\n   string ans = '';\n   int cnt(0);\n   for (int i = 0; i < s.size(); i++) {\n     if (s[i] == '0' && cnt == 0) {\n       cnt++;\n     } else\n       ans += s[i];\n   }\n   if (cnt == 0) {\n     for (int i = 0; i < ans.size() - 1; i++) cout << ans[i];\n   } else\n     cout << ans;\n }\n int main() {\n   long long t;\n   t = 1;\n   while (t--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};\n const int N = 500005;\n vector<int> arr[N], cnt[N], adj[N];\n int vis[N], st[N], fin[N], dep[N];\n int tim;\n char inp[N];\n void dfs(int i, int d) {\n   vis[i] = 1;\n   dep[i] = d;\n   st[i] = ++tim;\n   arr[d].push_back(st[i]);\n   int no = 0;\n   for (int first = 0; first < (int)26; first++)\n     no |= (first == inp[i] - 'a') << first;\n   cnt[d].push_back(no);\n   for (int v : adj[i])\n     if (!vis[v]) dfs(v, d + 1);\n   fin[i] = ++tim;\n }\n signed main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < (int)n - 1; i++) {\n     int first;\n     cin >> first;\n     adj[first].push_back(i + 2);\n     adj[i + 2].push_back(first);\n   }\n   for (int i = 0; i < (int)n; i++) cin >> inp[i + 1];\n   dfs(1, 0);\n   for (int i = 0; i < (int)N; i++) {\n     for (int j = 1; j < cnt[i].size(); j++) {\n       cnt[i][j] ^= cnt[i][j - 1];\n     }\n   }\n   for (int wrd = 0; wrd < (int)m; wrd++) {\n     int a, b;\n     cin >> a >> b;\n     b--;\n     int no_odds = 0;\n     vector<int>& v = arr[b];\n     int l = lower_bound((v).begin(), (v).end(), st[a]) - v.begin();\n     int r = upper_bound((v).begin(), (v).end(), fin[a]) - v.begin() - 1;\n     if (l > r) {\n       cout << 'Yes\n';\n       continue;\n     }\n     for (int first = 0; first < (int)26; first++) {\n       int add = (cnt[b][r] >> first) & 1;\n       int sub = (l == 0) ? 0 : ((cnt[b][l - 1] >> first) & 1);\n       no_odds += (add - sub + 2) % 2;\n     }\n     if (no_odds <= 1)\n       cout << 'Yes\n';\n     else\n       cout << 'No\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int t;\n   cin >> t;\n   while (t--) {\n     long long int a[3], i;\n     for (i = 0; i < 3; i++) cin >> a[i];\n     sort(a, a + 3);\n     if (a[2] <= a[1] + a[0] + 1)\n       cout << 'YES' << endl;\n     else\n       cout << 'NO' << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string to_string(string s) { return ''' + s + '''; }\n string to_string(const char* s) { return to_string((string)s); }\n string to_string(bool b) { return (b ? 'true' : 'false'); }\n template <typename A, typename B>\n string to_string(pair<A, B> p) {\n   return '(' + to_string(p.first) + ', ' + to_string(p.second) + ')';\n }\n template <typename A>\n string to_string(A v) {\n   bool first = true;\n   string res = '{';\n   for (const auto& x : v) {\n     if (!first) {\n       res += ', ';\n     }\n     first = false;\n     res += to_string(x);\n   }\n   res += '}';\n   return res;\n }\n void debug_out() { cerr << endl; }\n template <typename Head, typename... Tail>\n void debug_out(Head H, Tail... T) {\n   cerr << ' ' << to_string(H);\n   debug_out(T...);\n }\n template <int MOD_>\n struct modnum {\n   static constexpr int MOD = MOD_;\n   static_assert(MOD_ > 0, 'MOD must be positive');\n \n  private:\n   using ll = long long;\n   int v;\n   static int minv(int a, int m) {\n     a %= m;\n     assert(a);\n     return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a);\n   }\n \n  public:\n   modnum() : v(0) {}\n   modnum(ll v_) : v(int(v_ % MOD)) {\n     if (v < 0) v += MOD;\n   }\n   explicit operator int() const { return v; }\n   friend std::ostream& operator<<(std::ostream& out, const modnum& n) {\n     return out << int(n);\n   }\n   friend std::istream& operator>>(std::istream& in, modnum& n) {\n     ll v_;\n     in >> v_;\n     n = modnum(v_);\n     return in;\n   }\n   friend bool operator==(const modnum& a, const modnum& b) {\n     return a.v == b.v;\n   }\n   friend bool operator!=(const modnum& a, const modnum& b) {\n     return a.v != b.v;\n   }\n   modnum inv() const {\n     modnum res;\n     res.v = minv(v, MOD);\n     return res;\n   }\n   friend modnum inv(const modnum& m) { return m.inv(); }\n   modnum neg() const {\n     modnum res;\n     res.v = v ? MOD - v : 0;\n     return res;\n   }\n   friend modnum neg(const modnum& m) { return m.neg(); }\n   modnum operator-() const { return neg(); }\n   modnum operator+() const { return modnum(*this); }\n   modnum& operator++() {\n     v++;\n     if (v == MOD) v = 0;\n     return *this;\n   }\n   modnum& operator--() {\n     if (v == 0) v = MOD;\n     v--;\n     return *this;\n   }\n   modnum& operator+=(const modnum& o) {\n     v -= MOD - o.v;\n     v = (v < 0) ? v + MOD : v;\n     return *this;\n   }\n   modnum& operator-=(const modnum& o) {\n     v -= o.v;\n     v = (v < 0) ? v + MOD : v;\n     return *this;\n   }\n   modnum& operator*=(const modnum& o) {\n     v = int(ll(v) * ll(o.v) % MOD);\n     return *this;\n   }\n   modnum& operator/=(const modnum& o) { return *this *= o.inv(); }\n   friend modnum operator++(modnum& a, int) {\n     modnum r = a;\n     ++a;\n     return r;\n   }\n   friend modnum operator--(modnum& a, int) {\n     modnum r = a;\n     --a;\n     return r;\n   }\n   friend modnum operator+(const modnum& a, const modnum& b) {\n     return modnum(a) += b;\n   }\n   friend modnum operator-(const modnum& a, const modnum& b) {\n     return modnum(a) -= b;\n   }\n   friend modnum operator*(const modnum& a, const modnum& b) {\n     return modnum(a) *= b;\n   }\n   friend modnum operator/(const modnum& a, const modnum& b) {\n     return modnum(a) /= b;\n   }\n };\n using num = modnum<1000000007>;\n const int mod = 1e9 + 7;\n num power(num a, int64_t b) {\n   if (b == 0) return 1;\n   num res = power(a, b / 2);\n   if (b & 1) return res * res * a;\n   return res * res;\n }\n bool checkinter(pair<int, int> x, pair<int, int> y) {\n   if (x.first > y.first) swap(x, y);\n   return x.first <= y.first && y.first <= x.second;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   if (fopen('input.txt', 'r')) {\n     freopen('input.txt', 'r', stdin);\n     freopen('output.txt', 'w', stdout);\n   }\n   int64_t N, M, K, R, C, Ax, Bx, Ay, By;\n   cin >> N >> M >> K >> R >> C >> Ax >> Ay >> Bx >> By;\n   if (!checkinter(make_pair(Ax, Ax + R - 1), make_pair(Bx, Bx + R - 1)) or\n       !checkinter(make_pair(By, By + C - 1), make_pair(Ay, Ay + C - 1))) {\n     num res = 0;\n     res = power(K, 1ll * N * M - 2ll * R * C);\n     res *= power(K, 1ll * R * C);\n     cout << res;\n     return 0;\n   }\n   if (Ax > Bx) swap(Ax, Bx), swap(Ay, By);\n   if (By < Ay) {\n     int diff = abs(By + C - 1 - Ay + 1);\n     By = Ay + C - 1 - diff + 1;\n   }\n   int64_t sharearea = 1ll * ((Ay + C - 1) - By + 1) * ((Ax + R - 1) - Bx + 1);\n   int64_t area = 2ll * R * C - sharearea;\n   int64_t remainarea = 1ll * N * M - area;\n   num res = power(K, remainarea);\n   if (Ax == Bx and Ay == By)\n     res *= power(K, R * C);\n   else\n     res *= power(K, 1ll * R * C - sharearea);\n   cout << res;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct rangeincrease {\n   int l, r;\n };\n rangeincrease actions[100001];\n rangeincrease inprogress[100001];\n int actionL = 0;\n int nums[100001];\n int opened = 0;\n int main() {\n   int n;\n   int i;\n   cin >> n;\n   for (i = 1; i <= n; i++) {\n     cin >> nums[i];\n   }\n   for (i = 1; i <= n; i++) {\n     while (nums[i] > opened) {\n       opened++;\n       inprogress[opened].l = i;\n     }\n     while (nums[i] < opened) {\n       inprogress[opened].r = i - 1;\n       actionL++;\n       actions[actionL].l = inprogress[opened].l;\n       actions[actionL].r = inprogress[opened].r;\n       opened--;\n     }\n   }\n   while (opened > 0) {\n     inprogress[opened].r = n;\n     actionL++;\n     actions[actionL].l = inprogress[opened].l;\n     actions[actionL].r = inprogress[opened].r;\n     opened--;\n   }\n   cout << actionL << endl;\n   for (i = 1; i <= actionL; i++) {\n     cout << actions[i].l << ' ' << actions[i].r << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC target('avx,avx2,fma')\n using namespace std;\n bool ispoweroftwo(long long n) { return n & (!(n & (n - 1))); }\n long long mod = 1000000007;\n long long dx[] = {1, 0, -1, 0};\n long long dy[] = {0, -1, 0, 1};\n bool test = 0;\n const long long inf = 1e18;\n const long long N = 1e5 + 5;\n long long cache[N][4][4];\n long long k, n;\n long long color[N][3];\n vector<long long> adj[N];\n long long dp(long long u, long long f = 3, long long f1 = 3, long long p = -1) {\n   long long &ans = cache[u][f][f1];\n   if (ans != -1) return ans;\n   long long kid1 = -1, kid2 = -1;\n   for (auto it : adj[u]) {\n     if (it == p) continue;\n     if (kid1 == -1)\n       kid1 = it;\n     else\n       kid2 = it;\n   }\n   if (kid1 == -1) return ans = 0;\n   if (kid2 != -1) {\n     vector<long long> c1, c2, c3;\n     for (long long i = 0; i < 3; ++i) {\n       if (i == f) continue;\n       c1.emplace_back(color[kid1][i] + dp(kid1, i, f, u));\n       c3.emplace_back(i);\n     }\n     for (long long i = 0; i < 3; ++i) {\n       if (i == f) continue;\n       c2.emplace_back(color[kid2][i] + dp(kid2, i, f, u));\n     }\n     ans = min(c1[0] + c2[1], c1[1] + c2[0]);\n     return ans;\n   }\n   ans = inf;\n   for (long long i = 0; i < 3; ++i) {\n     if (i == f or i == f1) continue;\n     ans = min(ans, color[kid1][i] + dp(kid1, i, f, u));\n   }\n   return ans;\n }\n vector<long long> col(N);\n void path(long long u, long long f, long long f1 = 3, long long p = -1) {\n   long long &ans = cache[u][f][f1];\n   long long kid1 = -1, kid2 = -1;\n   for (auto it : adj[u]) {\n     if (it == p) continue;\n     if (kid1 == -1)\n       kid1 = it;\n     else\n       kid2 = it;\n   }\n   if (kid1 == -1) return;\n   if (kid2 != -1) {\n     vector<long long> c1, c2, c3;\n     for (long long i = 0; i < 3; ++i) {\n       if (i == f) continue;\n       c1.emplace_back(color[kid1][i] + cache[kid1][i][f]);\n       c3.emplace_back(i);\n     }\n     for (long long i = 0; i < 3; ++i) {\n       if (i == f) continue;\n       c2.emplace_back(color[kid2][i] + cache[kid2][i][f]);\n     }\n     if (ans != c1[0] + c2[1]) swap(kid1, kid2);\n     col[kid1] = c3[0] + 1;\n     col[kid2] = c3[1] + 1;\n     path(kid1, c3[0], f, u);\n     path(kid2, c3[1], f, u);\n     return;\n   }\n   for (long long i = 0; i < 3; ++i) {\n     if (i == f or i == f1) continue;\n     if (ans == color[kid1][i] + cache[kid1][i][f]) {\n       col[kid1] = i + 1;\n       path(kid1, i, f, u);\n     }\n   }\n }\n void solve(long long tc = 0) {\n   memset(cache, -1, sizeof(cache));\n   cin >> n;\n   for (long long i = 0; i < 3; ++i)\n     for (long long j = 1; j <= n; ++j) cin >> color[j][i];\n   for (long long i = 1, x, y; i < n; ++i) {\n     cin >> x >> y;\n     adj[x].emplace_back(y);\n     adj[y].emplace_back(x);\n   }\n   for (long long i = 1; i <= n; ++i) {\n     if (adj[i].size() >= 3) {\n       cout << '-1\n';\n       return;\n     }\n   }\n   adj[0].emplace_back(1);\n   long long ans = dp(0, 3);\n   cout << ans << '\n';\n   path(0, 3);\n   for (long long i = 1; i <= n; ++i) cout << col[i] << ' ';\n   cout << '\n';\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long t = 1;\n   if (test) cin >> t;\n   for (long long i = 1; i <= t; ++i) {\n     solve(i);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MX = 200005;\n long long n, m;\n vector<long long> adj[2][MX];\n long long st[MX], fin[MX];\n long long deg[2][MX];\n long long ans, tim;\n long long cur = 1;\n pair<long long, long long> seg[4 * MX];\n long long lazy[4 * MX];\n pair<long long, long long> merge(pair<long long, long long> x,\n                                  pair<long long, long long> y) {\n   if (x.first == y.first) return {x.first, x.second + y.second};\n   return min(x, y);\n }\n void build(long long node, long long l, long long r) {\n   if (l == r) {\n     seg[node] = {0, 1};\n     return;\n   }\n   long long mid = (l + r) / 2;\n   build(2 * node, l, mid);\n   build(2 * node + 1, mid + 1, r);\n   seg[node] = merge(seg[2 * node], seg[2 * node + 1]);\n }\n void propagate(long long node, long long l, long long r) {\n   seg[node].first += lazy[node];\n   if (l != r) {\n     lazy[2 * node] += lazy[node];\n     lazy[2 * node + 1] += lazy[node];\n   }\n   lazy[node] = 0;\n }\n void update(long long node, long long l, long long r, long long x, long long y,\n             long long val) {\n   propagate(node, l, r);\n   if (l > y or r < x) return;\n   if (l >= x and r <= y) {\n     lazy[node] += val;\n     propagate(node, l, r);\n     return;\n   }\n   long long mid = (l + r) / 2;\n   update(2 * node, l, mid, x, y, val);\n   update(2 * node + 1, mid + 1, r, x, y, val);\n   seg[node] = merge(seg[2 * node], seg[2 * node + 1]);\n }\n void dfs(long long u) {\n   st[u] = tim++;\n   for (auto v : adj[1][u]) {\n     dfs(v);\n   }\n   fin[u] = tim;\n }\n void solve(long long u) {\n   update(1, 0, cur - 1, st[u], fin[u] - 1, 1);\n   if (!seg[1].first) ans -= seg[1].second;\n   for (auto v : adj[0][u]) {\n     solve(v);\n   }\n   update(1, 0, cur - 1, st[u], fin[u] - 1, -1);\n }\n signed main() {\n   cin >> n >> m;\n   vector<vector<long long> > index(n, vector<long long>(m, -1));\n   vector<vector<char> > a(n, vector<char>(m));\n   for (long long i = 0; i < n; i++) {\n     for (long long j = 0; j < m; j++) {\n       cin >> a[i][j];\n       if (a[i][j] == 'L') {\n         index[i][j] = cur;\n         index[i][j + 1] = cur;\n         cur++;\n       } else if (a[i][j] == 'U') {\n         index[i][j] = cur;\n         index[i + 1][j] = cur;\n         cur++;\n       }\n     }\n   }\n   cur--;\n   for (long long i = 0; i < n; i++) {\n     for (long long j = 0; j < m; j++) {\n       if (a[i][j] == 'L' and j + 2 < m) {\n         adj[(i + j) % 2][index[i][j + 2]].push_back(index[i][j]);\n         deg[(i + j) % 2][index[i][j]]++;\n       }\n       if (a[i][j] == 'R' and j - 2 >= 0) {\n         adj[(i + j) % 2][index[i][j - 2]].push_back(index[i][j]);\n         deg[(i + j) % 2][index[i][j]]++;\n       }\n       if (a[i][j] == 'U' and i + 2 < n) {\n         adj[(i + j) % 2][index[i + 2][j]].push_back(index[i][j]);\n         deg[(i + j) % 2][index[i][j]]++;\n       }\n       if (a[i][j] == 'D' and i - 2 >= 0) {\n         adj[(i + j) % 2][index[i - 2][j]].push_back(index[i][j]);\n         deg[(i + j) % 2][index[i][j]]++;\n       }\n     }\n   }\n   ans = (n * m * n * m) / 4;\n   tim = 0;\n   for (long long i = 1; i < cur + 1; i++) {\n     if (!deg[1][i]) dfs(i);\n   }\n   build(1, 0, cur - 1);\n   for (long long i = 1; i < cur + 1; i++) {\n     if (!deg[0][i]) solve(i);\n   }\n   cout << ans << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 205, inf = 1e9;\n int n, a[N];\n int tot, lnk[N], fro[N * N * 2], nxt[N * N * 2], son[N * N * 2], c[N * N * 2],\n     ori[N * N * 2];\n int S, T, dep[N], cur[N];\n queue<int> q;\n int cnt;\n bool vis[N];\n vector<int> ans[N];\n bool isprm(int x) {\n   if (x == 2 || x == 3 || x == 5 || x == 7) return 1;\n   for (int i = 2; i <= sqrt(x); ++i)\n     if (x % i == 0) return 0;\n   return 1;\n }\n void add(int x, int y, int z) {\n   nxt[++tot] = lnk[x], lnk[x] = tot;\n   fro[tot] = x, son[tot] = y, c[tot] = ori[tot] = z;\n }\n struct Dinic {\n   bool bfs(int x = 0) {\n     memset(dep, 0, sizeof dep), dep[S] = 1;\n     for (; !q.empty(); q.pop())\n       ;\n     q.push(S);\n     for (; !q.empty();) {\n       x = q.front(), q.pop();\n       for (int j = lnk[x]; j; j = nxt[j]) {\n         if (!dep[son[j]] && c[j]) {\n           dep[son[j]] = dep[x] + 1;\n           q.push(son[j]);\n         }\n       }\n     }\n     return dep[T];\n   }\n   int dfs(int x, int f, int ret = 0) {\n     if (x == T) return f;\n     for (int &j = cur[x]; j; j = nxt[j]) {\n       if (dep[son[j]] == dep[x] + 1 && c[j]) {\n         int delta = dfs(son[j], min(f, c[j]));\n         c[j] -= delta, c[j ^ 1] += delta;\n         ret += delta, f -= delta;\n       }\n     }\n     return ret;\n   }\n   int answer(int ret = 0) {\n     for (; bfs();) {\n       for (int i = S; i <= T; ++i) cur[i] = lnk[i];\n       ret += dfs(S, inf);\n     }\n     return ret;\n   }\n } network;\n void dfs(int x, int s) {\n   vis[x] = 1, ans[cnt].push_back(x);\n   if (a[x] & 1) {\n     for (int j = lnk[x]; j; j = nxt[j]) {\n       if (c[j] != 0 || son[j] == S || son[j] == T) continue;\n       if (!vis[son[j]]) {\n         dfs(son[j], s);\n         break;\n       }\n     }\n   } else {\n     for (int j = lnk[x]; j; j = nxt[j]) {\n       if (c[j ^ 1] != 0 || son[j] == S || son[j] == T) continue;\n       if (!vis[son[j]]) {\n         dfs(son[j], s);\n         break;\n       }\n     }\n   }\n }\n int main() {\n   cin >> n, tot = 1, S = 0, T = n + 1;\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &a[i]);\n     if (a[i] & 1)\n       add(S, i, 2), add(i, S, 0);\n     else\n       add(i, T, 2), add(T, i, 0);\n   }\n   for (int i = 1; i <= n; ++i) {\n     for (int j = 1; j <= n; ++j)\n       if (isprm(a[i] + a[j]) && a[i] % 2 == 1 && a[j] % 2 == 0)\n         add(i, j, 1), add(j, i, 0);\n   }\n   int fl = network.answer();\n   if (fl != n) return puts('Impossible'), 0;\n   for (int i = 1; i <= n; ++i)\n     if (a[i] & 1) {\n       if (!vis[i]) ++cnt, dfs(i, i);\n     }\n   printf('%d\n', cnt);\n   for (int i = 1; i <= cnt; ++i) {\n     printf('%d', ans[i].size());\n     for (int j = 0; j < ans[i].size(); ++j) printf(' %d', ans[i][j]);\n     puts('');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int NMax = 1003;\n enum directions { EAST, NORTH };\n struct point {\n   int x, y;\n };\n point a[NMax];\n int n;\n int test(int searchDir, point a[], long double x, long double y) {\n   if (searchDir == NORTH) {\n     int nr = 0;\n     for (int i = 1; i <= n; ++i) {\n       if (a[i].y >= y &&\n           (((long double)a[i].x >= x && x <= (long double)a[i + 1].x) ||\n            ((long double)a[i].x <= x && x >= (long double)a[i + 1].x))) {\n         nr++;\n       }\n     }\n     return (nr & 1);\n   } else {\n     int nr = 0;\n     for (int i = 1; i <= n; ++i) {\n       if (a[i].x >= x &&\n           (((long double)a[i].y >= y && y <= (long double)a[i + 1].y) ||\n            ((long double)a[i].y <= y && y >= (long double)a[i + 1].y))) {\n         nr++;\n       }\n     }\n     return (nr & 1);\n   }\n }\n int main() {\n   cin >> n;\n   for (int i = 1; i <= n + 1; ++i) {\n     cin >> a[i].x >> a[i].y;\n   }\n   int ans = 0;\n   for (int i = 2; i <= n + 1; ++i) {\n     if (a[i].x == a[i - 1].x) {\n       if (a[i].y > a[i - 1].y) {\n         ans += test(EAST, a, a[i].x, a[i].y + 0.5);\n       } else {\n         ans += test(EAST, a, a[i].x, a[i].y - 0.5);\n       }\n     } else {\n       if (a[i].x > a[i - 1].x) {\n         ans += test(NORTH, a, a[i].x + 0.5, a[i].y);\n       } else {\n         ans += test(NORTH, a, a[i].x - 0.5, a[i].y);\n       }\n     }\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long px1[133000], px2[133000], py1[133000], py2[133000], sx1[133000],\n     sx2[133000], sy1[133000], sy2[133000];\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   long long a[n + 1], b[n + 1], c[n + 1], d[n + 1];\n   for (unsigned long long i = 1; i < n + 1; i++)\n     cin >> a[i] >> b[i] >> c[i] >> d[i];\n   px1[0] = -9999999999, px2[0] = 9999999999, py1[0] = -9999999999,\n   py2[0] = 9999999999;\n   for (unsigned long long i = 1; i < n + 1; i++) {\n     px1[i] = max(a[i], px1[i - 1]);\n     px2[i] = min(c[i], px2[i - 1]);\n     py1[i] = max(b[i], py1[i - 1]);\n     py2[i] = min(d[i], py2[i - 1]);\n   }\n   sx1[n + 1] = -9999999999, sx2[n + 1] = 9999999999, sy1[n + 1] = -9999999999,\n           sy2[n + 1] = 9999999999;\n   for (unsigned long long i = n + 1 - 1; i >= 1; i--) {\n     sx1[i] = max(a[i], sx1[i + 1]);\n     sx2[i] = min(c[i], sx2[i + 1]);\n     sy1[i] = max(b[i], sy1[i + 1]);\n     sy2[i] = min(d[i], sy2[i + 1]);\n   }\n   long long ax1, ax2, ay1, ay2;\n   for (unsigned long long i = 1; i < n + 1; i++) {\n     ax1 = max(px1[i - 1], sx1[i + 1]);\n     ax2 = min(px2[i - 1], sx2[i + 1]);\n     ay1 = max(py1[i - 1], sy1[i + 1]);\n     ay2 = min(py2[i - 1], sy2[i + 1]);\n     if (ax1 <= ax2 && ay1 <= ay2) {\n       cout << ax1 << ' ' << ay1 << endl;\n       return 0;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1051131;\n const int Inv2 = (mod + 1) >> 1;\n inline void setIO(string a) {}\n long long Power;\n int m, s, n, nn;\n int a[(1 << 25) + 23];\n void work(int n, int p, int q) {\n   if (n == 1) {\n     int &An = a[1];\n     (p += q) %= mod;\n     for (long long c = Power; c; c >>= 1, p = 1ll * p * p % mod)\n       if (c & 1) An = 1ll * An * p % mod;\n     return;\n   }\n   int t = n >> 1, tt = 1ll * t * p % mod;\n   int ttp = (p + q + mod - tt) % mod, tttp = 1;\n   for (long long c = Power; c; c >>= 1, ttp = 1ll * ttp * ttp % mod)\n     if (c & 1) tttp = 1ll * tttp * ttp % mod;\n   int xi = (1ll * t * p % mod - p + q + mod) % mod;\n   for (int i = (1); i <= (t); i++) {\n     int A = a[i], B = a[i + t];\n     a[i] = (A + B) % mod;\n     a[i + t] = (A + mod - B) % mod;\n     a[i + t] = 1ll * a[i + t] * tttp % mod;\n   }\n   work(n >> 1, (p + p) % mod, xi);\n   for (int i = (1); i <= (t); i++) {\n     int A = a[i], B = a[i + t];\n     a[i] = (A + B) % mod;\n     a[i + t] = (A + mod - B) % mod;\n     a[i] = 1ll * a[i] * Inv2 % mod;\n     a[i + t] = 1ll * a[i + t] * Inv2 % mod;\n   }\n }\n int main() {\n   scanf('%d', &m);\n   cin >> Power;\n   scanf('%d', &s);\n   for (int i = (1); i <= (s); i++) scanf('%d', &a[i]);\n   n = 1 << m;\n   nn = n;\n   for (int i = (s + 1); i <= (n); i++)\n     a[i] = (101ll * a[i - s] + 10007) % 1051131;\n   work(n, 1, 0);\n   int ans = 0;\n   for (int i = (1); i <= (n); i++) ans ^= a[i];\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, arr[30010], book[30010];\n bool judge() {\n   int ps, gap;\n   int t1 = 1, t2;\n   while (t1 <= n && book[t1]) t1++;\n   t2 = t1 + 1;\n   if (t1 > n) return false;\n   while (t2 <= n && book[t2]) t2++;\n   if (t2 > n) return true;\n   gap = arr[t2] - arr[t1];\n   ps = t2;\n   for (int i = t2 + 1; i <= n; i++)\n     if (!book[i]) {\n       if (arr[i] - arr[ps] == gap)\n         ps = i;\n       else\n         return false;\n     }\n   return true;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) scanf('%d', &arr[i]);\n   if (n == 2)\n     printf('%d\n%d', arr[1], arr[2]);\n   else {\n     int x[3] = {arr[2] - arr[1], arr[3] - arr[2], arr[3] - arr[1]};\n     int flag = 0;\n     for (int i = 0; i < 3; i++) {\n       int st = 4, tmp = arr[3];\n       memset(book, 0, sizeof(book));\n       if (i == 0) {\n         book[2] = book[1] = 1;\n         st = 3;\n         tmp = arr[2];\n       } else if (i == 1)\n         book[2] = book[3] = 1;\n       else\n         book[1] = book[3] = 1;\n       for (int ii = st; ii <= n; ii++)\n         if (arr[ii] == tmp + x[i]) {\n           book[ii] = 1;\n           tmp = arr[ii];\n         }\n       if (judge()) {\n         flag = 1;\n         break;\n       } else {\n         int p = n;\n         while (!book[p]) p--;\n         book[p] = 0;\n         if (judge()) {\n           flag = 1;\n           break;\n         }\n       }\n     }\n     if (flag) {\n       for (int i = 1; i <= n; i++)\n         if (book[i]) printf('%d ', arr[i]);\n       printf('\n');\n       for (int i = 1; i <= n; i++)\n         if (!book[i]) printf('%d ', arr[i]);\n     } else\n       printf('No solution');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int ekub(int a, int b) { return b == 0 ? a : ekub(b, a % b); }\n long long s[51][51];\n int main() {\n   long long i, j, n, m, a, b, ans = 1e9;\n   cin >> n >> m;\n   for (i = 1; i <= n; i++)\n     for (j = 1; j <= m; j++) {\n       cin >> s[i][j];\n       s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];\n     }\n   cin >> a >> b;\n   for (i = a; i <= n; i++)\n     for (j = b; j <= m; j++)\n       ans = min(ans, s[i][j] - s[i - a][j] - s[i][j - b] + s[i - a][j - b]);\n   for (i = b; i <= n; i++)\n     for (j = a; j <= m; j++)\n       ans = min(ans, s[i][j] - s[i - b][j] - s[i][j - a] + s[i - b][j - a]);\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n namespace P_TEMPLATE {\n class fastin {\n  private:\n   int _ch, _f;\n \n  public:\n   inline fastin& operator>>(char& c) {\n     c = getchar();\n     return *this;\n   }\n   template <typename _Tp>\n   inline fastin& operator>>(_Tp& _x) {\n     _x = 0;\n     while (!isdigit(_ch)) _f |= (_ch == 45), _ch = getchar();\n     while (isdigit(_ch))\n       _x = (_x << 1) + (_x << 3) + (_ch ^ 48), _ch = getchar();\n     _f && (_x = -_x, _f = 0);\n     return *this;\n   }\n   fastin() { _ch = _f = 0; }\n } fin;\n class fastout {\n  private:\n   int _num[32], _head;\n \n  public:\n   inline fastout& operator<<(char c) {\n     putchar(c);\n     return *this;\n   }\n   template <typename _Tp>\n   inline fastout& operator<<(_Tp _x) {\n     _Tp _k;\n     if (_x == 0) {\n       putchar('0');\n       return *this;\n     }\n     if (_x < 0) putchar('-'), _x = -_x;\n     while (_x > 0)\n       _k = _x / 10, ++_head, _num[_head] = (_x - (_k << 1) - (_k << 3)) ^ 48,\n       _x = _k;\n     while (_head > 0) putchar(_num[_head]), --_head;\n     return *this;\n   }\n   fastout() { _head = 0; }\n } fout;\n inline void P_INIT() {}\n }  // namespace P_TEMPLATE\n using namespace P_TEMPLATE;\n using namespace std;\n const int maxn = 1000004, maxm = 104;\n const int mod = 1000000007, inf = 1201201201;\n int n, k, p;\n char s[maxn][maxm];\n int len[maxn];\n int book[28], cnt[28];\n vector<int> e[28];\n queue<int> q;\n int topo[28], indx;\n inline bool check() {\n   for (register int i = 1; i <= 26; ++i)\n     if (!cnt[i]) q.push(i), topo[++indx] = i;\n   while (!q.empty()) {\n     int t = q.front();\n     q.pop();\n     for (register int i = 0; i < e[t].size(); ++i) {\n       --cnt[e[t][i]];\n       if (cnt[e[t][i]] == 0) q.push(e[t][i]), topo[++indx] = e[t][i];\n     }\n   }\n   return indx == 26;\n }\n signed main() {\n   P_INIT();\n   fin >> n >> k;\n   for (register int i = 1; i <= n; ++i) {\n     fin >> p;\n     for (register int j = 1; j <= k; ++j) {\n       scanf('%s', s[p * k + j] + 1), len[p * k + j] = strlen(s[p * k + j] + 1);\n       for (register int t = 1; t <= len[p * k + j]; ++t)\n         book[s[p * k + j][t] - 'a' + 1] = 1;\n     }\n   }\n   for (register int i = 1; i < n * k; ++i) {\n     bool flag = 0;\n     for (register int j = 1; j <= std::min(len[i], len[i + 1]); ++j)\n       if (s[i][j] != s[i + 1][j]) {\n         e[s[i][j] - 'a' + 1].push_back(s[i + 1][j] - 'a' + 1);\n         ++cnt[s[i + 1][j] - 'a' + 1];\n         flag = 1;\n         break;\n       }\n     if (!flag && len[i] > len[i + 1]) {\n       puts('IMPOSSIBLE');\n       return 0;\n     }\n   }\n   if (check()) {\n     for (register int i = 1; i <= 26; ++i)\n       if (book[topo[i]]) fout << char(topo[i] - 1 + 'a');\n   } else\n     puts('IMPOSSIBLE');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma comment(linker, '/STACK:66777216')\n using namespace std;\n const int N = 100007;\n int n, a[N], cnt[N];\n vector<int> D[N];\n long long power(long long a, long long b) {\n   if (b == 0) {\n     return 1;\n   }\n   if (b & 1) {\n     return (a * power(a, b - 1)) % 1000000007LL;\n   }\n   long long ret = power(a, b >> 1);\n   return (ret * ret) % 1000000007LL;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; ++i) {\n     scanf('%d', &a[i]);\n   }\n   sort(a, a + n);\n   for (int i = 1; i <= a[n - 1]; ++i) {\n     for (int j = i; j <= a[n - 1]; j += i) {\n       D[j].push_back(i);\n     }\n   }\n   long long ans = 0;\n   for (int m = 1; m <= a[n - 1]; ++m) {\n     vector<int> &d = D[m];\n     int nd = (int)(d).size();\n     for (int i = 0; i < nd; ++i) {\n       cnt[i] = n - (lower_bound(a, a + n, d[i]) - a);\n     }\n     long long cur =\n         (power(nd, cnt[nd - 1]) - power(nd - 1, cnt[nd - 1]) + 1000000007LL) %\n         1000000007LL;\n     for (int i = 0; i < nd - 1; ++i) {\n       cur = (cur * power(i + 1, cnt[i] - cnt[i + 1])) % 1000000007LL;\n     }\n     ans = (ans + cur) % 1000000007LL;\n   }\n   printf('%d\n', (int)ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void init_code() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n }\n int main() {\n   init_code();\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     vector<pair<int, int>> v;\n     vector<pair<int, int>> v1;\n     for (int i = 0; i < n; i++) {\n       int x, y;\n       cin >> x >> y;\n       v1.push_back({x, y});\n       v.push_back({x, y});\n     }\n     sort(v.begin(), v.end());\n     int st = v[0].first;\n     int ed = v[0].second;\n     int cnt = 1;\n     unordered_map<int, int> mp;\n     mp[st] = 1;\n     for (int i = 1; i < n; i++) {\n       if (v[i].first <= ed) {\n         mp[v[i].first] = cnt;\n         ed = max(ed, v[i].second);\n       } else {\n         st = v[i].first;\n         ed = v[i].second;\n         if (cnt == 1) {\n           cnt++;\n         }\n         mp[v[i].first] = cnt;\n       }\n     }\n     if (cnt < 2) {\n       cout << '-1' << endl;\n     } else {\n       for (int i = 0; i < v1.size(); i++) {\n         cout << mp[v1[i].first] << ' ';\n       }\n       cout << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve() {}\n void no() {\n   cout << 'NO' << '\n';\n   exit(0);\n }\n const long long maxn = 100050;\n long long a[maxn];\n long long psa[maxn];\n signed main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   long long n;\n   cin >> n;\n   for (long long i = 1; i <= n; i++) {\n     cin >> a[i];\n   }\n   long long len = n;\n   for (long long i = 1; i <= n; i++) {\n     if (a[i] != a[1]) {\n       len = i - 1;\n       break;\n     }\n   }\n   for (long long i = 1; i <= n; i++) {\n     psa[i] = psa[i - 1] + a[i];\n   }\n   if (n % len) no();\n   for (long long i = len; i <= n; i += len) {\n     long long sum = psa[i] - psa[i - len];\n     if (sum and sum != len) {\n       no();\n     }\n     if (i >= len * 2) {\n       if (sum == psa[i - len] - psa[i - 2 * len]) {\n         no();\n       }\n     }\n   }\n   cout << 'YES' << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1234567;\n int pref[N], a[N], b[N];\n char c[N];\n int solve(vector<pair<int, int> > z, int b) {\n   sort(z.begin(), z.end());\n   int cnt = z.size();\n   if (cnt < 2) {\n     return 0;\n   }\n   pref[0] = 0;\n   for (int i = 0; i < cnt; i++) {\n     pref[i + 1] = max(pref[i], z[i].second);\n   }\n   int i = 0;\n   int res = 0;\n   for (int j = cnt - 1; j >= 0; j--) {\n     while (i < j && z[i].first + z[j].first <= b) {\n       i++;\n     }\n     i = min(i, j);\n     if (i > 0) {\n       res = max(res, pref[i] + z[j].second);\n     }\n   }\n   return res;\n }\n int same(vector<pair<int, int> > &v, int b) {\n   if (v.size() < 2) return 0;\n   sort(v.begin(), v.end());\n   vector<int> pre(v.size() + 1, 0);\n   for (int i = 0; i < v.size(); i++) pre[i + 1] = max(pre[i], v[i].second);\n   int i = 0, ans = 0;\n   for (int j = v.size() - 1; j >= 0; j--) {\n     while (i < j && v[i].first + v[j].first <= b) i++;\n     i = min(i, j);\n     if (i > 0) {\n       ans = max(ans, v[j].second + pre[i]);\n     }\n   }\n   return ans;\n }\n int main() {\n   int n, C, D;\n   scanf('%d %d %d', &n, &C, &D);\n   for (int i = 0; i < n; i++) {\n     scanf('%d %d', a + i, b + i);\n     c[i] = getchar();\n     while (c[i] != 'C' && c[i] != 'D') {\n       c[i] = getchar();\n     }\n   }\n   int ans = 0;\n   {\n     int x = 0, y = 0;\n     for (int i = 0; i < n; i++) {\n       if (c[i] == 'C' && b[i] <= C) {\n         x = max(x, a[i]);\n       }\n     }\n     for (int i = 0; i < n; i++) {\n       if (c[i] == 'D' && b[i] <= D) {\n         y = max(y, a[i]);\n       }\n     }\n     if (x > 0 && y > 0) {\n       ans = max(ans, x + y);\n     }\n   }\n   {\n     vector<pair<int, int> > z;\n     for (int i = 0; i < n; i++) {\n       if (c[i] == 'C') {\n         z.push_back(make_pair(b[i], a[i]));\n       }\n     }\n     ans = max(ans, same(z, C));\n   }\n   {\n     vector<pair<int, int> > z;\n     for (int i = 0; i < n; i++) {\n       if (c[i] == 'D') {\n         z.push_back(make_pair(b[i], a[i]));\n       }\n     }\n     ans = max(ans, same(z, D));\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n inline int abs(int n) { return n < 0 ? -n : n; }\n bool board[20][20];\n int dx[] = {-3, -2, -2, -1, -1, 0, 0, 1, 1, 2, 2, 3};\n int dy[] = {0, 1, -1, 2, -2, 3, -3, 2, -2, 1, -1, 0};\n int dfs(int p, int n, int m) {\n   int mx = p, t, cnt = 0;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < m; j++) {\n       if (!board[i][j]) {\n         board[i][j] = true;\n         for (int k = 0; k < 12; k++) {\n           int ic = i + dx[k], jc = j + dy[k];\n           if (ic >= 0 && ic < n && jc >= 0 && jc < m && !board[ic][jc]) {\n             board[ic][jc] = true;\n             t = dfs(p + 2, n, m);\n             mx < t && (mx = t);\n             if (mx == ((m * n) | 1) - 1) return mx;\n             board[ic][jc] = false;\n           }\n         }\n         board[i][j] = false;\n         cnt++;\n         if (m * n - cnt <= mx) return mx;\n       }\n     }\n   }\n   return mx;\n }\n int ans[] = {0, 0, 0, 0, 2, 4};\n int main() {\n   int m, n;\n   scanf('%d%d', &m, &n);\n   if (m < 10 && n < 10) {\n     printf('%d\n', dfs(0, n, m));\n   } else if (m == 1) {\n     printf('%d\n', n / 6 * 6 + ans[n % 6]);\n   } else if (n == 1) {\n     printf('%d\n', m / 6 * 6 + ans[m % 6]);\n   } else {\n     printf('%lld\n', (((long long)(m)*n) | 1) - 1);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using db = long double;\n using pll = pair<long long, long long>;\n const long long sz = 300003;\n long long dp[sz][2], n;\n long long a[sz];\n long long dfs(long long i, long long par) {\n   if (i >= n) return 0;\n   long long &res = dp[i][par];\n   if (res == -1) {\n     res = 0;\n     if (par) {\n       res = a[i] + dfs(i + 1, par ^ 1);\n     } else {\n       res = -a[i] + dfs(i + 1, par ^ 1);\n     }\n     res = max({0LL, res, dfs(i + 1, par)});\n   }\n   return res;\n }\n int32_t main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long t, i, x, j, y, q, z, k;\n   int kkr, csk;\n   long long tt;\n   cin >> tt;\n   for (long long _tt = 0; _tt < tt; _tt++) {\n     cin >> n >> q;\n     for (int i = 0; i < n; i++) cin >> a[i];\n     ;\n     while (q-- > 0) {\n       cin >> x >> y;\n       x--, y--;\n     }\n     for (i = 0; i < n; i += 1) {\n       memset(dp[i], -1, sizeof(dp[i]));\n     }\n     z = dfs(0, 1);\n     42;\n     cout << z << '\n';\n     ;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     int arr[n];\n     for (int i = 0; i < n; i++) cin >> arr[i];\n     int counts[n + 1];\n     memset(counts, 0, sizeof(counts));\n     if (n == 1) {\n       cout << 0 << endl;\n       continue;\n     }\n     for (int i = 0; i < n; i++) counts[arr[i]]++;\n     int dc = 0, rc = INT_MIN;\n     for (int i = 0; i <= n; i++) {\n       if (counts[i] > 0) dc++;\n       rc = max(rc, counts[i]);\n     }\n     if (rc > 1) dc--;\n     if (rc > dc + 1)\n       cout << dc + 1 << endl;\n     else\n       cout << min(dc, rc) << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 105;\n const int inf = 10000000;\n int n, k;\n int l[N], r[N];\n int main() {\n   scanf('%d%d', &n, &k);\n   int midx = (k + 1) / 2, midy = (k + 1) / 2;\n   for (int i = 0; i < n; i++) {\n     int m, ans = inf, x, y1, y2;\n     scanf('%d', &m);\n     for (int row = 1; row <= k; row++) {\n       if (l[row] == 0 && r[row] == 0) {\n         for (int a = 1; a + m - 1 <= k; a++) {\n           int tot = 0, b = a + m - 1;\n           for (int col = a; col <= b; col++) {\n             tot += abs(row - midx) + abs(col - midy);\n           }\n           if (tot < ans) ans = tot, x = row, y1 = a, y2 = b;\n         }\n       } else {\n         if (l[row] > m) {\n           int tot = 0, a = l[row] - m, b = l[row] - 1;\n           for (int col = a; col <= b; col++) {\n             tot += abs(row - midx) + abs(col - midy);\n           }\n           if (tot < ans) ans = tot, x = row, y1 = a, y2 = b;\n         }\n         if (r[row] + m <= k) {\n           int tot = 0, a = r[row] + 1, b = r[row] + m;\n           for (int col = a; col <= b; col++)\n             tot += abs(row - midx) + abs(col - midy);\n           if (tot < ans) ans = tot, x = row, y1 = a, y2 = b;\n         }\n       }\n     }\n     if (ans == inf)\n       puts('-1');\n     else {\n       printf('%d %d %d\n', x, y1, y2);\n       if (r[x] == 0 && l[x] == 0)\n         l[x] = y1, r[x] = y2;\n       else\n         l[x] = min(l[x], y1), r[x] = max(r[x], y2);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 500010;\n const int M = 16;\n const int inf = 0x3f3f3f3f;\n const int S = 1 << 15;\n map<string, int> mp;\n int vs[15], n, m;\n char s[N][12], sx[12];\n int dp[S], cnt[S][16];\n int cal(int st) {\n   int res = 0;\n   while (st) {\n     if (st & 1) res++;\n     st >>= 1;\n   }\n   return res;\n }\n void prepare() {\n   for (int i = 0; i < S; ++i) {\n     int tmp = i;\n     for (int j = 0; j < M; ++j) {\n       tmp >>= 1;\n       cnt[i][j] = cal(tmp);\n     }\n   }\n }\n int stx[N], pre[M];\n int main() {\n   prepare();\n   ios::sync_with_stdio(0);\n   scanf('%d', &n);\n   for (int i = 0; i < n; ++i) {\n     scanf('%s', sx);\n     mp[sx] = i;\n   }\n   int ans1 = -1, ans2 = 0, ans3 = 0;\n   scanf('%d', &m);\n   for (int i = 0; i < m; ++i) {\n     int k;\n     scanf('%d', &k);\n     memset(vs, 0, sizeof vs);\n     for (int j = 0; j < k; ++j) {\n       scanf('%s', s[j]);\n       if (mp.find(s[j]) == mp.end()) continue;\n       vs[mp[s[j]]] = 1;\n     }\n     int f = 0;\n     for (int j = 0; j < n && !f; ++j)\n       if (!vs[j]) f = 1;\n     if (f) continue;\n     int v = 0;\n     memset(dp, 0x3f, sizeof dp);\n     dp[0] = 0;\n     int pre = 0;\n     for (int j = 0; j < k; ++j) {\n       if (mp.find(s[j]) == mp.end()) continue;\n       int id = mp[s[j]], vst = 1 << id;\n       if (pre & (1 << id)) continue;\n       pre = (pre & ((1 << id) - 1) | (1 << id));\n       for (int st = stx[j] & (vst - 1); st < (1 << n); ++st)\n         if ((st & vst) == 0) {\n           dp[st | vst] = min(dp[st | vst], dp[st] + cnt[st][id]);\n         }\n     }\n     int tmp = n * (n - 1) / 2 - dp[(1 << n) - 1] + 1;\n     if (ans1 == -1 || tmp > ans2 || (tmp == ans2 && dp[(1 << n) - 1] < ans3)) {\n       ans1 = i;\n       ans2 = tmp;\n       ans3 = dp[(1 << n) - 1];\n     }\n   }\n   if (ans1 == -1)\n     puts('Brand new problem!');\n   else {\n     printf('%d\n', ans1 + 1);\n     printf('%s', '[:');\n     for (int i = 0; i < ans2; ++i) putchar('|');\n     puts(':]');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n using V = vector<T>;\n const int MM = 5e5 + 5;\n using T = long long;\n bool QUERY;\n struct Line {\n   mutable T a, b, p;\n   T Eval(T first) const { return a * first + b; }\n   bool operator<(const Line& o) const { return QUERY ? p < o.p : a < o.a; }\n };\n struct ConvexHull : multiset<Line> {\n   const T kInf = numeric_limits<T>::max();\n   T div(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }\n   bool isect(iterator first, iterator second) {\n     if (second == end()) {\n       first->p = kInf;\n       return false;\n     }\n     if (first->a == second->a) {\n       first->p = first->b > second->b ? kInf : -kInf;\n     } else {\n       first->p = div(second->b - first->b, first->a - second->a);\n     }\n     return first->p >= second->p;\n   }\n   void InsertLine(T a, T b) {\n     auto nx = insert({a, b, 0}), it = nx++, pv = it;\n     while (isect(it, nx)) {\n       nx = erase(nx);\n     }\n     if (pv != begin() && isect(--pv, it)) {\n       isect(pv, it = erase(it));\n     }\n     while ((it = pv) != begin() && (--pv)->p >= it->p) {\n       isect(pv, erase(it));\n     }\n   }\n   T EvalMax(T first) {\n     if (empty()) {\n       return -2e18;\n     }\n     QUERY = 1;\n     auto it = lower_bound({0, 0, first});\n     QUERY = 0;\n     return it->Eval(first);\n   }\n };\n vector<vector<int>> tree;\n long long sub[MM];\n long long n;\n long long sq(long long e) { return e * e; }\n void dfs1(int cur, int par) {\n   sub[cur] = 1;\n   for (auto u : tree[cur]) {\n     if (u != par) {\n       dfs1(u, cur);\n       sub[cur] += sub[u];\n     }\n   }\n }\n long long dp1[MM];\n void dfs2(int cur, int par) {\n   dp1[cur] = sq(sub[cur]);\n   for (int u : tree[cur]) {\n     if (u != par) {\n       dfs2(u, cur);\n       dp1[cur] = min(dp1[cur], sq(sub[cur] - sub[u]) + dp1[u]);\n     }\n   }\n }\n vector<long long> ans;\n void dfs3(int cur, int par) {\n   ConvexHull CH;\n   ans[cur] = sq(n);\n   for (int u : tree[cur]) {\n     if (u != par) {\n       dfs3(u, cur);\n       long long val = dp1[u] - CH.EvalMax(sub[u]) + sq(sub[u]);\n       ans[cur] = min(ans[cur], val);\n       ans[cur] = min(ans[cur], dp1[u] + sq(n - sub[u]));\n       CH.InsertLine(2 * (n - sub[u]), -(dp1[u] + sq(n - sub[u])));\n     }\n   }\n   return;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n;\n   tree.resize(n);\n   ans.resize(n);\n   for (int i = 0; i < n - 1; i++) {\n     int u, v;\n     cin >> u >> v;\n     u--;\n     v--;\n     tree[u].push_back(v);\n     tree[v].push_back(u);\n   }\n   dfs1(0, -1);\n   dfs2(0, -1);\n   dfs3(0, -1);\n   cout << (n * n - n) / 2 +\n               (sq(n) - *min_element((ans).begin(), (ans).end())) / 2\n        << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Item {\n   int x[3], y[3];\n };\n bool check(Item t);\n inline int Dist(int x1, int y1, int x2, int y2) {\n   return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);\n }\n int main() {\n   Item it;\n   for (int i = 0; i < 3; i++) cin >> it.x[i] >> it.y[i];\n   if (check(it))\n     cout << 'RIGHT\n';\n   else {\n     bool f = false;\n     for (int i = 0; i < 3; i++) {\n       Item tmp = it;\n       tmp.x[i]--;\n       if (check(tmp)) {\n         f = true;\n         break;\n       }\n       tmp.x[i] += 2;\n       if (check(tmp)) {\n         f = true;\n         break;\n       }\n     }\n     for (int i = 0; i < 3; i++) {\n       Item tmp = it;\n       tmp.y[i]--;\n       if (check(tmp)) {\n         f = true;\n         break;\n       }\n       tmp.y[i] += 2;\n       if (check(tmp)) {\n         f = true;\n         break;\n       }\n     }\n     if (f == true)\n       cout << 'ALMOST\n';\n     else\n       cout << 'NEITHER\n';\n   }\n   return 0;\n }\n bool check(Item t) {\n   int d[3];\n   int xx[3], yy[3];\n   d[0] = Dist(t.x[0], t.y[0], t.x[1], t.y[1]);\n   d[1] = Dist(t.x[0], t.y[0], t.x[2], t.y[2]);\n   d[2] = Dist(t.x[1], t.y[1], t.x[2], t.y[3]);\n   if (!d[0] || !d[1] || !d[2]) return false;\n   if (d[0] + d[1] == d[2] || d[1] + d[2] == d[0] || d[0] + d[2] == d[1])\n     return false;\n   xx[0] = t.x[0] - t.x[1];\n   yy[0] = t.y[0] - t.y[1];\n   xx[1] = t.x[0] - t.x[2];\n   yy[1] = t.y[0] - t.y[2];\n   xx[2] = t.x[1] - t.x[2];\n   yy[2] = t.y[1] - t.y[2];\n   if (xx[0] * xx[1] + yy[0] * yy[1] == 0 ||\n       xx[0] * xx[2] + yy[0] * yy[2] == 0 || xx[1] * xx[2] + yy[1] * yy[2] == 0)\n     return true;\n   else\n     return false;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void input(long long int n, long long int a[]) {\n   for (long long int i = 0; i < n; ++i) cin >> a[i];\n }\n long long int bin_expo(long long int A, long long int B, long long int M) {\n   long long int result = 1ll;\n   while (B > 0) {\n     if (B % 2 == 1) {\n       result = (result * A) % M;\n     }\n     A = (A * A) % M;\n     B = B / 2;\n   }\n   return result;\n }\n long long int gcd(long long int a, long long int b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n long long int lcm(long long int a, long long int b) {\n   return (a * b) / gcd(a, b);\n }\n long long int n, l;\n long long int a[101], b[101];\n long long int dp[4001][200][3];\n long long int solve(long long int left, long long int prev,\n                     long long int flag) {\n   if (left < 0) return 0LL;\n   if (left == 0) return 1LL;\n   if (dp[left][prev][flag] != -1) return dp[left][prev][flag];\n   long long int res = 0;\n   if (prev == -1) {\n     for (long long int i = 0; i < n; ++i) {\n       res += solve(left - a[i], i, 2);\n       if (a[i] != b[i]) res += solve(left - b[i], i, 1);\n       res %= 1000000007;\n     }\n   } else {\n     for (long long int i = 0; i < n; ++i) {\n       if (i != prev) {\n         long long int cur;\n         if (flag == 1) cur = a[prev];\n         if (flag == 2) cur = b[prev];\n         if (a[i] == cur)\n           res += solve(left - a[i], i, 2);\n         else if (b[i] == cur)\n           res += solve(left - b[i], i, 1);\n         res %= 1000000007;\n       }\n     }\n   }\n   return dp[left][prev][flag] = res % 1000000007;\n }\n int main() {\n   memset(dp, -1, sizeof(dp));\n   cin >> n >> l;\n   for (long long int i = 0; i < n; ++i) cin >> a[i] >> b[i];\n   cout << solve(l, -1, 0) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int sum, t, p, pos, a[100005], b[100005], n, f, c, f1;\n   cin >> t;\n   while (t--) {\n     memset(a, 0, sizeof(a));\n     memset(b, 0, sizeof(b));\n     cin >> n;\n     f = 1;\n     sum = 0;\n     p = 0;\n     f1 = 1, c = 0;\n     for (int i = 0; i < n; i++) cin >> a[i];\n     for (int i = 0; i < n; i++) cin >> b[i];\n     for (int i = 0; i < n; i++) {\n       if (f == 1 && a[i] != b[i]) {\n         if (p == 0) pos = i, p = 1, c = b[i] - a[i];\n         sum++;\n         f = 0;\n       } else if (a[i] > b[i])\n         f1 = 0;\n       else if (a[i] == b[i])\n         f = 1;\n     }\n     if (sum >= 2) {\n       cout << 'NO' << endl;\n     } else if (f1 == 0 || c < 0)\n       cout << 'NO' << endl;\n     else {\n       if (sum == 0)\n         cout << 'YES' << endl;\n       else {\n         for (int i = pos; a[i] != b[i]; i++) {\n           if (b[i] - a[i] != c) f1 = 0;\n         }\n         if (f1 == 0)\n           cout << 'NO' << endl;\n         else\n           cout << 'YES' << endl;\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int left_[105], right_[105], mark[105];\n int main() {\n   int n, j;\n   std::ios::sync_with_stdio(0);\n   while (~scanf('%d', &n)) {\n     int ans = 0;\n     memset(left_, 0, sizeof(left_));\n     memset(right_, 0, sizeof(right_));\n     memset(mark, 0, sizeof(mark));\n     for (int i = 1; i <= n; i++) {\n       scanf('%d %d', &left_[i], &right_[i]);\n       if (left_[i] == 0) mark[++ans] = i;\n     }\n     for (int i = 1; i < ans; i++) {\n       for (j = mark[i]; right_[j] != 0; j = right_[j])\n         ;\n       left_[mark[i + 1]] = j;\n       right_[j] = mark[i + 1];\n     }\n     for (int i = 1; i <= n; i++) printf('%d %d\n', left_[i], right_[i]);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int f, int s) {\n   if (s == 0)\n     return f;\n   else\n     return gcd(s, f % s);\n }\n int const N = 1000006;\n long long const M = 1020;\n long double const ep = .000000000000000001;\n long long arr[N], arr1[N];\n int main() {\n   int n, m;\n   scanf('%d', &n);\n   long long sum = 0, sum1 = 0;\n   for (int i = 0; i < n; i++) {\n     scanf('%lld', arr + i);\n     sum += arr[i];\n   }\n   scanf('%d', &m);\n   for (int i = 0; i < m; i++) {\n     scanf('%lld', arr1 + i);\n     sum1 += arr1[i];\n   }\n   if (sum == sum1) {\n     printf('0\n0');\n     return 0;\n   }\n   long long best = abs(sum - sum1);\n   int ind = -1, ind1 = -1;\n   for (int i = 0; i < n; i++) {\n     long long temp = sum, temp1 = sum1;\n     for (int x = 0; x < m; x++) {\n       temp -= arr[i];\n       temp += arr1[x];\n       temp1 -= arr1[x];\n       temp1 += arr[i];\n       if (abs(temp - temp1) < best) {\n         ind = i + 1, ind1 = x + 1;\n         best = abs(temp - temp1);\n       }\n       temp = sum, temp1 = sum1;\n     }\n   }\n   int indd = -1, indd1 = -1, indd2 = -1, indd21 = -1;\n   vector<pair<long long, pair<int, int> > > v, v1;\n   for (int i = 0; i < n; i++)\n     for (int x = i + 1; x < n; x++)\n       v.push_back(make_pair(arr[i] + arr[x], make_pair(i, x)));\n   for (int i = 0; i < m; i++)\n     for (int x = i + 1; x < m; x++)\n       v1.push_back(make_pair(arr1[i] + arr1[x], make_pair(i, x)));\n   sort(v1.begin(), v1.end());\n   long long want = (sum - sum1) / 2;\n   long long test = 1e17;\n   long long num = -1;\n   for (int i = 0; i < v.size(); i++) {\n     int left = 0, right = v1.size() - 1, mid;\n     while (left <= right) {\n       mid = (left + right) / 2;\n       long long curr = v[i].first - v1[mid].first;\n       if (test > abs(curr - want)) {\n         test = abs(curr - want);\n         num = curr;\n         indd = v[i].second.first + 1, indd1 = v[i].second.second + 1;\n         indd2 = v1[mid].second.first + 1, indd21 = v1[mid].second.second + 1;\n       }\n       if (curr > want)\n         left = mid + 1;\n       else\n         right = mid - 1;\n     }\n   }\n   long long s = sum, s1 = sum1;\n   s -= num;\n   s1 += num;\n   if (ind == -1 && indd == -1) {\n     printf('%lld\n0', best);\n     return 0;\n   }\n   if (best > abs(s - s1)) {\n     printf('%lld\n', abs(s - s1));\n     printf('2\n%d %d\n%d %d', indd, indd2, indd1, indd21);\n   } else {\n     printf('%lld\n', best);\n     printf('1\n%d %d', ind, ind1);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long fact[100005];\n long long power(long long x, long long y, long long p) {\n   long long res = 1;\n   x = x % p;\n   while (y > 0) {\n     if (y & 1) res = ((res % p) * (x % p)) % p;\n     y = y >> 1;\n     x = ((x % p) * (x % p)) % p;\n   }\n   return res;\n }\n long long modInverse(long long n, long long p) { return power(n, p - 2, p); }\n long long nCrModFermat(long long n, long long r, long long p) {\n   if (r == 0 || r == n) return 1;\n   return (((fact[n] % p) * (modInverse(fact[r], p) % p)) % p *\n           (modInverse(fact[n - r], p) % p)) %\n          p;\n }\n void sieve(vector<bool> &isPrime) {\n   long long n = isPrime.size();\n   isPrime[0] = false;\n   isPrime[1] = false;\n   for (long long i = 2; i * i <= n; i++) {\n     if (isPrime[i] == true) {\n       for (long long j = i * i; j <= n; j += i) isPrime[j] = false;\n     }\n   }\n }\n void addEdge(vector<long long> adj[], long long u, long long v) {\n   adj[u].push_back(v);\n   adj[v].push_back(u);\n }\n void BFS(long long s, vector<long long> adj[], vector<bool> &visited) {\n   deque<long long> q;\n   q.push_back(s);\n   visited[s] = true;\n   cout << s << ' ';\n   while (!q.empty()) {\n     long long p = q.front();\n     q.pop_front();\n     for (long long i = 0; i < adj[p].size(); i++) {\n       if (visited[adj[p][i]] == false) {\n         q.push_back(adj[p][i]);\n         visited[adj[p][i]] = true;\n         cout << adj[p][i] << ' ';\n       }\n     }\n   }\n }\n void DFSUtil(long long u, vector<long long> adj[], vector<bool> &visited) {\n   visited[u] = true;\n   cout << u << ' ';\n   for (long long i = 0; i < adj[u].size(); i++)\n     if (visited[adj[u][i]] == false) DFSUtil(adj[u][i], adj, visited);\n }\n void DFS(vector<long long> adj[], long long V) {\n   vector<bool> visited(V, false);\n   for (long long u = 0; u < V; u++)\n     if (visited[u] == false) DFSUtil(u, adj, visited);\n }\n void ChubbyCoder() {\n   long long n;\n   cin >> n;\n   cout << n << '\n';\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   long long t;\n   t = 1;\n   cin >> t;\n   while (t--) {\n     ChubbyCoder();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool seat[100][100] = {0};\n int main() {\n   int n, k;\n   scanf('%d %d', &n, &k);\n   while (n--) {\n     int num, x, l, r, min_sum;\n     min_sum = 100000;\n     scanf('%d', &num);\n     for (int i = 1; i <= k; i++) {\n       for (int j = 1; j <= k - num + 1; j++) {\n         int flag, sum;\n         sum = 0;\n         flag = 0;\n         for (int m = j; m <= j + num - 1; m++) {\n           if (seat[i][m]) {\n             flag = 1;\n             break;\n           }\n           sum += abs(i - k / 2 - 1) + abs(m - k / 2 - 1);\n         }\n         if (flag == 0 && sum < min_sum) {\n           x = i;\n           l = j;\n           r = j + num - 1;\n           min_sum = sum;\n         }\n       }\n     }\n     if (min_sum == 100000)\n       printf('-1\n');\n     else {\n       printf('%d %d %d\n', x, l, r);\n       for (int i = l; i <= r; i++) seat[x][i] = 1;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   if (n % 2 == 0) {\n     if (n >= 8 && n % 4 == 0)\n       cout << ((n / 4) - 1) << endl;\n     else if (n > 4 && n < 8)\n       cout << '1' << endl;\n     else if (n <= 4)\n       cout << '0' << endl;\n     else\n       cout << (n / 4) << endl;\n   } else {\n     cout << '0' << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, shet = 0;\n   long long int ans = 0;\n   cin >> n;\n   ans = n;\n   int* mas = new int[n];\n   for (int i = 0; i < n; i++) {\n     cin >> mas[i];\n   }\n   for (int i = 1; i < n; i++) {\n     if (mas[i] == mas[i - 1]) {\n       shet++;\n       ans += shet;\n     } else {\n       shet = 0;\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int a, int b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n int main() {\n   int a, i, temp;\n   long long int sum = 0, n, fra;\n   cin >> a;\n   for (i = 2; i <= a - 1; i++) {\n     temp = a;\n     while (temp > 0) {\n       sum += temp % i;\n       temp = temp / i;\n     }\n   }\n   temp = a - 2;\n   fra = gcd(sum, temp);\n   while (fra != 1) {\n     sum = sum / fra;\n     temp = temp / fra;\n     fra = gcd(sum, temp);\n   }\n   cout << sum << '/' << temp << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   while (scanf('%d%d', &n, &m) != EOF) {\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < m; j++) {\n         if (i % 2 == 0) {\n           printf('#');\n         } else {\n           if (i / 2 % 2 == 0 && j == m - 1)\n             printf('#');\n           else if (i / 2 % 2 != 0 && j == 0)\n             printf('#');\n           else\n             printf('.');\n         }\n       }\n       puts('');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double eps = 1e-8;\n const int M = 1e5 + 5;\n const int N = 1e6 + 5;\n const int mod = 1e9 + 7;\n const double pi = acos(-1.0);\n const int INF = 0x3f3f3f3f;\n const long long lINF = 0x3f3f3f3f3f3f3f3fLL;\n const int sINF = 0xcfcfcfcf;\n char s[M * 2], s1[M];\n int mx, tmp, len;\n int main() {\n   scanf('%s', s1);\n   len = strlen(s1);\n   mx = tmp = 1;\n   strcpy(s, s1);\n   strcat(s + len, s1);\n   for (int i = 1; i < len * 2; i++) {\n     if (s[i] == s[i - 1]) {\n       mx = max(mx, tmp);\n       tmp = 1;\n     } else {\n       tmp++;\n       mx = max(mx, tmp);\n     }\n   }\n   mx = min(mx, len);\n   printf('%d\n', mx);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n  \n #define ll long long\n #define vi vector<int>\n #define pii pair<int,int>\n #define mii map<int,int>\n #define pqb priority_queue<int>\n #define pqs priority_queue<int,vi,greater<int> >\n  \n #define ff first\n #define ss second\n #define pb push_back\n #define mp make_pair\n #define PI 3.1415926535897932384626\n #define MOD 1000000007\n #define ps(x,y) fixed<<setprecision(y)<<x\n \n long long int fact[200005];\n \n long long int pwr(long long int a,long long int b){\n     if(b==0) return 1;\n     if(b==1) return a%MOD;\n     long long int q = pwr((a*a)%MOD,b/2);\n     if(b%2) return (q*a)%MOD;\n     return q;\n }\n \n long long int C(long long int a,long long int b){\n     if(b<0) return 0;\n     if(a<b) return 0;\n \n     long long int t1 = (fact[a])%MOD;\n     long long int t2 = (fact[b]*fact[a-b])%MOD;\n     t2 = pwr(t2,MOD-2)%MOD;\n \n     return (t1*t2)%MOD;\n }\n \n void solve(){\n \n     long long int n,l,r;\n     cin>>n>>l>>r;\n \n     long long int ans=0;\n     ans = C(n,n/2)%MOD;\n     if(n%2) ans = (ans*2)%MOD;\n     ans = (ans*(min(1-l,r-n)))%MOD; \n     for(long long int p=min(1-l,r-n)+1;p<=min(r,n+1-l);p++){\n         long long int a = p + l - 1;\n         if(a<=0) a = 0;\n         long long int b = n + p - r;\n         if(b<=0) b=0;\n \n         ans = (C(n-a-b,n/2-a) + ans)%MOD;\n         if(n%2) ans = (C(n-a-b,n/2-b) + ans)%MOD;\n     }\n     cout<<ans<<endl;\n \n     return;    \n } \n  \n int main(){\n \n     ios_base::sync_with_stdio(false);\n     cin.tie(NULL);\n  \n     // freopen('input.txt', 'r', stdin);\n     // freopen('error.txt', 'w', stderr);\n     // freopen('output.txt', 'w', stdout);\n \n     fact[0]=1;\n     for(long long int i=1;i<200005;i++){\n         fact[i] = (fact[i-1]*i)%MOD;\n     }\n  \n     int t=1;\n     cin>>t;\n  \n     for(int i=1;i<=t;i++){\n         // cout<<'Case #'<<i<<': ';\n         solve();\n     }\n  \n     cerr << 'time taken : ' << (float)clock() / CLOCKS_PER_SEC << ' secs' << endl;\n     return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char str[10000];\n int n, m, Q;\n map<string, int> mem;\n map<string, int>::iterator iter;\n struct Func {\n   string name;\n   int num;\n   int v[10];\n   bool operator==(const Func& A) const {\n     if (name != A.name) return false;\n     if (num != A.num) return false;\n     for (int i = 0; i < num; ++i)\n       if (v[i] * A.v[i] != 0 && v[i] != A.v[i]) return false;\n     return true;\n   }\n } g[2000], pre;\n int Type(string x) {\n   if (x == 'T') return 0;\n   if (x == 'int') return 1;\n   if (x == 'double') return 2;\n   if (x == 'string') return 3;\n   return -1;\n }\n void inputFunc(int gs) {\n   gets(str);\n   int i = 0, j = 0, len = strlen(str);\n   while (str[j] != 'd') ++j;\n   ++j;\n   while (j < len) {\n     if (str[j] != ' ') str[i++] = str[j];\n     j++;\n   }\n   len = i;\n   i = 0;\n   g[gs].name = '';\n   while (str[i] != '(') {\n     g[gs].name += str[i];\n     i++;\n   }\n   string temp = '';\n   i++;\n   for (;;) {\n     if (str[i] == ',' || str[i] == ')') {\n       g[gs].v[g[gs].num++] = Type(temp);\n       temp = '';\n       if (str[i] == ')') break;\n     } else\n       temp += str[i];\n     i++;\n   }\n }\n void inputType() {\n   string a, b;\n   cin >> a >> b;\n   mem[b] = Type(a);\n }\n void solve() {\n   gets(str);\n   int i = 0, j = 0, len = strlen(str);\n   for (j = 0; j < len; ++j) {\n     if (str[j] != ' ') str[i++] = str[j];\n   }\n   len = i;\n   i = 0;\n   pre.name = '';\n   pre.num = 0;\n   while (str[i] != '(') {\n     pre.name += str[i];\n     i++;\n   }\n   string temp = '';\n   i++;\n   for (;;) {\n     if (str[i] == ',' || str[i] == ')') {\n       pre.v[pre.num++] = mem.find(temp)->second;\n       temp = '';\n       if (str[i] == ')') break;\n     } else\n       temp += str[i];\n     i++;\n   }\n   int ans = 0;\n   for (int i = 0; i < n; ++i)\n     if (pre == g[i]) ++ans;\n   printf('%d\n', ans);\n }\n int main() {\n   scanf('%d', &n);\n   gets(str);\n   for (int i = 0; i < n; ++i) inputFunc(i);\n   scanf('%d', &m);\n   gets(str);\n   mem.clear();\n   while (m--) inputType();\n   scanf('%d', &Q);\n   gets(str);\n   while (Q--) solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1000000007;\n int main() {\n   long long n, a;\n   long long fuck = 0, fucck = 0;\n   cin >> n;\n   priority_queue<int> prio1, prio2;\n   for (int i = 0; i < n; ++i) {\n     cin >> a;\n     prio1.push(a);\n     fuck += a;\n   }\n   for (int i = 0; i < n; ++i) {\n     cin >> a;\n     prio2.push(a);\n     fucck += a;\n   }\n   prio1.push(-1);\n   prio2.push(-1);\n   long long sum1 = 0, sum2 = 0;\n   int mark = 1;\n   for (int i = 0; i < 2 * n; ++i) {\n     if (mark == 1) {\n       if (prio1.top() >= prio2.top()) {\n         fuck -= prio1.top();\n         sum1 += prio1.top();\n         prio1.pop();\n       } else {\n         fucck -= prio2.top();\n         prio2.pop();\n       }\n       mark = 2;\n     } else {\n       if (prio2.top() >= prio1.top()) {\n         fucck -= prio2.top();\n         sum2 += prio2.top();\n         prio2.pop();\n       } else {\n         fuck -= prio1.top();\n         prio1.pop();\n       }\n       mark = 1;\n     }\n   }\n   cout << (sum1 - sum2) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n pair<char, int> check(string s) {\n   map<char, int> used;\n   int l = s.size(), i, maxVal = 0;\n   char ans;\n   for (i = 0; i < l; i++) {\n     used[s.at(i)]++;\n     if (used[s.at(i)] > maxVal) {\n       maxVal = used[s.at(i)];\n       ans = s.at(i);\n     }\n   }\n   return make_pair(ans, maxVal);\n }\n int execute() {\n   int n, i, diff[4] = {0}, minVal = 10e8 + 7;\n   cin >> n;\n   vector<pair<char, int> > val(4);\n   string a[3];\n   for (i = 0; i < 3; i++) {\n     cin >> a[i];\n     val[i] = check(a[i]);\n     diff[i] = a[i].size() - val[i].second;\n     diff[i] = max(0 + (diff[i] + 1 == n && !diff[i]), diff[i] - n);\n     minVal = min(minVal, diff[i]);\n   }\n   int index;\n   for (i = 0; i < 3; i++) {\n     if (minVal == diff[i]) {\n       index = i;\n     }\n   }\n   sort(diff, diff + 3);\n   if (diff[0] == diff[1])\n     cout << 'Draw' << endl;\n   else {\n     switch (index) {\n       case (0):\n         cout << 'Kuro' << endl;\n         break;\n       case (1):\n         cout << 'Shiro' << endl;\n         break;\n       default:\n         cout << 'Katie' << endl;\n     }\n   }\n   return 0;\n }\n char mtest = false;\n unsigned short TE = 1;\n int main() {\n   ios_base::sync_with_stdio(false);\n   if (mtest) cin >> TE;\n   while (TE--) execute();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 1;\n long long a[4], mn = 1e12 + 1;\n char b, c, d;\n int main() {\n   cin >> a[0] >> a[1] >> a[2] >> a[3];\n   cin >> b >> c >> d;\n   sort(a, a + 4);\n   do {\n     long long first, second, temp;\n     if (b == '+')\n       first = a[0] + a[1];\n     else\n       first = a[0] * a[1];\n     long long a1[3];\n     a1[0] = first;\n     a1[1] = a[2];\n     a1[2] = a[3];\n     sort(a1, a1 + 3);\n     do {\n       if (c == '+')\n         second = a1[0] + a1[1];\n       else\n         second = a1[0] * a1[1];\n       if (d == '+')\n         temp = second + a1[2];\n       else\n         temp = second * a1[2];\n       mn = min(mn, temp);\n     } while (next_permutation(a1, a1 + 3));\n   } while (next_permutation(a, a + 4));\n   cout << mn;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s[100010];\n typedef struct record {\n   char ch;\n   int po;\n } rec;\n int main() {\n   int leng, ans, l, r;\n   rec tmp1, tmp2;\n   int tmp3;\n   bool flag;\n   stack<rec> st;\n   while (~scanf('%s', s)) {\n     flag = false;\n     while (!st.empty()) st.pop();\n     leng = strlen(s);\n     for (int i = 0; i < leng; i++) {\n       if (!st.empty()) tmp2 = st.top();\n       if (!st.empty() && ((tmp2.ch == '(' && s[i] == ')') ||\n                           (tmp2.ch == '[' && s[i] == ']'))) {\n         st.pop();\n       } else {\n         tmp1.ch = s[i];\n         tmp1.po = i;\n         st.push(tmp1);\n       }\n     }\n     ans = 0;\n     if (st.empty()) {\n       for (int i = 0; i < leng; i++)\n         if (s[i] == '[') ans++;\n       printf('%d\n%s\n', ans, s);\n     } else {\n       bool once = true;\n       flag = false;\n       ans = -1;\n       int tmpr, tmpl;\n       while (st.size() != 0) {\n         tmp3 = 0;\n         if (once) {\n           tmpr = leng - 1;\n           tmpl = st.top().po + 1;\n           once = false;\n         } else {\n           if (st.size() != 1) {\n             tmpr = st.top().po - 1;\n             st.pop();\n             tmpl = st.top().po + 1;\n           } else {\n             tmpr = st.top().po - 1;\n             tmpl = 0;\n             st.pop();\n           }\n         }\n         if (tmpl < tmpr) {\n           flag = true;\n           for (int j = tmpl; j <= tmpr; j++)\n             if (s[j] == '[') tmp3++;\n         }\n         if (tmp3 > ans) {\n           ans = tmp3;\n           l = tmpl;\n           r = tmpr;\n         }\n       }\n       if (flag) {\n         printf('%d\n', ans);\n         for (int i = l; i <= r; i++) printf('%c', s[i]);\n         printf('\n');\n       } else\n         printf('0\n');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize(2)\n using namespace std;\n const int INF = 0x3f3f3f3f;\n const long long inf = 0x3f3f3f3f3f3f3f3f;\n const int mod = 1e9 + 7;\n const int maxn = 1e3 + 5;\n int n, m, qq, s[maxn][maxn], f[maxn][maxn];\n bool vis[maxn][maxn];\n int a[4] = {0, 1, 0, -1};\n int b[4] = {-1, 0, 1, 0};\n bool judge(int x, int y) {\n   for (int i = 0; i <= 3; i++) {\n     int xx = x + a[i], yy = y + b[i];\n     if (xx <= 0 || xx > n || yy <= 0 || yy > m) continue;\n     if (s[xx][yy] == s[x][y]) return true;\n   }\n   return false;\n }\n void bfs() {\n   queue<pair<int, int> > q;\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= m; j++) {\n       if (judge(i, j)) {\n         vis[i][j] = 1;\n         f[i][j] = 0;\n         q.push({i, j});\n       }\n     }\n   }\n   while (!q.empty()) {\n     int x = q.front().first;\n     int y = q.front().second;\n     q.pop();\n     for (int i = 0; i <= 3; i++) {\n       int xx = x + a[i], yy = y + b[i];\n       if (xx <= 0 || xx > n || yy <= 0 || yy > m) continue;\n       if (vis[xx][yy]) continue;\n       f[xx][yy] = f[x][y] + 1;\n       vis[xx][yy] = 1;\n       q.push({xx, yy});\n     }\n   }\n }\n int main() {\n   scanf('%d%d%d', &n, &m, &qq);\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= m; j++) {\n       scanf('%1d', &s[i][j]);\n     }\n   }\n   bfs();\n   while (qq--) {\n     int x, y;\n     long long t;\n     scanf('%d%d%lld', &x, &y, &t);\n     if (vis[x][y]) {\n       if (t < f[x][y])\n         printf('%d\n', s[x][y]);\n       else\n         printf('%d\n', s[x][y] ^ ((t - f[x][y]) & 1));\n     } else {\n       printf('%d\n', s[x][y]);\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n vector<int> adj[100005];\n vector<int> vis(100005, 1);\n vector<int> ans;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int T = 1;\n   for (int qq = 1; qq <= T; qq++) {\n     cin >> n >> m;\n     for (int i = 0; i < m; i++) {\n       int x, y;\n       cin >> x >> y;\n       adj[x].push_back(y);\n       adj[y].push_back(x);\n     }\n     priority_queue<int> v;\n     v.push(-1);\n     vis[1] = 0;\n     while (!v.empty()) {\n       int u = -v.top();\n       v.pop();\n       ans.push_back(u);\n       for (auto i : adj[u])\n         if (vis[i]) v.push(-i), vis[i] = 0;\n     }\n     for (auto i : ans) cout << i << ' ';\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long inf = 1e18 + 1e17;\n const long long mod = 1e9 + 7;\n long long modInverse(long long a, long long m) {\n   long long m0 = m;\n   long long y = 0, x = 1;\n   if (m == 1) return 0;\n   while (a > 1) {\n     long long q = a / m;\n     long long t = m;\n     m = a % m, a = t;\n     t = y;\n     y = x - q * y;\n     x = t;\n   }\n   if (x < 0) x += m0;\n   return x;\n }\n long long powm(long long a, long long b) {\n   a = a % mod;\n   long long res = 1;\n   while (b) {\n     if (b & 1) res = (res * a) % mod;\n     a = (a * a) % mod;\n     b >>= 1;\n   }\n   return (res % mod);\n }\n const long long N = 5e3 + 6;\n int n, k, water;\n vector<int> v;\n int dp[N][2], dpr[N][2];\n int arr[N];\n bool brr[N];\n int ip = 1e9;\n void makedp() {\n   dp[0][0] = 1;\n   dp[0][1] = -1;\n   for (int i = 0; i < n; i++) {\n     int x = arr[i] % k;\n     memset(dpr, -1, sizeof(dpr));\n     dpr[0][0] = 1;\n     for (int j = 1; j < k; j++) {\n       if (dp[j][0] == 0 && dp[(j - x + k) % k][0] == 1) {\n         dpr[j][0] = 1;\n         dpr[j][1] = i;\n       } else {\n         dpr[j][0] = dp[j][0];\n         dpr[j][1] = dp[j][1];\n       }\n     }\n     swap(dpr, dp);\n   }\n }\n bool check() {\n   int tt = 0;\n   for (int i = 0; i < n; i++) tt += arr[i];\n   if (tt < water || dp[water % k][0] == 0) {\n     cout << 'NO\n';\n     return true;\n     ;\n   }\n   return false;\n }\n void find() {\n   int val = water % k;\n   int x = dp[val][1];\n   while (x != -1) {\n     v.push_back(dp[val][1]);\n     val = (val - arr[x] % k + k) % k;\n     x = dp[val][1];\n   }\n }\n void seperate() {\n   memset(brr, 0, sizeof(brr));\n   int tt = 0;\n   for (int i : v) {\n     brr[i] = 1;\n     tt += arr[i];\n   }\n   for (int i = 1; i < v.size(); i++)\n     cout << ip << ' ' << v[i] + 1 << ' ' << v[0] + 1 << '\n';\n   int mark = -1;\n   int tc = 0;\n   for (int i = 0; i < n; i++)\n     if (!brr[i]) {\n       mark = i;\n       tc += arr[i];\n     }\n   for (int i = 0; i < n; i++)\n     if (!brr[i] && mark != i)\n       cout << ip << ' ' << i + 1 << ' ' << mark + 1 << '\n';\n   if (v.size() == 0) v.push_back(0);\n   if (tt > water)\n     cout << (tt - water) / k << ' ' << v[0] + 1 << ' ' << (0 == v[0] ? 2 : 1)\n          << '\n';\n   else if (tt < water)\n     cout << (water - tt) / k << ' ' << mark + 1 << ' ' << v[0] + 1 << '\n';\n }\n void solve() {\n   cin >> n >> k >> water;\n   for (int i = 0; i < n; i++) cin >> arr[i];\n   makedp();\n   if (check()) return;\n   cout << 'YES\n';\n   find();\n   seperate();\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long t = 1;\n   for (long long i = 1; i <= t; i++) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int freq[27];\n char sent[101];\n int main() {\n   int n;\n   scanf('%d', &n);\n   scanf('%s', sent);\n   while (n--) {\n     if (isupper(sent[n])) sent[n] = tolower(sent[n]);\n     freq[sent[n] - 'a']++;\n   }\n   for (int i = 0; i < 26; i++)\n     if (!freq[i]) {\n       printf('NO\n');\n       return 0;\n     }\n   printf('YES\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 5;\n const int INF = 1e9 + 5;\n int read(int base = 10) {\n   int x = 0;\n   char ch = getchar();\n   while (!isdigit(ch)) ch = getchar();\n   while (isdigit(ch)) x = x * base + ch - '0', ch = getchar();\n   return x;\n }\n struct Node {\n   int num[12][2];\n } tree[N << 2];\n void push_up(int o, int l, int r) {\n   int tmp[4];\n   for (int ii = 1; ii <= 11; ii++) {\n     tmp[0] = tree[o << 1].num[ii][0];\n     tmp[1] = tree[o << 1].num[ii][1];\n     tmp[2] = tree[o << 1 | 1].num[ii][0];\n     tmp[3] = tree[o << 1 | 1].num[ii][1];\n     sort(tmp, tmp + 4);\n     tree[o].num[ii][0] = tmp[0];\n     tree[o].num[ii][1] = tmp[1];\n   }\n }\n void build(int o, int l, int r) {\n   if (l == r) {\n     int x = read();\n     int tmp = x;\n     for (int ii = 1; ii <= 11; tmp /= 10, ii++) {\n       if (tmp % 10 == 0) {\n         tree[o].num[ii][0] = tree[o].num[ii][1] = INF;\n         continue;\n       }\n       tree[o].num[ii][0] = x;\n       tree[o].num[ii][1] = INF;\n     }\n     return;\n   }\n   int mid = (l + r) >> 1;\n   build(o << 1, l, mid);\n   build(o << 1 | 1, mid + 1, r);\n   push_up(o, l, r);\n }\n int id, x;\n void update(int o, int l, int r) {\n   if (l == r) {\n     int tmp = x;\n     for (int ii = 1; ii <= 11; ii++, tmp /= 10) {\n       if (tmp % 10) {\n         tree[o].num[ii][0] = x;\n         tree[o].num[ii][1] = INF;\n       } else {\n         tree[o].num[ii][0] = tree[o].num[ii][1] = INF;\n       }\n     }\n     return;\n   }\n   int mid = (l + r) >> 1;\n   if (id <= mid)\n     update(o << 1, l, mid);\n   else\n     update(o << 1 | 1, mid + 1, r);\n   push_up(o, l, r);\n }\n int L, R, ans[12][2];\n int tmp[4];\n void query_up(int o, int i) {\n   tmp[0] = ans[i][0];\n   tmp[1] = ans[i][1];\n   tmp[2] = tree[o].num[i][0];\n   tmp[3] = tree[o].num[i][1];\n   sort(tmp, tmp + 4);\n   ans[i][0] = tmp[0];\n   ans[i][1] = tmp[1];\n }\n void query(int o, int l, int r) {\n   if (L <= l && r <= R) {\n     for (int ii = 1; ii <= 11; ii++) {\n       query_up(o, ii);\n     }\n     return;\n   }\n   int mid = (l + r) >> 1;\n   if (L <= mid) query(o << 1, l, mid);\n   if (R > mid) query(o << 1 | 1, mid + 1, r);\n }\n int main() {\n   int n = read(), m = read();\n   build(1, 1, n);\n   while (m--) {\n     int op = read();\n     if (op == 1) {\n       id = read(), x = read();\n       update(1, 1, n);\n     } else {\n       L = read(), R = read();\n       for (int i = 1; i <= 11; i++) ans[i][0] = ans[i][1] = INF;\n       query(1, 1, n);\n       int all = INF * 2;\n       ;\n       for (int i = 1; i <= 11; i++) {\n         if (ans[i][0] == INF || ans[i][1] == INF) continue;\n         all = min(all, ans[i][0] + ans[i][1]);\n       }\n       if (all == INF * 2) {\n         cout << '-1\n';\n       } else {\n         cout << all << '\n';\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename Arg1>\n void __f(const char* name, Arg1&& arg1) {\n   cerr << name << ': ' << arg1 << endl;\n }\n template <typename Arg1, typename... Args>\n void __f(const char* names, Arg1&& arg1, Args&&... args) {\n   const char* comma = strchr(names + 1, ',');\n   cerr.write(names, comma - names) << ': ' << arg1 << ' |';\n   __f(comma + 1, args...);\n }\n const int INF = 1 << 30;\n const int MOD = 1e9 + 7;\n const int N = 1e6;\n int a[N];\n double sqr(double x) { return x * x; }\n int main() {\n   int cas;\n   scanf('%d', &cas);\n   double ret = 0;\n   for (int num = 0; num < cas; ++num) {\n     int n = 250;\n     double ave = 0;\n     for (int i = 0; i < n; ++i) {\n       scanf('%d', &a[i]);\n       ave += a[i];\n     }\n     ave /= n;\n     double V = 0;\n     for (int i = 0; i < n; ++i) {\n       V += sqr(ave - a[i]);\n     }\n     V /= n;\n     double ratio = ave / V;\n     ret = max(ret, abs(ratio - 1));\n     puts(abs(ratio - 1) < 0.5 ? 'poisson' : 'uniform');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   string s;\n   cin >> s;\n   int ans = 0;\n   for (int i = 1; i < n; i++)\n     if (s[i - 1] == '.' && s[i] == '.') ans++;\n   while (m--) {\n     int k;\n     char c;\n     cin >> k >> c;\n     if (c != s[k - 1]) {\n       if (c == '.') {\n         if (k > 1 && s[k - 2] == '.') ans++;\n         if (k < n && s[k] == '.') ans++;\n       }\n       if (s[k - 1] == '.') {\n         if (k > 1 && s[k - 2] == '.') ans--;\n         if (k < n && s[k] == '.') ans--;\n       }\n       s[k - 1] = c;\n     }\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int me;\n   int bebia;\n   int iliko = 0;\n   int ilarioni = 0;\n   cin >> me;\n   for (int i = 0; i < me; i++) {\n     cin >> bebia;\n     if (bebia > 0) iliko += bebia;\n     if (bebia == -1) {\n       if (iliko - 1 < 0) {\n         ilarioni++;\n       } else\n         iliko--;\n     }\n   }\n   cout << ilarioni;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int i, j, t;\n   int n;\n   int a[105];\n   cin >> n;\n   for (i = 0; i < n; i++) cin >> a[i];\n   sort(a, a + n);\n   int b[105] = {0};\n   int cnt = 1;\n   for (i = 0; i < n; i++) {\n     for (j = 0; j <= cnt; j++) {\n       if (!b[j]) {\n         b[j]++;\n         break;\n       } else if (b[j] <= a[i]) {\n         b[j]++;\n         break;\n       }\n     }\n     if (j == cnt) cnt++;\n   }\n   cout << cnt << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int rx[4] = {0, 0, 1, -1};\n int ry[4] = {-1, 1, 0, 0};\n int main() {\n   int n, k, a, b, u, v;\n   cin >> n >> k;\n   cin >> a >> b >> u >> v;\n   if (k < n + 1 || n == 4) {\n     cout << -1 << endl;\n     return 0;\n   }\n   int ind1, ind2;\n   vector<int> p(n + 1);\n   p[1] = a;\n   int ct = 2, i = 1;\n   while (ct <= n - 1) {\n     if (i == a || i == b) {\n       i++;\n       continue;\n     }\n     p[ct] = i;\n     ct++;\n     i++;\n   }\n   p[n] = b;\n   for (int i = 1; i < n - 2; i++) {\n     if ((p[i] == u && p[i + 1] == v) || (p[i] == v && p[i + 1] == u)) {\n       swap(p[i + 1], p[i + 2]);\n     }\n   }\n   if ((p[n - 2] == u && p[n - 1] == v) || (p[n - 2] == v && p[n - 1] == u)) {\n     swap(p[n - 3], p[n - 2]);\n   }\n   for (int i = 1; i <= n; i++) {\n     if (p[i] == u) {\n       ind1 = i;\n     }\n     if (p[i] == v) {\n       ind2 = i;\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     cout << p[i] << ' ';\n   }\n   cout << endl;\n   if (u < v) {\n     int s = ind1;\n     while (s >= 1) {\n       cout << p[s] << ' ';\n       s--;\n     }\n     s = ind1 + 1;\n     while (s < ind2) {\n       cout << p[s] << ' ';\n       s++;\n     }\n     s = n;\n     while (s >= ind2) {\n       cout << p[s] << ' ';\n       s--;\n     }\n   } else {\n     int s = ind1;\n     while (s <= n) {\n       cout << p[s] << ' ';\n       s++;\n     }\n     s = ind1 - 1;\n     while (s > ind2) {\n       cout << p[s] << ' ';\n       s--;\n     }\n     s = 1;\n     while (s <= ind2) {\n       cout << p[s] << ' ';\n       s++;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s;\n   int i;\n   cin >> s;\n   for (i = 0; i < s.size(); i++) {\n     if (s[i] == 'r') cout << i + 1 << '\n';\n   }\n   for (i = s.size() - 1; i >= 0; i--) {\n     if (s[i] == 'l') cout << i + 1 << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long a, b, c, d;\n   cin >> a >> b >> c >> d;\n   long long sum = a + b + c + d;\n   if (sum % 2 == 0) {\n     if (a + b == sum / 2 || a + c == sum / 2 || a + d == sum / 2 ||\n         b + c == sum / 2 || b + d == sum / 2 || c + d == sum / 2 ||\n         a == sum / 2 || b == sum / 2 || c == sum / 2 || d == sum / 2)\n       cout << 'YES' << endl;\n     else\n       cout << 'NO' << endl;\n   } else\n     cout << 'NO' << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int i, j, r, n, x;\n   cin >> x;\n   r = x % 4;\n   if (r == 0) {\n     cout << '1'\n          << ' A';\n   }\n   if (r == 1) {\n     cout << '0'\n          << ' A';\n   }\n   if (r == 2) {\n     cout << '1'\n          << ' B';\n   }\n   if (r == 3) {\n     cout << '2'\n          << ' A';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline bool SR(int &x) { return scanf('%d', &x) == 1; }\n inline bool SR(long long &x) { return scanf('%lld', &x) == 1; }\n inline bool SR(double &x) { return scanf('%lf', &x); }\n inline bool SR(char *s) { return scanf('%s', s); }\n inline bool RI() { return 1; }\n template <typename I, typename... T>\n bool RI(I &x, T &...tail) {\n   return SR(x) && RI(tail...);\n }\n inline void SP(const int x) { printf('%d', x); }\n inline void SP(const long long x) { printf('%lld', x); }\n inline void SP(const double x) { printf('%.10f', x); }\n inline void SP(const char *s) { printf('%s', s); }\n inline void PL() { puts(''); }\n template <typename I, typename... T>\n void PL(const I x, const T... tail) {\n   SP(x);\n   if (sizeof...(tail)) putchar(' ');\n   PL(tail...);\n }\n template <typename I>\n inline void _DOING(const char *s, I &&x) {\n   cerr << s << ' = ' << x << '\n';\n }\n template <typename I, typename... T>\n void _DOING(const char *s, I &&x, T &&...tail) {\n   int c = 0;\n   while (*s != ',' || c != 0) {\n     if (*s == '(' || *s == '[' || *s == '{') c++;\n     if (*s == ')' || *s == ']' || *s == '}') c--;\n     cerr << *s++;\n   }\n   cerr << ' = ' << x << ' , ';\n   _DOING(s + 1, tail...);\n }\n const int INF = 0x3f3f3f3f;\n const long long INF64 = 0x3f3f3f3f3f3f3f3fll;\n inline int RAND() {\n   static int x = 880301;\n   return x = (x * 0xdefacedll + 1ll) % 0x7fffffffll;\n }\n int n;\n map<pair<int, int>, int> rd;\n inline bool check(long long a, int b) {\n   long long x = 1;\n   while (b) {\n     if (a >= n) return 0;\n     if (b & 1) x = x * a;\n     if (x >= n) return 0;\n     a = a * a;\n     b >>= 1;\n   }\n   return 1;\n }\n int dfs(int a, int b) {\n   if (rd.count(make_pair(a, b))) return rd[make_pair(a, b)];\n   if (!check(a, b)) return rd[make_pair(a, b)] = 1;\n   if (a == 1) {\n     if (!check(a + 1, b))\n       return rd[make_pair(a, b)] = 0;\n     else if (dfs(a + 1, b) == -1 || dfs(a, b + 1) == -1)\n       return rd[make_pair(a, b)] = 1;\n     else if (dfs(a + 1, b) == 0 || dfs(a, b + 1) == 0)\n       return rd[make_pair(a, b)] = 0;\n     else\n       return rd[make_pair(a, b)] = -1;\n   } else if (b == 1) {\n     if (1ll * a * a >= n) {\n       if ((n - a) & 1)\n         return rd[make_pair(a, b)] = -1;\n       else\n         return rd[make_pair(a, b)] = 1;\n     } else if (dfs(a + 1, b) == -1 || dfs(a, b + 1) == -1)\n       return rd[make_pair(a, b)] = 1;\n     else if (dfs(a + 1, b) == 0 || dfs(a, b + 1) == 0)\n       return rd[make_pair(a, b)] = 0;\n     else\n       return rd[make_pair(a, b)] = -1;\n   } else {\n     if (dfs(a + 1, b) == -1 || dfs(a, b + 1) == -1)\n       return rd[make_pair(a, b)] = 1;\n     else\n       return rd[make_pair(a, b)] = -1;\n   }\n }\n int main() {\n   int a, b;\n   RI(a, b, n);\n   int res = dfs(a, b);\n   if (res == 1)\n     PL('Masha');\n   else if (res == -1)\n     PL('Stas');\n   else\n     PL('Missing');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxN = 50000 + 10;\n int n;\n int B[maxN];\n vector<pair<int, int>> VB;\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) scanf('%d', &B[i]);\n   for (int i = 0; i < n; i++) {\n     VB.push_back(make_pair(B[i] + B[(i + 1) % n], i));\n   }\n   sort(VB.begin(), VB.end());\n   for (int i = 0; i < n; i++) {\n     auto p = VB[i];\n     B[p.second] = i;\n   }\n   for (int i = 0; i < n; i++) printf('%d%c', B[i], (i == n - 1) ? '\n' : ' ');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int arr[5001], k = 0;\n   string s, in;\n   stack<int> s1;\n   while (getline(cin, s)) {\n     in = in + s;\n   }\n   for (int i = 0; i < in.size(); i++) {\n     char st[5001] = {'\0'};\n     if (in[i] == '<') {\n       i++;\n       int j = 0;\n       while (in[i] != '>') {\n         st[j++] = in[i];\n         i++;\n       }\n     }\n     string st1 = 'table', st2 = 'tr', st3 = 'td', st4 = '/table', st5 = '/tr',\n            st6 = '/td';\n     if (st1.compare(st) == 0) arr[k++] = 1;\n     if (st2.compare(st) == 0) arr[k++] = 2;\n     if (st3.compare(st) == 0) arr[k++] = 3;\n     if (st4.compare(st) == 0) arr[k++] = 4;\n     if (st5.compare(st) == 0) arr[k++] = 5;\n     if (st6.compare(st) == 0) arr[k++] = 6;\n   }\n   int z = -1, max = z;\n   vector<int> v, v1;\n   for (int i = 0; i < k; i++) {\n     if (arr[i] == 1) {\n       s1.push(arr[i]);\n       v.push_back(0);\n     }\n     if (arr[i] == 2) s1.push(arr[i]);\n     if (arr[i] == 3) s1.push(arr[i]);\n     if (arr[i] == 4) {\n       s1.pop();\n       v1.push_back(v.back());\n       v.pop_back();\n     }\n     if (arr[i] == 5) s1.pop();\n     if (arr[i] == 6) {\n       s1.pop();\n       v.back()++;\n     }\n   }\n   sort(v1.begin(), v1.end());\n   for (int i = 0; i < v1.size(); i++) cout << v1[i] << ' ';\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int a, b, c;\n   int a1, b1, c1;\n   int s = 0;\n   scanf('%d%d%d%d%d%d', &a, &b, &c, &a1, &b1, &c1);\n   if (a > a1) {\n     s = s + ((a - a1) / 2);\n   } else\n     s = s - (a1 - a);\n   if (b > b1) {\n     s = s + ((b - b1) / 2);\n   } else\n     s = s - (b1 - b);\n   if (c > c1) {\n     s = s + ((c - c1) / 2);\n   } else\n     s = s - (c1 - c);\n   if (s >= 0) {\n     printf('YES');\n   } else\n     printf('NO');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main(int argc, char *argv[]) {\n   int n, tmp = 1, res = 1;\n   cin >> n;\n   int A[n][2];\n   for (int i = 0; i < n; i++) cin >> A[i][0] >> A[i][1];\n   for (int i = 0; i < n - 1; i++) {\n     if ((A[i][0] == A[i + 1][0]) && (A[i][1] == A[i + 1][1])) {\n       tmp++;\n       if (res < tmp) res = tmp;\n     } else\n       tmp = 1;\n   }\n   cout << res << endl;\n   return EXIT_SUCCESS;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n unsigned long long int expo_fast(long long int a, long long int b) {\n   a = a;\n   long long int result = 1;\n   while (b) {\n     if (b & 1) result = (result * a);\n     b >>= 1;\n     a = (a * a);\n   }\n   return (result);\n }\n void take_in(vector<long long int> *arr) {\n   for (int i = 0; i < arr->size(); i++) cin >> (*(arr))[i];\n }\n long long int gcd(long long int a, long long int b) {\n   if (b == 0) return a;\n   return gcd(b, a % b);\n }\n unsigned long long int power(long long int x, unsigned long long int y,\n                              long long int p) {\n   long long int res = 1;\n   x = x % p;\n   while (y > 0) {\n     if (y & 1) res = (res * x) % p;\n     y = y >> 1;\n     x = (x * x) % p;\n   }\n   return res;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long int n, x1, x2, done = 0;\n   cin >> n >> x1 >> x2;\n   vector<pair<long long int, long long int> > arr;\n   vector<long long int> dp(n + 1);\n   for (int i = 0; i < n; i++) {\n     long long int x;\n     cin >> x;\n     arr.push_back({x, i});\n   }\n   sort(arr.begin(), arr.end());\n   dp[n] = arr[n - 1].first;\n   for (int i = n - 1; i > 0; i--) {\n     dp[i] = max(dp[i + 1], arr[i - 1].first * (n - i + 1));\n   }\n   auto bs = [n](long long int x, long long int tar) -> long long int {\n     int low = 1, high = n, ans = n + 1;\n     while (low <= high) {\n       int mid = (low + high) / 2;\n       if (x * mid >= tar) {\n         ans = mid;\n         high = mid - 1;\n       } else\n         low = mid + 1;\n     }\n     return ans;\n   };\n   for (int i = 1; i <= n; i++) {\n     vector<int> indx;\n     long long int len = bs(arr[i - 1].first, x1);\n     if (i + len - 1 < n && dp[i + len] >= x2) {\n       done = 1;\n       cout << 'Yes\n';\n       for (int j = n; j >= 1; j--) {\n         if (dp[j] >= x2) {\n           indx.push_back(j);\n           indx.push_back(n);\n           break;\n         }\n       }\n       cout << len << ' ' << indx[1] - indx[0] + 1 << '\n';\n       for (int k = i; k < i + len; k++) cout << arr[k - 1].second + 1 << ' ';\n       cout << '\n';\n       for (int k = indx[0]; k <= n; k++) cout << arr[k - 1].second + 1 << ' ';\n       break;\n     }\n     if (!done) {\n       len = bs(arr[i - 1].first, x2);\n       if (i + len - 1 < n && dp[i + len] >= x1) {\n         done = 1;\n         cout << 'Yes\n';\n         for (int j = n; j >= 1; j--) {\n           if (dp[j] >= x1) {\n             indx.push_back(j);\n             indx.push_back(n);\n             break;\n           }\n         }\n         cout << indx[1] - indx[0] + 1 << ' ' << len << '\n';\n         for (int k = indx[0]; k <= n; k++) cout << arr[k - 1].second + 1 << ' ';\n         cout << '\n';\n         for (int k = i; k < i + len; k++) cout << arr[k - 1].second + 1 << ' ';\n         break;\n       }\n     }\n   }\n   if (!done) cout << 'No';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, k, l[100100], c[100100];\n vector<int> g[100100];\n vector<int> s;\n void dfs(int t) {\n   s.push_back(t);\n   l[t] = s.size();\n   for (auto v : g[t]) {\n     if (!l[v])\n       dfs(v);\n     else {\n       if (l[t] - l[v] + 1 >= k) {\n         printf('2\n%d\n', l[t] - l[v] + 1);\n         for (int i = l[v] - 1; i < l[t]; i++) printf('%d ', s[i]);\n         exit(0);\n       }\n     }\n   }\n   if (!c[t])\n     for (auto v : g[t]) c[v] = 1;\n   s.pop_back();\n }\n int main() {\n   int i, a, b;\n   scanf('%d %d', &n, &m);\n   for (i = 0; i < m; i++) {\n     scanf('%d %d', &a, &b);\n     g[a].push_back(b);\n     g[b].push_back(a);\n   }\n   while (k * k < n) k++;\n   dfs(1);\n   printf('1\n');\n   for (i = 1; k; i++) {\n     if (!c[i]) {\n       printf('%d ', i);\n       k--;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> v[200008];\n int val[200008];\n int n, tk;\n int dp[200008];\n int lim;\n int siz[200008];\n int cnt, tot;\n int no[200008];\n void dfs(int x, int p) {\n   no[x] = val[x] < lim;\n   dp[x] = 0;\n   int b1 = 0, b2 = 0, b3 = 0;\n   siz[x] = 1;\n   for (int i = 0; i < v[x].size(); i++) {\n     int y = v[x][i];\n     if (y == p) continue;\n     dfs(y, x);\n     siz[x] += siz[y], no[x] += no[y];\n     if (no[y] == 0)\n       b3 += siz[y];\n     else {\n       if (dp[y] > b1)\n         b2 = b1, b1 = dp[y];\n       else\n         b2 = max(b2, dp[y]);\n     }\n   }\n   if (val[x] < lim) return;\n   dp[x] = b1 + b3 + 1;\n   if (tot == no[x])\n     cnt = max(cnt, 1 + n - siz[x] + b1 + b2 + b3);\n   else\n     cnt = max(cnt, 1 + b1 + b2 + b3);\n }\n int check(int mid) {\n   lim = mid;\n   cnt = 0;\n   tot = 0;\n   for (int i = 1; i <= n; i++)\n     if (val[i] < lim) tot++;\n   dfs(1, 0);\n   return cnt >= tk;\n }\n int main() {\n   scanf('%d%d', &n, &tk);\n   for (int i = 1; i <= n; i++) scanf('%d', &val[i]);\n   for (int i = 1; i < n; i++) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     v[x].push_back(y);\n     v[y].push_back(x);\n   }\n   int l = 0, r = 1000000;\n   int ans = -1;\n   while (l <= r) {\n     int mid = (l + r) / 2;\n     if (check(mid))\n       ans = mid, l = mid + 1;\n     else\n       r = mid - 1;\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int mini(long long int p, long long int q) {\n   if (p < q) return p;\n   return q;\n }\n int main() {\n   long long int k2, k3, k5, k6, total = 0;\n   cin >> k2 >> k3 >> k5 >> k6;\n   int m = 0;\n   m = mini(k2, k5);\n   m = mini(m, k6);\n   total = m * 256;\n   m = mini(k2 - m, k3);\n   total += m * 32;\n   cout << total << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double PI = 2.0 * acos(0.0);\n inline int getInt() {\n   int x;\n   scanf('%d', &x);\n   return x;\n }\n inline long long getLL() {\n   long long x;\n   scanf('%lld', &x);\n   return x;\n };\n inline int NUM(char c) { return (int)c - 48; }\n inline char CHR(int n) { return (char)(n + 48); }\n template <class T>\n inline T MAX(T a, T b) {\n   if (a > b) return a;\n   return b;\n }\n template <class T>\n inline T MIN(T a, T b) {\n   if (a < b) return a;\n   return b;\n }\n inline void OPEN(const string &s) {\n   freopen((s + '.in').c_str(), 'r', stdin);\n   freopen((s + '.out').c_str(), 'w', stdout);\n }\n map<string, int> score, sco, mis;\n map<string, int> times;\n int main() {\n   vector<string> v;\n   for (int k = 0, _n = (5); k < _n; k++) {\n     string A, B, C;\n     cin >> A >> B;\n     cin >> C;\n     for (int i = 0, _n = ((C).size()); i < _n; i++)\n       if (C[i] == ':') C[i] = ' ';\n     stringstream ss(C);\n     int s, m;\n     ss >> s >> m;\n     if (s > m)\n       score[A] += 3;\n     else if (s < m)\n       score[B] += 3;\n     else {\n       score[A]++;\n       score[B]++;\n     }\n     sco[A] += s;\n     mis[A] += m;\n     sco[B] += m;\n     mis[B] += s;\n     v.push_back(A);\n     v.push_back(B);\n     times[A]++;\n     times[B]++;\n   }\n   sort((v).begin(), (v).end());\n   v.resize(unique((v).begin(), (v).end()) - v.begin());\n   string OTHER;\n   for (int i = 0, _n = ((v).size()); i < _n; i++) {\n     if (times[v[i]] == 2 && v[i] != 'BERLAND') OTHER = v[i];\n   }\n   vector<pair<int, pair<int, pair<int, string> > > > sorted;\n   for (int d = (1), _b = (50); d <= _b; d++) {\n     for (int m = (0), _b = (50); m <= _b; m++) {\n       int s = m + d;\n       string A, B;\n       A = 'BERLAND', B = OTHER;\n       score[A] += 3;\n       sco[A] += s;\n       sco[B] += m;\n       mis[B] += s;\n       mis[A] += m;\n       sorted.clear();\n       for (int i = 0, _n = ((v).size()); i < _n; i++) {\n         sorted.push_back(make_pair(\n             -score[v[i]],\n             make_pair(-sco[v[i]] + mis[v[i]], make_pair(-sco[v[i]], v[i]))));\n       }\n       sort((sorted).begin(), (sorted).end());\n       if (sorted[0].second.second.second == 'BERLAND' ||\n           sorted[1].second.second.second == 'BERLAND') {\n         cout << s << ':' << m << endl;\n         return 0;\n       }\n       score[A] -= 3;\n       sco[A] -= s;\n       sco[B] -= m;\n       mis[B] -= s;\n       mis[A] -= m;\n     }\n   }\n   cout << 'IMPOSSIBLE' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 1 << 20, KOR = 32000;\n const long long INF = 1e18;\n int n;\n int p[MAX];\n int sito[KOR];\n int bezp[MAX], sp[MAX];\n int cijseg, cijprom;\n vector<int> Pr;\n void Eratosten() {\n   for (int i = 2; i < KOR; i++) {\n     if (!sito[i]) {\n       Pr.push_back(i);\n       for (int j = 2 * i; j < KOR; j += i) sito[j] = i;\n     }\n   }\n }\n vector<int> Fak(int x) {\n   vector<int> R;\n   for (int i = 0; i < (int)Pr.size(); i++) {\n     if (!(x % Pr[i])) R.push_back(Pr[i]);\n     for (; !(x % Pr[i]); x /= Pr[i])\n       ;\n   }\n   if (x > 1) R.push_back(x);\n   return R;\n }\n long long Rijesi(int x) {\n   memset(bezp, 0, sizeof bezp);\n   memset(sp, 0, sizeof sp);\n   int prvi = n, zadnji = 0;\n   int ukprom = 0;\n   for (int i = 0; i < n; i++) {\n     if (!(p[i] % x)) bezp[i] = 1;\n     if (!((p[i] + 1) % x) || !((p[i] - 1) % x)) sp[i] = 1;\n     if (!bezp[i] && !sp[i]) {\n       prvi = min(prvi, i);\n       zadnji = max(zadnji, i);\n     }\n     if (!bezp[i] && sp[i]) ukprom++;\n   }\n   if (!ukprom && prvi == n) return 0;\n   long long ret = INF;\n   if (prvi == n) ret = (long long)cijprom * ukprom;\n   long long maxx = -cijseg;\n   int tprom = 0;\n   for (int i = 0; i < n; i++) {\n     if (!bezp[i] && sp[i]) tprom++;\n     if (i >= zadnji)\n       ret = min(ret, (long long)i * cijseg - maxx +\n                          ((long long)ukprom - tprom) * cijprom);\n     if (i < prvi)\n       maxx = max(maxx, (long long)-tprom * cijprom + (long long)i * cijseg);\n   }\n   return ret;\n }\n int main() {\n   Eratosten();\n   scanf('%d%d%d', &n, &cijseg, &cijprom);\n   for (int i = 0; i < n; i++) scanf('%d', &p[i]);\n   long long rje = INF;\n   vector<int> Bitni;\n   for (int i = -1; i <= 1; i++) {\n     vector<int> T = Fak(p[0] + i);\n     for (int j = 0; j < (int)T.size(); j++) Bitni.push_back(T[j]);\n   }\n   for (int i = -1; i <= 1; i++) {\n     vector<int> T = Fak(p[n - 1] + i);\n     for (int j = 0; j < (int)T.size(); j++) Bitni.push_back(T[j]);\n   }\n   sort(Bitni.begin(), Bitni.end());\n   Bitni.resize(unique(Bitni.begin(), Bitni.end()) - Bitni.begin());\n   for (int i = 0; i < (int)Bitni.size(); i++) rje = min(rje, Rijesi(Bitni[i]));\n   printf('%lld\n', rje);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long N = 1000006, MOD = 1e9 + 7, INF = 1e16;\n long long a[N], b, n, m, k, g[105][105], q, x, ans, Ans, pre[N], l, r;\n string s;\n pair<int, int> p[N];\n int main() {\n   ios_base::sync_with_stdio(false), cin.tie(0);\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++) cin >> g[i][j];\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++)\n       if (g[i][j] < 1) x = 1;\n   while (!x) {\n     Ans++;\n     q += min(n, m);\n     for (int i = 1; i <= n; i++)\n       for (int j = 1; j <= m; j++) {\n         g[i][j]--;\n         if (g[i][j] < 1) x = 1;\n       }\n   }\n   ans = 0;\n   x = 0;\n   for (int i = 1; i <= n; i++)\n     if (!g[i][1]) x = 1;\n   while (!x) {\n     ans++, r++;\n     for (int i = 1; i <= n; i++) {\n       g[i][1]--;\n       if (!g[i][1]) x = 1;\n     }\n   }\n   x = 0;\n   for (int i = 1; i <= m; i++)\n     if (!g[1][i]) x = 1;\n   while (!x) {\n     ans++, l++;\n     for (int i = 1; i <= m; i++) {\n       g[1][i]--;\n       if (!g[1][i]) x = 1;\n     }\n   }\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j <= m; j++)\n       if (g[i][j] != g[1][j] + g[i][1]) {\n         cout << -1;\n         return 0;\n       }\n   for (int i = 1; i <= n; i++) ans += g[i][1];\n   for (int i = 2; i <= m; i++) ans += g[1][i];\n   cout << ans + q << endl;\n   for (int i = 1; i <= l; i++)\n     cout << 'row'\n          << ' ' << 1 << endl;\n   for (int i = 1; i <= r; i++)\n     cout << 'col'\n          << ' ' << 1 << endl;\n   for (int i = 1; i <= n; i++)\n     for (int u = 1; u <= g[i][1]; u++)\n       cout << 'row'\n            << ' ' << i << endl;\n   for (int i = 1; i <= m; i++)\n     for (int u = 1; u <= g[1][i]; u++)\n       cout << 'col'\n            << ' ' << i << endl;\n   if (n < m)\n     s = 'row';\n   else\n     s = 'col';\n   for (int i = 0; i < min(n, m) * Ans; i++)\n     cout << s << ' ' << i % min(n, m) + 1 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, a[100010];\n long long t;\n int main() {\n   cin >> n >> m;\n   a[0] = 1;\n   for (int i = 1; i <= m; i++) {\n     cin >> a[i];\n     if (a[i] > a[i - 1]) t += (a[i] - a[i - 1]);\n     if (a[i] < a[i - 1]) t += (n - a[i - 1] + a[i]);\n   }\n   cout << t;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int n, k;\n   cin >> n >> k;\n   int i = 1;\n   for (i = k - 1; i > 0; i--) {\n     if ((n % i) == 0) break;\n   }\n   if (i == 0) i = 1;\n   int x = (n / i) * k;\n   for (; x % k != i; x++) {\n   }\n   cout << x;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n const ll INF = 4e18;\n const int MAXN = 1.1e5;\n ll T[MAXN];\n int main() {\n   ios::sync_with_stdio(0), cin.tie(0);\n   ll N, M, A, D;\n   cin >> N >> M >> A >> D;\n   for (ll i = 0; i < M; i++) {\n     cin >> T[i];\n   }\n   sort(T, T + M);\n   T[M] = INF;\n   auto getEmployee = [&](ll i) -> ll { return i <= N ? i * A : INF; };\n   ll est = 1;\n   ll cst = 0;\n   ll ans = 0;\n   while (est <= N || cst < M) {\n     ll nxt = D + min(getEmployee(est), T[cst]);\n     ll een = min(N + 1, (nxt / A) + 1);\n     ll cen = ll(upper_bound(T, T + M, nxt) - T);\n     ans++;\n     if (cst == cen) {\n       ll delta = een - est;\n       assert(delta > 0);\n       ll tgt = min(N + 1, T[cst] / A);\n       ll extra = max(tgt - een, ll(0)) / delta;\n       ans += extra;\n       een += extra * delta;\n     }\n     assert(een > est || cen > cst);\n     assert(est <= een && cst <= cen);\n     tie(est, cst) = {een, cen};\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <iostream>\n #include <cstring>\n using namespace std;\n int a[10005],s[10005];\n signed main() {\n   int T;\n   cin >> T;\n   while(T--)\n   {\n     int n;\n     cin >> n;\n     memset(s,0,sizeof s);\n     for(int i=1;i<=n;i++) cin >> a[i];\n     long long ans=0;\n     for(int i=1;i<=n;i++)\n     {\n       ans+=max(0,a[i]-s[i]-1);\n       s[i]=max(s[i],a[i]-1);\n       for(int j=i+2;j<=min(n,i+a[i]);j++)\n         ++s[j];\n       s[i+1]+=max(0,s[i]-a[i]+1);\n     }\n     cout << ans << '\n';\n   }\n   return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int l[51], r[51], a[51], c[51], dp[51][51][51];\n void inline FilterRestrictions(int i, int j, int h, vector<int> &v) {\n   vector<int> u;\n   for (int x : v) {\n     if (r[x] < i || j < l[x] || a[x] >= h) {\n       continue;\n     }\n     u.push_back(x);\n   }\n   v = u;\n   u.clear();\n   sort(v.begin(), v.end(), [](int i, int j) { return l[i] > l[j]; });\n }\n int Solve(int i, int j, int h, vector<int> v) {\n   if (j < i) {\n     return 0;\n   }\n   if (dp[i][j][h] != -1) {\n     return dp[i][j][h];\n   }\n   FilterRestrictions(i, j, h, v);\n   int ans = Solve(i, j, h - 1, v), cost = h * h;\n   vector<vector<int> > V(51 + 1);\n   vector<int> v1;\n   for (int x = i; x <= j; ++x) {\n     for (; !v.empty() && l[v.back()] == x; v.pop_back()) {\n       int k = v.back();\n       cost -= c[k];\n       V[r[k] + 1].push_back(k);\n     }\n     for (auto k : V[x]) {\n       cost += c[k];\n       v1.push_back(k);\n     }\n     int ansx = cost + Solve(i, x - 1, h, v1) + Solve(x + 1, j, h, v);\n     ans = max(ans, ansx);\n   }\n   dp[i][j][h] = ans;\n   return ans;\n }\n int main() {\n   int n, h, m;\n   cin >> n >> h >> m;\n   for (int i = 1; i <= m; ++i) {\n     cin >> l[i] >> r[i] >> a[i] >> c[i];\n   }\n   vector<int> v;\n   for (int i = 1; i <= m; ++i) {\n     v.push_back(i);\n   }\n   for (int i = 1; i <= n; ++i) {\n     for (int j = i; j <= n; ++j) {\n       for (int x = 1; x <= h; ++x) {\n         dp[i][j][x] = -1;\n       }\n     }\n   }\n   cout << Solve(1, n, h, v) << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC optimize('unroll-loops')\n #pragma GCC target( \\n     'sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native')\n using namespace std;\n template <typename T1, typename T2>\n void ckmin(T1 &a, T2 b) {\n   if (a > b) a = b;\n }\n template <typename T1, typename T2>\n void ckmax(T1 &a, T2 b) {\n   if (a < b) a = b;\n }\n int read() {\n   int x = 0, f = 0;\n   char ch = getchar();\n   while (!isdigit(ch)) f |= ch == '-', ch = getchar();\n   while (isdigit(ch)) x = 10 * x + ch - '0', ch = getchar();\n   return f ? -x : x;\n }\n template <typename T>\n void print(T x) {\n   if (x < 0) putchar('-'), x = -x;\n   if (x >= 10) print(x / 10);\n   putchar(x % 10 + '0');\n }\n template <typename T>\n void print(T x, char let) {\n   print(x), putchar(let);\n }\n const int mlen = 1 << 20;\n const int N = mlen + 5;\n const int mod = 998244353;\n unsigned long long omgs[N];\n int rev[N];\n int qpow(int a, int b = mod - 2) {\n   int res = 1;\n   while (b) {\n     if (b & 1) res = 1ll * res * a % mod;\n     a = 1ll * a * a % mod;\n     b >>= 1;\n   }\n   return res;\n }\n const int G = qpow(3, (mod - 1) / mlen);\n void setup() {\n   omgs[mlen / 2] = 1;\n   for (int i = mlen / 2 + 1; i < mlen; i++) omgs[i] = G * omgs[i - 1] % mod;\n   for (int i = mlen / 2 - 1; i > 0; i--) omgs[i] = omgs[i << 1];\n }\n int getR(int len) {\n   int lim = 1, L = 0;\n   while (lim <= len) lim <<= 1, L++;\n   for (int i = 0; i < lim; i++)\n     rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << L - 1);\n   return lim;\n }\n inline void dft(vector<int> &a, int lim) {\n   a.resize(lim);\n   static unsigned long long A[N];\n   for (int i = 0; i < lim; i++) A[rev[i]] = a[i];\n   for (int mid = 1; mid < lim; mid <<= 1) {\n     for (int i = 0; i < lim; i += mid << 1) {\n       unsigned long long *W = omgs + mid;\n       for (int j = 0; j < mid; j++) {\n         unsigned long long tmp = *(W++) * A[i + j + mid] % mod;\n         A[i + j + mid] = A[i + j] + mod - tmp;\n         A[i + j] += tmp;\n       }\n     }\n   }\n   for (int i = 0; i < lim; i++) a[i] = A[i] % mod;\n }\n inline void idft(vector<int> &a, int lim) {\n   a.resize(lim);\n   dft(a, lim), reverse(a.begin() + 1, a.end());\n   int linv = mod - (mod - 1) / lim;\n   for (int i = 0; i < lim; i++) a[i] = 1ll * a[i] * linv % mod;\n }\n vector<int> operator*(vector<int> a, vector<int> b) {\n   int len = (int(a.size())) + (int(b.size())) - 1, lim = getR(len);\n   dft(a, lim), dft(b, lim);\n   for (int i = 0; i < lim; i++) a[i] = 1ll * a[i] * b[i] % mod;\n   idft(a, lim), a.resize(len);\n   return a;\n }\n vector<int> adj[N];\n int n;\n int son[N];\n void dfs1(int u, int fa) {\n   for (auto v : adj[u]) {\n     if (v == fa) continue;\n     son[u]++;\n     dfs1(v, u);\n   }\n }\n int fac[N], ifac[N];\n inline int C(int n, int m) {\n   return 1ll * fac[n] * ifac[n - m] % mod * ifac[m] % mod;\n }\n int main() {\n   setup();\n   n = read();\n   fac[0] = 1;\n   for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % mod;\n   ifac[n] = qpow(fac[n]);\n   for (int i = n; i >= 1; i--) ifac[i - 1] = 1ll * ifac[i] * i % mod;\n   for (int i = 1; i <= n - 1; i++) {\n     int u = read(), v = read();\n     adj[u].push_back(v), adj[v].push_back(u);\n   }\n   dfs1(1, 0);\n   vector<int> f = {1};\n   sort(son + 1, son + n + 1, greater<int>());\n   for (int i = 1; i <= n; i++) {\n     int j = i;\n     while (j < n && son[i] == son[j + 1]) j++;\n     int up = j - i + 1;\n     vector<int> g(up + 1);\n     int cf = 1;\n     for (int i = 0; i <= up; i++) {\n       int coef = 1ll * C(up, i) * cf % mod;\n       g[i] = coef;\n       cf = 1ll * cf * (mod - son[j]) % mod;\n     }\n     f = f * g;\n     i = j;\n   }\n   int ans = 0;\n   for (int i = 0; i <= n - 1; i++) ans = (ans + 1ll * fac[n - i] * f[i]) % mod;\n   print(ans, '\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct MinMax {\n   int min, max;\n   MinMax() : min(INT_MAX), max(INT_MIN){};\n   MinMax(int min, int max) : min(min), max(max){};\n };\n int main(int argc, char const *argv[]) {\n   ios_base::sync_with_stdio(false);\n   int n, m;\n   cin >> n >> m;\n   MinMax a[n];\n   for (int i = 0; i < m; i++) {\n     int c;\n     cin >> c;\n     a[c - 1].min = min(a[c - 1].min, i);\n     a[c - 1].max = max(a[c - 1].max, i);\n   }\n   int sum = 0;\n   for (int i = 0; i < n; i++) {\n     int cnt = 3;\n     if (i == 0 || i == n - 1) cnt--;\n     if (a[i].min < INT_MAX) cnt--;\n     if (i < n - 1) {\n       if (a[i].min < a[i + 1].max) cnt--;\n     }\n     if (i > 0) {\n       if (a[i - 1].max > a[i].min) cnt--;\n     }\n     sum += cnt;\n   }\n   if (n == 1) sum = 0;\n   cout << sum << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long int t, n, i, j, k, h = 0;\n   cin >> n;\n   long long int a[n], b[n];\n   for (i = 0; i < n; ++i) {\n     cin >> a[i] >> b[i];\n   }\n   if (n == 1) cout << a[0] << endl;\n   if (n > 1) {\n     set<long long int> s1, s, s3;\n     set<long long int>::iterator jt, it;\n     j = a[0];\n     while (j % 2 == 0) {\n       s.insert(2);\n       j /= 2;\n     }\n     for (k = 3; k <= sqrt(j); k = k + 2) {\n       while (j % k == 0) {\n         s.insert(k);\n         j /= k;\n       }\n     }\n     if (j > 2) s.insert(j);\n     j = b[0];\n     while (j % 2 == 0) {\n       s.insert(2);\n       j /= 2;\n     }\n     for (k = 3; k <= sqrt(j); k = k + 2) {\n       while (j % k == 0) {\n         s.insert(k);\n         j /= k;\n       }\n     }\n     if (j > 2) s.insert(j);\n     j = a[1];\n     while (j % 2 == 0) {\n       s1.insert(2);\n       j /= 2;\n     }\n     for (k = 3; k <= sqrt(j); k = k + 2) {\n       while (j % k == 0) {\n         s1.insert(k);\n         j /= k;\n       }\n     }\n     if (j > 2) s1.insert(j);\n     j = b[1];\n     while (j % 2 == 0) {\n       s1.insert(2);\n       j /= 2;\n     }\n     for (k = 3; k <= sqrt(j); k = k + 2) {\n       while (j % k == 0) {\n         s1.insert(k);\n         j /= k;\n       }\n     }\n     if (j > 2) s1.insert(j);\n     for (it = s.begin(); it != s.end(); ++it) {\n       for (jt = s1.begin(); jt != s1.end(); jt++) {\n         if ((*jt) % (*it) == 0) {\n           s3.insert(*it);\n         } else if ((*it) % (*jt) == 0)\n           s3.insert(*jt);\n       }\n     }\n     s.clear();\n     for (i = 2; i < n; ++i) {\n       for (it = s3.begin(); it != s3.end(); ++it) {\n         if (a[i] % (*it) == 0) s.insert(*it);\n         if (b[i] % (*it) == 0) s.insert(*it);\n       }\n       s3.clear();\n       for (it = s.begin(); it != s.end(); ++it) {\n         s3.insert(*it);\n       }\n       s.clear();\n     }\n     if (s3.size() > 0) {\n       for (it = s3.begin(); it != s3.end(); ++it) {\n         cout << *it << endl;\n         break;\n       }\n     } else\n       cout << '-1\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n;\n   cin >> n;\n   if (n == 0)\n     cout << 1;\n   else {\n     n %= 4;\n     if (n == 0) n = 4;\n     n = pow(8, n);\n     cout << n % 10;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   vector<double> a(n), b(n);\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n     if (a[i] <= 1) {\n       printf('-1\n');\n       exit(0);\n     }\n   }\n   for (int i = 0; i < n; i++) {\n     cin >> b[i];\n     if (b[i] <= 1) {\n       printf('-1\n');\n       exit(0);\n     }\n   }\n   double s = m;\n   s += s / (b[0] - 1);\n   for (int i = n - 1; i >= 1; i--) {\n     s += s / (a[i] - 1);\n     s += s / (b[i] - 1);\n   }\n   s += s / (a[0] - 1);\n   printf('%.10f\n', s - m);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n using ull = unsigned long long;\n const int MAX_N = 1e6 + 5;\n int fen[MAX_N];\n int n;\n int lowbit(int x) { return x & (-x); }\n void add(int x, int val) {\n   for (int i = x; i <= n; i += lowbit(i)) fen[i] += val;\n }\n int sum(int x) {\n   int s = 0;\n   for (int i = x; i; i -= lowbit(i)) s += fen[i];\n   return s;\n }\n int sum(int l, int r) { return sum(r) - sum(l); }\n map<int, int> cnt;\n int pre[MAX_N];\n int back[MAX_N];\n int arr[MAX_N];\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     cin >> arr[i];\n     cnt[arr[i]]++;\n     pre[i] = cnt[arr[i]];\n   }\n   cnt.clear();\n   for (int i = n - 1; i >= 0; i--) {\n     cnt[arr[i]]++;\n     back[i] = cnt[arr[i]];\n     add(back[i], 1);\n   }\n   ll ans = 0;\n   for (int i = 0; i < n; i++) {\n     add(back[i], -1);\n     ans += sum(pre[i] - 1);\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 9;\n bool p[N];\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   vector<int> k;\n   for (int i = 2; i <= 1e6; i++) {\n     if (p[i]) continue;\n     k.push_back(i);\n     for (int j = i + i; j <= 1e6; j += i) {\n       p[j] = 1;\n     }\n   }\n   int t;\n   cin >> t;\n   while (t--) {\n     long long x;\n     cin >> x;\n     long long m = sqrtl(x);\n     long long r = upper_bound(k.begin(), k.end(), x) - k.begin();\n     long long l = upper_bound(k.begin(), k.end(), m) - k.begin();\n     cout << r - l + 1 << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1000000007;\n const int N = 100100;\n int n;\n int main() {\n   cin >> n;\n   for (int i = n + 1; i <= n + n; i++) cout << i << ' ';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double EPS = 1e-9;\n struct DDMY {\n   ostringstream o;\n   template <class T>\n   DDMY &operator,(const T &t) {\n     o << t << ',';\n     return *this;\n   }\n   string operator*() { return o.str().substr(0, o.str().size() - 1); }\n };\n template <class T>\n std::ostream &operator<<(std::ostream &o, const std::vector<T> &v) {\n   o << '[';\n   for (std::size_t i = 0; i < v.size(); i++)\n     o << v[i] << (i < v.size() - 1 ? ',' : '');\n   return o << ']';\n }\n template <class T, class U>\n std::ostream &operator<<(std::ostream &o, const std::pair<T, U> &v) {\n   return o << v.first << ':' << v.second;\n }\n template <class T, class U>\n std::ostream &operator<<(std::ostream &o, const std::map<T, U> &v) {\n   o << '{';\n   typename std::map<T, U>::const_iterator i = v.begin(), j = i;\n   ++j;\n   for (; i != v.end(); ++i, ++j) o << *i << (j != v.end() ? ',' : '');\n   return o << '}';\n }\n template <class T>\n std::ostream &operator<<(std::ostream &o, const std::set<T> &v) {\n   o << '{';\n   typename std::set<T>::const_iterator i = v.begin(), j = i;\n   ++j;\n   for (; i != v.end(); ++i, ++j) o << *i << (j != v.end() ? ',' : '');\n   return o << '}';\n }\n void error() {\n   cout << -1 << endl;\n   exit(0);\n }\n int main(int argc, char *argv[]) {\n   ios::sync_with_stdio(false);\n   int a1, a2, a3, a4;\n   cin >> a1 >> a2 >> a3 >> a4;\n   if (max(a3, a4) > a1 || max(a3, a4) > a2) {\n     error();\n   }\n   string line;\n   if (a3 >= a4) {\n     for (int i = 0; i < a3; i++) {\n       line += '47';\n     }\n     a1 -= a3;\n     a2 -= a3;\n     a4 -= a3 - 1;\n     if (a1 < 0 || a2 < 0 || a4 < 0) {\n       error();\n     }\n     if (a4 == 1) {\n       if (a1 == 0) {\n         if (a2 > 0) {\n           line = '7' + line;\n           a2--;\n           if (a2 > 0) line += string(a2, '7');\n         } else {\n           error();\n         }\n       } else {\n         line += string(a2, '7');\n         line += '4';\n         a1--;\n       }\n     } else if (a4 == 0) {\n       line += string(a2, '7');\n     } else {\n       error();\n     }\n     if (a1 > 0) line = string(a1, '4') + line;\n   } else {\n     for (int i = 0; i < a4; i++) {\n       line += '74';\n     }\n     a1 -= a4;\n     a2 -= a4;\n     a3 -= a4 - 1;\n     if (a1 < 0 || a2 < 0 || a4 < 0) {\n       error();\n     }\n     if (a3 == 0) {\n       if (a4 > 1) {\n         line = line.substr(0, line.size() - 2);\n         line = line.substr(2);\n         line = '7' + string(a1 + 1, '4') + line;\n         line += string(a2 + 1, '7') + '4';\n       } else if (a4 == 1) {\n         a1 += a4;\n         a2 += a4;\n         if (a2 > 0 && a1 > 0) {\n           line = string(a2, '7') + string(a1, '4');\n         } else {\n           error();\n         }\n       } else if (a4 == 0) {\n         if (a1 == 0 || a2 == 0) {\n           if (a1 > 0) {\n             line = string(a1, '4');\n           } else if (a2 > 0) {\n             line = string(a2, '7');\n           }\n         } else {\n           error();\n         }\n       } else {\n         error();\n       }\n     } else {\n       error();\n     }\n   }\n   cout << line << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n \n template <class T>\n inline void read(T &res)\n {\n 	res = 0; bool bo = 0; char c;\n 	while (((c = getchar()) < '0' || c > '9') && c != '-');\n 	if (c == '-') bo = 1; else res = c - 48;\n 	while ((c = getchar()) >= '0' && c <= '9')\n 		res = (res << 3) + (res << 1) + (c - 48);\n 	if (bo) res = ~res + 1;\n }\n \n const int N = 505;\n \n int n, m, a[N][N];\n \n int main()\n {\n 	read(n); read(m);\n 	for (int i = 1; i <= n; i++)\n 		for (int j = 1; j <= m; j++)\n 			read(a[i][j]);\n 	for (int i = 1; i <= n; i++)\n 	{\n 		for (int j = 1; j <= m; j++)\n 			printf('%d ', i + j & 1 ? 720720 : 720720 - a[i][j]\n 				* a[i][j] * a[i][j] * a[i][j]);\n 		puts('');\n 	}\n 	return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long double pi = 3.141592653589793238462643383279502884197;\n vector<long long int> v(14);\n void Compute() {\n   for (long long int i = 1; i < 14; i++) {\n     v[i] = pow(2, i) + v[i - 1];\n   }\n }\n void solve() {\n   long long int n;\n   cin >> n;\n   long long int ans = 0;\n   string s = to_string(n);\n   long long int si = s.size();\n   ans += v[si - 1];\n   for (long long int i = 0; i < s.size(); i++) {\n     if (s[i] == '7') ans += pow(2, (si - 1 - i));\n   }\n   ans++;\n   cout << ans << endl;\n }\n int main() {\n   Compute();\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int V = 100000 + 5;\n int n, num[V];\n int main() {\n   int i, j;\n   scanf('%d', &n);\n   for (i = 0; i < n; ++i) scanf('%d', &num[i]);\n   sort(num, num + n);\n   printf('%d ', num[n - 1]);\n   for (i = 1; i < n - 1; ++i) printf('%d ', num[i]);\n   printf('%d\n', num[0]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 10;\n const double pi = acos(-1.0);\n struct Complex {\n   double x, y;\n   Complex(double x = 0.0, double y = 0.0) {\n     this->x = x;\n     this->y = y;\n   }\n   Complex operator-(const Complex &b) const {\n     return Complex(x - b.x, y - b.y);\n   }\n   Complex operator+(const Complex &b) const {\n     return Complex(x + b.x, y + b.y);\n   }\n   Complex operator*(const Complex &b) const {\n     return Complex(x * b.x - y * b.y, x * b.y + y * b.x);\n   }\n };\n void change(Complex y[], int len) {\n   for (int i = 1, j = len / 2; i < len - 1; i++) {\n     if (i < j) swap(y[i], y[j]);\n     int k = len / 2;\n     while (j >= k) {\n       j -= k;\n       k /= 2;\n     }\n     if (j < k) j += k;\n   }\n }\n void fft(Complex y[], int len, int on) {\n   change(y, len);\n   for (int h = 2; h <= len; h <<= 1) {\n     Complex wn(cos(-on * 2 * pi / h), sin(-on * 2 * pi / h));\n     for (int j = 0; j < len; j += h) {\n       Complex w(1, 0);\n       for (int k = j; k < j + h / 2; k++) {\n         Complex u = y[k];\n         Complex t = w * y[k + h / 2];\n         y[k] = u + t;\n         y[k + h / 2] = u - t;\n         w = w * wn;\n       }\n     }\n   }\n   if (on == -1)\n     for (int i = 0; i < len; i++) y[i].x /= len;\n }\n int n, m, k, i, j, p[30];\n Complex A[N], B[N], C[N];\n int a[N], b[N];\n char sa[N], sb[N];\n int main() {\n   for (i = 1; i <= 26; i++) scanf('%d', &p[i]);\n   scanf('%s %s', sa, sb);\n   m = strlen(sa), n = strlen(sb);\n   for (i = 0, j = m - 1; i < j; i++, j--) swap(sa[i], sa[j]);\n   for (i = 0; i < m; i++) a[i] = sa[i] - 'a' + 1;\n   for (i = 0; i < n; i++) b[i] = sb[i] - 'a' + 1;\n   for (k = 1; k < n; k <<= 1)\n     ;\n   for (i = 0; i < k; i++)\n     A[i] = Complex(2 * a[i] * p[a[i]] * (a[i] + p[a[i]]), 0),\n     B[i] = Complex(b[i], 0);\n   for (fft(A, k, 1), fft(B, k, 1), i = 0; i < k; i++) C[i] = C[i] - A[i] * B[i];\n   for (i = 0; i < k; i++)\n     A[i] = Complex(a[i] * a[i] + p[a[i]] * p[a[i]] + 4 * a[i] * p[a[i]], 0),\n     B[i] = Complex(b[i] * b[i], 0);\n   for (fft(A, k, 1), fft(B, k, 1), i = 0; i < k; i++) C[i] = C[i] + A[i] * B[i];\n   for (i = 0; i < k; i++)\n     A[i] = Complex(2 * (a[i] + p[a[i]]), 0),\n     B[i] = Complex(b[i] * b[i] * b[i], 0);\n   for (fft(A, k, 1), fft(B, k, 1), i = 0; i < k; i++) C[i] = C[i] - A[i] * B[i];\n   for (i = 0; i < k; i++) {\n     if (i < m)\n       A[i] = Complex(1, 0);\n     else\n       A[i] = Complex(0, 0);\n     B[i] = Complex(b[i] * b[i] * b[i] * b[i], 0);\n   }\n   for (fft(A, k, 1), fft(B, k, 1), i = 0; i < k; i++) C[i] = C[i] + A[i] * B[i];\n   for (i = 0; i < k; i++) {\n     A[i] = Complex(a[i] * a[i] * p[a[i]] * p[a[i]], 0);\n     if (i < n)\n       B[i] = Complex(1, 0);\n     else\n       B[i] = Complex(0, 0);\n   }\n   for (fft(A, k, 1), fft(B, k, 1), i = 0; i < k; i++) C[i] = C[i] + A[i] * B[i];\n   fft(C, k, -1);\n   for (int i = 0; i < n - m + 1; i++)\n     printf('%d', ((long long)(C[i + m - 1].x + 0.5) == 0));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline void read(int& n) {\n   int x = 0, f = 1;\n   char ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9')\n     x = (x << 1) + (x << 3) + ch - '0', ch = getchar();\n   n = x * f;\n }\n int outputarray[20];\n inline void write(int k) {\n   int num = 0;\n   if (k < 0) putchar('-'), k = -k;\n   do {\n     outputarray[++num] = k % 10, k /= 10;\n   } while (k);\n   while (num) putchar(outputarray[num--] + '0');\n   puts('');\n }\n const int N = 50;\n int n, m, sg[N][N][N][N][2];\n char s[N][N];\n int dfs(int x0, int x2, int y0, int y2, int type) {\n   if (sg[x0][x2][y0][y2][type] >= 0) return sg[x0][x2][y0][y2][type];\n   int a[N * N];\n   memset(a, 0, sizeof(a));\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++)\n       if (((i + j) & 1) == type) {\n         int x = i + j, y = i - j + m;\n         if (x >= x0 && x < x2 && y >= y0 && y < y2) {\n           int tmp = 0;\n           if (s[i][j] == 'L')\n             tmp = dfs(x0, x, y0, y2, type) ^ dfs(x + 1, x2, y0, y2, type);\n           if (s[i][j] == 'R')\n             tmp = dfs(x0, x2, y0, y, type) ^ dfs(x0, x2, y + 1, y2, type);\n           if (s[i][j] == 'X')\n             tmp = dfs(x0, x, y0, y, type) ^ dfs(x0, x, y + 1, y2, type) ^\n                   dfs(x + 1, x2, y0, y, type) ^ dfs(x + 1, x2, y + 1, y2, type);\n           a[tmp] = 1;\n         }\n       }\n   while (a[++sg[x0][x2][y0][y2][type]])\n     ;\n   return sg[x0][x2][y0][y2][type];\n }\n int main() {\n   memset(sg, -1, sizeof(sg));\n   read(n), read(m);\n   for (int i = 0; i < n; i++) scanf('%s', s[i]);\n   if (dfs(0, n + m, 0, n + m, 0) ^ dfs(0, n + m, 0, n + m, 1))\n     puts('WIN');\n   else\n     puts('LOSE');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m, ans = 0;\n   cin >> n >> m;\n   while (n != m) {\n     if (n < m) {\n       if (m % 2 == 0)\n         m /= 2, ans++;\n       else\n         m++, ans++;\n     } else {\n       ans++;\n       m++;\n     }\n   }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, q;\n int matrix[52][52];\n long long pref[3][52][52];\n long long all[2][52][52][52][52];\n void precalculate() {\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= m; j++) {\n       for (int k = i; k <= n; k++) {\n         for (int ij = j; ij <= m; ij++) {\n           all[1][i][j][k][ij] = all[1][i][j][k][ij - 1] +\n                                 all[1][i][j][k - 1][ij] -\n                                 all[1][i][j][k - 1][ij - 1];\n           int r = ij - j + 1;\n           for (int c = k; c >= i && r > 0; c--) {\n             r = (r > pref[2][c][ij]) ? pref[2][c][ij] : r;\n             all[1][i][j][k][ij] += r;\n           }\n         }\n       }\n     }\n   }\n }\n int main() {\n   scanf('%d %d %d', &n, &m, &q);\n   for (int i = 1; i <= n; i++) {\n     for (int j = 1; j <= m; j++) {\n       char c = '2';\n       while (c != '0' && c != '1') scanf('%c', &c);\n       matrix[i][j] = c - 48;\n       pref[2][i][j] = pref[2][i][j - 1];\n       if (matrix[i][j] == 1)\n         pref[2][i][j] = 0;\n       else\n         pref[2][i][j]++;\n     }\n   }\n   precalculate();\n   while (q--) {\n     int a, b, c, d;\n     cin >> a >> b >> c >> d;\n     cout << all[1][a][b][c][d] << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int arr[4005];\n int nxt[4005], prv[4005];\n map<int, int> M;\n map<int, int> Q;\n int main() {\n   int n;\n   cin >> n;\n   int ans = 0;\n   for (int i = 0; i < n; ++i) {\n     cin >> arr[i];\n     if (M.find(arr[i]) != M.end()) {\n       nxt[M[arr[i]]] = i;\n       prv[i] = M[arr[i]];\n       Q[arr[i]]++;\n       ans = max(ans, Q[arr[i]]);\n     } else {\n       prv[i] = -1;\n       Q[arr[i]]++;\n       ans = max(ans, Q[arr[i]]);\n     }\n     M[arr[i]] = i;\n     nxt[i] = -1;\n   }\n   for (int i = 0; i < n; ++i) {\n     if (prv[i] != -1) {\n       continue;\n     }\n     for (int j = i + 1; j < n; ++j) {\n       if (prv[j] != -1) {\n         continue;\n       }\n       int cur = 2;\n       int t1 = i, t2 = j;\n       while (t1 != -1 && t2 != -1) {\n         if (t1 < t2) {\n           if (nxt[t1] > t2) {\n             ++cur;\n           }\n           t1 = nxt[t1];\n         } else {\n           if (nxt[t2] > t1) {\n             ++cur;\n           }\n           t2 = nxt[t2];\n         }\n       }\n       ans = max(ans, cur);\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int b = 3e6;\n long long a[b];\n void ans(long long x, long long y, long long k, long long i) {\n   long long sidl = k + k * y, ans = k;\n   long long ez1 = (sidl - 3 + x) / (x - 1);\n   ans += ez1;\n   a[i] = ans;\n }\n int main() {\n   long long t, x, y, k, j;\n   cin >> t;\n   for (int i = 0; i < t; i++) {\n     cin >> x >> y >> k;\n     ans(x, y, k, i);\n   }\n   for (int i = 0; i < t; i++) cout << a[i] << endl;\n   return 0;\n };\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int test() {\n   long long n;\n   cin >> n;\n   long long cL = 0, cR = 0;\n   long long si = 3 * 100001;\n   long long *right = new long long[si], *left = new long long[si];\n   for (long long i = 0; i < si; i++) {\n     right[i] = 0;\n     left[i] = 0;\n   }\n   long long prop = 0, l = 0, r = 0;\n   string temp;\n   for (long long i = 0; i < n; i++) {\n     cin >> temp;\n     long long tempS = temp.size();\n     for (long long i = 0; i < tempS; i++) {\n       if (temp[i] == '(') {\n         cL++;\n         l++;\n       } else {\n         cR++;\n         if (l != 0)\n           l--;\n         else\n           r++;\n       }\n     }\n     if (r != 0 && l != 0) {\n     } else if (cR == cL)\n       prop++;\n     else if (cR > cL)\n       right[cR - cL]++;\n     else\n       left[cL - cR]++;\n     l = 0;\n     r = 0;\n     cL = 0;\n     cR = 0;\n   }\n   long long S = 0;\n   for (long long i = 0; i < si; i++) {\n     if (right[i] != 0 && left[i] != 0) {\n       S += right[i] * left[i];\n     }\n   }\n   S += prop * prop;\n   cout << S;\n   return 0;\n }\n int hacker() { return 0; }\n int main() {\n   while (true) {\n     return test();\n     cout << '\n\n--';\n     hacker();\n     cout << '\n\n\n-----------------------------\n\n\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double EPS = 1e-6;\n double n, r;\n bool check(double R) {\n   double x1 = r + R;\n   double y1 = 0;\n   double x2 = cos(2 * acos(-1) / n) * (r + R);\n   double y2 = sin(2 * acos(-1) / n) * (r + R);\n   double len = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n   if (len <= 2 * R)\n     return true;\n   else\n     return false;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n >> r;\n   double l1 = 0, r1 = 10000;\n   for (int i = 0; i < 500; i++) {\n     double mm = (l1 + r1) / 2.0;\n     if (check(mm))\n       r1 = mm;\n     else\n       l1 = mm;\n   }\n   cout.fixed;\n   cout.precision(15);\n   cout << l1;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a, b, c;\n   cin >> a;\n   cin >> b;\n   cin >> c;\n   int d = a + b - c;\n   int e = b + c - a;\n   int f = a + c - b;\n   if (d < 0 || e < 0 || f < 0 || e % 2 || d % 2 || f % 2) {\n     cout << 'Impossible';\n     return 0;\n   }\n   cout << d / 2 << ' ' << e / 2 << ' ' << f / 2 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct node {\n   int l, r, num;\n } a[100005];\n int n, ans[100005];\n bool cmp(node x, node y) {\n   if (x.l == y.l) return x.r < y.r;\n   return x.l < y.l;\n }\n void solve() {\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i].l >> a[i].r;\n     a[i].num = i + 1;\n   }\n   sort(a + 1, a + n + 1, cmp);\n   set<int> F;\n   int mx = -1;\n   for (int i = 1; i <= n - 1; i++) {\n     F.insert(a[i].num);\n     mx = max(mx, a[i].r);\n     if (mx < a[i + 1].l) {\n       for (int j = 1; j <= n; j++) {\n         if (F.count(a[j].num))\n           ans[a[j].num] = 1;\n         else\n           ans[a[j].num] = 2;\n       }\n       for (int j = 2; j <= n + 1; j++) cout << ans[j] << ' ';\n       cout << endl;\n       return;\n     }\n   }\n   cout << -1 << endl;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int T;\n   cin >> T;\n   while (T--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int n, a, b, c, d, e, f, g, h;\n   cin >> n;\n   vector<long long int> values(n), kalues(n), malues;\n   for (int i = 0; i < n; i++) {\n     cin >> values[i];\n     cin >> kalues[i];\n     kalues[i]--;\n     malues.push_back(values[i]);\n     malues.push_back(kalues[i]);\n   }\n   sort(values.begin(), values.end());\n   sort(kalues.begin(), kalues.end());\n   sort(malues.begin(), malues.end());\n   long long int mini = -5, year = -1;\n   malues.erase(unique(malues.begin(), malues.end()), malues.end());\n   for (int i = 0; i < 2 * n; i++) {\n     long long int helebele =\n         lower_bound(kalues.begin(), kalues.end(), malues[i]) - kalues.begin();\n     helebele += n - (upper_bound(values.begin(), values.end(), malues[i]) -\n                      values.begin());\n     if (mini < n - helebele) mini = n - helebele, year = malues[i];\n   }\n   cout << year << ' ' << mini << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s[55];\n int l;\n int df[55][10];\n int f(int pos, int c) {\n   if (pos == l) return 1;\n   if (df[pos][c] != -1) return df[pos][c];\n   int res = 0;\n   int nn = c + s[pos];\n   res += f(pos + 1, nn / 2);\n   if (nn & 1) res += f(pos + 1, (nn + 1) / 2);\n   return df[pos][c] = res;\n }\n bool good() {\n   for (int i = 1; i < l; i++) {\n     int nn = s[i] + s[i - 1];\n     if (nn & 1) {\n       if (nn / 2 != s[i] && (nn + 1) / 2 != s[i]) return false;\n     } else {\n       if (nn / 2 != s[i]) return false;\n     }\n   }\n   return true;\n }\n int main() {\n   memset(df, -1, sizeof(df));\n   scanf('%s', s);\n   l = strlen(s);\n   for (int i = 0; i < l; i++) s[i] -= '0';\n   long long ans = 0;\n   for (int i = 0; i < 10; i++) ans += f(1, i);\n   if (good()) ans--;\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int INF = 1e9;\n using namespace std;\n int R, C, frow, fcol, row, col, srow, scol, nxcol, nxrow;\n int ans, intest[1005][1005], goal;\n char grid[1005][1005];\n queue<pair<int, int> > q;\n const int dr[4] = {-1, 0, 1, 0};\n const int dc[4] = {0, -1, 0, 1};\n bool inside(int r, int c) { return r > 0 && c > 0 && r <= R && c <= C; }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> R >> C;\n   for (int r = 1; r <= R; r++) {\n     for (int c = 1; c <= C; c++) {\n       cin >> grid[r][c];\n       intest[r][c] = INF;\n       if (grid[r][c] == 'S')\n         srow = r, scol = c;\n       else if (grid[r][c] == 'E')\n         frow = r, fcol = c;\n     }\n   }\n   intest[frow][fcol] = 0;\n   q.push(make_pair(frow, fcol));\n   while (!q.empty()) {\n     pair<int, int> cur = q.front();\n     q.pop();\n     row = cur.first;\n     col = cur.second;\n     for (int i = 0; i <= 3; i++) {\n       nxrow = row + dr[i];\n       nxcol = col + dc[i];\n       if (!inside(nxrow, nxcol)) continue;\n       if (grid[nxrow][nxcol] == 'T') continue;\n       if (intest[nxrow][nxcol] != INF) continue;\n       intest[nxrow][nxcol] = intest[row][col] + 1;\n       q.push(make_pair(nxrow, nxcol));\n     }\n   }\n   goal = intest[srow][scol];\n   for (int i = 1; i <= R; i++) {\n     for (int j = 1; j <= C; j++) {\n       if (grid[i][j] - '0' > 0 && grid[i][j] < 58) {\n         srow = i, scol = j;\n         if (intest[srow][scol] <= goal) ans += (grid[i][j] - '0');\n       }\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   int a[n];\n   for (int i = 0; i < n; i++) cin >> a[i];\n   sort(a, a + n);\n   for (int i = 0; i < n; i++) cout << a[i] << ' ';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int x, y, z;\n int _x, _y, _z;\n int a[6];\n long long int ans = 0LL;\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> x >> y >> z;\n   cin >> _x >> _y >> _z;\n   for (int i = 0; i < 6; i++) cin >> a[i];\n   if (y < 0) ans += a[0];\n   if (y > _y) ans += a[1];\n   if (z < 0) ans += a[2];\n   if (z > _z) ans += a[3];\n   if (x < 0) ans += a[4];\n   if (x > _x) ans += a[5];\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int SZ = 8e6 + 10;\n const int INF = 1e9 + 10;\n const int mod = 998244353;\n const long double eps = 1e-8;\n long long read() {\n   long long n = 0;\n   char a = getchar();\n   bool flag = 0;\n   while (a > '9' || a < '0') {\n     if (a == '-') flag = 1;\n     a = getchar();\n   }\n   while (a <= '9' && a >= '0') {\n     n = n * 10 + a - '0', a = getchar();\n   }\n   if (flag) n = -n;\n   return n;\n }\n int a[SZ], f[1010][1010], b[SZ], c[SZ];\n int main() {\n   int n = read(), k = read();\n   for (int i = 1; i <= n; i++) a[i] = read();\n   sort(a + 1, a + 1 + n);\n   for (int i = 1; i <= n; i++) {\n     for (int j = i + 1; j <= n; j++) {\n       b[++b[0]] = a[j] - a[i];\n     }\n   }\n   sort(b + 1, b + 1 + b[0]);\n   b[0] = unique(b + 1, b + 1 + b[0]) - b - 1;\n   int ans = 0;\n   for (int j = 1; j <= b[0]; j++) {\n     int minx = b[j];\n     if (minx > 1e5 / (k - 1)) break;\n     for (int i = 1; i <= n; i++) f[i][1] = f[i - 1][1] + 1;\n     for (int l = 2; l <= k; l++) {\n       for (int i = 2, lst = 0; i <= n; i++) {\n         while (lst < i && a[lst + 1] <= a[i] - minx) lst++;\n         f[i][l] = f[lst][l - 1];\n       }\n       for (int i = 1; i <= n; i++) (f[i][l] += f[i - 1][l]) %= mod;\n     }\n     c[j] = f[n][k];\n   }\n   for (int j = 1; j <= b[0]; j++)\n     (ans += 1ll * b[j] * (c[j] - c[j + 1] + mod) % mod) %= mod;\n   printf('%d\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int book[3];\n char s[105], rs[105];\n int main() {\n   int t, ans, n;\n   scanf('%d', &t);\n   for (int i = 0; i < t; i++) {\n     scanf('%d', &n);\n     ans = 0;\n     memset(rs, '\0', sizeof(rs));\n     for (int i = 0; i < 3; i++) {\n       scanf('%d', &book[i]);\n     }\n     scanf('%s', s);\n     for (int i = 0; i < n; i++) {\n       if (s[i] == 'R') {\n         if (book[1] > 0) {\n           ans++;\n           book[1]--;\n           rs[i] = 'P';\n         }\n       } else if (s[i] == 'P') {\n         if (book[2] > 0) {\n           ans++;\n           book[2]--;\n           rs[i] = 'S';\n         }\n       } else {\n         if (book[0] > 0) {\n           ans++;\n           book[0]--;\n           rs[i] = 'R';\n         }\n       }\n     }\n     if (ans >= (n + 1) / 2) {\n       int k = 0;\n       for (int i = 0; i < n; i++) {\n         if (rs[i] == '\0') {\n           while (book[k] == 0) k++;\n           if (k == 0)\n             rs[i] = 'R';\n           else if (k == 1)\n             rs[i] = 'P';\n           else\n             rs[i] = 'S';\n           book[k]--;\n         }\n       }\n       printf('YES\n%s\n', rs);\n     } else\n       printf('NO\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 5;\n long long le[N], ri[N], mid, lee, rii;\n long long a[N], b[N], c[N], mp[35], ans, n, answ, idx, idx1, pw[35], bb;\n int main() {\n   std::ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n   }\n   pw[0] = 1;\n   for (int i = 1; i <= 35; i++) {\n     pw[i] = pw[i - 1] * 2;\n   }\n   for (int i = 0; i <= 30; i++) {\n     for (int j = 1; j <= n; j++) {\n       b[j] += a[j] & pw[i];\n       c[j] = b[j];\n     }\n     std::stable_sort(c + 1, c + n + 1);\n     idx = n;\n     for (int j = 1; j <= n; j++) {\n       idx = max(idx, j + 1LL);\n       bb = 0;\n       while (c[j] + c[idx] >= pw[i] && idx > j) {\n         idx--;\n         bb = 1;\n       }\n       if (bb == 1) idx++;\n       if (c[j] + c[idx] < pw[i] || idx > n)\n         le[j] = -1;\n       else\n         le[j] = idx;\n     }\n     idx = n;\n     for (int j = 1; j <= n; j++) {\n       idx = max(idx, j + 1LL);\n       while (c[j] + c[idx] >= pw[i + 1] && idx > j + 1) {\n         idx--;\n       }\n       if (c[j] + c[idx] >= pw[i + 1] || idx > n)\n         ri[j] = -1;\n       else\n         ri[j] = idx;\n     }\n     for (int j = 1; j <= n; j++) {\n       if (le[j] != -1 && ri[j] != -1) mp[i] += ri[j] - le[j] + 1;\n     }\n     idx = n;\n     for (int j = 1; j <= n; j++) {\n       idx = max(idx, j + 1LL);\n       bb = 0;\n       while (c[j] + c[idx] >= pw[i + 1] + pw[i] && idx > j) {\n         bb = 1;\n         idx--;\n       }\n       if (bb == 1) idx++;\n       if (c[j] + c[idx] < pw[i + 1] + pw[i] || idx > n)\n         le[j] = -1;\n       else\n         le[j] = idx;\n     }\n     idx = n;\n     for (int j = 1; j <= n; j++) {\n       idx = max(idx, j + 1LL);\n       while (c[j] + c[idx] >= pw[i + 2] && idx > j + 1) {\n         idx--;\n       }\n       if (c[j] + c[idx] >= pw[i + 2] || idx > n)\n         ri[j] = -1;\n       else\n         ri[j] = idx;\n     }\n     for (int j = 1; j <= n; j++) {\n       if (le[j] != -1 && ri[j] != -1) mp[i] += ri[j] - le[j] + 1;\n     }\n   }\n   for (int i = 0; i <= 30; i++) {\n     if (mp[i] % 2) answ += (1LL << i);\n   }\n   cout << answ << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[20000], num[20000];\n int dp[400];\n int n, m, t, k, ans, maxm;\n int main() {\n   scanf('%d%d', &n, &m);\n   maxm = 0;\n   ans = 0;\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &a[i]);\n     num[a[i]]++;\n     maxm = max(maxm, num[a[i]]);\n   }\n   t = min(n, m);\n   k = t;\n   int temp = 0;\n   while (--k) {\n     temp += n;\n     for (int i = 1; i <= n; i++) a[temp + i] = a[i];\n   }\n   for (int i = 1; i <= n * t; i++) {\n     dp[a[i]]++;\n     for (int j = a[i] - 1; j >= 0; j--) dp[a[i]] = max(dp[a[i]], dp[j] + 1);\n     ans = max(dp[a[i]], ans);\n   }\n   ans += maxm * (m - t);\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int inf = 1500000000;\n const int d = 1e9 + 7;\n using namespace std;\n struct triple {\n   int a;\n   int b;\n   int c;\n   bool flag;\n   triple() { flag = true; }\n };\n int main() {\n   int n;\n   cin >> n;\n   vector<triple> t(n - 1, triple());\n   vector<int> adj[n + 1];\n   for (int i = 1; i <= n - 2; i++) {\n     cin >> t[i].a >> t[i].b >> t[i].c;\n     adj[t[i].a].push_back(i);\n     adj[t[i].b].push_back(i);\n     adj[t[i].c].push_back(i);\n   }\n   int first;\n   triple f;\n   for (int i = 1; i <= n; i++) {\n     if (adj[i].size() == 1) {\n       first = i;\n       f = t[adj[i][0]];\n       break;\n     }\n   }\n   int second;\n   if (adj[f.a].size() == 2) {\n     second = f.a;\n   }\n   if (adj[f.b].size() == 2) {\n     second = f.b;\n   }\n   if (adj[f.c].size() == 2) {\n     second = f.c;\n   }\n   vector<int> perm;\n   perm.push_back(first);\n   perm.push_back(second);\n   while (perm.size() != n) {\n     int third;\n     for (int i = 0; i < adj[first].size(); i++) {\n       int ind = adj[first][i];\n       if (t[ind].flag == true) {\n         t[ind].flag = false;\n         third = (t[ind].a + t[ind].b + t[ind].c) - first - second;\n         perm.push_back(third);\n         first = second;\n         second = third;\n         break;\n       }\n     }\n   }\n   for (int i = 0; i < perm.size(); i++) cout << perm[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int k;\n string s;\n int main() {\n   cin >> k;\n   cin >> s;\n   int n = s.length();\n   for (int i = 0; i < n; ++i) {\n     if (s[i] == '?' && s[n - i - 1] == '?') {\n       continue;\n     } else if (s[i] == '?') {\n       s[i] = s[n - i - 1];\n     } else if (s[n - i - 1] == '?') {\n       s[n - i - 1] = s[i];\n     } else if (s[i] != s[n - i - 1]) {\n       cout << 'IMPOSSIBLE';\n       return 0;\n     }\n   }\n   bool flag[26];\n   memset(flag, 0, sizeof(flag));\n   for (int i = 0; i < n; ++i) {\n     if (s[i] != '?') {\n       flag[s[i] - 'a'] = true;\n     }\n   }\n   int miss = 0;\n   for (int c = 0; c < k; ++c) {\n     if (!flag[c]) {\n       ++miss;\n     }\n   }\n   int have = 0;\n   for (int i = 0; i <= n - i - 1; ++i) {\n     if (s[i] == '?') {\n       ++have;\n     }\n   }\n   if (miss > have) {\n     cout << 'IMPOSSIBLE';\n     return 0;\n   }\n   for (int i = 0; i < n; ++i) {\n     if (s[i] == '?') {\n       if (have > miss) {\n         s[i] = s[n - i - 1] = 'a';\n       } else {\n         for (int c = 0; c < k; ++c) {\n           if (!flag[c]) {\n             s[i] = s[n - i - 1] = c + 'a';\n             flag[c] = true;\n             break;\n           }\n         }\n         --miss;\n       }\n       --have;\n     }\n   }\n   cout << s << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long double EPS = 1e-10;\n const long long int MOD = 1000000007ll;\n const long long int mod1 = 1000000009ll;\n const long long int mod2 = 1100000009ll;\n int INF = (int)1e9;\n long long int INFINF = (long long int)1e18;\n int debug = 0;\n long double PI = acos(-1.0);\n using namespace std;\n long long int bit_count(long long int _x) {\n   long long int _ret = 0;\n   while (_x) {\n     if (_x % 2 == 1) _ret++;\n     _x /= 2;\n   }\n   return _ret;\n }\n long long int bit(long long int _mask, long long int _i) {\n   return (_mask & (1 << _i)) == 0 ? 0 : 1;\n }\n long long int powermod(long long int _a, long long int _b,\n                        long long int _m = MOD) {\n   long long int _r = 1;\n   while (_b) {\n     if (_b % 2 == 1) _r = (_r * _a) % _m;\n     _b /= 2;\n     _a = (_a * _a) % _m;\n   }\n   return _r;\n }\n long long int add(long long int a, long long int b, long long int m = MOD) {\n   long long int x = a + b;\n   while (x >= m) x -= m;\n   while (x < 0) x += m;\n   return x;\n }\n long long int sub(long long int a, long long int b, long long int m = MOD) {\n   long long int x = a - b;\n   while (x < 0) x += m;\n   while (x >= m) x -= m;\n   return x;\n }\n long long int mul(long long int a, long long int b, long long int m = MOD) {\n   long long int x = a * 1ll * b;\n   x %= m;\n   if (x < 0) x += m;\n   return x;\n }\n int N, M, K;\n vector<int> G[1010];\n bool spec[1010];\n bool vis[1010];\n int tot, cnt;\n vector<int> sizes;\n void dfs(int u) {\n   tot++;\n   cnt++;\n   vis[u] = true;\n   for (int v : G[u]) {\n     if (!vis[v]) {\n       dfs(v);\n     }\n   }\n }\n int main() {\n   if (0) {\n     freopen('input.txt', 'r', stdin);\n     debug = 1;\n   }\n   srand(time(NULL));\n   scanf('%d', &N);\n   scanf('%d', &M);\n   scanf('%d', &K);\n   for (int i = 1; i <= K; i++) {\n     int x;\n     scanf('%d', &x);\n     spec[x] = true;\n   }\n   for (int i = 1; i <= M; i++) {\n     int u, v;\n     scanf('%d', &u);\n     scanf('%d', &v);\n     G[u].push_back(v);\n     G[v].push_back(u);\n   }\n   for (int i = 1; i <= N; i++) {\n     if (spec[i]) {\n       cnt = 0;\n       dfs(i);\n       sizes.push_back(cnt);\n     }\n   }\n   sort(sizes.begin(), sizes.end());\n   reverse(sizes.begin(), sizes.end());\n   sizes[0] += (N - tot);\n   long long int ans = 0;\n   for (int it : sizes) {\n     ans += (it * (it - 1)) / 2;\n   }\n   cout << ans - M;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename Q>\n void inin(Q &x) {\n   x = 0;\n   int f = 0;\n   char ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') f = 1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();\n   x = f ? -x : x;\n }\n int n, a[100010], b[100010];\n long long sum[100010], ans[100010], tot[100010];\n int erfen(int x, int l, int r) {\n   int ll = l, rr = r, mid;\n   while (ll < rr) {\n     mid = (ll + rr) >> 1;\n     if (sum[mid] - sum[l - 1] < x)\n       ll = mid + 1;\n     else\n       rr = mid;\n   }\n   if (ll == n && sum[n] - sum[l - 1] < x) return n + 1;\n   return ll;\n }\n int main() {\n   inin(n);\n   for (int i = (1); i <= (n); i++) inin(a[i]);\n   for (int i = (1); i <= (n); i++) inin(b[i]), sum[i] = sum[i - 1] + b[i];\n   for (int i = (1); i <= (n); i++) {\n     int x = erfen(a[i], i, n);\n     tot[x]--;\n     ans[x] += a[i] - (sum[x - 1] - sum[i - 1]);\n     tot[i] += tot[i - 1] + 1;\n     ans[i] += 1LL * b[i] * tot[i];\n   }\n   for (int i = (1); i <= (n); i++) printf('%lld ', ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long mod = 1e9 + 7;\n const long long sze = 1e5 + 2;\n const long long inf = 0x3f3f3f3f;\n void solve() {\n   long long n, k;\n   cin >> n;\n   cin >> k;\n   long long swap = k;\n   long long last = n;\n   long long i = 1;\n   bool turn = true;\n   while (swap) {\n     if (turn) {\n       cout << i << ' ';\n       i++;\n       turn = false;\n     } else {\n       cout << last << ' ';\n       last--;\n       turn = true;\n     }\n     swap--;\n   }\n   if (k % 2 == 0) {\n     while (last >= i) {\n       cout << last << ' ';\n       last--;\n     }\n     return;\n   }\n   while (i <= last) {\n     cout << i << ' ';\n     i++;\n   }\n }\n signed main() {\n   long long test = 1;\n   while (test--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int a, b;\n   vector<pair<int, int> > v, re;\n   scanf('%d %d ', &a, &b);\n   v.push_back(make_pair(a, b));\n   scanf('%d %d ', &a, &b);\n   v.push_back(make_pair(a, b));\n   scanf('%d %d ', &a, &b);\n   v.push_back(make_pair(a, b));\n   sort(v.begin(), v.end());\n   pair<int, int> A = v[0], B = v[1], C = v[2];\n   int x = A.first, y = A.second;\n   re.push_back(make_pair(x, y));\n   if (C.second > A.second) {\n     int dy = max(min(B.second, C.second), A.second);\n     for (int i = A.second + 1; i <= dy; i++) {\n       re.push_back(make_pair(x, i));\n     }\n     y = dy;\n     for (int i = A.first + 1; i <= C.first; i++) {\n       re.push_back(make_pair(i, y));\n     }\n     x = C.first;\n     for (int i = y + 1; i <= C.second; i++) {\n       re.push_back(make_pair(x, i));\n     }\n   } else {\n     int dy = min(max(B.second, C.second), A.second);\n     for (int i = A.second - 1; i >= dy; i--) {\n       re.push_back(make_pair(x, i));\n     }\n     y = dy;\n     for (int i = A.first + 1; i <= C.first; i++) {\n       re.push_back(make_pair(i, y));\n     }\n     x = C.first;\n     for (int i = y - 1; i >= C.second; i--) {\n       re.push_back(make_pair(x, i));\n     }\n   }\n   if (B.second > y) {\n     for (int i = y + 1; i <= B.second; i++) {\n       re.push_back(make_pair(B.first, i));\n     }\n   } else {\n     for (int i = y - 1; i >= B.second; i--) {\n       re.push_back(make_pair(B.first, i));\n     }\n   }\n   printf('%d\n', re.size());\n   for (int i = 0; i < re.size(); i++) {\n     printf('%d %d\n', re[i].first, re[i].second);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int len, pos;\n void insert(int x) {\n   len++;\n   if (x <= pos) pos++;\n }\n void erase(int x) {\n   if (x >= pos)\n     len = x;\n   else\n     len -= x, pos -= x;\n }\n int main() {\n   int m, t;\n   scanf('%d%d%d%d', &len, &pos, &m, &t);\n   while (t--) {\n     int type, x;\n     scanf('%d%d', &type, &x);\n     if (type == 1)\n       insert(x);\n     else\n       erase(x);\n     printf('%d %d\n', len, pos);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n const int sz = 5e5 + 10;\n int ar[sz];\n int main() {\n   int n, ans;\n   while (cin >> n) {\n     for (int i = 0; i < n; i++) cin >> ar[i];\n     sort(ar, ar + n);\n     ans = n;\n     for (int i = n - 1, j = (n / 2) - 1; j >= 0; j--) {\n       if (ar[i] >= ar[j] * 2) {\n         ans--;\n         i--;\n       }\n     }\n     cout << ans << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int DX[8] = {1, -1, 0, 0, 1, 1, -1, -1};\n const int DY[8] = {0, 0, 1, -1, 1, -1, 1, -1};\n const int intmax = 0x7fffffff;\n map<int, int> mp;\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int i = 0; i < n; i++) {\n     int a;\n     scanf('%d', &a);\n     mp[a]++;\n   }\n   map<int, int>::iterator it = mp.begin();\n   int deg = (it->second) * 2;\n   int last = it->first;\n   it++;\n   for (; it != mp.end(); it++) {\n     if ((it->first) != last + 1) {\n       puts('NO');\n       return 0;\n     }\n     if (!deg) {\n       puts('NO');\n       return 0;\n     }\n     deg = it->second * 2 - deg;\n     if (deg < 0) {\n       puts('NO');\n       return 0;\n     }\n     last = it->first;\n   }\n   if (!deg)\n     puts('YES');\n   else\n     puts('NO');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long double PI = acos(-1);\n const long double eps = 0.0000000001;\n const long long INF = 0x3fffffffffffffff;\n long long a[200005], sum[200005], n, q, x, y;\n long long lowbit(long long now) { return now & -now; }\n void add(long long pos, long long v) {\n   while (pos <= n) {\n     sum[pos] += v;\n     pos += lowbit(pos);\n   }\n }\n long long query(long long now) {\n   long long res = 0;\n   while (now) {\n     res += sum[now];\n     now ^= lowbit(now);\n   }\n   return res;\n }\n long long findnext(long long now) {\n   long long l = now + 1, r = n + 1, v = query(now);\n   while (l < r) {\n     long long mid = (l + r) >> 1;\n     if (query(mid) < v << 1) {\n       l = mid + 1;\n     } else {\n       r = mid;\n     }\n   }\n   return l;\n }\n signed main() {\n   ios::sync_with_stdio(false);\n   cin >> n >> q;\n   for (long long i = 1; i <= n; ++i) {\n     cin >> a[i];\n     add(i, a[i]);\n   }\n   for (long long i = 1; i <= q; ++i) {\n     cin >> x >> y;\n     add(x, -a[x]);\n     a[x] = y;\n     add(x, a[x]);\n     long long now = 1;\n     bool flag = false;\n     if (a[1] == 0) {\n       cout << 1 << endl;\n       continue;\n     }\n     while (now <= n) {\n       now = findnext(now);\n       if (now <= n && query(now) == a[now] << 1) {\n         cout << now << endl;\n         flag = true;\n         break;\n       }\n     }\n     if (!flag) {\n       cout << -1 << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int n, p, q, b, l;\n long long int gcd(long long int a, long long int c) {\n   if (!c) return a;\n   return gcd(c, a % c);\n }\n long long int read_ll() {\n   char ch;\n   long long int num = 0;\n   ch = getchar();\n   while (!isdigit(ch)) {\n     ch = getchar();\n   }\n   while (isdigit(ch)) {\n     num = num * 10 + (long long int)ch - (long long int)'0';\n     ch = getchar();\n   }\n   return num;\n }\n int main() {\n   scanf('%ld', &n);\n   while (n--) {\n     p = read_ll();\n     q = read_ll();\n     b = read_ll();\n     long long int d = gcd(p, q);\n     p = p / d;\n     q = q / d;\n     while (1) {\n       b = gcd(q, b);\n       if (b == 1) {\n         if (q == 1)\n           printf('Finite\n');\n         else\n           printf('Infinite\n');\n         break;\n       }\n       while (q % b == 0) q /= b;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n #pragma comment(linker, '/STACK:100000000')\n int n;\n double l;\n pair<int, int> 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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long h, n;\n   cin >> h >> n;\n   long long l = 1, r = (1LL << h), ret = 0, cur = 0, dir = 0;\n   while (cur < h) {\n     long long size = (1LL << (h - cur)), mid = (l + r) / 2;\n     if (dir == 0) {\n       if (n <= mid)\n         ++ret, r = mid, dir = 1;\n       else\n         ret += size, l = mid + 1;\n     } else {\n       if (n <= mid)\n         ret += size, r = mid;\n       else\n         ++ret, l = mid + 1, dir = 0;\n     }\n     ++cur;\n   }\n   cout << ret << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx')\n template <class T = int>\n inline T readInt();\n inline double readDouble();\n inline int readUInt();\n inline int readChar();\n inline void readWord(char *s);\n inline bool readLine(char *s);\n inline bool isEof();\n inline int getChar();\n inline int peekChar();\n inline bool seekEof();\n inline void skipBlanks();\n inline std::string readString();\n template <class T>\n inline void writeInt(T x, char end = 0, int len = -1);\n inline void writeChar(int x);\n inline void writeWord(const char *s);\n inline void writeDouble(double x, int len = 0);\n inline void flush();\n static struct buffer_flusher_t {\n   ~buffer_flusher_t() { flush(); }\n } buffer_flusher;\n using namespace std;\n template <typename T>\n inline void pv(const std::vector<T> &vector, char separator = ' ',\n                char end = '\n') {\n   for (int i = 0; i < vector.size(); ++i) {\n     if (i != 0) {\n       writeChar(separator);\n     }\n     writeInt(vector[i]);\n   }\n   writeChar(end);\n }\n inline void init() {\n   srand(time(0));\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n }\n static const int buf_size = 4 * 4096;\n static unsigned char buf[buf_size];\n static int buf_len = 0, buf_pos = 0;\n inline string readString() {\n   const int MAX = 1e6 + 42;\n   static char buf[MAX];\n   readWord(buf);\n   return string(buf);\n }\n inline bool isEof() {\n   if (buf_pos == buf_len) {\n     buf_pos = 0, buf_len = fread(buf, 1, buf_size, stdin);\n     if (buf_pos == buf_len) return 1;\n   }\n   return 0;\n }\n inline int getChar() { return isEof() ? -1 : buf[buf_pos++]; }\n inline int peekChar() { return isEof() ? -1 : buf[buf_pos]; }\n inline bool seekEof() {\n   int c;\n   while ((c = peekChar()) != -1 && c <= 32) buf_pos++;\n   return c == -1;\n }\n inline void skipBlanks() {\n   while (!isEof() && buf[buf_pos] <= 32U) buf_pos++;\n }\n inline int readChar() {\n   int c = getChar();\n   while (c != -1 && c <= 32) c = getChar();\n   return c;\n }\n inline int readUInt() {\n   int c = readChar(), x = 0;\n   while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();\n   return x;\n }\n template <class T>\n inline T readInt() {\n   int second = 1, c = readChar();\n   T x = 0;\n   if (c == '-')\n     second = -1, c = getChar();\n   else if (c == '+')\n     c = getChar();\n   while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();\n   return second == 1 ? x : -x;\n }\n inline double readDouble() {\n   int second = 1, c = readChar();\n   double x = 0;\n   if (c == '-') second = -1, c = getChar();\n   while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();\n   if (c == '.') {\n     c = getChar();\n     double coef = 1;\n     while ('0' <= c && c <= '9') x += (c - '0') * (coef *= 1e-1), c = getChar();\n   }\n   return second == 1 ? x : -x;\n }\n inline void readWord(char *second) {\n   int c = readChar();\n   while (c > 32) *second++ = c, c = getChar();\n   *second = 0;\n }\n inline bool readLine(char *second) {\n   int c = getChar();\n   while (c != '\n' && c != -1) *second++ = c, c = getChar();\n   *second = 0;\n   return c != -1;\n }\n static int write_buf_pos = 0;\n static char write_buf[buf_size];\n inline void writeChar(int x) {\n   if (write_buf_pos == buf_size)\n     fwrite(write_buf, 1, buf_size, stdout), write_buf_pos = 0;\n   write_buf[write_buf_pos++] = x;\n }\n inline void flush() {\n   if (write_buf_pos)\n     fwrite(write_buf, 1, write_buf_pos, stdout), write_buf_pos = 0;\n }\n template <class T>\n inline void writeInt(T x, char end, int output_len) {\n   if (x < 0) writeChar('-'), x = -x;\n   char second[24];\n   int n = 0;\n   while (x || !n) second[n++] = '0' + x % 10, x /= 10;\n   while (n < output_len) second[n++] = '0';\n   while (n--) writeChar(second[n]);\n   if (end) writeChar(end);\n }\n inline void writeWord(const char *second) {\n   while (*second) writeChar(*second++);\n }\n inline void writeDouble(double x, int output_len) {\n   if (x < 0) writeChar('-'), x = -x;\n   int t = (int)x;\n   writeInt(t), x -= t;\n   writeChar('.');\n   for (int i = output_len - 1; i > 0; i--) {\n     x *= 10;\n     t = std::min(9, (int)x);\n     writeChar('0' + t), x -= t;\n   }\n   x *= 10;\n   t = std::min(9, (int)(x + 0.5));\n   writeChar('0' + t);\n }\n const int MAXN = 3e5 + 42;\n const int MOD = 1e9 + 7;\n void solve() {\n   int n = readInt();\n   vector<pair<char, int>> oper;\n   vector<int> pos;\n   for (int i = 0; i < 2 * n; ++i) {\n     char c = readChar();\n     if (false) cerr << 'c = ' << c << endl;\n     if (c == '+') {\n       oper.push_back({'+', 0});\n       pos.push_back(oper.size() - 1);\n       continue;\n     } else {\n       int cost = readInt();\n       oper.push_back({'-', cost});\n       if (pos.empty()) {\n         writeWord('NO\n');\n         return;\n       }\n       int x = pos.back();\n       if (false) cerr << x << endl;\n       pos.pop_back();\n       oper[x].second = cost;\n     }\n   }\n   set<int> have;\n   vector<int> ans;\n   for (auto [op, c] : oper) {\n     if (false) cerr << op << ' ' << c << endl;\n     if (op == '+') {\n       have.insert(c);\n       ans.push_back(c);\n     } else {\n       auto u = *have.begin();\n       if (u != c) {\n         writeWord('NO\n');\n         return;\n       }\n       have.erase(have.begin());\n     }\n   }\n   writeWord('YES\n');\n   pv(ans);\n }\n signed main() {\n   init();\n   init();\n   solve();\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using ull = unsigned long long;\n using ll = long long;\n using ld = long double;\n using namespace std;\n const ll mod = 998244353;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   int n, m, k, t;\n   cin >> n >> k >> m >> t;\n   deque<bool> cur(n);\n   cur[k - 1] = 1;\n   while (t--) {\n     int f, pos;\n     cin >> f >> pos;\n     if (f == 1) {\n       cur.insert(cur.begin() + (pos - 1), 0);\n       for (int i = 0; i < ((int)(cur).size()); i++) {\n         if (cur[i]) {\n           cout << ((int)(cur).size()) << ' ' << i + 1 << '\n';\n           break;\n         }\n       }\n     } else {\n       int loc = -1;\n       for (int i = 0; i < ((int)(cur).size()); i++) {\n         if (cur[i]) {\n           loc = i + 1;\n           break;\n         }\n       }\n       if (loc <= pos)\n         while (((int)(cur).size()) > pos) cur.pop_back();\n       else\n         while (pos--) cur.pop_front();\n       for (int i = 0; i < ((int)(cur).size()); i++) {\n         if (cur[i]) {\n           cout << ((int)(cur).size()) << ' ' << i + 1 << '\n';\n           break;\n         }\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int maze[1500][1500];\n pair<int, int> was[1500][1500];\n int n, m;\n int sr, sc;\n inline int rem(int x, int y) {\n   x %= y;\n   return (x < 0) ? x + y : x;\n }\n bool dfs(int r, int c) {\n   int rm = rem(r, n), cm = rem(c, m);\n   if (maze[rm][cm] == 1) {\n     return was[rm][cm] != pair<int, int>(r, c);\n   }\n   int rmn, cmn;\n   if (maze[rm][cm] == 0) {\n     maze[rm][cm] = 1;\n     was[rm][cm] = pair<int, int>(r, c);\n     rmn = rem(r, n), cmn = rem(c - 1, m);\n     if (maze[rmn][cmn] != -1 && dfs(r, c - 1)) return true;\n     rmn = rem(r, n), cmn = rem(c + 1, m);\n     if (maze[rmn][cmn] != -1 && dfs(r, c + 1)) return true;\n     rmn = rem(r + 1, n), cmn = rem(c, m);\n     if (maze[rmn][cmn] != -1 && dfs(r + 1, c)) return true;\n     rmn = rem(r - 1, n), cmn = rem(c, m);\n     if (maze[rmn][cmn] != -1 && dfs(r - 1, c)) return true;\n   }\n   return false;\n }\n void TheSolution(istream& input, ostream& output) {\n   input >> n >> m;\n   string s;\n   memset(maze, -1, sizeof(maze));\n   for (int i = 0; i < n; i++) {\n     input >> s;\n     for (int j = 0; j < m; j++) {\n       if (s[j] == '.') maze[i][j] = 0;\n       if (s[j] == 'S') {\n         sr = i;\n         sc = j;\n         maze[i][j] = 0;\n       }\n       was[i][j] = pair<int, int>(-1000000, -1000000);\n     }\n   }\n   output << (dfs(sr, sc) ? 'Yes' : 'No');\n }\n int main() {\n   TheSolution(cin, cout);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n struct node {\n   int cnt;\n   node* bit[3];\n   node() {\n     bit[0] = bit[1] = NULL;\n     cnt = 0;\n   }\n };\n node* root;\n void Insertt(int x) {\n   node* cur = root;\n   for (int i = 28; i >= 0; --i) {\n     if (cur->bit[(x >> i) & 1] == NULL) cur->bit[(x >> i) & 1] = new node();\n     cur = cur->bit[(x >> i) & 1];\n     ++(cur->cnt);\n   }\n }\n void Erasee(int x) {\n   node* cur = root;\n   for (int i = 28; i >= 0; --i) {\n     --(cur->bit[(x >> i) & 1]->cnt);\n     if (cur->bit[(x >> i) & 1]->cnt == 0) {\n       cur->bit[(x >> i) & 1] = NULL;\n       return;\n     } else\n       cur = cur->bit[(x >> i) & 1];\n   }\n }\n int Query(int p, int l) {\n   int res = 0;\n   node* cur = root;\n   for (int i = 28; i >= 0; --i) {\n     if (((l >> i) & 1) == 0) {\n       if (cur->bit[(p >> i) & 1] != NULL)\n         cur = cur->bit[(p >> i) & 1];\n       else\n         return res;\n     } else {\n       if (cur->bit[(p >> i) & 1] != NULL) res += cur->bit[(p >> i) & 1]->cnt;\n       if (cur->bit[(1 ^ ((p >> i) & 1))] != NULL)\n         cur = cur->bit[(1 ^ ((p >> i) & 1))];\n       else\n         return res;\n     }\n   }\n   return res;\n }\n int main() {\n   scanf('%d', &n);\n   root = new node();\n   for (int i = 1; i <= n; ++i) {\n     int type, p, l;\n     scanf('%d%d', &type, &p);\n     if (type == 1) Insertt(p);\n     if (type == 2) Erasee(p);\n     if (type == 3) {\n       scanf('%d', &l);\n       printf('%d\n', Query(p, l));\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long labs(long long a) { return a < 0 ? (-a) : a; }\n long long max(long long a, long long b) { return a > b ? a : b; }\n long long min(long long a, long long b) { return a < b ? a : b; }\n struct Fenwik {\n   vector<long long> t;\n   long long n;\n   void Init(long long nn) {\n     n = nn;\n     t.assign(n, 0);\n   }\n   long long Sum(long long r) {\n     long long result = 0;\n     for (; r >= 0; r = (r & (r + 1)) - 1) result += t[r];\n     return result;\n   }\n   void Inc(long long i, long long delta) {\n     for (; i < n; i = (i | (i + 1))) t[i] += delta;\n   }\n   long long Sum(long long l, long long r) { return Sum(r) - Sum(l - 1); }\n   void Init(const vector<long long>& a) {\n     Init(a.size());\n     for (int(i) = 0; (i) < (n); (i)++) Inc(i, a[i]);\n   }\n };\n vector<Fenwik> f;\n vector<int> g;\n vector<int> gn;\n long long gs;\n map<long long, pair<int, int> > ids;\n long long h, m, n;\n long long gt;\n long long F(long long x) {\n   long long pos = (gn[gt] + x) % gs;\n   long long sum = 0;\n   if (pos < gn[gt]) {\n     sum = f[g[gt]].Sum(gn[gt], gs - 1) + f[g[gt]].Sum(0, pos);\n   } else {\n     sum = f[g[gt]].Sum(gn[gt], pos);\n   }\n   return x + 1 - sum;\n }\n long long UpperBound(long long l, long long r, long long f) {\n   while (l < r) {\n     long long m = (l + r) / 2;\n     if (!(f < F(m))) {\n       l = m + 1;\n     } else {\n       r = m;\n     }\n   }\n   return l;\n }\n long long res = 0;\n void Add(long long id, long long t) {\n   gt = t;\n   long long lb = UpperBound(0, gs - 1, 0);\n   res += lb;\n   long long gg = g[t];\n   long long nn = (gn[t] + lb) % gs;\n   f[gg].Inc(nn, 1);\n   ids[id] = make_pair(gg, nn);\n }\n void Delete(long long id) { f[ids[id].first].Inc(ids[id].second, -1); }\n int main() {\n   cin >> h >> m >> n;\n   g.resize(h, -1);\n   gn.resize(h, 0);\n   long long group = 0;\n   for (int(i) = 0; (i) < (h); (i)++) {\n     if (g[i] != -1) continue;\n     g[i] = group;\n     gs = 1;\n     for (long long j = 1; (i + j * m) % h != i; j++) {\n       g[(i + j * m) % h] = group;\n       gn[(i + j * m) % h] = j;\n       gs = j + 1;\n     }\n     group++;\n   }\n   f.resize(group);\n   for (int(i) = 0; (i) < (group); (i)++) {\n     f[i].Init(gs);\n   }\n   char c;\n   long long id;\n   long long t;\n   for (int(i) = 0; (i) < (n); (i)++) {\n     cin >> c >> id;\n     if (c == '+') {\n       cin >> t;\n       Add(id, t);\n     } else {\n       Delete(id);\n     }\n   }\n   cout << res << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1e9 + 7;\n const int MAXN = 1e6 + 7;\n const double EPS = 1e-8;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, m;\n   cin >> n >> m;\n   vector<long long> cnt(m, 0);\n   long long d = n % m;\n   for (long long i = 0; i < m; i++) {\n     cnt[i * i % m] += n / m;\n     if (i && i <= d) {\n       cnt[i * i % m]++;\n     }\n   }\n   long long res = 0;\n   for (long long i = 0; i < m; i++) {\n     res += cnt[i] * cnt[(m - i) % m];\n   }\n   cout << res;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char buffer[200];\n int main() {\n   int n;\n   string data;\n   while (scanf('%d', &n) != EOF) {\n     getchar();\n     for (int i = 0; i < n; i++) {\n       gets(buffer);\n       data = string(buffer);\n       int firstM = data.find('miao.');\n       int lastL = data.rfind('lala.');\n       if (firstM != data.npos &&\n           (lastL == data.npos || lastL != data.size() - 5) && firstM == 0) {\n         printf('Rainbow's\n');\n       } else if ((firstM == data.npos || firstM != 0) && lastL != data.npos &&\n                  lastL == data.size() - 5) {\n         printf('Freda's\n');\n       } else {\n         printf('OMG>.< I don't know!\n');\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MOD = 1e9 + 7;\n const long double PI = 3.1415926535898;\n const long long LLMAX = LLONG_MAX;\n int a[(int)2e5 + 5], b[(int)2e5 + 5], c[(int)2e5 + 5];\n int n;\n vector<vector<int> > v((int)2e5 + 5);\n int type10 = 0;\n int type01 = 0;\n long long ans = 0;\n int one[(int)2e5 + 5] = {0};\n int zero[(int)2e5 + 5] = {0};\n void solve(int parent, int node) {\n   if (b[node] != c[node]) {\n     if (b[node])\n       one[node]++;\n     else\n       zero[node]++;\n   }\n   if (parent) a[node] = min(a[node], a[parent]);\n   for (int i = 0; i < v[node].size(); i++) {\n     if (v[node][i] == parent)\n       continue;\n     else {\n       solve(node, v[node][i]);\n       one[node] += one[v[node][i]];\n       zero[node] += zero[v[node][i]];\n     }\n   }\n   int dec = min(one[node], zero[node]);\n   one[node] -= dec;\n   zero[node] -= dec;\n   ans += (long long)a[node] * 2 * dec;\n }\n int main() {\n   int x, y;\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i] >> b[i] >> c[i];\n     if (b[i] == 0 && c[i] == 1)\n       type01++;\n     else if (b[i] == 1 && c[i] == 0)\n       type10++;\n   }\n   for (int i = 1; i < n; i++) {\n     cin >> x >> y;\n     v[x].push_back(y);\n     v[y].push_back(x);\n   }\n   solve(0, 1);\n   if (type01 != type10) {\n     cout << -1 << '\n';\n   } else {\n     cout << ans << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a, b;\n int main() {\n   cin >> a >> b;\n   long long ans = (b * (b - 1)) / 2;\n   ans %= 1000000007;\n   ans =\n       (a * ans + ((b * ans) % 1000000007) * ((a * (a + 1) / 2) % 1000000007)) %\n       1000000007;\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n using namespace std;\n #define mp make_pair\n #define fi first\n #define se second\n #define pb push_back\n #define pf push_front\n #define ppb pop_back\n #define ppf pop_front\n #define sz(v) (v).size()\n #define all(v) (v).begin(),(v).end()\n #define REP(i,a,b) for(int (i)=(a);(i)<(b);(i)++)\n #define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)\n #define Time (double)clock()/CLOCKS_PER_SEC\n typedef long long ll;\n typedef unsigned long long ull;\n typedef double db;\n typedef long double ldb;\n typedef pair<int,int> pi;\n template <class T> void chmax(T &x,T y) {x=x>y?x:y;return;}\n template <class T> void chmin(T &x,T y) {x=x<y?x:y;return;}\n template <class T> T sqr(T x) {return x*x;}\n template <class T> T gcd(T x,T y) {return y==0?x:gcd(y,x%y);}\n template <class T> T lcm(T x,T y) {return x/gcd(x,y)*y;}\n const int inf=1000000000,mod=1000000007;\n const ll infll=1000000000000000000ll,modll=ll(mod);\n const db maxdb=db(infll),eps=1e-14,PI=acos(-1.0);\n //#define mydef\n //#define LOCAL\n #ifdef mydef\n #define foreach(v,it) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n #endif\n #define debug\n #define putnum(x) cout<<#x<<': '<<x<<endl\n #define putvec(v) cout<<#v<<': ';REP(i,0,sz(v)) cout<<v[i]<<' ';cout<<endl\n template <class T> inline void read(T &x){\n 	T w=1;x=0;char c=getchar();\n 	while(c<'0'||c>'9') {if(c=='-')w=-1;c=getchar();}\n 	while(c>='0'&&c<='9') {x=(x<<3)+(x<<1)+(c&15);c=getchar();}\n 	x*=w;\n }\n template <class T> inline void write(T x) {\n 	if(x<0) putchar('-'),x=~x+1;\n 	if(x) write(x/10),putchar(x%10+'0');\n }\n \n const int maxn=200005;\n int n;\n ll sum[2],a[maxn];\n vector<ll> odd,even;\n \n void solve() {\n 	odd.clear();\n 	even.clear();\n 	cin>>n;\n 	for(int i=1;i<=n;i++) {\n 		cin>>a[i];\n 		if(a[i]&1ll) odd.pb(a[i]);\n 		else even.pb(a[i]);\n 	}\n 	sort(all(odd));\n 	sort(all(even));\n 	\n 	sum[0]=sum[1]=0ll;\n 	int p=0;\n 	for(int i=0;i<n;i++) {\n 		ll A=even.empty()?-infll:even.back();\n 		ll B=odd.empty()?-infll:odd.back();		\n 		if(A>B) {\n 			if(!p) sum[p]+=A;\n 			even.ppb();\n 		} else {\n 			if(p) sum[p]+=B;\n 			odd.ppb();\n 		}\n 		p^=1;\n 	}\n 	cout<<(sum[0]>sum[1]?'Alice':(sum[0]==sum[1]?'Tie':'Bob'))<<endl;\n 	return;\n }\n \n int main() {\n 	#ifdef LOCAL\n 		freopen('input.in','r',stdin);\n 		freopen('output.out','w',stdout);\n 	#endif\n 	int T;\n 	cin>>T;\n 	while(T--) solve();\n 	return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n using vi = vector<int>;\n using vpi = vector<pair<int, int>>;\n using pi = pair<int, int>;\n const int nax = 1e5 + 7;\n const int mod = 1e9 + 7;\n const int inf = numeric_limits<int>::max() - (int)9e6;\n struct monotonic_queue {\n   queue<int> qu;\n   deque<int> mx, mn;\n   void push(int v) {\n     qu.push(v);\n     while (mx.size() && mx.back() < v) mx.pop_back();\n     mx.push_back(v);\n     while (mn.size() && mn.back() > v) mn.pop_back();\n     mn.push_back(v);\n   }\n   void pop() {\n     if (mx.front() == qu.front()) mx.pop_front();\n     if (mn.front() == qu.front()) mn.pop_front();\n     qu.pop();\n   }\n   int front() const { return qu.front(); }\n   int max() const { return mx.front(); }\n   int min() const { return mn.front(); }\n   int size() const { return qu.size(); }\n   bool empty() { return qu.empty(); }\n };\n int n;\n void test() {\n   cin >> n;\n   int s, l;\n   cin >> s >> l;\n   vi v(n);\n   for (int i = 0; i < (int)n; i++) cin >> v[i];\n   monotonic_queue q;\n   vi g(n, n);\n   for (int i = n - 1, j = n - 1; i >= 0; i--) {\n     while (j >= 0 and (q.empty() or (((q.max() - q.min()) <= s)))) {\n       q.push(v[j--]);\n     }\n     g[i] = (((q.max() - q.min()) <= s) ? j : j + 1);\n     if (((int)(q).size())) q.pop();\n   }\n   while (((int)(q).size())) q.pop();\n   vi dp(n + 1, inf);\n   dp[0] = 0;\n   for (int i = l, j = 0; i <= n; i++) {\n     q.push(dp[i - l]);\n     while (((int)(q).size()) and j <= g[i - 1]) q.pop(), j++;\n     if (((int)(q).size())) dp[i] = q.min() + 1;\n   }\n   cout << (dp[n] >= inf ? -1 : dp[n]);\n }\n signed main() {\n   ios_base ::sync_with_stdio(false);\n   cin.tie(NULL);\n   int T = 1;\n   while (T--) {\n     test();\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 5;\n int a[20];\n long long ans, p[] = {1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29}, limit = 1e18;\n void dfs(int num, int len) {\n   if (num == 1) {\n     long long res = 1;\n     for (int i = 1; i <= len; ++i) {\n       for (int j = 1; j < a[i]; ++j) {\n         if (limit / p[i] <= res) {\n           return;\n         }\n         res *= p[i];\n       }\n     }\n     ans = min(ans, res);\n     return;\n   }\n   for (int i = 2; i <= num; ++i) {\n     if (num % i == 0) {\n       a[len + 1] = i;\n       dfs(num / i, len + 1);\n     }\n   }\n }\n int main() {\n   int n;\n   cin >> n;\n   if (n == 1) {\n     cout << 1 << endl;\n     return 0;\n   } else if (n == 2) {\n     cout << 2 << endl;\n     return 0;\n   }\n   ans = limit;\n   for (int i = 1; i <= n; ++i) {\n     if (n % i == 0) {\n       a[1] = i;\n       dfs(n / i, 1);\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, T;\n int l[200010], r[200010], s[200010], t[200010], id[200010];\n int f[1010][1010];\n int ans[200010];\n int x[200010], y[200010];\n inline int cmp(int x, int y) { return l[x] > l[y]; }\n int main() {\n   scanf('%d%d%d', &n, &m, &T);\n   for (int i = 1; i <= m; i++) scanf('%d%d', &x[i], &y[i]);\n   for (int i = 1; i <= T; i++)\n     scanf('%d%d%d%d', &l[i], &r[i], &s[i], &t[i]), id[i] = i;\n   sort(id + 1, id + T + 1, cmp);\n   memset(f, 63, sizeof(f));\n   int last = 1;\n   for (int i = m; i; i--) {\n     f[x[i]][y[i]] = f[y[i]][x[i]] = i;\n     for (int j = 1; j <= n; j++) {\n       f[x[i]][j] = min(f[x[i]][j], f[y[i]][j]);\n       f[y[i]][j] = min(f[y[i]][j], f[x[i]][j]);\n     }\n     while (last <= T && l[id[last]] == i) {\n       int u = id[last++];\n       ans[u] = f[s[u]][t[u]] <= r[u];\n     }\n   }\n   for (int i = 1; i <= T; i++) puts(ans[i] ? 'Yes' : 'No');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long oo = 0x3f3f3f3f3f3f3f3fLL;\n struct Edge {\n   int u, v;\n   long long cap[2], flow;\n };\n vector<int> d, act;\n bool bfs(int s, int t, vector<vector<int>>& adj, vector<Edge>& E,\n          long long lim = 1) {\n   queue<int> Q;\n   d = vector<int>(adj.size(), -1);\n   d[t] = 0;\n   Q.push(t);\n   for (Q.push(t); Q.size() and d[s] == -1; Q.pop()) {\n     int u = Q.front();\n     for (int i = (0); i < int(adj[u].size()); i++) {\n       int e = adj[u][i], v = (E[e].u ^ E[e].v ^ u);\n       if (((E[e].u == v) ? E[e].cap[0] - E[e].flow : E[e].cap[1] + E[e].flow) >=\n               lim and\n           d[v] == -1) {\n         d[v] = d[u] + 1;\n         Q.push(v);\n       }\n     }\n   }\n   return d[s] >= 0;\n }\n long long dfs(int u, int t, long long bot, vector<vector<int>>& adj,\n               vector<Edge>& E) {\n   if (bot == 0) return 0;\n   if (u == t) return bot;\n   for (; act[u] < int(adj[u].size()); ++act[u]) {\n     int e = adj[u][act[u]];\n     if (d[u] == d[(E[e].u ^ E[e].v ^ u)] + 1) {\n       long long inc = dfs((E[e].u ^ E[e].v ^ u), t,\n                           min(bot, ((E[e].u == u) ? E[e].cap[0] - E[e].flow\n                                                   : E[e].cap[1] + E[e].flow)),\n                           adj, E);\n       if (inc) {\n         E[e].flow += ((E[e].u == u) ? (inc) : (-(inc)));\n         return inc;\n       }\n     }\n   }\n   return 0;\n }\n long long maxflow(int s, int t, vector<vector<int>>& adj, vector<Edge>& E,\n                   int F = 0) {\n   for (auto& e : E) e.flow = 0;\n   long long flow = 0, bot;\n   for (int lim = (1 << F); lim >= 1; lim >>= 1) {\n     while (bfs(s, t, adj, E, lim)) {\n       act = vector<int>(adj.size(), 0);\n       while ((bot = dfs(s, t, oo, adj, E))) flow += bot;\n     }\n   }\n   return flow;\n }\n inline void addEdge(int x, int y, vector<vector<int>>& adj, vector<Edge>& E,\n                     long long c, long long rc = 0) {\n   Edge e;\n   e.u = x;\n   e.v = y;\n   e.flow = 0;\n   e.cap[0] = c;\n   e.cap[1] = rc;\n   adj[x].push_back(int((E).size()));\n   adj[y].push_back(int((E).size()));\n   E.push_back(e);\n }\n long long anss = 0;\n void gomory_hu(vector<vector<int>>& adj, vector<Edge>& E, vector<int>& parent,\n                vector<vector<long long>>& ans) {\n   int n = int((adj).size());\n   parent.assign(n, 0);\n   ans.assign(n, vector<long long>(n, oo));\n   for (int i = (1); i < int(n); i++) {\n     long long f = maxflow(i, parent[i], adj, E);\n     anss += f;\n     bfs(i, parent[i], adj, E);\n     for (int j = (i + 1); j < int(n); j++)\n       if (d[j] == -1 and parent[j] == parent[i]) parent[j] = i;\n     ans[i][parent[i]] = ans[parent[i]][i] = f;\n     for (int j = (0); j < int(i); j++)\n       ans[i][j] = ans[j][i] = min(f, ans[parent[i]][j]);\n   }\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   int n, m;\n   cin >> n >> m;\n   vector<vector<int>> adj(n);\n   vector<Edge> E;\n   for (int i = (0); i < int(m); i++) {\n     int a, b, c;\n     cin >> a >> b >> c;\n     --a, --b;\n     addEdge(a, b, adj, E, c, c);\n   }\n   vector<int> par;\n   vector<vector<long long>> d;\n   gomory_hu(adj, E, par, d);\n   cout << anss << endl;\n   int best = 0;\n   vector<int> res(n);\n   for (int i = 0; i < n; ++i) {\n     res[i] = i;\n   }\n   for (int i = 0; i < 1; ++i) {\n     vector<int> order;\n     order.push_back(i);\n     vector<int> used(n, 0);\n     used[i] = true;\n     int score = 0;\n     while (int((order).size()) != n) {\n       int best = -1, index = -1;\n       for (int j = 0; j < n; ++j) {\n         if (!used[j] && d[order.back()][j] > best) {\n           best = d[order.back()][j];\n           index = j;\n         }\n       }\n       score += best;\n       order.push_back(index);\n       used[index] = true;\n     }\n     if (score > best) {\n       best = score;\n       res = order;\n     }\n   }\n   for (int i = 0; i < res.size(); ++i) {\n     printf('%d ', res[i] + 1);\n   }\n   printf('\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 0x3f3f3f3f;\n const long long INF = 0x3f3f3f3f3f3f3f3fll;\n const int maxn = 1000010;\n const long long mod = 1e9 + 7;\n char str1[maxn], str2[maxn];\n int ans[maxn];\n long long L1[maxn], R1[maxn], L2[maxn], R2[maxn];\n int main() {\n   while (scanf('%s', str1 + 1) != -1) {\n     scanf('%s', str2 + 1);\n     int len1 = strlen(str1 + 1);\n     int len2 = strlen(str2 + 1);\n     if (len1 - 1 != len2) {\n       printf('0\n');\n       continue;\n     }\n     L1[0] = 0;\n     L2[0] = 0;\n     R1[len1 + 1] = 0;\n     R2[len2 + 1] = 0;\n     for (int i = 1; i <= len1; i++) L1[i] = (L1[i - 1] * 26 + str1[i]) % mod;\n     for (int i = len1; i >= 1; i--) R1[i] = (R1[i + 1] * 26 + str1[i]) % mod;\n     for (int i = 1; i <= len2; i++) L2[i] = (L2[i - 1] * 26 + str2[i]) % mod;\n     for (int i = len2; i >= 1; i--) R2[i] = (R2[i + 1] * 26 + str2[i]) % mod;\n     int len = 0;\n     for (int i = 1; i <= len1; i++) {\n       if (L1[i - 1] == L2[i - 1] && R1[i + 1] == R2[i]) ans[len++] = i;\n     }\n     printf('%d\n', len);\n     for (int i = 0; i < len; i++) {\n       if (i == len - 1)\n         printf('%d\n', ans[i]);\n       else\n         printf('%d ', ans[i]);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }\n const int MAXN = 100000;\n const int MAXQ = 200000;\n int nq;\n int qkind[MAXQ], qx[MAXQ], qy[MAXQ], qans[MAXQ];\n int n;\n map<pair<int, int>, int> mp;\n int px[MAXN], py[MAXN], pl[MAXN], pr[MAXN];\n map<long long, vector<int>> byrad;\n map<pair<int, int>, vector<pair<int, int>>> matches;\n map<pair<int, int>, vector<pair<int, int>>> singles;\n map<pair<int, int>, vector<int>> queries;\n void run() {\n   scanf('%d', &nq);\n   for (int i = (0); i < (nq); ++i) scanf('%d%d%d', &qkind[i], &qx[i], &qy[i]);\n   n = 0;\n   mp.clear();\n   for (int i = (0); i < (nq); ++i) {\n     if (qkind[i] == 1) {\n       int id = n++;\n       pair<int, int> key = make_pair(qx[i], qy[i]);\n       assert(!mp.count(key));\n       mp[key] = id;\n       px[id] = qx[i], py[id] = qy[i], pl[id] = i, pr[id] = -1;\n     }\n     if (qkind[i] == 2) {\n       pair<int, int> key = make_pair(qx[i], qy[i]);\n       assert(mp.count(key));\n       int id = mp[key];\n       mp.erase(key);\n       pr[id] = i;\n     }\n     if (qkind[i] == 3) {\n       qans[i] = ((int)(mp).size());\n     }\n   }\n   for (auto it = mp.begin(); it != mp.end(); ++it) {\n     int id = it->second;\n     pr[id] = nq;\n   }\n   mp.clear();\n   for (int i = (0); i < (n); ++i)\n     byrad[(long long)px[i] * px[i] + (long long)py[i] * py[i]].push_back(i);\n   for (auto it = byrad.begin(); it != byrad.end(); ++it) {\n     vector<int> lst = it->second;\n     for (int ii = (0); ii < (((int)(lst).size())); ++ii)\n       for (int jj = (ii + 1); jj < (((int)(lst).size())); ++jj) {\n         int i = lst[ii], j = lst[jj];\n         int l = max(pl[i], pl[j]), r = min(pr[i], pr[j]);\n         if (l > r) continue;\n         assert(px[i] != px[j] || py[i] != py[j]);\n         int cx = px[i] + px[j], cy = py[i] + py[j], g = gcd(cx, cy);\n         cx /= g, cy /= g;\n         matches[make_pair(cx, cy)].push_back(make_pair(l, r));\n       }\n   }\n   for (int i = (0); i < (n); ++i) {\n     int cx = px[i], cy = py[i], g = gcd(cx, cy);\n     cx /= g, cy /= g;\n     singles[make_pair(cx, cy)].push_back(make_pair(pl[i], pr[i]));\n   }\n   for (int i = (0); i < (nq); ++i)\n     if (qkind[i] == 3) {\n       int cx = qx[i], cy = qy[i], g = gcd(cx, cy);\n       cx /= g, cy /= g;\n       queries[make_pair(cx, cy)].push_back(i);\n     }\n   for (auto it = queries.begin(); it != queries.end(); ++it) {\n     vector<int> cqueries = it->second;\n     vector<pair<int, int>> cmatches = matches[it->first];\n     vector<pair<int, int>> csingles = singles[it->first];\n     vector<pair<int, int>> evt;\n     for (int i = (0); i < (((int)(cmatches).size())); ++i)\n       evt.push_back(make_pair(cmatches[i].first, -2)),\n           evt.push_back(make_pair(cmatches[i].second + 1, +2));\n     for (int i = (0); i < (((int)(csingles).size())); ++i)\n       evt.push_back(make_pair(csingles[i].first, -1)),\n           evt.push_back(make_pair(csingles[i].second + 1, +1));\n     sort(cqueries.begin(), cqueries.end());\n     sort(evt.begin(), evt.end());\n     int at = 0, sum = 0;\n     for (int i = (0); i < (((int)(cqueries).size())); ++i) {\n       int id = cqueries[i];\n       while (at < ((int)(evt).size()) && id >= evt[at].first)\n         sum += evt[at++].second;\n       qans[id] += sum;\n     }\n   }\n   for (int i = (0); i < (nq); ++i)\n     if (qkind[i] == 3) printf('%d\n', qans[i]);\n }\n int main() {\n   run();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main(void) {\n   int i, j, k, m, n, max_length, length;\n   char string[101];\n   for (n = 0, scanf('%s', string); string[n]; n++)\n     ;\n   for (m = 1, max_length = 0; m < n; m++) {\n     for (i = m - 1; i >= 0; i--) {\n       for (j = i, k = m, length = 0; k && string[j] == string[k];\n            j--, k--, length++)\n         ;\n       if (max_length < length) {\n         max_length = length;\n       }\n     }\n   }\n   printf('%d', max_length);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int K;\n   cin >> K;\n   int sinir = 2 * K * K;\n   int primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 27, 31, 37, 39};\n   set<int> mynums;\n   int i;\n   for (i = 0; i < sizeof(primes) / sizeof(int); i++) {\n     mynums.clear();\n     int t1 = 1, t2 = 1, t = 1;\n     for (int j = 0; j <= i; j++) t *= primes[j];\n     for (int j = 0; j <= i / 4; j++) t1 *= primes[j] * primes[i - j];\n     for (int j = i / 4 + 1; j < i - i / 4; j++) t2 *= primes[j];\n     mynums.insert(t);\n     for (int y = 0; y < 30; y++) {\n       for (int j = 0; j <= i; j++) {\n         for (set<int>::iterator it = mynums.begin(); it != mynums.end(); it++) {\n           if (*it * primes[j] <= sinir) {\n             mynums.insert(*it * primes[j]);\n           }\n         }\n       }\n     }\n     if (mynums.size() > K) break;\n     if (t1 > 1) mynums.insert(t1);\n     if (t2 > 1) mynums.insert(t2);\n     for (int y = 0; y < 30; y++) {\n       for (int j = 0; j <= i; j++) {\n         for (set<int>::iterator it = mynums.begin(); it != mynums.end(); it++) {\n           if (*it * primes[j] <= sinir) {\n             mynums.insert(*it * primes[j]);\n           }\n         }\n       }\n     }\n     if (mynums.size() <= K / 2) continue;\n     if (mynums.size() > K) break;\n   }\n   set<int>::iterator it = mynums.end();\n   it--;\n   cout << *it;\n   i = 1;\n   for (it--; it != mynums.begin() && i < K; it--, i++) cout << ' ' << *it;\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, k;\n char s[504][504];\n int vis[504][504];\n vector<pair<char, pair<int, int> > > v;\n vector<pair<int, int> > ord;\n int dx[] = {1, 0, -1, 0};\n int dy[] = {0, 1, 0, -1};\n void dfs(int x, int y) {\n   ord.push_back(make_pair(x, y));\n   for (int i = 0; i < 4; i++)\n     if (x + dx[i] < n and y + dy[i] < m and x + dx[i] >= 0 and\n         y + dy[i] >= 0 and s[x + dx[i]][y + dy[i]] != '#' and\n         !vis[x + dx[i]][y + dy[i]]) {\n       vis[x + dx[i]][y + dy[i]] = 1;\n       dfs(x + dx[i], y + dy[i]);\n     }\n }\n int main() {\n   scanf('%d%d%d', &n, &m, &k);\n   for (int i = 0; i < n; i++) scanf('%s', &s[i]);\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++)\n       if (s[i][j] == '.') v.push_back(make_pair('B', make_pair(i, j)));\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < m; j++)\n       if (!vis[i][j] and s[i][j] != '#') {\n         ord.clear();\n         vis[i][j] = 1;\n         dfs(i, j);\n         for (int k = ord.size() - 1; k >= 1; k--) {\n           v.push_back(make_pair('D', ord[k]));\n           v.push_back(make_pair('R', ord[k]));\n         }\n       }\n   printf('%d\n', v.size());\n   for (int i = 0; i < v.size(); i++)\n     printf('%c %d %d\n', v[i].first, v[i].second.first + 1,\n            v[i].second.second + 1);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve() {\n   char S[110];\n   scanf('%s', S);\n   int len = strlen(S);\n   sort(S, S + len);\n   for (int i = 0; i < len - 1; i++) {\n     if (S[i + 1] - S[i] != 1) {\n       printf('NO\n');\n       return;\n     }\n   }\n   printf('YES\n');\n }\n int main() {\n   int T;\n   scanf('%d', &T);\n   while (T--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int sqr(long long int x) { return x * x; }\n inline long long int add(long long int a, long long int b) {\n   long long int c = a + b;\n   if (c >= 1000000007) c -= 1000000007;\n   return c;\n }\n inline long long int mul(long long int a, long long int b) {\n   return (a * 1ll * b) % 1000000007;\n }\n inline long long int sub(long long int a, long long int b) {\n   long long int c = a - b;\n   if (c < 0) c += 1000000007;\n   return c;\n }\n const int nax = 1000 * 1000 + 10;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   auto ok = [](vector<int> &v, int pos) {\n     swap(v[pos + 1], v[pos + 2]);\n     swap(v[pos], v[pos + 1]);\n   };\n   int t;\n   cin >> t;\n   while (t--) {\n     int n;\n     cin >> n;\n     vector<int> v(n);\n     vector<pair<int, int>> x(n);\n     for (int i = 0; i < n; ++i) {\n       cin >> v[i];\n       x[i] = {v[i], i};\n     }\n     sort(x.begin(), x.end());\n     for (int i = 0; i < n; ++i) {\n       v[x[i].second] = i;\n     }\n     int cnt = 0;\n     for (int i = 0; i < n; ++i) {\n       for (int j = i + 1; j < n; ++j) {\n         cnt += (v[j] < v[i]);\n       }\n     }\n     if (cnt & 1) {\n       for (int i = 0; i < n - 1; ++i) {\n         if (x[i].first == x[i + 1].first) {\n           swap(v[x[i].second], v[x[i + 1].second]);\n           break;\n         }\n       }\n     }\n     vector<int> ans;\n     for (int i = 0; i < n - 2; ++i) {\n       int pos = min_element(v.begin() + i, v.end()) - v.begin();\n       while (pos > i + 1) {\n         ok(v, pos - 2);\n         ans.push_back(pos - 2);\n         pos -= 2;\n       }\n       if (pos != i) {\n         ok(v, i);\n         ok(v, i);\n         ans.push_back(i);\n         ans.push_back(i);\n       }\n     }\n     for (int i = 0; i < 3; ++i) {\n       if (is_sorted(v.begin(), v.end())) break;\n       ok(v, n - 3);\n       ans.push_back(n - 3);\n     }\n     if (!is_sorted(v.begin(), v.end())) {\n       cout << -1 << '\n';\n     } else {\n       cout << ans.size() << '\n';\n       for (int i = 0; i < ans.size(); ++i) cout << ans[i] + 1 << ' ';\n       cout << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   while (cin >> n) {\n     string str;\n     cin >> str;\n     bool flag = true;\n     if (n < 3) {\n       if (n == 1) {\n         if (str[0] == '1')\n           cout << 'Yes' << endl;\n         else\n           cout << 'No' << endl;\n       } else {\n         if (str != '00' && str != '11')\n           cout << 'Yes' << endl;\n         else\n           cout << 'No' << endl;\n       }\n       continue;\n     }\n     for (int i = 0; i < n - 2; i++) {\n       int ans = 0;\n       for (int j = i; j < i + 3; j++) {\n         ans += str[j] - '0';\n       }\n       if (ans == 1)\n         continue;\n       else if (ans == 0 || ans == 3) {\n         flag = false;\n         break;\n       } else {\n         if (str[i + 1] != '0') {\n           flag = false;\n           break;\n         }\n       }\n     }\n     if (str[0] == '0' && str[1] == '0' && str[2] == '1') flag = false;\n     if (str[n - 1] == '0' && str[n - 2] == '0' && str[n - 3] == '1')\n       flag = false;\n     if (flag)\n       cout << 'Yes' << endl;\n     else\n       cout << 'No' << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct SCC {\n   vector<pair<int, int>> minmax;\n   int size;\n   SCC(vector<int> v) {\n     minmax.resize(v.size());\n     for (int i = 0; i < (int)v.size(); i++) {\n       minmax[i].first = v[i];\n       minmax[i].second = v[i];\n     }\n     size = 1;\n   }\n   bool operator<(SCC const& other) const {\n     for (int i = 0; i < (int)minmax.size(); i++) {\n       if (other.minmax[i].first < minmax[i].second) return false;\n     }\n     return true;\n   }\n };\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int n, k;\n   cin >> n >> k;\n   set<SCC> s;\n   for (int i = 0; i < n; i++) {\n     vector<int> v(k);\n     for (int i = 0; i < k; i++) {\n       cin >> v[i];\n     }\n     SCC scc(v);\n     auto a = s.lower_bound(scc);\n     auto b = s.upper_bound(scc);\n     if (a != b) {\n       auto x = a;\n       while (x != b) {\n         for (int K = 0; K < k; K++) {\n           scc.minmax[K].first = min(scc.minmax[K].first, x->minmax[K].first);\n           scc.minmax[K].second = max(scc.minmax[K].second, x->minmax[K].second);\n         }\n         scc.size += x->size;\n         x++;\n       }\n       s.erase(a, b);\n     }\n     s.insert(scc);\n     cout << s.rbegin()->size << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct he {\n   int ind;\n   int val;\n   he(int ind_ = 0, int val_ = 0) : ind(ind_), val(val_) {}\n   bool operator<(const he oth) const { return val > oth.val; }\n };\n int n, m, k;\n vector<int> p[200200], c[200200];\n int minv[200200], maxv[200200];\n int np[200200], nc[200200];\n int ans[200200];\n queue<int> q;\n priority_queue<he> d_cand, id_cand;\n int main() {\n   cin >> n >> m >> k;\n   for (int i = 1; i <= n; ++i) {\n     int a;\n     cin >> a;\n     if (a == 0) {\n       minv[i] = 0;\n       maxv[i] = k + 1;\n     } else {\n       minv[i] = a;\n       maxv[i] = a;\n     }\n   }\n   for (int i = 0; i < m; ++i) {\n     int a, b;\n     cin >> a >> b;\n     p[b].push_back(a);\n     c[a].push_back(b);\n   }\n   for (int i = 1; i <= n; ++i) {\n     np[i] = p[i].size();\n     if (np[i] == 0) {\n       maxv[i] = min(k, maxv[i]);\n       q.push(i);\n     }\n   }\n   int reached = 0;\n   while (!q.empty()) {\n     int ind = q.front();\n     q.pop();\n     ++reached;\n     for (int x : c[ind]) {\n       maxv[x] = min(maxv[x], maxv[ind] - 1);\n       --np[x];\n       if (np[x] == 0) q.push(x);\n     }\n   }\n   if (reached < n) {\n     cout << '-1\n';\n     return 0;\n   }\n   for (int i = 1; i <= n; ++i) {\n     nc[i] = c[i].size();\n     if (nc[i] == 0) {\n       id_cand.push(he(i, minv[i]));\n     }\n   }\n   for (int step = 1; step <= k; ++step) {\n     while (!id_cand.empty() && id_cand.top().val <= step) {\n       int x = id_cand.top().ind;\n       id_cand.pop();\n       d_cand.push(he(x, maxv[x]));\n     }\n     if (d_cand.empty()) {\n       cout << '-1\n';\n       return 0;\n     }\n     int added = 0;\n     while (!d_cand.empty() && d_cand.top().val == step) {\n       ++added;\n       int x = d_cand.top().ind;\n       d_cand.pop();\n       ans[x] = step;\n       for (int y : p[x]) {\n         --nc[y];\n         minv[y] = max(minv[y], step + 1);\n         if (nc[y] == 0) {\n           id_cand.push(he(y, minv[y]));\n         }\n       }\n     }\n     if (added == 0) {\n       int x = d_cand.top().ind;\n       d_cand.pop();\n       if (maxv[x] < step) {\n         cout << '-1\n';\n         return 0;\n       }\n       ans[x] = step;\n       for (int y : p[x]) {\n         --nc[y];\n         minv[y] = max(minv[y], step + 1);\n         if (nc[y] == 0) {\n           id_cand.push(he(y, minv[y]));\n         }\n       }\n     }\n   }\n   for (int i = 1; i <= n; ++i) {\n     cout << ans[i] << ' ';\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<int, int> mp;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     int num;\n     cin >> num;\n     mp[num]++;\n   }\n   if (mp.size() != 2) {\n     cout << 'NO';\n     exit(0);\n   }\n   if (mp.begin()->second != mp.rbegin()->second) {\n     cout << 'NO';\n     exit(0);\n   }\n   cout << 'YES\n';\n   cout << mp.begin()->first << ' ' << mp.rbegin()->first;\n   return 0;\n }\n "}
+{"func_code_string": "#include<cstdio>\n #include<iostream>\n #include<cstring>\n #include<string>\n #include<cmath>\n #include<map>\n #include<algorithm>\n #include<vector>\n #include<set>\n #define Quick ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)\n #define ll long long\n #define INF 0x3f3f3f3f\n #define PI acos(-1)\n #define mem(a, b) memset(a, b, sizeof a)\n using namespace std;\n const int N = 1e6 + 3;\n const int mod =1e9 + 7; \n int a[N];\n ll dp[N];\n int vis[N];\n int tot = 0;\n \n int main()\n {\n 	Quick;\n 	int n; cin >> n;\n 	cout << (n - 1) % 9 + 1 << endl;;\n }\n \n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<int> 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<pair<int, int>> pary;\n   for (int i = 1; i <= n; ++i) {\n     int x = a[i];\n     vector<int> 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 <bits/stdc++.h>\n using namespace std;\n template <class T>\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 <class T>\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 <long long mod, long long primitive_root>\n class NTT {\n  public:\n   long long get_mod() const { return mod; }\n   void _ntt(vector<long long>& 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<long long>& input) { _ntt(input, 1); }\n   void intt(vector<long long>& 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<long long> convolution(const vector<long long>& a,\n                                 const vector<long long>& 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<long long> _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<long long> powup(const vector<long long>& a, long long exponent) {\n     long long ntt_size = 1;\n     while (ntt_size < (((long long)(a).size()) * exponent)) ntt_size *= 2;\n     vector<long long> _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<long long> mul(vector<long long> a, vector<long long> 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<long long>(m1, m2);\n   const long long m12_inv_m3 = mod_inv<long long>(m1 * m2, m3);\n   const long long m12_mod = m1 * m2 % mod;\n   vector<long long> 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<long long> exppoly(vector<long long> base, long long e, long long mod) {\n   vector<long long> 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<long long> v;\n   for (long long x = 0; x < 2 * k + 1; x++) v.push_back(1);\n   vector<long long> got = exppoly(v, t, MOD);\n   long long len = got.size();\n   vector<long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int N = 200005;\n int cnt[N];\n int n, k;\n int cut[N];\n vector<pair<int, int> > arr;\n struct Sub {\n   bool operator()(pair<int, pair<int, int> > a, pair<int, pair<int, int> > 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<int, int> a, pair<int, int> 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<pair<int, pair<int, int> >,\n                  vector<pair<int, pair<int, int> > >, 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<int, pair<int, int> >(arr[0].first,\n                                      pair<int, int>(1, arr[0].second)));\n   int i = 1;\n   pair<int, pair<int, int> > u =\n       pair<int, pair<int, int> >(2, pair<int, int>(10, 1));\n   pair<int, pair<int, int> > v =\n       pair<int, pair<int, int> >(2, pair<int, int>(4, 2));\n   while (len < k) {\n     pair<int, pair<int, int> > 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<int, pair<int, int> >(\n             cnt[u.second.second] / (u.second.first + 1),\n             pair<int, int>(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<int, pair<int, int> >(\n             cnt[u.second.second] / (u.second.first + 1),\n             pair<int, int>(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<int, pair<int, int> >(arr[i].first,\n                                            pair<int, int>(1, arr[i].second)));\n         i++;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 300010;\n long long n, a[N], t;\n map<long long, bool> vis;\n int solve() {\n   scanf('%lld', &t);\n   while (t--) {\n     scanf('%lld', &n);\n     vis.clear();\n     bool imp = 0;\n     for (int i = 1; i <= n; i++) {\n       scanf('%lld', &a[i]);\n       long long nw = (i + a[i]) % n;\n       if (nw < 0) nw += n;\n       if (vis[nw]) {\n         imp = 1;\n       }\n       vis[nw] = 1;\n     }\n     if (imp)\n       printf('NO\n');\n     else\n       printf('YES\n');\n   }\n   return 0;\n }\n int main() { return solve(); }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void file() {}\n void fast() {\n   std::ios_base::sync_with_stdio(0);\n   cin.tie(NULL);\n }\n const int N = 510 + 20;\n const double PI = acos(-1.0);\n bool cmp(complex<double> a, complex<double> b) {\n   if (a.real() == b.real()) return a.imag() < b.imag();\n   return a.real() < b.real();\n }\n bool cmp_doub(double a, double b) {\n   if (fabs(a - b) <= 1e-9) {\n     return 1;\n   }\n   return 0;\n }\n bool is_correct(complex<double> p1, complex<double> p2, complex<double> p3,\n                 complex<double> p4) {\n   vector<double> dists;\n   double dist1 = (hypot((p1 - p2).imag(), (p1 - p2).real()));\n   double dist2 = (hypot((p2 - p4).imag(), (p2 - p4).real()));\n   double dist3 = (hypot((p3 - p4).imag(), (p3 - p4).real()));\n   double dist4 = (hypot((p3 - p1).imag(), (p3 - p1).real()));\n   double dist5 = (hypot((p2 - p3).imag(), (p2 - p3).real()));\n   double dist6 = (hypot((p1 - p4).imag(), (p1 - p4).real()));\n   dists.push_back(dist1);\n   dists.push_back(dist2);\n   dists.push_back(dist3);\n   dists.push_back(dist4);\n   dists.push_back(dist5);\n   dists.push_back(dist6);\n   sort(((dists).begin()), ((dists).end()));\n   if (dists[0] > 0 && cmp_doub(dists[0], dists[1]) &&\n       cmp_doub(dists[1], dists[2]) && cmp_doub(dists[2], dists[3]) &&\n       cmp_doub(dists[3], dists[2])) {\n     if (cmp_doub(dists[4], dists[5]) && !cmp_doub(dists[5], dists[0])) {\n       return 1;\n     }\n   }\n   return 0;\n }\n complex<double> rotate(complex<double> a, complex<double> b, int c) {\n   for (int i = 0; i < c; i++) {\n     a = (((((a) - (b))) * exp(complex<double>(0, PI / 2.0))) + b);\n   }\n   return a;\n }\n int main() {\n   file();\n   fast();\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) {\n     vector<pair<complex<double>, complex<double>>> points;\n     for (int j = 0; j < 4; j++) {\n       int x, y, z, m;\n       cin >> x >> y >> z >> m;\n       points.push_back({complex<double>(x, y), complex<double>(z, m)});\n     }\n     int ans = 1e9;\n     for (int j1 = 0; j1 < 4; j1++) {\n       for (int j2 = 0; j2 < 4; j2++) {\n         for (int j3 = 0; j3 < 4; j3++) {\n           for (int j4 = 0; j4 < 4; j4++) {\n             vector<complex<double>> points1(4);\n             points1[0] = rotate(points[0].first, points[0].second, j1);\n             points1[1] = rotate(points[1].first, points[1].second, j2);\n             points1[2] = rotate(points[2].first, points[2].second, j3);\n             points1[3] = rotate(points[3].first, points[3].second, j4);\n             if (is_correct(points1[0], points1[1], points1[2], points1[3])) {\n               ans = min(ans, j1 + j2 + j3 + j4);\n             }\n           }\n         }\n       }\n     }\n     if (ans == 1e9) ans = -1;\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[300001];\n const long long mod = 1000000007;\n int main(int argc, const char* argv[]) {\n   string S;\n   cin >> S;\n   int n = (int)S.size();\n   string A(n, '2');\n   int scr = 0;\n   for (int i = 0; i < n; ++i) {\n     char a = S[(i + n - 1) % n];\n     char b = S[i];\n     char c = S[(i + 1) % n];\n     if (a == b && b == c)\n       A[i] = '0';\n     else if (a == b && b != c) {\n       ++scr;\n       A[i] = '1';\n       A[(i + 1) % n] = '0';\n     } else if (a != b && b == c)\n       A[i] = '0';\n   }\n   int fst = 0;\n   while (fst < n && !(A[fst] != '2' && A[(fst + 1) % n] == '2')) ++fst;\n   if (fst == n) {\n     if (A[0] == '2')\n       cout << n / 2 << endl;\n     else\n       cout << scr << endl;\n     return 0;\n   }\n   int j = 0;\n   for (int i = 0; i < n; ++i) {\n     char a = A[(i + fst) % n];\n     char b = A[(i + fst + 1) % n];\n     if (a == '2' && b != '2') {\n       scr += (i - j + 1) / 2;\n     }\n     if (a != '2' && b == '2') j = i;\n   }\n   cout << scr << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string s;\n int main() {\n   int n, a, b, k;\n   scanf('%d%d%d%d', &n, &a, &b, &k);\n   int tot = 0;\n   cin >> s;\n   int prev = -1;\n   for (int i = 0; i < n; i++)\n     if (s[i] == '1') {\n       tot += (i - prev - 1) / b;\n       prev = i;\n     }\n   tot += (n - prev - 1) / b;\n   int ans = tot - a + 1;\n   printf('%d\n', ans);\n   int cnt = 0;\n   for (int i = 0; i < n; i++) {\n     if (s[i] == '1') {\n       cnt = 0;\n     } else {\n       cnt++;\n     }\n     if (cnt == b && ans) {\n       ans--;\n       printf('%d ', i + 1);\n       cnt = 0;\n     }\n   }\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n using namespace std;\n typedef long long ll;\n typedef unsigned long long ull;\n const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\n const int inf = 0x3f3f3f3f;\n const ll linf = 0x3f3f3f3f3f3f3f3f;\n const ll mod = 1e9 + 7;\n //const ll mod = 998244353;\n  \n ll ksm(ll x,ll k) {\n 	ll ret=1;\n 	while(k) {\n 		if(k&1)	ret=ret*x%mod;\n 		x=x*x%mod,k>>=1;\n 	}\n 	return ret;\n }\n  \n ll prime[10000005],pcnt,phi[10000005];\n bool mark[10000005];\n inline void pre(ll n) {\n 	mark[1]=1;\n 	for(ll i=2;i<=n;i++) {\n 		if(!mark[i])	prime[++pcnt]=i/*,phi[i]=i-1*/;\n 		for(ll j=1;j<=pcnt;j++) {\n 			ll k=i*prime[j];\n 			if(k>n)	break;\n 			mark[k]=1;\n 			if(i%prime[j]==0) {\n //				phi[k]=phi[i]*prime[j];\n 				break;\n 			}\n //			else	phi[k]=phi[i]*(prime[j]-1);\n 		}\n 	}\n }\n \n struct data {\n 	int u,v,val;\n 	data(int _u=0,int _v=0,int _val=0):u(_u),v(_v),val(_val) {}\n 	bool operator < (const data &x) const {\n 		if(val==x.val)	return u<x.u;\n 		return val<x.val;\n 	}\n }a[505*505];\n int fa[505*505],c[505*505];\n vector <int> u,v;\n \n int getfa(int x) {\n 	return x==fa[x] ? x:fa[x]=getfa(fa[x]);\n }\n \n int main() {\n 	ios::sync_with_stdio(false);\n 	cin.tie(nullptr);\n 	int T=1;\n //	cin>>T;\n 	while(T--) {\n 		int n; cin>>n;\n 		for(int i=1;i<=n*n;i++)	fa[i]=i;\n 		int cnt=0;\n 		for(int i=1;i<=n;i++) {\n 			for(int j=1;j<=n;j++) {\n 				int x; cin>>x;\n 				if(i==j)	c[i]=x;\n 				if(i>=j)	continue;\n 				a[++cnt]=data(i,j,x);\n 			}\n 		}\n 		sort(a+1,a+cnt+1);\n 		int k=n;\n 		for(int i=1;i<=cnt;i++) {\n 			int fu=getfa(a[i].u),fv=getfa(a[i].v);\n 			if(fu==fv)	continue;\n 			if(fu>n && c[fu]==a[i].val) {\n 				fa[fv]=fu,u.push_back(fv),v.push_back(fu);\n 				continue;\n 			}\n 			if(fv>n && c[fv]==a[i].val) {\n 				fa[fu]=fv,u.push_back(fu),v.push_back(fv);\n 				continue;\n 			}\n 			k++;\n 			fa[fu]=fa[fv]=k;\n 			c[k]=a[i].val;\n 			u.push_back(fu),v.push_back(k);\n 			u.push_back(fv),v.push_back(k);\n 		}\n 		cout<<k<<'\n';\n 		for(int i=1;i<=k;i++)	cout<<c[i]<<' ';\n 		cout<<'\n';\n 		cout<<k<<'\n';\n 		for(int i=0;i<u.size();i++)	cout<<u[i]<<' '<<v[i]<<'\n';\n 	}\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<int, int> x, pair<int, int> 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<int> 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 <bits/stdc++.h>\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<int>::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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int N = 300010;\n int ans[N], vis[N];\n vector<int> G[N], s[N], tmp;\n void dfs(int u, int fa) {\n   int sz = s[u].size();\n   for (int i = 1; i <= sz; i++) vis[i] = 0;\n   for (int j : s[u]) {\n     if (ans[j] && ans[j] <= sz) vis[ans[j]] = 1;\n   }\n   for (int j = 1; j <= sz; j++) {\n     if (!vis[j]) tmp.push_back(j);\n   }\n   int cur = 0;\n   for (int j : s[u]) {\n     if (!ans[j]) ans[j] = tmp[cur++];\n   }\n   tmp.clear();\n   for (int v : G[u]) {\n     if (v == fa) continue;\n     dfs(v, u);\n   }\n }\n int main() {\n   int n, m;\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; i++) {\n     int cnt;\n     scanf('%d', &cnt);\n     for (int j = 1; j <= cnt; j++) {\n       int x;\n       scanf('%d', &x);\n       s[i].push_back(x);\n     }\n   }\n   for (int i = 1; i <= n - 1; i++) {\n     int u, v;\n     scanf('%d%d', &u, &v);\n     G[u].push_back(v);\n     G[v].push_back(u);\n   }\n   dfs(1, 0);\n   int mx = 0;\n   for (int i = 1; i <= m; i++) {\n     if (!ans[i]) ans[i] = 1;\n     mx = max(mx, ans[i]);\n   }\n   printf('%d\n', mx);\n   for (int i = 1; i <= m; i++) printf('%d ', ans[i]);\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long Time = 12622780800ll;\n int i, j, k, n, ch, s, m, h, day, date, month, Fg;\n long long t;\n struct cc {\n   int s, m, h, day, date, month, year;\n   int Js() {\n     if (month == 4 || month == 6 || month == 9 || month == 11) return 30;\n     if (month != 2) return 31;\n     if (year % 400 == 0 || (year % 100 && year % 4 == 0)) return 29;\n     return 28;\n   }\n   int count() {\n     if (year % 400 == 0 || (year % 100 && year % 4 == 0)) return 366;\n     return 365;\n   }\n   void work() {\n     if (s == 60) {\n       s = 0;\n       m++;\n     }\n     if (m == 60) {\n       h++;\n       m = 0;\n     }\n     if (h == 24) {\n       date++;\n       day = day % 7 + 1;\n       h = 0;\n     }\n     if (date == Js() + 1) {\n       month++;\n       date = 1;\n     }\n     if (month == 13) {\n       year++;\n       month = 1;\n     }\n   }\n   void operator+=(const long long &ad) {\n     long long a = ad;\n     while (s && a) {\n       a--;\n       if (++s == 60) work();\n     }\n     while (m && a >= 60) {\n       a -= 60;\n       if (++m == 60) work();\n     }\n     while (h && a >= 3600) {\n       a -= 3600;\n       if (++h == 24) work();\n     }\n     while (date != 1 && a >= 86400) {\n       a -= 86400;\n       day = day % 7 + 1;\n       if (++date == Js() + 1) work();\n     }\n     while (month != 1 && a >= Js() * 86400) {\n       a -= Js() * 86400;\n       day = (day + Js() - 1) % 7 + 1;\n       if (++month == 13) work();\n     }\n     while (year % 400 && a >= count() * 86400) {\n       a -= count() * 86400;\n       day = (day + count() - 1) % 7 + 1;\n       year++;\n     }\n     year += (a / Time) * 400;\n     a %= Time;\n     while (a >= count() * 86400) {\n       a -= count() * 86400;\n       day = (day + count() - 1) % 7 + 1;\n       year++;\n     }\n     while (a >= Js() * 86400) {\n       a -= Js() * 86400;\n       day = (day + Js() - 1) % 7 + 1;\n       if (++month == 13) work();\n     }\n     while (a >= 86400) {\n       a -= 86400;\n       day = day % 7 + 1;\n       if (++date == Js() + 1) work();\n     }\n     while (a >= 3600) {\n       a -= 3600;\n       if (++h == 24) work();\n     }\n     while (a >= 60) {\n       a -= 60;\n       if (++m == 60) work();\n     }\n     while (a) {\n       a--;\n       if (++s == 60) work();\n     }\n   }\n } a;\n void R(long long &x) {\n   x = 0;\n   ch = getchar();\n   while (ch < '0' || '9' < ch) ch = getchar();\n   while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = getchar();\n }\n void W(long long x) {\n   if (x >= 10) W(x / 10);\n   putchar(x % 10 + '0');\n }\n bool check() {\n   if (month == -1 || month == a.month)\n     if ((day == -1 && date == -1) || (day == a.day || date == a.date))\n       if (h == -1 || h == a.h)\n         if (m == -1 || m == a.m)\n           if (s == -1 || s == a.s) return 1;\n   return 0;\n }\n int main() {\n   scanf('%d%d%d%d%d%d', &s, &m, &h, &day, &date, &month);\n   scanf('%d', &n);\n   for (i = 1; i <= n; i++) {\n     R(t);\n     t++;\n     Fg = 0;\n     a.s = a.m = a.h = 0;\n     a.day = 4;\n     a.date = a.month = 1;\n     a.year = 1970;\n     a += t;\n     while (a.s && !check()) {\n       t++;\n       if (++a.s == 60) a.work();\n     }\n     while (s != -1 && a.s != s) {\n       t++;\n       a.s++;\n     }\n     while (a.m && !check()) {\n       t += 60;\n       if (++a.m == 60) a.work();\n     }\n     while (m != -1 && a.m != m) {\n       t += 60;\n       a.m++;\n     }\n     while (a.h && !check()) {\n       t += 3600;\n       if (++a.h == 24) a.work();\n     }\n     while (h != -1 && a.h != h) {\n       t += 3600;\n       a.h++;\n     }\n     while (!check()) {\n       t += 86400;\n       a.day = a.day % 7 + 1;\n       a.date++;\n       a.work();\n     }\n     W(t);\n     puts('');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   while (cin >> n) {\n     if (n == 1 || n == 2)\n       cout << '-1\n';\n     else if (n == 3)\n       cout << '210\n';\n     else {\n       if (n % 6 == 1) {\n         cout << '1';\n         for (int i = 3; i < n; i++) cout << '0';\n         cout << '20\n';\n       }\n       if (n % 6 == 2) {\n         cout << '1';\n         for (int i = 3; i < n - 1; i++) cout << '0';\n         cout << '200\n';\n       }\n       if (n % 6 == 3) {\n         cout << '1';\n         for (int i = 3; i < n - 1; i++) cout << '0';\n         cout << '110\n';\n       }\n       if (n % 6 == 4) {\n         cout << '1';\n         for (int i = 3; i < n; i++) cout << '0';\n         cout << '50\n';\n       }\n       if (n % 6 == 5) {\n         cout << '1';\n         for (int i = 3; i < n; i++) cout << '0';\n         cout << '80\n';\n       }\n       if (n % 6 == 0) {\n         cout << '1';\n         for (int i = 3; i < n - 1; i++) cout << '0';\n         cout << '170\n';\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n using namespace std;\n bool ok[100005];\n typedef long long int ll;\n int gcd(int a ,int b)\n {\n     if(b==0)\n     return a;\n     else if(a==0)\n     return a;\n     else\n \n      return gcd(b,a%b);\n }\n int main()\n {\n     int n;\n     cin>>n;\n     ll prod=1;\n     for(int i=1;i<n;i++)\n     {\n         if(gcd(n,i)==1)\n         {\n             ok[i]=1;\n             prod=(prod*i)%n;\n         }\n     }\n     if(prod!=1)\n     ok[prod]=0;\n \n     cout<<count(ok+1,ok+n,1)<<endl;\n     for(int i=1;i<n;i++)\n     {\n         if(ok[i])\n         cout<<i<<' ';\n     }\n     return 0;\n \n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int inf = 1000000000, mxx, mxy, mnx = inf, mny = inf, n, m, i, j, r = 0,\n     x[2000001], y[2000001];\n char a[3001][3001], c[3001][3001];\n bool ok(int mxx, int mxy, int mnx, int mny) {\n   for (int i = 0; i < r; i++)\n     if (x[i] < mnx || x[i] > mxx || y[i] < mny || y[i] > mxy ||\n         (x[i] != mxx && x[i] != mnx && y[i] != mxy && y[i] != mny))\n       return false;\n   return (mxx - mnx == mxy - mny && mxx < n && mxy < m && mnx >= 0 && mny >= 0);\n }\n void go(int mxx, int mxy, int mnx, int mny) {\n   int i, j;\n   for (i = 0; i < n; i++)\n     for (j = 0; j < m; j++) {\n       if (i >= mnx && i <= mxx && j >= mny && j <= mxy &&\n           ((i == mxx || i == mnx) || (j == mxy || j == mny)) && a[i][j] != 'w')\n         c[i][j] = '+';\n       else\n         c[i][j] = a[i][j];\n     }\n }\n int main() {\n   cin >> n >> m;\n   for (i = 0; i < n; i++)\n     for (j = 0; j < m; j++) {\n       cin >> a[i][j];\n       if (a[i][j] == 'w') {\n         x[r] = i;\n         y[r] = j;\n         r++;\n       }\n     }\n   for (i = 0; i < r; i++) {\n     if (x[i] > mxx) mxx = x[i];\n     if (y[i] > mxy) mxy = y[i];\n     if (x[i] < mnx) mnx = x[i];\n     if (y[i] < mny) mny = y[i];\n   }\n   for (i = 0; i <= m; i++) {\n     if (ok(mxx, i + (mxx - mnx), mnx, i)) {\n       go(mxx, i + (mxx - mnx), mnx, i);\n       for (i = 0; i < n; i++)\n         for (j = 0; j < m; j++) {\n           cout << c[i][j];\n           if (j == m - 1) cout << endl;\n         }\n       return 0;\n     }\n   }\n   for (i = 0; i <= n; i++) {\n     if (ok(i + (mxy - mny), mxy, i, mny)) {\n       go(i + (mxy - mny), mxy, i, mny);\n       for (i = 0; i < n; i++)\n         for (j = 0; j < m; j++) {\n           cout << c[i][j];\n           if (j == m - 1) cout << endl;\n         }\n       return 0;\n     }\n   }\n   cout << '-1';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 11, MAXL = 100000 + 10;\n struct State {\n   int len, fa, num[MAXN], tr[26];\n   State() : len(0), fa(0) {\n     memset(num, 0, sizeof(num));\n     memset(tr, 0, sizeof(tr));\n   }\n   State(int len, int fa, int numr, int ref) : len(len), fa(fa) {\n     memset(num, 0, sizeof(num));\n     memset(tr, 0, sizeof(tr));\n     num[ref] = numr;\n   }\n } SAM[MAXL * 2];\n int n, tot = 1, c[MAXN][2];\n string str[MAXN];\n void Construct_SAM(const string &str, int ref) {\n   int ns = str.size();\n   for (int cp = 1, pre = 1, i = 0, id = str[i] - 'a'; i < ns;\n        id = str[++i] - 'a', pre = cp) {\n     if (SAM[cp].tr[id] && SAM[SAM[cp].tr[id]].len == SAM[cp].len + 1) {\n       cp = SAM[cp].tr[id];\n       ++SAM[cp].num[ref];\n       continue;\n     }\n     cp = ++tot;\n     SAM[cp] = State(SAM[pre].len + 1, 0, 1, ref);\n     for (; pre && !SAM[pre].tr[id]; SAM[pre].tr[id] = cp, pre = SAM[pre].fa)\n       ;\n     if (pre != 0)\n       if (SAM[pre].len + 1 == SAM[SAM[pre].tr[id]].len)\n         SAM[cp].fa = SAM[pre].tr[id];\n       else {\n         int tp = SAM[pre].tr[id];\n         SAM[++tot] = State(SAM[pre].len + 1, SAM[tp].fa, 0, 0);\n         memcpy(SAM[tot].tr, SAM[tp].tr, sizeof(SAM[tp].tr));\n         SAM[cp].fa = SAM[tp].fa = tot;\n         for (; pre && SAM[pre].tr[id] == tp;\n              SAM[pre].tr[id] = tot, pre = SAM[pre].fa)\n           ;\n       }\n     else\n       SAM[cp].fa = 1;\n   }\n }\n void init() {\n   cin >> str[0];\n   c[0][0] = 1, c[0][1] = MAXL;\n   Construct_SAM(str[0], 0);\n   cin >> n;\n   for (int i = 1; i <= n; ++i) {\n     cin >> str[i] >> c[i][0] >> c[i][1];\n     Construct_SAM(str[i], i);\n   }\n }\n vector<int> l[MAXL];\n void Calc(int id) {\n   for (int i = MAXL - 1; i >= 0; --i)\n     for (int j = 0; j < (int)l[i].size(); ++j)\n       SAM[SAM[l[i][j]].fa].num[id] += SAM[l[i][j]].num[id];\n }\n bool Check(int x) {\n   for (int i = 0; i <= n; ++i)\n     if (!(SAM[x].num[i] >= c[i][0] && SAM[x].num[i] <= c[i][1])) return false;\n   return true;\n }\n void solve() {\n   for (int i = 1; i <= tot; ++i) l[SAM[i].len].push_back(i);\n   for (int i = 0; i <= n; ++i) Calc(i);\n   long long CC = 0;\n   for (int i = 2; i <= tot; ++i)\n     if (Check(i)) CC += SAM[i].len - SAM[SAM[i].fa].len;\n   cout << CC << endl;\n }\n int main() {\n   init();\n   solve();\n   fclose(stdin);\n   fclose(stdout);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n set<long long int> st;\n set<long long int>::iterator it;\n long long int cnt[200010];\n int main() {\n   long long int n, a, b, x, y, z, p, m, d, mn, mx, t, i;\n   scanf('%lld', &t);\n   while (t--) {\n     scanf('%lld', &n);\n     p = 0;\n     for (i = 1; i <= n; i++) {\n       scanf('%lld', &a);\n       st.insert(a);\n       cnt[a]++;\n       p = max(p, cnt[a]);\n     }\n     x = st.size();\n     if (x == 1) {\n       if (p >= 2) {\n         cout << 1 << endl;\n       } else\n         cout << 0 << endl;\n     } else {\n       x = x - 1;\n       if (p <= x)\n         cout << p << endl;\n       else {\n         d = p - x;\n         if (d > 1)\n           cout << x + 1 << endl;\n         else\n           cout << x << endl;\n       }\n     }\n     for (i = 1; i <= n; i++) cnt[i] = 0;\n     st.clear();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool prime[1500000 + 10];\n bool a[1500000 + 10];\n int func(int N, int x) {\n   int i, ans = 0;\n   if (x == 2) return 0;\n   if (a[1]) return 1;\n   if (x >= 1500000) return -1;\n   for (i = 2; i <= x - 1; i++)\n     if (prime[i])\n       if (a[i])\n         ans++;\n       else\n         return -1;\n   return ans;\n }\n int main(void) {\n   int i, j, N, x, tmp;\n   for (i = 2; i < 1500000; i++) prime[i] = true;\n   for (i = 2; i * i < 1500000; i++)\n     if (prime[i])\n       for (j = i * i; j < 1500000; j += i) prime[j] = false;\n   scanf('%d%d', &N, &x);\n   for ((i) = 0; (i) < (int)(N); (i)++) {\n     scanf('%d', &tmp);\n     if (tmp < 1500000) a[tmp] = true;\n   }\n   int ans = func(N, x);\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void task();\n int main() {\n   srand(time(0));\n   ios_base::sync_with_stdio(0);\n   task();\n   return 0;\n }\n vector<int> prefix_function(string s) {\n   int n = s.length();\n   vector<int> p(n, 0);\n   for (int i = 1; i < n; ++i) {\n     int j = p[i - 1];\n     while (j > 0 && s[i] != s[j]) j = p[j - 1];\n     if (s[i] == s[j]) p[i] = j + 1;\n   }\n   return p;\n }\n string s[3];\n void task() {\n   cin >> s[0] >> s[1] >> s[2];\n   sort(s, s + 3);\n   int ans = 1e9 + 10;\n   do {\n     string ss = s[0];\n     {\n       vector<int> p = prefix_function(s[1] + '!' + s[0]);\n       int mx = 0;\n       for (int i = s[1].length(); i < ((int)((p).size())); ++i)\n         mx = max(mx, p[i]);\n       if (p.back() != ((int)((s[1]).size())) && mx != ((int)((s[1]).size())))\n         ss += s[1].substr(p.back(), ((int)((s[1]).size())) - p.back());\n     }\n     {\n       vector<int> p = prefix_function(s[2] + '!' + ss);\n       int mx = 0;\n       for (int i = s[2].length(); i < ((int)((p).size())); ++i)\n         mx = max(mx, p[i]);\n       if (p.back() != ((int)((s[2]).size())) && mx != ((int)((s[2]).size())))\n         ss += s[2].substr(p.back(), ((int)((s[2]).size())) - p.back());\n       ans = min(ans, ((int)((ss).size())));\n     }\n   } while (next_permutation(s, s + 3));\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int inf = 0x3f3f3f3f;\n const int MOD = 1e9 + 7;\n const int maxn = 3e5 + 10;\n const int maxv = 1e3 + 10;\n const double eps = 1e-9;\n std::vector<int> G[maxn];\n int ans[maxn];\n void inv(int i) { ans[i] ^= 1; }\n bool bad(int u) {\n   int cnt = 0;\n   for (int i = 0; i < G[u].size(); i++) {\n     cnt += ans[u] == ans[G[u][i]];\n   }\n   return cnt >= 2;\n }\n int main() {\n   int n, m;\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= m; i++) {\n     int u, v;\n     scanf('%d%d', &u, &v);\n     if (u > v) swap(u, v);\n     G[v].push_back(u);\n     G[u].push_back(v);\n   }\n   stack<int> s;\n   for (int i = 1; i <= n; i++) {\n     if (bad(i)) s.push(i);\n   }\n   while (s.size()) {\n     int u = s.top();\n     s.pop();\n     if (bad(u)) inv(u);\n     for (int i = 0; i < G[u].size(); i++) {\n       int v = G[u][i];\n       if (bad(G[u][i])) s.push(v);\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     printf('%d', ans[i]);\n   }\n   puts('');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n char s[105];\n string S;\n multiset<string> st;\n vector<string> v;\n inline bool cmp(string a, string b) { return a.length() < b.length(); }\n int cnt[26];\n char ans[105];\n int f[105][26];\n int main() {\n   scanf('%d', &n);\n   if (n <= 3) {\n     if (n == 1) {\n       printf('? 1 1\n'), fflush(stdout);\n       scanf('%s', s);\n       printf('! %s\n', s);\n       return 0;\n     }\n     printf('? 2 %d\n', n), fflush(stdout);\n     for (int i = 1; i <= n * (n - 1) / 2; i++) {\n       scanf('%s', s);\n       S = s;\n       sort(S.begin(), S.end());\n       st.insert(S);\n     }\n     printf('? 1 %d\n', n), fflush(stdout);\n     for (int i = 1; i <= n * (n + 1) / 2; i++) {\n       scanf('%s', s);\n       S = s;\n       sort(S.begin(), S.end());\n       if (st.find(S) == st.end())\n         v.push_back(S);\n       else\n         st.erase(st.find(S));\n     }\n     sort(v.begin(), v.end(), cmp);\n     printf('! ');\n     for (int i = 0; i < n; i++) {\n       if (i == 0) {\n         printf('%c', v[i][0]);\n         continue;\n       }\n       for (int j = 0; j < i + 1; j++) cnt[v[i][j] - 'a']++;\n       for (int j = 0; j < i; j++) cnt[v[i - 1][j] - 'a']--;\n       for (int j = 0; j < 26; j++) {\n         if (cnt[j]) {\n           cnt[j] = 0, printf('%c', j + 'a');\n           break;\n         }\n       }\n     }\n     puts('');\n     return 0;\n   }\n   int m = (n + 1) / 2;\n   printf('? 2 %d\n', m), fflush(stdout);\n   for (int i = 1; i <= m * (m - 1) / 2; i++) {\n     scanf('%s', s);\n     S = s;\n     sort(S.begin(), S.end());\n     st.insert(S);\n   }\n   printf('? 1 %d\n', m), fflush(stdout);\n   for (int i = 1; i <= m * (m + 1) / 2; i++) {\n     scanf('%s', s);\n     S = s;\n     sort(S.begin(), S.end());\n     if (st.find(S) == st.end())\n       v.push_back(S);\n     else\n       st.erase(st.find(S));\n   }\n   sort(v.begin(), v.end(), cmp);\n   for (int i = 0; i < m; i++) {\n     if (i == 0) {\n       ans[i + 1] = v[i][0];\n       continue;\n     }\n     for (int j = 0; j < i + 1; j++) cnt[v[i][j] - 'a']++;\n     for (int j = 0; j < i; j++) cnt[v[i - 1][j] - 'a']--;\n     for (int j = 0; j < 26; j++) {\n       if (cnt[j]) {\n         cnt[j] = 0, ans[i + 1] = j + 'a';\n         break;\n       }\n     }\n   }\n   printf('? 1 %d\n', n), fflush(stdout);\n   for (int i = 1; i <= n * (n + 1) / 2; i++) {\n     scanf('%s', s);\n     int len = strlen(s);\n     for (int j = 0; j < len; j++) {\n       f[len][s[j] - 'a']++;\n     }\n   }\n   for (int i = m; i; i--) {\n     for (int j = 0; j < 26; j++) {\n       int x = f[i][j] - f[i - 1][j];\n       for (int k = i; k < n + 1 - i; k++) x -= ans[k] == j + 'a';\n       if (x) {\n         ans[n + 1 - i] = j + 'a';\n         break;\n       }\n     }\n   }\n   printf('! ');\n   for (int i = 1; i <= n; i++) printf('%c', ans[i]);\n   puts('');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a, b;\n vector<long long> A, B, C;\n int main() {\n   scanf('%lld %lld', &a, &b);\n   for (long long i = 1; i <= sqrt(a); i++)\n     if (a % i == 0) A.push_back(i);\n   for (long long i = 1; i <= sqrt(b); i++)\n     if (b % i == 0) B.push_back(i);\n   for (long long i = 1; i <= sqrt(a + b); i++)\n     if ((a + b) % i == 0) C.push_back(i);\n   long long ans;\n   for (long long i : C) {\n     for (long long j : A) {\n       if (j <= i && a / j <= (a + b) / i) ans = 2 * i + (2 * (a + b) / i);\n     }\n     for (long long j : B) {\n       if (j <= i && b / j <= (a + b) / i) ans = 2 * i + (2 * (a + b) / i);\n     }\n   }\n   printf('%lld\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> a, b, e;\n char s[5];\n long long ans;\n int c;\n int main() {\n   int n, f;\n   scanf('%d', &n);\n   while (n--) {\n     scanf('%s %d', &s, &f);\n     if (s[0] == '0' && s[1] == '1')\n       a.push_back(f);\n     else if (s[0] == '1' && s[1] == '0')\n       b.push_back(f);\n     else if (s[0] == '0' && s[1] == '0')\n       e.push_back(f);\n     else {\n       c++;\n       ans += f;\n     }\n   }\n   int temp = c + 2 * min((int)a.size(), (int)b.size());\n   c += min((int)a.size(), (int)b.size());\n   if (!a.empty()) sort(a.rbegin(), a.rend());\n   if (!b.empty()) sort(b.rbegin(), b.rend());\n   for (int i = 0; i < min((int)a.size(), (int)b.size()); ++i) {\n     ans += a[i];\n     ans += b[i];\n   }\n   if (a.size() > b.size()) {\n     for (int i = min(a.size(), b.size()); i < a.size(); ++i) e.push_back(a[i]);\n   } else if (b.size() > a.size()) {\n     for (int i = min(a.size(), b.size()); i < b.size(); ++i) e.push_back(b[i]);\n   }\n   if (!e.empty()) sort(e.rbegin(), e.rend());\n   for (int i = 0; i < e.size(); ++i) {\n     if (((temp + 2) / 2) <= c) {\n       ans += e[i];\n       temp++;\n     }\n   }\n   printf('%lld', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n ifstream fin('Sisend.txt');\n int n, c;\n bool b[100005];\n vector<int> v, v1;\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cerr.tie(0);\n   cin >> n;\n   for (int(i) = (0); ((i)) < ((n)); ((i))++) {\n     cin >> c;\n     v.emplace_back(c);\n   }\n   sort(v.rbegin(), v.rend());\n   int l = 1, r = v.size() / 2 + 1;\n   int vas = 0;\n   v1.emplace_back(v[0]);\n   while (r < v.size()) {\n     while (r < v.size() and v[r] == v[l]) r++;\n     v1.emplace_back(v[r]), v1.emplace_back(v[l]);\n     b[r] = 1;\n     vas++;\n     l++;\n     r++;\n   }\n   while (l < v.size()) {\n     if (!b[l]) {\n       v1.emplace_back(v[l]);\n     }\n     l++;\n   }\n   cout << vas << endl;\n   for (int i : v1) cout << i << ' ';\n }\n "}
+{"func_code_string": "///****In the name of ALLAH, most Gracious, most Compassionate****//\n #include<bits/stdc++.h>\n \n #define Input                   freopen('in.txt','r',stdin)\n #define Output                  freopen('out.txt','w',stdout)\n #define ll                      long long int\n #define ull                     unsigned long long int\n #define pii                     pair<int,int>\n #define pll                     pair<ll,ll>\n #define sc                      scanf\n #define scin(x)                 sc('%d',&(x))\n #define scin2(x,y)              sc('%d %d',&(x),&(y))\n #define scln(x)                 sc('%lld',&(x))\n #define scln2(x,y)              sc('%lld %lld',&(x),&(y))\n #define pf                      printf\n #define all(a)                  (a.begin()),(a.end())\n #define UNIQUE(X)               (X).erase(unique(all(X)),(X).end())\n #define SORT_UNIQUE(c)          (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))\n #define ms(a,b)                 memset(a,b,sizeof(a))\n #define pb(a)                   push_back(a)\n #define mp                      make_pair\n #define db                      double\n #define EPS                     10E-10\n #define ff                      first\n #define ss                      second\n #define sqr(x)                  (x)*(x)\n #define vi                      vector<int>\n #define vl                      vector<ll>\n #define vii                     vector<vector<int> >\n #define vll                     vector<vector<ll> >\n #define DBG                     pf('HI\n')\n #define MOD                     1000000007\n #define CIN                     ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)\n #define RUN_CASE(t,T)           for(__typeof(t) t=1;t<=T;t++)\n #define CASE(t)                 printf('Case %d: ',t)\n #define CASEl(t)                printf('Case %d:\n',t)\n #define intlimit                2147483690\n #define longlimit               9223372036854775800\n #define infinity                (1<<28)\n #define gcd(a,b)                __gcd(a,b)\n #define lcm(a,b)                (a)*(b)/gcd(a,b)\n #define mxx                     123456789\n #define PI                      2*acos(0.0)\n #define rep(i,a,b)              for(__typeof(i) i=a;i<=b;i++)\n #define rev(i,a,b)              for(__typeof(i) i=a;i>=b;i--)\n #define coutv(v)                for(auto it:v)cout<<it<<' ';cout<<'\n';\n #define cinv(v)                 for(auto &it:v)cin>>it;\n #define srt(v)                  sort(v.begin(),v.end());\n #define rsrt(v)                 sort(v.rbegin(),v.rend());\n #define rvs(v)                  reverse(v.begin(),v.end());\n \n using namespace std;\n /**     toint, tostring, BigMod, Power , sieve, Primefactorize ,frequency in n!     **/\n //ll toint(string s){ll n=0,k=1;for(int i=s.size()-1; i>=0; i--){n += ((s[i]-'0')*k);k*=10;}return n;}\n //string tostring(ll x){string s='';while(x){s += (x%10)+'0';x/=10;}reverse(s.begin(),s.end());return s;}\n //ll BigMod(ll a,ll b){if(b == 0)return 1%MOD;else if(b%2 == 0){ll temp=BigMod(a,b/2);return ((temp%MOD)*(temp%MOD))%MOD;}else{return ((a%MOD)*BigMod(a,b-1)%MOD)%MOD;}}\n //ll Power(ll a,ll n){ll ret=1;for(ll i=1 ; i<=n ; i++)ret = ((ret%MOD)*(a%MOD))%MOD;return ret;}\n //bool isPrime(ll n){for(ll i=2 ; i*i<=n ; i++){if(n%i == 0)return 0;}return 1;}\n //vector<ll>Prime;\n //bool mark[10000003];\n //void sieve(ll n){ll i,j;mark[1]=1;for(i=4; i<=n; i+=2)mark[i]=1;Prime.push_back(2);for(i=3; i<=n; i+=2){if(!mark[i]){Prime.push_back(i);if(i*i<=n){for(j=i*i; j<=n; j+=(i*2))mark[j]=1;}}}}\n //map<ll,ll>Factor;\n //void Primefactorize(ll n){for(ll i=0; i<Prime.size() && Prime[i]*Prime[i]<=n; i++){if(n%Prime[i] == 0){while(n%Prime[i] == 0){Factor[Prime[i]]++;n/=Prime[i];}}}if(n>1){Factor[n]++;}}\n //ll frequency(ll n,ll factor)/** Frequency of a factor in n! **/{ll cnt=0;while(n){cnt += (n/factor);n /= factor;}return cnt;}\n /**     Order Set       **/\n //#include <ext/pb_ds/assoc_container.hpp>\n //using namespace __gnu_pbds;\n //template<typename T> using orderset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;\n //orderset<int> s ; //orderset<int>::iterator it ;\n //orderset<int> X; //X.insert(1); //X.insert(2); //X.insert(4); //X.insert(8); //X.insert(16);\n //cout<<*X.find_by_order(0)<<endl; // 2 //cout<<*X.find_by_order(2)<<endl; // 4 //cout<<*X.find_by_order(4)<<endl; // 16 //cout<<(end(X)==X.find_by_order(6))<<endl; // true\n //cout<<X.order_of_key(-5)<<endl;  // 0 //cout<<X.order_of_key(1)<<endl;   // 0 //cout<<X.order_of_key(3)<<endl;   // 2 //cout<<X.order_of_key(4)<<endl;   // 2 //cout<<X.order_of_key(400)<<endl; // 5\n \n struct custom_hash {    ///For unordered map or set\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 \n     size_t operator()(uint64_t x) const {\n         static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n         return splitmix64(x + FIXED_RANDOM);\n     }\n };\n \n /** Debugging Tool **/\n #define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }\n void err(istream_iterator<string> it) {}\n template<typename T, typename... Args>\n void err(istream_iterator<string> it, T a, Args... args)\n {\n     cerr << *it << ' = ' << a << endl;\n     err(++it, args...);\n }\n ///\n \n inline int add(int a, int b) {a += b; return a >= MOD ? a - MOD : a;}\n inline int sub(int a, int b) {a -= b; return a < 0 ? a + MOD : a;}\n inline int mul(int a, int b) {return (ll) a * b % MOD;}\n int Set(int N, int pos) {return  N = N | (1<<pos);}\n int Reset(int N, int pos) {return  N = N & ~(1<<pos);}\n bool Cheek(int N, int pos) {return  (bool)(N & (1<<pos));}\n \n //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n //int my_rand(int l,int r)\n //{\n //    return uniform_int_distribution<int>(l , r) (rng);\n //}\n \n //string small = 'abcdefghijklmnopqrstuvwxyz';\n //string capital = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ';\n \n ///------------------Graph Moves-------------------\n ///const int fx[] = {+1,-1,+0,+0};\n ///const int fy[] = {+0,+0,+1,-1};\n ///const int fx[] = {+0,+0,+1,-1,-1,+1,-1,+1}; ///King's move\n ///const int fy[] = {-1,+1,+0,+0,+1,+1,-1,-1}; ///King's move\n ///const int fx[] = {-2,-2,-1,-1,+1,+1,+2,+2}; ///Knight's move\n ///const int fy[] = {-1,+1,-2,+2,-2,+2,-1,+1}; ///Knight's move\n \n ll s[5009],added[5009];\n \n void Solve(int t)\n {\n     ll i,j,k,n,ans=0;\n     scln(n);\n     for(i=1 ; i<=n ; i++)\n         scln(s[i]);\n \n     for(i=1 ; i<=n ; i++){\n         if(s[i] - added[i] <= 1){\n             for(j=i+2 ; j<=min(n , i+s[i]) ; j++)\n                 added[j]++;\n             if(added[i] >= s[i]){\n                 ll xtra = added[i] - (s[i] - 1);\n                 added[i+1] += xtra;\n             }\n             continue;\n         }\n \n         ll temp = (s[i] - 1) - added[i];\n         added[i] += temp;\n         ans += temp;\n \n //        error(i , temp);\n         for(j=i+2 ; j<=min(n , i+s[i]) ; j++){\n             added[j]++;\n         }\n \n         if(added[i] >= s[i]){\n             ll xtra = added[i] - (s[i] - 1);\n             added[i+1] += xtra;\n         }\n     }\n     pf('%lld\n',ans);\n \n     for(i=1 ; i<=n+2 ; i++)\n         s[i] = added[i] = 0;\n }\n \n int main()\n {\n     int t,T;\n     T = 1;\n     cin>>T;\n     RUN_CASE(t,T)\n     {\n         Solve(t);\n     }\n     return 0;\n }\n \n /** Stuff u should look for\n     * Avoid overflow\n     * Corner(Small) case\n     * Don't get stuck on one approach\n     * Don't forget to clean used memory in each case\n **/\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 2e9;\n const long long BIG_INF = 1e18;\n const long long MOD = 1e9 + 7;\n const int maxn = 1e5 + 5;\n vector<int> g[maxn];\n int p[maxn], max_height, deep_v;\n void dfs(int v, int height) {\n   if (height > max_height) {\n     max_height = height;\n     deep_v = v;\n   }\n   for (int j = 0; j < (int)g[v].size(); j++) {\n     int to = g[v][j];\n     dfs(to, height + 1);\n   }\n }\n void out(int v) {\n   if (v) out(p[v]);\n   ;\n   cout << v << ' ';\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   for (int i = 1; i < n; i++) {\n     int u;\n     cin >> u;\n     p[i] = u;\n     g[u].push_back(i);\n   }\n   dfs(0, 0);\n   vector<int> ans;\n   int v = deep_v;\n   while (1) {\n     while (v && (int)g[p[v]].size() == 1) v = p[v];\n     if (!v) break;\n     int par = p[v];\n     g[par].erase(find(g[par].begin(), g[par].end(), v));\n     int to = g[par][0];\n     ans.push_back(v);\n     g[to].push_back(v);\n     p[v] = to;\n   }\n   out(deep_v);\n   cout << '\n';\n   reverse(ans.begin(), ans.end());\n   cout << (int)ans.size() << '\n';\n   for (int i = 0; i < (int)ans.size(); i++) cout << ans[i] << ' ';\n   cout << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   char a[19];\n   int i, c = 0, t = 0, x = 0;\n   scanf('%s', &a);\n   for (i = 0; a[i] != '\0'; i++) {\n     t = t + a[i];\n   }\n   x = a[0] - 1 + (i - 1) * '9';\n   if (t >= x)\n     printf('%s', a);\n   else {\n     if (a[1] != '9') {\n       for (i = 0; a[i] != '\0'; i++) {\n         if (c > 0)\n           printf('9');\n         else {\n           if (a[i] > '1') printf('%c', a[i] - 1);\n           c++;\n         }\n       }\n     } else {\n       c = 0;\n       printf('%c', a[0]);\n       for (i = 1; a[i] != '\0'; i++) {\n         if (c == 0) {\n           if (a[i + 1] == '9')\n             printf('9');\n           else {\n             printf('8');\n             c++;\n           }\n         } else\n           printf('9');\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n;\n long long a[1006];\n long long fac[1000006];\n long long power(long long a, long long i) {\n   if (i == 0) return 1 % 1000000007;\n   long long t = power(a, i / 2);\n   long long ans = t * t % 1000000007;\n   if (i % 2 == 1) ans = ans * a % 1000000007;\n   return ans;\n }\n long long work(long long m, long long i) {\n   return ((fac[m] % 1000000007) *\n           (power(fac[i] * fac[m - i] % 1000000007, 1000000007 - 2) %\n            1000000007)) %\n          1000000007;\n }\n int main() {\n   fac[0] = 1;\n   for (int i = 1; i < 1000006; i++) fac[i] = (fac[i - 1] * i) % 1000000007;\n   long long ans = 1;\n   long long sum = 0;\n   cin >> n;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n     sum += a[i];\n   }\n   for (int i = n; i >= 1; i--) {\n     ans = ans * work(sum - 1, a[i] - 1) % 1000000007;\n     sum -= a[i];\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve() {\n   long long int n, k;\n   cin >> n >> k;\n   long long int a[n], s = 0;\n   vector<pair<long long int, long long int> > v;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n     if (a[i] <= k) {\n       v.push_back({a[i], i + 1});\n       s += a[i];\n     }\n   }\n   if (s < (k + 1) / 2) {\n     cout << -1 << endl;\n     return;\n   }\n   s = 0;\n   sort(v.begin(), v.end());\n   vector<long long int> ans;\n   for (int i = v.size() - 1; i >= 0; i--) {\n     if (s + v[i].first >= (k + 1) / 2 and s + v[i].first <= k) {\n       s += v[i].first;\n       ans.push_back(v[i].second);\n       break;\n     } else if (s + v[i].first < (k + 1) / 2) {\n       ans.push_back(v[i].second);\n       s += v[i].first;\n     }\n   }\n   if (ans.size() == 0) {\n     cout << -1 << endl;\n   }\n   sort(ans.begin(), ans.end());\n   cout << ans.size() << endl;\n   for (int i = 0; i < ans.size(); i++) {\n     cout << ans[i] << ' ';\n   }\n   cout << endl;\n }\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n using namespace std;\n const long long INF = 1e12;\n const int MOD = 1e9 + 7;\n const unsigned long long BIT_FLAG_0 = (1 << 0);\n const unsigned long long BIT_FLAG_1 = (1 << 1);\n const unsigned long long BIT_FLAG_2 = (1 << 2);\n const unsigned long long BIT_FLAG_3 = (1 << 3);\n const unsigned long long BIT_FLAG_4 = (1 << 4);\n const unsigned long long BIT_FLAG_5 = (1 << 5);\n const unsigned long long BIT_FLAG_6 = (1 << 6);\n const unsigned long long BIT_FLAG_7 = (1 << 7);\n const long long dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};\n const long long Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},\n                 Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};\n void print() { cout << '\n'; }\n template <class Head, class... Tail>\n void print(Head &&head, Tail &&...tail) {\n   cout << head;\n   if (sizeof...(tail) != 0) cout << ' ';\n   print(forward<Tail>(tail)...);\n }\n template <class T>\n void print(vector<T> &vec) {\n   for (auto &a : vec) {\n     cout << a;\n     if (&a != &vec.back()) cout << ' ';\n   }\n   cout << '\n';\n }\n template <class T>\n void print(set<T> &set) {\n   for (auto &a : set) {\n     cout << a << ' ';\n   }\n   cout << '\n';\n }\n template <class T>\n void print(vector<vector<T>> &df) {\n   for (auto &vec : df) {\n     print(vec);\n   }\n }\n long long power(long long a, long long n) {\n   long long res = 1;\n   while (n > 0) {\n     if (n & 1) res = res * a;\n     a *= a;\n     n >>= 1;\n   }\n   return res;\n }\n long long comb(long long n, long long k) {\n   vector<vector<long long>> v(n + 1, vector<long long>(n + 1, 0));\n   for (long long i = 0; i < (long long)((v).size()); i++) {\n     v[i][0] = 1;\n     v[i][i] = 1;\n   }\n   for (long long k = 1; k < (long long)((v).size()); k++) {\n     for (long long j = 1; j < k; j++) {\n       v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);\n     }\n   }\n   return v[n][k];\n }\n void add(long long &a, long long b) {\n   a += b;\n   if (a >= MOD) a -= MOD;\n }\n template <class T>\n inline bool chmin(T &a, T b) {\n   if (a > b) {\n     a = b;\n     return true;\n   }\n   return false;\n }\n template <class T>\n inline bool chmax(T &a, T b) {\n   if (a < b) {\n     a = b;\n     return true;\n   }\n   return false;\n }\n __attribute__((constructor)) void faster_io() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr);\n }\n long long n, k;\n map<long long, long long> got;\n pair<bool, multiset<long long>> isOK(long long idx) {\n   multiset<long long> ans;\n   multiset<long long> trueans;\n   long long cnt = 0;\n   for (const auto &[key, value] : got) {\n     long long types = value / idx;\n     cnt += types;\n     for (long long ti = 0; ti < (long long)(types); ti++) {\n       ans.insert(key);\n     }\n   }\n   if (cnt >= k) {\n     long long now = 0;\n     for (auto i : ans) {\n       trueans.insert(i);\n       now++;\n       if (now == k) {\n         break;\n       }\n     }\n     return make_pair(true, trueans);\n   } else {\n     return make_pair(false, trueans);\n   }\n }\n multiset<long long> bin_search() {\n   multiset<long long> finalans;\n   long long ng = n + 1;\n   long long ok = 0;\n   while (abs(ok - ng) > 1) {\n     long long mid = (ok + ng) / 2;\n     long long bl = isOK(mid).first;\n     auto nums = isOK(mid).second;\n     if (bl) {\n       ok = mid;\n       finalans = nums;\n     } else\n       ng = mid;\n   }\n   return finalans;\n }\n signed main() {\n   cin >> n >> k;\n   vector<long long> A(n);\n   for (long long ni = 0; ni < (long long)(n); ni++) {\n     long long v;\n     cin >> v;\n     A[ni] = v;\n     got[v]++;\n   }\n   auto ret = bin_search();\n   for (auto i : ret) {\n     cout << i << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX = 1e6 + 5;\n int main() {\n   ios_base::sync_with_stdio(0);\n   long long q;\n   cin >> q;\n   while (q--) {\n     long long n;\n     cin >> n;\n     long long cnt = 0;\n     long long flag = 1;\n     while (n != 1) {\n       if (n % 2 == 0) {\n         n = n / 2;\n         cnt++;\n       } else if (n % 3 == 0) {\n         n = (2 * n) / 3;\n         cnt++;\n       } else if (n % 5 == 0) {\n         n = (4 * n) / 5;\n         cnt++;\n       } else {\n         cout << '-1' << endl;\n         flag = 0;\n         break;\n       }\n     }\n     if (flag) cout << cnt << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int x;\n   while (cin >> x) {\n     map<char, int> p1;\n     string str, strr;\n     ;\n     bool l = 0;\n     int sum;\n     cin >> str;\n     for (int i = 0; i < str.size(); i++) {\n       p1[str[i]]++;\n     }\n     for (int i = 0; i < str.size(); i++) {\n       if (p1[str[i]] % x != 0) {\n         l = 1;\n         break;\n       }\n     }\n     if (l == 0) {\n       for (char i = 'a'; i <= 'z'; i++) {\n         sum = 0;\n         if (p1[i] > 0) {\n           sum = p1[i] / x;\n         }\n         while (sum--) {\n           strr += i;\n         }\n       }\n       while (x--) {\n         cout << strr;\n       }\n     } else\n       cout << -1;\n     cout << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 200200;\n const int mod = 1e9 + 7;\n int n, a, b;\n vector<int> q;\n int main() {\n   cin >> n >> a >> b;\n   q.push_back(a);\n   q.push_back(a);\n   q.push_back(a);\n   q.push_back(a);\n   q.push_back(b);\n   q.push_back(b);\n   sort(q.begin(), q.end());\n   int res = 1e9;\n   do {\n     int ans = 1, cur = n;\n     for (int i = 0; i < q.size(); ++i)\n       if (cur - q[i] >= 0)\n         cur -= q[i];\n       else\n         ans++, cur = n - q[i];\n     res = min(res, ans);\n   } while (next_permutation(q.begin(), q.end()));\n   cout << res;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using lli = long long int;\n lli mod = 1000000007.0;\n int main(void) {\n   long long t;\n   cin >> t;\n   lli x;\n   lli n;\n   while (t--) {\n     cin >> n;\n     x = 1;\n     for (lli i = 2 * n; i >= 3; i--) {\n       x *= i;\n       x = x % mod;\n     }\n     cout << x << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, x[210], y[210], ans, dp[210][210];\n long long S[210][210];\n bool in[210][210][210];\n int gogo(int x) {\n   if (x % n == 0) return n;\n   return x % n;\n }\n long long cp(int a, int b, int c) {\n   return 1LL * (x[a] - x[c]) * (y[b] - y[c]) -\n          1LL * (y[a] - y[c]) * (x[b] - x[c]);\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) scanf('%d%d', &x[i], &y[i]);\n   for (int i = 1; i <= n; i++)\n     for (int j = i; j <= n; j++) {\n       for (int p = i + 1; p < j; p++) S[i][j] += cp(p, p + 1, i);\n     }\n   for (int i = 1; i <= n; i++)\n     for (int j = 1; j < i; j++) {\n       for (int p = gogo(i + 1); p != j; p = gogo(p + 1))\n         S[i][j] += cp(gogo(p), gogo(p + 1), i);\n     }\n   for (int i = 1; i <= n; i++)\n     for (int j = i + 1; j <= n; j++)\n       for (int p = j + 1; p <= n; p++)\n         if (abs(cp(j, p, i)) + abs(S[i][j]) + abs(S[j][p]) + abs(S[p][i]) ==\n                 abs(S[1][n]) &&\n             cp(j, p, i)) {\n           in[i][j][p] = true;\n         }\n   for (int i = 1; i <= n; i++) dp[i][i + 1] = 1;\n   for (int i = n; i; i--)\n     for (int j = i + 1; j <= n; j++)\n       for (int p = i + 1; p < j; p++)\n         if (in[i][p][j])\n           dp[i][j] = (dp[i][j] + 1LL * dp[i][p] * dp[p][j]) % 1000000007;\n   ans = dp[1][n];\n   printf('%d\n', ans);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int round_up(int i) {\n   while (i & (i - 1)) {\n     i = ((i - 1) | i) + 1;\n   }\n   return i;\n }\n class seg_t {\n  public:\n   vector<int> seg, ar;\n   int n;\n   seg_t(vector<int>& a) {\n     n = a.size();\n     ar = a;\n     int si = round_up(n);\n     seg.resize(si * 2);\n     build(0, 0, n - 1);\n   }\n   void build(int i, int l, int r) {\n     if (l == r) {\n       seg[i] = ar[l];\n       return;\n     }\n     int mid = (l + r) / 2;\n     build(i * 2 + 1, l, mid);\n     build(i * 2 + 2, mid + 1, r);\n     seg[i] = min(seg[i * 2 + 1], seg[i * 2 + 2]);\n   }\n   int q(int i, int l, int r, int lind, int rind, int val) {\n     if (r < lind || r > rind) {\n       return -1;\n     }\n     if (l == r) {\n       if (seg[i] >= val) return -1;\n       return l;\n     }\n     if (lind <= l && r <= rind) {\n       if (seg[i] >= val) return -1;\n     }\n     int mid = (l + r) / 2;\n     int t = q(i * 2 + 1, l, mid, lind, rind, val);\n     if (t >= 0) return t;\n     return q(i * 2 + 2, mid + 1, r, lind, rind, val);\n   }\n   int qq(int i, int l, int r, int lind, int rind) {\n     if (r < lind || r > rind) {\n       return 1000000000;\n     }\n     if (lind <= l && r <= rind) {\n       return seg[i];\n     }\n     int mid = (l + r) / 2;\n     return min(qq(i * 2 + 1, l, mid, lind, rind),\n                qq(i * 2 + 2, mid + 1, r, lind, rind));\n   }\n };\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   vector<int> a(2 * n);\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n     a[i + n] = a[i];\n   }\n   seg_t t(a);\n   vector<int> b(2 * n);\n   for (int i = 0; i < n; i++) {\n     int tmp = t.q(0, 0, 2 * n - 1, i, n * 2 - 1, (a[i] + 1) / 2);\n     if (tmp == -1)\n       b[i] = 1000000000;\n     else\n       b[i] = tmp;\n     b[i + n] = b[i] + n;\n   }\n   seg_t tt(b);\n   for (int i = 0; i < n; i++) {\n     int tmp = tt.qq(0, 0, 2 * n - 1, i, n * 2 - 1);\n     if (tmp >= 1000000000)\n       cout << -1 << ' ';\n     else\n       cout << tmp - i << ' ';\n   }\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n using ld = long double;\n using pii = pair<int, int>;\n int const N = 1e5 + 20, MAX = 7000 + 20;\n int n, q;\n bitset<MAX> bt[N];\n int a[MAX];\n vector<int> dv[MAX];\n bitset<MAX> save[MAX];\n void pre() {\n   a[1] = 1;\n   for (int i = 1; i < MAX; i++) {\n     for (int j = 2 * i; j < MAX; j += i) a[j] ^= a[i], dv[j].push_back(i);\n     dv[i].push_back(i);\n   }\n   for (int i = 1; i < MAX; i++) {\n     for (int j = 1; i * j < MAX; j++) {\n       if (a[j]) save[i][i * j] = 1;\n     }\n   }\n }\n int main() {\n   pre();\n   scanf('%d %d ', &n, &q);\n   while (q--) {\n     int tp, x, y, z, v;\n     scanf('%d ', &tp);\n     if (tp == 1) {\n       scanf('%d %d ', &x, &v);\n       x--;\n       bt[x].reset();\n       for (int u : dv[v]) bt[x][u] = 1;\n     } else if (tp == 2) {\n       scanf('%d %d %d ', &x, &y, &z);\n       x--, y--, z--;\n       bt[x] = (bt[y] ^ bt[z]);\n     } else if (tp == 3) {\n       scanf('%d %d %d ', &x, &y, &z);\n       x--, y--, z--;\n       bt[x] = (bt[y] & bt[z]);\n     } else if (tp == 4) {\n       scanf('%d %d ', &x, &v);\n       x--;\n       bitset<MAX> tmp = (bt[x] & save[v]);\n       putchar('0' + (tmp.count() & 1));\n     }\n   }\n   putchar('\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int k;\n vector<pair<long double, long double> > vp;\n const long double PI = 2 * acos(0.0);\n bool check(long double r) {\n   vector<pair<long double, int> > events;\n   for (int i = 0; i < n; ++i) {\n     long double ang = atan2(vp[i].second, vp[i].first);\n     long double d =\n         sqrt(vp[i].first * vp[i].first + vp[i].second * vp[i].second);\n     if (d > 2 * r) continue;\n     long double alph = (PI - acos(1 - (d * d) / (2 * (r * r)))) / 2;\n     long double ang_in = ang - alph;\n     long double ang_out = ang + alph;\n     if (ang_in < 0) {\n       ang_in += 2 * PI;\n       ang_out += 2 * PI;\n     }\n     events.emplace_back(ang_in, 1);\n     events.emplace_back(ang_out, -1);\n     events.emplace_back(ang_in + 2 * PI, 1);\n     events.emplace_back(ang_out + 2 * PI, -1);\n   }\n   sort(events.begin(), events.end());\n   int ck = 0;\n   for (int i = 0; i < (int)events.size(); ++i) {\n     ck += events[i].second;\n     if (ck >= k) return true;\n   }\n   return false;\n }\n int main() {\n   cout.setf(ios::fixed);\n   cout << setprecision(10);\n   cin >> n;\n   cin >> k;\n   for (int i = 0; i < n; ++i) {\n     int first, second;\n     cin >> first >> second;\n     vp.emplace_back(first, second);\n   }\n   long double l = 0;\n   long double r = 2e5;\n   while (r - l > 1e-6) {\n     long double mid = (l + r) / 2;\n     if (check(mid)) {\n       r = mid;\n     } else {\n       l = mid;\n     }\n   }\n   cout << l << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};\n const int Q = 1e9 + 7;\n int main() {\n   string s, t;\n   cin >> s >> t;\n   vector<int> p(t.length());\n   for (int i = 1; i < t.length(); ++i) {\n     int k = p[i - 1];\n     while (k > 0) {\n       if (t[k] == t[i]) {\n         p[i] = k + 1;\n         break;\n       }\n       k = p[k - 1];\n     }\n     if (!p[i] && t[i] == t[0]) p[i] = 1;\n   }\n   vector<int> x(s.length());\n   if (s[0] == t[0]) x[0] = 1;\n   for (int i = 1; i < s.length(); ++i) {\n     int k = x[i - 1];\n     if (k == t.length()) k = p[k - 1];\n     while (k > 0) {\n       if (s[i] == t[k]) {\n         x[i] = k + 1;\n         break;\n       }\n       k = p[k - 1];\n     }\n     if (!x[i] && s[i] == t[0]) x[i] = 1;\n   }\n   vector<int> sum(s.length() + 1), r(s.length() + 1), h(s.length() + 1);\n   sum[0] = 0;\n   h[0] = 0;\n   for (int i = 0; i < s.length(); ++i) {\n     if (x[i] == t.length()) {\n       r[i + 1] = (h[i - t.length() + 1] + i - t.length() + 2) % Q;\n     } else {\n       r[i + 1] = r[i];\n     }\n     sum[i + 1] = (sum[i] + r[i + 1]) % Q;\n     h[i + 1] = (h[i] + sum[i + 1]) % Q;\n   }\n   cout << sum[s.length()];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long check(long long x) {\n   long long i = 0, ans = 0;\n   while (x > 0) {\n     if ((x & (1)) == 1) {\n       ans = max(ans, i);\n     }\n     x = x >> 1;\n     i++;\n   }\n   return ans;\n }\n void solve() {\n   long long n;\n   cin >> n;\n   long long a[n + 1];\n   map<long long, long long> mp;\n   for (long long i = 0; i < n; i++) {\n     cin >> a[i];\n     mp[check(a[i])]++;\n   }\n   long long ans = 0;\n   for (auto x : mp) {\n     if (x.second > 1) ans += ((x.second) * (x.second - 1)) / 2;\n   }\n   cout << ans << endl;\n   return;\n }\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int cnt = 0;\n vector<int> ans;\n vector<vector<int> > adj;\n void dfs(int u, int col) {\n   if (ans[u] != -1) return;\n   ans[u] = col;\n   for (int i = 0; i < adj[u].size(); ++i) dfs(adj[u][i], col);\n }\n char conv(int first) {\n   if (first == 0) return 'b';\n   if (first == 1) return 'a';\n   if (first == 2) return 'c';\n }\n int main() {\n   cout.setf(ios::fixed);\n   cout.precision(7);\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int n, m;\n   cin >> n >> m;\n   adj = vector<vector<int> >(n);\n   vector<int> deg(n, 0);\n   for (int asdf = 0; asdf < m; ++asdf) {\n     int first, second;\n     cin >> first >> second;\n     --first;\n     --second;\n     adj[first].push_back(second);\n     adj[second].push_back(first);\n     ++deg[first];\n     ++deg[second];\n   }\n   ans = vector<int>(n, -1);\n   int qt = 0;\n   for (int i = 0; i < n; ++i)\n     if (deg[i] == n - 1) {\n       ans[i] = 0;\n       ++qt;\n     }\n   for (int i = 0; i < n; ++i)\n     if (ans[i] == -1) {\n       ++cnt;\n       dfs(i, cnt);\n     }\n   bool ok = true;\n   if (cnt >= 3) ok = false;\n   int n1 = 0, m1 = 0, n2 = 0, m2 = 0;\n   for (int i = 0; i < n; ++i) {\n     if (ans[i] == 1) {\n       ++n1;\n       m1 += deg[i] - qt;\n     } else if (ans[i] == 2) {\n       ++n2;\n       m2 += deg[i] - qt;\n     }\n   }\n   if (n1 * (n1 - 1) != m1) ok = false;\n   if (n2 * (n2 - 1) != m2) ok = false;\n   if (not ok)\n     cout << 'No\n';\n   else {\n     cout << 'Yes\n';\n     for (int i = 0; i < n; ++i) cout << conv(ans[i]);\n     cout << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n typedef std::function<long long(long long)> fun;\n class Map {\n   int n, w, r;\n   std::vector<int> A, B;\n   std::function<int(long long)> lower, upper;\n   std::vector<long long> who;\n   std::vector<int> val;\n   void find_array(std::vector<int> &a, const std::vector<long long> &S, fun f,\n                   fun g) {\n     a.resize(1 << r);\n     std::vector<std::list<long long> > set(1 << r);\n     std::vector<int> m(1 << (r + 1));\n     std::vector<int> ind;\n     for (long long x : S) {\n       if (set[f(x)].empty()) ind.push_back(f(x));\n       set[f(x)].push_back(x);\n     }\n     std::sort(ind.begin(), ind.end(),\n               [&](int x, int y) { return set[x].size() > set[y].size(); });\n     for (int i : ind) {\n       a[i] = 0;\n       for (int j = 0; j < r; ++j) {\n         int ex0 = 0, ex1 = 0;\n         for (long long y : set[i])\n           ex0 += m[(1 << (j + 1)) + ((y & ((1 << (j + 1)) - 1)) ^ a[i])],\n               ex1 += m[(1 << (j + 1)) +\n                        ((y & ((1 << (j + 1)) - 1)) ^ (a[i] | (1 << j)))];\n         if (ex1 < ex0) a[i] |= (1 << j);\n       }\n       for (long long y : set[i]) {\n         int v = (g(y) ^ a[i]);\n         for (int j = 0; j < r; ++j)\n           m[(1 << (r - j)) + v]++, v = v & ((1 << (r - 1 - j)) - 1);\n       }\n     }\n   }\n \n  public:\n   Map() {}\n   Map(const std::vector<long long> &S, int word) { init(S, word); }\n   int operator()(long long x) { return lower(x) ^ B[upper(x) ^ A[lower(x)]]; }\n   int size() { return (1 << r); }\n   bool have(long long x) { return who[(*this)(x)] == x; }\n   int &operator[](long long i) { return val[(*this)(i)]; }\n   void init(const std::vector<long long> &S, int word) {\n     n = (int)S.size();\n     w = word;\n     r = std::max(w / 2, (int)std::log2(n) + 3) + 1;\n     assert(*std::min_element(S.begin(), S.end()) >= 0);\n     assert(*std::max_element(S.begin(), S.end()) < (1ll << word));\n     lower = [&](long long x) { return x & ((1 << r) - 1); };\n     upper = [&](long long x) { return x >> (w - r); };\n     find_array(A, S, lower, upper);\n     auto f2 = [&](long long x) { return upper(x) ^ A[lower(x)]; };\n     auto &g2 = lower;\n     find_array(B, S, f2, g2);\n     who.resize(1 << r, -1);\n     for (long long x : S) who[(*this)(x)] = x;\n     val.resize(1 << r);\n   }\n };\n void make_unique(std::vector<long long> &A) {\n   std::sort(A.begin(), A.end());\n   A.resize(std::unique(A.begin(), A.end()) - A.begin());\n }\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   std::cin.tie(0);\n   int n, k;\n   std::cin >> n >> k;\n   std::vector<int> A(n);\n   long long pref = 0;\n   std::vector<long long> values;\n   values.push_back(pref);\n   for (int i = 0; i < n; ++i) {\n     std::cin >> A[i];\n     pref += A[i];\n     values.push_back(pref);\n   }\n   make_unique(values);\n   long long min = *std::min_element(values.begin(), values.end());\n   std::vector<long long> lower, upper;\n   for (long long x : values)\n     lower.push_back((x - min) & ((1 << 24) - 1)),\n         upper.push_back((x - min) >> 24);\n   make_unique(lower);\n   make_unique(upper);\n   Map ml(lower, 24);\n   Map mu(upper, 24);\n   std::vector<long long> vals;\n   auto kto = [&](long long x) {\n     if (!ml.have((x - min) & ((1 << 24) - 1)) || !mu.have((x - min) >> 24))\n       return -1ll;\n     return ml((x - min) & ((1 << 24) - 1)) +\n            1ll * ml.size() * mu((x - min) >> 24);\n   };\n   for (long long x : values) vals.push_back(kto(x));\n   make_unique(vals);\n   Map map(vals, 40);\n   long long ans = 0;\n   pref = 0;\n   map[kto(pref)]++;\n   for (int i = 0; i < n; ++i) {\n     pref += A[i];\n     long long pow = 1;\n     while (std::abs(pow) < 1000000000ll * 100000ll + 5ll) {\n       long long want = (pref - pow);\n       if (want >= min && want <= min + (1ll << 48)) {\n         if (kto(want) != -1 && map.have(kto(want))) {\n           ans += map[kto(want)];\n         }\n       }\n       pow *= k;\n       if (pow == 1) break;\n     }\n     map[kto(pref)]++;\n   }\n   std::cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, q, num, tot, tp, cnt, ans, w[200100], head[200100], dfn[200100],\n     c[200100], low[200100], sta[200100];\n int dfc, sz[200100], d[200100], f[200100], son[200100], top[200100],\n     tree[200100], mn[200100 * 4];\n vector<int> v[200100];\n multiset<int> s[200100];\n struct point {\n   int fr, to, nxt;\n } a[200100 * 2];\n void add(int x, int y) {\n   a[++tot].fr = x;\n   a[tot].to = y;\n   a[tot].nxt = head[x];\n   head[x] = tot;\n }\n void tarjan(int x) {\n   dfn[x] = low[x] = ++num;\n   sta[++tp] = x;\n   for (int i = 0; i < v[x].size(); i++) {\n     int y = v[x][i];\n     if (!dfn[y]) {\n       tarjan(y);\n       low[x] = min(low[x], low[y]);\n       if (low[y] == dfn[x]) {\n         ++cnt;\n         int now;\n         do {\n           now = sta[tp--];\n           add(cnt, now);\n           add(now, cnt);\n         } while (now != y);\n         add(cnt, x);\n         add(x, cnt);\n       }\n     } else\n       low[x] = min(low[x], dfn[y]);\n   }\n }\n void dfs1(int x, int fa) {\n   f[x] = fa;\n   d[x] = d[fa] + 1;\n   sz[x] = 1;\n   for (int i = head[x]; i; i = a[i].nxt) {\n     int y = a[i].to;\n     if (y == fa) continue;\n     dfs1(y, x);\n     sz[x] += sz[y];\n     if (sz[y] > sz[son[x]]) son[x] = y;\n   }\n }\n void dfs2(int x, int lst) {\n   top[x] = lst;\n   dfn[x] = ++dfc;\n   tree[dfc] = x;\n   if (son[x]) dfs2(son[x], lst);\n   for (int i = head[x]; i; i = a[i].nxt)\n     if (!top[a[i].to]) dfs2(a[i].to, a[i].to);\n }\n void build(int x, int l, int r) {\n   if (l == r) return mn[x] = w[tree[l]], void();\n   int mid = (l + r) >> 1;\n   build(x << 1, l, mid);\n   build(x << 1 | 1, mid + 1, r);\n   mn[x] = min(mn[x << 1], mn[x << 1 | 1]);\n }\n void modify(int x, int l, int r, int p, int y) {\n   if (l == r) return mn[x] = y, void();\n   int mid = (l + r) >> 1;\n   if (p <= mid)\n     modify(x << 1, l, mid, p, y);\n   else\n     modify(x << 1 | 1, mid + 1, r, p, y);\n   mn[x] = min(mn[x << 1], mn[x << 1 | 1]);\n }\n int query(int x, int l, int r, int L, int R) {\n   if (l >= L && r <= R) return mn[x];\n   int mid = (l + r) >> 1, ret = 1e9;\n   if (L <= mid) ret = min(ret, query(x << 1, l, mid, L, R));\n   if (R > mid) ret = min(ret, query(x << 1 | 1, mid + 1, r, L, R));\n   return ret;\n }\n int query(int x, int y, int ret = 1e9) {\n   while (top[x] != top[y]) {\n     if (d[top[x]] < d[top[y]]) swap(x, y);\n     ret = min(ret, query(1, 1, cnt, dfn[top[x]], dfn[x]));\n     x = f[top[x]];\n   }\n   if (d[x] < d[y]) swap(x, y);\n   ret = min(ret, query(1, 1, cnt, dfn[y], dfn[x]));\n   if (y > n) ret = min(ret, w[f[y]]);\n   return ret;\n }\n int main() {\n   scanf('%d%d%d', &n, &m, &q);\n   cnt = n;\n   for (int i = 1; i <= n; i++) scanf('%d', &w[i]);\n   for (int i = 1, x, y; i <= m; i++)\n     scanf('%d%d', &x, &y), v[x].push_back(y), v[y].push_back(x);\n   tarjan(1);\n   dfs1(1, 0);\n   dfs2(1, 1);\n   memset(mn, 0x3f, sizeof(mn));\n   for (int i = 1; i <= n; i++) s[f[i]].insert(w[i]);\n   for (int i = n + 1; i <= cnt; i++) w[i] = (*s[i].begin());\n   build(1, 1, cnt);\n   for (int i = 1; i <= q; i++) {\n     char ch[4];\n     int a, b;\n     scanf('%s%d%d', ch + 1, &a, &b);\n     if (ch[1] == 'C') {\n       if (f[a]) {\n         multiset<int>::iterator pos = s[f[a]].find(w[a]);\n         s[f[a]].erase(pos);\n         s[f[a]].insert(b);\n         w[f[a]] = (*s[f[a]].begin());\n         modify(1, 1, cnt, dfn[f[a]], (*s[f[a]].begin()));\n       }\n       w[a] = b;\n       modify(1, 1, cnt, dfn[a], w[a]);\n     } else\n       printf('%d\n', query(a, b));\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int a[111][111];\n char c[111];\n int main() {\n   int i, j, k;\n   int p, q, r;\n   int t, tt, ttt;\n   scanf('%d', &n);\n   for (i = 1; i <= n; i++) {\n     scanf('%s', c);\n     for (j = 1; j <= n; j++) {\n       if (c[j - 1] == 'E')\n         a[i][j] = 1;\n       else\n         a[i][j] = 0;\n     }\n   }\n   for (i = 1; i <= n; i++) {\n     for (j = 1; j <= n; j++) {\n       if (a[i][j] == 0) break;\n     }\n     if (j == n + 1) break;\n   }\n   if (i != n + 1) {\n     for (j = 1; j <= n; j++) {\n       for (i = 1; i <= n; i++) {\n         if (a[i][j] == 0) break;\n       }\n       if (i == n + 1) break;\n     }\n     if (j != n + 1) {\n       printf('-1');\n     } else {\n       for (j = 1; j <= n; j++) {\n         for (i = 1; i <= n; i++) {\n           if (a[i][j] == 0) {\n             printf('%d %d\n', i, j);\n             break;\n           }\n         }\n       }\n     }\n   } else {\n     for (i = 1; i <= n; i++) {\n       for (j = 1; j <= n; j++) {\n         if (a[i][j] == 0) {\n           printf('%d %d\n', i, j);\n           break;\n         }\n       }\n     }\n   }\n   scanf(' ');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 100001;\n vector<int> v, w;\n char s[1000001];\n int main() {\n   scanf('%s', &s);\n   int len = strlen(s);\n   for (int i = (0); i < (len); i++) {\n     if (s[i] == '@') v.push_back(i);\n     if (s[i] == '.') w.push_back(i);\n   }\n   int t = 0, tmp = 0;\n   long long ans = 0;\n   while (t < v.size() && tmp < w.size()) {\n     long long first = 0, mid = 1, last = 0;\n     if (t == v.size()) break;\n     while (v[t] > w[tmp] && tmp < w.size()) tmp++;\n     if (tmp == w.size()) break;\n     if (v[t] + 1 == w[tmp]) mid = 0;\n     for (int i = v[t] + 1; i < w[tmp]; i++) {\n       if ((s[i] > '9' || s[i] < '0') && (s[i] > 'z' || s[i] < 'a')) {\n         mid = 0;\n         break;\n       }\n     }\n     if (!mid) {\n       t++;\n       continue;\n     }\n     if (v[t] > 0)\n       for (int i = v[t] - 1; i >= 0; i--) {\n         if ((s[i] >= 'a' && s[i] <= 'z') || (s[i] >= '0' && s[i] <= '9') ||\n             s[i] == '_') {\n           if (s[i] >= 'a' && s[i] <= 'z') first++;\n         } else\n           break;\n       }\n     if (w[tmp] + 1 < len)\n       for (int i = w[tmp] + 1; i < len; i++) {\n         if (s[i] >= 'a' && s[i] <= 'z')\n           last++;\n         else\n           break;\n       }\n     ans += first * last;\n     t++;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, c;\n int ans[1001];\n int zero;\n inline void send(int x, int p) {\n   if (ans[x] == 0) --zero;\n   ans[x] = p;\n   printf('%d\n', x);\n   fflush(stdout);\n }\n int main() {\n   scanf('%d %d %d', &n, &m, &c);\n   int mid = (c + 1) / 2;\n   zero = n;\n   for (int round = 1; zero && round <= m; ++round) {\n     int p;\n     scanf('%d', &p);\n     if (p <= mid) {\n       int i;\n       for (i = 1; i < n; ++i)\n         if (ans[i] == 0 || ans[i] > p) {\n           break;\n         }\n       send(i, p);\n     } else {\n       int i;\n       for (i = n; i > 1; --i)\n         if (ans[i] == 0 || ans[i] < p) {\n           break;\n         }\n       send(i, p);\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double PI = acos(-1.0);\n const int INF = 1000000000;\n const int MOD = 1073741824;\n const int M = INF;\n const double RRR = 180.0 / PI;\n vector<vector<int> > g;\n vector<bool> used;\n void dfs(int v) {\n   used[v] = 1;\n   for (vector<int>::iterator it = g[v].begin(); it != g[v].end(); ++it) {\n     if (!used[*it]) {\n       dfs(*it);\n     }\n   }\n }\n int main() {\n   int x, y;\n   cin >> x >> y;\n   int d1 = 1, d2 = 0;\n   int e = 1;\n   int f = 0;\n   int a = 0, b = 0;\n   int r = 0;\n   int ans = 0;\n   if (a == x && b == y) {\n     cout << 0;\n     return 0;\n   }\n   while (1) {\n     a += d1;\n     b += d2;\n     r++;\n     if (a == x && b == y) {\n       cout << ans;\n       return 0;\n     }\n     if (r == e) {\n       ans++;\n       if (f == 0) {\n         f = 1;\n         d1 = 0;\n         d2 = 1;\n         r = 0;\n       } else {\n         if (f == 1) {\n           f = 2;\n           e++;\n           r = 0;\n           d1 = -1;\n           d2 = 0;\n         } else {\n           if (f == 2) {\n             f = 3;\n             r = 0;\n             d1 = 0;\n             d2 = -1;\n           } else {\n             f = 0;\n             e++;\n             r = 0;\n             d1 = 1;\n             d2 = 0;\n           }\n         }\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mcd(long long a, long long b) {\n   if (b > a) swap(a, b);\n   if (b == 0)\n     return a;\n   else\n     return mcd(b, a % b);\n }\n long long i, j, n, m, q, a, l, r, b;\n int main() {\n   cin.tie(0);\n   cout.tie(0);\n   ios_base::sync_with_stdio(0);\n   cin >> q;\n   while (q--) {\n     cin >> n;\n     if (n == 1)\n       cout << 3;\n     else if (n == 2)\n       cout << 2;\n     else if (n & 1)\n       cout << 1;\n     else\n       cout << 0;\n     cout << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long modulo = 998244353;\n const long long p = modulo;\n vector<int> edges[300005];\n int father[300005];\n long long rCount[300005];\n long long oCount[300005];\n long long eCount[300005];\n pair<int, int> gcd(long long a, long long b) {\n   if (b == 0ll) return {1ll, 0ll};\n   pair<int, int> q = gcd(b, a % b);\n   return {q.second, q.first - q.second * (a / b)};\n }\n long long inv(long long a) {\n   long long aa = gcd(a, p).first;\n   aa %= p;\n   if (aa < 0) aa += p;\n   return aa;\n }\n void trace(int index) {\n   for (int j = 0; j < edges[index].size(); ++j) {\n     int v = edges[index][j];\n     if (v == father[index]) {\n       edges[index].erase(edges[index].begin() + j);\n       --j;\n       continue;\n     }\n     father[v] = index;\n     trace(v);\n   }\n }\n void dfs(int index) {\n   if (edges[index].empty()) {\n     rCount[index] = 1;\n     oCount[index] = 1;\n     eCount[index] = 0;\n     return;\n   }\n   long long totalR = 1;\n   long long total = 1;\n   for (int j = 0; j < edges[index].size(); ++j) {\n     int v = edges[index][j];\n     dfs(v);\n     totalR *= rCount[v];\n     totalR %= modulo;\n     total *= rCount[v] + eCount[v];\n     total %= modulo;\n   }\n   rCount[index] = totalR;\n   oCount[index] = 1;\n   eCount[index] = 0;\n   for (int j = 0; j < edges[index].size(); ++j) {\n     int v = edges[index][j];\n     long long temp = oCount[v] * total;\n     temp %= modulo;\n     temp *= inv(rCount[v] + eCount[v]);\n     temp %= modulo;\n     rCount[index] += temp;\n     rCount[index] %= modulo;\n     oCount[index] *= (rCount[v] + eCount[v]);\n     oCount[index] %= modulo;\n     eCount[index] += temp;\n     eCount[index] %= modulo;\n   }\n }\n int main() {\n   int n;\n   cin >> n;\n   if (n == 1) {\n     cout << 1 << endl;\n     return 0;\n   }\n   int u, v;\n   for (int i = 0; i < n - 1; ++i) {\n     scanf('%i%i', &u, &v);\n     --u;\n     --v;\n     edges[u].push_back(v);\n     edges[v].push_back(u);\n   }\n   for (int i = 0; i < n; ++i) {\n     father[i] = -1;\n     rCount[i] = 0;\n     oCount[i] = 0;\n     eCount[i] = 0;\n   }\n   father[0] = -1;\n   trace(0);\n   dfs(0);\n   long long result = rCount[0];\n   while (result < 0) {\n     result += modulo;\n   }\n   result %= modulo;\n   cout << result << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxN = (int)1e2, maxM = (int)1e2, intMax = INT_MAX, maxValue = 44721;\n const long long llmax = LLONG_MAX, INF = (long long)1e9 + 1, mod = 998244353;\n long long nod(long long a, long long b) {\n   while (a != 0 && b != 0) {\n     if (a < b)\n       b %= a;\n     else\n       a %= b;\n   }\n   return a + b;\n }\n int nod(int a, int b) {\n   while (a != 0 && b != 0) {\n     if (a < b)\n       b %= a;\n     else\n       a %= b;\n   }\n   return a + b;\n }\n long long nok(long long a, long long b) { return a * b / nod(a, b); }\n int nok(int a, int b) { return a * b / nod(a, b); }\n long long modPlus(long long a, long long b) {\n   a %= mod;\n   b %= mod;\n   return a + b;\n }\n long long modPlus(int a, int b) {\n   a %= mod;\n   b %= mod;\n   return (a + b) % mod;\n }\n long long binPow(long long a, long long b) {\n   long long res = 1;\n   while (b) {\n     if (b % 2 == 1) {\n       res *= a;\n       res %= mod;\n     }\n     a = a * a;\n     a %= mod;\n     b >>= 1;\n   }\n   return res;\n }\n int n, s, a, b, emaxx = -1;\n int main() {\n   scanf('%d%d', &n, &s);\n   s *= 100;\n   for (int i = 0; i < n; i++) {\n     scanf('%d%d', &a, &b);\n     b += a * 100;\n     if (s >= b) emaxx = max((100 - (b % 100)) % 100, emaxx);\n   }\n   printf('%d\n', emaxx);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int a, b, c;\n     cin >> a >> b >> c;\n     int diff = INT_MAX;\n     int a1, b1, c1;\n     for (int i = 1; i <= 10000; i++) {\n       for (int j = i; j <= 20000; j += i) {\n         for (int k = j; k <= 50000; k += j) {\n           int dif = abs(a - i) + abs(b - j) + abs(c - k);\n           if (dif < diff) {\n             diff = dif;\n             a1 = i;\n             b1 = j;\n             c1 = k;\n           }\n         }\n       }\n     }\n     cout << diff << endl << a1 << ' ' << b1 << ' ' << c1 << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, q;\n int it[35][800005];\n struct point {\n   int a[10];\n   point(){};\n   int &operator[](int x) { return a[x]; }\n };\n point p[200005];\n int sign(point &p, int bit) {\n   int ans = 0;\n   for (int i = 0; i < k; i++) {\n     if (bit & 1 == 1) {\n       ans += p[i];\n     } else {\n       ans -= p[i];\n     }\n     bit >>= 1;\n   }\n   return ans;\n }\n void build(int id, int l, int r) {\n   if (l == r - 1) {\n     for (int i = 0; i < (1 << k); i++) {\n       it[i][id] = sign(p[l], i);\n     }\n     return;\n   }\n   int mid = (l + r) / 2;\n   build(id * 2, l, mid);\n   build(id * 2 + 1, mid, r);\n   for (int i = 0; i < (1 << k); i++) {\n     it[i][id] = min(it[i][id * 2], it[i][id * 2 + 1]);\n   }\n }\n void update(int id, int l, int r, int pos, point &val) {\n   if (l == r - 1) {\n     for (int i = 0; i < (1 << k); i++) {\n       it[i][id] = sign(val, i);\n     }\n     return;\n   }\n   int mid = (l + r) / 2;\n   if (pos < mid) {\n     update(id * 2, l, mid, pos, val);\n   } else {\n     update(id * 2 + 1, mid, r, pos, val);\n   }\n   for (int i = 0; i < (1 << k); i++) {\n     it[i][id] = min(it[i][id * 2], it[i][id * 2 + 1]);\n   }\n }\n int chosen[35];\n void get(int id, int l, int r, int a, int b) {\n   if (a >= b) return;\n   if (l == a && r == b) {\n     for (int i = 0; i < (1 << k); i++) {\n       chosen[i] = min(chosen[i], it[i][id]);\n     }\n     return;\n   }\n   int mid = (l + r) / 2;\n   get(id * 2, l, mid, a, min(mid, b));\n   get(id * 2 + 1, mid, r, max(mid, a), b);\n }\n int main() {\n   cin >> n >> k;\n   for (int i = 0; i < n; i++) {\n     for (int j = 0; j < k; j++) {\n       cin >> p[i][j];\n     }\n   }\n   build(1, 0, n);\n   cin >> q;\n   while (q--) {\n     int t;\n     cin >> t;\n     if (t == 1) {\n       int x;\n       cin >> x;\n       x--;\n       point cnt;\n       for (int i = 0; i < k; i++) {\n         cin >> cnt[i];\n       }\n       update(1, 0, n, x, cnt);\n     }\n     if (t == 2) {\n       int l, r;\n       cin >> l >> r;\n       l--;\n       for (int i = 0; i < (1 << k); i++) {\n         chosen[i] = 1e9;\n       }\n       get(1, 0, n, l, r);\n       int res = 0;\n       for (int i = 0; i < (1 << k); i++) {\n         res = max(res, abs(chosen[(1 << k) - i - 1] + chosen[i]));\n       }\n       cout << res << endl;\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MOD = 1000000007;\n int N;\n int X[206], Y[206];\n int D[202][202];\n long long area(int i1, int i2, int i3) {\n   return 1LL * X[i1] * Y[i2] + 1LL * X[i2] * Y[i3] + 1LL * X[i3] * Y[i1] -\n          1LL * Y[i1] * X[i2] - 1LL * Y[i2] * X[i3] - 1LL * Y[i3] * X[i1];\n }\n int sign(int i1, int i2, int i3) {\n   long long val = area(i1, i2, i3);\n   if (val < 0) return -1;\n   if (val > 0) return 1;\n   return 0;\n }\n bool inpoly(int x, int y) {\n   int pnx = 1e9 + 7, pny = 1e9 + 9;\n   X[N + 2] = x;\n   Y[N + 2] = y;\n   X[N + 3] = pnx;\n   Y[N + 3] = pny;\n   for (int i = 1; i <= N + 1; ++i) {\n     X[i] *= 2;\n     Y[i] *= 2;\n   }\n   int nn = 0;\n   for (int i = 1; i <= N; ++i)\n     if (sign(N + 2, N + 3, i) * sign(N + 2, N + 3, i + 1) == -1 &&\n         sign(i, i + 1, N + 2) * sign(i, i + 1, N + 3) == -1)\n       ++nn;\n   for (int i = 1; i <= N + 1; ++i) {\n     X[i] /= 2;\n     Y[i] /= 2;\n   }\n   return (nn % 2);\n }\n bool isok(int i1, int i2) {\n   if (i1 + 1 == i2 || (i2 == N && i1 == 1)) return true;\n   for (int i = 1; i <= N; ++i)\n     if (i != i1 && i != i2) {\n       if (X[i] < min(X[i1], X[i2]) || X[i] > max(X[i1], X[i2])) continue;\n       if (Y[i] < min(Y[i1], Y[i2]) || Y[i] > max(Y[i1], Y[i2])) continue;\n       if (1LL * (Y[i] - Y[i1]) * (X[i2] - X[i]) ==\n           1LL * (Y[i2] - Y[i]) * (X[i] - X[i1]))\n         return false;\n     }\n   for (int i = 1; i <= N; ++i)\n     if (i != i1 && i + 1 != i1 && (i + 1) % N != i1)\n       if (i != i2 && i + 1 != i2 && (i + 1) % N != i2) {\n         int p1 = i, p2 = i + 1;\n         if (sign(i1, i2, p1) * sign(i1, i2, p2) == -1 &&\n             sign(p1, p2, i1) * sign(p1, p2, i2) == -1)\n           return false;\n       }\n   int xn = X[i1] + X[i2];\n   int yn = Y[i1] + Y[i2];\n   if (!inpoly(xn, yn)) return false;\n   return true;\n }\n int ways(int i1, int i2) {\n   if (D[i1][i2] != -1) return D[i1][i2];\n   if (i1 + 1 == i2) return 1;\n   int& now = D[i1][i2];\n   now = 0;\n   if (!isok(i1, i2)) return now;\n   for (int k = i1 + 1; k <= i2 - 1; ++k)\n     now = (now + 1LL * ways(i1, k) * ways(k, i2)) % MOD;\n   return now;\n }\n int main() {\n   cin.sync_with_stdio(false);\n   cin >> N;\n   for (int i = 1; i <= N; ++i) cin >> X[i] >> Y[i];\n   X[N + 1] = X[1];\n   Y[N + 1] = Y[1];\n   memset(D, -1, sizeof(D));\n   cout << ways(1, N) << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 2e5 + 10;\n struct Node {\n   int a, b, d;\n } p[MAXN];\n int n, k;\n bool cmp(Node aa, Node bb) { return aa.d < bb.d; }\n bool cmp2(Node aa, Node bb) { return aa.d > bb.d; }\n int main() {\n   scanf('%d%d', &n, &k);\n   for (int i = 1; i <= n; i++) scanf('%d', &p[i].a);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &p[i].b);\n     p[i].d = p[i].a - p[i].b;\n   }\n   long long ans = 0;\n   sort(p + 1, p + 1 + n, cmp);\n   if (p[1].d >= 0) {\n     for (int i = 1; i <= k; i++) ans += (long long)p[i].a;\n     for (int i = k + 1; i <= n; i++) ans += (long long)p[i].b;\n   } else if (p[n].d <= 0) {\n     sort(p + 1, p + 1 + n, cmp2);\n     for (int i = 1; i <= n; i++) {\n       ans += (long long)p[i].a;\n     }\n   } else {\n     if (p[k].d <= 0) {\n       for (int i = 1; i <= n; i++) {\n         if (p[i].d <= 0)\n           ans += (long long)p[i].a;\n         else\n           ans += (long long)p[i].b;\n       }\n     } else {\n       int tmp = 0;\n       for (int i = 1; i <= n; i++) {\n         if (p[i].d <= 0) {\n           ans += (long long)p[i].a;\n         } else {\n           tmp = i;\n           break;\n         }\n       }\n       sort(p + tmp, p + 1 + k, cmp2);\n       for (int i = tmp; i <= k; i++) {\n         ans += (long long)p[i].a;\n       }\n       for (int i = k + 1; i <= n; i++) {\n         ans += (long long)p[i].b;\n       }\n     }\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n;\n   cin >> n;\n   vector<long long> dp;\n   dp.push_back(0);\n   dp.push_back(1);\n   while (dp.back() <= n - 1) {\n     dp.push_back(dp[dp.size() - 1] + dp[dp.size() - 2] + 1);\n   }\n   cout << dp.size() - 2 << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast', 'unroll-loops')\n using namespace std;\n const int inf = numeric_limits<int>::max() / 2;\n const long double eps = 1e-9;\n const long double pi = acos(-1);\n inline void solve(), read();\n int main() {\n   ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n   read();\n   solve();\n   return 0;\n }\n pair<int, int> operator+(pair<int, int> p1, pair<int, int> p2) {\n   return {p1.first + p2.first, p1.second + p2.second};\n }\n int q;\n map<pair<int, int>, int> l, s;\n map<int, set<pair<int, int>>> qs;\n int n = 0;\n int gcd(int a, int b) {\n   while (b != 0) {\n     a %= b;\n     swap(a, b);\n   }\n   return a;\n }\n pair<int, int> getp(pair<int, int> p) {\n   int g = gcd(p.first, p.second);\n   return {p.first / g, p.second / g};\n }\n void add(pair<int, int> p) {\n   ++n;\n   pair<int, int> t = getp(p);\n   ++l[t];\n   int d = p.first * p.first + p.second * p.second;\n   for (pair<int, int> q : qs[d]) {\n     pair<int, int> u = getp(p + q);\n     ++s[u];\n   }\n   qs[d].insert(p);\n }\n void del(pair<int, int> p) {\n   --n;\n   pair<int, int> t = getp(p);\n   --l[t];\n   int d = p.first * p.first + p.second * p.second;\n   qs[d].erase(p);\n   for (pair<int, int> q : qs[d]) {\n     pair<int, int> u = getp(p + q);\n     --s[u];\n   }\n }\n int get(pair<int, int> p) {\n   pair<int, int> t = getp(p);\n   return n - l[t] - 2 * s[t];\n }\n inline void solve() {\n   for (int i = 0; i < q; i++) {\n     int t;\n     pair<int, int> p;\n     cin >> t >> p.first >> p.second;\n     if (t == 1) {\n       add(p);\n     } else if (t == 2) {\n       del(p);\n     } else if (t == 3) {\n       int ans = get(p);\n       cout << ans << '\n';\n     }\n   }\n }\n inline void read() { cin >> q; }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100005;\n vector<pair<int, int>> adj[N], fish[N];\n int n, m, now, depth[N];\n struct node_t {\n   int x, d, v;\n   node_t(int x, int d, int v, int t = 0) : x(x - d * t), d(d), v(v) {}\n   bool operator<(const node_t &b) const {\n     int p = x + now * d, q = b.x + now * b.d;\n     return p == q ? d < b.d : p < q;\n   }\n };\n struct collision_t {\n   node_t x, y;\n   int when;\n   collision_t(node_t x, node_t y) : x(x), y(y) { when = y.x - x.x >> 1; }\n   bool operator<(const collision_t &b) const {\n     if (when != b.when) {\n       return when < b.when;\n     } else {\n       return make_tuple(x.x, x.v, y.x, y.v) <\n              make_tuple(b.x.x, b.x.v, b.y.x, b.y.v);\n     }\n   }\n };\n struct info_t {\n   set<collision_t> collisions;\n   set<node_t> nodes;\n   void insert_collision(node_t x, node_t y) {\n     if (x.d > 0 && y.d < 0) {\n       collisions.insert(collision_t(x, y));\n     }\n   }\n   void erase_collision(node_t x, node_t y) {\n     if (x.d > 0 && y.d < 0) {\n       collisions.erase(collision_t(x, y));\n     }\n   }\n   void insert(node_t x) {\n     if (!x.v) {\n       return;\n     }\n     if (nodes.find(x) != nodes.end()) {\n       x.v += nodes.find(x)->v;\n       erase(*nodes.find(x));\n     }\n     auto it = nodes.insert(x).first, next = it;\n     ++next;\n     if (it != nodes.begin()) {\n       auto prev = it;\n       --prev;\n       if (next != nodes.end()) {\n         erase_collision(*prev, *next);\n       }\n       insert_collision(*prev, x);\n     }\n     if (next != nodes.end()) {\n       insert_collision(x, *next);\n     }\n   }\n   void erase(node_t x) {\n     auto it = nodes.find(x), next = it;\n     ++next;\n     if (next != nodes.end()) {\n       erase_collision(x, *next);\n     }\n     if (it != nodes.begin()) {\n       auto prev = it;\n       --prev;\n       erase_collision(*prev, x);\n       if (next != nodes.end()) {\n         insert_collision(*prev, *next);\n       }\n     }\n     nodes.erase(it);\n   }\n   int reset(int x, int y) {\n     node_t l(x + 1, -1, y, now), r(x - 1, 1, y, now);\n     return max(0, y - max(nodes.find(l) == nodes.end() ? 0 : nodes.find(l)->v,\n                           nodes.find(r) == nodes.end() ? 0 : nodes.find(r)->v));\n   }\n   node_t cancel(node_t x, node_t y) {\n     if (x.v > y.v) {\n       return node_t(x.x, x.d, x.v - y.v);\n     } else {\n       return node_t(y.x, y.d, y.v - x.v);\n     }\n   }\n   void collide(collision_t x) {\n     erase(x.x);\n     erase(x.y);\n     insert(cancel(x.x, x.y));\n   }\n   void maintain(int x) {\n     while (!collisions.empty() && collisions.begin()->when <= x) {\n       collide(*collisions.begin());\n     }\n   }\n   void merge(info_t &b) {\n     if (nodes.size() < b.nodes.size()) {\n       swap(nodes, b.nodes);\n       swap(collisions, b.collisions);\n     }\n     for (auto x : b.nodes) {\n       insert(x);\n     }\n   }\n   int query() {\n     int answer = 0;\n     for (auto x : nodes) {\n       if (x.d > 0) {\n         answer += x.v;\n       }\n     }\n     return answer;\n   }\n } info[N];\n void dfs(int x, int parent) {\n   for (auto e : adj[x]) {\n     int y = e.first, w = e.second;\n     if (y != parent) {\n       depth[y] = depth[x] + w;\n       dfs(y, x);\n     }\n   }\n }\n void solve(int x, int parent) {\n   for (auto e : adj[x]) {\n     int y = e.first, w = e.second;\n     if (y != parent) {\n       solve(y, x);\n       now = -depth[y];\n       info[y].maintain(-(depth[x] + 1));\n       now = -(depth[x] + 1);\n       info[x].merge(info[y]);\n     }\n   }\n   now = -(depth[x] + 1);\n   for (auto &e : fish[x]) {\n     e.second = info[x].reset(e.first, e.second);\n   }\n   info[x].maintain(-depth[x]);\n   now = -depth[x];\n   for (auto e : fish[x]) {\n     info[x].insert(node_t(e.first, -1, e.second, now));\n     info[x].insert(node_t(e.first, 1, e.second, now));\n   }\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i < n; ++i) {\n     int x, y, w;\n     scanf('%d %d %d', &x, &y, &w);\n     --x;\n     --y;\n     w <<= 1;\n     adj[x].emplace_back(y, w);\n     adj[y].emplace_back(x, w);\n   }\n   scanf('%d', &m);\n   for (int i = 1; i <= m; ++i) {\n     int day, value, where;\n     scanf('%d %d %d', &day, &value, &where);\n     day <<= 1;\n     --where;\n     fish[where].emplace_back(day, value);\n   }\n   dfs(0, -1);\n   solve(0, -1);\n   info[0].maintain(INT_MAX);\n   printf('%d\n', info[0].query());\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n void fre() {\n   freopen('c://test//input.in', 'r', stdin);\n   freopen('c://test//output.out', 'w', stdout);\n }\n template <class T>\n inline void gmax(T &a, T b) {\n   if (b > a) a = b;\n }\n template <class T>\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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> push_left(int i) {\n   vector<int> 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<int> push_right(int i, int n) {\n   vector<int> 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<int> 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 <bits/stdc++.h>\n using namespace std;\n template <typename T>\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 <bits/stdc++.h>\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<pair<int, int> > g[kN];\n bool Dp(int u, int v, int mark) {\n   if (!used[u][v][mark]) {\n     used[u][v][mark] = true;\n     dp[u][v][mark] = false;\n     for (const auto& edge : g[u]) {\n       if (edge.second < mark) {\n         continue;\n       }\n       dp[u][v][mark] = dp[u][v][mark] || !Dp(v, edge.first, edge.second);\n     }\n   }\n   return dp[u][v][mark];\n }\n void Solve() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < m; ++i) {\n     int u, v;\n     char ch;\n     cin >> u >> v >> ch;\n     g[u - 1].emplace_back(v - 1, int(ch));\n   }\n   for (int u = 0; u < n; ++u) {\n     for (int v = 0; v < n; ++v) {\n       cout << (Dp(u, v, 0) ? 'A' : 'B');\n     }\n     cout << '\n';\n   }\n }\n int main() {\n   std::ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int tests_count = 1;\n   for (int test_index = 0; test_index < tests_count; ++test_index) {\n     Solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MOD = 1e9 + 7;\n int n, S, L;\n int a[300005];\n int dp[300005];\n void solve() {\n   deque<pair<int, int> > dqmin, dqmax, dqdp;\n   int pos = 0;\n   for (int i = 1; i <= n; i++) {\n     if (i >= L) {\n       while (dqdp.size() && dqdp.back().first >= dp[i - L]) dqdp.pop_back();\n       dqdp.push_back(make_pair(dp[i - L], i - L));\n     }\n     while (dqmax.size() && dqmax.back().first <= a[i]) dqmax.pop_back();\n     dqmax.push_back(make_pair(a[i], i));\n     while (dqmin.size() && dqmin.back().first >= a[i]) dqmin.pop_back();\n     dqmin.push_back(make_pair(a[i], i));\n     while (dqmax.size() && dqmax.front().first - dqmin.front().first > S) {\n       pos++;\n       if (dqmax.front().second < pos) dqmax.pop_front();\n       if (dqmin.front().second < pos) dqmin.pop_front();\n     }\n     while (dqdp.size() && dqdp.front().second < pos - 1) dqdp.pop_front();\n     if (dqdp.size()) dp[i] = dqdp.front().first + 1;\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n;\n   cin >> S >> L;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n     dp[i] = n + 1;\n   }\n   solve();\n   if (dp[n] <= n)\n     cout << dp[n];\n   else\n     cout << -1;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long MaxN = 600005;\n template <class t>\n inline void rd(t &s) {\n   s = 0;\n   register char c = getchar();\n   while (!isdigit(c)) c = getchar();\n   while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar();\n   return;\n }\n long long a[MaxN], b[MaxN], vis[MaxN * 3];\n struct Quetion {\n   long long idx, pos, val;\n } que[MaxN];\n struct SegTree {\n   struct Node {\n     long long val, lazy;\n   };\n   Node tr[MaxN << 2];\n   inline void clear() {\n     memset(tr, 0, sizeof tr);\n     return;\n   }\n   inline void pushup(long long u) {\n     tr[u].val = max(tr[(u << 1)].val, tr[(u << 1 | 1)].val);\n     return;\n   }\n   inline void pushdown(long long u, long long l, long long r) {\n     if (tr[u].lazy) {\n       tr[(u << 1)].lazy += tr[u].lazy;\n       tr[(u << 1 | 1)].lazy += tr[u].lazy;\n       tr[(u << 1)].val += tr[u].lazy;\n       tr[(u << 1 | 1)].val += tr[u].lazy;\n       tr[u].lazy = 0;\n     }\n     return;\n   }\n   inline void buildtr(long long u, long long l, long long r) {\n     if (l == r) {\n       tr[u].val = 0;\n       return;\n     }\n     register long long mid = (l + r) >> 1;\n     buildtr((u << 1), l, mid);\n     buildtr((u << 1 | 1), mid + 1, r);\n     pushup((u >> 1));\n     return;\n   }\n   inline void change(long long u, long long l, long long r, long long ql,\n                      long long qr, long long x) {\n     if (ql == l && r == qr) {\n       tr[u].val += x;\n       tr[u].lazy += x;\n       return;\n     }\n     if (l == r) return;\n     register long long mid = (l + r) >> 1;\n     pushdown(u, l, r);\n     if (qr <= mid)\n       change((u << 1), l, mid, ql, qr, x);\n     else if (mid < ql)\n       change((u << 1 | 1), mid + 1, r, ql, qr, x);\n     else {\n       change((u << 1), l, mid, ql, mid, x);\n       change((u << 1 | 1), mid + 1, r, mid + 1, qr, x);\n     }\n     pushup(u);\n     return;\n   }\n   inline long long query(long long u, long long l, long long r, long long ql,\n                          long long qr) {\n     if (l == r) return l;\n     register long long mid = (l + r) >> 1;\n     pushdown(u, l, r);\n     if (tr[(u << 1 | 1)].val > 0)\n       return query((u << 1 | 1), mid + 1, r, ql, qr);\n     else\n       return query((u << 1), l, mid, ql, qr);\n   }\n } segtree;\n signed main(void) {\n   long long n, m, q;\n   register long long cnt = 0;\n   rd(n);\n   rd(m);\n   for (long long i = 1; i <= n; ++i) rd(a[i]), vis[++cnt] = a[i];\n   for (long long i = 1; i <= m; ++i) rd(b[i]), vis[++cnt] = b[i];\n   rd(q);\n   for (long long i = 1; i <= q; ++i) {\n     rd(que[i].idx);\n     rd(que[i].pos);\n     rd(que[i].val);\n     vis[++cnt] = que[i].val;\n   }\n   sort(vis + 1, vis + cnt + 1);\n   cnt = unique(vis + 1, vis + cnt + 1) - vis - 1;\n   for (long long i = 1; i <= n; ++i)\n     a[i] = lower_bound(vis + 1, vis + cnt + 1, a[i]) - vis;\n   for (long long i = 1; i <= m; ++i)\n     b[i] = lower_bound(vis + 1, vis + cnt + 1, b[i]) - vis;\n   for (long long i = 1; i <= q; ++i)\n     que[i].val = lower_bound(vis + 1, vis + cnt + 1, que[i].val) - vis;\n   segtree.buildtr(1, 1, cnt);\n   for (long long i = 1; i <= n; ++i) segtree.change(1, 1, cnt, 1, a[i], 1);\n   for (long long i = 1; i <= m; ++i) segtree.change(1, 1, cnt, 1, b[i], -1);\n   for (long long i = 1; i <= q; ++i) {\n     if (que[i].idx == 1) {\n       segtree.change(1, 1, cnt, 1, a[que[i].pos], -1);\n       a[que[i].pos] = que[i].val;\n       segtree.change(1, 1, cnt, 1, a[que[i].pos], 1);\n     } else {\n       segtree.change(1, 1, cnt, 1, b[que[i].pos], 1);\n       b[que[i].pos] = que[i].val;\n       segtree.change(1, 1, cnt, 1, b[que[i].pos], -1);\n     }\n     if (segtree.tr[1].val <= 0)\n       puts('-1');\n     else\n       printf('%lld\n', vis[segtree.query(1, 1, cnt, 1, cnt)]);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n void printvec(vector<T>& vec) {\n   for (long long int i = 0; i < vec.size(); i++) {\n     cout << vec[i] << ' ';\n   }\n   cout << endl;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   long long int n;\n   cin >> n;\n   vector<pair<long long int, long long int> > inp;\n   for (long long int i = 0; i < n; i++) {\n     long long int a, b, c, d;\n     cin >> a >> b >> c >> d;\n     a = a + b + c + d;\n     inp.push_back(make_pair(-a, i));\n   }\n   sort(inp.begin(), inp.end());\n   for (long long int i = 0; i < n; i++) {\n     if (inp[i].second == 0) {\n       cout << i + 1 << '\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int s = 1000000;\n int a[1000001];\n bool belongs[1000001];\n bool used[1000001];\n vector<int> ans;\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 0; i <= s; i++) belongs[i] = used[i] = false;\n   for (int i = 0; i < n; i++) {\n     scanf('%i', &a[i]);\n     belongs[a[i]] = true;\n   }\n   int u = 1;\n   for (int i = 0; i < n; i++)\n     if (!used[a[i]]) {\n       if (belongs[a[i]] && !belongs[s - a[i] + 1] && !used[s - a[i] + 1]) {\n         ans.push_back(s - a[i] + 1);\n         used[s - a[i] + 1] = true;\n         used[a[i]] = true;\n       } else if (belongs[a[i]] && belongs[s - a[i] + 1]) {\n         while (u <= s &&\n                (belongs[u] || belongs[s - u + 1] || used[u] || used[s - u + 1]))\n           u++;\n         used[u] = true;\n         used[s - u + 1] = true;\n         used[s - a[i] + 1] = true;\n         used[a[i]] = true;\n         ans.push_back(u);\n         ans.push_back(s - u + 1);\n         u++;\n       } else\n         assert(false);\n     }\n   cout << int(ans.size()) << endl;\n   for (int i = 0; i < int(ans.size()); i++) printf('%i ', ans[i]);\n   cout << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n string n;\n int sz;\n long long mul;\n long long ans;\n long long powe(long long a, long long b) {\n   if (!b) return 1;\n   long long tmp = powe(a, b / 2);\n   tmp = (tmp * tmp) % 1000000007;\n   if (b % 2 == 1)\n     return (tmp * a) % 1000000007;\n   else\n     return tmp;\n }\n int main() {\n   cin >> n;\n   sz = ((int)n.size());\n   mul = powe(2, sz - 1);\n   long long tp = 1;\n   for (int i = sz - 1; i >= 0; i--) {\n     if (n[i] == '1') {\n       ans = (ans + ((tp * mul) % 1000000007)) % 1000000007;\n     }\n     tp = (tp * 2) % 1000000007;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const double pi = acos(-1);\n const int o = 524288;\n int a[1111111];\n double x[1111111], y[1111111];\n int z[1111111];\n int main() {\n   double tx, ty;\n   int i, j, k, n, m, tz;\n   scanf('%d%d', &n, &m);\n   for (i = 0; i < n; i++) a[i + o] = x[i + o] = 1;\n   for (i = o - 1; i >= 0; i--) x[i] = x[i << 1] + x[i << 1 | 1];\n   while (m--) {\n     scanf('%d%d%d', &i, &j, &k);\n     j += o - 1;\n     if (i == 1)\n       a[j] += k;\n     else\n       z[j] = (z[j] + k) % 360;\n     x[j] = a[j] * cos(z[j] * pi / 180);\n     y[j] = a[j] * sin(-z[j] * pi / 180);\n     while (j >>= 1) {\n       x[j] = x[j << 1] + x[j << 1 | 1] * cos(-z[j << 1] * pi / 180) -\n              y[j << 1 | 1] * sin(-z[j << 1] * pi / 180);\n       y[j] = y[j << 1] + x[j << 1 | 1] * sin(-z[j << 1] * pi / 180) +\n              y[j << 1 | 1] * cos(-z[j << 1] * pi / 180);\n       z[j] = (z[j << 1] + z[j << 1 | 1]) % 360;\n     }\n     printf('%.10f %.10f\n', x[1], y[1]);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n #pragma GCC target('sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma')\n #pragma GCC optimize('unroll-loops')\n using namespace std;\n long long MOD = 998244353;\n double eps = 1e-12;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   int n;\n   cin >> n;\n   string s;\n   cin >> s;\n   int coins = 0;\n   int x, y;\n   if (s[0] == 'U') {\n     x = 0;\n     y = 1;\n   } else {\n     x = 1;\n     y = 0;\n   }\n   for (int i = 1; i < n; i++) {\n     if (s[i] == 'U') {\n       if (x == y) {\n         if (s[i - 1] == 'U') coins++;\n       }\n       y++;\n     } else {\n       if (x == y) {\n         if (s[i - 1] == 'R') coins++;\n       }\n       x++;\n     }\n   }\n   cout << coins;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 10000;\n const int maxm = 20000;\n const int maxk = 10;\n const int inf = 25;\n int tot_edge, sz;\n int head[maxn];\n int nxt[maxm];\n int to[maxm];\n int cap[maxm];\n int flow[maxk + 1][maxm];\n int qu[maxn];\n int prv[maxn];\n int when[maxn];\n int pass_flow[maxn];\n int last_time;\n int level[maxn], edge_pos[maxn];\n int read() {\n   int xx = 0, ff = 1;\n   char ch = getchar();\n   while (ch > '9' || ch < '0') {\n     if (ch == '-') ff = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') {\n     xx = (xx << 3) + (xx << 1) + ch - '0';\n     ch = getchar();\n   }\n   return xx * ff;\n }\n void add_edge(int u, int v, int w) {\n   nxt[tot_edge] = head[u];\n   head[u] = tot_edge;\n   to[tot_edge] = v;\n   cap[tot_edge] = w;\n   tot_edge++;\n }\n bool bfs(int s, int t, int *flow) {\n   sz = 0;\n   qu[sz++] = t;\n   int pnt = 0;\n   memset(level, -1, sizeof(level));\n   level[t] = 0;\n   while (pnt < sz && level[s] == -1) {\n     int u = qu[pnt++];\n     for (int e = head[u]; e >= 0; e = nxt[e]) {\n       int v = to[e];\n       if (level[v] == -1 && flow[e ^ 1] < cap[e ^ 1]) {\n         level[v] = level[u] + 1;\n         qu[sz++] = v;\n       }\n     }\n   }\n   return level[s] != -1;\n }\n int dinic(int s, int t, int *flow) {\n   int ret = 0;\n   while (bfs(s, t, flow)) {\n     copy(head, head + maxn, edge_pos);\n     function<int(int, int)> find_path = [&](int u, int res) {\n       if (u == t) return res;\n       for (int &e = edge_pos[u]; e >= 0; e = nxt[e]) {\n         int v = to[e];\n         if (flow[e] == cap[e] || level[u] - 1 != level[v]) continue;\n         int push = find_path(v, min(res, cap[e] - flow[e]));\n         if (push > 0) {\n           flow[e] += push;\n           flow[e ^ 1] -= push;\n           if (flow[e] == cap[e]) e = nxt[e];\n           return push;\n         }\n       }\n       return 0;\n     };\n     for (int f; (f = find_path(s, 1e9)) > 0;) ret += f;\n   }\n   return ret;\n }\n int augment(int s, int t, int *flow) {\n   last_time++;\n   sz = 0;\n   qu[sz++] = s;\n   when[s] = last_time;\n   int pnt = 0;\n   pass_flow[s] = inf;\n   pass_flow[t] = 0;\n   while (pnt < sz && when[t] != last_time) {\n     int u = qu[pnt++];\n     assert(pass_flow[u] > 0);\n     for (int e = head[u]; e >= 0; e = nxt[e]) {\n       int v = to[e];\n       if (when[v] != last_time && flow[e] < cap[e]) {\n         pass_flow[v] = min(pass_flow[u], cap[e] - flow[e]);\n         prv[v] = e;\n         when[v] = last_time;\n         qu[sz++] = v;\n         if (v == t) break;\n       }\n     }\n   }\n   int f = pass_flow[t];\n   if (f == 0) return f;\n   do {\n     int e = prv[t];\n     flow[e] += f;\n     flow[e ^ 1] -= f;\n     assert(to[e] == t);\n     t = to[e ^ 1];\n   } while (t != s);\n   return f;\n }\n int max_flow(int s, int t, int *flow) {\n   int res = 0, cur = 0;\n   do {\n     cur = augment(s, t, flow);\n     res += cur;\n   } while (cur);\n   return res;\n }\n int n, m, k, q;\n int masked[1 << maxk];\n void go(int n, int m, int mask, int pointer) {\n   for (int i = 0; (mask >> i & 1) == 0 && i < k; ++i) {\n     int n_mask = mask | (1 << i);\n     copy(flow[pointer], flow[pointer] + m, flow[pointer + 1]);\n     cap[2 * i] = inf;\n     masked[n_mask] = masked[mask] + max_flow(0, n - 1, flow[pointer + 1]);\n     go(n, m, n_mask, pointer + 1);\n     cap[2 * i] = 0;\n   }\n }\n int wei[maxk];\n int suma[1 << maxk];\n int eptr;\n struct info {\n   int u, v, w;\n } edges[maxm];\n vector<int> adj[maxn];\n void relabel(int n, int m) {\n   sz = 0;\n   qu[sz++] = 0;\n   int pnt = 0;\n   memset(level, -1, sizeof(level));\n   level[0] = 0;\n   level[n - 1] = n - 1;\n   while (pnt < sz) {\n     int u = qu[pnt++];\n     for (auto v : adj[u]) {\n       if (level[v] == -1) {\n         level[v] = sz;\n         qu[sz++] = v;\n       }\n     }\n   }\n   for (int i = 0; i < n; ++i)\n     if (level[i] == -1) level[i] = sz++;\n   for (int i = 0; i < m; ++i) {\n     edges[i].u = level[edges[i].u];\n     edges[i].v = level[edges[i].v];\n   }\n }\n int main() {\n   memset(head, -1, sizeof head);\n   n = read();\n   m = read();\n   k = read();\n   q = read();\n   for (int i = 0; i < m; ++i) {\n     int u, v, w;\n     u = read();\n     v = read();\n     w = read();\n     u--;\n     v--;\n     edges[i] = {u, v, w};\n     adj[u].push_back(v);\n   }\n   relabel(n, m);\n   for (int i = 0; i < m; ++i) {\n     add_edge(edges[i].u, edges[i].v, edges[i].w);\n     add_edge(edges[i].v, edges[i].u, 0);\n   }\n   masked[0] = dinic(0, n - 1, flow[0]);\n   go(n, 2 * m, 0, 0);\n   int top = (1 << k) - 1;\n   for (int i = 0; i < q; ++i) {\n     for (int j = 0; j < k; ++j) wei[j] = read();\n     int answer = masked[top];\n     for (int j = 1; j < (1 << k); j++) {\n       int x = __builtin_ctz(j);\n       suma[j] = suma[j ^ (1 << x)] + wei[x];\n       answer = min(answer, masked[top ^ j] + suma[j]);\n     }\n     printf('%d\n', answer);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   string n;\n   cin >> n;\n   cout << '25' << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('Ofast')\n using namespace std;\n const int maxn = 1000100;\n int cnt_neg = 0, cnt_pos = 0;\n int arr[maxn << 1];\n int main() {\n   int n;\n   scanf('%d', &n);\n   for (int e = 1; e <= n; e++) scanf('%d', arr + e), arr[e + n] = arr[e];\n   int hi = 2 * n, lo = n + 1, nowlo = n;\n   long long sum = 0;\n   set<pair<int, int> > go;\n   unordered_set<int> removido;\n   for (int cur = hi; cur >= lo; cur--) {\n     if (arr[cur] <= nowlo)\n       cnt_pos++;\n     else\n       cnt_neg++, go.insert(make_pair(arr[cur] - nowlo, cur));\n     sum += abs(arr[cur] - nowlo);\n     nowlo--;\n   }\n   long long ans = sum, shift = 0, state = 0;\n   for (; lo > 1;) {\n     if (arr[hi] <= n)\n       cnt_pos--;\n     else\n       cnt_neg--;\n     sum -= abs(arr[hi] - n);\n     removido.insert(hi);\n     shift++;\n     sum += -cnt_neg + cnt_pos;\n     sum += abs(arr[lo - 1] - 1);\n     if (sum < ans) ans = sum, state = shift;\n     if (arr[lo - 1] > 1)\n       cnt_neg++, go.insert(make_pair(shift + arr[lo - 1] - 1, lo - 1));\n     else\n       cnt_pos++;\n     while (!go.empty()) {\n       int shi, val;\n       tie(shi, val) = *go.begin();\n       int removal = removido.count(val);\n       if (!(removal || shi == shift)) break;\n       if (!removal)\n         cnt_neg--, cnt_pos++;\n       else\n         removido.erase(go.begin()->second);\n       go.erase(go.begin());\n     }\n     lo--;\n     hi--;\n   }\n   printf('%lld %lld\n', ans, state);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mod(long long v, long long k, long long p) {\n   long long res = 1;\n   for (long long i = 0; i < 4; i++) res *= v, res %= p;\n   res -= ((k * v) % p);\n   if (res < 0) res += p;\n   return res;\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long n, p, k;\n   cin >> n >> p >> k;\n   long long Array[n];\n   for (long long i = 0; i < n; i++) cin >> Array[i];\n   long long B[n];\n   for (long long i = 0; i < n; i++) B[i] = mod(Array[i], k, p);\n   vector<long long> out;\n   sort(B, B + n);\n   long long cnt = 1;\n   for (long long i = 0; i < n - 1; i++) {\n     if (B[i + 1] != B[i] and cnt != 1)\n       out.push_back(cnt), cnt = 1;\n     else if (B[i + 1] == B[i])\n       cnt++;\n   }\n   if (cnt != 1) out.push_back(cnt);\n   long long sum = 0;\n   for (long long i = 0; i < out.size(); i++)\n     sum += ((out[i] * (out[i] - 1)) / 2);\n   cout << sum << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 200000000 + 1;\n const int N = 300006, M = 80;\n int dp[2][101][10005], a[105], cnt[105];\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> a[i];\n   for (int i = 1; i <= n; i++) {\n     int cnt1 = 0;\n     for (int j = 1; j <= n; j++) {\n       if (a[i] == a[j]) cnt1++;\n     }\n     cnt[a[i]] = cnt1;\n   }\n   sort(a + 1, a + n + 1);\n   vector<int> v;\n   v.push_back(a[1]);\n   for (int i = 2; i <= n; i++)\n     if (a[i] != a[i - 1]) v.push_back(a[i]);\n   dp[0][0][0] = 1;\n   for (int i = 1; i <= v.size(); i++) {\n     for (int j = 0; j <= n; j++) {\n       for (int k = 0; k <= 100 * n; k++) {\n         dp[i % 2][j][k] = dp[1 - i % 2][j][k];\n         for (int l = 1; l <= cnt[v[i - 1]] && l <= j; l++) {\n           int z = l * v[i - 1];\n           if (k >= z)\n             dp[i % 2][j][k] = dp[i % 2][j][k] + dp[1 - i % 2][j - l][k - z];\n           if (dp[i % 2][j][k] > 10) dp[i % 2][j][k] = 10;\n         }\n       }\n     }\n   }\n   int ans = 1;\n   for (int i = 1; i <= n; i++) {\n     for (int j = i; j <= n; j++) {\n       if (a[j] != a[i]) break;\n       int sum = a[j] * (j - i + 1);\n       int z = j - i + 1;\n       if (dp[v.size() % 2][z][sum] == 1) ans = max(ans, z);\n     }\n   }\n   if (v.size() == 2) {\n     cout << n << '\n';\n     return 0;\n   }\n   cout << ans << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int MAXN = 1e6 + 5;\n int n, m, k;\n char str[21];\n int x[MAXN], y[MAXN];\n int s[MAXN], t[MAXN];\n int p[21];\n int f[(1 << 20) + 3], g[(1 << 20) + 3];\n inline void presum() {\n   for (int i = 0; i <= k - 1; ++i) {\n     for (int S = 0; S <= (1 << k) - 1; ++S) {\n       if ((S >> i) & 1) continue;\n       f[S] = std::min(f[S ^ (1 << i)], f[S]);\n       g[S] = std::max(g[S ^ (1 << i)], g[S]);\n     }\n   }\n }\n int main() {\n   scanf('%d%d%d', &n, &m, &k);\n   scanf('%s', str);\n   for (int i = 0; i <= k - 1; ++i)\n     if (str[i] == '1') s[0] |= (1 << i);\n   scanf('%s', str);\n   for (int i = 0; i <= k - 1; ++i)\n     if (str[i] == '1') t[0] |= (1 << i);\n   for (int i = 1; i <= n; ++i) scanf('%d%d', x + i, y + i);\n   for (int i = 1; i <= k; ++i) p[i] = i;\n   for (int i = 1; i <= n; ++i) {\n     int p1 = -1, p2 = -1;\n     for (int j = 1; j <= k; ++j) {\n       if (p[j] == x[i]) p1 = j;\n       if (p[j] == y[i]) p2 = j;\n     }\n     std::swap(p[p1], p[p2]);\n     for (int j = 0; j <= k - 1; ++j)\n       if ((s[0] >> (p[j + 1] - 1)) & 1) s[i] |= 1 << j;\n     for (int j = 0; j <= k - 1; ++j)\n       if ((t[0] >> (p[j + 1] - 1)) & 1) t[i] |= 1 << j;\n   }\n   for (int i = 0; i <= (1 << k) - 1; ++i) f[i] = 1e9, g[i] = -1e9;\n   for (int i = 0; i <= n; ++i)\n     f[s[i]] = std::min(f[s[i]], i), g[t[i]] = std::max(g[t[i]], i);\n   presum();\n   int ans = -1e9, ansl = -1, ansr = -1;\n   for (int S = 0; S <= (1 << k) - 1; ++S) {\n     if (g[S] - f[S] >= m && __builtin_popcount(S) > ans) {\n       ans = __builtin_popcount(S);\n       ansl = f[S] + 1;\n       ansr = g[S];\n     }\n   }\n   ans = 2 * ans + k - __builtin_popcount(s[0]) - __builtin_popcount(t[0]);\n   printf('%d\n%d %d\n', ans, ansl, ansr);\n   return 0;\n }\n "}
+{"func_code_string": "//頑張って\n #include <bits/stdc++.h>\n #define ff first\n #define ss second\n #define ll long long\n #define rep(i, n) for (int i = 0; i < n; i++)\n using namespace std;\n #define all(x) x.begin(), x.end()\n void solve() {\n    int n;\n    cin >> n;\n    vector <int> a(n);\n    for (auto &i : a)\n       cin >> i;\n    int mxn = accumulate(all(a), 0);\n    vector <bool> dp(mxn + 1);\n    dp[0] = true;\n    for (int i = 0; i < n; i++) {\n       for (int j = mxn - a[i]; j >= 0; j--) {\n          if (dp[j] == true)\n             dp[a[i] + j] = true;\n       }\n    }\n    if ((mxn % 2 == 0 && !dp[mxn / 2]) || mxn % 2) {\n       cout << '0\n';\n       return;\n    }\n    while (true) {\n       for (int i = 0; i < n; i++) {\n          if (a[i] % 2 != 0) {\n             cout << '1\n' << i + 1 << '\n';\n             return;\n          }\n          a[i] /= 2;\n       }\n    }\n }\n int main() {\n #ifndef ONLINE_JUDGE\n    freopen('inp.in', 'r', stdin);      freopen('outp.in', 'w', stdout);\n #endif\n    ios::sync_with_stdio(false);   cin.tie(NULL);   cout.tie(NULL);\n    solve();\n    return 0;\n }"}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long inf = (long long)1e18;\n const int N = 1234567;\n long long a[N], b[N];\n int main() {\n   int n, k;\n   scanf('%d %d', &n, &k);\n   n++;\n   for (int i = 0; i < n; i++) {\n     int foo;\n     scanf('%d', &foo);\n     a[i] = foo;\n   }\n   long long z = 0;\n   int up = 0;\n   for (int i = 0; i < n; i++) {\n     z += a[i];\n     b[i] = z;\n     if (z % 2 != 0) {\n       break;\n     }\n     up++;\n     z /= 2;\n   }\n   long long value = 0;\n   int ans = 0;\n   for (int i = n - 1; i >= 0; i--) {\n     if (i <= up) {\n       long long tmp = value * 2 + b[i];\n       long long z = a[i] - tmp;\n       if (-k <= z && z <= k && (i != n - 1 || z != 0)) {\n         ans++;\n       }\n     }\n     value = value * 2 + a[i];\n     if (value < -inf || value > inf) {\n       break;\n     }\n   }\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int di[] = {-1, 0, 1, 0};\n const int dj[] = {0, 1, 0, -1};\n const long long MOD = 1e9 + 7;\n const long long INF = 1e9;\n const double EPS = 1e-11;\n class UnionFind {\n  private:\n   vector<long long> p, rank, setSize;\n   int numSets;\n \n  public:\n   UnionFind(int N) {\n     setSize.assign(N, 1);\n     numSets = N;\n     rank.assign(N, 0);\n     p.assign(N, 0);\n     for (int i = 0; i < N; i++) p[i] = i;\n   }\n   int findSet(int i) { return (p[i] == i) ? i : (p[i] = findSet(p[i])); }\n   bool isSameSet(int i, int j) { return findSet(i) == findSet(j); }\n   void unionSet(int i, int j) {\n     if (!isSameSet(i, j)) {\n       numSets--;\n       int x = findSet(i), y = findSet(j);\n       if (rank[x] > rank[y]) {\n         p[y] = x;\n         setSize[x] += setSize[y];\n       } else {\n         p[x] = y;\n         setSize[y] += setSize[x];\n         if (rank[x] == rank[y]) rank[y]++;\n       }\n     }\n   }\n   int numDisjointSets() { return numSets; }\n   int sizeOfSet(int i) { return setSize[findSet(i)]; }\n };\n int main() {\n   ios::sync_with_stdio(false), cin.tie(0);\n   int n;\n   cin >> n;\n   vector<long long> num(n);\n   map<int, int> idx, vis;\n   for (int i = 0; i < n; ++i) cin >> num[i], idx[num[i]] = i;\n   vector<long long> num2 = num;\n   sort(num2.begin(), num2.end());\n   UnionFind dsu(n);\n   for (int i = 0; i < n; ++i) {\n     swap(num[i], num[idx[num2[i]]]);\n     dsu.unionSet(i, idx[num2[i]]);\n   }\n   for (int i = 0; i < n; ++i) num[i] = dsu.findSet(i);\n   map<int, vector<long long> > r;\n   for (int i = 0; i < n; ++i) r[num[i]].push_back(i + 1);\n   cout << r.size() << endl;\n   for (map<int, vector<long long> >::iterator i = r.begin(); i != r.end();\n        ++i) {\n     cout << i->second.size() << ' ';\n     for (int j = 0; j < i->second.size(); ++j)\n       cout << i->second[j] << ' \n'[j == i->second.size() - 1];\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n using minheap = priority_queue<T, vector<T>, greater<T>>;\n int main() {\n   ios_base::sync_with_stdio(false);\n   int t;\n   cin >> t;\n   while (t--) {\n     long long w, h;\n     cin >> w >> h;\n     vector<vector<long long>> a(4);\n     for (int i = 0; i < 4; i++) {\n       int k, temp;\n       cin >> k;\n       for (int j = 0; j < k; j++) {\n         cin >> temp;\n         a[i].push_back(temp);\n       }\n     }\n     long long ans = 0;\n     ans = max(ans, (a[0].back() - a[0][0]) * h);\n     ans = max(ans, (a[1].back() - a[1][0]) * h);\n     ans = max(ans, (a[2].back() - a[2][0]) * w);\n     ans = max(ans, (a[3].back() - a[3][0]) * w);\n     cout << ans << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char a[5][6] = {'aabb', 'abab', 'abba', 'aaaa'};\n char s[5][10005];\n bool f[5];\n int find(char s[], int k) {\n   int p1 = -1;\n   int len = strlen(s);\n   int cnt = 0;\n   for (int i = len - 1; i >= 0; i--) {\n     if (s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' || s[i] == 'u')\n       cnt++;\n     if (cnt == k) return i;\n   }\n   return -1;\n }\n bool check(char s[], char t[], int k) {\n   int p = find(s, k), q = find(t, k);\n   if (p == -1) return false;\n   if (q == -1) return false;\n   int l1 = strlen(s), l2 = strlen(t);\n   if (l1 - p != l2 - q) return false;\n   int j = q;\n   for (int i = p; i < l1; i++) {\n     if (s[i] == t[j])\n       j++;\n     else\n       return false;\n   }\n   return true;\n }\n int main() {\n   int n, k;\n   while (scanf('%d%d', &n, &k) > 0) {\n     memset(f, false, sizeof(f));\n     for (int i = 1; i <= n; i++) {\n       for (int j = 0; j < 4; j++) scanf('%s', s[j]);\n       if (!check(s[0], s[1], k)) {\n         f[0] = true;\n         f[3] = true;\n       }\n       if (!check(s[2], s[3], k)) {\n         f[0] = true;\n         f[3] = true;\n       }\n       if (!check(s[0], s[2], k)) {\n         f[1] = true;\n         f[3] = true;\n       }\n       if (!check(s[1], s[3], k)) {\n         f[1] = true;\n         f[3] = true;\n       }\n       if (!check(s[0], s[3], k)) {\n         f[2] = true;\n         f[3] = true;\n       }\n       if (!check(s[2], s[1], k)) {\n         f[2] = true;\n         f[3] = true;\n       }\n     }\n     bool sol = false;\n     if (!f[0] && !f[1] && !f[2]) {\n       puts('aaaa');\n       continue;\n     }\n     for (int i = 2; i >= 0; i--) {\n       if (!f[i]) {\n         puts(a[i]);\n         sol = true;\n         break;\n       }\n     }\n     if (!sol) puts('NO');\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 100005;\n struct edge {\n   int to, index;\n   edge(int t = 0, int i = 0) {\n     to = t;\n     index = i;\n   }\n };\n vector<edge> g[N];\n int num[N], ans[N], dep[N], fa[18][N], n, m;\n void add(int from, int to, int index) { g[from].push_back(edge(to, index)); }\n void dfs(int x, int ffa, int d) {\n   fa[0][x] = ffa;\n   dep[x] = d;\n   for (int i = 0; i < g[x].size(); i++) {\n     int y = g[x][i].to;\n     if (y == ffa) continue;\n     dfs(y, x, d + 1);\n   }\n }\n void init() {\n   m = 0;\n   while (n >= (1 << m)) m++;\n   for (int i = 1; i <= m; i++) {\n     for (int j = 1; j <= n; j++) {\n       if (fa[i - 1][j] < 0)\n         fa[i][j] = -1;\n       else {\n         fa[i][j] = fa[i - 1][fa[i - 1][j]];\n       }\n     }\n   }\n }\n int LCA(int x, int y) {\n   if (dep[x] < dep[y]) swap(x, y);\n   for (int i = m; i >= 0; i--) {\n     if ((dep[x] - dep[y]) & (1 << i)) x = fa[i][x];\n   }\n   if (x == y) return x;\n   for (int i = m; i >= 0; i--) {\n     if (fa[i][x] != fa[i][y]) {\n       x = fa[i][x];\n       y = fa[i][y];\n     }\n   }\n   return fa[0][x];\n }\n void dfs2(int x, int fa, int z) {\n   for (int i = 0; i < g[x].size(); i++) {\n     int y = g[x][i].to;\n     if (y == fa) continue;\n     dfs2(y, x, g[x][i].index);\n     num[x] += num[y];\n   }\n   ans[z] = num[x];\n }\n int main() {\n   int x, y, rt;\n   scanf('%d', &n);\n   for (int i = 1; i < n; i++) {\n     scanf('%d%d', &x, &y);\n     add(x, y, i);\n     add(y, x, i);\n   }\n   dfs(1, -1, 0);\n   init();\n   int TA;\n   scanf('%d', &TA);\n   while (TA--) {\n     scanf('%d%d', &x, &y);\n     rt = LCA(x, y);\n     num[x]++;\n     num[y]++;\n     num[rt] -= 2;\n   }\n   dfs2(1, -1, 0);\n   for (int i = 1; i < n; i++) printf('%d ', ans[i]);\n   printf('\n');\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a[2 * 100004], b[2 * 100004], c[2 * 100004], poz, x;\n int main() {\n   ios::sync_with_stdio(false);\n   cin >> n;\n   for (int i = 1; i <= n; ++i) {\n     cin >> a[i];\n     c[a[i]] = 1;\n   }\n   poz = 1;\n   for (int i = 1; i <= n; ++i) {\n     cin >> b[i];\n     if (c[b[i]] == 0) {\n       cout << '0 ';\n       continue;\n     }\n     for (int j = poz; j <= n; ++j) {\n       c[a[j]] = 0;\n       if (a[j] == b[i]) {\n         cout << j - poz + 1 << ' ';\n         poz = j + 1;\n         break;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, cou = 0;\n   cin >> n;\n   string s;\n   cin >> s;\n   int res = n + 1;\n   for (int i = 0; i < n; i++) {\n     if (s[i] == 'H') cou++;\n   }\n   for (int i = 0; i < n; i++) {\n     int cnt = 0;\n     for (int j = 0; j < cou; j++) {\n       if (s[(i + j) % n] == 'T') cnt++;\n     }\n     res = min(res, cnt);\n   }\n   cout << res << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int x[55], y[55];\n int main(int argc, char** argv) {\n   int n;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; i++) scanf('%d', &x[i]);\n   for (int i = 1; i <= n; i++) scanf('%d', &y[i]);\n   int sum = 0;\n   for (int i = 1; i <= n; i++) {\n     sum += x[i] - y[i];\n   }\n   if (sum >= 0)\n     cout << 'Yes';\n   else\n     cout << 'No';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n void read(T &x) {\n   T res = 0, f = 1;\n   char c = getchar();\n   while (!isdigit(c)) {\n     if (c == '-') f = -1;\n     c = getchar();\n   }\n   while (isdigit(c)) {\n     res = (res << 3) + (res << 1) + c - '0';\n     c = getchar();\n   }\n   x = res * f;\n }\n const long long N = 200000 + 10;\n long long w, a[N], n, mn = 1e13, mx = -1e13, sum;\n int main() {\n   read(n), read(w);\n   for (int i = 1; i <= n; i++) {\n     read(a[i]);\n     sum += a[i];\n     mn = min(mn, sum);\n     mx = max(mx, sum);\n   }\n   if (abs(mx) > w || abs(mn) > w) {\n     printf('0');\n     return 0;\n   }\n   long long l = 0, r = w;\n   if (mn < 0) {\n     l = 0 - mn;\n   }\n   if (mx > 0) {\n     r = w - mx;\n   }\n   long long ans = r - l + 1;\n   if (ans > 0)\n     printf('%lld', r - l + 1);\n   else\n     printf('0');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long getint() {\n   long long _x = 0, _tmp = 1;\n   char _tc = getchar();\n   while ((_tc < '0' || _tc > '9') && _tc != '-') _tc = getchar();\n   if (_tc == '-') _tc = getchar(), _tmp = -1;\n   while (_tc >= '0' && _tc <= '9') _x *= 10, _x += (_tc - '0'), _tc = getchar();\n   return _x * _tmp;\n }\n inline long long add(long long _x, long long _y,\n                      long long _mod = 1000000007ll) {\n   long long _ = _x + _y;\n   if (_ >= _mod) _ -= _mod;\n   return _;\n }\n inline long long sub(long long _x, long long _y,\n                      long long _mod = 1000000007ll) {\n   long long _ = _x - _y;\n   if (_ < 0) _ += _mod;\n   return _;\n }\n inline long long mul(long long _x, long long _y,\n                      long long _mod = 1000000007ll) {\n   long long _ = _x * _y;\n   if (_ >= _mod) _ %= _mod;\n   return _;\n }\n long long mypow(long long _a, long long _x, long long _mod) {\n   if (_x == 0) return 1ll;\n   long long _tmp = mypow(_a, _x / 2, _mod);\n   _tmp = mul(_tmp, _tmp, _mod);\n   if (_x & 1) _tmp = mul(_tmp, _a, _mod);\n   return _tmp;\n }\n long long mymul(long long _a, long long _x, long long _mod) {\n   if (_x == 0) return 0ll;\n   long long _tmp = mymul(_a, _x / 2, _mod);\n   _tmp = add(_tmp, _tmp, _mod);\n   if (_x & 1) _tmp = add(_tmp, _a, _mod);\n   return _tmp;\n }\n inline bool equal(double _x, double _y) {\n   return _x > _y - 1e-9 && _x < _y + 1e-9;\n }\n int __ = 1, _cs;\n void build() {}\n long long n, m, a, b;\n void init() {\n   n = getint();\n   m = getint();\n   a = getint() - 1;\n   b = getint() - 1;\n }\n void solve() {\n   long long ai = a / m, aj = a % m;\n   long long bi = b / m, bj = b % m;\n   if (ai == bi || (a == 0 && b == n - 1) || m == 1) {\n     puts('1');\n     exit(0);\n   }\n   if (aj == 0 && (bj == m - 1 || b == n - 1)) {\n     puts('1');\n     exit(0);\n   }\n   if (aj == 0 || bj == m - 1 || bi == ai + 1 || bj + 1 == aj || b == n - 1) {\n     puts('2');\n     exit(0);\n   }\n   puts('3');\n }\n int main() {\n   build();\n   while (__--) {\n     init();\n     solve();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class L, class R>\n ostream &operator<<(ostream &os, pair<L, R> P) {\n   return os << '(' << P.first << ',' << P.second << ')';\n }\n template <class T>\n ostream &operator<<(ostream &os, vector<T> V) {\n   os << '[';\n   for (auto vv : V) os << vv << ',';\n   return os << ']';\n }\n template <class TH>\n void _dbg(const char *sdbg, TH h) {\n   cerr << sdbg << '=' << h << '\n';\n }\n template <class TH, class... TA>\n void _dbg(const char *sdbg, TH h, TA... a) {\n   while (*sdbg != ',') cerr << *sdbg++;\n   cerr << '=' << h << ',';\n   _dbg(sdbg + 1, a...);\n }\n const long long N = 4e5 + 7;\n long long n, a[N], pre[N], ansLen, ansIdx;\n double ans = -1.0;\n double sum(long long l, long long r) {\n   return pre[r] - (l > 0 ? pre[l - 1] : 0);\n }\n double f(long long len, long long idx) {\n   double ret = pre[idx] - pre[idx - len - 1];\n   ret += pre[n] - pre[n - len];\n   ret /= len + len + 1;\n   ret -= a[idx];\n   if (ret > ans) {\n     ans = ret;\n     ansIdx = idx;\n     ansLen = len;\n   }\n   return ret;\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   cin >> n;\n   for (long long i = 1; i <= n; i++) cin >> a[i];\n   sort(a + 1, a + n + 1);\n   for (long long i = 1; i <= n; i++) pre[i] = a[i] + pre[i - 1];\n   for (long long i = 1; i <= n; i++) {\n     long long cnt = min(i - 1, n - i);\n     long long lo = 0, hi = cnt;\n     while (hi - lo > 3) {\n       long long m1 = lo + (hi - lo) / 3, m2 = hi - (hi - lo) / 3;\n       if (f(m1, i) < f(m2, i))\n         lo = m1;\n       else\n         hi = m2;\n     }\n     for (long long k = lo; k <= hi; k++) f(k, i);\n   }\n   cout << 2 * ansLen + 1 << '\n';\n   for (long long i = ansIdx; i >= ansIdx - ansLen; i--) cout << a[i] << ' ';\n   for (long long i = n - ansLen + 1; i <= n; i++) cout << a[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int i, n, a, j, b, m, s = 0, t = 0;\n   int x[105] = {0};\n   cin >> n >> m;\n   for (i = 1; i <= m; ++i) {\n     cin >> a;\n     for (j = a; j <= n; ++j) {\n       if (x[j] != 0) break;\n       x[j] = a;\n     }\n   }\n   for (i = 1; i <= n; ++i) cout << x[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 2e5 + 100;\n const int MAXM = 15;\n int N, Q, M;\n int log2(int v) {\n   int r = 1;\n   while (v >>= 1) r++;\n   return r;\n }\n int a[MAXN];\n int t[2][MAXN];\n struct ST {\n   int v[3 * MAXN][2][MAXM];\n   int l[3 * MAXN], r[3 * MAXN];\n   bool lz[3 * MAXN];\n   int NXT;\n   int sz;\n   void updv(const int& n) {\n     assert(n != -1 and l[n] != -1 and r[n] != -1);\n     for (int i = 0; i <= M; i++)\n       for (int j = 0; j < 2; j++) v[n][j][i] = v[l[n]][j][v[r[n]][j][i]];\n   }\n   void init(int n, int nl, int nr) {\n     assert(n != -1 and nl < nr);\n     lz[n] = false;\n     l[n] = r[n] = -1;\n     if (nr - nl == 1) {\n       for (int i = 0; i < M; i++)\n         for (int j = 0; j < 2; j++) v[n][j][i] = i + 1;\n       v[n][a[nl]][M] = M, v[n][!a[nl]][M] = 0;\n     }\n     if (nr - nl > 1) {\n       int m = nl + ((nr - nl) >> 1);\n       init(l[n] = NXT++, nl, m);\n       init(r[n] = NXT++, m, nr);\n       updv(n);\n     }\n   }\n   ST() {}\n   ST(const int& s, bool ini) {\n     sz = s;\n     NXT = 0;\n     if (ini) init(NXT++, 0, sz);\n   }\n   void prop(int n, int nl, int nr) {\n     if (!lz[n]) return;\n     for (int i = 0; i <= M; i++) swap(v[n][0][i], v[n][1][i]);\n     if (nr - nl > 1) {\n       lz[l[n]] = !lz[l[n]];\n       lz[r[n]] = !lz[r[n]];\n     }\n     lz[n] = false;\n   }\n   void upd(int n, int nl, int nr, int gl, int gr) {\n     if (gl <= nl and gr >= nr) {\n       lz[n] = !lz[n];\n       prop(n, nl, nr);\n       return;\n     }\n     if (nr - nl > 1) {\n       prop(n, nl, nr);\n       int m = nl + ((nr - nl) >> 1);\n       if (gl < m)\n         upd(l[n], nl, m, gl, gr);\n       else\n         prop(l[n], nl, m);\n       if (gr > m)\n         upd(r[n], m, nr, gl, gr);\n       else\n         prop(r[n], m, nr);\n       updv(n);\n       return;\n     }\n     assert(false);\n   }\n   void upd(int gl, int gr) { upd(0, 0, sz, gl, gr); }\n   int qry(int n, int nl, int nr, int gl, int gr, int c = M) {\n     prop(n, nl, nr);\n     if (gl <= nl and gr >= nr) {\n       return v[n][0][c];\n     }\n     if (nr - nl > 1) {\n       int m = nl + ((nr - nl) >> 1);\n       if (gr > m) c = qry(r[n], m, nr, gl, gr, c);\n       if (gl < m) c = qry(l[n], nl, m, gl, gr, c);\n       return c;\n     }\n     assert(false);\n     return -1;\n   }\n   int qry(int gl, int gr) { return qry(0, 0, sz, gl, gr); }\n } st;\n void q1() {\n   int l, r, v;\n   scanf('%d%d%d', &l, &r, &v);\n   if (v & 1) st.upd(--l, r);\n }\n void q2() {\n   int l, r;\n   scanf('%d%d', &l, &r);\n   printf('%d\n', (st.qry(--l, r) == 0 ? 2 : 1));\n }\n int main() {\n   scanf('%d%d%d', &N, &M, &Q);\n   for (int i = 0, v; i < N; i++) {\n     scanf('%d', &v);\n     a[i] = v & 1;\n   }\n   st = *(new ST(N, true));\n   for (int i = 0, type; i < Q; i++) {\n     scanf('%d', &type);\n     if (type == 1)\n       q1();\n     else if (type == 2)\n       q2();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = (int)2e5 + 5;\n const int MOD = (int)1e9 + 7;\n const bool MULTI_TEST = true;\n const double PI = acos(-1.0);\n using namespace std;\n void solve() {\n   int n;\n   cin >> n;\n   int a[n];\n   int max = 0, index = -1;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i];\n     if (a[i] > max) {\n       max = a[i];\n     }\n   }\n   if (*min_element(a, a + n) == max)\n     cout << '-1\n';\n   else {\n     for (int i = 0; i < n - 1; i++) {\n       if (a[i] == max && a[i] > a[i + 1]) index = i + 1;\n     }\n     if (index != -1) {\n       cout << index << '\n';\n       return;\n     } else {\n       for (int i = 1; i < n; i++) {\n         if (a[i] == max && a[i] > a[i - 1]) index = i + 1;\n       }\n     }\n     cout << index << endl;\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   int t = 1;\n   if (MULTI_TEST) cin >> t;\n   while (t--) {\n     solve();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[100500], c[300], dp[100500][305], z, cnt, tmp, e, s, l, r, n, m, x,\n     y, k, j, p, k1, k2, i, cur, rez;\n vector<long long> f[100500];\n long long Abs(long long x) {\n   if (x < 0) return -x;\n   return x;\n }\n int main() {\n   cin >> n >> m >> s >> e;\n   for (i = 0; i < n; i++) cin >> a[i];\n   for (j = 0; j < m; j++) {\n     cin >> x;\n     f[x].push_back(j);\n   }\n   for (i = 0; i <= n; i++)\n     for (j = 0; j <= s / e; j++) dp[i][j] = m + 1;\n   dp[0][0] = -1;\n   for (i = 0; i < n; i++) {\n     for (j = 0; j <= s / e; j++)\n       if (dp[i][j] != m + 1) {\n         long long tmp = upper_bound(f[a[i]].begin(), f[a[i]].end(), dp[i][j]) -\n                         f[a[i]].begin();\n         if (tmp != f[a[i]].size())\n           dp[i + 1][j + 1] = min(dp[i + 1][j + 1], f[a[i]][tmp]);\n         dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);\n       }\n   }\n   rez = 0;\n   for (i = 0; i <= n; i++) {\n     for (j = 0; j <= s / e; j++) {\n       if (i + dp[i][j] + 1 + j * e <= s && dp[i][j] != m + 1) rez = max(rez, j);\n     }\n   }\n   cout << rez << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct data {\n   float x, a;\n } h[1005];\n bool cmp(data a, data b) { return a.x < b.x; };\n int main() {\n   int n, ans = 2;\n   float t, d;\n   cin >> n >> t;\n   for (int i = 1; i <= n; i++) cin >> h[i].x >> h[i].a;\n   sort(h + 1, h + n + 1, cmp);\n   for (int i = 1; i < n; i++) {\n     d = h[i + 1].x - h[i].x - h[i].a / 2 - h[i + 1].a / 2;\n     if (d > t) ans += 2;\n     if (abs(d - t) < 1e-6) ans++;\n   }\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int main() {\n   cin >> n;\n   int ans = 0;\n   if (n % 2 == 0) {\n     ans = 3 * (n / 2);\n   } else {\n     ans = 3 * (n / 2) + 1;\n   }\n   cout << ans << endl;\n   for (int i = 1; i <= n; i++) {\n     if (!(i % 2)) cout << i << ' ';\n   }\n   for (int i = 1; i <= n; i++) {\n     if (i % 2) cout << i << ' ';\n   }\n   for (int i = 1; i <= n; i++) {\n     if (!(i % 2)) cout << i << ' ';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T>\n using minpq = priority_queue<T, vector<T>, greater<T>>;\n const int N = 5e5 + 5;\n int n;\n long long a[N], x;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n;\n   for (int i = (0); i < ((n + 1) / 2); i++) cin >> a[i];\n   cin >> x;\n   long long sum = 0, mn = n / 2 + 1, mx = n;\n   vector<pair<long long, long long>> ve;\n   for (int i = (n + 1) / 2 - 1; i >= 0; i--) {\n     sum += a[i];\n     if (x > 0) {\n       if (sum <= 0) {\n         mn = max(mn,\n                  min((long long)n - i + 1, (-sum + x) / x + (n + 1) / 2 - i));\n       }\n     } else if (x < 0) {\n       if (sum > 0) {\n         long long val = (sum - x - 1) / -x - 1 + (n + 1) / 2 - i;\n         if (n - i + 1 > val) {\n           ve.emplace_back(val + 1, n - i);\n         }\n       } else {\n         mn = max(mn, (long long)n - i + 1);\n       }\n     } else if (sum <= 0) {\n       mn = max(mn, (long long)n - i + 1);\n     }\n   }\n   reverse((ve).begin(), (ve).end());\n   for (auto &p : ve) {\n     if (p.first <= mx && mx <= p.second) {\n       mx = p.first - 1;\n     }\n   }\n   if (mn <= mx) {\n     cout << mx << '\n';\n   } else {\n     cout << '-1\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const long long Inf = 1e18;\n const long double eps = 1e-7;\n long long LINF = (long long)2e18;\n using namespace std;\n long long mod = 1e9 + 7;\n long long mod5 = 1e9 + 9;\n long long mod3 = 998244353;\n long long mod4 = 1000003;\n long long mod2 = 1e9 + 123;\n const int MAXN = 10100000;\n const int INF = 1000000000;\n vector<vector<int> > a;\n int n, m;\n vector<pair<int, int> > mx;\n int rec(int pos, vector<int> mxs) {\n   if (pos == m) {\n     int ss = 0;\n     for (long long(i) = 0; (i) < n; (i)++) {\n       ss += mxs[i];\n     }\n     return ss;\n   }\n   int cur = 0;\n   int ss = 0;\n   for (long long(i) = 0; (i) < n; (i)++) {\n     cur += mxs[i];\n     ss += mxs[i];\n   }\n   int ans = cur;\n   for (long long(i) = 0; (i) < n; (i)++) {\n     cur = ss;\n     vector<int> lol = mxs;\n     for (long long(j) = 0; (j) < n; (j)++) {\n       if (a[(i + j) % n][mx[pos].second] > mxs[j]) {\n         cur += a[(i + j) % n][mx[pos].second] - mxs[j];\n         lol[j] = a[(i + j) % n][mx[pos].second];\n       }\n     }\n     ans = max(ans, rec(pos + 1, lol));\n   }\n   return ans;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cout.setf(ios::fixed);\n   cout.precision(20);\n   int tt;\n   cin >> tt;\n   while (tt--) {\n     cin >> n >> m;\n     a.clear();\n     a.resize(n, vector<int>(m));\n     for (long long(i) = 0; (i) < n; (i)++) {\n       for (long long(j) = 0; (j) < m; (j)++) {\n         cin >> a[i][j];\n       }\n     }\n     mx.clear();\n     for (long long(i) = 0; (i) < m; (i)++) {\n       int cur = -1;\n       for (long long(j) = 0; (j) < n; (j)++) {\n         cur = max(cur, a[j][i]);\n       }\n       mx.push_back({cur, i});\n     }\n     sort((mx).rbegin(), (mx).rend());\n     mx.resize(min(4, m));\n     m = min(m, 4);\n     vector<int> kek(n, 0);\n     cout << rec(0, kek) << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long M = 1000000007;\n int main() {\n   int n, x, y;\n   cin >> n >> x >> y;\n   string s;\n   cin >> s;\n   int ans = 0;\n   for (int i = 0; i < x; i++) {\n     int pos = n - i - 1;\n     char current = '0';\n     if (i == y) {\n       current = '1';\n     }\n     if (current != s[pos]) {\n       ans++;\n     }\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 10, OO = 0x3f3f3f3f;\n int dx[] = {1, 0, -1, 0};\n int dy[] = {0, 1, 0, -1};\n int tc, n, m;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   string s;\n   cin >> tc;\n   while (tc--) {\n     cin >> n >> m;\n     cin >> s;\n     vector<long long> freq(n + 1, 0);\n     vector<int> indx(m);\n     for (int i = 0; i < int(m); i++) {\n       cin >> indx[i];\n       freq[0]++;\n       freq[indx[i]]--;\n     }\n     freq[0]++;\n     for (int i = int(1); i <= int(n - 1); i++) freq[i] += freq[i - 1];\n     vector<long long> karakter(26, 0);\n     for (int i = 0; i < int(n); i++) karakter[s[i] - 'a'] += freq[i];\n     for (int i = 0; i < int(26); i++) cout << karakter[i] << ' ';\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 10;\n int a[N];\n int sum[11];\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &a[i]);\n     sum[a[i]]++;\n   }\n   while (1) {\n     int i, aa[11];\n     memset(aa, 0, sizeof(aa));\n     for (i = 1; i < 11; ++i) aa[i] = sum[i];\n     sort(aa, aa + 11);\n     for (i = 0; i < 11; ++i)\n       if (aa[i]) break;\n     if (aa[10] - aa[i] > 1) {\n       if (aa[i] == 1) {\n         if (aa[i + 1] == aa[10]) {\n           cout << n;\n           break;\n         }\n       }\n     } else if (aa[i] == aa[10]) {\n       if (aa[i] == 1 || i == 10) {\n         cout << n;\n         break;\n       }\n     } else {\n       if (aa[i] == 1) {\n         if (aa[i + 1] == aa[10]) {\n           cout << n;\n           break;\n         }\n       }\n       if (aa[i] == aa[9]) {\n         cout << n;\n         break;\n       }\n     }\n     sum[a[n]]--;\n     n--;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n bool umin(T& a, T b) {\n   if (a > b) {\n     a = b;\n     return 1;\n   }\n   return 0;\n }\n template <class T>\n bool umax(T& a, T b) {\n   if (a < b) {\n     a = b;\n     return 1;\n   }\n   return 0;\n }\n long long a, b, c, type, ric[300007], par[300007], cost[300007], d[300007], n,\n     m, lvl[300007], P[300007][20 * 2];\n vector<pair<long long, long long> > E[300007];\n pair<pair<long long, long long>, long long> way[300007];\n long long atabul(long long x) {\n   if (ric[x] == x) return x;\n   return ric[x] = atabul(ric[x]);\n }\n void dfs(long long x, long long y, long long z) {\n   lvl[x] = lvl[y] + 1;\n   P[x][0] = y;\n   cost[x] = z;\n   if (z == 1) {\n     ric[x] = y;\n     atabul(x);\n   }\n   for (int i = 0; i < int(E[x].size()); i++)\n     if (E[x][i].first != y) dfs(E[x][i].first, x, E[x][i].second);\n }\n void build_table() {\n   for (int j = 1; j <= 20; j++)\n     for (int i = 1; i <= n; i++)\n       if (P[i][j - 1] > 0) P[i][j] = P[P[i][j - 1]][j - 1];\n }\n void form_LCA() {\n   for (int i = 0; i <= n; i++)\n     for (int j = 0; j <= 20; j++) P[i][j] = -1;\n   dfs(1, 0, 0);\n   build_table();\n }\n long long LCA(long long x, long long y) {\n   if (lvl[x] < lvl[y]) swap(x, y);\n   for (int i = 20; i >= 0; i--)\n     if (lvl[x] - (1 << i) >= lvl[y]) x = P[x][i];\n   if (x == y) return x;\n   for (int i = 20; i >= 0; i--)\n     if (P[x][i] > 0 && P[x][i] != P[y][i]) x = P[x][i], y = P[y][i];\n   return P[x][0];\n }\n int main() {\n   scanf('%lld%lld', &n, &m);\n   ric[n] = n;\n   for (int i = 1; i < n; i++) {\n     scanf('%lld%lld%lld', &a, &b, &c);\n     E[a].push_back(make_pair(b, c));\n     E[b].push_back(make_pair(a, c));\n     ric[i] = i;\n     way[i] = {{a, b}, c};\n   }\n   form_LCA();\n   while (m--) {\n     scanf('%lld', &type);\n     if (type == 1) {\n       scanf('%lld%lld%lld', &a, &b, &c);\n       long long tr = LCA(a, b);\n       while (atabul(a) != atabul(tr) && c > 0) {\n         if (cost[a] == 1) {\n           a = atabul(a);\n           continue;\n         }\n         c /= cost[a];\n         a = P[a][0];\n       }\n       while (atabul(b) != atabul(tr) && c > 0) {\n         if (cost[b] == 1) {\n           b = atabul(b);\n           continue;\n         }\n         c /= cost[b];\n         b = P[b][0];\n       }\n       printf('%lld\n', c);\n     } else {\n       scanf('%lld%lld', &a, &b);\n       long long qm = way[a].first.first, gr = way[a].first.second;\n       if (lvl[qm] < lvl[gr]) swap(qm, gr);\n       cost[qm] = b;\n       if (b == 1) {\n         ric[qm] = gr;\n         atabul(qm);\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int in() {\n   int32_t x;\n   scanf('%d', &x);\n   return x;\n }\n inline string get() {\n   char ch[1000010];\n   scanf('%s', ch);\n   return ch;\n }\n const int MAX_LG = 60;\n const long long maxn = 1e6 + 100;\n const long long base = 29;\n const long long mod = 1e9 + 7;\n const long long INF = 1e18 + 100;\n struct state {\n   long long a = 0, b = 0, tp = 0;\n   state() {}\n   state(long long a, long long b, long long tp) : a(a), b(b), tp(tp) {}\n };\n long long cnt[maxn];\n long long di[51][51][2];\n long long C[51][51];\n long long ways[51][51][2];\n queue<state> q;\n int32_t main() {\n   long long n = in(), k = in();\n   for (long long i = 0; i < n; i++) cnt[in() / 51]++;\n   q.push({cnt[0], cnt[1], 0});\n   for (long long i = 0; i <= 50; i++)\n     for (long long j = 0; j <= 50; j++) di[i][j][0] = di[i][j][1] = INF;\n   for (long long i = 0; i <= 50; i++) {\n     for (long long j = 0; j <= i; j++) {\n       if (j == 0)\n         C[i][j] = 1;\n       else\n         C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;\n     }\n   }\n   di[cnt[0]][cnt[1]][0] = 0;\n   ways[cnt[0]][cnt[1]][0] = 1;\n   while (q.empty() == false) {\n     state now = q.front();\n     q.pop();\n     long long a2 = cnt[0] - now.a;\n     long long b2 = cnt[1] - now.b;\n     for (long long i = 0; i <= now.a; i++) {\n       for (long long j = 0; j <= now.b; j++) {\n         if (i + j == 0) continue;\n         if (i * 50 + j * 100 > k) continue;\n         long long d2 = di[now.a][now.b][now.tp] + 1;\n         long long *d3 = &di[a2 + i][b2 + j][now.tp ^ 1];\n         if (*d3 == INF) {\n           *d3 = d2;\n           q.push({a2 + i, b2 + j, now.tp ^ 1});\n         }\n         if (*d3 == d2) {\n           ways[a2 + i][b2 + j][now.tp ^ 1] += ways[now.a][now.b][now.tp] *\n                                               C[now.a][i] % mod * C[now.b][j] %\n                                               mod;\n           if (ways[a2 + i][b2 + j][now.tp ^ 1] > mod)\n             ways[a2 + i][b2 + j][now.tp ^ 1] -= mod;\n         }\n       }\n     }\n   }\n   if (ways[cnt[0]][cnt[1]][1] == 0)\n     return cout << -1 << '\n' << 0 << '\n', 0;\n   else {\n     cout << di[cnt[0]][cnt[1]][1] << '\n';\n     cout << ways[cnt[0]][cnt[1]][1] << '\n';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long modulo(long long base, long long exponent, long long modulus);\n long long choose(long long n, long long k);\n long long inverse(long long a, long long m);\n void build();\n void fileio();\n long long ncr(long long n, long long r);\n const int nax = 1e6 + 10;\n const int LG = log2(nax) + 1;\n vector<long long> fact(nax);\n long long dp[1LL << 20];\n int32_t main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, m;\n   cin >> n >> m;\n   string s;\n   cin >> s;\n   long long freq[m][m];\n   memset(freq, 0, sizeof(freq));\n   for (int i = 1; i < n; i++) {\n     freq[s[i] - 'a'][s[i - 1] - 'a']++;\n     freq[s[i - 1] - 'a'][s[i] - 'a']++;\n   }\n   for (int i = 0; i < (1LL << m); i++) dp[i] = 1000000000000000;\n   for (int mask = 0; mask < (1LL << m); mask++) {\n     long long cost = 0;\n     for (int i = 0; i < m; i++) {\n       for (int j = i + 1; j < m; j++) {\n         if ((mask >> i & 1) ^ (mask >> j & 1)) {\n           cost += freq[i][j];\n         }\n       }\n     }\n     for (int i = 0; i < m; i++) {\n       if ((mask & (1LL << i)) == 0) continue;\n       dp[mask] = min(dp[mask], dp[mask ^ (1LL << i)] + cost);\n       if ((mask ^ (1LL << i)) == 0) dp[mask] = cost;\n     }\n   }\n   long long ans = dp[(1LL << m) - 1];\n   cout << ans << '\n';\n   return 0;\n }\n long long ncr(long long n, long long r) {\n   if (r > n || r < 0 || n < 0) return 0;\n   long long ans = fact[n];\n   long long temp = (fact[n - r] * fact[r]) % 1000000007;\n   ans = (ans * inverse(temp, 1000000007)) % 1000000007;\n   return ans;\n }\n void fileio() {\n   freopen('input.txt', 'r', stdin);\n   freopen('output.txt', 'w', stdout);\n }\n void build() {\n   fact[0] = 1;\n   for (long long i = 1; i < nax; i++) fact[i] = (fact[i - 1] * i) % 1000000007;\n }\n long long modulo(long long base, long long exponent, long long modulus) {\n   if (modulus == 1) return 0;\n   long long result = 1;\n   base = base % modulus;\n   while (exponent > 0) {\n     if (exponent % 2 == 1) {\n       result = (result * base) % modulus;\n     }\n     exponent = exponent >> 1;\n     base = (base * base) % modulus;\n   }\n   return result;\n }\n long long choose(long long n, long long k) {\n   if (k == 0) return 1;\n   return (n * choose(n - 1, k - 1)) / k;\n }\n void EE(long long a, long long b, long long &co1, long long &co2) {\n   if (a % b == 0) {\n     co1 = 0;\n     co2 = 1;\n     return;\n   }\n   EE(b, a % b, co1, co2);\n   long long temp = co1;\n   co1 = co2;\n   co2 = temp - co2 * (a / b);\n }\n long long inverse(long long a, long long m) {\n   long long x, y;\n   EE(a, m, x, y);\n   if (x < 0) x += m;\n   return x;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> g[100500];\n int c[100500];\n int n;\n bool vis[100500];\n bool dfs(int u, int cu) {\n   if (vis[u]) return 0;\n   vis[u] = 1;\n   bool r = 0;\n   if (c[u] != cu) return 1;\n   for (int v : g[u]) r |= dfs(v, cu);\n   return r;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 0, qwe = n - 1; i < qwe; ++i) {\n     int u, v;\n     scanf('%d%d', &u, &v);\n     u--;\n     v--;\n     g[u].push_back(v);\n     g[v].push_back(u);\n   }\n   for (int i = 0, qwe = n; i < qwe; ++i) scanf('%d', c + i);\n   int u = -1, sz = 0;\n   for (int i = 0, qwe = n; i < qwe; ++i) {\n     set<int> s;\n     for (int v : g[i])\n       if (c[i] != c[v]) s.insert(v);\n     if (s.size() > sz) u = i, sz = s.size();\n   }\n   if (u == -1) {\n     puts('YES\n1');\n     return 0;\n   }\n   vis[u] = 1;\n   for (int i = 0, qwe = g[u].size(); i < qwe; ++i)\n     if (dfs(g[u][i], c[g[u][i]])) {\n       puts('NO');\n       return 0;\n     }\n   printf('YES\n%d\n', u + 1);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n int a[105][105];\n int main() {\n   scanf('%d %d', &n, &m);\n   if (n + m == 3 or n + m == 4)\n     printf('-1\n');\n   else {\n     int num = 2;\n     if (n >= m) {\n       for (int i = 1; i <= n; i++)\n         for (int j = 1; j <= m; j++) {\n           if (num > m * n) num = 1;\n           a[i][j] = num;\n           num += 2;\n         }\n     } else\n       for (int j = 1; j <= m; j++)\n         for (int i = 1; i <= n; i++) {\n           if (num > m * n) num = 1;\n           a[i][j] = num;\n           num += 2;\n         }\n     for (int i = 1; i <= n; i++)\n       for (int j = 1; j <= m; j++) {\n         printf('%d', a[i][j]);\n         if (j == m)\n           printf('\n');\n         else\n           printf(' ');\n       }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const inline int __GET_INT() {\n   int ret;\n   scanf('%d', &ret);\n   return ret;\n }\n const int maxn = 2002;\n int n, m;\n char grid[maxn][maxn];\n int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};\n int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};\n int cntStar(int r, int c) {\n   return (grid[r][c] == '*') + (grid[r + 1][c] == '*') +\n          (grid[r][c + 1] == '*') + (grid[r + 1][c + 1] == '*');\n }\n void dfs(int r, int c) {\n   if (r < 0 || c < 0 || (r + 1) >= n || (c + 1) >= m) {\n     return;\n   }\n   if (cntStar(r, c) != 1) {\n     return;\n   }\n   grid[r][c] = grid[r + 1][c] = grid[r][c + 1] = grid[r + 1][c + 1] = '.';\n   for (int i = 0; i < 2; ++i)\n     for (int j = 0; j < 2; ++j) {\n       for (int k = 0; k < 8; ++k) {\n         dfs(r + i + dx[k], c + j + dy[k]);\n       }\n     }\n }\n int main() {\n   n = __GET_INT();\n   m = __GET_INT();\n   for (int i = 0; i < n; ++i) {\n     scanf('%s', grid[i]);\n   }\n   for (int i = 0; (i + 1) < n; ++i)\n     for (int j = 0; (j + 1) < m; ++j) {\n       dfs(i, j);\n     }\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < m; ++j) printf('%c', grid[i][j]);\n     puts('');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long a[200005];\n int b[200005];\n int n, k, Q;\n long long ans;\n int l, r;\n int main() {\n   scanf('%d', &Q);\n   while (Q--) {\n     scanf('%d%d', &n, &k);\n     for (int i = 1; i <= n; i++) scanf('%lld', &a[i]);\n     for (int i = 1; i <= k; i++) scanf('%d', &b[i]);\n     sort(a + 1, a + 1 + n);\n     sort(b + 1, b + 1 + k);\n     int l, r;\n     ans = 0;\n     l = 1;\n     r = n;\n     for (int i = 1; i <= k; i++) {\n       if (b[i] == 1)\n         ans += a[r] + a[r];\n       else\n         break;\n       r--;\n     }\n     for (int i = k; i >= 1; i--) {\n       if (b[i] == 1) break;\n       ans += a[l] + a[r];\n       r--;\n       l += b[i] - 1;\n     }\n     printf('%lld\n', ans);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long max(long long a, long long b) {\n   if (a > b) return a;\n   return b;\n }\n long long min(long long a, long long b) {\n   if (a < b) return a;\n   return b;\n }\n const int MOD = 1e9 + 7, N = 102, L = 3005, INF = INT_MAX;\n pair<long long, long long> a[N];\n long long dp[L][N][2];\n int main() {\n   int n, l;\n   cin >> n >> l;\n   for (int i = 0; i < n; i++) {\n     cin >> a[i].first >> a[i].second;\n   }\n   for (int i = 1; i <= l; i++) {\n     for (int j = 0; j < n; j++) {\n       if (a[j].first == i)\n         dp[i][j][0] = 1;\n       else if (a[j].first < i) {\n         for (int c = 0; c < n; c++) {\n           if (c == j) continue;\n           if (a[c].second == a[j].first)\n             dp[i][j][0] += dp[i - a[j].first][c][0];\n           if (a[c].first == a[j].first && a[c].first != a[c].second)\n             dp[i][j][0] += dp[i - a[j].first][c][1];\n           dp[i][j][0] %= MOD;\n         }\n       }\n       if (a[j].second == i)\n         dp[i][j][1] = 1;\n       else if (a[j].second < i) {\n         for (int c = 0; c < n; c++) {\n           if (c == j) continue;\n           if (a[c].second == a[j].second)\n             dp[i][j][1] += dp[i - a[j].second][c][0];\n           if (a[c].first == a[j].second && a[c].first != a[c].second)\n             dp[i][j][1] += dp[i - a[j].second][c][1];\n           dp[i][j][1] %= MOD;\n         }\n       }\n     }\n   }\n   long long ans = 0;\n   for (int i = 0; i < n; i++) {\n     ans += dp[l][i][0];\n     if (a[i].first != a[i].second) ans += dp[l][i][1];\n     ans %= MOD;\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int M = 11, N = 2e5 + 5;\n int n, k;\n int a[N];\n map<int, int> rem[M];\n long long solve() {\n   long long ans = 0;\n   for (int i = 0; i < n; ++i) {\n     unsigned long long f = 10;\n     int ln = ((int)(to_string(a[i])).size());\n     for (int l = 1; l < M; ++l) {\n       int r = (k - (int)((f * a[i]) % k)) % k;\n       ans += rem[l][r];\n       if (l == ln && r == a[i] % k) ans--;\n       f *= 10;\n     }\n   }\n   return ans;\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   cin >> n >> k;\n   for (int i = 0; i < n; ++i) {\n     cin >> a[i];\n     int l = ((int)(to_string(a[i])).size());\n     rem[l][a[i] % k]++;\n   }\n   cout << solve() << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long n, k, x;\n   cin >> n;\n   for (long long i = 0; i < n; i++) {\n     cin >> k >> x;\n     cout << x + (k - 1) * 9 << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 5e5 + 5;\n int main() {\n   long long v, w1, w2, v1, v2;\n   cin >> v >> w1 >> w2 >> v1 >> v2;\n   long long x = max(v1, v2);\n   if (x * x >= v) {\n     if (v1 < v2) swap(v1, v2), swap(w1, w2);\n     long long ans = 0;\n     for (int i = 0; i <= v / v1; i++) {\n       ans = max(ans, i * w1 + (v - i * v1) / v2 * w2);\n     }\n     cout << ans << endl;\n   } else {\n     if (1.0 * w1 / v1 > 1.0 * w2 / v2) {\n       swap(v1, v2), swap(w1, w2);\n     }\n     long long ans = 0;\n     for (int i = 0; i < v2; i++) {\n       ans = max(ans, i * w1 + (v - i * v1) / v2 * w2);\n     }\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int mod = 1000000007;\n const int inf = 1000000009;\n const long long INF = 1000000000000000009;\n const long long big = 1000000000000000;\n const long double eps = 0.000000000000000000001;\n using namespace std;\n const int M = 100000;\n int W[M + 5], U[M + 5], cnt[M + 5];\n vector<int> D[M + 5], S;\n long long int funkcja(int x) {\n   long long int wynik = 0;\n   for (auto v : D[x]) wynik += cnt[v] * U[v];\n   return wynik;\n }\n void aktualizuj(int x, int c) {\n   for (auto v : D[x]) cnt[v] += c;\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie();\n   cout.tie();\n   int n;\n   cin >> n;\n   for (int i = 1; i <= M; i++) {\n     for (int j = i; j <= M; j += i) D[j].push_back(i);\n     if (i == 1)\n       U[i] = 1;\n     else if ((i / D[i][1]) % D[i][1] == 0)\n       U[i] = 0;\n     else\n       U[i] = -U[i / D[i][1]];\n   }\n   long long int wynik = 0;\n   for (int i = 1; i <= n; i++) {\n     int a;\n     cin >> a;\n     wynik = max(wynik, (long long int)a);\n     for (auto v : D[a]) W[v] = 1;\n   }\n   for (int j = M; j >= 1; j--) {\n     if (!W[j]) continue;\n     while (funkcja(j)) {\n       wynik = max(wynik, (long long int)j * S.back());\n       aktualizuj(S.back(), -1);\n       S.pop_back();\n     }\n     aktualizuj(j, 1);\n     S.push_back(j);\n   }\n   cout << wynik;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a, b, sum, x;\n int main() {\n   cin >> a >> b;\n   while (a) {\n     sum += a;\n     x += a % b;\n     a /= b;\n     a += x / b;\n     x %= b;\n   }\n   cout << sum;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, arr[500010], temp, j, i, ans;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   cin >> n;\n   for (long long i = 0; i < n; i++) {\n     cin >> arr[i];\n   };\n   sort(arr, arr + n);\n   i = 0, j = n / 2;\n   ans = n;\n   while (i < n / 2) {\n     while (j < n) {\n       if (arr[i] * 2 <= arr[j]) {\n         ans--;\n         j++;\n         break;\n       } else\n         j++;\n     }\n     i++;\n   }\n   cout << ans << '\n';\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int l[210000], r[210000];\n vector<pair<int, int> > v;\n int n, m, k;\n int mp[1000];\n int lbit[1000];\n int dp[210000][300];\n int msk[210000];\n int main() {\n   for (int i = 0; i < 210000; i++)\n     for (int j = 0; j < 300; j++) dp[i][j] = -0x3f3f3f3f;\n   dp[0][0] = 0;\n   for (int i = 0; i < (1 << 9); i++) {\n     int cnt = 0;\n     for (int j = 0; j < 8; j++)\n       if (i & (1 << j)) {\n         mp[i]++;\n       } else if (lbit[i] == 0) {\n         lbit[i] = (1 << j);\n       }\n   }\n   cin >> n >> m >> k;\n   for (int i = 1; i <= n; i++) {\n     scanf('%d%d', &l[i], &r[i]);\n     v.push_back({l[i] - 1, i});\n     v.push_back({r[i], -i});\n   }\n   sort(v.begin(), v.end());\n   int tim = 0;\n   int posmsk = 0;\n   int ans = 0;\n   int lst = 0;\n   for (auto p : v) {\n     tim++;\n     if (p.second < 0) {\n       for (int j = 0; j < (1 << 8); j++)\n         if (j & msk[-p.second])\n           dp[tim][j ^ msk[-p.second]] =\n               max(dp[tim][j ^ msk[-p.second]],\n                   dp[tim - 1][j] + max(0, p.first - lst) * (mp[j] & 1));\n         else {\n           dp[tim][j] =\n               max(dp[tim][j], dp[tim - 1][j] + (p.first - lst) * (mp[j] & 1));\n         }\n       posmsk ^= msk[-p.second];\n     } else {\n       msk[p.second] = lbit[posmsk];\n       posmsk ^= msk[p.second];\n       for (int j = 0; j < (1 << 8); j++)\n         if ((j & msk[p.second]) == 0) {\n           dp[tim][j ^ msk[p.second]] =\n               max(dp[tim][j ^ msk[p.second]],\n                   dp[tim - 1][j] + (max(0, p.first - lst)) * (mp[j] & 1));\n           dp[tim][j] =\n               max(dp[tim][j], dp[tim - 1][j] + (p.first - lst) * (mp[j] & 1));\n         }\n     }\n     lst = p.first;\n   }\n   cout << dp[2 * n][0];\n   return ~~(0 ^ 0 ^ 0);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 998244353;\n const int N = 3005;\n int n, c, a[N], dp[N][N], g[N][N], freq[N], mul[N], imul[N], pw[N], cnt[N];\n int dp2[2][N][1 << 12];\n int inverse(int n) {\n   if (n == 1) return 1;\n   return inverse(mod % n) * 1LL * (mod - mod / n) % mod;\n }\n inline void add(int &x, int y) {\n   x += y;\n   if (x >= mod) x -= mod;\n }\n void solve1() {\n   for (int i = 1; i <= n; i++) {\n     a[i]--;\n   }\n   memset(dp2, 0, sizeof(dp2));\n   int flg = 0;\n   dp2[0][0][0] = 1;\n   for (int i = 1; i <= n; i++) {\n     for (int p = 0; p * c <= i; p++) {\n       for (int mask = 0; mask < (1 << c); mask++) {\n         dp2[flg ^ 1][p][mask] = 0;\n       }\n     }\n     for (int p = 0; p * c <= i; p++) {\n       for (int mask = 0; mask + 1 < (1 << c); mask++) {\n         int nmask = mask | (1 << a[i]);\n         if (nmask + 1 == (1 << c)) {\n           add(dp2[flg ^ 1][p + 1][0], dp2[flg][p][mask]);\n         } else {\n           add(dp2[flg ^ 1][p][nmask], dp2[flg][p][mask]);\n         }\n         add(dp2[flg ^ 1][p][mask], dp2[flg][p][mask]);\n       }\n     }\n     flg ^= 1;\n   }\n   memset(cnt, 0, sizeof(cnt));\n   for (int p = 0; p <= n; p++) {\n     for (int mask = 0; mask + 1 < (1 << c); mask++) {\n       add(cnt[p], dp2[flg][p][mask]);\n     }\n   }\n   add(cnt[0], mod - 1);\n   for (int i = 0; i <= n; i++) {\n     cout << cnt[i] << ' ';\n   }\n   cout << '\n';\n }\n void solve2() {\n   mul[0] = 0;\n   pw[0] = 1;\n   for (int i = 1; i <= n; i++) {\n     mul[i] = mul[i - 1] + mul[i - 1] + 1;\n     if (mul[i] >= mod) mul[i] -= mod;\n     imul[i] = inverse(mul[i]);\n     pw[i] = mul[i] + 1;\n   }\n   memset(g, 0, sizeof(g));\n   for (int i = 1; i <= n; i++) {\n     int cnt = 0;\n     long long prd = 1;\n     memset(freq, 0, sizeof(freq));\n     for (int j = i; j <= n; j++) {\n       if (freq[a[j]] == 0) {\n         cnt++;\n       } else {\n         (prd *= imul[freq[a[j]]]) %= mod;\n       }\n       freq[a[j]]++;\n       (prd *= mul[freq[a[j]]]) %= mod;\n       if (cnt == c) {\n         g[i][j] = prd * imul[freq[a[j]]] % mod;\n       }\n     }\n   }\n   memset(dp, 0, sizeof(dp));\n   for (int i = 1; i <= n; i++) {\n     dp[i][1] = g[1][i];\n     for (int j = 1; j <= i; j++) {\n       for (int p = 2; p * c <= i; p++) {\n         dp[i][p] += dp[j - 1][p - 1] * 1LL * g[j][i] % mod;\n         if (dp[i][p] >= mod) dp[i][p] -= mod;\n       }\n     }\n   }\n   memset(cnt, 0, sizeof(cnt));\n   for (int i = 1; i <= n; i++) {\n     for (int p = 1; p * c <= i; p++) {\n       cnt[p] += dp[i][p] * 1LL * pw[n - i] % mod;\n       if (cnt[p] >= mod) cnt[p] -= mod;\n     }\n   }\n   cnt[0] = mul[n] + mod - cnt[1];\n   if (cnt[0] >= mod) cnt[0] -= mod;\n   for (int p = 1; p <= n; p++) {\n     cnt[p] += mod - cnt[p + 1];\n     if (cnt[p] >= mod) cnt[p] -= mod;\n   }\n   for (int i = 0; i <= n; i++) {\n     cout << cnt[i] << ' ';\n   }\n   cout << '\n';\n }\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cin >> n >> c;\n   for (int i = 1; i <= n; i++) {\n     cin >> a[i];\n   }\n   if (c <= 10) {\n     solve1();\n   } else {\n     solve2();\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int ans[101000], mark[101000];\n char s[101000];\n int n, top, now, n_;\n int main() {\n   do s[++n_] = getchar();\n   while (s[n_] != '=');\n   scanf('%d', &n);\n   mark[1] = 0;\n   top = 1;\n   for (int i = 3; i < n_; i += 4) mark[++top] = (s[i] == '-');\n   now = 0;\n   for (int i = 1; i <= top; i++) ans[i] = 1;\n   for (int i = 1; i <= top; i++)\n     if (mark[i])\n       now--;\n     else\n       now++;\n   while (now != n) {\n     if (now < n) {\n       int q = 0;\n       for (int i = 1; i <= top; i++)\n         if (!mark[i] && ans[i] < n) {\n           q = i;\n           break;\n         }\n       if (!q) {\n         printf('Impossible');\n         return 0;\n       }\n       int inc = min(n - ans[q], n - now);\n       ans[q] += inc;\n       now += inc;\n     } else {\n       int q = 0;\n       for (int i = 1; i <= top; i++)\n         if (mark[i] && ans[i] < n) {\n           q = i;\n           break;\n         }\n       if (!q) {\n         printf('Impossible');\n         return 0;\n       }\n       int inc = min(n - ans[q], now - n);\n       ans[q] += inc;\n       now -= inc;\n     }\n   }\n   printf('Possible\n');\n   printf('%d', ans[1]);\n   for (int i = 2; i <= top; i++) {\n     putchar(' ');\n     if (mark[i])\n       putchar('-');\n     else\n       putchar('+');\n     putchar(' ');\n     printf('%d', ans[i]);\n   }\n   printf(' = %d', n);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mod = 1e9 + 7;\n const int maxn = 4e5 + 5;\n long long a[maxn], f[maxn], d[maxn];\n int q[maxn];\n int main() {\n   int n, i, j, l, r;\n   long long c;\n   scanf('%d%lld', &n, &c);\n   for (i = 1; i < (n << 1); i++) {\n     scanf('%lld', &a[i]);\n     a[i] += a[i - 1];\n   }\n   l = r = 1;\n   j = q[1] = 0;\n   for (i = 1; i <= n; i++) {\n     while (j < i && a[(i << 1) - 1] - a[j << 1] > c) j++;\n     while (l <= r && q[l] < j) l++;\n     if (j) f[i] = f[j - 1] + c;\n     if (l <= r) f[i] = max(f[i], d[q[l]] + a[(i << 1) - 1]);\n     d[i] = f[i] - a[i << 1];\n     while (l <= r && d[i] > d[q[r]]) r--;\n     q[++r] = i;\n   }\n   printf('%lld\n', f[n]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n template <typename T>\n std::istream& operator>>(std::istream& input, std::vector<T>& v) {\n   for (T& a : v) input >> a;\n   return input;\n }\n void answer(bool v) {\n   constexpr const char* s[2] = {'NO', 'YES'};\n   std::cout << s[v] << '\n';\n }\n void solve(const std::vector<unsigned>& a) {\n   const size_t n = a.size();\n   for (size_t i = 1; i < n; ++i) {\n     if (a[i] >= a[i - 1]) return answer(true);\n   }\n   answer(false);\n }\n void test_case() {\n   size_t n;\n   std::cin >> n;\n   std::vector<unsigned> a(n);\n   std::cin >> a;\n   solve(a);\n }\n int main() {\n   size_t t;\n   std::cin >> t;\n   while (t-- > 0) test_case();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void __print(int x) { cerr << x; };\n void __print(long x) { cerr << x; };\n void __print(long long x) { cerr << x; };\n void __print(unsigned x) { cerr << x; };\n void __print(unsigned long x) { cerr << x; };\n void __print(unsigned long long x) { cerr << x; };\n void __print(float x) { cerr << x; };\n void __print(double x) { cerr << x; };\n void __print(long double x) { cerr << x; };\n void __print(char x) { cerr << '\'' << x << '\''; };\n void __print(const char *x) { cerr << '\'' << x << '\''; };\n void __print(const string &x) { cerr << '\'' << x << '\''; };\n void __print(bool x) { cerr << (x ? 'true' : 'false'); }\n long long powmod(long long a, long long b) {\n   long long res = 1;\n   a %= 1000000007;\n   assert(b >= 0);\n   for (; b; b >>= 1) {\n     if (b & 1) res = res * a % 1000000007;\n     a = a * a % 1000000007;\n   }\n   return res;\n }\n long long string_to_int(string s) {\n   long long ans = 0;\n   long long p = 1;\n   for (long long i = s.size() - 1; i >= 0; i--) {\n     ans += (s[i] - '0') * p;\n     p *= 10;\n   }\n   return ans;\n }\n long long fast_pow(long long a, long long b) {\n   if (b == 1) return a;\n   if (b == 0) return 1;\n   long long x = fast_pow(a, b / 2);\n   x *= x;\n   if (b & 1) x *= a;\n   return x;\n }\n template <typename T, typename V>\n void __print(const pair<T, V> &x) {\n   cerr << '{';\n   __print(x.first);\n   cerr << ',';\n   __print(x.second);\n   cerr << '}';\n }\n template <typename T>\n void __print(const T &x) {\n   long long f = 0;\n   cerr << '{';\n   for (auto &i : x) cerr << (f++ ? ',' : ''), __print(i);\n   cerr << '}';\n }\n void _print() { cerr << ']\n'; }\n template <typename T, typename... V>\n void _print(T t, V... v) {\n   __print(t);\n   if (sizeof...(v)) cerr << ', ';\n   _print(v...);\n }\n void t_c_c() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, m, k;\n   cin >> n >> m >> k;\n   long long arr[m];\n   for (long long i = 0; i < m; i++) {\n     cin >> arr[i];\n   }\n   long long days = 0;\n   long long pages = k;\n   long long point = 0;\n   long long x = 0;\n   long long xx = 0;\n   for (long long i = 0; i < m;) {\n     if (arr[i] - x <= pages) {\n       while (arr[i] - xx <= pages) {\n         ;\n         x++;\n         i++;\n       }\n       xx = x;\n       days++;\n     } else {\n       long long factor = ((arr[i] - x) - pages) / k;\n       pages +=\n           (((arr[i] - x) - pages) % k == 0 ? factor * k : (factor + 1) * k);\n     }\n   }\n   cout << days << '\n';\n }\n int32_t main() {\n   t_c_c();\n   return 0;\n }\n "}
+{"func_code_string": "/**\n  *    author:  Ujjwal Tripathi\n  *    created: 15.04.2021 18:04:04\n **/\n  \n     \n #include<bits/stdc++.h>\n using namespace std;\n  \n #define ar array<ll, 2>\n #define ll long long\n #define in insert\n #define pb push_back\n #define pii pair<ll,ll>\n #define vt vector\n #define P_Q(x) priority_queue<x>\n #define p_q(x) priority_queue<x, vector<x>, greater<x>>\n #define For(i, n) for(ll i = 0; i < n; i++)\n #define Rev(i, n) for(ll i = n-1; i >= 0; i--)\n #define FOR(i, n) for(ll i = 1; i <= n; i++)\n #define REV(i, n) for(ll i = n; i >= 1; i--)\n #define Rep(i,a,b) for(ll i = a; i <= b; i++)\n #define all(x) (x).begin(),(x).end()\n #define rall(x) (x).rbegin(), (x).rend()\n #define sz(x) (int) (x).size()\n  \n // Maximum priority queue\n template <typename T>\n using mxpq = priority_queue<T>;\n  \n // Minimum priority queue\n template <typename T>\n using mnpq = priority_queue<T, vt<T>, greater<T>>;\n  \n  \n // x | (x + 1) sets lowest unset bit of x\n // x & (x - 1) unsets lowest set bit of x\n  \n const ll mod = 1e9L + 7;\n const ll INF = 1e18L + 5;\n const ll mxN = 2e5 + 1;\n  \n  \n ll n;\n ll dp[1000004];\n // remember to read no of test_cases\n void solve()\n {\n    cin>>n;\n    vt<ll> v(n);\n    For(i,n)\n    {\n     cin>>v[i];\n     if(v[i]%2==0)\n     {\n         cout<<v[i]<<' ';\n     }\n    }\n  \n     For(i,n)\n     {\n       if(v[i]%2==1)\n       {\n         cout<<v[i]<<' ';\n       }\n     }\n     cout<<endl;\n }\n  \n int main()\n {\n   ios::sync_with_stdio(0);  cin.tie(0);\n   ll t = 1;\n   cin >> t;\n   FOR(tt, t) solve();\n   return 0;\n }\n  "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[200010], b[200010], n, cnt = 0;\n int main() {\n   ios::sync_with_stdio(0);\n   cin >> n;\n   for (int i = 2; i <= n; i++) cin >> a[i];\n   for (int tmp = n; tmp; tmp = a[tmp]) b[++cnt] = tmp;\n   reverse(b + 1, b + cnt + 1);\n   for (int i = 1; i <= cnt; i++) cout << b[i] << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   cin.tie(0);\n   cin.sync_with_stdio(0);\n   int t;\n   long long n;\n   cin >> t;\n   for (int i = 0; i < t; i++) {\n     cin >> n;\n     cout << (-1 * n) + 1 << ' ' << n << '\n';\n   }\n }\n bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {\n   return (a.second < b.second);\n }\n bool sort_descending(int a, int b) { return (a > b); }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int seed = 131;\n const long long LLMAX = 2e18;\n const int MOD = 1e9 + 7;\n const double eps = 1e-8;\n const int MAXN = 1e5 + 10;\n const int hmod1 = 0x48E2DCE7;\n const int hmod2 = 0x60000005;\n inline long long sqr(long long x) { return x * x; }\n inline int sqr(int x) { return x * x; }\n inline double sqr(double x) { return x * x; }\n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }\n long long exgcd(long long a, long long b, long long &x, long long &y) {\n   long long d;\n   (b == 0 ? (x = 1, y = 0, d = a)\n           : (d = exgcd(b, a % b, y, x), y -= a / b * x));\n   return d;\n }\n long long qpow(long long a, long long n) {\n   long long sum = 1;\n   while (n) {\n     if (n & 1) sum = sum * a % MOD;\n     a = a * a % MOD;\n     n >>= 1;\n   }\n   return sum;\n }\n inline int dcmp(double x) {\n   if (fabs(x) < eps) return 0;\n   return (x > 0 ? 1 : -1);\n }\n long long need[MAXN], tim[MAXN], v[MAXN][2], cnt = 0;\n struct node {\n   long long id, a, b;\n   node() {}\n   node(long long x, long long y, long long z) { id = x, a = y, b = z; }\n   bool operator<(const node &n) const {\n     if (a - b == n.a - n.b) return a > n.a;\n     return a - b > n.a - n.b;\n   }\n } in[MAXN];\n long long check(long long n, long long a, long long b) {\n   long long sum = 0;\n   for (int i = 0; i <= n; i++) tim[i] = need[i];\n   for (int i = 0; i < cnt; i++) {\n     if (tim[in[i].id]) {\n       long long minn = min(tim[in[i].id], a);\n       sum += in[i].a * minn;\n       tim[in[i].id] -= minn;\n       a -= minn;\n     }\n     if (tim[in[i].id]) {\n       long long minn = min(tim[in[i].id], b);\n       sum += in[i].b * minn;\n       tim[in[i].id] -= minn;\n       b -= minn;\n     }\n   }\n   return sum;\n }\n int main(void) {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, s, sum = 0, ans = 0;\n   cin >> n >> s;\n   for (int i = 0; i < n; i++) {\n     cin >> need[i] >> v[i][0] >> v[i][1];\n     sum += need[i];\n     in[cnt++] = node(i, v[i][0], v[i][1]);\n   }\n   long long all = (sum + s - 1) / s, l = 0, r = all;\n   need[n] = all * s - sum;\n   in[cnt++] = node(n, 0, 0);\n   sort(in, in + cnt);\n   while (l + 3 < r) {\n     long long m1 = (l + r) / 2, m2 = (m1 + r) / 2;\n     if (check(n, m1 * s, (all - m1) * s) > check(n, m2 * s, (all - m2) * s))\n       r = m2;\n     else\n       l = m1;\n   }\n   for (long long i = l; i <= r; i++)\n     ans = max(ans, check(n, i * s, (all - i) * s));\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long poww(long long a, long long b, long long md) {\n   return (!b ? 1\n              : (b & 1 ? a * poww(a * a % md, b / 2, md) % md\n                       : poww(a * a % md, b / 2, md) % md));\n }\n const long long MAXN = 1e6 + 10;\n const long long INF = 8e18;\n const long long MOD = 1e9 + 7;\n vector<pair<pair<long long, long long>, int>> v;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int t;\n   cin >> t;\n   while (t--) {\n     v.clear();\n     int n;\n     cin >> n;\n     n = n * 2 - 1;\n     v.resize(n);\n     for (int i = 0; i < n; i++)\n       cin >> v[i].first.first >> v[i].first.second, v[i].second = i + 1;\n     sort((v).begin(), (v).end(),\n          greater<pair<pair<long long, long long>, int>>());\n     vector<int> ans = {v.front().second};\n     for (int i = 1; i < n; i += 2) {\n       if (v[i].first.second < v[i + 1].first.second)\n         ans.push_back(v[i + 1].second);\n       else\n         ans.push_back(v[i].second);\n     }\n     sort((ans).begin(), (ans).end());\n     cout << 'YES' << '\n';\n     for (int e : ans) cout << e << ' ';\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   long long int t, x, sum = 0, y, z, flag = 0, a, p, l, r, b, c, q, i, j, k, n,\n                       m, maxi = LONG_MIN, mini = LONG_MAX, mul = 1;\n   string s, s1;\n   vector<long long int> v, va, vb;\n   map<long long int, long long int> mp, mp1;\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> x;\n     mp[x]++;\n     mp1[x]++;\n   }\n   auto it = mp.begin();\n   auto it1 = mp1.begin();\n   while (it1 != mp1.end()) {\n     if (it->first == it1->first) it1++;\n     if (it1 == mp1.end()) break;\n     x = it->second;\n     y = it1->second;\n     for (i = 0; i < x && i < y; i++) {\n       mp[it->first]--;\n       sum++;\n       mp1[it1->first]--;\n     }\n     if (x == i) it++;\n     if (y == i) it1++;\n   }\n   cout << sum << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct ele {\n   long long next, prev, delta, y;\n };\n long long r, c, k, n, curcnt = 0, ans = 0;\n vector<ele> a;\n vector<long long> deltaleft, deltaright;\n vector<vector<long long> > X, id;\n vector<pair<long long, long long> > tmp;\n void init() {\n   X.clear();\n   X.resize(r + 1);\n   id.resize(r + 1);\n }\n void remove(long long id) {\n   long long cur = id;\n   deltaleft.clear();\n   deltaright.clear();\n   for (long long i = 0; i <= k; i++) {\n     if (cur == -1 || a[cur].delta == -1) break;\n     deltaleft.push_back(a[cur].delta);\n     cur = a[cur].prev;\n   }\n   cur = a[id].next;\n   for (long long i = 0; i <= k; i++) {\n     if (cur == -1 || a[cur].delta == -1) break;\n     deltaright.push_back(a[cur].delta);\n     cur = a[cur].next;\n   }\n   curcnt -= deltaright[0] * deltaleft[0];\n   curcnt -= deltaright[0] * (deltaright[0] - 1) / 2 +\n             deltaleft[0] * (deltaleft[0] - 1) / 2;\n   curcnt +=\n       (deltaright[0] + deltaleft[0]) * (deltaright[0] + deltaleft[0] - 1) / 2;\n   for (long long i = 0; i <= k; i++) {\n     if (i < deltaleft.size() && k - i < deltaright.size())\n       curcnt += deltaleft[i] * deltaright[k - i];\n   }\n   a[a[id].prev].next = a[id].next;\n   a[a[id].next].prev = a[id].prev;\n   a[a[id].next].delta += a[id].delta;\n }\n long long cmp(pair<long long, long long> a, pair<long long, long long> b) {\n   return X[a.first][a.second] < X[b.first][b.second];\n }\n void solve(long long r1) {\n   tmp.clear();\n   for (long long i = r1; i <= r; i++) {\n     for (long long j = 0; j < X[i].size(); j++) {\n       tmp.push_back({i, j});\n     }\n   }\n   sort(tmp.begin(), tmp.end(), cmp);\n   a.resize(tmp.size() + 2);\n   a[0].prev = -1;\n   a[0].next = 1;\n   a[0].y = 0;\n   a[tmp.size() + 1].prev = (long long)tmp.size();\n   a[tmp.size() + 1].next = -1;\n   a[tmp.size() + 1].y = c + 1;\n   for (long long i = 0; i < tmp.size(); i++) {\n     id[tmp[i].first][tmp[i].second] = i + 1;\n     a[i + 1].y = X[tmp[i].first][tmp[i].second];\n     a[i + 1].prev = i;\n     a[i + 1].next = i + 2;\n   }\n   a[0].delta = -1;\n   for (long long i = 1; i < a.size(); i++) {\n     a[i].delta = a[i].y - a[i - 1].y;\n   }\n   curcnt = 0;\n   for (long long i = 1; i < a.size(); i++) {\n     curcnt += (a[i].delta - 1) * a[i].delta / 2;\n     for (long long j = 1; j <= k; j++) {\n       if (i - j <= 0) break;\n       curcnt += a[i].delta * a[i - j].delta;\n     }\n   }\n   for (long long i = r; i >= r1; i--) {\n     ans += curcnt;\n     for (long long j = 0; j < X[i].size(); j++) {\n       remove(id[i][j]);\n     }\n   }\n }\n signed main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> r >> c >> n >> k;\n   k--;\n   init();\n   for (long long i = 1; i <= n; i++) {\n     long long u, v;\n     cin >> u >> v;\n     X[u].push_back(v);\n   }\n   for (long long i = 1; i <= r; i++) {\n     id[i].resize(X[i].size());\n   }\n   for (long long i = 1; i <= r; i++) {\n     solve(i);\n   }\n   ans = (r + 1) * r / 2 * (c + 1) * c / 2 - ans;\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 300007;\n struct tup {\n   int u, v, pos;\n   friend bool operator<(tup x, tup y) {\n     if (x.v < y.v) {\n       return 1;\n     }\n     return 0;\n   }\n } ans[maxn];\n int rec[maxn], n;\n int solve() {\n   int cnt = 0;\n   rec[cnt++] = n;\n   ans[n].v = 2 * n + 1;\n   for (int i = n - 1; i >= 0; --i) {\n     if (ans[i].u < ans[rec[cnt - 1]].v && ans[i].u < ans[i].v) {\n       rec[cnt++] = i;\n     }\n   }\n   return cnt;\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i < n; ++i) {\n     scanf('%d%d', &ans[i].u, &ans[i].v);\n     ans[i].pos = i;\n   }\n   sort(ans, ans + n);\n   int cnt1 = solve() - 1;\n   int tmp[maxn];\n   for (int i = 1; i <= cnt1; ++i) {\n     tmp[i] = ans[rec[i]].pos + 1;\n   }\n   for (int i = 0; i < n; ++i) {\n     ans[i].u = -ans[i].u;\n     ans[i].v = -ans[i].v;\n   }\n   sort(ans, ans + n);\n   int cnt = solve() - 1;\n   if (cnt <= cnt1) {\n     printf('%d\n', cnt1);\n     for (int i = 1; i <= cnt1; ++i) {\n       printf('%d ', tmp[i]);\n     }\n   } else {\n     printf('%d\n', cnt);\n     for (int i = 1; i <= cnt; ++i) {\n       printf('%d ', ans[rec[i]].pos + 1);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main(int argc, char const *argv[]) {\n   int n, q, counts = 0;\n   cin >> n;\n   int s[n];\n   for (int i = 0; i < n; i++) cin >> s[i];\n   cin >> q;\n   int l[q], r[q];\n   for (int i = 0; i < q; i++) cin >> l[i] >> r[i];\n   int sums[n + 1];\n   sums[0] = 0;\n   for (int i = 1; i < n + 1; i++) sums[i] = sums[i - 1] + s[i - 1];\n   for (int i = 0; i < q; i++)\n     cout << (sums[r[i]] - sums[l[i] - 1]) / 10 << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 7;\n const int M = 107;\n const int inf = 1e9 + 7;\n vector<int> g[N], a[M];\n int w[N][M], d[N];\n void bfs(int u) {\n   queue<int> q;\n   memset(d, inf, sizeof(d));\n   for (int i = 0; i < (int)a[u].size(); ++i) {\n     q.push(a[u][i]);\n     d[a[u][i]] = 0;\n   }\n   while (!q.empty()) {\n     int v = q.front();\n     q.pop();\n     w[v][u] = d[v];\n     for (int i = 0; i < (int)g[v].size(); ++i) {\n       int to = g[v][i];\n       if (d[to] > d[v] + 1) {\n         d[to] = d[v] + 1;\n         q.push(to);\n       }\n     }\n   }\n }\n int main() {\n   int n, m, k, second;\n   scanf('%d %d %d %d', &n, &m, &k, &second);\n   for (int i = 1, x; i <= n; ++i) {\n     scanf('%d', &x);\n     a[x].push_back(i);\n   }\n   for (int i = 0, u, v; i < m; ++i) {\n     scanf('%d %d', &u, &v);\n     g[u].push_back(v);\n     g[v].push_back(u);\n   }\n   for (int i = 1; i <= k; ++i) bfs(i);\n   for (int i = 1; i <= n; ++i) {\n     sort(w[i] + 1, w[i] + k + 1);\n     int ans = 0;\n     for (int j = 1; j <= second; ++j) ans += w[i][j];\n     printf('%d ', ans);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t, n, m, x;\n   unordered_map<int, int> mp;\n   cin >> t;\n   int a[t];\n   for (int i = 1; i <= t; i++) {\n     cin >> a[i];\n     mp[i] = a[i];\n   }\n   for (int i = 1; i <= t; i++) {\n     n = mp[i];\n     m = mp[n];\n     x = mp[m];\n     if (i == x) {\n       cout << 'YES';\n       return 0;\n     }\n   }\n   cout << 'NO' << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxN = 23;\n const int mod = 1000 * 1000 * 1000 + 7;\n int dp[2][1 << maxN];\n int a[maxN];\n int res[maxN][maxN];\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> a[i];\n   dp[0][1] = 1;\n   dp[0][0] = mod;\n   memset(res, -1, sizeof res);\n   for (int i = 0; i < n; i++)\n     for (int j = 0; j < i; j++)\n       for (int k = 0; k < i; k++)\n         if (a[j] + a[k] == a[i]) res[i][j] = k;\n   for (int i = 1; i < n; i++) {\n     int u = i & 1;\n     for (int mask = 0; mask < (1 << (i + 1)); mask++) dp[u][mask] = mod;\n     for (int mask = 0; mask < (1 << i); mask++) {\n       for (int j = 0; j < i; j++) {\n         if (res[i][j] == -1) continue;\n         if (mask >> j & 1)\n           if (mask >> res[i][j] & 1) {\n             int tmp = mask ^ (1 << i);\n             dp[u][tmp] =\n                 min(dp[u][tmp], max(__builtin_popcount(tmp), dp[!u][mask]));\n             for (int k = 0; k < i; k++) {\n               if (mask >> k & 1) {\n                 dp[u][tmp ^ (1 << k)] =\n                     min(dp[u][tmp ^ (1 << k)], dp[!u][mask]);\n               }\n             }\n             break;\n           }\n       }\n     }\n   }\n   int ans = mod;\n   for (int mask = 0; mask < (1 << n); mask++)\n     ans = min(ans, dp[(n - 1) & 1][mask]);\n   if (ans == mod)\n     cout << -1 << endl;\n   else\n     cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<pair<int, int> > 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n template <class T>\n inline T gcd(T a, T b) {\n   return b ? gcd(b, a % b) : a;\n }\n template <class T>\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<int> 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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n string op;\n bool check(int l, int r) {\n   char c;\n   cout << '? ' << l << ' ' << r << endl;\n   cin >> c;\n   return c == 'x';\n }\n int main() {\n   while (cin >> op) {\n     if (op == 'end') {\n       return 0;\n     }\n     int l = 1, r = 2;\n     while (1) {\n       if (check(l, r)) break;\n       l <<= 1, r <<= 1;\n     }\n     while (l + 1 < r) {\n       int mid = (l + r) >> 1;\n       if (check(l - 1, mid))\n         r = mid;\n       else\n         l = mid + 1;\n     }\n     if (l == 1 && r == 2) {\n       if (check(2, 3))\n         cout << '! 1' << endl;\n       else\n         cout << '! 2' << endl;\n     } else {\n       if (l == r)\n         cout << '! ' << l << endl;\n       else {\n         if (check(l, l + 1))\n           cout << '! ' << l + 1 << endl;\n         else\n           cout << '! ' << l << endl;\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, k, a[1000005];\n long long l;\n vector<int> val, cou, dp[1000005];\n void add(int &a, int b) {\n   a += b;\n   if (a >= 1000000007) a -= 1000000007;\n }\n void setup() {\n   cin >> n >> l >> k;\n   for (int i = 0; i <= n - 1; i++) {\n     cin >> a[i];\n     val.push_back(a[i]);\n   }\n   sort(val.begin(), val.end());\n   val.resize(unique(val.begin(), val.end()) - val.begin());\n   cou.resize(val.size());\n   for (int i = 0; i <= n - 1; i++) {\n     dp[i].resize(k + 1);\n     dp[i][1] = 1;\n     a[i] = lower_bound(val.begin(), val.end(), a[i]) - val.begin();\n   }\n }\n void xuly() {\n   for (int j = 2; j <= k; j++) {\n     for (int i = 0; i <= int(cou.size()) - 1; i++) cou[i] = 0;\n     for (int i = 0; i <= n - 1; i++) add(cou[a[i]], dp[i][j - 1]);\n     for (int i = 1; i <= int(cou.size()) - 1; i++) add(cou[i], cou[i - 1]);\n     for (int i = 0; i <= n - 1; i++) dp[i][j] = cou[a[i]];\n   }\n   int ans = 0;\n   for (int i = 0; i <= n - 1; i++)\n     for (int j = 1; j <= k; j++) {\n       long long m = l / n;\n       if (i < l % n) m++;\n       m = m - j + 1;\n       if (m > 0) ans = (ans + (m % 1000000007) * dp[i][j]) % 1000000007;\n     }\n   cout << ans;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   setup();\n   xuly();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = 500005;\n int to[N << 1], edge, Next[N << 1], last[N], n, x, y, d[N], mx1[N], mx2[N];\n int f[N], fmx[N], ans1, mx[N], f0[N], f1[N], sum[N];\n std::vector<int> e[N];\n void upd(int &x, int y) {\n   if (y > x) x = y;\n }\n void add(int x, int y) {\n   to[++edge] = y;\n   Next[edge] = last[x];\n   last[x] = edge;\n }\n void dfs1(int x, int y) {\n   f[x] = y;\n   for (int i = last[x]; i; i = Next[i]) {\n     int u = to[i];\n     if (u == y) continue;\n     dfs1(u, x);\n     if (mx1[u] + 1 > mx1[x])\n       mx2[x] = mx1[x], mx1[x] = mx1[u] + 1;\n     else if (mx1[u] + 1 > mx2[x])\n       mx2[x] = mx1[u] + 1;\n   }\n }\n void dfs2(int x, int y) {\n   if (y) e[fmx[x]].push_back(x);\n   for (int i = last[x]; i; i = Next[i]) {\n     int u = to[i];\n     if (u == y) continue;\n     if (mx1[x] == mx1[u] + 1)\n       fmx[u] = std::max(mx2[x], fmx[x]) + 1;\n     else\n       fmx[u] = std::max(mx1[x], fmx[x]) + 1;\n     e[mx1[u] + 1].push_back(x);\n   }\n   for (int i = last[x]; i; i = Next[i])\n     if (to[i] != y) dfs2(to[i], x);\n }\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i < n; i++) {\n     scanf('%d%d', &x, &y);\n     add(x, y), add(y, x);\n     d[x]++, d[y]++;\n   }\n   for (int i = 1; i <= n; i++) upd(ans1, d[i] + 1);\n   dfs1(1, 0);\n   dfs2(1, 0);\n   f0[n] = f1[n] = 1;\n   for (int i = n; i >= 1; i--) {\n     int lst = 0;\n     for (auto u : e[i]) {\n       sum[u]++;\n       upd(f0[i], sum[u]);\n       upd(f1[i - 1], sum[u]);\n       if (lst != u) upd(f1[i], sum[u]);\n       upd(mx[f[u]], sum[u]);\n       upd(f0[i], sum[u] + mx[u] - 2);\n       if (f[u]) upd(f0[i], sum[u] + sum[f[u]] - 2);\n       lst = u;\n     }\n   }\n   for (int i = n; i >= 1; i--) upd(f0[i], f0[i + 1]), upd(f1[i], f1[i + 1]);\n   printf('%d ', ans1);\n   for (int i = 2; i <= n; i++)\n     if (i & 1)\n       printf('%d ', f1[i / 2]);\n     else\n       printf('%d ', f0[i / 2]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[1000];\n bool b[1000][1000];\n int main() {\n   int N, M;\n   scanf('%d%d', &N, &M);\n   for (int i = 0; i < N; i++) scanf('%d', &a[i]);\n   for (int i = 0; i < M; i++) {\n     int x, y;\n     scanf('%d%d', &x, &y);\n     --x;\n     --y;\n     b[x][y] = true;\n     b[y][x] = true;\n   }\n   int mincost = 1000000000;\n   for (int x = 0; x < N; x++)\n     for (int y = 0; y < N; y++)\n       for (int z = 0; z < N; z++)\n         if (b[x][y] && b[y][z] && b[x][z])\n           if (a[x] + a[y] + a[z] < mincost) mincost = a[x] + a[y] + a[z];\n   if (mincost == 1000000000)\n     printf('-1');\n   else\n     printf('%d\n', mincost);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   vector<vector<int> > arr(n + 1, vector<int>(m + 1));\n   for (int k = 1; k <= n; k++) {\n     for (int i = 1; i <= m; i++) {\n       cin >> arr[k][i];\n       arr[k][i] += arr[k][i - 1];\n     }\n   }\n   for (int i = 1; i <= m; i++) {\n     for (int k = 1; k <= n; k++) {\n       arr[k][i] += arr[k - 1][i];\n     }\n   }\n   int a, b;\n   cin >> a >> b;\n   int res = 1e9;\n   for (int k = a; k <= n; k++) {\n     for (int i = b; i <= m; i++) {\n       res = min(res,\n                 arr[k][i] - arr[k][i - b] - arr[k - a][i] + arr[k - a][i - b]);\n     }\n   }\n   for (int k = b; k <= n; k++) {\n     for (int i = a; i <= m; i++) {\n       res = min(res,\n                 arr[k][i] - arr[k][i - a] - arr[k - b][i] + arr[k - b][i - a]);\n     }\n   }\n   cout << res << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = 1e5 + 50;\n using namespace std;\n int n, m, h, tot, mx, maxn, ans;\n int a[N], b[N], cnt[N], num[N];\n int read() {\n   int s = 0, t = 1;\n   char c;\n   while (c < '0' || c > '9') {\n     if (c == '-') t = -1;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') {\n     s = s * 10 + c - '0';\n     c = getchar();\n   }\n   return s * t;\n }\n long long readl() {\n   long long s = 0, t = 1;\n   char c;\n   while (c < '0' || c > '9') {\n     if (c == '-') t = -1;\n     c = getchar();\n   }\n   while (c >= '0' && c <= '9') {\n     s = s * 10 + c - '0';\n     c = getchar();\n   }\n   return s * t;\n }\n int main() {\n   n = read();\n   m = read();\n   for (int i = 1; i <= m; i++) a[i] = read(), b[a[i]]++, mx = max(mx, a[i]);\n   for (int i = 1; i <= mx; i++)\n     if (b[i] > 0) cnt[++tot] = b[i];\n   for (int i = 1; i <= m; i++) {\n     h = 0;\n     for (int j = 1; j <= tot; j++) h += cnt[j] / i;\n     if (h >= n)\n       ans = i;\n     else\n       break;\n   }\n   printf('%d', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int n, q;\n   cin >> n >> q;\n   set<int> s;\n   multiset<int> d;\n   auto Add = [&](int x) {\n     auto ret = s.insert(x);\n     auto it = ret.first;\n     if (next(it) != s.end() && it != s.begin()) {\n       d.erase(d.find(*next(it) - *prev(it)));\n     }\n     if (it != s.begin()) {\n       d.insert(*it - *prev(it));\n     }\n     if (next(it) != s.end()) {\n       d.insert(*next(it) - *it);\n     }\n   };\n   auto Remove = [&](int x) {\n     auto it = s.find(x);\n     if (it != s.begin()) {\n       d.erase(d.find(*it - *prev(it)));\n     }\n     if (next(it) != s.end()) {\n       d.erase(d.find(*next(it) - *it));\n     }\n     if (next(it) != s.end() && it != s.begin()) {\n       d.insert(*next(it) - *prev(it));\n     }\n     s.erase(it);\n   };\n   for (int i = 0; i < n; i++) {\n     int foo;\n     cin >> foo;\n     Add(foo);\n   }\n   for (int i = 0; i <= q; i++) {\n     if (d.empty()) {\n       cout << 0 << '\n';\n     } else {\n       cout << *prev(s.end()) - *s.begin() - *prev(d.end()) << '\n';\n     }\n     if (i == q) {\n       break;\n     }\n     int c, x;\n     cin >> c >> x;\n     if (c) {\n       Add(x);\n     } else {\n       Remove(x);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline long long read() {\n   char ch = getchar();\n   long long s = 0, w = 1;\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') w = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') {\n     s = s * 10 + ch - '0';\n     ch = getchar();\n   }\n   return s * w;\n }\n int d[1000010], t[1000010], prime[1000010], tot, vis[1000010];\n int n, fa[1000010], a[1000010], m;\n long long c[1000010];\n inline void prepare(int Maxn) {\n   d[1] = 1;\n   for (register int i = 2; i <= Maxn; i++) {\n     if (!vis[i]) {\n       prime[++tot] = i;\n       t[i] = d[i] = 2;\n     }\n     for (register int j = 1; 1LL * prime[j] * i <= Maxn; j++) {\n       vis[i * prime[j]] = 1;\n       if (i % prime[j]) {\n         d[i * prime[j]] = d[i] * 2;\n         t[i * prime[j]] = 2;\n       } else {\n         d[i * prime[j]] = d[i] / t[i] * (t[i] + 1);\n         t[i * prime[j]] = t[i] + 1;\n         break;\n       }\n     }\n   }\n }\n inline void add(int x, int v) {\n   for (; x <= n; x += x & (-x)) c[x] += v;\n }\n inline long long query(int x) {\n   long long sum = 0;\n   for (; x; x -= x & (-x)) sum += c[x];\n   return sum;\n }\n int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }\n int main() {\n   prepare(1000010 - 10);\n   n = read(), m = read();\n   for (register int i = 1; i <= n; i++) a[i] = read(), fa[i] = i;\n   fa[n + 1] = n + 1;\n   for (register int i = 1; i <= n; i++) add(i, a[i]);\n   while (m--) {\n     int opt = read(), l = read(), r = read();\n     if (opt == 1) {\n       for (register int i = l; i <= r; i = find(i + 1)) {\n         add(i, d[a[i]] - a[i]);\n         a[i] = d[a[i]];\n         if (a[i] == 2 || a[i] == 1) fa[find(i)] = find(i + 1);\n       }\n     } else {\n       printf('%lld\n', query(r) - query(l - 1));\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char str[100050];\n char a[5000], b[5000];\n int len1, len2, len3;\n bool pp(int s1, int s2) {\n   while (s2 <= len2) {\n     if (str[s1] != a[s2]) return false;\n     s1++, s2++;\n   }\n   return true;\n }\n bool pp2(int s1, int s2) {\n   while (s2 <= len3) {\n     if (str[s1] != b[s2]) return false;\n     s1++, s2++;\n   }\n   return true;\n }\n bool rp(int s1, int s2) {\n   while (s2 <= len2) {\n     if (str[s1] != a[s2]) return false;\n     s1--, s2++;\n   }\n   return true;\n }\n bool rp2(int s1, int s2) {\n   while (s2 <= len3) {\n     if (str[s1] != b[s2]) return false;\n     s1--, s2++;\n   }\n   return true;\n }\n int main() { printf('Even\n'); }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   vector<long long int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 6;\n bool flag = true;\n vector<int> v[N];\n int a[N], p[N], h[N], g[N];\n void dfs(int u, int temp = -1) {\n   a[u] = p[u];\n   int sum = 0;\n   for (auto x : v[u]) {\n     if (x == temp) continue;\n     dfs(x, u);\n     sum += g[x];\n     a[u] += a[x];\n   }\n   if ((a[u] + h[u]) % 2 != 0) flag = false;\n   g[u] = (a[u] + h[u]) / 2;\n   if (g[u] >= 0 and g[u] <= a[u]) {\n   } else\n     flag = false;\n   if (sum > g[u]) flag = false;\n }\n int main() {\n   long long int t;\n   cin >> t;\n   while (t--) {\n     int n, m;\n     cin >> n >> m;\n     for (int i = 0; i < n; i++) cin >> p[i];\n     ;\n     for (int i = 0; i < n; i++) cin >> h[i];\n     ;\n     for (int i = 0; i < n - 1; i++) {\n       int a, b;\n       cin >> a >> b;\n       a--;\n       b--;\n       v[a].push_back(b);\n       v[b].push_back(a);\n     }\n     dfs(0);\n     cout << (flag ? 'YES' : 'NO') << endl;\n     flag = true;\n     for (int i = 0; i < n; i++) v[i].clear();\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int i = 0, j = 0, a;\n   string s, t;\n   cin >> s >> t;\n   a = t.length();\n   while (a--) {\n     if (t[j] == s[i]) {\n       i++;\n     }\n     j++;\n   }\n   cout << i + 1;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char inp[1005], ans[1005];\n int n, p;\n bool possible(int pos, int ok) {\n   if (pos == n) return ok;\n   int start = ok ? 0 : inp[pos] - 'a';\n   int i;\n   for (i = start; i < p; i++) {\n     ans[pos] = i + 'a';\n     if (pos > 0 && ans[pos - 1] == ans[pos]) continue;\n     if (pos > 1 && ans[pos - 2] == ans[pos]) continue;\n     if (possible(pos + 1, ok | (i > start))) return true;\n   }\n   return false;\n }\n int main() {\n   scanf('%d%d', &n, &p);\n   scanf('%s', inp);\n   bool ok = 0;\n   int i;\n   if (possible(0, 0)) {\n     ans[n] = '\0';\n     printf('%s\n', ans);\n   } else\n     printf('NO\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m, k;\n long long C[1005][2005];\n int main() {\n   scanf('%d %d %d', &n, &m, &k);\n   int M = max(n, m);\n   for (int n = 0; n <= M; n++)\n     for (int r = 0; r <= 2 * k; r++) {\n       if (r == 0)\n         C[n][r] = 1;\n       else if (n == 0)\n         C[n][r] = 0;\n       else\n         C[n][r] = (C[n - 1][r - 1] + C[n - 1][r]) % 1000000007;\n     }\n   printf('%d\n', (int)((C[n - 1][2 * k] * C[m - 1][2 * k]) % 1000000007));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long lca(long long a, long long b) {\n   while (a != b) {\n     if (a < b)\n       b /= 2;\n     else\n       a /= 2;\n   }\n   return a;\n }\n long long inf = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;\n int main() {\n   ios_base::sync_with_stdio(0);\n   int t;\n   cin >> t;\n   map<long long, long long> M;\n   while (t-- > 0) {\n     int x;\n     cin >> x;\n     long long u, v, w;\n     cin >> u >> v;\n     if (x == 1) {\n       cin >> w;\n       long long y = lca(u, v);\n       while (u != y) {\n         M[u] += w;\n         u /= 2;\n       }\n       while (v != y) {\n         M[v] += w;\n         v /= 2;\n       }\n     } else {\n       long long y = lca(u, v);\n       long long ans = 0;\n       while (u != y) {\n         ans += M[u];\n         u /= 2;\n       }\n       while (v != y) {\n         ans += M[v];\n         v /= 2;\n       }\n       cout << ans << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n;\n int a[100];\n int main() {\n   int x = 1;\n   scanf('%d', &n);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &a[i]);\n     if (a[i] < a[x]) x = i;\n   }\n   if (n == 1 || (n == 2 && a[1] == a[2])) {\n     puts('-1');\n   } else {\n     printf('1\n%d\n', x);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char comp[200005];\n vector<pair<int, int> > edge[200005];\n vector<int> father[200005];\n vector<string> ans;\n int dis[200005], n, k;\n queue<pair<int, int> > q;\n void dfs(int u) {\n   if (ans.size() >= k) return;\n   if (u == n + 1) {\n     ans.push_back(comp + 1);\n     return;\n   }\n   for (int i = 0; i < father[u].size(); i++) {\n     comp[father[u][i]] = '1';\n     dfs(u + 1);\n     comp[father[u][i]] = '0';\n   }\n }\n int main() {\n   char a[10];\n   int m;\n   cin >> n >> m >> k;\n   for (int i = 1; i <= m; i++) {\n     int u, v;\n     scanf('%d %d', &u, &v);\n     edge[u].push_back(make_pair(v, i));\n     edge[v].push_back(make_pair(u, i));\n   }\n   memset(dis, -1, sizeof(dis));\n   for (int i = 1; i <= m; i++) comp[i] = '0';\n   q.push(make_pair(1, 0));\n   dis[1] = 0;\n   while (!q.empty()) {\n     pair<int, int> pa = q.front();\n     q.pop();\n     int u = pa.first, d = pa.second;\n     for (int i = 0; i < edge[u].size(); i++) {\n       int v = edge[u][i].first;\n       if (dis[v] == -1) {\n         dis[v] = d + 1;\n         q.push(make_pair(v, d + 1));\n       }\n     }\n   }\n   for (int i = 2; i <= n; i++) {\n     for (int j = 0; j < edge[i].size(); j++) {\n       if (dis[i] == dis[edge[i][j].first] + 1)\n         father[i].push_back(edge[i][j].second);\n     }\n   }\n   dfs(2);\n   if (ans.size() >= k) {\n     cout << k << endl;\n     for (int i = 0; i < k; i++) cout << ans[i] << endl;\n   } else {\n     cout << ans.size() << endl;\n     for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < n; i++) {\n     int s, f, t;\n     cin >> s >> f >> t;\n     int x = t % (2 * (m - 1));\n     int y = t - x;\n     int ans = 0;\n     if (s == f) {\n       ans = t;\n     } else if (s < f) {\n       if (x <= s - 1) {\n         ans = y + f - 1;\n       } else {\n         ans = y + 2 * (m - 1) + f - 1;\n       }\n     } else {\n       if (x <= (m - 1) + (m - s)) {\n         ans = y + (m - 1) + m - f;\n       } else {\n         ans = y + 3 * (m - 1) + m - f;\n       }\n     }\n     cout << ans << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e5 + 5;\n int n, m, t;\n vector<int> e[maxn];\n vector<int> ans;\n stack<int> s;\n bool vis[maxn];\n int dep[maxn];\n int N;\n bool v[maxn];\n int dfs(int x, int fr) {\n   vis[x] = true;\n   s.push(x);\n   for (auto y : e[x]) {\n     if (y == fr) continue;\n     if (!vis[y]) {\n       dep[y] = dep[x] + 1;\n       dfs(y, x);\n       dep[y] = 0;\n     } else if (dep[y]) {\n       if (dep[x] - dep[y] + 1 >= N) {\n         printf('2\n');\n         printf('%d\n', dep[x] - dep[y] + 1);\n         while (s.top() != y) {\n           printf('%d ', s.top());\n           s.pop();\n         }\n         printf('%d\n', s.top());\n         exit(0);\n       }\n     }\n   }\n   if (!v[x]) {\n     for (auto y : e[x]) {\n       v[y] = true;\n     }\n     ans.push_back(x);\n   }\n   s.pop();\n   return 0;\n }\n int read() {\n   int x;\n   scanf('%d', &x);\n   return x;\n }\n int main() {\n   int i, j;\n   int x, y;\n   n = read();\n   m = read();\n   N = sqrt(n);\n   while (N * N < n) N++;\n   for (i = 1; i <= m; i++) {\n     x = read();\n     y = read();\n     e[x].push_back(y);\n     e[y].push_back(x);\n   }\n   for (i = 1; i <= n; i++) {\n     if (!vis[i]) {\n       dep[i] = 1;\n       dfs(i, -1);\n       dep[i] = 0;\n     }\n   }\n   printf('1\n');\n   for (i = 1; i <= n; i++) {\n     if (v[i]) continue;\n     N--;\n     printf('%d ', i);\n     if (!N) break;\n   }\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, a[110], mx;\n const int N = 30;\n map<int, int> mem;\n int Penu(int now) {\n   if (!now || mem.find(now) != mem.end()) return mem[now];\n   register int ans = 0;\n   register set<int> mex;\n   for (register int i = 1; i < 31; i++)\n     if (now >> i) mex.insert(Penu(now & ((1 << i) - 1) | (now >> i)));\n   while (mex.count(ans)) ans++;\n   return mem[now] = ans;\n }\n int ans;\n int main() {\n   ios::sync_with_stdio(false);\n   cin.tie(nullptr);\n   cout.tie(nullptr);\n   cin >> n;\n   mem[0] = 0;\n   map<int, int> ma;\n   for (register int i = 1, j; i <= n; i++) {\n     cin >> j;\n     for (register int r = 2, c = 0; r * r <= j; r++, c = 0) {\n       while (!(j % r)) {\n         c++;\n         j /= r;\n       }\n       if (c) ma[r] |= (1 << c);\n     }\n     if (j > 1) ma[j] |= 2;\n   }\n   for (auto u : ma) ans ^= Penu(u.second);\n   cout << (!ans ? 'Arpa\n' : 'Mojtaba\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include<bits/stdc++.h>\n \n #define ll long long int\n #define ld long double\n #define pb push_back\n #define fi first\n #define se second\n #define all(x) x.begin(),x.end()\n #define mem(x,y) memset(x,y,sizeof(x))\n #define pii pair<int,int>\n #define pll pair<ll,ll>\n #define INF 1e9+10\n #define INFL 1e18\n #define mod 1000000007\n //#define mod 998244353\n #define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);\n using namespace std;\n \n \n \n \n ll power(ll x,ll n){ll res =1;while(n>0){if(n%2==1){res=res*x;}x=x*x;n=n/2;}return res;}\n ll powm(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\n \n //cout<< fixed << setprecision(10)\n //__builtin_popcountll();\n //|_2.4_|=2  \n int vis[500005];\n vector<int>g[500005];\n \n int lev[500005];\n int ans[500005];\n \n void bfs(int s)\n {\n 	queue<int>q;\n 	q.push(s);\n 	vis[s]=1;\n 	lev[s]=0;\n 	\n 	while(!q.empty())\n 	{\n 		int x=q.front();\n 		q.pop();\n 		for(int i=0;i<g[x].size();i++)\n 		{\n 			\n 			if(vis[g[x][i]]==0)\n 			{\n 				lev[g[x][i]]=lev[x]+1;\n 				vis[g[x][i]]=1;\n 				q.push(g[x][i]);\n 			}\n 			\n 		}\n 		\n 	}\n }\n void dfs(int s)\n {\n 	vis[s]=1;\n 	for(auto x:g[s])\n 	{\n 		if(lev[s]>=lev[x])\n 			continue;\n 		\n 		dfs(x);\n \n 		ans[s]=min(ans[s],ans[x]);\n 	}\n }\n \n \n int main(){\n 	\n 	fast;\n 	int T=1;\n 	cin>>T;\n 	while(T--)\n 	{\n 		int n,i,j,m;\n 		cin>>n>>m;\n 		vector<pii>v;\n 		for(i=0;i<m;i++)\n 		{\n 			int r,c;\n 			cin>>r>>c;\n 			v.pb({c,r});\n 		}\n 		sort(all(v));\n 		int l=0,r;\n 		if(m%2==1)\n 		{\n 			cout<<'NO\n';\n 			continue;\n 		}\n 		for(i=0;i+1<m;i+=2)\n 		{\n 			if(v[i].fi==v[i+1].fi)\n 			{\n 				continue;\n \n 			}\n 			else\n 			{\n 				if(i+2<m&&v[i+1].fi==v[i+2].fi)\n 				{\n 					l=1;\n 					break;\n 				}\n 				if((v[i].se==v[i+1].se&&(v[i+1].fi-v[i].fi-1)%2==0)||(v[i].se!=v[i+1].se&&(v[i+1].fi-v[i].fi-1)%2==1))\n 				{\n 					continue;\n \n \n 				}\n 				else\n 				{\n 					l=1;\n 					break;\n 				}\n \n 			}\n 		}\n 		if(l)\n 		{\n 			cout<<'NO\n';\n 		}\n 		else\n 		{\n 			cout<<'YES\n';\n 		}\n \n \n 		\n \n 		\n 	}\n }\n 	\n \n \n 	\n 	\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   int n;\n   string s, t;\n   cin >> n >> s >> t;\n   string ss = s, tt = t;\n   sort(ss.begin(), ss.end());\n   sort(tt.begin(), tt.end());\n   if (ss != tt)\n     cout << -1 << '\n';\n   else {\n     vector<int> ans;\n     for (int j = (int)(n - 1); j >= int(0); j--) {\n       char target = t[j];\n       ;\n       int pos = n - j - 1;\n       ;\n       while (target != s[pos]) pos++;\n       ;\n       ;\n       ans.push_back(n);\n       reverse(s.begin(), s.end());\n       ;\n       ans.push_back(pos);\n       string temp(s.begin() + n - pos, s.end());\n       reverse(temp.begin(), temp.end());\n       s.erase(s.begin() + n - pos, s.end());\n       s.insert(s.begin(), temp.begin(), temp.end());\n       ;\n       ans.push_back(1);\n       char c = s[n - 1];\n       s.erase(s.begin() + n - 1);\n       s.insert(s.begin(), c);\n       ;\n     }\n     cout << int((ans).size()) << '\n';\n     for (int i = 0; i < int(int((ans).size())); i++) {\n       if (i) cout << ' ';\n       cout << ans[i];\n     }\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long int MOD = 1000000000 + 7;\n long long int arr[200005];\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   long long int t;\n   cin >> t;\n   while (t--) {\n     long long int n, sum = 0;\n     cin >> n;\n     for (long long int i = 0; i < n; i++) cin >> arr[i];\n     long long int i = 0;\n     vector<long long int> vec;\n     while (1) {\n       long long int maxp = INT_MIN;\n       long long int maxn = INT_MIN;\n       for (; i < n; i++) {\n         if (arr[i] < 0)\n           break;\n         else {\n           maxp = max(maxp, arr[i]);\n         }\n       }\n       if (maxp != INT_MIN) vec.push_back(maxp);\n       if (i == n) break;\n       for (; i < n; i++) {\n         if (arr[i] >= 0)\n           break;\n         else {\n           maxn = max(maxn, arr[i]);\n         }\n       }\n       if (maxn != INT_MIN) vec.push_back(maxn);\n       if (i == n) break;\n     }\n     for (long long int i = 0; i < vec.size(); i++) sum += vec[i];\n     cout << sum << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long maxn = 2e5 + 5;\n int n, k, a[maxn], ans[maxn], pos[maxn];\n class Node {\n  public:\n   int l, r;\n };\n Node lis[maxn];\n int main() {\n   scanf('%d%d', &n, &k);\n   for (int(i) = 0; (i) < (n); (i)++) {\n     cin >> a[i + 1];\n     pos[a[i + 1]] = i + 1;\n     lis[i + 1].l = i;\n     lis[i + 1].r = i + 2;\n   }\n   int team = 1;\n   for (int i = n; i >= 1; i--) {\n     int p = pos[i];\n     if (ans[p] != 0) continue;\n     ans[p] = team;\n     for (int(j) = 0; (j) < (k); (j)++) {\n       int el = lis[p].r;\n       if (el != n + 1) {\n         ans[el] = team;\n         lis[lis[el].l].r = lis[el].r;\n         lis[lis[el].r].l = lis[el].l;\n       } else\n         break;\n     }\n     for (int(j) = 0; (j) < (k); (j)++) {\n       int el = lis[p].l;\n       if (el != 0) {\n         ans[el] = team;\n         lis[lis[el].l].r = lis[el].r;\n         lis[lis[el].r].l = lis[el].l;\n       } else\n         break;\n     }\n     lis[lis[p].l].r = lis[p].r;\n     lis[lis[p].r].l = lis[p].l;\n     if (team == 1)\n       team = 2;\n     else\n       team = 1;\n   }\n   for (int(i) = 0; (i) < (n); (i)++) cout << ans[i + 1];\n   cout << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline bool isLow(char ch) { return (ch >= 'a' && ch <= 'z'); }\n inline bool isUpp(char ch) { return (ch >= 'A' && ch <= 'Z'); }\n inline bool isDig(char ch) { return (ch >= '0' && ch <= '9'); }\n inline bool are_equal(double a, double b) {\n   return fabs(a - b) < numeric_limits<double>::epsilon();\n }\n inline bool less_than(double a, double b) {\n   return (b - a) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) *\n                     numeric_limits<double>::epsilon());\n }\n inline bool greater_than(double a, double b) {\n   return (a - b) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) *\n                     numeric_limits<double>::epsilon());\n }\n template <typename T, typename... args>\n inline string arrStr(T arr, int n) {\n   stringstream s;\n   s << '[ ';\n   for (int i = 0; i < n - 1; i++) s << arr[i] << ', ';\n   s << arr[n - 1] << ' ]';\n   return s.str();\n }\n inline void __evars_begin(int line) { cout << '#' << line << ': '; }\n template <typename T>\n inline void __evars_out_var(vector<T> val) {\n   cout << arrStr(val, val.size());\n }\n template <typename T>\n inline void __evars_out_var(T *val) {\n   cout << arrStr(val, 10);\n }\n template <typename T>\n inline void __evars_out_var(T val) {\n   cout << val;\n }\n inline void __evars(vector<string>::iterator it) { cout << endl; }\n template <typename T, typename... Args>\n inline void __evars(vector<string>::iterator it, T a, Args... args) {\n   cout << it->substr((*it)[0] == ' ', it->length()) << ' = ';\n   __evars_out_var(a);\n   cout << '; ';\n   __evars(++it, args...);\n }\n void in(int &n, int a[]) {\n   cin >> n;\n   for (__typeof(n - 1) i = (0); i <= (n - 1); i++) cin >> a[i];\n }\n void in(int &n, vector<int> &a) {\n   cin >> n;\n   a.resize(n);\n   for (__typeof(n - 1) i = (0); i <= (n - 1); i++) cin >> a[i];\n }\n void out(int n, int a[]) {\n   for (__typeof(n - 1) i = (0); i <= (n - 1); i++)\n     cout << a[i] << ' \n'[i + 1 == n];\n }\n void out(vector<int> &a) {\n   for (__typeof(a.size() - 1) i = (0); i <= (a.size() - 1); i++)\n     cout << a[i] << ' \n'[i + 1 == a.size()];\n }\n template <typename T>\n T power(T val, T p, T mod) {\n   val %= mod;\n   T result = 1;\n   while (p > 0) {\n     if (p & 0x1) result = (result * val) % mod;\n     val = (val * val) % mod;\n     p >>= 1;\n   }\n   return result;\n }\n vector<string> split(const string &s, char c) {\n   vector<string> v;\n   stringstream ss(s);\n   string x;\n   while (getline(ss, x, c)) v.emplace_back(x);\n   return move(v);\n }\n template <typename T>\n T gcd(T a, T b) {\n   return b == 0 ? a : gcd(b, a % b);\n }\n template <typename T>\n T lcm(T a, T b) {\n   return (a * b) / gcd(a, b);\n }\n template <typename T>\n string toString(T x) {\n   stringstream ss;\n   ss << x;\n   return ss.str();\n }\n template <typename T>\n T stringToT(string s, T a) {\n   T p;\n   istringstream ss(s);\n   ss >> p;\n   return p;\n }\n template <typename T>\n T SOD(T n) {\n   __typeof(n) sum = 0, i = 1;\n   for (; i * i <= n; i++)\n     sum += (n % i) ? 0 : ((((i) * (i)) == n) ? i : i + n / i);\n   return sum;\n }\n template <typename T, typename S>\n ostream &operator<<(ostream &os, const pair<T, S> &v) {\n   os << '(' << v.first << ', ' << v.second << ')';\n   return os;\n }\n template <typename T, typename S>\n ostream &operator<<(ostream &os, const map<T, S> &v) {\n   for (auto it : v) os << it.first << ' : ' << it.second << '\n';\n   return os;\n }\n template <typename T>\n ostream &operator<<(ostream &os, const set<T> &v) {\n   os << '[';\n   for (auto it : v) {\n     os << it;\n     if (it != *v.rbegin()) os << ', ';\n   }\n   os << ']';\n   return os;\n }\n template <typename T>\n ostream &operator<<(ostream &os, const vector<T> &v) {\n   os << '[';\n   for (int i = 0; i < v.size(); i++) {\n     os << v[i];\n     if (i != (int)v.size() - 1) os << ', ';\n   }\n   os << ']';\n   return os;\n }\n const int fx[] = {+1, -1, +0, +0};\n const int fy[] = {+0, +0, +1, -1};\n const int fx8[] = {+0, +0, +1, -1, -1, +1, -1, +1};\n const int fy8[] = {-1, +1, +0, +0, +1, +1, -1, -1};\n const int kx[] = {-2, -2, -1, -1, 1, 1, 2, 2};\n const int ky[] = {-1, 1, -2, 2, -2, 2, -1, 1};\n int Set(int N, int pos) { return N = N | (1 << pos); }\n int reset(int N, int pos) { return N = N & ~(1 << pos); }\n bool check(int N, int pos) { return (bool)(N & (1 << pos)); }\n const int mod = 1e9 + 7;\n const int mx = 2 * 100001;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long x, y;\n   int cases, tc;\n   cin >> tc;\n   for (cases = 1; cases <= tc; cases++) {\n     cin >> x >> y;\n     long long d = x - y;\n     if (d == 1)\n       cout << 'NO\n';\n     else\n       cout << 'YES\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n using namespace std;\n template <class T>\n using V = vector<T>;\n template <typename T>\n using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;\n long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }\n long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }\n long long int pom(long long int a, long long int n, int m) {\n   long long int x = 1;\n   for (a %= m; n; n /= 2) n& 1 ? x = x * a % m : 0, a = a * a % m;\n   return x;\n }\n int dx[4] = {-1, 0, 1, 0};\n int dy[4] = {0, -1, 0, 1};\n int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};\n int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};\n long long int cmp1(pair<pair<long long int, long long int>, long long int> a,\n                    pair<pair<long long int, long long int>, long long int> b) {\n   return a.first.second > b.first.second;\n }\n long long int cmp2(pair<long long int, long long int> a,\n                    pair<long long int, long long int> b) {\n   if (a.second != b.second)\n     return a.second < b.second;\n   else\n     return a.first > b.first;\n }\n int main(int argc, char* argv[]) {\n   cin.tie(0);\n   ios::sync_with_stdio(false);\n   long long int T;\n   cin >> T;\n   while (T--) {\n     long long int n;\n     cin >> n;\n     V<long long int> a(n + 1);\n     for (long long int i = 0; i < n; i++) {\n       cin >> a[i];\n     }\n     long long int ans = 0;\n     bool abc = 0;\n     long long int cnt = 0;\n     for (long long int i = 1; i < n; i++) {\n       if (a[i - 1] == 1 && a[i] == 0) {\n         abc = 1;\n         cnt = 1;\n       } else if (abc == 1 && a[i] == 0) {\n         cnt++;\n       }\n       if (abc == 1 && (a[i] == 0 && a[i + 1] == 1 && i < n - 1)) {\n         ans += cnt;\n         cnt = 0;\n         abc = 0;\n       }\n     }\n     cout << ans << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n const double eps = 1e-6;\n const double PI = acos(-1);\n const double R = 0.57721566490153286060651209;\n const int maxn = 1005;\n struct Edge {\n   int from, to, cap, flow, cost;\n   Edge(int u, int v, int c, int f, int cc)\n       : from(u), to(v), cap(c), flow(f), cost(cc) {}\n };\n struct MCMF {\n   int n, m;\n   vector<Edge> edges;\n   vector<int> G[maxn];\n   int inq[maxn];\n   int d[maxn];\n   int p[maxn];\n   int a[maxn];\n   void init(int n) {\n     this->n = n;\n     for (int i = 0; i <= n; ++i) G[i].clear();\n     edges.clear();\n   }\n   void add(int from, int to, int cap, int cost) {\n     edges.emplace_back(Edge(from, to, cap, 0, cost));\n     edges.emplace_back(Edge(to, from, 0, 0, -cost));\n     m = int(edges.size());\n     G[from].emplace_back(m - 2);\n     G[to].emplace_back(m - 1);\n   }\n   bool spfa(int s, int t, int &flow, int &cost) {\n     for (int i = 1; i <= n; ++i) d[i] = INF;\n     memset(inq, 0, sizeof(inq));\n     d[s] = 0;\n     inq[s] = 1;\n     p[s] = 0;\n     queue<int> q;\n     a[s] = INF;\n     q.push(s);\n     while (!q.empty()) {\n       int u = q.front();\n       q.pop();\n       inq[u] = 0;\n       for (int i = 0; i < int(G[u].size()); ++i) {\n         Edge &e = edges[G[u][i]];\n         if (e.cap > e.flow && d[e.to] > d[u] + e.cost) {\n           d[e.to] = d[u] + e.cost;\n           p[e.to] = G[u][i];\n           a[e.to] = min(a[u], e.cap - e.flow);\n           if (!inq[e.to]) {\n             q.push(e.to);\n             inq[e.to] = 1;\n           }\n         }\n       }\n     }\n     if (d[t] == INF) return false;\n     flow += a[t];\n     cost += d[t] * a[t];\n     for (int u = t; u != s; u = edges[p[u]].from) {\n       edges[p[u]].flow += a[t];\n       edges[p[u] ^ 1].flow -= a[t];\n     }\n     return true;\n   }\n   int MincostMaxflow(int s, int t, int &cost) {\n     int flow = 0;\n     cost = 0;\n     while (spfa(s, t, flow, cost))\n       ;\n     return flow;\n   }\n } mcmf;\n int n, m, mincost;\n void solve() {\n   string S;\n   cin >> S;\n   cin >> n;\n   map<int, int> num, mp[n + 1];\n   vector<int> a(n + 1);\n   for (int i = 0; i < S.length(); i++) {\n     num[S[i] - 'a' + 1]++;\n   }\n   for (int i = 1; i <= n; i++) {\n     string T;\n     cin >> T >> a[i];\n     for (int j = 0; j < T.length(); j++) {\n       mp[i][T[j] - 'a' + 1]++;\n     }\n   }\n   int s = 0, t = n + 26 + 1;\n   mcmf.init(t);\n   for (int i = 1; i <= 26; i++) {\n     if (!num[i]) continue;\n     mcmf.add(s, i, num[i], 0);\n     for (int j = 1; j <= n; j++) {\n       if (!mp[j][i]) continue;\n       mcmf.add(i, j + 26, mp[j][i], j);\n     }\n   }\n   for (int i = 1; i <= n; i++) {\n     mcmf.add(i + 26, t, a[i], 0);\n   }\n   int maxflow = mcmf.MincostMaxflow(s, t, mincost);\n   if (maxflow == S.length())\n     cout << mincost << '\n';\n   else\n     cout << -1 << '\n';\n }\n signed main() {\n   ios_base::sync_with_stdio(false);\n   solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int OO = 0x3f3f3f3f, NegOO = -1 * OO, N = 1e6 + 5, mod = 1e9 + 7;\n long long gcd(long long x, long long y) {\n   if (y == 0) return x;\n   return gcd(y, x % y);\n }\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n, x, y, d;\n     cin >> n >> x >> y >> d;\n     if (x == y) {\n       cout << 0 << '\n';\n       continue;\n     } else if (x < y) {\n       int mx = 1e9 + 5;\n       int ans1 = mx, ans2 = mx, ans3 = mx;\n       if ((y - x) % d == 0) ans1 = (y - x) / d;\n       if ((y - 1) % d == 0)\n         ans2 = (x - 1) / d + ((x - 1) % d != 0) + (y - 1) / d;\n       if ((n - y) % d == 0)\n         ans3 = (n - x) / d + ((n - x) % d != 0) + (n - y) / d;\n       int ans = min(min(ans1, ans2), ans3);\n       cout << ((ans != mx) ? ans : -1) << '\n';\n     } else {\n       int mx = 1e9 + 5;\n       int ans1 = mx, ans2 = mx, ans3 = mx;\n       if ((x - y) % d == 0) ans1 = (x - y) / d;\n       if ((y - 1) % d == 0)\n         ans2 = (x - 1) / d + ((x - 1) % d != 0) + (y - 1) / d;\n       if ((n - y) % d == 0)\n         ans3 = (n - x) / d + ((n - x) % d != 0) + (n - y) / d;\n       int ans = min(min(ans1, ans2), ans3);\n       cout << ((ans != mx) ? ans : -1) << '\n';\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<long long> g[200000];\n long long c[200000];\n long long cnt;\n void dfs(long long v, long long p = -1) {\n   cnt++;\n   long long cnt1 = cnt;\n   for (long long to : g[v]) {\n     if (to != p) {\n       dfs(to, v);\n     }\n   }\n   c[v] = cnt - cnt1 + 1;\n }\n signed main() {\n   long long t;\n   cin >> t;\n   for (long long q = 0; q < t; q++) {\n     long long k;\n     cin >> k;\n     k *= 2;\n     vector<pair<long long, long long>> edge;\n     long long t[k];\n     for (long long i = 0; i < k - 1; i++) {\n       long long a, b;\n       cin >> a >> b >> t[i];\n       a--;\n       b--;\n       g[a].push_back(b);\n       g[b].push_back(a);\n       edge.push_back({a, b});\n     }\n     dfs(0);\n     long long mnsum = 0, mxsum = 0;\n     for (long long i = 0; i < k - 1; i++) {\n       long long c1 = min(c[edge[i].first], c[edge[i].second]);\n       mnsum += c1 % 2 * t[i];\n       mxsum += min(c1, k - c1) * t[i];\n     }\n     cout << mnsum << ' ' << mxsum << '\n';\n     for (long long i = 0; i < k; i++) {\n       g[i].clear();\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 410;\n const int inf = 0x7fffffff;\n int a[maxn];\n int n;\n int main() {\n   int ans = inf;\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> a[i];\n   for (int i = 2; i <= n; i++)\n     for (int j = i; j <= n; j++) {\n       int x = a[i - 1] - 1, y = 0;\n       for (int k = i; k <= j; k++) {\n         int t = x / a[k];\n         y += t;\n         x -= t * a[k];\n       }\n       x = a[i - 1] - 1 - x + a[j];\n       y++;\n       if (x < ans) {\n         int o = x;\n         for (int k = 1; k <= n; k++) {\n           int t = x / a[k];\n           y -= t;\n           x -= t * a[k];\n         }\n         if (y < 0) ans = o;\n       }\n     }\n   if (ans == inf)\n     puts('-1');\n   else\n     printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int prime[15] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};\n int main() {\n   int n;\n   cin >> n;\n   vector<int> res;\n   int limit = 2 * n * n;\n   for (int i = 0; i < 15; i++) {\n     res.clear();\n     res.push_back(1);\n     for (int j = 0; j <= i; j++) {\n       int p = prime[j];\n       int sz = res.size();\n       for (int k = 0; k < sz; k++) {\n         int x = res[k];\n         while (x * p <= limit) {\n           x *= p;\n           res.push_back(x);\n         }\n       }\n     }\n     if (res.size() >= n) {\n       break;\n     }\n   }\n   sort(res.begin(), res.end(), greater<int>());\n   for (int i = 0; i < n; i++) {\n     cout << res[i] << ' ';\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long nax = 1e5 + 7;\n const long long mod = 1e9 + 7;\n const long long inf = numeric_limits<long long>::max();\n long long n, m;\n bool check(vector<long long> &vec) {\n   vector<long long> freq(n + 1, 0);\n   for (long long i = 0; i < n; i++) {\n     if (vec[i] > n) return false;\n     freq[vec[i]]++;\n     if (freq[vec[i]] > 1) {\n       return false;\n     }\n   }\n   for (long long i = 0; i < n; i++) {\n     if (freq[i + 1] != 1) return false;\n   }\n   return true;\n }\n void test() {\n   cin >> n;\n   vector<long long> vec;\n   vec.push_back(0);\n   long long first = 0;\n   for (long long i = 1; i < n; i++) {\n     long long t;\n     cin >> t;\n     vec.push_back(vec.back() + t);\n     first = min(first, vec.back());\n   }\n   first = 1 - first;\n   for (long long &x : vec) x += first;\n   if (check(vec))\n     for (long long x : vec) cout << x << ' ';\n   else\n     cout << -1;\n }\n signed main() {\n   ios_base ::sync_with_stdio(false);\n   cin.tie(NULL);\n   long long T = 1;\n   while (T--) {\n     test();\n     cout << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int test;\n   cin >> test;\n   while (test--) {\n     int n;\n     cin >> n;\n     vector<vector<int>> v(n, vector<int>(n, 0));\n     for (int i = 0; i < n; i++) {\n       v[i][i] = 1;\n       v[(i + 1) % n][i] = 1;\n     }\n     for (int i = 0; i < n; i++) {\n       for (int j = 0; j < n; j++) cout << v[i][j] << ' ';\n       cout << '\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long int inf = (long long int)1e18 + 19;\n const long long int mod = (long long int)1e9 + 7;\n void cazz() {\n   long long int t = 1, i;\n   long double j, n;\n   cin >> t;\n   while (t--) {\n     cin >> n;\n     i = 3, j = -1;\n     while (j < n) {\n       j = (((long double)180 * (i - 2)) / i);\n       i++;\n     }\n     if (j == n) {\n       cout << 'YES\n';\n       continue;\n     }\n     cout << 'NO\n';\n   }\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   cazz();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1000 * 1000 + 10;\n vector<int> vec[N];\n vector<int> d[2];\n bool mark[N];\n void dfs(int v, int hh) {\n   mark[v] = true;\n   d[hh].push_back(v);\n   for (int u : vec[v])\n     if (!mark[u]) dfs(u, 1 - hh);\n }\n int main() {\n   int o;\n   cin >> o;\n   while (o--) {\n     int n, m;\n     cin >> n >> m;\n     for (int i = 0; i < n; i++) vec[i].clear(), mark[i] = false;\n     ;\n     d[0].clear();\n     d[1].clear();\n     for (int i = 0; i < m; i++) {\n       int a, b;\n       cin >> a >> b;\n       a--, b--;\n       vec[a].push_back(b);\n       vec[b].push_back(a);\n     }\n     dfs(0, 0);\n     if ((int)d[0].size() > (int)d[1].size()) swap(d[0], d[1]);\n     cout << (int)d[0].size() << endl;\n     for (int a : d[0]) cout << a + 1 << ' ';\n     cout << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int inf = 1000000007;\n const double pi = 2 * acos(0.0);\n using namespace std;\n int gcd(int a, int b) {\n   a = abs(a);\n   b = abs(b);\n   while (b) {\n     a = a % b;\n     swap(a, b);\n   }\n   return a;\n }\n int main() {\n   map<long long, int> m;\n   long long n, k;\n   scanf('%lld%lld', &n, &k);\n   long long arr[n];\n   for (long long i = 0; i < n; i++) {\n     scanf('%lld', &arr[i]);\n     m.insert(make_pair(arr[i], 1));\n   }\n   vector<long long> ans;\n   long long sum = 0;\n   for (int i = 1; i < 1e9; i++) {\n     if (sum > k) {\n       ans.pop_back();\n       break;\n     }\n     if (m[i] != 1) {\n       sum += i;\n       ans.push_back(i);\n     }\n   }\n   printf('%d\n', ans.size());\n   for (long long i : ans) {\n     printf('%d ', i);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXN = 500005;\n int ult;\n int cont;\n int prim;\n char cad[MAXN];\n bool Solve(int a, int n, int T) {\n   int c = 0, time = 0;\n   queue<int> s;\n   prim = -1;\n   for (int i = 0; i < n && c < cont; i++, time++) {\n     if (cad[i] == 'H' && a > 0) {\n       c++;\n       a--;\n       if (prim == -1) prim = i;\n     } else if (cad[i] == 'H') {\n       s.push(i);\n       if (prim == -1) prim = i;\n     } else if (cad[i] == 'S') {\n       a++;\n       if (a >= s.size()) {\n         if (!s.empty()) {\n           int aux = abs(s.front() - i);\n           time += aux;\n           s.pop();\n           a--;\n           c++;\n           while (!s.empty()) {\n             c++;\n             a--;\n             s.pop();\n           }\n           if (c < cont) time += aux;\n         }\n       }\n     }\n     if (c == cont) ult = i;\n   }\n   time = min(time, ult + 1 + (ult - prim));\n   return (time <= T && c == cont);\n }\n int main() {\n   int n;\n   long long int T;\n   scanf('%d %lld', &n, &T);\n   scanf('\n%s', cad);\n   for (int i = 0; i < n; i++)\n     if (cad[i] == 'H') cont++;\n   int ini = 0, fin = cont;\n   while (ini < fin) {\n     int med = (ini + fin) / 2;\n     if (!Solve(med, n, T))\n       ini = med + 1;\n     else\n       fin = med;\n   }\n   if (Solve(ini, n, T))\n     printf('%d\n', ini);\n   else\n     printf('-1\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   long long int i, j, k, m, n, a[100400], t, w, q, sum = 0;\n   char s[105000];\n   long double x, y;\n   cin >> q;\n   for (j = 0; j < q; j++) {\n     cin >> n;\n     cin >> s;\n     if (n > 2) {\n       cout << 'YES' << endl;\n       cout << 2 << endl;\n       cout << s[0] << ' ';\n       for (i = 1; i < n; i++) cout << s[i];\n       cout << endl;\n     } else {\n       if (s[0] - '0' < s[1] - '0') {\n         cout << 'YES' << endl;\n         cout << 2 << endl;\n         cout << s[0] << ' ' << s[1] << endl;\n       } else\n         cout << 'NO' << endl;\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize('O3')\n long long fact(int i) {\n   if (i <= 1)\n     return 1;\n   else\n     return i * fact(i - 1);\n }\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int t;\n   cin >> t;\n   while (t--) {\n     int arr[4];\n     for (int i = 0; i < 4; i++) {\n       cin >> arr[i];\n     }\n     int minus = arr[0] + arr[1];\n     string final[4];\n     if (minus % 2 == 0) {\n       final[0] = 'Tidak';\n       final[1] = 'Tidak';\n       if (arr[2] == 0) {\n         if (arr[1] == 0) {\n           final[2] = 'Tidak';\n         } else {\n           final[2] = 'Ya';\n         }\n       } else {\n         final[2] = 'Ya';\n       }\n       if (arr[3] == 0) {\n         if (arr[0] == 0) {\n           final[3] = 'Tidak';\n         } else {\n           final[3] = 'Ya';\n         }\n       } else {\n         final[3] = 'Ya';\n       }\n     } else {\n       final[2] = 'Tidak';\n       final[3] = 'Tidak';\n       if (arr[0] == 0) {\n         if (arr[3] == 0) {\n           final[0] = 'Tidak';\n         } else {\n           final[0] = 'Ya';\n         }\n       } else {\n         final[0] = 'Ya';\n       }\n       if (arr[1] == 0) {\n         if (arr[2] == 0) {\n           final[1] = 'Tidak';\n         } else {\n           final[1] = 'Ya';\n         }\n       } else {\n         final[1] = 'Ya';\n       }\n     }\n     for (int i = 0; i < 4; i++) {\n       cout << final[i] << ' ';\n     }\n     cout << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<int> a;\n void SieveOfEratosthenes(int n) {\n   bool prime[n + 1];\n   memset(prime, true, sizeof(prime));\n   for (int p = 2; p * p <= n; p++) {\n     if (prime[p] == true) {\n       for (int i = p * p; i <= n; i += p) prime[i] = false;\n     }\n   }\n   for (int p = 2; p <= n; p++)\n     if (prime[p]) a.push_back(p);\n }\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   int n;\n   cin >> n;\n   SieveOfEratosthenes(100000);\n   for (int i = 2; i <= n; i++) {\n     for (int j = 0; j < a.size(); j++) {\n       if (i % a[j] == 0) {\n         cout << j + 1 << ' ';\n         break;\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <class T>\n void mini(T& a, T b) {\n   a = min(a, b);\n }\n template <class T>\n void maxi(T& a, T b) {\n   a = max(a, b);\n }\n template <class T1, class T2>\n ostream& operator<<(ostream& out, pair<T1, T2> a) {\n   return out << a.first << ' ' << a.second;\n }\n template <class T>\n ostream& operator<<(ostream& out, vector<T> a) {\n   for (auto& i : a) out << i << ' ';\n   return out;\n }\n template <class T>\n ostream& operator<<(ostream& out, set<T> a) {\n   for (auto& i : a) out << i << ' ';\n   return out;\n }\n template <class T>\n ostream& operator<<(ostream& out, multiset<T> a) {\n   for (auto& i : a) out << i << ' ';\n   return out;\n }\n template <class T1, class T2>\n ostream& operator<<(ostream& out, map<T1, T2> a) {\n   for (auto& i : a) out << i << '\n';\n   return out;\n }\n template <class T1, class T2>\n ostream& operator<<(ostream& out, unordered_map<T1, T2> a) {\n   for (auto& i : a) out << i << '\n';\n   return out;\n }\n template <class T>\n ostream& operator<<(ostream& out, queue<T> a) {\n   while (!a.empty()) {\n     cout << a.front() << ' ';\n     a.pop();\n   }\n   return out;\n }\n template <class T>\n ostream& operator<<(ostream& out, deque<T> a) {\n   while (!a.empty()) {\n     cout << a.front() << ' ';\n     a.pop_front();\n   }\n   return out;\n }\n template <class T>\n ostream& operator<<(ostream& out, priority_queue<T> a) {\n   while (!a.empty()) {\n     cout << a.top() << '\n';\n     a.pop();\n   }\n   return out;\n }\n template <class T>\n void out(T a) {\n   cout << a << endl;\n }\n template <class T1, class T2>\n void out(T1 a, T2 b) {\n   cout << a << ' ' << b << endl;\n }\n template <class T1, class T2, class T3>\n void out(T1 a, T2 b, T3 c) {\n   cout << a << ' ' << b << ' ' << c << endl;\n }\n void out() { cout << 'OK' << endl; }\n template <class T>\n void sort(vector<T>& a) {\n   sort(a.begin(), a.end());\n }\n template <class T>\n void uniq(vector<T>& a) {\n   sort(a);\n   a.erase(unique(a.begin(), a.end()), a.end());\n }\n template <class T>\n vector<T> set_int(vector<T> a, vector<T> b) {\n   sort(a);\n   sort(b);\n   vector<T> res;\n   set_intersection(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res));\n   return res;\n }\n istream& operator>>(istream& in, __int128& a) {\n   int64_t b;\n   cin >> b;\n   a = b;\n   return in;\n }\n ostream& operator<<(ostream& out, const __int128 a) {\n   unsigned __int128 b = a < 0 ? -a : a;\n   char buf[128];\n   char* c = end(buf);\n   do {\n     --c;\n     *c = '0123456789'[b % 10];\n     b /= 10;\n   } while (b);\n   if (a < 0) {\n     --c;\n     *c = '-';\n   }\n   int len = end(buf) - c;\n   out.rdbuf()->sputn(c, len);\n   return out;\n }\n const int N = 1e5 + 5;\n const int inf = 1e9;\n vector<int> dp, pr;\n vector<bool> used;\n vector<int> a[N];\n void Solve() {\n   int n, k;\n   cin >> n >> k;\n   int h = 5 * sqrt(k);\n   int ans = 0;\n   for (int i = 1; i <= k; i++) {\n     int r, c;\n     cin >> r >> c;\n     if (n - r < h)\n       a[c - 1].push_back(n - r);\n     else\n       ans += 3;\n   }\n   dp.resize(h, 0);\n   pr.resize(h, 0);\n   used.resize(h, 0);\n   for (int i = n - 1; i >= 0; i--) {\n     for (int j = 0; j <= h - 1; j++) used[j] = 0;\n     for (int j : a[i]) used[j] = 1;\n     for (int& j : dp) j = inf;\n     int suf = 0;\n     for (int j = h - 1; j >= 0; j--) {\n       if (used[j]) suf += 3;\n       int cur = suf + pr[max(j - 1, 0)];\n       mini(dp[j], cur);\n       if (j) cur += 2 + j * (j + 1) / 2;\n       mini(dp[0], cur);\n     }\n     for (int j = 0; j <= h - 2; j++) mini(dp[j + 1], dp[j]);\n     swap(dp, pr);\n   }\n   ans += pr[0];\n   out(ans);\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   Solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n bool comp(int a, int b) { return (a > b); }\n int main() {\n   int a, b, n, l, t, m, x, ans, r;\n   long long cek;\n   scanf('%d %d %d', &a, &b, &n);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d %d %d', &l, &t, &m);\n     if (t < a + (long long)(l - 1) * b)\n       printf('-1\n');\n     else {\n       x = 1;\n       ans = l;\n       while (x > 0) {\n         r = ans + x;\n         cek = ((a + (long long)(r - 1) * b + a + (long long)(l - 1) * b) *\n                (r - l + 1)) /\n               2;\n         cek = max(cek / m + (cek % m == 0 ? 0 : 1), a + (long long)(r - 1) * b);\n         if (cek <= t)\n           ans += x, x *= 2;\n         else\n           x /= 2;\n       }\n       printf('%d\n', ans);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int fun(string s, int i) {\n   int k = 0;\n   while (s[i] == '0' & i >= 0) {\n     k++;\n     i--;\n   }\n   return k;\n }\n int main(int argc, char const *argv[]) {\n   string s;\n   int a, k = 0, count = 1;\n   cin >> a;\n   cin >> s;\n   string ans = '';\n   int i = s.size() - 1;\n   if (s[i] == '0') {\n     while (s[i] == '0') {\n       ans = ans + '0';\n       i--;\n     }\n   }\n   while (i >= 0) {\n     k = 0;\n     if (s[i] == '1') {\n       while (s[i] == '1' && i >= 0) {\n         k++;\n         i--;\n       }\n       ans = ans + char('0' + k);\n     } else if (s[i] == '0') {\n       int t = fun(s, i);\n       i = i - t;\n       while (t > 1) {\n         ans = ans + '0';\n         t = t - 1;\n       }\n     }\n   }\n   reverse(ans.begin(), ans.end());\n   int myint1 = stoi(ans);\n   cout << myint1;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAX_N = 55;\n int n, m, dp[MAX_N][MAX_N][MAX_N][MAX_N];\n char a[MAX_N][MAX_N];\n int dfs(int x1, int y1, int x2, int y2) {\n   if (dp[x1][y1][x2][y2] >= 0) {\n     return dp[x1][y1][x2][y2];\n   }\n   if (x1 == x2 && y1 == y2) {\n     return dp[x1][y1][x2][y2] = a[x1][y1] == '#';\n   }\n   int &ans = dp[x1][y1][x2][y2];\n   ans = max(x2 - x1 + 1, y2 - y1 + 1);\n   for (int i = x1; i < x2; ++i) {\n     ans = min(ans, dfs(x1, y1, i, y2) + dfs(i + 1, y1, x2, y2));\n   }\n   for (int j = y1; j < y2; ++j) {\n     ans = min(ans, dfs(x1, y1, x2, j) + dfs(x1, j + 1, x2, y2));\n   }\n   return ans;\n }\n int main() {\n   scanf('%d', &n);\n   memset(dp, -1, sizeof dp);\n   for (int i = 1; i <= n; ++i) {\n     scanf('%s', a[i] + 1);\n   }\n   printf('%d\n', dfs(1, 1, n, n));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<long long int> 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 <bits/stdc++.h>\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<char, int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n long long cubes[100001], x;\n long long my_pow(long long x) { return x * x * x; }\n pair<long long, long long> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<int> graph[MAXN];\n vector<pair<int, int>> 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 <bits/stdc++.h>\n using namespace std;\n vector<pair<double, double>> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const int N = 25;\n long long n, ans[N];\n pair<int, int> 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 <bits/stdc++.h>\n using namespace std;\n long long int gcd(long long int a, long long int b) {\n   return b == 0 ? a : gcd(b, a % b);\n }\n inline long long int lbt(long long int x) { return x & -x; }\n inline void fail() {\n   cout << '-1' << endl;\n   exit(0);\n }\n int main() {\n   long long int a, b, c, d, e, f, h, x(0);\n   cin >> a >> b >> c >> d;\n   e = a * b;\n   f = c * d;\n   h = gcd(e, f);\n   e /= h, f /= h;\n   if (e == 1) {\n     while (c % 3 == 0 && f != lbt(f)) ++x, c /= 3, c <<= 1, f /= 3, f <<= 1;\n     while (d % 3 == 0 && f != lbt(f)) ++x, d /= 3, d <<= 1, f /= 3, f <<= 1;\n     ;\n   } else if (f == 1) {\n     while (a % 3 == 0 && e != lbt(e)) ++x, a /= 3, a <<= 1, e /= 3, e <<= 1;\n     while (b % 3 == 0 && e != lbt(e)) ++x, b /= 3, b <<= 1, e /= 3, e <<= 1;\n     ;\n   } else if (e == lbt(e)) {\n     h = f;\n     while (h % 3 == 0) h /= 3;\n     if (h != 1) fail();\n     ;\n     while (c % 3 == 0 && f != lbt(f)) ++x, c /= 3, c <<= 1, f /= 3, f <<= 1;\n     while (d % 3 == 0 && f != lbt(f)) ++x, d /= 3, d <<= 1, f /= 3, f <<= 1;\n     ;\n   } else if (f == lbt(f)) {\n     h = e;\n     while (h % 3 == 0) h /= 3;\n     if (h != 1) fail();\n     ;\n     while (a % 3 == 0 && e != lbt(e)) ++x, a /= 3, a <<= 1, e /= 3, e <<= 1;\n     while (b % 3 == 0 && e != lbt(e)) ++x, b /= 3, b <<= 1, e /= 3, e <<= 1;\n     ;\n   } else\n     fail();\n   while ((~c & 1) && e < f) ++x, c >>= 1, f >>= 1;\n   while ((~d & 1) && e < f) ++x, d >>= 1, f >>= 1;\n   ;\n   while ((~a & 1) && f < e) ++x, a >>= 1, e >>= 1;\n   while ((~b & 1) && f < e) ++x, b >>= 1, e >>= 1;\n   ;\n FINAL:\n   cout << x << endl << a << ' ' << b << endl << c << ' ' << d << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long n, l, r;\n long long gerar(long long n) {\n   if (n == 0) {\n     return 0;\n   }\n   return 2 * gerar(n / 2) + 1;\n }\n long long solve(long long esq, long long dir, long long l, long long r,\n                 long long valor) {\n   long long mid = (esq + dir) / 2;\n   long long res = 0;\n   if (valor == 1) {\n     return 1;\n   }\n   if (valor == 0) {\n     return 0;\n   }\n   if (mid >= l && mid <= r) {\n     res += valor % 2ll;\n   }\n   if (mid - 1 >= l) {\n     res += solve(esq, mid - 1, l, r, valor / 2ll);\n   }\n   if (mid + 1 <= r) {\n     res += solve(mid + 1, dir, l, r, valor / 2ll);\n   }\n   return res;\n }\n int main() {\n   scanf('%lld %lld %lld', &n, &l, &r);\n   long long qtd = gerar(n);\n   printf('%lld\n', solve(1, qtd, l, r, n));\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long add(long long a, long long b) {\n   a += b;\n   if (a >= 998244353) {\n     a -= 998244353;\n   }\n   return a;\n }\n long long sub(long long a, long long b) {\n   a -= b;\n   if (a < 0) {\n     a += 998244353;\n   }\n   return a;\n }\n long long mul(long long a, long long b) { return (a * b) % 998244353; }\n void add_self(long long& a, long long b) { a = add(a, b); }\n void sub_self(long long& a, long long b) { a = sub(a, b); }\n void mul_self(long long& a, long long b) { a = mul(a, b); }\n const long long MAXN = 200010;\n long long fpower(long long x, long long y, long long p) {\n   long long res = 1;\n   x = x % p;\n   while (y > 0) {\n     if (y & 1) res = (res * x) % p;\n     y = y >> 1;\n     x = (x * x) % p;\n   }\n   return res;\n }\n int main() {\n   long long x, y;\n   cin >> x >> y;\n   cout << fpower(2, x + y, 998244353) << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int num[500005];\n int maps[500005];\n int to[500005];\n int main() {\n   ios::sync_with_stdio(0);\n   int n, m;\n   int l, r;\n   scanf('%d%d', &n, &m);\n   for (int i = 1; i <= n; i++) {\n     scanf('%d', &num[i]);\n     to[num[i]] = i;\n   }\n   for (int i = 1; i <= m; i++) {\n     scanf('%d%d', &l, &r);\n     if (to[r] < to[l]) {\n       int tmp = r;\n       r = l;\n       l = tmp;\n     }\n     maps[to[r]] = max(to[l], maps[to[r]]);\n   }\n   l = 1;\n   long long ans = 0;\n   for (int i = 1; i <= n; i++) {\n     if (maps[i] >= l) l = maps[i] + 1;\n     ans += i - l + 1;\n   }\n   cout << ans << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     long long n, k;\n     cin >> n >> k;\n     long long i = 1, cnt = 0;\n     while (i < k && i < n) {\n       cnt++;\n       i = i * 2;\n     }\n     if (i < n) {\n       cnt += (n - i) / k;\n       if ((n - i) % k) cnt++;\n     }\n     cout << cnt << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using UL = unsigned int;\n using ULL = unsigned long long;\n using LL = long long;\n int N;\n int CB[300000];\n int CN[300000];\n int Bbuf = 0, Nbuf = 0;\n int F(int cn, int cb) {\n   int ans = 0;\n   for (int i = 0; i < (N); i++) {\n     ans = max(ans, abs(cn - CN[i]));\n     ans = max(ans, abs(cb - CB[i]));\n     ans = max(ans, abs((cn - CN[i]) - (cb - CB[i])));\n   }\n   return ans;\n }\n int FF(int cb) {\n   int lN, rN;\n   lN = -1;\n   rN = 500010;\n   if (cb == 0) lN = 0;\n   while (lN + 2 < rN) {\n     int m1N = (lN + lN + rN) / 3, m2N = (lN + rN + rN) / 3;\n     if (F(m1N, cb) < F(m2N, cb))\n       rN = m2N;\n     else\n       lN = m1N;\n   }\n   Nbuf = lN + 1;\n   return F(Nbuf, cb);\n }\n int main() {\n   cin >> N;\n   for (int i = 0; i < (N); i++) {\n     CB[i] = CN[i] = 0;\n     string S;\n     cin >> S;\n     for (char c : S)\n       if (c == 'B')\n         CB[i]++;\n       else if (c == 'N')\n         CN[i]++;\n   }\n   int lB, rB;\n   lB = -1;\n   rB = 500010;\n   while (lB + 2 < rB) {\n     int m1B = (lB + lB + rB) / 3, m2B = (lB + rB + rB) / 3;\n     if (FF(m1B) < FF(m2B))\n       rB = m2B;\n     else\n       lB = m1B;\n   }\n   Bbuf = lB + 1;\n   FF(Bbuf);\n   printf('%d\n', F(Nbuf, Bbuf));\n   for (int i = 0; i < (Bbuf); i++) printf('B');\n   for (int i = 0; i < (Nbuf); i++) printf('N');\n   printf('\n');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n set<int> S;\n int n, a[500005], b[500005], q[500005], r;\n int main() {\n   scanf('%d', &n);\n   n *= 2;\n   int tot = 0;\n   for (int i = 1; i <= n; i++) {\n     char c = getchar();\n     while (c != '+' && c != '-') c = getchar();\n     if (c == '+')\n       q[++r] = ++tot, b[i] = 0;\n     else {\n       int x;\n       scanf('%d', &x);\n       b[i] = x;\n       if (!r) return puts('NO'), 0;\n       a[q[r]] = x;\n       r--;\n     }\n   }\n   if (r) return puts('NO'), 0;\n   tot = 0;\n   for (int i = 1; i <= n; i++) {\n     if (!b[i]) {\n       ++tot;\n       S.insert(a[tot]);\n     } else {\n       int p = (*S.begin());\n       S.erase(S.begin());\n       if (p != b[i]) return puts('NO'), 0;\n     }\n   }\n   puts('YES');\n   for (int i = 1; i <= n / 2; i++) printf('%d ', a[i]);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   scanf('%d', &t);\n   while (t--) {\n     int n;\n     scanf('%d', &n);\n     int a[n], b[n];\n     for (int i = 0; i < n; i++) scanf('%d%d', &a[i], &b[i]);\n     if (a[0] < b[0])\n       printf('NO\n');\n     else {\n       int f = 1;\n       for (int i = 1; i < n; i++) {\n         if (a[i] < a[i - 1] || b[i] < b[i - 1]) {\n           f = 0;\n           break;\n         }\n         if (a[i] - a[i - 1] < b[i] - b[i - 1]) {\n           f = 0;\n           break;\n         }\n       }\n       if (f)\n         printf('YES\n');\n       else\n         printf('NO\n');\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const double pi = acos(-1.0);\n const int inf = (int)1e9;\n struct vert {\n   int to, z, num;\n };\n struct ans {\n   int x, y, z;\n };\n const int N = (int)(1e5) + 5;\n int n, m;\n vector<vert> g[N];\n vector<int> d(N, inf);\n vector<int> dp(N, inf);\n vector<int> pr(N, -1);\n vector<bool> road(N);\n void go() {\n   queue<int> q;\n   q.push(0);\n   d[0] = 0;\n   while (!q.empty()) {\n     int v = q.front();\n     q.pop();\n     for (int i = 0; i < (int)g[v].size(); ++i) {\n       int to = g[v][i].to;\n       if (d[to] == inf) {\n         d[to] = d[v] + 1;\n         q.push(to);\n       }\n     }\n   }\n }\n void getAns() {\n   queue<int> q;\n   q.push(n - 1);\n   dp[n - 1] = 0;\n   while (!q.empty()) {\n     int v = q.front();\n     q.pop();\n     for (int i = 0; i < (int)g[v].size(); ++i) {\n       int to = g[v][i].to;\n       int z = 1 - g[v][i].z;\n       if (d[to] + 1 == d[v]) {\n         if (dp[to] > dp[v] + z) {\n           dp[to] = dp[v] + z;\n           pr[to] = v;\n         }\n         q.push(to);\n       }\n     }\n   }\n }\n int main() {\n   cin >> n >> m;\n   vert p;\n   int kol = 0;\n   for (int i = 0; i < m; ++i) {\n     int x, y, z;\n     scanf('%d %d %d', &x, &y, &z);\n     --x;\n     --y;\n     p.z = z;\n     p.num = i;\n     if (z == 0) {\n       ++kol;\n     }\n     p.to = y;\n     g[x].push_back(p);\n     p.to = x;\n     g[y].push_back(p);\n   }\n   go();\n   getAns();\n   vector<ans> out;\n   ans a;\n   int v = 0;\n   for (int to = pr[0]; to != -1; to = pr[to]) {\n     vert now;\n     for (int k = 0; k < g[v].size(); ++k) {\n       if (g[v][k].to == to) {\n         now = g[v][k];\n         break;\n       }\n     }\n     road[now.num] = true;\n     if (now.z == 0) {\n       a.x = v + 1;\n       a.y = to + 1;\n       a.z = 1;\n       out.push_back(a);\n     }\n     v = to;\n   }\n   for (int i = 0; i < n; ++i) {\n     for (int j = 0; j < (int)g[i].size(); ++j) {\n       if (road[g[i][j].num]) {\n         continue;\n       }\n       if (g[i][j].z == 1) {\n         a.x = i + 1;\n         a.y = g[i][j].to + 1;\n         a.z = 0;\n         road[g[i][j].num] = true;\n         out.push_back(a);\n       }\n     }\n   }\n   cout << out.size() << '\n';\n   for (int i = 0; i < out.size(); ++i) {\n     cout << out[i].x << ' ' << out[i].y << ' ' << out[i].z << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int mod = (int)1e9 + 7;\n struct matrix {\n   int A[2][2] = {0};\n   matrix operator*(matrix B) {\n     matrix C;\n     for (int i = 0; i < 2; i++)\n       for (int j = 0; j < 2; j++)\n         for (int k = 0; k < 2; k++)\n           C[i][j] = (C[i][j] + 1ll * A[i][k] * B[k][j]) % mod;\n     return C;\n   }\n   matrix operator+(matrix B) {\n     matrix C;\n     for (int i = 0; i < 2; i++)\n       for (int j = 0; j < 2; j++) C[i][j] = (A[i][j] + B[i][j]) % mod;\n     return C;\n   }\n   matrix pow(int n) {\n     matrix B, C = *this;\n     for (int i = 0; i < 2; i++) B[i][i] = 1;\n     while (n) {\n       if (n & 1) B = B * C;\n       C = C * C;\n       n >>= 1;\n     }\n     return B;\n   }\n   int *operator[](int i) { return A[i]; }\n };\n matrix fib;\n struct segment_tree {\n   struct node {\n     node *node_l, *node_r;\n     int l, r;\n     matrix sum, mul;\n   } * root;\n   node *build(vector<int> &a, int l, int r) {\n     node *res = new node;\n     res->l = l;\n     res->r = r;\n     res->mul[0][0] = res->mul[1][1] = 1;\n     if (l == r) {\n       res->sum = fib.pow(a[l]);\n       res->node_l = res->node_r = nullptr;\n     } else {\n       int m = (l + r) >> 1;\n       res->node_l = build(a, l, m);\n       res->node_r = build(a, m + 1, r);\n       res->sum = res->node_l->sum + res->node_r->sum;\n     }\n     return res;\n   }\n   void build(vector<int> &a) { root = build(a, 0, a.size() - 1); }\n   void push(node *root) {\n     if (root->mul[1][0] + root->mul[0][0] + root->mul[0][1] + root->mul[1][1] ==\n         2)\n       return;\n     if (root->node_l) {\n       root->node_l->mul = root->node_l->mul * root->mul;\n       root->node_l->sum = root->node_l->sum * root->mul;\n     }\n     if (root->node_r) {\n       root->node_r->mul = root->node_r->mul * root->mul;\n       root->node_r->sum = root->node_r->sum * root->mul;\n     }\n     root->mul[0][0] = root->mul[1][1] = 1;\n     root->mul[1][0] = root->mul[0][1] = 0;\n   }\n   void update(node *root, int l, int r) {\n     if (root->l > r || root->r < l) return;\n     if (root->l >= l && root->r <= r) {\n       root->sum = root->sum * fib;\n       root->mul = root->mul * fib;\n     } else {\n       push(root);\n       update(root->node_l, l, r);\n       update(root->node_r, l, r);\n       root->sum = root->node_l->sum + root->node_r->sum;\n     }\n   }\n   void update(int l, int r) { update(root, l, r); }\n   matrix query(node *root, int l, int r) {\n     push(root);\n     if (root->l > r || root->r < l) return matrix();\n     if (root->l >= l && root->r <= r) return root->sum;\n     return query(root->node_l, l, r) + query(root->node_r, l, r);\n   }\n   matrix query(int l, int r) { return query(root, l, r); }\n };\n int main() {\n   fib[0][1] = fib[1][0] = fib[0][0] = 1;\n   int n, m;\n   scanf('%d %d', &n, &m);\n   vector<int> v(n);\n   for (int &p : v) scanf('%d', &p);\n   segment_tree sg;\n   sg.build(v);\n   for (int i = 0; i < m; i++) {\n     int t, l, r;\n     scanf('%d %d %d', &t, &l, &r);\n     l--, r--;\n     if (t == 1) {\n       int x;\n       scanf('%d', &x);\n       matrix tmp = fib;\n       fib = fib.pow(x);\n       sg.update(l, r);\n       fib = tmp;\n     } else {\n       printf('%d\n', sg.query(l, r)[0][1]);\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[110], b[110];\n int main() {\n   int n;\n   cin >> n;\n   for (int i = 1; i <= n; ++i) cin >> a[i];\n   sort(a + 1, a + 1 + n);\n   int aa = a[n];\n   cin >> n;\n   for (int i = 1; i <= n; ++i) cin >> b[i];\n   sort(b + 1, b + 1 + n);\n   int bb = b[n];\n   cout << aa << ' ' << bb << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 0x3f3f3f3f;\n const long long LINF = 0x3f3f3f3f3f3f3f3f;\n int v[1010];\n bool compare(pair<int, int> a, pair<int, int> b) {\n   if (a.second != b.second) return a.second > b.second;\n   if (v[a.first] != v[b.first]) return v[a.first] < v[b.first];\n   return a.first < b.first;\n }\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   int n;\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> v[i];\n   vector<pair<int, int> > ret;\n   for (int i = 0; i < n; i++) {\n     for (int j = i + 1; j < n; j++) {\n       if (v[j] < v[i]) ret.push_back({i, j});\n     }\n   }\n   sort(ret.begin(), ret.end(), compare);\n   cout << ret.size() << '\n';\n   for (auto x : ret) {\n     cout << x.first + 1 << ' ' << x.second + 1 << '\n';\n   }\n   exit(0);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void fast() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(NULL), cout.tie(NULL);\n }\n int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }\n int lcm(int a, int b) { return a * (b / gcd(a, b)); }\n char maze[1001][1001];\n int main() {\n   fast();\n   int num, one = 0, two = 0, there = 0, six = 0, fou = 0;\n   cin >> num;\n   ;\n   for (int i = 0; i < num; i++) {\n     int x;\n     cin >> x;\n     one += bool(x == 1);\n     two += bool(x == 2);\n     there += bool(x == 3);\n     fou += bool(x == 4);\n     six += bool(x == 6);\n   }\n   if ((fou + six) != num / 3 || (one) != num / 3 || (two + there) != num / 3) {\n     cout << -1 << endl;\n     return 0;\n   }\n   vector<string> vs;\n   for (int i = 0; i < num / 3; i++) {\n     string s = '';\n     s += '1';\n     s += ' ';\n     if (there == six && six && there) {\n       s += '3', s += ' ', s += '6';\n       six--, there--;\n     } else if (two) {\n       s += '2';\n       s += ' ';\n       if (fou)\n         s += '4', fou--;\n       else if (six)\n         s += '6', six--;\n       else {\n         cout << -1 << endl;\n         return 0;\n       }\n       two--;\n     } else {\n       cout << -1 << endl;\n       return 0;\n     }\n     vs.push_back(s);\n   }\n   for (int i = 0; i < vs.size(); i++) {\n     cout << vs[i] << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   const int maxN = 2 * 1e5;\n   int answers[maxN];\n   int n, m, x, neg = 0, pos = 0;\n   cin >> n >> m;\n   for (int i = 0; i < n; i++) {\n     cin >> x;\n     if (x == -1)\n       neg++;\n     else\n       pos++;\n   }\n   int li, ri, range;\n   for (int i = 0; i < m; i++) {\n     cin >> li >> ri;\n     range = ri - li + 1;\n     if (range % 2 != 0)\n       answers[i] = 0;\n     else if (pos >= range / 2 && neg >= range / 2) {\n       answers[i] = 1;\n     } else {\n       answers[i] = 0;\n     }\n   }\n   for (int i = 0; i < m; i++) {\n     cout << answers[i] << endl;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <typename T>\n inline vector<T> getvector(int len) {\n   vector<T> a(len);\n   for (auto &it : a) cin >> it;\n   return a;\n }\n inline vector<int> getvector(int len) {\n   vector<int> a(len);\n   for (auto &it : a) cin >> it;\n   return a;\n }\n inline vector<pair<int, int>> getvector_andPairCnt(int len) {\n   vector<pair<int, int>> 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 <typename T>\n T sqr(T x) {\n   return x * x;\n }\n template <typename T>\n ostream &operator<<(ostream &os, const vector<T> &v) {\n   for (auto it : v) os << it << ' ';\n   os << '\n';\n   return os;\n }\n template <typename T, typename H>\n inline vector<pair<T, H>> getvector_andBiPair(int len) {\n   vector<pair<T, H>> a(len);\n   for (auto &it : a) {\n     cin >> it.first >> it.second;\n   }\n   return a;\n }\n template <typename T>\n inline set<T> vector_to_set(const vector<T> &vec) {\n   set<T> 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 <bits/stdc++.h>\n using namespace std;\n void split(string &s, vector<string> &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 <bits/stdc++.h>\n using namespace std;\n int has[205][205];\n int vis[205][205];\n vector<pair<int, int> > 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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<double> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int ABS(int a) {\n   if (a < 0) return (-a);\n   return a;\n }\n void input() {}\n int a[100005];\n int seg[100005];\n int nxt[100005];\n int hop[100005];\n void readInt(int &n) {\n   n = 0;\n   char ch = getchar();\n   while (!isdigit(ch)) ch = getchar();\n   while (isdigit(ch)) {\n     n = n * 10 + ch - 48;\n     ch = getchar();\n   }\n }\n int main() {\n   input();\n   int n, q;\n   readInt(n);\n   readInt(q);\n   int sq = sqrt(n);\n   int c = 0, cnt = 0;\n   for (int i = (0); i < (n); ++i) {\n     readInt(a[i]);\n     seg[i] = cnt;\n     c++;\n     if (c == sq) c = 0, cnt++;\n   }\n   for (int i = (n - 1); i >= (0); --i) {\n     int to = i + a[i];\n     hop[i] = 1;\n     if (to >= n)\n       nxt[i] = -1;\n     else if (seg[to] != seg[i])\n       nxt[i] = to;\n     else {\n       nxt[i] = nxt[to];\n       hop[i] += hop[to];\n     }\n   }\n   while (q--) {\n     int type;\n     readInt(type);\n     if (type == 0) {\n       int x, y;\n       readInt(x);\n       readInt(y);\n       x--;\n       int i = x;\n       a[x] = y;\n       while (i >= 0) {\n         if (seg[i] != seg[x]) break;\n         int to = i + a[i];\n         hop[i] = 1;\n         if (to >= n)\n           nxt[i] = -1;\n         else if (seg[to] != seg[i])\n           nxt[i] = to;\n         else {\n           nxt[i] = nxt[to];\n           hop[i] += hop[to];\n         }\n         i--;\n       }\n     } else {\n       int x;\n       readInt(x);\n       x--;\n       int ans = 0;\n       int last = x;\n       while (x != -1) {\n         ans += hop[x];\n         last = x;\n         x = nxt[x];\n       }\n       while (last + a[last] < n) last = last + a[last];\n       printf('%d %d\n', last + 1, ans);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int mx = 200100;\n struct node {\n   int x, y, z;\n } a[mx];\n struct nod {\n   int id, x;\n } b[mx];\n int fa[mx];\n long long num[mx];\n long long ans[mx];\n int n, m;\n bool cmp(node x, node y) { return x.z < y.z; }\n bool cmp1(nod x, nod y) { return x.x < y.x; }\n int find(int x) {\n   if (x != fa[x]) {\n     return fa[x] = find(fa[x]);\n   }\n   return fa[x];\n }\n int main() {\n   cin >> n >> m;\n   for (int i = 1; i <= n; i++) fa[i] = i, num[i] = 1;\n   for (int i = 1; i < n; i++) {\n     cin >> a[i].x >> a[i].y >> a[i].z;\n   }\n   for (int i = 1; i <= m; i++) {\n     cin >> b[i].x;\n     b[i].id = i;\n   }\n   sort(a + 1, a + n, cmp);\n   sort(b + 1, b + m + 1, cmp1);\n   int l = 1;\n   long long sum = 0;\n   for (int i = 1; i < n; i++) {\n     while (l <= m && a[i].z > b[l].x) {\n       ans[b[l].id] = sum;\n       l++;\n     }\n     int x = find(a[i].x);\n     int y = find(a[i].y);\n     sum += num[y] * num[x];\n     fa[x] = y;\n     num[y] += num[x];\n   }\n   while (l <= m) {\n     if (a[n - 1].z <= b[l].x) {\n       ans[b[l].id] = sum;\n     }\n     l++;\n   }\n   for (int i = 1; i <= m; i++) cout << ans[i] << ' \n'[i == m];\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long int a[100005], ans[100005];\n int main() {\n   long long int n, i, j;\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> j;\n     a[j] += 1 * j;\n   }\n   ans[1] = a[1];\n   ans[2] = a[2];\n   ans[3] = a[1] + a[3];\n   for (i = 4; i < 100005; i++) {\n     ans[i] = max(ans[i - 2] + a[i], ans[i - 3] + a[i]);\n   }\n   cout << ans[100004];\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n using ll = long long;\n int main() {\n   int T;\n   cin >> T;\n   while (T--) {\n     int n;\n     cin >> n;\n     long double theta = 3.14159265358979323846 / (2 * n);\n     long double answer = 1 / tan(theta);\n     cout << setprecision(15) << answer << '\n';\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int M = 1 << 20, L = 100020;\n char s[L];\n int n, m, g[M], f[M], i, j, k, x, y, D;\n void init() {\n   scanf('%d%d%s', &n, &m, s + 1);\n   D = (1 << m) - 1;\n   for (i = 1; i < n; i++) {\n     x = s[i] - 97;\n     y = s[i + 1] - 97;\n     if (x != y) g[1 << x | 1 << y]++;\n   }\n   for (j = 0; j < m; j++)\n     for (i = 0; i <= D; i++)\n       if (i >> j & 1) g[i] += g[i ^ 1 << j];\n }\n int min(int x, int y) { return x < y ? x : y; }\n void work() {\n   memset(f, 0x3f, sizeof(f));\n   f[0] = 0;\n   for (i = 0; i <= D; i++)\n     for (j = 0; j < m; j++)\n       if ((i >> j & 1) == 0)\n         f[i | 1 << j] = min(f[i | 1 << j], f[i] + g[D] - g[i] - g[D ^ i]);\n   printf('%d', f[D]);\n }\n int main() {\n   init();\n   work();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n int main() {\n   string s;\n   cin >> s;\n   int n = s.length();\n   vector<int> 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<int> 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<int> 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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n const int N = 2010;\n std::set<std::pair<long long, int>> 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<long long, int> 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 <bits/stdc++.h>\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<string, string> 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 <bits/stdc++.h>\n using namespace std;\n template <class Key, class Value>\n struct Heap {\n   Value p[100100];\n   int pos[100100];\n   vector<Key> 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<int, long long int> hp;\n template <class T>\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<int>& S);\n };\n int from[100100];\n long long int dis[100100];\n template <class T>\n void Graph<T>::dijkstra(vector<int>& 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<long long int> g;\n bool k[100100];\n vector<int> 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<pair<long long int, pair<int, int> > > 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 <bits/stdc++.h>\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 <bits/stdc++.h>\n #pragma comment(linker, '/STACK:167772160')\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   pair<int, int> 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 <bits/stdc++.h>\n using namespace std;\n long long int n, k, a, b;\n vector<long long int> arr;\n long long int rec(long long int l, long long int r) {\n   long long int i = lower_bound(arr.begin(), arr.end(), l) - arr.begin();\n   long long int j = upper_bound(arr.begin(), arr.end(), r) - arr.begin();\n   long long int x = j - i;\n   long long int val;\n   if (x == 0) {\n     val = a;\n   } else {\n     val = b * x * (r - l + 1);\n   }\n   if (l == r || x == 0) {\n     return val;\n   }\n   long long int mid = (l + r) / 2;\n   return min(val, rec(l, mid) + rec(mid + 1, r));\n }\n int main() {\n   cin >> n >> k >> a >> b;\n   for (int i = 0; i < k; i++) {\n     int x;\n     cin >> x;\n     arr.push_back(x);\n   }\n   sort(arr.begin(), arr.end());\n   long long int start = 1;\n   long long int end = pow(2, n);\n   cout << rec(start, end) << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n char s[10];\n int main() {\n   scanf('%s', s);\n   int res = 1;\n   for (int i = 1; i < 7; i++) {\n     if (s[i] == '1')\n       res += 10, i++;\n     else\n       res += s[i] - '0';\n   }\n   printf('%d\n', res);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e6 + 10;\n char s[N];\n int main() {\n   vector<int> v1, v2;\n   scanf('%s', s);\n   int len = strlen(s);\n   for (int i = 0; i < len; i++) {\n     if (s[i] == 'l') {\n       v1.push_back(i + 1);\n     } else\n       v2.push_back(i + 1);\n   }\n   for (int x : v2) printf('%d\n', x);\n   for (int i = (int)v1.size() - 1; i >= 0; i--) printf('%d\n', v1[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 1e5 + 100;\n int n, p[4], bx[N], wx, by[N], wy, sum[N][4];\n vector<int> wh[N];\n struct node {\n   int x, y, c;\n } sh[N];\n bool cmp(node a, node b) { return a.x < b.x; }\n inline int read() {\n   int f = 1, x = 0;\n   char s = getchar();\n   while (s < '0' || s > '9') {\n     if (s == '-') f = -1;\n     s = getchar();\n   }\n   while (s >= '0' && s <= '9') {\n     x = x * 10 + s - '0';\n     s = getchar();\n   }\n   return x * f;\n }\n struct bit {\n   int sh[N];\n   void init() { memset(sh, 0, sizeof(sh)); }\n   int lowbit(int x) { return x & (-x); }\n   void change(int x, int v) {\n     while (x <= n) sh[x] += v, x += lowbit(x);\n   }\n   int query(int x) {\n     int ans = 0;\n     while (x) ans += sh[x], x -= lowbit(x);\n     return ans;\n   }\n   int ask(int l, int r) { return query(r) - query(l - 1); }\n } T[4];\n int g(int l, int r, int c) { return sum[r][c] - sum[l - 1][c]; }\n void init() {\n   memset(sum, 0, sizeof(sum));\n   wx = wy = 0;\n   for (int i = 1; i <= n; i++) bx[++wx] = sh[i].x;\n   sort(bx + 1, bx + 1 + wx);\n   wx = unique(bx + 1, bx + 1 + wx) - bx - 1;\n   for (int i = 1; i <= n; i++)\n     sh[i].x = lower_bound(bx + 1, bx + 1 + wx, sh[i].x) - bx;\n   for (int i = 1; i <= n; i++) by[++wy] = sh[i].y;\n   sort(by + 1, by + 1 + wy);\n   wy = unique(by + 1, by + 1 + wy) - by - 1;\n   for (int i = 1; i <= n; i++)\n     sh[i].y = lower_bound(by + 1, by + 1 + wy, sh[i].y) - by;\n   sort(sh + 1, sh + 1 + n, cmp);\n   for (int i = 1; i <= n; i++) sum[sh[i].x][sh[i].c]++;\n   for (int i = 1; i <= wx; i++)\n     for (int j = 1; j <= 3; j++) sum[i][j] += sum[i - 1][j];\n }\n int solve() {\n   for (int i = 1; i <= wx; i++) wh[i].clear();\n   for (int i = 1; i <= n; i++) wh[sh[i].x].push_back(i);\n   for (int i = 1; i <= 3; i++) p[i] = i;\n   int ans = 1;\n   do {\n     for (int i = 2; i <= wx; i++) {\n       int A = sum[i - 1][p[1]], l = i, r = wx - 1;\n       while (l < r) {\n         int mid = l + ((r - l + 1) >> 1);\n         if (g(i, mid, p[2]) <= g(mid + 1, wx, p[3]))\n           l = mid;\n         else\n           r = mid - 1;\n       }\n       ans = max(ans, min({A, g(i, l, p[2]), g(l + 1, wx, p[3])}));\n       l++;\n       ans = max(ans, min({A, g(i, l, p[2]), g(l + 1, wx, p[3])}));\n     }\n   } while (next_permutation(p + 1, p + 4));\n   for (int i = 1; i <= 3; i++) p[i] = i;\n   auto find = [](int A, int &ans) {\n     int l = 1, r = wy - 1;\n     while (l < r) {\n       int mid = l + ((r - l + 1) >> 1);\n       if (T[p[2]].ask(1, mid) <= T[p[3]].ask(mid + 1, wy))\n         l = mid;\n       else\n         r = mid - 1;\n     }\n     ans = max(ans, min({A, T[p[2]].ask(1, l), T[p[3]].ask(l + 1, wy)}));\n     l++;\n     ans = max(ans, min({A, T[p[2]].ask(1, l), T[p[3]].ask(l + 1, wy)}));\n   };\n   do {\n     T[p[2]].init();\n     T[p[3]].init();\n     for (int i = wx; i >= 1; i--) {\n       int A = g(1, i, p[1]);\n       find(A, ans);\n       for (int j : wh[i])\n         if (sh[j].c != p[1]) T[sh[j].c].change(sh[j].y, 1);\n     }\n   } while (next_permutation(p + 1, p + 4));\n   for (int i = 1; i <= 3; i++) p[i] = i;\n   do {\n     T[p[2]].init();\n     T[p[3]].init();\n     for (int i = 1; i <= wx; i++) {\n       int A = g(i, wx, p[1]);\n       find(A, ans);\n       for (int j : wh[i])\n         if (sh[j].c != p[1]) T[sh[j].c].change(sh[j].y, 1);\n     }\n   } while (next_permutation(p + 1, p + 4));\n   return ans;\n }\n signed main() {\n   n = read();\n   for (int i = 1; i <= n; i++) sh[i] = (node){read(), read(), read()};\n   init();\n   int ans = solve();\n   for (int i = 1; i <= n; i++) swap(sh[i].x, sh[i].y);\n   init();\n   ans = max(ans, solve());\n   printf('%d\n', ans * 3);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n static const int MAXN = 50004;\n static const int MAXE = 100004 * 2;\n static const int MAXL = 20;\n static const int MAXT = 1000005;\n int n, e;\n int head[MAXN], dest[MAXE], next[MAXE];\n int l[MAXN], t[MAXN][MAXL];\n int T = 0;\n int p[MAXN];\n int conf[MAXN], team[MAXN];\n int team_conf[MAXT];\n inline void add_edge(int u, int v) {\n   static int w = 0;\n   dest[w] = v;\n   next[w] = head[u];\n   head[u] = w++;\n }\n int main() {\n   scanf('%d%d', &n, &e);\n   for (int i = 0; i < n; ++i) head[i] = -1;\n   int u, v;\n   for (int i = 0; i < e; ++i) {\n     scanf('%d%d', &u, &v);\n     --u, --v;\n     add_edge(u, v);\n     add_edge(v, u);\n   }\n   for (int i = 0; i < n; ++i) {\n     scanf('%d', &l[i]);\n     for (int j = 0; j < l[i]; ++j) {\n       scanf('%d', &t[i][j]);\n       --t[i][j];\n       T = std::max(T, t[i][j]);\n     }\n   }\n   ++T;\n   srand(87665544);\n   for (int i = 0; i < n; ++i) p[i] = i;\n   for (int attempts = 0;; ++attempts) {\n     if (attempts % 16 == 0) {\n       std::random_shuffle(p, p + n);\n       std::fill(conf, conf + n, -1);\n       int ct[2];\n       for (int i = 0; i < n; ++i) {\n         ct[0] = ct[1] = 0;\n         for (int w = head[p[i]]; w != -1; w = next[w]) {\n           if (conf[dest[w]] != -1) ++ct[conf[dest[w]]];\n         }\n         conf[p[i]] = (ct[0] > ct[1] ? 1 : 0);\n       }\n     }\n     for (int i = 0; i < T; ++i) team_conf[i] = rand() % 2;\n     bool valid = true;\n     for (int i = 0; i < n; ++i) {\n       team[i] = -1;\n       for (int j = 0; j < l[i]; ++j)\n         if (conf[i] == team_conf[t[i][j]]) {\n           team[i] = t[i][j];\n           break;\n         }\n       if (team[i] == -1) {\n         valid = false;\n         break;\n       }\n     }\n     if (!valid) continue;\n     for (int i = 0; i < n; ++i)\n       printf('%d%c', team[i] + 1, i == n - 1 ? '\n' : ' ');\n     for (int i = 0; i < T; ++i)\n       printf('%d%c', team_conf[i] + 1, i == T - 1 ? '\n' : ' ');\n     break;\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int n, m;\n int ans = 654;\n vector<int> a, b, us(10);\n int main() {\n   cin >> n >> m;\n   a.resize(n);\n   b.resize(m);\n   for (int i = 0; i < n; ++i) {\n     cin >> a[i];\n     us[a[i]] = 1;\n   }\n   for (int j = 0; j < m; ++j) {\n     cin >> b[j];\n     if (us[b[j]] == 1) {\n       ans = min(ans, b[j]);\n     }\n   }\n   sort(a.begin(), a.end());\n   sort(b.begin(), b.end());\n   cout << min({(a[0] * 10) + b[0], (b[0] * 10) + a[0], ans});\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline void read(int &x) {\n   x = 0;\n   char c = getchar();\n   int f = 1;\n   while (!isdigit(c)) {\n     if (c == '-') f = -1;\n     c = getchar();\n   }\n   while (isdigit(c)) {\n     x = x * 10 + c - '0';\n     c = getchar();\n   }\n   x *= f;\n }\n const int N = 505000;\n int n, a[N], ans[N];\n int main() {\n   read(n);\n   for (int i = 1; i <= n; i++) read(a[i]);\n   for (int i = 0; i <= n - 2; i++) {\n     if ((n - i) & 1)\n       ans[i] = max(min(a[(1 + n - i) / 2],\n                        max(a[(1 + n - i) / 2 + 1], a[(1 + n - i) / 2 - 1])),\n                    min(a[(1 + n + i) / 2],\n                        max(a[(1 + n + i) / 2 + 1], a[(1 + n + i) / 2 - 1])));\n     else\n       ans[i] = max(a[(n - i + 1) / 2], a[(n + i + 2) / 2]);\n     if ((n & 1) && i == 1) ans[i] = max(ans[i], a[n / 2 + 1]);\n     if (i - 2 >= 0) ans[i] = max(ans[i], ans[i - 2]);\n   }\n   for (int i = 1; i <= n; i++) ans[n - 1] = max(ans[n - 1], a[i]);\n   for (int i = 0; i <= n - 1; i++) printf('%d ', ans[i]);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MOD = 1000000007;\n int dp[1001][2010];\n int digit[1002], k;\n void init() { memset(dp, -1, sizeof dp); }\n int dfs(int pos, int dist, bool doing) {\n   if (pos == -1) return dist == 0;\n   if (!doing && dp[pos][dist] != -1) return dp[pos][dist];\n   int ans = 0;\n   int end = doing ? digit[pos] : 9;\n   for (int i = 0; i <= end; i++) {\n     int nextdist = dist == 0 ? 0 : dist + 1;\n     if (i == 4 || i == 7) {\n       if (dist <= k)\n         nextdist = 0;\n       else\n         nextdist = 1;\n     }\n     ans = (ans + dfs(pos - 1, nextdist, doing && i == end)) % MOD;\n   }\n   if (!doing) dp[pos][dist] = ans;\n   return ans;\n }\n int cal(char x[]) {\n   int pos = 0, l = strlen(x);\n   while (pos < l) {\n     digit[pos] = x[l - pos - 1] - '0';\n     pos++;\n   }\n   return dfs(pos - 1, k + 2, 1);\n }\n bool check(char x[]) {\n   int dist = k + 1;\n   for (int i = 0; i < strlen(x); i++) {\n     if (!dist) break;\n     if (x[i] == '4' || x[i] == '7') {\n       if (dist <= k)\n         dist = 0;\n       else\n         dist = 1;\n     } else\n       dist++;\n   }\n   return dist == 0;\n }\n int main() {\n   int T;\n   init();\n   char a[1002], b[1002];\n   scanf('%d %d', &T, &k);\n   while (T--) {\n     scanf('%s %s', a, b);\n     int ansa = cal(a);\n     int ansb = cal(b);\n     if (check(a)) ansa--;\n     ansb = ((ansb - ansa) % MOD + MOD) % MOD;\n     printf('%d\n', ansb);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<string> vec_splitter(string s) {\n   s += ',';\n   vector<string> res;\n   while (!s.empty()) {\n     res.push_back(s.substr(0, s.find(',')));\n     s = s.substr(s.find(',') + 1);\n   }\n   return res;\n }\n void debug_out(vector<string> __attribute__((unused)) args,\n                __attribute__((unused)) int idx,\n                __attribute__((unused)) int LINE_NUM) {\n   cerr << '\n';\n }\n template <typename Head, typename... Tail>\n void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {\n   if (idx > 0)\n     cerr << ', ';\n   else\n     cerr << 'Line(' << LINE_NUM << ') ';\n   stringstream ss;\n   ss << H;\n   cerr << args[idx] << ' = ' << ss.str();\n   debug_out(args, idx + 1, LINE_NUM, T...);\n }\n void run() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(nullptr), cout.tie(nullptr);\n }\n const int N = 5e4 + 4, MOD = 1e9 + 7, mod2 = 998244353;\n int dp[N][503];\n int n, k;\n vector<int> adj[N];\n long long ans;\n void dfs(int u, int p) {\n   dp[u][0] = 1;\n   for (auto &v : adj[u]) {\n     if (v == p) continue;\n     dfs(v, u);\n     for (int i = 0; i < k; ++i) {\n       dp[u][i + 1] += dp[v][i];\n     }\n   }\n   long long sum = 0;\n   for (auto &v : adj[u]) {\n     if (v == p) continue;\n     for (int i = 1; i < k; ++i) {\n       sum += dp[v][i - 1] * (dp[u][k - i] - dp[v][k - i - 1]);\n     }\n   }\n   ans += dp[u][k] + sum / 2;\n }\n int main() {\n   run();\n   cin >> n >> k;\n   for (int i = 0; i < (int)(n - 1); ++i) {\n     int u, v;\n     cin >> u >> v;\n     adj[v].push_back(u);\n     adj[u].push_back(v);\n   }\n   dfs(1, -1);\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void Genawy() {\n   std::ios_base::sync_with_stdio(0);\n   cin.tie(NULL);\n }\n int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }\n int n, cost[305];\n int length[305];\n map<pair<int, int>, int> dp;\n int solve(int ind, int gc) {\n   if (ind == n) return gc == 1 ? 0 : 1e9;\n   if (dp.find({ind, gc}) != dp.end()) return dp[{ind, gc}];\n   dp[{ind, gc}] = solve(ind + 1, gc);\n   dp[{ind, gc}] =\n       min(dp[{ind, gc}], solve(ind + 1, gcd(gc, length[ind])) + cost[ind]);\n   return dp[{ind, gc}];\n }\n int main() {\n   Genawy();\n   cin >> n;\n   for (int i = 0; i < n; i++) cin >> length[i];\n   for (int i = 0; i < n; i++) cin >> cost[i];\n   int ans = solve(0, 0);\n   if (ans >= 1e9) ans = -1;\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int compare(const void *a, const void *b) {\n   long long la = *(long long *)a;\n   long long lb = *(long long *)b;\n   return la == lb ? 0 : la < lb ? -1 : 1;\n }\n long long aa[8], aa_[8];\n int bb[8], dp[8][1 << (8 - 1)];\n char pp[8];\n int n, ans = 0x3f3f3f3f;\n void solve(int i) {\n   int j;\n   if (i == n) {\n     int cnt, sum;\n     cnt = 0, sum = 0;\n     for (i = 0; i < n; i++) {\n       int k;\n       if (!pp[i]) cnt++;\n       k = dp[i][bb[i]];\n       sum += k == 1 && bb[i] == 0 ? 1 : k + 1;\n     }\n     if (cnt >= 2) sum++;\n     if (ans > sum) ans = sum;\n     return;\n   }\n   solve(i + 1);\n   pp[i] = 1;\n   for (j = i + 1; j < n; j++)\n     if (aa_[j] % aa[i] == 0) {\n       aa_[j] /= aa[i], bb[j] ^= 1 << i;\n       solve(i + 1);\n       aa_[j] *= aa[i], bb[j] ^= 1 << i;\n     }\n   pp[i] = 0;\n }\n int main() {\n   int i, j;\n   scanf('%d', &n);\n   for (i = 0; i < n; i++) scanf('%lld', &aa[i]);\n   qsort(aa, n, sizeof *aa, compare);\n   for (i = 0; i < n; i++) {\n     long long a;\n     int k, p, b;\n     a = aa[i];\n     k = 0;\n     for (p = 2; p <= a / p; p++)\n       while (a % p == 0) {\n         k++;\n         a /= p;\n       }\n     if (a > 1) k++;\n     dp[i][0] = k;\n     for (b = 1; b < 1 << i; b++) {\n       a = aa[i];\n       k = dp[i][0];\n       for (j = 0; j < i; j++)\n         if ((b & 1 << j)) {\n           if (a % aa[j] != 0) {\n             k = -1;\n             break;\n           }\n           a /= aa[j];\n           k -= dp[j][0];\n         }\n       dp[i][b] = k;\n     }\n   }\n   for (i = 0; i < n; i++) aa_[i] = aa[i];\n   solve(0);\n   printf('%d\n', ans);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n vector<string> v;\n int main() {\n   string x, y;\n   int cnt = 0;\n   char temp;\n   int n;\n   cin >> n;\n   n = n + n - 1;\n   for (int i = 0; i < n; i++) {\n     cin >> x;\n     if (x == '**') continue;\n     cin >> y;\n     x += y;\n     sort(v.begin(), v.end());\n     if (binary_search(v.begin(), v.end(), x)) continue;\n     cnt++;\n     v.push_back(x);\n     for (int j = 1; j <= 3; j++) {\n       y = '';\n       if (j == 1) {\n         y += x[2];\n         y += x[0];\n         y += x[3];\n         y += x[1];\n         v.push_back(y);\n       } else if (j == 2) {\n         y += x[3];\n         y += x[2];\n         y += x[1];\n         y += x[0];\n         v.push_back(y);\n       } else if (j == 3) {\n         y += x[1];\n         y += x[3];\n         y += x[0];\n         y += x[2];\n         v.push_back(y);\n       }\n     }\n   }\n   cout << cnt;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 5;\n const int inf = 1 << 30;\n int n, qn, tot = 0, head[N], col[N], nowHead[N], deg[N], seq[N];\n int dfsc = 0, id[N], siz[N], fa[N], son[N], dep[N], top[N];\n bool vis[N];\n struct Edge {\n   int to, nxt;\n } e[N << 1];\n inline void add(int from, int to) {\n   e[++tot].to = to;\n   e[tot].nxt = head[from];\n   head[from] = tot;\n }\n struct Seg {\n   int l, r, c;\n   inline Seg(int L = 0, int R = 0, int C = 0) { l = L, r = R, c = C; }\n   friend bool operator<(const Seg x, const Seg y) { return x.l < y.l; }\n };\n set<Seg> seg[N];\n template <typename T>\n inline void read(T &X) {\n   X = 0;\n   char ch = 0;\n   T op = 1;\n   for (; ch > '9' || ch < '0'; ch = getchar())\n     if (ch == '-') op = -1;\n   for (; ch >= '0' && ch <= '9'; ch = getchar())\n     X = (X << 3) + (X << 1) + ch - 48;\n   X *= op;\n }\n namespace Bit {\n int s[N << 1];\n inline void modify(int p, int v) {\n   if (!p) return;\n   for (; p < (N << 1); p += (p & (-p))) s[p] += v;\n }\n inline int query(int p) {\n   int res = 0;\n   for (; p > 0; p -= (p & (-p))) res += s[p];\n   return res;\n }\n }  // namespace Bit\n void dfs1(int x, int fat, int depth) {\n   fa[x] = fat, dep[x] = depth, siz[x] = 1;\n   int maxson = -1;\n   for (int i = head[x]; i; i = e[i].nxt) {\n     int y = e[i].to;\n     if (y == fat) continue;\n     dfs1(y, x, depth + 1);\n     siz[x] += siz[y];\n     if (siz[y] > maxson) {\n       maxson = siz[y];\n       son[x] = y;\n     }\n   }\n }\n void dfs2(int x, int topf) {\n   top[x] = topf, id[x] = ++dfsc;\n   if (!son[x]) return;\n   dfs2(son[x], topf);\n   for (int i = head[x]; i; i = e[i].nxt) {\n     int y = e[i].to;\n     if (y == fa[x] || y == son[x]) continue;\n     dfs2(y, y);\n   }\n }\n inline int getLca(int x, int y) {\n   for (; top[x] != top[y];) {\n     if (dep[top[x]] < dep[top[y]]) swap(x, y);\n     x = fa[top[x]];\n   }\n   return dep[x] < dep[y] ? x : y;\n }\n inline int getDis(int x, int y) {\n   return dep[x] + dep[y] - 2 * dep[getLca(x, y)];\n }\n inline set<Seg>::iterator getSeg(set<Seg> &s, int l) {\n   set<Seg>::iterator it = s.lower_bound(Seg(l, inf, 0));\n   if (it != s.end() && it->l == l) return it;\n   --it;\n   int nowl = it->l, nowr = it->r, nowc = it->c;\n   s.erase(it);\n   if (l - 1 >= nowl) s.insert(Seg(nowl, l - 1, nowc));\n   s.insert(Seg(l, nowr, nowc));\n   return s.lower_bound(Seg(l, nowr, nowc));\n }\n inline void ins(set<Seg> &s, int l, int r, int c, int st) {\n   set<Seg>::iterator itl = getSeg(s, l), itr;\n   if (r + 1 <= id[st] + siz[st] - 1)\n     itr = getSeg(s, r + 1);\n   else\n     itr = s.end();\n   for (set<Seg>::iterator it = itl; it != itr; ++it) {\n     Bit ::modify(it->c, -((it->r) - (it->l) + 1));\n   }\n   Bit ::modify(c, r - l + 1);\n   s.erase(itl, itr), s.insert(Seg(l, r, c));\n }\n inline void modify(int x, int y, int c) {\n   nowHead[c] = y;\n   for (; top[x] != top[y];) {\n     if (dep[top[x]] < dep[top[y]]) swap(x, y);\n     ins(seg[top[x]], id[top[x]], id[x], c, top[x]);\n     x = fa[top[x]];\n   }\n   if (dep[x] > dep[y]) swap(x, y);\n   ins(seg[top[x]], id[x], id[y], c, top[x]);\n }\n inline int solve(int x) {\n   int c = getSeg(seg[top[x]], id[x])->c;\n   return Bit ::query(c - 1) + getDis(x, nowHead[c]) + 1;\n }\n int main() {\n   read(n), read(qn);\n   for (int x, y, i = 1; i < n; i++) {\n     read(x), read(y);\n     ++deg[x], ++deg[y];\n     add(x, y), add(y, x);\n   }\n   dfs1(1, 0, 1), dfs2(1, 1);\n   int cnt = 0;\n   set<int> q;\n   for (int i = 1; i <= n; i++)\n     if (deg[i] == 1) q.insert(i), vis[i] = 1;\n   for (; !q.empty();) {\n     int now = (*q.begin());\n     q.erase(*q.begin());\n     seq[now] = ++cnt;\n     nowHead[cnt] = now;\n     seg[top[now]].insert(Seg(id[now], id[now], cnt));\n     Bit ::modify(cnt, 1);\n     for (int i = head[now]; i; i = e[i].nxt) {\n       if (vis[e[i].to]) continue;\n       --deg[e[i].to];\n       if (deg[e[i].to] == 1 && !vis[e[i].to])\n         q.insert(e[i].to), vis[e[i].to] = 1;\n     }\n   }\n   int lst = n;\n   for (char op[9]; qn--;) {\n     scanf('%s', op);\n     if (op[0] == 'u') {\n       int x;\n       read(x);\n       modify(x, lst, ++cnt);\n       lst = x;\n     }\n     if (op[0] == 'w') {\n       int x;\n       read(x);\n       printf('%d\n', solve(x));\n     }\n     if (op[0] == 'c') {\n       int x, y;\n       read(x), read(y);\n       printf('%d\n', solve(x) < solve(y) ? x : y);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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<int> arr;\n   vector<bool> 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<vector<int>> &gr, int v, vector<int> &in,\n          vector<int> &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<vector<int>> 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<int> 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 <bits/stdc++.h>\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<int> 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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n struct node {\n   int x, y;\n } arr[104];\n vector<int> graph[105];\n int visited[105] = {0};\n void dfs(int i) {\n   visited[i] = 1;\n   int j = 0;\n   while (j < graph[i].size()) {\n     if (visited[graph[i][j]] == 0) {\n       dfs(graph[i][j]);\n     }\n     j++;\n   }\n }\n int main() {\n   int n;\n   scanf('%d', &n);\n   int x, y;\n   for (int i = 0; i < n; i++) {\n     scanf('%d%d', &x, &y);\n     arr[i].x = x;\n     arr[i].y = y;\n   }\n   int hash[102] = {0};\n   int ct = 0;\n   for (int i = 0; i < n; i++) {\n     int flag = 0;\n     for (int j = 0; j < n; j++) {\n       if (i == j) continue;\n       if (arr[j].x == arr[i].x || arr[j].y == arr[i].y) {\n         graph[i].push_back(j);\n         graph[j].push_back(i);\n         flag = 1;\n       }\n     }\n     if (flag == 0) visited[i] = 1;\n   }\n   for (int i = 0; i < n; i++) {\n     if (visited[i] == 0) {\n       dfs(i);\n       ct++;\n     }\n   }\n   int c = 0;\n   for (int i = 0; i < n; i++) {\n     if (!graph[i].size()) c++;\n   }\n   printf('%d\n', c - 1 + ct);\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MAXT = (1 << 18) + 5;\n int icT[MAXT], dcT[MAXT];\n const int MAXN = 100010;\n int a[MAXN], idxofa[MAXN], b[MAXN];\n int n;\n priority_queue<pair<int, int> > dc, ic;\n int main() {\n   scanf('%d', &n);\n   for (int i = 1; i <= (int)(n); i++) {\n     scanf('%d', &a[i]);\n     idxofa[a[i]] = i;\n   }\n   for (int i = 0; i < (int)(MAXT); i++) icT[i] = dcT[i] = 1000000000;\n   int NN = (1 << 17) - 1;\n   for (int i = 1; i <= (int)(n); i++) {\n     scanf('%d', &b[i]);\n     if (i > idxofa[b[i]]) {\n       dc.push(make_pair(-(i - idxofa[b[i]]), b[i]));\n       dcT[NN + b[i]] = abs(i - idxofa[b[i]]);\n       for (int node = (NN + b[i]) / 2; node; node >>= 1)\n         dcT[node] = min(dcT[2 * node], dcT[2 * node + 1]);\n     } else {\n       ic.push(make_pair(-(i - 1), b[i]));\n       icT[NN + b[i]] = abs(i - idxofa[b[i]]);\n       for (int node = (NN + b[i]) / 2; node; node >>= 1)\n         icT[node] = min(icT[2 * node], icT[2 * node + 1]);\n     }\n   }\n   for (int t = 0; t < n; t++) {\n     int dcres = dcT[1] - t;\n     int icres = icT[1] + t;\n     printf('%d\n', min(dcres, icres));\n     while (dc.size() > 0 && -dc.top().first == t) {\n       pair<int, int> qt = dc.top();\n       dc.pop();\n       ic.push(make_pair(-t - (idxofa[qt.second] - 1), qt.second));\n       dcT[NN + qt.second] = 1000000000;\n       icT[NN + qt.second] = -t;\n       for (int node = (NN + qt.second) / 2; node; node >>= 1)\n         icT[node] = min(icT[2 * node], icT[2 * node + 1]);\n       for (int node = (NN + qt.second) / 2; node; node >>= 1)\n         dcT[node] = min(dcT[2 * node], dcT[2 * node + 1]);\n     }\n     while (ic.size() > 0 && -ic.top().first == t) {\n       pair<int, int> qt = ic.top();\n       ic.pop();\n       dc.push(make_pair(-t - (n - idxofa[qt.second]) - 1, qt.second));\n       icT[NN + qt.second] = 1000000000;\n       dcT[NN + qt.second] = t + 1 + n - idxofa[qt.second];\n       for (int node = (NN + qt.second) / 2; node; node >>= 1)\n         icT[node] = min(icT[2 * node], icT[2 * node + 1]);\n       for (int node = (NN + qt.second) / 2; node; node >>= 1)\n         dcT[node] = min(dcT[2 * node], dcT[2 * node + 1]);\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 2e5 + 10;\n const long long inf = 0x3f3f3f3f3f3f3f3f;\n int n, k, b, c;\n int a[N], A[N], cost[N];\n long long ans = inf;\n void solve(int x) {\n   for (int i = 1; i <= n; ++i) {\n     A[i] = a[i];\n     cost[i] = 0;\n     while (A[i] % 5 != x) ++A[i], cost[i] += c;\n   }\n   priority_queue<long long> heap;\n   long long res = 0;\n   for (int i = 1; i <= k; ++i) {\n     long long val = 5 * cost[i] - 1LL * b * A[i];\n     res += val;\n     heap.push(val);\n   }\n   ans = min(ans, (res + 1LL * k * b * A[k]) / 5);\n   for (int i = k + 1; i <= n; ++i) {\n     long long val = 5 * cost[i] - 1LL * b * A[i];\n     if (val < heap.top()) {\n       res -= heap.top();\n       heap.pop();\n       heap.push(val);\n       res += val;\n     }\n     ans = min(ans, (res + 1LL * k * b * A[i]) / 5);\n   }\n }\n int main() {\n   cin >> n >> k >> b >> c;\n   for (int i = 1; i <= n; ++i) {\n     scanf('%d', &a[i]);\n     a[i] += 1e9;\n   }\n   sort(a + 1, a + n + 1);\n   b = min(b, c * 5);\n   for (int i = 0; i < 5; ++i) solve(i);\n   cout << ans << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int N = 1e5 + 5;\n const int OO = 1e9 + 7;\n using namespace std;\n long long n, m, dishes[N], cost[N];\n priority_queue<pair<long long, long long>, vector<pair<long long, long long>>,\n                greater<pair<long long, long long>>>\n     q;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   cin >> n >> m;\n   for (int i = 0; i < n; i++) cin >> dishes[i];\n   for (int i = 0; i < n; i++) cin >> cost[i], q.push({cost[i], i});\n   for (int i = 0; i < m; i++) {\n     long long kind, numofdishes, COST = 0;\n     cin >> kind >> numofdishes;\n     kind--;\n     if (numofdishes <= dishes[kind]) {\n       COST += (numofdishes * cost[kind]);\n       dishes[kind] -= numofdishes;\n       cout << COST << '\n';\n     } else {\n       COST += (dishes[kind] * cost[kind]);\n       numofdishes -= dishes[kind];\n       dishes[kind] = 0;\n       while (!q.empty() && numofdishes > 0) {\n         if (dishes[q.top().second] <= 0) {\n           q.pop();\n           continue;\n         }\n         if (numofdishes <= dishes[q.top().second]) {\n           COST += (numofdishes * q.top().first);\n           dishes[q.top().second] -= numofdishes;\n           numofdishes = 0;\n         } else {\n           COST += (dishes[q.top().second] * q.top().first);\n           numofdishes -= dishes[q.top().second];\n           dishes[q.top().second] = 0;\n         }\n         if (dishes[q.top().second] <= 0) {\n           q.pop();\n           continue;\n         }\n       }\n       if (numofdishes > 0)\n         cout << 0 << '\n';\n       else\n         cout << COST << '\n';\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void myswap(int& a, int& b) {\n   int temp;\n   temp = a;\n   a = b;\n   b = temp;\n }\n void fun(vector<int>& vec, int k, int l, int r) {\n   if (k <= 1 || l >= r - 1) {\n     return;\n   }\n   int mid = (l + r) / 2;\n   if (k == 3) {\n     myswap(vec[mid - 1], vec[mid]);\n     return;\n   }\n   k--;\n   int p = k / 2;\n   if (p % 2 == 1) {\n     fun(vec, p, l, mid);\n     fun(vec, p, mid, r);\n   } else if (mid - l >= r - mid) {\n     fun(vec, p + 1, l, mid);\n     fun(vec, p - 1, mid, r);\n   } else {\n     fun(vec, p - 1, l, mid);\n     fun(vec, p + 1, mid, r);\n   }\n }\n int _count(int l, int r) {\n   if (l >= r) {\n     return 0;\n   }\n   if (l == r - 1) {\n     return 1;\n   }\n   int mid = (l + r) / 2;\n   return 1 + _count(l, mid) + _count(mid, r);\n }\n int main() {\n   int n, k, i, j;\n   cin >> n >> k;\n   if (k % 2 == 0) {\n     cout << -1;\n   } else if (k == 1) {\n     for (i = 1; i <= n; i++) {\n       cout << i << ' ';\n     }\n   } else {\n     int mm = _count(0, n);\n     if (k > mm) {\n       cout << -1;\n     } else {\n       vector<int> vec;\n       for (i = 1; i <= n; i++) {\n         vec.push_back(i);\n       }\n       fun(vec, k, 0, n);\n       for (i = 0; i < n; i++) {\n         cout << vec[i] << ' ';\n       }\n     }\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   while (t--) {\n     int n, k;\n     cin >> n >> k;\n     string s;\n     cin >> s;\n     int freq[26] = {0};\n     vector<int> v;\n     for (int i = 0; i < s.length(); ++i) {\n       freq[s[i] - 'a']++;\n     }\n     for (int i = 0; i < 26; ++i) {\n       v.push_back(freq[i]);\n     }\n     sort(v.begin(), v.end());\n     int maxAns = 1;\n     for (int i = 1; i <= k; ++i) {\n       if (k % i == 0) {\n         for (int j = i; j <= n; j += i) {\n           int ans = 0;\n           int div = j / i;\n           for (int k = 0; k < v.size(); ++k) {\n             ans += v[k] / div;\n           }\n           if (ans >= i) {\n             maxAns = max(maxAns, j);\n           }\n         }\n       }\n     }\n     cout << maxAns << endl;\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int t;\n long long n, k, d1, d2, td1, td2, x1, x2, x3;\n bool solve() {\n   if (n % 3) return false;\n   for (int i = -1; i <= 1; ++i)\n     for (int j = -1; j <= 1; ++j) {\n       if (i == 0 || j == 0) continue;\n       d1 = i * td1;\n       d2 = j * td2;\n       if ((d1 * 2 + d2 + k) % 3 || (d2 - d1 + k) % 3 || (k - d1 - 2 * d2) % 3)\n         continue;\n       x1 = d1 * 2 + d2 + k;\n       x2 = d2 - d1 + k;\n       x3 = k - d1 - 2 * d2;\n       if (x1 <= n && x2 <= n && x3 <= n && x1 >= 0 && x2 >= 0 && x3 >= 0)\n         return true;\n     }\n   return false;\n }\n int main() {\n   scanf('%d', &t);\n   while (t--) {\n     scanf('%lld%lld%lld%lld', &n, &k, &td1, &td2);\n     puts(solve() ? 'yes' : 'no');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int n;\n char str[50];\n int F[50], sz[50];\n inline int find(int x) { return x == F[x] ? x : F[x] = find(F[x]); }\n inline void merge(int x, int y) {\n   x = find(x);\n   y = find(y);\n   if (x == y) return;\n   F[y] = x;\n   sz[x] += sz[y];\n }\n std::vector<int> G[55];\n int id[66];\n int e[25];\n int f[(1 << 23) + 5], g[(1 << 23) + 5], coe[(1 << 23) + 5];\n int main() {\n   scanf('%d', &n);\n   for (int i = 0; i <= n - 1; ++i) F[i] = i, sz[i] = 1;\n   for (int i = 0; i <= n - 1; ++i) {\n     scanf('%s', str);\n     for (int j = i + 1; j <= n - 1; ++j) {\n       if (str[j] == 'A') merge(i, j);\n       if (str[j] == 'X') G[i].emplace_back(j), G[j].emplace_back(i);\n     }\n   }\n   int ans = n - 1;\n   n = 0;\n   for (int i = 0; i <= ans; ++i) id[i] = find(i);\n   for (int i = 0; i <= ans; ++i)\n     for (auto x : G[i])\n       if (id[i] == id[x]) {\n         puts('-1');\n         exit(0);\n       }\n   for (int i = 0; i <= ans; ++i) {\n     if (sz[id[i]] == 1) {\n       id[i] = -1;\n       continue;\n     }\n     if (id[i] != i) {\n       id[i] = id[id[i]];\n       continue;\n     }\n     id[i] = n++;\n   }\n   if (n <= 1) {\n     printf('%d\n', ans + n);\n     return 0;\n   }\n   assert(n <= 23);\n   for (int i = 0; i <= ans; ++i)\n     for (auto x : G[i])\n       if (~id[i] && ~id[x]) e[id[i]] |= (1 << id[x]);\n   f[0] = coe[0] = 1;\n   for (int S = 1; S <= (1 << n) - 1; ++S) {\n     int lb = __builtin_ctz(S);\n     f[S] = (!(e[lb] & S)) & f[S ^ (1 << lb)];\n     coe[S] = -coe[S ^ (1 << lb)];\n   }\n   for (int i = 0; i <= n - 1; ++i) {\n     for (int S = 0; S <= (1 << n) - 1; ++S) {\n       if ((S >> i) & 1) f[S] += f[S ^ (1 << i)];\n     }\n   }\n   for (int i = 0; i <= (1 << n) - 1; ++i) g[i] = f[i];\n   for (int k = 1; k <= n; ++k) {\n     auto chk = [&]() {\n       int ans = 0;\n       for (int S = 0; S <= (1 << n) - 1; ++S) ans += g[S] * coe[S];\n       return ans != 0;\n     };\n     if (chk()) {\n       printf('%d\n', ans + k);\n       return 0;\n     }\n     for (int S = 0; S <= (1 << n) - 1; ++S) g[S] *= f[S];\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n int main() {\n   int n;\n   while (scanf('%d', &n) != EOF) {\n     if (n % 2 == 1) {\n       printf('-1\n');\n       continue;\n     }\n     printf('2 1');\n     for (int i = 3; i < n; i = i + 2) printf(' %d %d', i + 1, i);\n     printf('\n');\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n map<int, int> Map;\n pair<int, int> a[250001];\n vector<int> b[250001], t[250001];\n char type;\n long long ans;\n int len[250001], n, m, i, q, l, r, d, mid, nom, nomN, zn, sum;\n bool pole[250001];\n int get(int tl, int tr, int nom, int l, int r, int nomT) {\n   if (tl > tr) return 0;\n   if (tl > r || tr < l) return 0;\n   if (l <= tl && tr <= r) return t[nomT][nom];\n   int mid = (tl + tr) / 2;\n   return get(tl, mid, nom * 2, l, r, nomT) +\n          get(mid + 1, tr, nom * 2 + 1, l, r, nomT);\n }\n void update(int tl, int tr, int nom, int nomN, int zn, int nomT) {\n   if (tl > tr) return;\n   if (tl > nomN || tr < nomN) return;\n   t[nomT][nom] += zn;\n   if (tl == tr) return;\n   int mid = (tl + tr) / 2;\n   update(tl, mid, nom * 2, nomN, zn, nomT);\n   update(mid + 1, tr, nom * 2 + 1, nomN, zn, nomT);\n }\n int main() {\n   ios::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n >> m >> q;\n   for (i = 0; i < n; i++)\n     if (!pole[i]) {\n       nom = i;\n       d++;\n       t[d].push_back(0);\n       b[d].push_back(0);\n       while (!pole[nom]) {\n         pole[nom] = true;\n         len[d]++;\n         a[nom + 1] = make_pair(d, len[d]);\n         b[d].push_back(nom);\n         t[d].push_back(0);\n         t[d].push_back(0);\n         t[d].push_back(0);\n         t[d].push_back(0);\n         nom = (nom + m) % n;\n       }\n     }\n   while (q--) {\n     cin >> type;\n     if (type == '+') {\n       cin >> zn >> nom;\n       nom++;\n       sum = 0;\n       if (get(1, len[a[nom].first], 1, a[nom].second, len[a[nom].first],\n               a[nom].first) != len[a[nom].first] - a[nom].second + 1) {\n         l = a[nom].second;\n         r = len[a[nom].first];\n         while (l <= r) {\n           mid = (l + r) / 2;\n           if (get(1, len[a[nom].first], 1, a[nom].second, mid, a[nom].first) !=\n               mid - a[nom].second + 1) {\n             r = mid - 1;\n             sum = mid - a[nom].second;\n           } else\n             l = mid + 1;\n         }\n         update(1, len[a[nom].first], 1, a[nom].second + sum, 1, a[nom].first);\n         Map[zn] = b[a[nom].first][a[nom].second + sum] + 1;\n       } else {\n         ans += len[a[nom].first] - a[nom].second + 1;\n         l = 1;\n         r = a[nom].second - 1;\n         while (l <= r) {\n           mid = (l + r) / 2;\n           if (get(1, len[a[nom].first], 1, 1, mid, a[nom].first) != mid) {\n             r = mid - 1;\n             sum = mid - 1;\n           } else\n             l = mid + 1;\n         }\n         update(1, len[a[nom].first], 1, sum + 1, 1, a[nom].first);\n         Map[zn] = b[a[nom].first][sum + 1] + 1;\n       }\n       ans += sum;\n     } else {\n       cin >> zn;\n       nom = Map[zn];\n       update(1, len[a[nom].first], 1, a[nom].second, -1, a[nom].first);\n     }\n   }\n   cout << ans << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long int nax = 1e5 + 5;\n void solve() {\n   long long int n;\n   cin >> n;\n   vector<long long int> a(n);\n   for (auto &x : a) cin >> x;\n   long long int sum = 0, mx = 0;\n   for (long long int i = 0; i < n - 1; i++) {\n     sum += max((long long int)0, a[i] - a[i + 1]);\n   }\n   cout << sum << '\n';\n }\n int32_t main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   long long int t = 1;\n   cin >> t;\n   while (t--) solve();\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n inline int read() {\n   int n = 0, f = 1, ch = getchar();\n   while (ch < '0' || ch > '9') {\n     if (ch == '-') f = -1;\n     ch = getchar();\n   }\n   while (ch >= '0' && ch <= '9') {\n     n = n * 10 + ch - '0';\n     ch = getchar();\n   }\n   return n * f;\n }\n char a[2000005], b[2000005];\n int n;\n int c[2000005];\n int get(int x) {\n   int cur = 0, res = 0;\n   for (int i = 1; i <= n; i++) {\n     cur += x * c[i];\n     res = max(res, cur);\n     if (cur < 0) cur = 0;\n   }\n   return res;\n }\n int main() {\n   int s1 = 0, s2 = 0;\n   n = read();\n   scanf('%s%s', a + 1, b + 1);\n   for (int i = 1; i <= n; i++) {\n     if (a[i] != b[i] && a[i] == '0')\n       c[i] = -1, s1++;\n     else if (a[i] != b[i] && a[i] == '1')\n       c[i] = 1, s2++;\n   }\n   if (s1 != s2) {\n     printf('-1\n');\n     return 0;\n   }\n   printf('%d\n', max(get(1), get(-1)));\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long double sq(long double a) { return a * a; }\n long double dist(pair<long double, long double> a,\n                  pair<long double, long double> b) {\n   return sqrt((long double)(sq(a.second - b.second) + sq(a.first - b.first)));\n }\n long double mandist(pair<long long, long long> a,\n                     pair<long long, long long> b) {\n   return abs(a.second - b.second) + abs(a.first - b.first);\n }\n long long a, b, c;\n pair<long long, long long> p1, p2;\n int main() {\n   scanf(' %lld%lld%lld', &a, &b, &c);\n   scanf(' %lld%lld%lld%lld', &p1.first, &p1.second, &p2.first, &p2.second);\n   if (a == 0 || b == 0)\n     printf('%.20Lf\n', mandist(p1, p2));\n   else {\n     long double res = mandist(p1, p2);\n     long double interhoriz1 =\n         ((long double)(-c - a * p1.first)) / ((long double)b);\n     long double interhoriz2 =\n         ((long double)(-c - a * p2.first)) / ((long double)b);\n     long double intervert1 =\n         ((long double)(-c - b * p1.second)) / ((long double)a);\n     long double intervert2 =\n         ((long double)(-c - b * p2.second)) / ((long double)a);\n     res = min(res, abs((long double)p1.second - interhoriz1) +\n                        abs((long double)p2.second - interhoriz2) +\n                        dist(make_pair((long double)p1.first, interhoriz1),\n                             make_pair((long double)p2.first, interhoriz2)));\n     res = min(res, abs((long double)p1.second - interhoriz1) +\n                        abs((long double)p2.first - intervert2) +\n                        dist(make_pair((long double)p1.first, interhoriz1),\n                             make_pair(intervert2, (long double)p2.second)));\n     res = min(res, abs((long double)p1.first - intervert1) +\n                        abs((long double)p2.first - intervert2) +\n                        dist(make_pair(intervert1, (long double)p1.second),\n                             make_pair(intervert2, (long double)p2.second)));\n     res = min(res, abs((long double)p1.first - intervert1) +\n                        abs((long double)p2.second - interhoriz2) +\n                        dist(make_pair(intervert1, (long double)p1.second),\n                             make_pair((long double)p2.first, interhoriz2)));\n     printf('%.20Lf\n', res);\n   }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int a[2005], b[2005];\n int main() {\n   int n, i, j, x, y, k;\n   long long s;\n   cin >> n;\n   for (i = 0; i < n; i++) {\n     cin >> x >> y;\n     a[x + y]++;\n     b[1001 + x - y]++;\n   }\n   s = 0;\n   for (i = 0; i < 2003; i++) {\n     k = a[i];\n     s += (k - 1) * k / 2;\n     k = b[i];\n     s += (k - 1) * k / 2;\n   }\n   cout << s << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n void solve();\n signed main() {\n   ios::sync_with_stdio(false);\n   cin.tie(0);\n   cout << fixed;\n   cout.precision(12);\n   solve();\n   return 0;\n }\n template <typename T>\n void prv(vector<T> v) {\n   for (int __ii = 0; __ii < ((int)v.size()); __ii++) {\n     if (__ii) cout << ' ';\n     cout << v[__ii];\n   }\n   cout << '\n';\n }\n template <typename T>\n void prm(vector<vector<T>> v) {\n   for (int __ii = 0; __ii < ((int)v.size()); __ii++) {\n     for (int __jj = 0; __jj < v[__ii].size(); __jj++) {\n       if (__jj) cout << ' ';\n       cout << v[__ii][__jj];\n     }\n     cout << '\n';\n   }\n }\n template <typename T>\n void sc(T& x) {\n   cin >> x;\n }\n template <typename Head, typename... Tail>\n void sc(Head& head, Tail&... tail) {\n   cin >> head;\n   sc(tail...);\n }\n template <typename T>\n void pr(const T& x) {\n   cout << x << '\n';\n }\n template <typename Head, typename... Tail>\n void pr(const Head& head, const Tail&... tail) {\n   cout << head << ' ';\n   pr(tail...);\n }\n template <typename... T>\n void err(const T&... cod) {\n   pr(cod...);\n   exit(0);\n }\n void solve() {\n   int n, m, y, x;\n   sc(n, m, y, x);\n   string s;\n   sc(s);\n   int dx = (s[1] == 'L' ? -1 : 1);\n   int dy = (s[0] == 'U' ? -1 : 1);\n   const int MAX_ITER = 1e6 + 10;\n   set<pair<int, int>> st;\n   long long ans = 1;\n   for (int i = 0; i < MAX_ITER; i++) {\n     st.emplace(y, x);\n     if (((int)st.size()) == n + m - 2) err(ans);\n     int u = (dy == -1 ? y - 1 : n - y);\n     int v = (dx == -1 ? x - 1 : m - x);\n     int w = min(u, v);\n     x += dx * w;\n     y += dy * w;\n     ans += w;\n     if (v == w) dx *= -1;\n     if (u == w) dy *= -1;\n   }\n   pr(-1);\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   cin.tie(0);\n   cout.tie(0);\n   ios_base::sync_with_stdio(0);\n   string s;\n   cin >> s;\n   string v = 'aeiou';\n   string c = 'bcdfghjklmnpqrstvwxyz';\n   map<char, int> cnt;\n   map<char, int> mp;\n   for (auto i : v) mp[i] = 1;\n   for (auto i : c) mp[i] = 0;\n   string temp = '';\n   int vc = 0;\n   int cc = 0;\n   int dc = 0;\n   vector<string> ans;\n   for (int i = 0; i < s.size(); i++) {\n     if (mp[s[i]] == 1) {\n       cc = 0;\n       dc = 0;\n       for (auto j : c) cnt[j] = 0;\n     } else {\n       if (cnt[s[i]] == 0) {\n         cnt[s[i]]++;\n         dc++;\n         cc++;\n       } else {\n         cnt[s[i]]++;\n         cc++;\n       }\n     }\n     if (cc > 2 && dc > 1) {\n       ans.push_back(temp);\n       for (auto j : c) cnt[j] = 0;\n       cnt[s[i]] = 1;\n       cc = 1;\n       dc = 1;\n       temp = s[i];\n     } else\n       temp += s[i];\n   }\n   ans.push_back(temp);\n   for (auto i : ans) cout << i << ' ';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e6 + 5;\n string s[10005];\n int vis[10005];\n int main() {\n   ios::sync_with_stdio(0);\n   int n, sum(0);\n   cin >> n;\n   for (long long i = 0; i < n; ++i) cin >> s[i], sum += s[i].size();\n   char c;\n   cin >> c;\n   for (long long i = 0; i < n; ++i) s[i] += c;\n   sort(s, s + n);\n   sum = sum * 2 / n + 1;\n   for (long long i = 0; i < n; ++i)\n     if (!vis[i]) {\n       cout << s[i];\n       vis[i]++;\n       for (long long j = i + 1; j < n; ++j)\n         if (!vis[j] && sum - s[i].size() == s[j].size() - 1) {\n           cout << s[j].substr(0, s[j].size() - 1) << '\n';\n           vis[j]++;\n           break;\n         }\n     }\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   cin >> n;\n   vector<int> a(n);\n   for (int i = 0; i < n; ++i) cin >> a[i];\n   map<int, int> used;\n   int ans = 0;\n   for (int i = n - 1; i >= 0; --i) {\n     if (used[a[i]] == 0) {\n       used[a[i]] = i;\n       ans = a[i];\n     }\n   }\n   cout << ans;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long double E = 1e-7;\n const int MOD = 1e9 + 7;\n const long long MAX = 1e6 + 1;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   ;\n   int n, k;\n   cin >> n >> k;\n   int ar[n];\n   for (int i = 0; i < n; i++) cin >> ar[i];\n   int ans = INT_MIN;\n   int a[n], b[n];\n   for (int i = 0; i < n; i++)\n     for (int j = i; j < n; j++) {\n       int A = j - i + 1;\n       int B = n - A;\n       copy(ar + i, ar + j + 1, a);\n       copy(ar, ar + i, b);\n       copy(ar + j + 1, ar + n, b + i);\n       sort(a, a + A);\n       sort(b, b + B);\n       for (int l = 0, r = B - 1, q = k; l < A && r >= 0 && a[l] < b[r] && q;\n            l++, r--, --q)\n         swap(a[l], b[r]);\n       int sum = 0;\n       for (int i = 0; i < A; i++) sum += a[i];\n       ans = max(ans, sum);\n     }\n   cout << ans;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int gcd(int x, int y) {\n   if (x > y)\n     return gcd(x - y, y);\n   else if (x == y)\n     return x;\n   else\n     return gcd(x, y - x);\n }\n int main() {\n   int n, m, z;\n   cin >> n >> m >> z;\n   cout << (gcd(n, m) * z) / (n * m) << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, cnt, flag = 0;\n   cin >> n;\n   int a, b, c = 0;\n   for (int i = 1; i <= n; i++) {\n     cin >> a >> b;\n     if (b - a >= 2) ++c;\n   }\n   cout << c << endl;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, p = 0, ans = 0;\n   string s, dvg, answ, r_dvg;\n   cin >> n >> s;\n   for (int i = 0; i < n - 1; i++) {\n     dvg = s.substr(i, 2);\n     for (int j = i; j < n - 1; j++) {\n       r_dvg = s.substr(j, 2);\n       if (dvg == r_dvg) {\n         p++;\n       }\n     }\n     if (p > ans) {\n       ans = p;\n       answ = dvg;\n     }\n     p = 0;\n   }\n   cout << answ << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n struct Point {\n   long long x, y;\n   void read() { scanf('%lld%lld', &x, &y); }\n };\n long long product(const Point &o, const Point &a, const Point &b) {\n   return (a.x - o.x) * (b.y - o.y) - (b.x - o.x) * (a.y - o.y);\n }\n bool intersect(const Point &a, const Point &b, const Point &c, const Point &d) {\n   bool insect1 = product(a, c, d) * product(b, c, d) < 0;\n   bool insect2 = product(c, a, b) * product(d, a, b) < 0;\n   return insect1 && insect2;\n }\n int main() {\n   ios ::sync_with_stdio(false);\n   cout << fixed << setprecision(16);\n   int R, B;\n   scanf('%d%d', &R, &B);\n   vector<Point> bases(B);\n   vector<Point> ships(R);\n   vector<int> b(R);\n   for (int i = 0; i < R; i++) {\n     ships[i].read();\n   }\n   for (int i = 0; i < B; i++) {\n     bases[i].read();\n   }\n   if (B != R) {\n     puts('No');\n     return 0;\n   }\n   for (int i = 0; i < R; i++) {\n     b[i] = i;\n   }\n   bool yes = false;\n   do {\n     bool ok = true;\n     for (int i = 0; i < B; i++) {\n       for (int j = i + 1; j < B; j++) {\n         if (intersect(ships[b[i]], bases[i], ships[b[j]], bases[j])) {\n           ok = false;\n         }\n       }\n     }\n     if (ok) {\n       yes = true;\n       break;\n     }\n   } while (next_permutation(b.begin(), b.end()));\n   puts(yes ? 'Yes' : 'No');\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long maxn = 305000;\n long long mod = 1e9 + 7;\n long long h, w, n;\n long long dp[maxn], f[maxn], inv[maxn];\n struct stu {\n   long long x, y;\n } a[maxn];\n long long cmp(stu a, stu b) {\n   if (a.x != b.x)\n     return a.x < b.x;\n   else\n     return a.y < b.y;\n }\n long long ksm(long long base, long long b, long long mod) {\n   long long ans = 1;\n   while (b) {\n     if (b & 1) {\n       ans *= base;\n       ans %= mod;\n     }\n     base *= base;\n     base %= mod;\n     b >>= 1;\n   }\n   return ans;\n }\n void init() {\n   f[0] = 1, inv[0] = 1;\n   for (long long i = 1; i <= 200000; i++) {\n     f[i] = f[i - 1] * i % mod;\n     inv[i] = ksm(f[i], mod - 2, mod);\n   }\n }\n long long c(long long x, long long y) {\n   if (x < y)\n     return 0;\n   else\n     return f[x] * inv[y] % mod * inv[x - y] % mod;\n }\n signed main() {\n   cin >> h >> w >> n;\n   init();\n   for (long long i = 1; i <= n; i++) cin >> a[i].x >> a[i].y;\n   sort(a + 1, a + n + 1, cmp);\n   a[n + 1].x = h, a[n + 1].y = w;\n   for (long long i = 1; i <= n + 1; i++) {\n     dp[i] = c(a[i].x + a[i].y - 2, a[i].x - 1);\n     for (long long j = 1; j < i; j++) {\n       if (a[j].x > a[i].x || a[j].y > a[i].y) continue;\n       dp[i] = (dp[i] -\n                dp[j] * c(a[i].x + a[i].y - a[j].x - a[j].y, a[i].x - a[j].x)) %\n               mod;\n     }\n   }\n   cout << (dp[n + 1] + mod) % mod << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int v[3005], inv = 0, n;\n double sol;\n int main() {\n   cin >> n;\n   for (int i = 1; i <= n; i++) cin >> v[i];\n   for (int i = 1; i <= n; i++)\n     for (int j = i + 1; j <= n; j++)\n       if (v[i] > v[j]) inv++;\n   sol = double(inv) - inv / 2 + (inv / 2) * 3.0;\n   cout << fixed;\n   cout << setprecision(6);\n   cout << sol << '\n';\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int INF = 1000 * 1000 * 1000;\n int main() {\n   ios_base::sync_with_stdio(false);\n   cin.tie(0);\n   cout.tie(0);\n   int n;\n   cin >> n;\n   pair<int, int> minp1(INF, INF), minp2(INF, INF);\n   for (int i = 0; i < n; i++) {\n     int x, y;\n     cin >> x >> y;\n     minp1 = min(minp1, pair<int, int>(x, y));\n   }\n   for (int i = 0; i < n; i++) {\n     int x, y;\n     cin >> x >> y;\n     x *= -1;\n     y *= -1;\n     minp2 = min(minp2, pair<int, int>(x, y));\n   }\n   cout << minp1.first - minp2.first << ' ' << minp1.second - minp2.second;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n;\n   scanf('%d', &n);\n   printf('%d\n', (n & 1) ? (n - 1) + (n - 1) * ((n - 3) / 2) / 2\n                          : (n - 2) * (n - 2) / 4 + (n - 2));\n   if (n & 1) {\n     for (int i = 2; i <= n; i += 2) {\n       printf('%d %d %d %d\n', 3, 1, i, i + 1);\n       printf('%d %d %d %d\n', 3, 1, i, i + 1);\n       for (int j = 2; j < i; j += 2) {\n         printf('%d %d %d %d %d\n', 4, i, j, i + 1, j + 1);\n         printf('%d %d %d %d %d\n', 4, i, j, i + 1, j + 1);\n       }\n     }\n   } else {\n     puts('4 1 2 3 4'), puts('4 1 3 4 2'), puts('4 1 4 2 3');\n     for (int i = 5; i <= n; i += 2) {\n       printf('%d %d %d %d \n', 3, 1, i, i + 1);\n       printf('%d %d %d %d \n', 3, 2, i, i + 1);\n       printf('%d %d %d %d %d\n', 4, 1, i, 2, i + 1);\n       for (int j = 3; j < i; j += 2) {\n         printf('%d %d %d %d %d\n', 4, i, j, i + 1, j + 1);\n         printf('%d %d %d %d %d\n', 4, i, j, i + 1, j + 1);\n       }\n     }\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\n const int MAXN = 100100;\n struct Gao {\n   int p[MAXN], q[MAXN];\n   bool r[MAXN];\n   void init(int n) {\n     for (int i = 0; i < n; ++i) {\n       q[i] = 1;\n       r[i] = true;\n     }\n   }\n   void next(int i) {\n     if (!r[p[i]] && p[i] != i) {\n       next(p[i]);\n       q[i] += q[p[i]];\n       p[i] = p[p[i]];\n     }\n   }\n   void kill(int i) {\n     if (r[i]) {\n       next(i);\n       r[i] = false;\n     }\n   }\n } gao;\n int main() {\n   int n, m, x, y, z;\n   static int a[MAXN], b[MAXN];\n   scanf('%d%d', &n, &m);\n   gao.init(n);\n   for (int i = 0; i < n; ++i) {\n     scanf('%d', &gao.p[i]);\n     --gao.p[i];\n   }\n   for (int i = 0; i < m; ++i) {\n     scanf('%d', &a[i]);\n     --a[i];\n   }\n   for (int i = 0; i < m; ++i) {\n     scanf('%d', &b[i]);\n   }\n   z = 0;\n   for (int i = 0; i < m; ++i) {\n     x = (a[i] + z) % n;\n     y = b[i];\n     z = 0;\n     while (true) {\n       if (!gao.r[x]) {\n         gao.next(x);\n         y -= gao.q[x];\n         x = gao.p[x];\n       }\n       if (gao.r[x] && y > 0) {\n         ++z;\n         gao.kill(x);\n       } else {\n         break;\n       }\n     }\n     printf('%d\n', z);\n   }\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n using namespace std;\n const long long mk = 100005;\n long long n;\n vector<long long> 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 <bits/stdc++.h>\n using namespace std;\n const int maxn = 1e4 + 5;\n pair<int, int> p[maxn];\n set<pair<int, int> > 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<int, int> now : s) cout << now.first << ' ' << now.second << endl;\n   return 0;\n }\n "}
+{"func_code_string": "#include <bits/stdc++.h>\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 <bits/stdc++.h>\n template <class C, class E>\n inline bool contains(const C& container, const E& element) {\n   return container.find(element) != container.end();\n }\n template <class T>\n inline void checkmin(T& a, T b) {\n   if (b < a) a = b;\n }\n template <class T>\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<subset> _subsets;\n   int _setCount;\n };\n struct SetInfo {\n   set<int> _yc;\n   set<int> _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<pair<int, int> > 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<int, SetInfo> 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 <bits/stdc++.h>\n using namespace std;\n template <typename T>\n T sqr(T x) {\n   return x * x;\n }\n template <typename T>\n T abs(T x) {\n   return x < 0 ? -x : x;\n }\n template <typename T>\n T gcd(T a, T b) {\n   return b ? gcd(b, a % b) : a;\n }\n template <typename T>\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 <typename T>\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<long long> 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<long long> 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 <bits/stdc++.h>\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 "}