Upload 4 files

cpp_dataset/train/train.jsonl

@@ -48,3 +48,7 @@
 {"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 "}