problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03138 | #include <cstdio>
#include <iostream>
#define N 100005
using namespace std;
typedef long long ll;
ll n, k, s, x, c, a[N];
bool v;
int main() {
ll i, j;
cin >> n >> k;
for (i = 0; i < n; i++)
scanf("%lld", &a[i]);
for (i = 40; i >= 0; i--) {
x <<= 1;
if (!((k >> i) & 1) && !v)
continue;
c ... | #include <cstdio>
#include <iostream>
#define N 100005
using namespace std;
typedef long long ll;
ll n, k, s, x, c, a[N];
bool v;
int main() {
ll i, j;
cin >> n >> k;
for (i = 0; i < n; i++)
scanf("%lld", &a[i]);
for (i = 40; i >= 0; i--) {
x <<= 1;
if (!((k >> i) & 1) && !v)
continue;
c ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 938,926 | 938,927 | u230265105 | cpp |
p03138 | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, k, x, c, ans, a[100005];
ll f(ll p) {
ll re = 0;
for (ll i = 0; i < n; i++) {
re += (a[i] >> p & 1);
}
return re;
}
int main() {
ll i;
cin >> n >> k;
for (i = 0; i < n; i++)
scanf("%lld", &a[i]);
for (i = 4... | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, k, x, c, ans, a[100005];
ll f(ll p) {
ll re = 0;
for (ll i = 0; i < n; i++) {
re += (a[i] >> p & 1);
}
return re;
}
int main() {
ll i;
cin >> n >> k;
for (i = 0; i < n; i++)
scanf("%lld", &a[i]);
for (i = 4... | [
"control_flow.branch.if.condition.change"
] | 938,928 | 938,929 | u093170535 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[200001];
int cnt[101];
int dp[101];
int n, k;
int dfs(int x, int up, int sum) {
if (x == -1)
return sum;
if (dp[x] && up == 0)
return dp[x];
int ans = 0;
if (up && ((k & (1ll << x)) == 0))
ans = dfs(x - 1, 1, sum + (1ll << x) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[200001];
int cnt[101];
int dp[101];
int n, k;
int dfs(int x, int up, int sum) {
if (x == -1)
return sum;
if (dp[x] && up == 0)
return dp[x] + sum;
int ans = 0;
if (up && ((k & (1ll << x)) == 0))
ans = dfs(x - 1, 1, sum + (1ll ... | [
"expression.operation.binary.add"
] | 938,936 | 938,937 | u413057858 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[200001];
int cnt[101];
int dp[101];
int n, k;
int dfs(int x, int up, int sum) {
if (x == -1)
return sum;
if (dp[x] && up == 0)
return dp[x];
int ans = 0;
if (up && ((k & (1ll << x)) == 0))
ans = dfs(x - 1, 1, sum + (1ll << x) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[200001];
int cnt[101];
int dp[101];
int n, k;
int dfs(int x, int up, int sum) {
if (x == -1)
return sum;
if (dp[x] && up == 0)
return dp[x] + sum;
int ans = 0;
if (up && ((k & (1ll << x)) == 0))
ans = dfs(x - 1, 1, sum + (1ll ... | [
"assignment.change"
] | 938,938 | 938,937 | u413057858 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
// C++14 (GCC 5.4.1)
#define LLINF (1LL << 60)
typedef long long ll;
#define mod 1000000007
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define rrepd(i, a, b) for (int i = (a); i >= (b); i--)
template <typename T> inline bool ch... | #include <bits/stdc++.h>
using namespace std;
// C++14 (GCC 5.4.1)
#define LLINF (1LL << 60)
typedef long long ll;
#define mod 1000000007
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define rrepd(i, a, b) for (int i = (a); i >= (b); i--)
template <typename T> inline bool ch... | [
"literal.number.type.widen.change",
"control_flow.branch.if.condition.change"
] | 938,939 | 938,940 | u216459554 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int get_rank(long long n) {
int rank = 1;
while (n >= 2) {
n /= 2;
rank++;
}
return rank;
}
int main() {
int N;
long long K;
cin >> N >> K;
int rank_k = get_rank(K);
vector<int> rank_counts(rank_k);
vector<long long> A(N);
for (auto &a : A... | #include <bits/stdc++.h>
using namespace std;
int get_rank(long long n) {
int rank = 1;
while (n >= 2) {
n /= 2;
rank++;
}
return rank;
}
int main() {
int N;
long long K;
cin >> N >> K;
int rank_k = get_rank(K);
vector<int> rank_counts(rank_k);
vector<long long> A(N);
for (auto &a : A... | [
"literal.number.type.widen.change",
"variable_declaration.value.change"
] | 938,945 | 938,944 | u942915776 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | [
"literal.number.change",
"call.arguments.change"
] | 938,948 | 938,949 | u139031151 | cpp |
p03138 | #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) ... | #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) ... | [] | 938,950 | 938,951 | u209713918 | cpp |
p03138 | #include <algorithm>
#include <cstring>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define NMAX 100000
#define INF 1e+6
#define scan(arg) cin >> arg
#define prin(arg) cout << arg << "\n"
#define prin2(arg1, arg2) cout << arg1 << " " << arg2 << "\n"
... | #include <algorithm>
#include <cstring>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define NMAX 100000
#define INF 1e+6
#define scan(arg) cin >> arg
#define prin(arg) cout << arg << "\n"
#define prin2(arg1, arg2) cout << arg1 << " " << arg2 << "\n"
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 938,953 | 938,954 | u110996038 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n, k;
cin >> n >> k;
vector<long> a(n);
for (auto &x : a)
cin >> x;
unsigned long r = 0;
for (int l = 0; l < n; l++)
r += a[l];
for (int i = 0; i < 45; i++) {
unsigned long rr = 0;
for (int j = 0; j < i; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n, k;
cin >> n >> k;
vector<long> a(n);
for (auto &x : a)
cin >> x;
unsigned long r = 0;
for (int l = 0; l < n; l++)
r += k ^ a[l];
for (int i = 0; i < 45; i++) {
unsigned long rr = 0;
for (int j = 0; j < i; j++) {
... | [
"assignment.change"
] | 938,955 | 938,956 | u056944756 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 938,959 | 938,960 | u540491484 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 938,961 | 938,960 | u540491484 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 938,962 | 938,960 | u540491484 | cpp |
p03138 | #include <iostream>
using namespace std;
using ll = unsigned long long;
ll n, k;
ll arr[100005];
ll cnt_bit[64];
ll x;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
ll tmp = arr[i];
ll j = 0;
while (tmp) {
if (tmp & 1)
cnt_bit[j]++;
tmp >>= 1;
... | #include <iostream>
using namespace std;
using ll = long long;
ll n, k;
ll arr[100005];
ll cnt_bit[64];
ll x;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
ll tmp = arr[i];
ll j = 0;
while (tmp) {
if (tmp & 1)
cnt_bit[j]++;
tmp >>= 1;
j++;
... | [
"variable_declaration.type.narrow.change",
"control_flow.branch.if.condition.change"
] | 938,973 | 938,974 | u683588090 | cpp |
p03138 | #include <iostream>
using namespace std;
using ll = long long;
ll n, k;
ll arr[100005];
ll cnt_bit[64];
ll x;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
ll tmp = arr[i];
ll j = 0;
while (tmp) {
if (tmp & 1)
cnt_bit[j]++;
tmp >>= 1;
j++;
... | #include <iostream>
using namespace std;
using ll = long long;
ll n, k;
ll arr[100005];
ll cnt_bit[64];
ll x;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
ll tmp = arr[i];
ll j = 0;
while (tmp) {
if (tmp & 1)
cnt_bit[j]++;
tmp >>= 1;
j++;
... | [
"control_flow.branch.if.condition.change"
] | 938,975 | 938,974 | u683588090 | cpp |
p03138 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#includ... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#includ... | [
"control_flow.branch.if.condition.change"
] | 938,976 | 938,977 | u585670083 | cpp |
p03138 | #include "bits/stdc++.h"
#include <string>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)... | #include "bits/stdc++.h"
#include <string>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)... | [
"literal.number.change",
"assignment.value.change"
] | 938,980 | 938,981 | u564412651 | cpp |
p03138 | #include "bits/stdc++.h"
#include <string>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)... | #include "bits/stdc++.h"
#include <string>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 938,982 | 938,981 | u564412651 | cpp |
p03138 | #include <iostream>
#include <vector>
using namespace std;
long long solve(const vector<long long> &a, long long k, int idx, bool k_lt) {
if (idx < 0) {
return 0;
}
long long cnt_z = 0, cnt_o = 0;
for (int i = 0; i < static_cast<int>(a.size()); i++) {
if ((a[i] & (1LL << idx)) == 0) {
cnt_z++;
... | #include <iostream>
#include <vector>
using namespace std;
long long solve(const vector<long long> &a, long long k, int idx, bool k_lt) {
if (idx < 0) {
return 0;
}
long long cnt_z = 0, cnt_o = 0;
for (int i = 0; i < static_cast<int>(a.size()); i++) {
if ((a[i] & (1LL << idx)) == 0) {
cnt_z++;
... | [
"misc.opposites",
"call.arguments.change",
"expression.operation.binary.change"
] | 938,987 | 938,988 | u185690073 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * base % MOD;... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * base % MOD;... | [
"identifier.change",
"io.output.change"
] | 938,996 | 938,997 | u276568758 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * base % MOD;... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * base % MOD;... | [
"control_flow.branch.if.condition.change"
] | 938,998 | 938,997 | u276568758 | cpp |
p03138 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std... | [] | 938,999 | 939,000 | u273834941 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
ll cnt[45][2], kbit[45];
ll calc(int x) {
ll ans = 0, pow2 = 1;
rep(i, x) {
if (cnt[i][0] > cnt[i][1])... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
ll cnt[45][2], kbit[45];
ll calc(int x) {
ll ans = 0, pow2 = 1;
rep(i, x) {
if (cnt[i][0] > cnt[i][1])... | [
"assignment.add"
] | 939,011 | 939,012 | u582848517 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int arr[41];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
long long int k, t;
vector<long long int> v;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> t;
v.push_back(t);
}
memset(arr, 0, sizeof(arr));
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int arr[41];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
long long int k, t;
vector<long long int> v;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> t;
v.push_back(t);
}
memset(arr, 0, sizeof(arr));
for (int i = 0... | [
"assignment.add"
] | 939,015 | 939,016 | u365058393 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; i++)
#define ll long long
using namespace std;
// 119 D
template <class... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; i++)
#define ll long long
using namespace std;
// 119 D
template <class... | [
"expression.operation.binary.remove"
] | 939,039 | 939,040 | u693569496 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; i++)
#define ll long long
using namespace std;
// 119 D
template <class... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; i++)
#define ll long long
using namespace std;
// 119 D
template <class... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 939,041 | 939,040 | u693569496 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, s, n) for (int i = (int)(s); i < (int)(n); ++i)
#define ALL(n) (n).begin(), (n).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> mat;
// mat dtable(M, vl(N, 0)); ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, s, n) for (int i = (int)(s); i < (int)(n); ++i)
#define ALL(n) (n).begin(), (n).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> mat;
// mat dtable(M, vl(N, 0)); ... | [
"assignment.change",
"control_flow.branch.if.condition.change",
"literal.number.type.widen.change"
] | 939,067 | 939,068 | u963682312 | cpp |
p03138 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"assignment.compound.bitwise.replace.remove",
"expression.operator.bitwise.replace.add",
"literal.number.type.widen.change"
] | 939,082 | 939,079 | u146594935 | cpp |
p03138 | // dile a la jardinera que traigo flores
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define sz(x) int(x.size())
#define all(v) (v).begin(), (v).end()
#define trace(x) cout << #x << " = " << x << endl
#define fastio \
... | // dile a la jardinera que traigo flores
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define sz(x) int(x.size())
#define all(v) (v).begin(), (v).end()
#define trace(x) cout << #x << " = " << x << endl
#define fastio \
... | [
"literal.number.change",
"call.arguments.change"
] | 939,090 | 939,091 | u024867716 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | [
"expression.operator.change"
] | 939,098 | 939,099 | u532573979 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
// xを２進展開した時、各けたの数字を格納した。
vll calc(ll x) {
vll v;
for (int l = 0; l < 41; l++) {
ll c = x % 2;
v.push_back(c);
x /= 2;
}
return v;
}
// xは、A_1,A_2,...,A_Nのつもり。数字の列。
vll counter(vll x) {
//初期化した。
ll N = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
// xを２進展開した時、各けたの数字を格納した。
vll calc(ll x) {
vll v;
for (int l = 0; l < 100; l++) {
ll c = x % 2;
v.push_back(c);
x /= 2;
}
return v;
}
// xは、A_1,A_2,...,A_Nのつもり。数字の列。
vll counter(vll x) {
//初期化した。
ll N =... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 939,104 | 939,105 | u826487371 | cpp |
p03138 | #include "bits/stdc++.h"
using namespace std;
long long Pow(long long x, long long y) {
if (y == 0)
return 1;
if (y % 2 == 0) {
long long z = Pow(x, y / 2);
return z * z;
}
return x * Pow(x, y - 1);
}
int main() {
long long N, K, A, Dig[40] = {}, KDig[40] = {}, ans = 0;
cin >> N >> K;
for (i... | #include "bits/stdc++.h"
using namespace std;
long long Pow(long long x, long long y) {
if (y == 0)
return 1;
if (y % 2 == 0) {
long long z = Pow(x, y / 2);
return z * z;
}
return x * Pow(x, y - 1);
}
int main() {
long long N, K, A, Dig[40] = {}, KDig[40] = {}, ans = 0;
cin >> N >> K;
for (i... | [] | 939,108 | 939,109 | u454087021 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MinInF = -1e18;
ll dp[41][2];
int nth_bit(ll num, int n) { return (num >> n) & 1; }
void chmax(ll &a, ll b)... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MinInF = -1e18;
ll dp[41][2];
int nth_bit(ll num, int n) { return (num >> n) & 1; }
void chmax(ll &a, ll b)... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 939,122 | 939,123 | u258183816 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,141 | 939,142 | u898749314 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
rep(i, 0, N) cin >> A[i];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
rep(i, 0, N) cin >> A[i];
... | [] | 939,143 | 939,144 | u756388720 | cpp |
p03138 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000
#define endl '\n'
template <class T> inlin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000
#define endl '\n'
template <class T> inlin... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,151 | 939,152 | u807998890 | cpp |
p03138 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000
#define endl '\n'
template <class T> inlin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000
#define endl '\n'
template <class T> inlin... | [
"expression.unary.arithmetic.add",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,153 | 939,152 | u807998890 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
long long arr[N];
int main() {
int n;
long long k;
cin >> n >> k;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
}
long long x = 0, res = 0;
for (int i = 40; i >= 0; i--) {
int a = 0;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
long long arr[N];
int main() {
int n;
long long k;
cin >> n >> k;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
}
long long x = 0, res = 0;
for (int i = 40; i >= 0; i--) {
int a = 0;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,154 | 939,155 | u792984973 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using lint = long long;
using namespace std;
const int DGT = 100;
lint N, K;
lint A[100010];
lint cnt[110][2];
lint Kbin[110];
lint dp[110][2];
lint rec(int dgt, int isless) {
if (dgt == -1)
return 0;
if (dp[dgt][isless] != -1)
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using lint = long long;
using namespace std;
const int DGT = 100;
lint N, K;
lint A[100010];
lint cnt[110][2];
lint Kbin[110];
lint dp[110][2];
lint rec(int dgt, int isless) {
if (dgt == -1)
return 0;
if (dp[dgt][isless] != -1)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,159 | 939,160 | u021423660 | cpp |
p03138 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < ... |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,161 | 939,162 | u305138467 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
vector<long long> a(n);
for (auto &i : a)
cin >> i;
long long v = 0, ans = 0;
for (int i = 60; i >= 0; i--) {
long long v1 = v + (1ll << i);
if (v1 <= k) {
int pc = 0;
for (int j = 0; j < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
vector<long long> a(n);
for (auto &i : a)
cin >> i;
long long v = 0, ans = 0;
for (int i = 60; i >= 0; i--) {
long long v1 = v + (1ll << i);
if (v1 <= k) {
int pc = 0;
for (int j = 0; j < ... | [
"assignment.add"
] | 939,163 | 939,164 | u251828455 | cpp |
p03138 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | [
"control_flow.branch.if.condition.change"
] | 939,165 | 939,166 | u652683896 | cpp |
p03138 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | [
"literal.number.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 939,167 | 939,166 | u652683896 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define un... | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define un... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 939,170 | 939,171 | u267022560 | cpp |
p03138 | // https://atcoder.jp/contests/abc118/tasks/abc118_c
// http://ctylim.hatenablog.com/entry/2015/08/30/191553
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#d... | // https://atcoder.jp/contests/abc118/tasks/abc118_c
// http://ctylim.hatenablog.com/entry/2015/08/30/191553
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#d... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 939,172 | 939,173 | u599617303 | cpp |
p03138 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPL(... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPL(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 939,186 | 939,187 | u635484372 | cpp |
p03138 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
int main() {
ll... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
int main() {
ll... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 939,191 | 939,192 | u824337972 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
using i32 = int_fast32_t;
using ui32 = uint_fast32_t;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using ll = i64;
using pi = pair<i32, i32>;
using pll = pair<i64, i64>;
using vi = vector<i32>;
using vll = vector<i64>;
int Main(... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
using i32 = int_fast32_t;
using ui32 = uint_fast32_t;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using ll = i64;
using pi = pair<i32, i32>;
using pll = pair<i64, i64>;
using vi = vector<i32>;
using vll = vector<i64>;
int Main(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,197 | 939,198 | u572532976 | cpp |
p03138 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
long long int calc(long long int K, vector<long long int> &A) {
long long int N = A.size();
long long int mult = 1;
long long int ans = 0;
for (int i = 0; i < 42; i++) {
long ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
long long int calc(long long int K, vector<long long int> &A) {
long long int N = A.size();
long long int mult = 1;
long long int ans = 0;
for (int i = 0; i < 42; i++) {
long ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,199 | 939,200 | u727099903 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
void chmax(int64_t &a, int64_t b) { a = max(a, b); }
int main() {
int N;
int64_t K, A[100000];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
int64_t dp[41][2];
for (int d = 40; d >= 0; d--)
for (int j = 0; j < 2; j++)
dp[d][j] = -1e18;... | #include <bits/stdc++.h>
using namespace std;
void chmax(int64_t &a, int64_t b) { a = max(a, b); }
int main() {
int N;
int64_t K, A[100000];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
int64_t dp[41][2];
for (int d = 40; d >= 0; d--)
for (int j = 0; j < 2; j++)
dp[d][j] = -1e18;... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,208 | 939,209 | u943004959 | cpp |
p03138 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define INF (1 << 30)
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
ll res = 0;
for (int d = 60; d >= -1; d--) {
// d桁目について、K... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define INF (1 << 30)
int main() {
ll N;
ll K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
ll res = 0;
for (ll d = 60; d >= -1; d--) {
// d桁目について、Kが１... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 939,210 | 939,211 | u672541593 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define N_MAX 100005
typedef long long ll;
ll n, k, a[N_MAX];
ll l;
vector<int> ks, best; // ks : Kを2進数表記, best : 最適解
ll len(ll K) {
// Kを２進数表記したときの桁数
ll cnt = 1;
while (K >= 2) {
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define N_MAX 100005
typedef long long ll;
ll n, k, a[N_MAX];
ll l;
vector<ll> ks, best; // ks : Kを2進数表記, best : 最適解
ll len(ll K) {
// Kを２進数表記したときの桁数
int cnt = 1;
while (K >= 2) {
... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,215 | 939,216 | u320267096 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
ll K;
cin >> N >> K;
ll A[100001];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
bitset<60> master... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
ll K;
cin >> N >> K;
ll A[100001];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
bitset<60> master... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 939,225 | 939,226 | u913836622 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define incant() cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define uint unsigned long long
#define double long double
using str = string;
template <class T> using vec = vector<T>;
template <class T> using vvec = vec<vec<T>>;
template <class T> using que ... | #include <bits/stdc++.h>
using namespace std;
#define incant() cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define uint unsigned long long
#define double long double
using str = string;
template <class T> using vec = vector<T>;
template <class T> using vvec = vec<vec<T>>;
template <class T> using que ... | [
"control_flow.branch.if.condition.change"
] | 939,227 | 939,228 | u303059352 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define incant() cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define uint unsigned long long
#define double long double
using str = string;
template <class T> using vec = vector<T>;
template <class T> using vvec = vec<vec<T>>;
template <class T> using que ... | #include <bits/stdc++.h>
using namespace std;
#define incant() cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define uint unsigned long long
#define double long double
using str = string;
template <class T> using vec = vector<T>;
template <class T> using vvec = vec<vec<T>>;
template <class T> using que ... | [
"control_flow.branch.if.condition.change"
] | 939,229 | 939,228 | u303059352 | cpp |
p03138 | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int x = (fr); x < (to); x++)
#define rep(x, to) for (int x = 0; x < (to); x++)
#define repr(x, fr, to) for (int x = (fr); x >= (to); x--)
#define all(c) c.begin(), c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll;
typedef vector<int> V... | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int x = (fr); x < (to); x++)
#define rep(x, to) for (int x = 0; x < (to); x++)
#define repr(x, fr, to) for (int x = (fr); x >= (to); x--)
#define all(c) c.begin(), c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll;
typedef vector<int> V... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"call.arguments.add"
] | 939,246 | 939,247 | u714564133 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <math.h>
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define IOS \
ios::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <math.h>
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define IOS \
ios::sync_with_stdio(false); ... | [
"literal.number.change",
"call.arguments.change"
] | 939,253 | 939,252 | u866529295 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
#define mp make_pair
#define _GLIBCXX_DEBUG
const int INF = 1e15;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
#define mp make_pair
#define _GLIBCXX_DEBUG
const int INF = 1e15;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
... | [] | 939,254 | 939,255 | u342075214 | cpp |
p03138 | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int num[40];
ll a[N];
int main() {
int n;
ll k;
scanf("%d %lld", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
}
for (int i = 0; i <= 39; ++i) {
for ... | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int num[40];
ll a[N];
int main() {
int n;
ll k;
scanf("%d %lld", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
}
for (int i = 0; i <= 39; ++i) {
for ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,258 | 939,259 | u863370423 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(T... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(T... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,260 | 939,261 | u385825353 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
ll N, K;... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
ll N, K;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,264 | 939,265 | u731886385 | cpp |
p03138 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 939,271 | 939,272 | u103850114 | cpp |
p03138 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,273 | 939,272 | u103850114 | cpp |
p03138 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 939,274 | 939,272 | u103850114 | cpp |
p03138 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | [
"literal.number.change",
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 939,275 | 939,272 | u103850114 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<in... | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<in... | [
"assignment.value.change"
] | 939,282 | 939,283 | u443975466 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vecctor<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vecctor<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 939,288 | 939,289 | u893584578 | cpp |
p03138 | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using na... | [
"control_flow.branch.if.condition.change"
] | 939,293 | 939,294 | u767543103 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define int ll; // ＾o＾
#define FOR(i, b, e) for (ll i = (... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define int ll; // ＾o＾
#define FOR(i, b, e) for (ll i = (... | [
"assignment.add"
] | 939,308 | 939,309 | u715750943 | cpp |
p03138 | #include <bits/stdc++.h>
typedef long long ll;
#define reps(i, s, n) for (ll(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
#define All(x) (x).begin(), (x).end()
using namespace std;
signed main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
vector<ll> bitadd(63, 0);
for (auto &a : A)
cin >> ... | #include <bits/stdc++.h>
typedef long long ll;
#define reps(i, s, n) for (ll(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
#define All(x) (x).begin(), (x).end()
using namespace std;
signed main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
vector<ll> bitadd(63, 0);
for (auto &a : A)
cin >> ... | [
"assignment.variable.change",
"identifier.change"
] | 939,310 | 939,311 | u003019316 | cpp |
p03138 | /*** keep hungry and calm CoolGuang!***/
#pragma GCC optimize(2)
#include <algorithm>
#include <bits/stdc++.h>
#include <stdio.h>
#define debug(x) cout << #x << ":" << x << endl;
using namespace std;
typedef long long ll;
typedef pair<int, int> pp;
const ll INF = 1e18;
const int maxn = 1e6 + 18;
const int mod = 9982443... | /*** keep hungry and calm CoolGuang!***/
#pragma GCC optimize(2)
#include <algorithm>
#include <bits/stdc++.h>
#include <stdio.h>
#define debug(x) cout << #x << ":" << x << endl;
using namespace std;
typedef long long ll;
typedef pair<int, int> pp;
const ll INF = 1e18;
const int maxn = 1e6 + 18;
const int mod = 9982443... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,312 | 939,313 | u577127055 | cpp |
p03138 | //#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const ll INF = 1e9;
const ll LINF = ll(1e18) + 1;
const ll MOD = 1000000007;
const ll dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const ll Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, ... | //#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const ll INF = 1e9;
const ll LINF = ll(1e18) + 1;
const ll MOD = 1000000007;
const ll dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const ll Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 939,316 | 939,317 | u155416173 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
const int INF = 1001001001;
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
const int INF = 1001001001;
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
t... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 939,332 | 939,333 | u999989620 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | [
"expression.unary.arithmetic.add"
] | 939,343 | 939,344 | u858670323 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | [] | 939,348 | 939,349 | u471212175 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<vector<int>> dp(60, vector<int>(2, -(1LL << 60)));
// dp[桁][K以下が確定している]
dp[40][... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<vector<int>> dp(60, vector<int>(2, -(1LL << 60)));
// dp[桁][K以下が確定している]
dp[40][... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 939,354 | 939,355 | u344122377 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
typedef long long ll;
typed... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
typedef long long ll;
typed... | [
"identifier.change",
"call.function.change"
] | 939,360 | 939,361 | u864667985 | cpp |
p03138 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
type... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
type... | [
"control_flow.branch.if.condition.change"
] | 939,367 | 939,368 | u016189984 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define INF (1ll << 60)
typedef long long lint;
const lint MOD = 1000000007;
const lint MAX = 10000000;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define INF (1ll << 60)
typedef long long lint;
const lint MOD = 1000000007;
const lint MAX = 10000000;... | [
"assignment.value.change",
"expression.operation.unary.arithmetic.remove"
] | 939,373 | 939,374 | u768204022 | cpp |
p03138 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1LL << 60;
constexpr... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1LL << 60;
constexpr... | [
"assignment.change"
] | 939,375 | 939,376 | u550014122 | cpp |
p03138 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1LL << 60;
constexpr... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1LL << 60;
constexpr... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 939,377 | 939,376 | u550014122 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | [
"control_flow.branch.if.condition.change",
"expression.operator.change",
"variable_declaration.remove"
] | 939,384 | 939,385 | u986276444 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
template <class T> using lim = numeric_limits<T>;
typedef long long ll;
typedef long double ld;
const int maxBit = 62;
int bitCount[maxBit + 1];
void addToCount(ll x) {
for (int i = 0; i < maxBit; i++) {
bitCount[i] += x % 2;
x /= 2;
}
}
int main() {
ios_... | #include <bits/stdc++.h>
using namespace std;
template <class T> using lim = numeric_limits<T>;
typedef long long ll;
typedef long double ld;
const int maxBit = 62;
int bitCount[maxBit + 1];
void addToCount(ll x) {
for (int i = 0; i < maxBit; i++) {
bitCount[i] += x % 2;
x /= 2;
}
}
int main() {
ios_... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,386 | 939,387 | u712768978 | cpp |
p03138 | #include <bits/stdc++.h>
#define fastio1 ios_base::sync_with_stdio(false)
#define fastio2 cin.tie(NULL)
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
fastio1;
fastio2;
ll n, k;
cin >> n >> k;
vector<ll> a(n);
int maxBits = 45;
ll tracker[maxBits];
for (int i = 0; i < ma... | #include <bits/stdc++.h>
#define fastio1 ios_base::sync_with_stdio(false)
#define fastio2 cin.tie(NULL)
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
fastio1;
fastio2;
ll n, k;
cin >> n >> k;
vector<ll> a(n);
int maxBits = 45;
ll tracker[maxBits];
for (int i = 0; i < ma... | [
"control_flow.branch.if.condition.change"
] | 939,388 | 939,389 | u712768978 | cpp |
p03138 | #include <bits/stdc++.h>
#define fastio1 ios_base::sync_with_stdio(false)
#define fastio2 cin.tie(NULL)
#define LL long long
#define MOD 1000000007
using namespace std;
int main() {
fastio1;
fastio2;
LL n, k;
cin >> n >> k;
vector<LL> a(n);
int tracker[42] = {0};
for (int i = 0; i < n; i++) {
cin >... | #include <bits/stdc++.h>
#define fastio1 ios_base::sync_with_stdio(false)
#define fastio2 cin.tie(NULL)
#define LL long long
#define MOD 1000000007
using namespace std;
int main() {
fastio1;
fastio2;
LL n, k;
cin >> n >> k;
vector<LL> a(n);
int tracker[42] = {0};
for (int i = 0; i < n; i++) {
cin >... | [
"control_flow.branch.if.condition.change",
"literal.number.type.widen.change"
] | 939,390 | 939,391 | u712768978 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,392 | 939,393 | u561186440 | cpp |
p03138 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define FOR(i, n, m) for (int i = n; i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= m; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define FOR(i, n, m) for (int i = n; i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= m; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#d... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 939,403 | 939,404 | u649915042 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
//#define i_7 (ll)(1E9+7)
#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
//#define i_7 (ll)(1E9+7)
#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
retur... | [
"literal.number.change",
"call.arguments.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 939,415 | 939,416 | u763881112 | cpp |
p03138 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
... | [
"literal.number.change",
"call.arguments.change"
] | 939,419 | 939,420 | u008229752 | cpp |
p03138 | #include <bits/stdc++.h>
#define INF 2147483647
#define INF_LL 9223372036854775807
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<ll> B(41, 0);
... | #include <bits/stdc++.h>
#define INF 2147483647
#define INF_LL 9223372036854775807
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<ll> B(50, 0);
... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,429 | 939,430 | u326966549 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(41, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(45, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 939,431 | 939,432 | u705918648 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(50, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(45, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 939,433 | 939,432 | u705918648 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(45, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(45, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 939,434 | 939,432 | u705918648 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a[100010];
ll one[64], zero[64];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
ll cnt = 0;
for (ll i = k; i != 0; cnt++)
i /= 2;
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a[100010];
ll one[64], zero[64];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
ll cnt = 0;
for (ll i = k; i != 0; cnt++)
i /= 2;
for (int i = 0; i < ... | [
"control_flow.branch.else.remove"
] | 939,439 | 939,440 | u288035794 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <typename T1, typename T2> inline void chmi... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <typename T1, typename T2> inline void chmi... | [
"expression.operation.binary.add"
] | 939,441 | 939,442 | u139300044 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
template <typename T1, typename T2> inline void chmi... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <typename T1, typename T2> inline void chm... | [
"preprocessor.define.value.change"
] | 939,443 | 939,444 | u139300044 | cpp |
p03138 | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 939,450 | 939,451 | u539011156 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, bit_k[63] = {}, bit_sum[63][2] = {};
long long k, a, ans;
bool islimit;
cin >> n >> k;
for (int j = 0; j < 63; j++) {
bit_k[j] = k % 2;
k = k / 2;
}
for (int i = 0; i < n; i++) {
cin >> a;
for (int j = 0; j < 63; j++... |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n, bit_k[63] = {}, bit_sum[63][2] = {};
long long k, a, ans;
bool islimit;
cin >> n >> k;
for (int i = 0; i < 63; i++) {
bit_k[i] = k % 2;
k = k / 2;
}
for (int i = 0; i < n; i++) {
cin >> a;
for (int j = 0; j < 63; j+... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"literal.number.change",
"control_flow.branch.i... | 939,456 | 939,457 | u899084195 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> k(50);
int cnt = 0;
while (K > 0) {
if (K % 2 == 1)
k.at(cnt)++;
K /= 2;
cn... | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> k(50);
int cnt = 0;
while (K > 0) {
if (K % 2 == 1)
k.at(cnt)++;
K /= 2;
cn... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,462 | 939,463 | u618649215 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> k(50);
int cnt = 0;
while (K > 0) {
if (K % 2 == 1)
k.at(cnt)++;
K /= 2;
cn... | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> k(50);
int cnt = 0;
while (K > 0) {
if (K % 2 == 1)
k.at(cnt)++;
K /= 2;
cn... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,462 | 939,464 | u618649215 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.