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 <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i, n) for (int i = 1; i <= n; i++)
#de... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i, n) for (int i = 1; i <= n; i++)
#de... | [
"identifier.change",
"preprocessor.define.value.change",
"literal.integer.change",
"call.function.change",
"literal.number.change",
"call.arguments.change"
] | 939,465 | 939,466 | u670898337 | cpp |
p03138 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL =... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL =... | [
"expression.unary.arithmetic.add"
] | 939,467 | 939,468 | u863537799 | cpp |
p03138 | #include "bits/stdc++.h"
using namespace std;
long long dp[101][2];
int main() {
long long N, K;
cin >> N >> K;
vector<long long> A(N);
for (int n = 0; n < N; ++n) {
cin >> A[n];
}
for (int n = 0; n < 101; ++n) {
dp[n][0] = dp[n][1] = -1;
}
dp[0][0] = 0;
for (int n = 0; n < 100; ++n) {
lo... | #include "bits/stdc++.h"
using namespace std;
long long dp[101][2];
int main() {
long long N, K;
cin >> N >> K;
vector<long long> A(N);
for (int n = 0; n < N; ++n) {
cin >> A[n];
}
for (int n = 0; n < 101; ++n) {
dp[n][0] = dp[n][1] = -1;
}
dp[0][0] = 0;
for (int n = 0; n < 40; ++n) {
lon... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 939,485 | 939,486 | u835523614 | cpp |
p03138 | #include "bits/stdc++.h"
using namespace std;
long long dp[101][2];
int main() {
long long N, K;
cin >> N >> K;
vector<long long> A(N);
for (int n = 0; n < N; ++n) {
cin >> A[n];
}
for (int n = 0; n < 101; ++n) {
dp[n][0] = dp[n][1] = -1;
}
dp[0][0] = 0;
for (int n = 0; n < 100; ++n) {
lo... | #include "bits/stdc++.h"
using namespace std;
long long dp[101][2];
int main() {
long long N, K;
cin >> N >> K;
vector<long long> A(N);
for (int n = 0; n < N; ++n) {
cin >> A[n];
}
for (int n = 0; n < 101; ++n) {
dp[n][0] = dp[n][1] = -1;
}
dp[0][0] = 0;
for (int n = 0; n < 45; ++n) {
lon... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 939,485 | 939,488 | u835523614 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
const long ... | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
const long ... | [
"call.arguments.change"
] | 939,489 | 939,490 | u569690172 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
const long ... | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
const long ... | [
"call.arguments.change"
] | 939,491 | 939,490 | u569690172 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
const long ... | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
const long ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 939,492 | 939,490 | u569690172 | cpp |
p03138 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
void chmax(ll &x, ll y) {
if (x < y)
x = y;
}
int main() {
ll N, K;
cin >> N >> K;
vl A(N);
rep(i, N) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
void chmax(ll &x, ll y) {
if (x < y)
x = y;
}
int main() {
ll N, K;
cin >> N >> K;
vl A(N);
rep(i, N) {... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,493 | 939,494 | u376366206 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
REP(i, 0, N) cin >> A[i];
ll cnt[60] = {};
REP(i, 0, N) {
ll tmp = ... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
REP(i, 0, N) cin >> A[i];
ll cnt[60] = {};
REP(i, 0, N) {
ll tmp = ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 939,509 | 939,510 | u483992368 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const int MAX_BIT = 50;
int main() {
long long n, k, dp[MAX_BIT + 1][2], c[MAX_BIT + 1];
cin >> n >> k;
memset(c, 0, sizeof(c));
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) {
long long a;
cin >> a;
for (int j = 0; j <= MAX_BIT; j++) {
... | #include <bits/stdc++.h>
using namespace std;
const int MAX_BIT = 50;
int main() {
long long n, k, dp[MAX_BIT + 1][2], c[MAX_BIT + 1];
cin >> n >> k;
memset(c, 0, sizeof(c));
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) {
long long a;
cin >> a;
for (int j = 0; j <= MAX_BIT; j++) {
... | [
"assignment.change",
"expression.operation.binary.remove"
] | 939,511 | 939,512 | u112318601 | cpp |
p03138 | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T> void debug(T value) { std::cerr << value; }
template <typename T, typename... Ts> void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T> void debug(T value) { std::cerr << value; }
template <typename T, typename... Ts> void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | [
"expression.operation.binary.add"
] | 939,513 | 939,514 | u505122009 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 939,515 | 939,516 | u601256797 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 939,517 | 939,518 | u013750540 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
vector<ll> num;
struct Nbase {
int n;
int sz = 1;
long long max = 1e18;
Nbase(int k = 2) {
n = k;
while (max != 0) {
max /= n;
sz++;
}
num.resize(sz);
};
//繰り返し二乗法
ll EX(ll x, ll n) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
vector<ll> num;
struct Nbase {
int n;
int sz = 1;
long long max = 1e18;
Nbase(int k = 2) {
n = k;
while (max != 0) {
max /= n;
sz++;
}
num.resize(sz);
};
//繰り返し二乗法
ll EX(ll x, ll n) ... | [] | 939,539 | 939,540 | u191484928 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[100][2];
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n), b;
for (int i = 0; i < n; i++)
cin >> a[i];
while (k) {
b.emplace_back(k % 2);
k /= 2;
}
reverse(b.begin(), b.end());
ll bn = b.size();
dp[0][0] = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[100][2];
int main() {
ll n, k;
cin >> n >> k;
ll K = k;
vector<ll> a(n), b;
for (int i = 0; i < n; i++)
cin >> a[i];
while (k) {
b.emplace_back(k % 2);
k /= 2;
}
reverse(b.begin(), b.end());
ll bn = b.size();
dp[0... | [
"variable_declaration.add",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,541 | 939,542 | u184929210 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | [
"identifier.change",
"call.function.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 939,543 | 939,544 | u279033107 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 939,545 | 939,544 | u279033107 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 939,546 | 939,544 | u279033107 | cpp |
p03138 | ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <typeinfo>
#include <vector>
using namespace std;
//////////////////////////////////////////////////////... | ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <typeinfo>
#include <vector>
using namespace std;
//////////////////////////////////////////////////////... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 939,548 | 939,549 | u167931717 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 939,554 | 939,555 | u809967037 | cpp |
p03138 | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
ll N, K, ans = 0, tmp = 0, dgt[42][2];
vector<ll> A;
signed main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
A.push_back(a);
int ct = 0... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
ll N, K, ans = 0, tmp = 0, dgt[42][2];
vector<ll> A;
signed main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
A.push_back(a);
int ct = 0... | [] | 939,561 | 939,562 | u132452589 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 939,565 | 939,566 | u298620933 | cpp |
p03138 | // https://atcoder.jp/contests/abc117/tasks/abc117_d
// https://drken1215.hatenablog.com/entry/2019/02/03/224200
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int binary_digit_one_num[100]; // i桁目の値が1の個数;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> a(N);
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int binary_digit_one_num[100]; // i桁目の値が1の個数;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
// 10進数を2進数にして、各桁で1があるところを記録
for (int i = 0; i < N; ++i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,567 | 939,568 | u218744484 | cpp |
p03138 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int binary_digit_one_num[100]; // i桁目の値が1の個数;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
// 10進数を2進数にして、各桁で1があるところを記録
for (int i = 0; i < N; ++i... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int binary_digit_one_num[100]; // i桁目の値が1の個数;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
// 10進数を2進数にして、各桁で1があるところを記録
for (int i = 0; i < N; ++i... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 939,569 | 939,568 | u218744484 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 939,570 | 939,571 | u530107518 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,572 | 939,571 | u530107518 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
int d = 0;
while ((1LL << d) <= k)
d++;
ll nums[61] = {};
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
for (int j = 0; j < 61; j++) {
nums[j] += (a & (1LL << j)) >> j;
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
int d = 0;
while ((1LL << d) <= k)
d++;
ll nums[61] = {};
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
for (int j = 0; j < 61; j++) {
nums[j] += (a & (1LL << j)) >> j;
}
}
... | [
"control_flow.branch.if.condition.change"
] | 939,578 | 939,579 | u795630164 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | #include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | [
"literal.number.change",
"variable_declaration.value.change"
] | 939,588 | 939,589 | u987913144 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main() {
ll n, K;
cin >> n >> K;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(50, vector<ll>(2, -1));
dp[40][0] = 0;
for (int d = 45; d >= 0; d--) {
ll num = 0, mask = 1LL << d;
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main() {
ll n, K;
cin >> n >> K;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(50, vector<ll>(2, -1));
dp[40][0] = 0;
for (int d = 45; d >= 0; d--) {
ll num = 0, mask = 1LL << d;
for (... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 939,590 | 939,591 | u265359795 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main() {
ll n, K;
cin >> n >> K;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(50, vector<ll>(2, -1));
dp[40][0] = 0;
for (int d = 45; d >= 0; d--) {
ll num = 0, mask = 1LL << d;
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main() {
ll n, K;
cin >> n >> K;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(50, vector<ll>(2, -1));
dp[40][0] = 0;
for (int d = 45; d >= 0; d--) {
ll num = 0, mask = 1LL << d;
for (... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 939,590 | 939,592 | u265359795 | cpp |
p03138 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
const int IN... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
const int IN... | [
"variable_declaration.value.change"
] | 939,600 | 939,601 | u802434195 | cpp |
p03138 | #pragma GCC optimize("O3")
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("Os")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);
#define FO cout.tie(NULL);
#define FI cin.... | #pragma GCC optimize("O3")
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("Os")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);
#define FO cout.tie(NULL);
#define FI cin.... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change"
] | 939,614 | 939,615 | u927949305 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,616 | 939,617 | u350072791 | cpp |
p03138 | // INCLUDES
#include <assert.h>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// DEFINES
#define MAX 1000001
#define pii pair<int, int>
#define F first
#define S second
#define all(s) begin(s), end(s)
#define MIN3POS(a, b, c) ... | // INCLUDES
#include <assert.h>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// DEFINES
#define MAX 1000001
#define pii pair<int, int>
#define F first
#define S second
#define all(s) begin(s), end(s)
#define MIN3POS(a, b, c) ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,634 | 939,635 | u301593159 | cpp |
p03138 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts...... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts...... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,636 | 939,637 | u772304668 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < n; i++)
template <class T, class U> void cmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void cmin(T &a, U b) {
if (a > b)
a = b;
}
int main() {
cin.tie(0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < n; i++)
template <class T, class U> void cmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void cmin(T &a, U b) {
if (a > b)
a = b;
}
int main() {
cin.tie(0... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 939,678 | 939,679 | u366644013 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, k;
ll fx(ll x, vector<ll> &a) {
ll sum = 0;
for (ll i = 0; i < (ll)a.size(); i++)
sum += a[i] ^ x;
return sum;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
vector<int> bit_nums(64);
vector<int> x_vec(64);
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, k;
ll fx(ll x, vector<ll> &a) {
ll sum = 0;
for (ll i = 0; i < (ll)a.size(); i++)
sum += a[i] ^ x;
return sum;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
vector<int> bit_nums(64);
vector<int> x_vec(64);
for (int... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 939,680 | 939,681 | u883564798 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
ll A[100100];
int H[50];
ll DP[100][2];
ll N, K;
ll func(int i, bool bit) {
int h = H[i];
int num;
if (bit)
num = N - h;
else
num = h;
ll base = pow(2, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
ll A[100100];
int H[50];
ll DP[100][2];
ll N, K;
ll func(int i, bool bit) {
int h = H[i];
int num;
if (bit)
num = N - h;
else
num = h;
ll base = pow(2, ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,692 | 939,693 | u666394517 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
ll A[100100];
int H[50];
ll N, K;
ll calc(ll X) {
ll num = 0;
for (int i = 0; i < N; i++) {
num += X ^ A[i];
}
return num;
}
int main() {
cin >> N >> K;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
ll A[100100];
int H[50];
ll N, K;
ll calc(ll X) {
ll num = 0;
for (int i = 0; i < N; i++) {
num += X ^ A[i];
}
return num;
}
int main() {
cin >> N >> K;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,694 | 939,695 | u666394517 | cpp |
p03138 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,700 | 939,701 | u093922224 | cpp |
p03138 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,702 | 939,701 | u093922224 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<bool> vb;
typedef vector<ld> vld;
typedef vector<pii> vpii;
ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<bool> vb;
typedef vector<ld> vld;
typedef vector<pii> vpii;
ty... | [
"literal.number.change",
"io.output.change"
] | 939,703 | 939,704 | u832039789 | cpp |
p03138 | #include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
... | #include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
... | [
"control_flow.branch.if.condition.change"
] | 939,707 | 939,708 | u335104842 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define... | [
"assignment.change"
] | 939,721 | 939,722 | u196497077 | cpp |
p03138 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"expression.operation.unary.logical.remove"
] | 939,729 | 939,728 | u917944707 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int n;
long long int k;
long long int sum;
int cnt[40];
long long int dfs(int i, int f, long long int d) {
if (i < 0) {
return sum + d;
}
if (f) {
return dfs(i - 1, 1, d + max(0LL, (1LL << i) * (n - cnt[i] - cnt[i])));
} else {
if (k >> i & 1) {
... | #include <bits/stdc++.h>
using namespace std;
int n;
long long int k;
long long int sum;
int cnt[40];
long long int dfs(int i, int f, long long int d) {
if (i < 0) {
return sum + d;
}
if (f) {
return dfs(i - 1, 1, d + max(0LL, (1LL << i) * (n - cnt[i] - cnt[i])));
} else {
if (k >> i & 1) {
... | [
"expression.operation.binary.add"
] | 939,739 | 939,740 | u810067372 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> cnt(40, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 40; j++) {
cnt[j] += a[i] >> j & 1;
}
}
lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> cnt(40, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 40; j++) {
cnt[j] += a[i] >> j & 1;
}
}
lo... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,741 | 939,742 | u810067372 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> cnt(40, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 40; j++) {
cnt[j] += a[i] >> j & 1;
}
}
lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> cnt(40, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 40; j++) {
cnt[j] += a[i] >> j & 1;
}
}
lo... | [
"call.arguments.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"literal.number.type.widen.change"
] | 939,743 | 939,742 | u810067372 | cpp |
p03138 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T> void printv(const vector<T> &v) {
int sz = v.size();
for (int i = ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T> void printv(const vector<T> &v) {
int sz = v.size();
for (int i = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,758 | 939,759 | u968834127 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, k, a;
cin >> n >> k;
int j;
vector<int> t;
int y = 1;
for (int i = 0; i < n; i++) {
cin >> a;
j = 0;
while (a != 0 && j < t.size()) {
t[j] += a % 2;
a = a / 2;
j++;
}
while (a !=... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, k, a;
cin >> n >> k;
int j;
vector<int> t;
int y = 1;
for (int i = 0; i < n; i++) {
cin >> a;
j = 0;
while (a != 0 && j < t.size()) {
t[j] += a % 2;
a = a / 2;
j++;
}
while (a !=... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,762 | 939,763 | u651317892 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long K;
cin >> K;
vector<long long> A(N);
for (auto &a : A)
cin >> a;
long long best = 0;
for (long long bit = 1LL << 40; bit; bit >>= 1) {
int cnt = 0;
for (auto a : A)
if (a & bit)
cnt++;
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long K;
cin >> K;
vector<long long> A(N);
for (auto &a : A)
cin >> a;
long long best = 0;
for (long long bit = 1LL << 40; bit; bit >>= 1) {
int cnt = 0;
for (auto a : A)
if (a & bit)
cnt++;
if ... | [
"expression.operation.binary.change"
] | 939,768 | 939,769 | u207685829 | cpp |
p03138 | #include <bits/stdc++.h>
#define f(i, p, q) for (int i = p; i < q; i++)
using namespace std;
typedef long long ll;
long long int ar[64];
int main() { // freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
long long int n, k;
cin >> n >> k;
long long int t;
int l = 0;
long long int m = ... | #include <bits/stdc++.h>
#define f(i, p, q) for (int i = p; i < q; i++)
using namespace std;
typedef long long ll;
long long int ar[64];
int main() { // freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
long long int n, k;
cin >> n >> k;
long long int t;
int l = 0;
long long int m = ... | [
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 939,774 | 939,775 | u207685829 | cpp |
p03138 | #include <bits/stdc++.h>
#define f(i, p, q) for (int i = p; i < q; i++)
using namespace std;
typedef long long ll;
int ar[64];
int main() { // freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
long long int n, k;
cin >> n >> k;
long long int t;
int l = 0;
long long int m = n;
vecto... | #include <bits/stdc++.h>
#define f(i, p, q) for (int i = p; i < q; i++)
using namespace std;
typedef long long ll;
long long int ar[64];
int main() { // freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
long long int n, k;
cin >> n >> k;
long long int t;
int l = 0;
long long int m = ... | [
"variable_declaration.type.widen.change"
] | 939,779 | 939,778 | u207685829 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
int main() {
lint N, K;
cin >> N >> K;
vector<lint> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int bits = 0;
const lint INF = -1E18;
while (((lint)1 << bits) < K) {
bits++;
}
lint cnt[... | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
int main() {
lint N, K;
cin >> N >> K;
vector<lint> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int bits = 0;
const lint INF = -1E18;
while (((lint)1 << bits) < K) {
bits++;
}
lint cnt[... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,782 | 939,783 | u432456012 | cpp |
p03138 | #include <algorithm>
#include <iostream>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
ll n, k;
vector<ll> a;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
a.push_back(x);
}
ll num = 0;
for (int i = 42; i >= 0; i... | #include <algorithm>
#include <iostream>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
ll n, k;
vector<ll> a;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
a.push_back(x);
}
ll num = 0;
for (ll i = 42; i >= 0; i-... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 939,784 | 939,785 | u656732735 | cpp |
p03138 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
ll n, k;
ll calcBit(ll target) {
ll count = 1;
while (target > 1) {
target /= 2;
count++;
}
return count;
}
ll calcCount(vector<ll> &x, ll offs... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
ll n, k;
ll calcBit(ll target) {
ll count = 1;
while (target > 1) {
target /= 2;
count++;
}
return count;
}
ll calcCount(vector<ll> &x, ll offs... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,786 | 939,787 | u432897824 | cpp |
p03138 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); i--)
#define rrep(i, n) RFOR(i, n, 0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
cin.tie(0);
ios::sync_wit... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); i--)
#define rrep(i, n) RFOR(i, n, 0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
cin.tie(0);
ios::sync_wit... | [] | 939,788 | 939,789 | u755830696 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main(void) {
long long n, k;
std::cin >> n >> k;
std::vector<long long> v(n);
long long bit[64] = {0};
for (size_t i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main(void) {
long long n, k;
std::cin >> n >> k;
std::vector<long long> v(n);
long long bit[64] = {0};
for (size_t i = 0; i < n; i++) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,790 | 939,791 | u914739916 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long K;
cin >> K;
vector<long long> A(N);
for (auto &a : A)
cin >> a;
long long best = 0;
for (long long bit = 1LL << 40; bit; bit >>= 1) {
int cnt = 0;
for (auto a : A)
if (a & bit)
cnt++;
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long K;
cin >> K;
vector<long long> A(N);
for (auto &a : A)
cin >> a;
long long best = 0;
for (long long bit = 1LL << 40; bit; bit >>= 1) {
int cnt = 0;
for (auto a : A)
if (a & bit)
cnt++;
if ... | [
"assignment.change"
] | 939,794 | 939,795 | u449722246 | cpp |
p03138 | //#include "bits/stdc++.h"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <tuple>
#in... | //#include "bits/stdc++.h"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <tuple>
#in... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 939,798 | 939,799 | u810724221 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
signed main() {
int N, K;
cin >> N >> K;
vector<int> A... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
signed main() {
int N, K;
cin >> N >> K;
vector<int> A... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 939,800 | 939,801 | u864888234 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k_size;
const int maxbits = 40;
long long k, ans[maxbits][2], a_max = -1, result[2];
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
// a[i] = i;
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k_size;
const int maxbits = 40;
long long k, ans[maxbits][2], a_max = -1, result[2];
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a_max < a[i]) {
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 939,802 | 939,803 | u647474992 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<ll> cnt(61, 0);
for (int i = 0; i < N; i++) {
int j = 0;
ll a = A[i];
while (a > 0) {
if (a % 2 == 1)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> cnt(61, 0);
for (int i = 0; i < N; i++) {
int j = 0;
ll a = A[i];
while (a > 0) {
if (a % 2 == 1)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,807 | 939,808 | u119098168 | cpp |
p03138 | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 939,824 | 939,825 | u602850810 | cpp |
p03138 | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 939,826 | 939,825 | u602850810 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define SORT(v) sort(v.begin(), v.end())
#define M... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define SORT(v) sort(v.begin(), v.end())
#define M... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,842 | 939,840 | u007637377 | cpp |
p03138 | #include <iostream>
using namespace std;
int main() {
int N;
long K;
long A[100000];
long X = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i <= 40; i++) {
long n = (long)1 << i;
// cout << i << ':' << n << endl;
if (n > K)
break;
int cnt1 = ... | #include <iostream>
using namespace std;
int main() {
int N;
long K;
long A[100000];
long X = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i <= 40; i++) {
long n = (long)1 << i;
if (n > K)
break;
int cnt1 = 0;
int cnt0 = 0;
for (int j = 0... | [
"assignment.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,845 | 939,846 | u693133807 | cpp |
p03138 | #include <iostream>
using namespace std;
int main() {
int N;
long K;
long A[100000];
long X = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i <= 40; i++) {
long n = (long)1 << i;
// cout << i << ':' << n << endl;
if (n > K)
break;
int cnt1 = ... | #include <iostream>
using namespace std;
int main() {
int N;
long K;
long A[100000];
long X = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i <= 40; i++) {
long n = (long)1 << i;
if (n > K)
break;
int cnt1 = 0;
int cnt0 = 0;
for (int j = 0... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,847 | 939,846 | u693133807 | cpp |
p03138 | #include <iostream>
using namespace std;
int main() {
int N;
long K;
long A[100000];
long X = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i <= 50; i++) {
long n = (long)1 << i;
if (n > K)
break;
int cnt1 = 0;
int cnt0 = 0;
for (int j = 0... | #include <iostream>
using namespace std;
int main() {
int N;
long K;
long A[100000];
long X = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i <= 40; i++) {
long n = (long)1 << i;
if (n > K)
break;
int cnt1 = 0;
int cnt0 = 0;
for (int j = 0... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change",
"control_flow.branch.if.condition.change"
] | 939,848 | 939,846 | u693133807 | cpp |
p03138 | #include <iostream>
using namespace std;
int main() {
int N;
long K;
long A[100000];
long X = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i <= 50; i++) {
long n = (long)1 << i;
if (n > K)
break;
int cnt1 = 0;
int cnt0 = 0;
for (int j = 0... | #include <iostream>
using namespace std;
int main() {
int N;
long K;
long A[100000];
long X = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i <= 40; i++) {
long n = (long)1 << i;
if (n > K)
break;
int cnt1 = 0;
int cnt0 = 0;
for (int j = 0... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,849 | 939,846 | u693133807 | cpp |
p03138 | #include "bits/stdc++.h"
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#define BUGAVOID(x) x
#define rep(...) \
BUGAVOID(_overload3(__VA_ARGS__, r... | #include "bits/stdc++.h"
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#define BUGAVOID(x) x
#define rep(...) \
BUGAVOID(_overload3(__VA_ARGS__, r... | [
"expression.operation.binary.remove"
] | 939,857 | 939,858 | u751488284 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N... | [] | 939,866 | 939,867 | u864171425 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (a * b) % mod
#define rollcall cout << "I'm Sucu." ... | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (a * b) % mod
#define rollcall cout << "I'm Sucu." ... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 939,868 | 939,869 | u691493208 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 939,872 | 939,873 | u558092537 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,878 | 939,879 | u700986952 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using int64 = int64_t;
#define int int64
// dp[i][j] := ibit目まで見てそこまでの値がk未満で(0:ない, 1:ある)時の最大値
int dp[60][2];
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
memset(dp, -1, sizeof(dp));
dp[45][0] = 0;
f... | #include <bits/stdc++.h>
using namespace std;
using int64 = int64_t;
#define int int64
// dp[i][j] := ibit目まで見てそこまでの値がk未満で(0:ない, 1:ある)時の最大値
int dp[60][2];
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
memset(dp, -1, sizeof(dp));
dp[45][0] = 0;
f... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 939,884 | 939,885 | u258009780 | cpp |
p03138 | //{
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll, ll> ii;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define FILL(i, n) memset(i, n, sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define... | //{
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll, ll> ii;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define FILL(i, n) memset(i, n, sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 939,888 | 939,889 | u882946280 | cpp |
p03138 | #include <iostream>
using namespace std;
int main(void) {
long long N, K, k, M, S, T, i;
cin >> N >> K;
long long A[N];
S = 0;
for (i = 0; i < N; i++) {
cin >> A[i];
S += A[i];
}
M = 1;
while (M < K) {
M *= 2;
}
M /= 2;
k = 0;
while (M > 0) {
k += M;
T = 0;
for (i = 0; i ... | #include <iostream>
using namespace std;
int main(void) {
long long N, K, k, M, S, T, i;
cin >> N >> K;
long long A[N];
S = 0;
for (i = 0; i < N; i++) {
cin >> A[i];
S += A[i];
}
M = 1;
while (M < K + 1) {
M *= 2;
}
M /= 2;
k = 0;
while (M > 0) {
k += M;
T = 0;
for (i = 0... | [
"control_flow.loop.condition.change"
] | 939,894 | 939,895 | u965103758 | cpp |
p03138 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define mp make_pair
#define fi first
#define se second
#define p... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define mp make_pair
#define fi first
#define se second
#define p... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 939,896 | 939,897 | u862316882 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const long long NMAX = 1e5;
const long long BMAX = 60;
long long v[NMAX + 2], N, K;
long long ans = 0;
long long nr[BMAX + 2], sp_nr[BMAX + 2], best_sp[BMAX + 2];
int main() {
cin >> N >> K;
for (long long i = 1; i <= N; ++i) {
cin >> v[i];
for (long long j ... | #include <bits/stdc++.h>
using namespace std;
const long long NMAX = 1e5;
const long long BMAX = 60;
long long v[NMAX + 2], N, K;
long long ans = 0;
long long nr[BMAX + 2], sp_nr[BMAX + 2], best_sp[BMAX + 2];
int main() {
cin >> N >> K;
for (long long i = 1; i <= N; ++i) {
cin >> v[i];
for (long long j ... | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 939,907 | 939,908 | u781135700 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define f(i, n) for (long long i = 0; i < (long long)(n); i++)
#define N 20000... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define f(i, n) for (long long i = 0; i < (long long)(n); i++)
#define N 20000... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 939,909 | 939,910 | u527748649 | cpp |
p03138 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [
"control_flow.branch.if.condition.change"
] | 939,911 | 939,912 | u918357423 | cpp |
p03138 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [
"control_flow.branch.if.condition.change"
] | 939,913 | 939,912 | u918357423 | cpp |
p03139 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 939,920 | 939,921 | u516525290 | cpp |
p03139 | #include <bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#de... | #include <bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#de... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 939,922 | 939,923 | u722640678 | cpp |
p03139 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << min(0, A + B - N) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << max(0, A + B - N) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 939,926 | 939,927 | u629603666 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
// int X=max(A,B);
int Y = min(A, B);
if (A + B <= N)
cout << Y << " " << 0 << endl;
else
cout << Y << " " << N - A - B << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
// int X=max(A,B);
int Y = min(A, B);
if (A + B <= N)
cout << Y << " " << 0 << endl;
else
cout << Y << " " << A + B - N << endl;
}
| [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 939,935 | 939,936 | u430394202 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(A, B) << " ";
if (A >= B + C) {
cout << 0 << endl;
} else {
cout... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(C, B) << " ";
if (A >= B + C) {
cout << 0 << endl;
} else {
cout... | [
"identifier.change",
"io.output.change"
] | 939,939 | 939,940 | u025773431 | cpp |
p03139 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define ROF(i, a, b) for (ll i = a; i >= b; i--)
#define per(i, a) ROF(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using ch = char;
typedef ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define ROF(i, a, b) for (ll i = a; i >= b; i--)
#define per(i, a) ROF(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using ch = char;
typedef ... | [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 939,946 | 939,947 | u328811800 | cpp |
p03139 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define ROF(i, a, b) for (ll i = a; i >= b; i--)
#define per(i, a) ROF(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using ch = char;
typedef ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define ROF(i, a, b) for (ll i = a; i >= b; i--)
#define per(i, a) ROF(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using ch = char;
typedef ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"expression.operation.binary.remove"
] | 939,948 | 939,947 | u328811800 | cpp |
p03139 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
printf("%d %d\n", max(a, b), max(a + b - n, 0));
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
printf("%d %d\n", min(a, b), max(a + b - n, 0));
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 939,949 | 939,950 | u781095600 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << ' ' << b - (n - a) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << ' ' << max(b - (n - a), 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 939,951 | 939,952 | u691380397 | cpp |
p03139 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << ' ' << min(0, a + b - n) << '\n';
// cout << min(a, b) << ' ' << min(a - (n - b), b - (n -a)) << '\n';
return... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << ' ' << max(0, a + b - n) << '\n';
// cout << min(a, b) << ' ' << min(a - (n - b), b - (n -a)) << '\n';
return... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 939,966 | 939,967 | u596385287 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(B, C) << " " << B + C - A << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(B, C) << " " << max(B + C - A, 0) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 939,974 | 939,975 | u237390401 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define lscan(x) scanf("%I64d", &x)
#define lprint(x) printf("%I64d", x)
ll gcd(ll a, ll b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define lscan(x) scanf("%I64d", &x)
#define lprint(x) printf("%I64d", x)
ll gcd(ll a, ll b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 939,976 | 939,977 | u933068010 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << min(a + b - n, 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(a + b - n, 0) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 939,978 | 939,979 | u732578115 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << a + b - n << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(a + b - n, 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 939,980 | 939,979 | u732578115 | cpp |
p03139 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
cout << min(x, y) << " ";
if (x + y <= 10) {
cout << 0 << endl;
} else {
cout << x + y - 10 << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
cout << min(x, y) << " ";
if (x + y <= n) {
cout << 0 << endl;
} else {
cout << x + y - n << endl;
}
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 939,981 | 939,982 | u401900157 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1000000007;
ll r(ll x, ll y) {
if (y == 0)
return 1;
else if (y % 2 == 0)
return r(x, y / 2) * r(x, y / 2) % mod;
else
return x * r(x, (y - 1) / 2) % mod * r(x, (y - 1) / 2) % mod;
}
int main() {
int n, a, b;
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1000000007;
ll r(ll x, ll y) {
if (y == 0)
return 1;
else if (y % 2 == 0)
return r(x, y / 2) * r(x, y / 2) % mod;
else
return x * r(x, (y - 1) / 2) % mod * r(x, (y - 1) / 2) % mod;
}
int main() {
int n, a, b;
cin >>... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,985 | 939,986 | u985686845 | cpp |
p03139 | #include <iostream>
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
if (n >= a + b) {
cout << min(a, b) << " " << 0 << endl;
} else {
cout << min(a, b) << a + b - n << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
if (n >= a + b) {
cout << min(a, b) << " " << 0 << endl;
} else {
cout << min(a, b) << " " << a + b - n << endl;
}
} | [
"io.output.change"
] | 939,987 | 939,988 | u163874353 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.