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 9
values |
|---|---|---|---|---|---|---|---|
p03027 | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 837,343 | 837,344 | u283869437 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef pair<int, int> ii;
typedef long long LL;
#define pb push_back
const int INF = 2147483647;
const int MOD = 1000003;
int pot[MOD + 5], z, x, d, n, licz, mian, r;
// rozwiązuje równanie ax=1(%MOD), gdy MOD pierwsze
int inverse(int a, int n = M... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef pair<int, int> ii;
typedef long long LL;
#define pb push_back
const int INF = 2147483647;
const int MOD = 1000003;
int pot[MOD + 5], z, x, d, n, licz, mian, r;
// rozwiązuje równanie ax=1(%MOD), gdy MOD pierwsze
int inverse(int a, int n = M... | [
"assignment.change"
] | 837,352 | 837,353 | u643180062 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 1000003;
ll fact[1111111];
ll po(ll a, ll b) {
if (b == 0)
return 1;
ll z = po(a, b / 2);
z = z * z % mod;
if (b % 2 == 1)
z = z * a % mod;
return z;
}
ll inv(ll a) { return po(a, mod - 2); }
int main() {
ll Q;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 1000003;
ll fact[1111111];
ll po(ll a, ll b) {
if (b == 0)
return 1;
ll z = po(a, b / 2);
z = z * z % mod;
if (b % 2 == 1)
z = z * a % mod;
return z;
}
ll inv(ll a) { return po(a, mod - 2); }
int main() {
ll Q;
cin >> ... | [
"io.output.newline.add"
] | 837,359 | 837,360 | u084968244 | cpp |
p03027 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e6 + 3)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e6 + 3)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 837,365 | 837,366 | u229842440 | cpp |
p03027 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e6 + 3)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e6 + 3)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 837,365 | 837,367 | u229842440 | cpp |
p03027 | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | [
"control_flow.return.remove",
"control_flow.continue.add"
] | 837,370 | 837,371 | u704625420 | cpp |
p03027 | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000003;
ll fact[1000003], fact_inv[1000003];
ll inv[1000003]; //普通の数のinv
ll modpow(ll a, ll b) {
ll ret = 1, kakeru = a;
while (b > 0) {
if (b & 1)
ret *= kakeru, ret %= MOD;
kakeru *= kakeru, kakeru %= MOD;
b >>= 1... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000003;
ll fact[1000003], fact_inv[1000003];
ll inv[1000003]; //普通の数のinv
ll modpow(ll a, ll b) {
ll ret = 1, kakeru = a;
while (b > 0) {
if (b & 1)
ret *= kakeru, ret %= MOD;
kakeru *= kakeru, kakeru %= MOD;
b >>= 1... | [
"identifier.change",
"io.output.change"
] | 837,378 | 837,379 | u107077805 | cpp |
p03027 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long lon... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long lon... | [] | 837,391 | 837,392 | u997521090 | cpp |
p03027 | #include <iostream>
using namespace std;
const int MOD = 1000003;
const int N_MAX = 1000003;
typedef long long ll;
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < N_MAX; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MO... | #include <iostream>
using namespace std;
const int MOD = 1000003;
const int N_MAX = 1000003;
typedef long long ll;
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < N_MAX; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MO... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 837,397 | 837,398 | u693133807 | cpp |
p03027 | #include <iostream>
using namespace std;
const int MOD = 1000003;
const int N_MAX = 1000003;
typedef long long ll;
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < N_MAX; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MO... | #include <iostream>
using namespace std;
const int MOD = 1000003;
const int N_MAX = 1000003;
typedef long long ll;
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < N_MAX; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MO... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 837,399 | 837,398 | u693133807 | cpp |
p03027 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 10005
#define ba 47
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 10005
#define ba 47
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int ... | [] | 837,403 | 837,404 | u845980916 | cpp |
p03027 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <int MOD> class Modular {
private:
long long value;
public:
constexpr Modular() : value(){};
constexpr Modular(const Modular &other) : value(other.value) {}
template <typename U> constexpr Modular(const U &x) { value = normalize(x... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <int MOD> class Modular {
private:
long long value;
public:
constexpr Modular() : value(){};
constexpr Modular(const Modular &other) : value(other.value) {}
template <typename U> constexpr Modular(const U &x) { value = normalize(x... | [
"identifier.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 837,405 | 837,406 | u817760251 | cpp |
p03027 | #pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define INIT \
std::cin.tie(0); \
std::ios::sync_with_stdio(false);
#define ALL(c) (c).... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define INIT \
std::cin.tie(0); \
std::ios::sync_with_stdio(false);
#define ALL(c) (c).... | [
"expression.operation.binary.remove"
] | 837,407 | 837,408 | u685774550 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;
typ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;
typ... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 837,409 | 837,410 | u069450081 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 837,411 | 837,412 | u833393891 | cpp |
p03027 | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 1000003;
using ll = long long;
using namespace std;
ll modPow(ll a, int n) {
ll res = 1;
int i = 1;
while (i <= n) {
if (n & i) {
res *= a;
res %= mod;
}
i <<= 1;
a = a * a % mod;
}
return res... | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 1000003;
using ll = long long;
using namespace std;
ll modPow(ll a, int n) {
ll res = 1;
int i = 1;
while (i <= n) {
if (n & i) {
res *= a;
res %= mod;
}
i <<= 1;
a = a * a % mod;
}
return res... | [
"control_flow.branch.else.remove"
] | 837,415 | 837,414 | u268977772 | cpp |
p03027 | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 1000003;
using ll = long long;
using namespace std;
ll modPow(ll a, int n) {
ll res = 1;
int i = 1;
while (i <= n) {
if (n & i) {
res *= a;
res %= mod;
}
i <<= 1;
a = a * a % mod;
}
return res... | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 1000003;
using ll = long long;
using namespace std;
ll modPow(ll a, int n) {
ll res = 1;
int i = 1;
while (i <= n) {
if (n & i) {
res *= a;
res %= mod;
}
i <<= 1;
a = a * a % mod;
}
return res... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 837,416 | 837,417 | u268977772 | cpp |
p03027 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int mod = 1000003;
///////////// modの計算
long long mod_adjust(long long a) { // 余りをとる(0～mod-1に調整する)
if (a > mod) {
return a % mod;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int mod = 1000003;
///////////// modの計算
long long mod_adjust(long long a) { // 余りをとる(0～mod-1に調整する)
if (a > mod) {
return a % mod;
... | [] | 837,420 | 837,421 | u793275002 | cpp |
p03027 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
const long long Mod = 100... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
const long long Mod = 100... | [
"call.add",
"io.output.change",
"call.arguments.change"
] | 837,422 | 837,423 | u467826805 | cpp |
p03027 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e6 + 3);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b = (b < MOD) ? b : (b - M... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e6 + 3);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b = (b < MOD) ? b : (b - M... | [] | 837,428 | 837,429 | u548624367 | cpp |
p03027 | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << '\n'
using namespace std;
typed... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << '\n'
using namespace std;
typed... | [] | 837,432 | 837,433 | u120143737 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1000003;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setpre... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1000003;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setpre... | [
"io.output.change",
"call.add",
"call.arguments.change"
] | 837,434 | 837,435 | u524343822 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1000003;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setpre... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1000003;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setpre... | [
"io.output.change",
"call.add",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 837,436 | 837,435 | u524343822 | cpp |
p03027 | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long i64;
const int P = 1e6 + 3;
int inv[2 * P];
int pwr(int x, int a) {
int s = 1;
while (a) {
if (a & 1)
s = (i64)s * x % P;
x = (i64)x * x % P;
a >>= 1;
}
return s;
}
int main() {
int T, i, n, d, x, y;
scanf("%d"... | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long i64;
const int P = 1e6 + 3;
int inv[2 * P];
int pwr(int x, int a) {
int s = 1;
while (a) {
if (a & 1)
s = (i64)s * x % P;
x = (i64)x * x % P;
a >>= 1;
}
return s;
}
int main() {
int T, i, n, d, x, y;
scanf("%d"... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 837,437 | 837,438 | u274497234 | cpp |
p03027 | #include <bits/stdc++.h>
#define REP(x, y, z) for (int x = y; x <= z; x++)
#define MSET(x, y) memset(x, y, sizeof(x))
#define M 3000003
#define MOD 1000003
using namespace std;
using LL = long long;
LL pw(LL x, LL y) {
LL res = 1, tmp = x;
while (y) {
if (y & 1)
res = res * tmp % MOD;
tmp = tmp * tmp ... | #include <bits/stdc++.h>
#define REP(x, y, z) for (int x = y; x <= z; x++)
#define MSET(x, y) memset(x, y, sizeof(x))
#define M 3000003
#define MOD 1000003
using namespace std;
using LL = long long;
LL pw(LL x, LL y) {
LL res = 1, tmp = x;
while (y) {
if (y & 1)
res = res * tmp % MOD;
tmp = tmp * tmp ... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 837,441 | 837,442 | u710687729 | cpp |
p03027 | #include <bits/stdc++.h>
#define REP(x, y, z) for (int x = y; x <= z; x++)
#define MSET(x, y) memset(x, y, sizeof(x))
#define M 3000003
#define MOD 1000003
using namespace std;
using LL = long long;
LL pw(LL x, LL y) {
LL res = 1, tmp = x;
while (y) {
if (y & 1)
res = res * tmp % MOD;
tmp = tmp * tmp ... | #include <bits/stdc++.h>
#define REP(x, y, z) for (int x = y; x <= z; x++)
#define MSET(x, y) memset(x, y, sizeof(x))
#define M 3000003
#define MOD 1000003
using namespace std;
using LL = long long;
LL pw(LL x, LL y) {
LL res = 1, tmp = x;
while (y) {
if (y & 1)
res = res * tmp % MOD;
tmp = tmp * tmp ... | [
"call.add",
"call.arguments.change"
] | 837,443 | 837,442 | u710687729 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A, P;
cout << (A * 3 + P) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 2 << endl;
} | [] | 837,453 | 837,454 | u113287534 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
if ((A * 3 + P) % 2 == 0) {
cout << (A * 3 + P) / 2 << endl;
} else {
cout << (A * 3 + P) / 2 - 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
if ((A * 3 + P) % 2 == 0) {
cout << (A * 3 + P) / 2 << endl;
} else {
cout << (A * 3 + P) / 2 << endl;
}
} | [
"expression.operation.binary.remove"
] | 837,465 | 837,466 | u714624983 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
if (A * 3 + P % 2 == 0) {
cout << (A * 3 + P) / 2 << endl;
} else {
cout << (A * 3 + P) / 2 - 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
if ((A * 3 + P) % 2 == 0) {
cout << (A * 3 + P) / 2 << endl;
} else {
cout << (A * 3 + P) / 2 << endl;
}
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 837,468 | 837,466 | u714624983 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
cout << 3 * m + n / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
cout << (3 * m + n) / 2;
return 0;
} | [
"expression.operation.binary.remove"
] | 837,469 | 837,470 | u638166435 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int sum = 3 * a + p;
cout << sum / 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int sum = 3 * a + p;
cout << sum / 2 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 837,471 | 837,472 | u605833494 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p * 2) / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2 << endl;
} | [
"expression.operation.binary.remove"
] | 837,490 | 837,491 | u451954557 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 837,496 | 837,497 | u894339989 | cpp |
p03029 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, P;
cin >> A, P;
int ans;
ans = 3 * A + P;
cout << ans / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, P;
cin >> A >> P;
int ans;
ans = 3 * A + P;
cout << ans / 2 << endl;
return 0;
}
| [] | 837,504 | 837,505 | u282657760 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int ringo, kakera, ans;
cin >> ringo >> kakera;
kakera = kakera + ringo / 3;
ans = kakera / 2;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int ringo, kakera, ans;
cin >> ringo >> kakera;
kakera = kakera + ringo * 3;
ans = kakera / 2;
cout << ans << endl;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 837,506 | 837,507 | u540695932 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007... | [] | 837,510 | 837,511 | u926025622 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
p += 3 * a;
cout << a / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
p += 3 * a;
cout << p / 2 << endl;
} | [
"identifier.change",
"io.output.change"
] | 837,522 | 837,523 | u529089914 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A, P;
cout << (A * 3 + P) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 2 << endl;
}
| [] | 837,538 | 837,539 | u234126771 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A, P;
cout << (A * 3 + P) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 2 << endl;
}
| [] | 837,540 | 837,539 | u234126771 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p; // 変数の宣言
cin >> a >> p; // 入力
int sum = a * 3 + p; // リンゴを全て砕き、かけらの合計を求める
int apple_pie; // 作れるアップルパイの数
if (sum % 2 == 0) // かけらの合計が偶数の時
{
apple_pie = (sum - 1) / 2;
} else // かけらの合計が奇数の時
{
apple_pie = sum / 2;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p; // 変数の宣言
cin >> a >> p; // 入力
int sum = a * 3 + p; // リンゴを全て砕き、かけらの合計を求める
int apple_pie; // 作れるアップルパイの数
if (sum % 2 == 1) // かけらの合計が奇数の時
{
apple_pie = (sum - 1) / 2;
} else // かけらの合計が偶数の時
{
apple_pie = sum / 2;
}
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 837,541 | 837,542 | u267222408 | cpp |
p03029 | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
p = p + a / 3;
cout << p / 2;
} | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
p = p + a * 3;
cout << p / 2;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 837,545 | 837,546 | u490963780 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int app = A + 3 * P;
int ans = app / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int app = 3 * A + P;
int ans = app / 2;
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 837,547 | 837,548 | u105533331 | cpp |
p03029 | long long A, B, C, D, E, F, I, J, K, M, N, O, Q, R, S, T, U, V, X, Y, Z;
// long long A,B,C,D,E,F, H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z;
double dA, dB, dC, dD, dE, dF, dI, dJ, dK, dM, dN, dO, dP, dQ, dR, dS, dT, dU,
dV, dX, dY, dZ;
#include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ... | long long A, B, C, D, E, F, I, J, K, M, N, O, Q, R, S, T, U, V, X, Y, Z;
// long long A,B,C,D,E,F, H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z;
double dA, dB, dC, dD, dE, dF, dI, dJ, dK, dM, dN, dO, dP, dQ, dR, dS, dT, dU,
dV, dX, dY, dZ;
#include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ... | [
"call.arguments.change"
] | 837,549 | 837,550 | u069521477 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int app = 0;
p += a * 3;
cout << p / 3 << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int app = 0;
p += a * 3;
cout << p / 2 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 837,555 | 837,556 | u657208344 | cpp |
p03029 | #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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | #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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 837,557 | 837,558 | u908318580 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (2 * A + P) / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (3 * A + P) / 2 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 837,590 | 837,591 | u627821211 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int a, p;
cin >> a >> p;
p += 3 * a;
cout << p / 3 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int a, p;
cin >> a >> p;
p += 3 * a;
cout << p / 2 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 837,596 | 837,597 | u945761460 | cpp |
p03029 | #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 PRINT(item) cout << (item) << endl;
#define PRINT_VEC(V) \
for (auto v : (V)) ... | #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 PRINT(item) cout << (item) << endl;
#define PRINT_VEC(V) \
for (auto v : (V)) ... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 837,615 | 837,616 | u223960644 | cpp |
p03029 | #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 PRINT(item) cout << (item) << endl;
#define PRINT_VEC(V) \
for (auto v : (V)) ... | #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 PRINT(item) cout << (item) << endl;
#define PRINT_VEC(V) \
for (auto v : (V)) ... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 837,617 | 837,616 | u223960644 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
a *= 3;
cout << (a + p) % 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
a *= 3;
cout << (a + p) / 2;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 837,632 | 837,633 | u873762144 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, P;
cin >> A >> P;
cout << (3 * A + P) / 3;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, P;
cin >> A >> P;
cout << (3 * A + P) / 2;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 837,640 | 837,641 | u316491370 | cpp |
p03029 | #include <iostream>
int main() {
int a, p;
std::cin >> a >> p;
std::cout << 3 * a + p / 2 << std::endl;
return 0;
} | #include <iostream>
int main() {
int a, p;
std::cin >> a >> p;
std::cout << (3 * a + p) / 2 << std::endl;
return 0;
}
| [] | 837,642 | 837,643 | u864752370 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a, b;
cout << int((3 * a + b) / 2);
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << int((3 * a + b) / 2);
} | [] | 837,646 | 837,647 | u954703812 | cpp |
p03029 | // Justice will be served
// شهید حاج قاسم سلیمانی
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * 3 + b;
} | // Justice will be served
// شهید حاج قاسم سلیمانی
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * 3 + b) / 2;
}
| [
"expression.operation.binary.add"
] | 837,648 | 837,649 | u113816634 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << ((a / 3) + p) / 2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << ((a * 3) + p) / 2;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 837,650 | 837,651 | u976082990 | cpp |
p03029 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (p + 3 * a) % 2 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (p + 3 * a) / 2 << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 837,652 | 837,653 | u476027087 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int a, p;
cin >> a >> p;
a = a * 3;
int sum = p + a;
cout << sum / 3;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int a, p;
cin >> a >> p;
a = a * 3;
int sum = p + a;
cout << sum / 2;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 837,658 | 837,659 | u476305001 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a, b;
a = a * 3;
a += b;
cout << a / 2;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
a = a * 3;
a += b;
cout << a / 2;
}
| [] | 837,666 | 837,667 | u225830069 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P, ans;
cin >> A >> P;
if (P % 2 == 0)
ans = (3 * A + P) / 2;
else
ans = (3 * A + P - 1) / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P, ans;
cin >> A >> P;
if (P % 2 == 0)
ans = (3 * A + P) / 2;
else
ans = (3 * A + P) / 2;
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 837,668 | 837,669 | u556774846 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, p, k, h;
cin >> a >> p;
p = p + 3 * a;
cout << p;
}
| #include <iostream>
using namespace std;
int main() {
int a, p, k, h;
cin >> a >> p;
p = p + 3 * a;
cout << p / 2;
}
| [
"expression.operation.binary.add"
] | 837,670 | 837,671 | u406246506 | cpp |
p03029 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int A, P = 0;
int pie_num = 0;
/* 標準入力 */
cin >> A >> P;
P += (A / 2);
pie_num = P / 2;
cout << pie_num << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int A, P = 0;
int pie_num = 0;
/* 標準入力 */
cin >> A >> P;
P += A * 3;
pie_num = P / 2;
cout << pie_num << endl;
return 0;
} | [] | 837,681 | 837,682 | u942653486 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define f(i, a, b) for (int i = a; i < b; i++)
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, p;
cin >> a >> p;
int ans = (3 * a + p) / 3;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define f(i, a, b) for (int i = a; i < b; i++)
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, p;
cin >> a >> p;
int ans = (3 * a + p) / 2;
cout << ans << endl;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 837,689 | 837,690 | u123011509 | cpp |
p03029 | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 3 << endl;
} | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 2 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 837,697 | 837,698 | u323542775 | cpp |
p03029 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector... | [] | 837,703 | 837,704 | u604896914 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a, b;
cout << b / 2 + (b % 2 + a * 3) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b / 2) + ((b % 2 + a * 3) / 2) << endl;
} | [] | 837,739 | 837,740 | u165771525 | cpp |
p03029 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int tip = a * 3;
int pie = tip / 2;
cout << pie << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int tip = a * 3;
int pie = (tip + p) / 2;
cout << pie << endl;
}
| [] | 837,743 | 837,744 | u902803949 | cpp |
p03029 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int a, p;
cin >> a >> p;
p += a * 3;
cout << a / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
p += a * 3;
cout << p / 2 << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 837,747 | 837,748 | u616998927 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << 3 * A + P / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (3 * A + P) / 2 << endl;
}
| [] | 837,749 | 837,750 | u144013030 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << 3 * A + P / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (3 * A + P) / 2 << endl;
} | [] | 837,749 | 837,751 | u144013030 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (3 * a + p) * 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (3 * a + p) / 2 << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 837,765 | 837,766 | u882039496 | cpp |
p03029 | #include <iostream>
int main(void) {
int A, P;
std::cin >> A;
std::cin >> P;
P = P + 3 * A;
std::cout << P / 3 << std::endl;
return 0;
} | #include <iostream>
int main(void) {
int A, P;
std::cin >> A;
std::cin >> P;
P = P + 3 * A;
std::cout << P / 2 << std::endl;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 837,769 | 837,770 | u122994151 | cpp |
p03029 | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll apple, pieces;
ll pies = 0;
cin >> apple >> pieces;
pies = (pieces + apple * 3) / 2;
cout << pieces;
return 0;
} | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll apple, pieces;
ll pies = 0;
cin >> apple >> pieces;
pies = (pieces + apple * 3) / 2;
cout << pies;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 837,771 | 837,772 | u708351207 | cpp |
p03029 | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll apple, pieces;
ll pies = 0;
cin >> apple >> pieces;
pies = (pieces + apple / 3) / 2;
cout << pieces;
return 0;
} | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll apple, pieces;
ll pies = 0;
cin >> apple >> pieces;
pies = (pieces + apple * 3) / 2;
cout << pies;
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 837,773 | 837,772 | u708351207 | cpp |
p03029 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | [
"literal.number.change",
"io.output.change"
] | 837,774 | 837,775 | u861345985 | cpp |
p03029 | #include <stdio.h>
int main() {
int a, p;
scanf("%d %d", &a, &p);
int t = (a * 3) + p;
printf("%d", t % 2);
}
| #include <stdio.h>
int main() {
int a, p;
scanf("%d %d", &a, &p);
int t = (a * 3) + p;
printf("%d", t / 2);
}
| [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 837,786 | 837,787 | u405346337 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << ((a * 2 + p) >> 1) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << ((a * 3 + p) >> 1) << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 837,788 | 837,789 | u522506260 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << ((a * 2 + p) >> 1) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << ((a * 3 + p) / 2) << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 837,788 | 837,790 | u522506260 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (3 * A + P) % 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (3 * A + P) / 2 << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 837,798 | 837,799 | u559112776 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2.0 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2 << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 837,809 | 837,810 | u548587261 | cpp |
p03029 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 3 << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 837,816 | 837,817 | u806149832 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, d;
cin >> s >> d;
cout << (2 * s + d) / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, d;
cin >> s >> d;
cout << (3 * s + d) / 2 << endl;
}
| [
"literal.number.change",
"io.output.change",
"io.output.newline.add"
] | 837,822 | 837,821 | u103850114 | cpp |
p03029 | #include <stdio.h>
int main() {
int apple;
int pieces1;
scanf("%d", &apple, &pieces1);
printf("%d", ((apple * 3) + pieces1) / 2);
return 0;
}
| #include <stdio.h>
int main() {
int apple;
int pieces1;
scanf("%d %d", &apple, &pieces1);
printf("%d", ((apple * 3) + pieces1) / 2);
return 0;
}
| [
"literal.string.change",
"call.arguments.change"
] | 837,827 | 837,828 | u816631826 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << ((3 * a) + p) / 3;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (((a * 3) + p) / 2);
} | [
"io.output.change",
"literal.number.change"
] | 837,829 | 837,830 | u816631826 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
int A, P;
cin >> A >> P;
cout << 3 * A / P << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
int A, P;
cin >> A >> P;
cout << (3 * A + P) / 2 << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 837,831 | 837,832 | u005072763 | cpp |
p03029 | #include <stdio.h>
int main() {
int A;
int P;
scanf("%d %d", &A, &P);
printf("%d", (A * P) / 2);
return 0;
} | #include <stdio.h>
int main() {
int A, P;
scanf("%d %d", &A, &P);
printf("%d", (A * 3 + P) / 2);
return 0;
} | [
"expression.operation.binary.add"
] | 837,845 | 837,846 | u018679195 | cpp |
p03029 | #include <stdio.h>
int main() {
int A;
int P;
scanf("%d %d", &A, &P);
printf("%d", (A * P) / 2);
return 0;
} | #include <stdio.h>
int main() {
int A;
int P;
scanf("%d %d", &A, &P);
printf("%d\n", (3 * A + P) / 2);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 837,845 | 837,847 | u018679195 | cpp |
p03029 | #include <bits/stdc++.h>
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
using ll = long long;
using ull = unsigned long long;
template <class T> inline bool chmax(T... | #include <bits/stdc++.h>
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
using ll = long long;
using ull = unsigned long long;
template <class T> inline bool chmax(T... | [
"literal.number.change",
"io.output.change"
] | 837,854 | 837,855 | u979078704 | cpp |
p03029 | #include <stdio.h>
int main() {
int a, p, c;
scanf("%d %d", &a, &p);
c = (a * 4 + p) / 2;
printf("%d", c);
return 0;
} | #include <stdio.h>
int main() {
int a, p, ap;
scanf("%d %d", &a, &p);
ap = (a * 3 + p) / 2;
printf("%d", ap);
return 0;
} | [
"identifier.change",
"assignment.variable.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"io.output.change"
] | 837,858 | 837,859 | u089230684 | cpp |
p03029 | #include <stdio.h>
int main() {
int X;
int Y;
int Z;
scanf("%d", &X, &Y);
Z = (X * 3 + Y) / 2;
printf("%d", Z);
return 0;
} | #include <stdio.h>
int main() {
int X;
int Y;
int Z;
scanf("%d %d", &X, &Y);
Z = (X * 3 + Y) / 2;
printf("%d", Z);
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 837,860 | 837,861 | u353919145 | cpp |
p03029 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); ++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <clas... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); ++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <clas... | [] | 837,869 | 837,870 | u371149954 | cpp |
p03029 | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define ... | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define ... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 837,876 | 837,877 | u683769494 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (3 * a + p) / 3 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (3 * a + p) / 2 << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 837,891 | 837,892 | u162080911 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (a + 3 * p) / 3 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (3 * a + p) / 2 << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 837,893 | 837,892 | u162080911 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int apple, A, P;
cin >> A >> P;
apple = (A * 3 + P) % 2;
cout << apple << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int apple, A, P;
cin >> A >> P;
apple = (A * 3 + P) / 2;
cout << apple << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 837,917 | 837,918 | u625176086 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (A * 3) / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 2 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 837,919 | 837,920 | u962942039 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3) + p / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << ((a * 3) + p) / 2 << endl;
} | [] | 837,933 | 837,934 | u553927381 | cpp |
p03029 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int ans = (3 * a + p + 1) / 2 - 1;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int ans = (3 * a + p) / 2;
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 837,945 | 837,946 | u071554349 | cpp |
p03029 | #define LOCAL
/* 実行時間1s制限の場合
10^6 1,000,000 : 余裕をもって間に合う
10^7 10,000,000 : おそらく間に合う
10^8 100,000,000 : 非常にシンプルな処理でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // lon... | /* 実行時間1s制限の場合
10^6 1,000,000 : 余裕をもって間に合う
10^7 10,000,000 : おそらく間に合う
10^8 100,000,000 : 非常にシンプルな処理でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // long longはデータモデル(... | [] | 837,956 | 837,957 | u234248338 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
int P;
cin >> P;
int a = A / 3;
cout << (a + P) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
int P;
cin >> P;
int a = A * 3;
cout << (a + P) / 2 << endl;
} | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 837,965 | 837,966 | u263220374 | cpp |
p03029 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
ll A, P;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> A >> P;
cout << P * 3 / 2 << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
ll A, P;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> A >> P;
cout << (P + A * 3) / 2 << endl;
} | [
"expression.operation.binary.add"
] | 837,969 | 837,970 | u533920479 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.