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 |
|---|---|---|---|---|---|---|---|
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (13 <= a) {
cout << b << endl;
} else if (5 <= a && a <= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (13 <= a) {
cout << b << endl;
} else if (6 <= a && a <= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,584 | 847,585 | u017167684 | cpp |
p03035 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a, b;
main() {
cin >> a >> b;
if (a >= 13) {
cout << b;
return 0;
}
if (a >= 5 && a <= 12) {
cout << b / 2;
return 0;
}
cout << 0;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
int a, b;
main() {
cin >> a >> b;
if (a >= 13) {
cout << b;
return 0;
}
if (a >= 6 && a <= 12) {
cout << b / 2;
return 0;
}
cout << 0;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,590 | 847,591 | u010662838 | cpp |
p03035 | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll llinf = (1LL << 62);
const int inf = (1 << 30);
const ll nmax = 1e5 + 50;
const int mod = 1e9 + 7;
using namespace std;
int a, b;
int main() {
// freopen("sol.in","r",stdin);
// freopen("sol.out","w",stdout);
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ios_base::sync_with_stdio(false);
cin.tie(0);
cerr.tie(0);
cout.tie(0);
cin >> a >> b;
if (a >= 13)
rc(b);
if (a < 13 && a > 4)
rc(b / 2);
rc(0);
return 0;
} | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll llinf = (1LL << 62);
const int inf = (1 << 30);
const ll nmax = 1e5 + 50;
const int mod = 1e9 + 7;
using namespace std;
int a, b;
int main() {
// freopen("sol.in","r",stdin);
// freopen("sol.out","w",stdout);
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ios_base::sync_with_stdio(false);
cin.tie(0);
cerr.tie(0);
cout.tie(0);
cin >> a >> b;
if (a >= 13)
rc(b);
if (a < 13 && a > 5)
rc(b / 2);
rc(0);
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,594 | 847,595 | u130140706 | cpp |
p03035 | #include <iostream>
using namespace std;
int N, n;
int main() {
cin >> N >> n;
if (6 <= N && N <= 12) {
n / 2;
} else if (5 >= N) {
n = 0;
}
cout << n;
return 0;
} | #include <iostream>
using namespace std;
int N, n;
int main() {
cin >> N >> n;
if (6 <= N && N <= 12) {
n /= 2;
} else if (5 >= N) {
n = 0;
}
cout << n;
return 0;
} | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 847,596 | 847,597 | u258475646 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
int inputValue() {
int a;
cin >> a;
return a;
};
void inputArray(int *p, int a){rep(i, a){cin >> p[i];
}
}
;
void inputVector(vector<int> *p, int a) {
rep(i, a) {
int input;
cin >> input;
p->push_back(input);
}
}
template <typename T> void output(T a, int precision = 0) {
if (precision > 0) {
cout << setprecision(precision) << a << "\n";
} else {
cout << a << "\n";
}
}
int main(int argc, const char *argv[]) {
// source code
int a, b;
a = inputValue();
b = inputValue();
if (a > 12) {
output<int>(b);
} else if (a > 6 && a <= 12) {
output<int>(b / 2);
} else {
output<int>(0);
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
int inputValue() {
int a;
cin >> a;
return a;
};
void inputArray(int *p, int a){rep(i, a){cin >> p[i];
}
}
;
void inputVector(vector<int> *p, int a) {
rep(i, a) {
int input;
cin >> input;
p->push_back(input);
}
}
template <typename T> void output(T a, int precision = 0) {
if (precision > 0) {
cout << setprecision(precision) << a << "\n";
} else {
cout << a << "\n";
}
}
int main(int argc, const char *argv[]) {
// source code
int a, b;
a = inputValue();
b = inputValue();
if (a > 12) {
output<int>(b);
} else if (a >= 6 && a <= 12) {
output<int>(b / 2);
} else {
output<int>(0);
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,610 | 847,611 | u712259491 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (a < 5)
ans = 0;
else if (a < 13)
ans = b / 2;
else
ans = b;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (a < 6)
ans = 0;
else if (a < 13)
ans = b / 2;
else
ans = b;
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,618 | 847,619 | u565219356 | cpp |
p03035 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 1e5 + 17;
ll cnt, lnt, mn = N, mx, a[N], n, m, k, x, y, ans, sum;
pair<ll, ll> pr[N];
vector<ll> v, v2, v3;
map<ll, ll> mp;
bool used[N], t1, t2;
vector<string> sv;
vector<char> vi;
int main() {
cin >> n >> m;
if (n <= 5) {
cout << 0;
return 0;
}
if (n >= 6 and n <= 12) {
cout << n / 2;
return 0;
}
cout << n;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 1e5 + 17;
ll cnt, lnt, mn = N, mx, a[N], n, m, k, x, y, ans, sum;
pair<ll, ll> pr[N];
vector<ll> v, v2, v3;
map<ll, ll> mp;
bool used[N], t1, t2;
vector<string> sv;
vector<char> vi;
int main() {
cin >> n >> m;
if (n <= 5) {
cout << 0;
return 0;
}
if (n >= 6 and n <= 12) {
cout << m / 2;
return 0;
}
cout << m;
}
| [
"identifier.change",
"io.output.change"
] | 847,622 | 847,623 | u361768313 | cpp |
p03035 | /*------------------------- Bism Allah Alruhmin Alrahim
* -------------------------------*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < n; i++)
#define ford(i, n) for (int i = n - 1; i > -1; i--)
#define forl(i, l, r) for (int i = l; i <= r; i++)
#define vc vector
#define f first
#define s second
#define pb(i) push_back(i)
#define mx(ar, n) (*max_element(ar, ar + n))
#define mn(ar, n) (*min_element(ar, ar + n))
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const long double pi = acos(-1);
int main() {
int a, b;
cin >> a >> b;
if (a >= 12) {
cout << b << endl;
} else if (a <= 12 and a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| /*------------------------- Bism Allah Alruhmin Alrahim
* -------------------------------*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < n; i++)
#define ford(i, n) for (int i = n - 1; i > -1; i--)
#define forl(i, l, r) for (int i = l; i <= r; i++)
#define vc vector
#define f first
#define s second
#define pb(i) push_back(i)
#define mx(ar, n) (*max_element(ar, ar + n))
#define mn(ar, n) (*min_element(ar, ar + n))
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const long double pi = acos(-1);
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b << endl;
} else if (a <= 12 and a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,624 | 847,625 | u624417383 | cpp |
p03035 | /*------------------------- Bism Allah Alruhmin Alrahim
* -------------------------------*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < n; i++)
#define ford(i, n) for (int i = n - 1; i > -1; i--)
#define forl(i, l, r) for (int i = l; i <= r; i++)
#define vc vector
#define f first
#define s second
#define pb(i) push_back(i)
#define mx(ar, n) (*max_element(ar, ar + n))
#define mn(ar, n) (*min_element(ar, ar + n))
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const long double pi = acos(-1);
int main() {
int a, b;
cin >> a >> b;
if (a >= 12) {
cout << b << endl;
} else if (a <= 12 and a <= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| /*------------------------- Bism Allah Alruhmin Alrahim
* -------------------------------*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < n; i++)
#define ford(i, n) for (int i = n - 1; i > -1; i--)
#define forl(i, l, r) for (int i = l; i <= r; i++)
#define vc vector
#define f first
#define s second
#define pb(i) push_back(i)
#define mx(ar, n) (*max_element(ar, ar + n))
#define mn(ar, n) (*min_element(ar, ar + n))
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const long double pi = acos(-1);
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b << endl;
} else if (a <= 12 and a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 847,626 | 847,625 | u624417383 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a > 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,631 | 847,632 | u347579224 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a < 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | [] | 847,633 | 847,632 | u347579224 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A;
if (A >= 6 && A <= 13)
B /= 2;
if (A < 6)
B = 0;
cout << B << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 6 && A <= 12)
B /= 2;
if (A < 6)
B = 0;
cout << B << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,636 | 847,635 | u058186113 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a <= 5) {
printf("0\n");
} else if (a >= 6 && a <= 12) {
printf("%d\n", b * .5);
} else {
printf("%d\n", b);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a <= 5) {
printf("0\n");
} else if (a >= 6 && a <= 12) {
printf("%d\n", b / 2);
} else {
printf("%d\n", b);
}
return 0;
}
| [
"call.arguments.change"
] | 847,642 | 847,643 | u351012095 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B;
if (13 <= A)
C = B;
else if (6 <= A <= 12)
C = (B / 2);
else if (A <= 5)
C = 0;
cout << C << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B;
if (13 <= A)
C = B;
else if (6 <= A && A <= 12)
C = (B / 2);
else if (A <= 5)
C = 0;
cout << C << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 847,657 | 847,658 | u189449016 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B;
if (13 <= A)
C = B;
if (6 <= A <= 12)
C = (B / 2);
if (A <= 5)
C = 0;
cout << C << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B;
if (13 <= A)
C = B;
else if (6 <= A && A <= 12)
C = (B / 2);
else if (A <= 5)
C = 0;
cout << C << endl;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.if.condition.change"
] | 847,659 | 847,658 | u189449016 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5)
cout << 0;
else if (a >= 13)
cout << b / 2;
else
cout << b;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5)
cout << 0;
else if (a >= 13)
cout << b;
else
cout << b / 2;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 847,661 | 847,662 | u034022876 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if ((6 <= A) || (A <= 12)) {
cout << B / 2 << endl;
} else if (A <= 5) {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if ((6 <= A) && (A <= 12)) {
cout << B / 2 << endl;
} else if (A <= 5) {
cout << 0 << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 847,663 | 847,664 | u797900551 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (6 <= A <= 12) {
cout << B / 2 << endl;
} else if (A <= 5) {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if ((6 <= A) && (A <= 12)) {
cout << B / 2 << endl;
} else if (A <= 5) {
cout << 0 << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 847,665 | 847,664 | u797900551 | cpp |
p03035 | #include <iostream>
using namespace std;
int solver(int hisold, int adultP) {
int result;
result = 0;
if (13 <= hisold) {
result = adultP;
} else {
if (5 <= hisold and hisold <= 12) {
result = adultP / 2;
}
}
return result;
}
int main(void) {
int answer = 0;
int A, B;
cin >> A >> B;
answer = solver(A, B);
cout << answer << endl;
} | #include <iostream>
using namespace std;
int solver(int hisold, int adultP) {
int result;
result = 0;
if (13 <= hisold) {
result = adultP;
} else {
if (6 <= hisold and hisold <= 12) {
result = adultP / 2;
}
}
return result;
}
int main(void) {
int answer = 0;
int A, B;
cin >> A >> B;
answer = solver(A, B);
cout << answer << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,696 | 847,697 | u197300260 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (13 <= A) {
cout << B << endl;
}
else if (6 <= A <= 12) {
cout << B / 2 << endl;
} else if (A <= 5) {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (13 <= A) {
cout << B << endl;
}
else if (6 <= A && A <= 12) {
cout << B / 2 << endl;
} else if (A <= 5) {
cout << 0 << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 847,705 | 847,706 | u438035643 | cpp |
p03035 | #include <algorithm> //sort()
#include <iostream>
#include <stdlib.h>
#include <vector> //vector
using namespace std;
template <class T> inline bool chmin(T &a, T b);
template <class T> inline bool chmax(T &a, T b);
long a, b, c, d, i, j, k, n;
int main() {
//////////////////////////////////////////////////////
// string s;
cin >> a >> b;
// s[2] += 'a' - 'A';
if (a <= 12)
b /= 2;
if (b <= 5)
b = 0;
cout << b << endl;
// cout << "n:" << n << endl;
// vector<long> input(n+1);
// for (int i = 1 ; i <= n ; i ++ )
// {
// cin >> input[i];
// cout << "input[" << i << "]=" << input[i] << endl;
// }
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// DP
// // 無限大の値
// const uint64_t INF = (uint64_t)1 << 60;
// //const int64_t NINF = -1 * ((int64_t)1 << 60 );
// // DP テーブル
// uint64_t dp[100010];
// //DPテーブル初期化（最小化用）
// for (int i = 0; i < 100010; ++i)
// {
// //dp[i] = INF;
// dp[i] = 0;
// }
// // 初期条件
// dp[0] = 0;
// // ループ
// for (int i = 1; i <= n; ++i) {
// //chmin( dp[i], dp[i - 1] + abs( input[i] - input[i - 1] ));
// //if (i < 2)continue;
// //chmin( dp[i], dp[i - 2] + abs( input[i] - input[i - 2] ));
// // chmax ( dp [i] , dp[i - 1]);
// // chmax ( dp [i] , dp[i - 1] + input[i]);
// // cout << "dp[" << i <<"] = " << dp[i] << endl;
// }
// //////////////////////////////////////////////////////
// cout << dp[n] << endl;
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
//最小化用関数
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
//最大化関数
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
} | #include <algorithm> //sort()
#include <iostream>
#include <stdlib.h>
#include <vector> //vector
using namespace std;
template <class T> inline bool chmin(T &a, T b);
template <class T> inline bool chmax(T &a, T b);
long a, b, c, d, i, j, k, n;
int main() {
//////////////////////////////////////////////////////
// string s;
cin >> a >> b;
// s[2] += 'a' - 'A';
if (a <= 12)
b /= 2;
if (a <= 5)
b = 0;
cout << b << endl;
// cout << "n:" << n << endl;
// vector<long> input(n+1);
// for (int i = 1 ; i <= n ; i ++ )
// {
// cin >> input[i];
// cout << "input[" << i << "]=" << input[i] << endl;
// }
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// DP
// // 無限大の値
// const uint64_t INF = (uint64_t)1 << 60;
// //const int64_t NINF = -1 * ((int64_t)1 << 60 );
// // DP テーブル
// uint64_t dp[100010];
// //DPテーブル初期化（最小化用）
// for (int i = 0; i < 100010; ++i)
// {
// //dp[i] = INF;
// dp[i] = 0;
// }
// // 初期条件
// dp[0] = 0;
// // ループ
// for (int i = 1; i <= n; ++i) {
// //chmin( dp[i], dp[i - 1] + abs( input[i] - input[i - 1] ));
// //if (i < 2)continue;
// //chmin( dp[i], dp[i - 2] + abs( input[i] - input[i - 2] ));
// // chmax ( dp [i] , dp[i - 1]);
// // chmax ( dp [i] , dp[i - 1] + input[i]);
// // cout << "dp[" << i <<"] = " << dp[i] << endl;
// }
// //////////////////////////////////////////////////////
// cout << dp[n] << endl;
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
//最小化用関数
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
//最大化関数
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 847,709 | 847,710 | u561976793 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
int c;
cin >> a >> b;
c = b / 2;
if (a >= 13)
cout << b;
if (6 <= a && a < 13)
cout << c;
else
cout << 0;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
int c;
cin >> a >> b;
c = b / 2;
if (a >= 13)
cout << b;
if (6 <= a && a < 13)
cout << c;
if (a < 6)
cout << 0;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 847,711 | 847,712 | u057617112 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,725 | 847,726 | u418568023 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6 && a <= 12)
cout << a / 2 << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6 && a <= 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 847,756 | 847,757 | u841595152 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
if (13 <= A) {
cout << B;
} else if (A << 5) {
cout << 0;
} else {
cout << B / 2;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
if (13 <= A) {
cout << B;
} else if (A <= 5) {
cout << 0;
} else {
cout << B / 2;
}
} | [
"control_flow.branch.if.condition.change"
] | 847,798 | 847,799 | u206028750 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 13)
b /= 2;
if (a < 7)
b = 0;
cout << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 13)
b /= 2;
if (a < 6)
b = 0;
cout << b << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,815 | 847,816 | u658655325 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
cout << 0 << endl;
} else if (A >= 6 || A <= 12) {
cout << B / 2 << endl;
} else if (A >= 13) {
cout << B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
cout << 0 << endl;
} else if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
} else if (A >= 13) {
cout << B << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 847,847 | 847,848 | u274435144 | cpp |
p03035 | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
// cout << A << "," << B << endl;
if (A >= 13)
cout << B << endl;
else if (B <= 5)
cout << "0" << endl;
else
cout << B / 2 << endl;
}
| #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
// cout << A << "," << B << endl;
if (A >= 13)
cout << B << endl;
else if (A <= 5)
cout << "0" << endl;
else
cout << B / 2 << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 847,867 | 847,868 | u545672143 | cpp |
p03035 | //#include <StdAfx.h>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (N)
printf("%d\n", M);
else if (N > 5 && N < 13)
printf("%d\n", M / 2);
else
printf("0\n");
return 0;
} | //#include <StdAfx.h>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (N > 12)
printf("%d\n", M);
else if (N > 5 && N < 13)
printf("%d\n", M / 2);
else
printf("0\n");
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 847,888 | 847,889 | u718058663 | cpp |
p03035 | //#include <StdAfx.h>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (N)
printf("%d\n", N);
else if (N > 5 && N < 13)
printf("%d\n", N / 2);
else
printf("0\n");
return 0;
} | //#include <StdAfx.h>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (N > 12)
printf("%d\n", M);
else if (N > 5 && N < 13)
printf("%d\n", M / 2);
else
printf("0\n");
return 0;
} | [
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.change"
] | 847,890 | 847,889 | u718058663 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
B = (A < 13) ? B / 2 : B;
B = (A < 5) ? 0 : B;
cout << B << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
B = (A < 13) ? B / 2 : B;
B = (A < 6) ? 0 : B;
cout << B << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 847,914 | 847,915 | u694711153 | cpp |
p03035 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
}
if (6 < A <= 12) {
cout << B / 2 << endl;
}
if (A >= 5) {
cout << "0" << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
}
if (6 <= A && A <= 12) {
cout << B / 2 << endl;
}
if (A <= 5) {
cout << "0" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 847,924 | 847,925 | u499188455 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
b = 0;
cout << b << endl;
} else if (a >= 6 || a <= 12) {
b = b / 2;
cout << b << endl;
} else {
cout << b;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
b = 0;
cout << b << endl;
} else if (a >= 6 && a <= 12) {
b = b / 2;
cout << b << endl;
} else {
cout << b;
}
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 847,926 | 847,927 | u293511800 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
b = 0;
cout << b << endl;
} else if (a >= 6 || a <= 12) {
b = b / 2;
cout << b << endl;
} else {
cout << b;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
b = 0;
cout << b << endl;
} else if (a >= 6 && a <= 12) {
b = b / 2;
cout << b << endl;
} else {
cout << b;
}
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 847,928 | 847,927 | u293511800 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
cout << 0 << endl;
}
cout << (A >= 13 ? B : (B / 2)) << endl;
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
cout << 0 << endl;
} else {
cout << (A >= 13 ? B : (B / 2)) << endl;
}
} | [
"control_flow.branch.else.add"
] | 847,936 | 847,937 | u272169387 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vi64 = vector<int64_t>;
using vvi64 = vector<vi64>;
#define rep(i, n) for (int64_t i = 0; i < (n); ++i)
#define repe(i, n) for (int64_t i = 0; i <= (n); ++i)
#define reps(i, s, n) for (int64_t i = (s); i < (n); ++i)
#define repse(i, s, n) for (int64_t i = (s); i <= (n); ++i)
#define repr(i, n) for (int64_t i = (n); i >= 0; --i)
#define all(xs) (xs).begin(), (xs).end()
#define pp_vec(xs) \
rep(i, (xs).size()) if { \
(i) cout << endl; \
cout << (xs)[i] << " "; \
};
const int64_t inf = (int64_t)1e18;
const int64_t mod = (int64_t)1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if (A >= 13)
printf("%d\n", B);
else if (A >= 6)
printf("%d\n", B / 2);
else
printf("%d\n", B / 4);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vi64 = vector<int64_t>;
using vvi64 = vector<vi64>;
#define rep(i, n) for (int64_t i = 0; i < (n); ++i)
#define repe(i, n) for (int64_t i = 0; i <= (n); ++i)
#define reps(i, s, n) for (int64_t i = (s); i < (n); ++i)
#define repse(i, s, n) for (int64_t i = (s); i <= (n); ++i)
#define repr(i, n) for (int64_t i = (n); i >= 0; --i)
#define all(xs) (xs).begin(), (xs).end()
#define pp_vec(xs) \
rep(i, (xs).size()) if { \
(i) cout << endl; \
cout << (xs)[i] << " "; \
};
const int64_t inf = (int64_t)1e18;
const int64_t mod = (int64_t)1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if (A >= 13)
printf("%d\n", B);
else if (A >= 6)
printf("%d\n", B / 2);
else
printf("0\n");
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 847,946 | 847,947 | u300096598 | cpp |
p03035 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (6 <= a <= 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (6 <= a && a <= 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 847,950 | 847,951 | u959815036 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, N;
cin >> b >> N;
if (a > 12)
a = b;
else if (a < 6)
a = 0;
else
a = b / 2;
// vector<int> S(N);
// for(int i=0;i<N;i++){
//}
// if(){
//}
// else if(){
//}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, N;
cin >> a >> b;
if (a > 12)
a = b;
else if (a < 6)
a = 0;
else
a = b / 2;
// vector<int> S(N);
// for(int i=0;i<N;i++){
//}
// if(){
//}
// else if(){
//}
cout << a << endl;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 847,960 | 847,961 | u618604643 | cpp |
p03035 | #include <bits/stdc++.h>
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
FastIO;
int n, c;
cin >> n >> c;
if (n < 12)
cout << c;
else if (n >= 6 && n <= 12)
cout << c / 2;
else
cout << 0;
} | #include <bits/stdc++.h>
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
FastIO;
int n, c;
cin >> n >> c;
if (n > 12)
cout << c;
else if (n >= 6 && n <= 12)
cout << c / 2;
else
cout << 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,962 | 847,963 | u689000653 | cpp |
p03035 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, j) for (int i = j - 1; i >= 0; i--)
#define MAX 1000000007
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a <= 5) {
cout << 0;
} else if (b >= 13) {
cout << b;
} else
cout << b / 2;
} | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, j) for (int i = j - 1; i >= 0; i--)
#define MAX 1000000007
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a <= 5) {
cout << 0;
} else if (a >= 13) {
cout << b;
} else
cout << b / 2;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 847,973 | 847,974 | u950603962 | cpp |
p03035 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0 << endl;
} else if (a <= 12) {
cout << a / 2 << endl;
} else {
cout << a << endl;
}
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0 << endl;
} else if (a <= 12) {
cout << b / 2 << endl;
} else {
cout << b << endl;
}
} | [
"identifier.change",
"io.output.change"
] | 847,975 | 847,976 | u654240084 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
ll a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 && a <= 12) {
cout << b << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
ll a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 && a <= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
} | [
"expression.operation.binary.add"
] | 847,981 | 847,982 | u955243910 | cpp |
p03035 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (5 <= a && a <= 12) {
cout << b / 2 << endl;
} else if (a >= 13) {
cout << b << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (6 <= a && a <= 12) {
cout << b / 2 << endl;
} else if (a >= 13) {
cout << b << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,985 | 847,986 | u835687287 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long long lint;
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < 13)
B /= 2;
cout << (A >= 5 ? B : 0) << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long long lint;
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < 13)
B /= 2;
cout << (A > 5 ? B : 0) << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 847,995 | 847,996 | u484460274 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int a, b;
cin >> a >> b;
int r = 0;
if (a >= 13)
r = b;
else if (a >= 8)
r = b / 2;
cout << r << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int a, b;
cin >> a >> b;
int r = 0;
if (a >= 13)
r = b;
else if (a >= 6)
r = b / 2;
cout << r << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,001 | 848,002 | u769062455 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << '\n';
} else if (a >= 5) {
cout << b / 2 << '\n';
} else {
cout << 0 << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << '\n';
} else if (a > 5) {
cout << b / 2 << '\n';
} else {
cout << 0 << '\n';
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,003 | 848,004 | u365058393 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
if (a >= 6 && a <= 12)
cout << b / 2 << endl;
if (a == 0)
cout << 0 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
if (a >= 6 && a <= 12)
cout << b / 2 << endl;
if (a <= 5)
cout << 0 << endl;
return 0;
}
| [] | 848,005 | 848,006 | u661448227 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (1 >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
}
// EOF
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
}
// EOF
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 848,011 | 848,012 | u543657872 | cpp |
p03035 | // #include <bits/stdc++.h>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
#define BEGIN \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define END return EXIT_SUCCESS
#define rep(I, N) for (auto I = 0; I < (N); ++I)
#define up(I, A, B) for (auto I = (A); I <= (B); ++I)
#define dw(I, A, B) for (auto I = (A); I >= (B); --I)
#define all(C) (C).begin(), (C).end()
#define rall(C) (C).rbegin(), (C).rend()
#define ft first
#define sd second
#define mp make_pair
#define mt make_tuple
#define pf push_front
#define pb push_back
#define pt pop_front
#define pk pop_back
#define lb lower_bound
#define ub upper_bound
#define rs resize
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline void in(T &p) { cin >> p; }
template <class T1, class T2> inline void in(T1 &p1, T2 &p2) {
cin >> p1 >> p2;
}
template <class T1, class T2, class T3> inline void in(T1 &p1, T2 &p2, T3 &p3) {
cin >> p1 >> p2 >> p3;
}
template <class T1, class T2, class T3, class T4>
inline void in(T1 &p1, T2 &p2, T3 &p3, T4 &p4) {
cin >> p1 >> p2 >> p3 >> p4;
}
template <class T1, class T2, class T3, class T4, class T5>
inline void in(T1 &p1, T2 &p2, T3 &p3, T4 &p4, T5 &p5) {
cin >> p1 >> p2 >> p3 >> p4 >> p5;
}
template <class T> inline void out(T p) { cout << p << endl; }
template <class T1, class T2> inline void out(T1 p1, T2 p2) {
cout << p1 << " " << p2 << endl;
}
template <class T1, class T2, class T3> inline void out(T1 p1, T2 p2, T3 p3) {
cout << p1 << " " << p2 << " " << p3 << endl;
}
template <class T1, class T2, class T3, class T4>
inline void out(T1 p1, T2 p2, T3 p3, T4 p4) {
cout << p1 << " " << p2 << " " << p3 << " " << p4 << endl;
}
long A, B;
inline void solve(void) {
in(A, B);
if (A <= 5)
out(9);
else if (A >= 13)
out(B);
else
out(B / 2);
}
int main(int argc, char **argv) {
BEGIN;
solve();
END;
}
| // #include <bits/stdc++.h>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
#define BEGIN \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define END return EXIT_SUCCESS
#define rep(I, N) for (auto I = 0; I < (N); ++I)
#define up(I, A, B) for (auto I = (A); I <= (B); ++I)
#define dw(I, A, B) for (auto I = (A); I >= (B); --I)
#define all(C) (C).begin(), (C).end()
#define rall(C) (C).rbegin(), (C).rend()
#define ft first
#define sd second
#define mp make_pair
#define mt make_tuple
#define pf push_front
#define pb push_back
#define pt pop_front
#define pk pop_back
#define lb lower_bound
#define ub upper_bound
#define rs resize
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline void in(T &p) { cin >> p; }
template <class T1, class T2> inline void in(T1 &p1, T2 &p2) {
cin >> p1 >> p2;
}
template <class T1, class T2, class T3> inline void in(T1 &p1, T2 &p2, T3 &p3) {
cin >> p1 >> p2 >> p3;
}
template <class T1, class T2, class T3, class T4>
inline void in(T1 &p1, T2 &p2, T3 &p3, T4 &p4) {
cin >> p1 >> p2 >> p3 >> p4;
}
template <class T1, class T2, class T3, class T4, class T5>
inline void in(T1 &p1, T2 &p2, T3 &p3, T4 &p4, T5 &p5) {
cin >> p1 >> p2 >> p3 >> p4 >> p5;
}
template <class T> inline void out(T p) { cout << p << endl; }
template <class T1, class T2> inline void out(T1 p1, T2 p2) {
cout << p1 << " " << p2 << endl;
}
template <class T1, class T2, class T3> inline void out(T1 p1, T2 p2, T3 p3) {
cout << p1 << " " << p2 << " " << p3 << endl;
}
template <class T1, class T2, class T3, class T4>
inline void out(T1 p1, T2 p2, T3 p3, T4 p4) {
cout << p1 << " " << p2 << " " << p3 << " " << p4 << endl;
}
long A, B;
inline void solve(void) {
in(A, B);
if (A <= 5)
out(0);
else if (A >= 13)
out(B);
else
out(B / 2);
}
int main(int argc, char **argv) {
BEGIN;
solve();
END;
}
| [
"literal.number.change",
"call.arguments.change"
] | 848,015 | 848,016 | u743561048 | cpp |
p03035 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int A, B, res;
cin >> A >> B;
if (A > 13) {
cout << B << endl;
} else if (A > 6) {
cout << B / 2 << endl;
} else {
cout << "0" << endl;
}
} | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int A, B, res;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (A >= 6) {
cout << B / 2 << endl;
} else {
cout << "0" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,017 | 848,018 | u294738119 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a <= 5)
cout << 0;
else
cout << a / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a <= 5)
cout << 0;
else
cout << b / 2;
} | [
"identifier.change",
"io.output.change"
] | 848,022 | 848,023 | u224168474 | cpp |
p03035 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5)
cout << 0 << endl;
if (a >= 6 && a <= 12)
cout << b / 2 << endl;
else
cout << b << endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5)
cout << 0 << endl;
else if (a >= 6 && a <= 12)
cout << b / 2 << endl;
else
cout << b << endl;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 848,048 | 848,049 | u389766217 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (B >= 13)
cout << A << endl;
else if (B >= 6)
cout << A / 2 << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B << endl;
else if (A >= 6)
cout << B / 2 << endl;
else
cout << 0 << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 848,050 | 848,051 | u898331860 | cpp |
p03035 | #include <bits/stdc++.h>
#define ll long long int
#define fin(x) scanf("%lld", &x)
#define fout(x) printf("%lld\n", x)
#define pll pair<ll, ll>
#define mp(x, y) make_pair(x, y)
#define cases \
int t; \
scanf("%d", &t); \
while (t--)
#define MOD 1000000007
#define MAXN 123456
#define read() freopen("lele.txt", "r", stdin)
#define write() freopen("dede.txt", "w", stdout)
using namespace std;
int main() {
ll a, b;
fin(a);
fin(b);
if (a >= 13) {
fout(b);
exit(0);
}
if (b >= 6 && b <= 12) {
fout(b / 2);
exit(0);
}
if (b <= 5) {
fout(0LL);
exit(0);
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define fin(x) scanf("%lld", &x)
#define fout(x) printf("%lld\n", x)
#define pll pair<ll, ll>
#define mp(x, y) make_pair(x, y)
#define cases \
int t; \
scanf("%d", &t); \
while (t--)
#define MOD 1000000007
#define MAXN 123456
#define read() freopen("lele.txt", "r", stdin)
#define write() freopen("dede.txt", "w", stdout)
using namespace std;
int main() {
ll a, b;
fin(a);
fin(b);
if (a >= 13) {
fout(b);
exit(0);
}
if (a >= 6 && a <= 12) {
fout(b / 2);
exit(0);
}
if (a <= 5) {
fout(0LL);
exit(0);
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 848,052 | 848,053 | u282671491 | cpp |
p03035 | #include <algorithm>
#include <climits>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = 1 << 29;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a <= 12 || a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <climits>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = 1 << 29;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a <= 12 && a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 848,082 | 848,083 | u019356802 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int mod = 1e9 + 7;
const ll INF = 1e18;
const int inf = 1e9;
void solve() {
int a, b;
cin >> a >> b;
if (a <= 6) {
cout << 0 << endl;
} else if (a >= 13) {
cout << b << endl;
} else {
cout << b / 2 << endl;
}
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int mod = 1e9 + 7;
const ll INF = 1e18;
const int inf = 1e9;
void solve() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0 << endl;
} else if (a >= 13) {
cout << b << endl;
} else {
cout << b / 2 << endl;
}
}
int main() {
solve();
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,094 | 848,095 | u305824645 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
cout << 0;
} else if (a < 12) {
cout << b / 2;
} else {
cout << b;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
cout << 0;
} else if (a < 13) {
cout << b / 2;
} else {
cout << b;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,100 | 848,101 | u906095123 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (b >= 6 and b <= 12)
cout << b / 2;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a >= 6 and a <= 12)
cout << b / 2;
else
cout << 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 848,106 | 848,107 | u221372861 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (b >= 5 and b <= 12)
cout << b / 2;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a >= 6 and a <= 12)
cout << b / 2;
else
cout << 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 848,108 | 848,107 | u221372861 | cpp |
p03035 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
if (a <= 5)
ans = 0;
else if (a <= 12)
ans = 50;
else
ans = 100;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
if (a <= 5)
ans = 0;
else if (a <= 12)
ans = b / 2;
else
ans = b;
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"assignment.change"
] | 848,113 | 848,114 | u620735210 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
#define all(a) a.begin(), a.end()
#define ll long long int
#define ld long double
ll power(ll a, ll b, ll m) {
if (b == 0)
return 1;
if (b == 1)
return a % m;
ll t = power(a, b / 2, m) % m;
t = (t * t) % m;
if (b & 1)
t = ((t % m) * (a % m)) % m;
return t;
}
ll modInverse(ll a, ll m) { return power(a, m - 2, m); }
#define ps push_back
#define fs first
#define sc second
#define N 3000005
#define endl "\n"
#define mod 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b;
cin >> a;
if (a >= 13) {
cout << b;
} else if (a >= 6) {
cout << (b / 2);
} else
cout << "0";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
#define all(a) a.begin(), a.end()
#define ll long long int
#define ld long double
ll power(ll a, ll b, ll m) {
if (b == 0)
return 1;
if (b == 1)
return a % m;
ll t = power(a, b / 2, m) % m;
t = (t * t) % m;
if (b & 1)
t = ((t % m) * (a % m)) % m;
return t;
}
ll modInverse(ll a, ll m) { return power(a, m - 2, m); }
#define ps push_back
#define fs first
#define sc second
#define N 3000005
#define endl "\n"
#define mod 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b;
cin >> a >> b;
if (a >= 13) {
cout << b;
} else if (a >= 6) {
cout << (b / 2);
} else
cout << "0";
return 0;
}
| [
"expression.operation.binary.add"
] | 848,115 | 848,116 | u838261804 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << endl;
else if (a >= 6 && a <= b)
cout << b / 2 << endl;
else
cout << b << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << endl;
else if (a >= 6 && a <= 12)
cout << b / 2 << endl;
else
cout << b << endl;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 848,118 | 848,119 | u967756909 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
while (y > 0) {
int r = x % y;
x = y;
y = r;
}
return x;
}
/*迷路
const int INF = 50;
typedef pair<int,int> P;
char field[52][52];
int d[51][51];
int r,c;
int sx,sy;
int gx,gy;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int bfs(){
queue<P> que;
for(int i=0;i<r;i++){
for(int j=0;j<c;j++){
d[i+1][j+1] = INF;
}
}
que.push(P(sy,sx));
d[sy][sx]=0;
while(que.size()){
P p=que.front();
que.pop();
if(p.second==gx&&p.first==gy) break;
for(int i=0;i<4;i++){
int nx=p.second+dx[i];
int ny=p.first+dy[i];
if(1<=nx&&nx<=c&&1<=ny&&ny<=r&&field[ny][nx]!='#'&&d[ny][nx]==INF){
que.push(P(ny,nx));
d[ny][nx] = d[p.first][p.second] + 1;
}
}
}
return d[gy][gx];
}
*/
int main() {
int a, b;
cin >> a >> b;
if (5 < a && a < 13)
cout << b / 2 << endl;
else if (a < 5)
cout << 0 << endl;
else
cout << b << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
while (y > 0) {
int r = x % y;
x = y;
y = r;
}
return x;
}
/*迷路
const int INF = 50;
typedef pair<int,int> P;
char field[52][52];
int d[51][51];
int r,c;
int sx,sy;
int gx,gy;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int bfs(){
queue<P> que;
for(int i=0;i<r;i++){
for(int j=0;j<c;j++){
d[i+1][j+1] = INF;
}
}
que.push(P(sy,sx));
d[sy][sx]=0;
while(que.size()){
P p=que.front();
que.pop();
if(p.second==gx&&p.first==gy) break;
for(int i=0;i<4;i++){
int nx=p.second+dx[i];
int ny=p.first+dy[i];
if(1<=nx&&nx<=c&&1<=ny&&ny<=r&&field[ny][nx]!='#'&&d[ny][nx]==INF){
que.push(P(ny,nx));
d[ny][nx] = d[p.first][p.second] + 1;
}
}
}
return d[gy][gx];
}
*/
int main() {
int a, b;
cin >> a >> b;
if (5 < a && a < 13)
cout << b / 2 << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << b << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,120 | 848,121 | u622585907 | cpp |
p03035 | #include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int A, B; // A years old. B yen.
cin >> A >> B;
if (A >= 13) {
cout << B;
} else if (A < 5) {
cout << 0;
} else {
cout << B / 2;
}
return 0;
} | #include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int A, B; // A years old. B yen.
cin >> A >> B;
if (A >= 13) {
cout << B;
} else if (A <= 5) {
cout << 0;
} else {
cout << B / 2;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,130 | 848,131 | u441118578 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
if (b % a == 0) {
return a;
}
return gcd(b % a, a);
}
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A < 6) {
cout << 0 << endl;
return 0;
} else if (A < 13) {
cout << B / 2 << endl;
return 0;
} else {
cout << B << endl;
return 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
if (b % a == 0) {
return a;
}
return gcd(b % a, a);
}
int main() {
int A, B;
cin >> A >> B;
if (A < 6) {
cout << 0 << endl;
return 0;
} else if (A < 13) {
cout << B / 2 << endl;
return 0;
} else {
cout << B << endl;
return 0;
}
return 0;
} | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 848,132 | 848,133 | u912534104 | cpp |
p03035 | #include <bits/stdc++.h>
#define ll long long
#define db long double
#define fi first
#define se second
#define pb push_back
#define pob pop_back
#define W while
#define fn(i, x) for (int i = 0; i < x; i++)
#define fs(i, s, x) for (int i = s; i < x; i++)
#define fr(i, x) for (int i = x; i >= 0; i--)
#define fit(it, s) for (auto it = s.begin(); it != s.end(); it++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define mod 1000000007
#define MAX 1005
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
ll a, b;
cin >> a >> b;
if (a >= 13)
cout << a;
else if (a >= 6 and a <= 12)
cout << a / 2;
else
cout << "0";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define db long double
#define fi first
#define se second
#define pb push_back
#define pob pop_back
#define W while
#define fn(i, x) for (int i = 0; i < x; i++)
#define fs(i, s, x) for (int i = s; i < x; i++)
#define fr(i, x) for (int i = x; i >= 0; i--)
#define fit(it, s) for (auto it = s.begin(); it != s.end(); it++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define mod 1000000007
#define MAX 1005
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
ll a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a >= 6 and a <= 12)
cout << b / 2;
else
cout << "0";
return 0;
} | [
"identifier.change",
"io.output.change"
] | 848,148 | 848,149 | u072296885 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b;
}
if (a <= 12) {
b = b / 2;
cout << b;
} else if (a <= 5) {
cout << 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b;
}
if (a <= 12 && a > 5) {
b = b / 2;
cout << b;
} else if (a <= 5) {
cout << 0;
}
} | [
"control_flow.branch.if.condition.change"
] | 848,158 | 848,159 | u453725440 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a < 5)
cout << 0;
else
cout << b / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a <= 5)
cout << 0;
else
cout << b / 2;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,166 | 848,167 | u515315348 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define faster ios::sync_with_stdio(false)
#define ll long long int
#define sz 200005
#define mp(x, y) make_pair(x, y)
#define pii pair<long long int, long long int>
#define tor ::iterator
#define letsgo \
long long int i, j, k, q = 0, t, tmp, n, flg = 0, cntr = 0, maxxer = 0
#define fi first
#define se second
#define be begin()
#define en end()
#define mod 1000000007
#define debug(x) cout << " " << x << endl
ll dp[105][100005];
ll knapsack(ll i, ll w, ll wt[], ll v[], ll n) {
// cout<<i<<" "<<w<<" "<<endl;
if (i == n)
return 0;
if (dp[i][w] != -1)
return dp[i][w];
if (wt[i] <= w) {
dp[i][w] = max(knapsack(i + 1, w, wt, v, n),
knapsack(i + 1, w - wt[i], wt, v, n) + v[i]);
} else
dp[i][w] = knapsack(i + 1, w, wt, v, n);
return dp[i][w];
}
int main() {
faster;
letsgo;
ll w;
cin >> n >> k;
if (k >= 13)
cout << k;
else if (k < 13 && k >= 6)
cout << k / 2;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define faster ios::sync_with_stdio(false)
#define ll long long int
#define sz 200005
#define mp(x, y) make_pair(x, y)
#define pii pair<long long int, long long int>
#define tor ::iterator
#define letsgo \
long long int i, j, k, q = 0, t, tmp, n, flg = 0, cntr = 0, maxxer = 0
#define fi first
#define se second
#define be begin()
#define en end()
#define mod 1000000007
#define debug(x) cout << " " << x << endl
ll dp[105][100005];
ll knapsack(ll i, ll w, ll wt[], ll v[], ll n) {
// cout<<i<<" "<<w<<" "<<endl;
if (i == n)
return 0;
if (dp[i][w] != -1)
return dp[i][w];
if (wt[i] <= w) {
dp[i][w] = max(knapsack(i + 1, w, wt, v, n),
knapsack(i + 1, w - wt[i], wt, v, n) + v[i]);
} else
dp[i][w] = knapsack(i + 1, w, wt, v, n);
return dp[i][w];
}
int main() {
faster;
letsgo;
ll w;
cin >> n >> k;
if (n >= 13)
cout << k;
else if (n < 13 && n >= 6)
cout << k / 2;
else
cout << 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 848,173 | 848,174 | u116062521 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define faster ios::sync_with_stdio(false)
#define ll long long int
#define sz 200005
#define mp(x, y) make_pair(x, y)
#define pii pair<long long int, long long int>
#define tor ::iterator
#define letsgo \
long long int i, j, k, q = 0, t, tmp, n, flg = 0, cntr = 0, maxxer = 0
#define fi first
#define se second
#define be begin()
#define en end()
#define mod 1000000007
#define debug(x) cout << " " << x << endl
ll dp[105][100005];
ll knapsack(ll i, ll w, ll wt[], ll v[], ll n) {
// cout<<i<<" "<<w<<" "<<endl;
if (i == n)
return 0;
if (dp[i][w] != -1)
return dp[i][w];
if (wt[i] <= w) {
dp[i][w] = max(knapsack(i + 1, w, wt, v, n),
knapsack(i + 1, w - wt[i], wt, v, n) + v[i]);
} else
dp[i][w] = knapsack(i + 1, w, wt, v, n);
return dp[i][w];
}
int main() {
faster;
letsgo;
ll w;
cin >> n >> k;
if (k > 13)
cout << k;
else if (k < 13 && k >= 6)
cout << k / 2;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define faster ios::sync_with_stdio(false)
#define ll long long int
#define sz 200005
#define mp(x, y) make_pair(x, y)
#define pii pair<long long int, long long int>
#define tor ::iterator
#define letsgo \
long long int i, j, k, q = 0, t, tmp, n, flg = 0, cntr = 0, maxxer = 0
#define fi first
#define se second
#define be begin()
#define en end()
#define mod 1000000007
#define debug(x) cout << " " << x << endl
ll dp[105][100005];
ll knapsack(ll i, ll w, ll wt[], ll v[], ll n) {
// cout<<i<<" "<<w<<" "<<endl;
if (i == n)
return 0;
if (dp[i][w] != -1)
return dp[i][w];
if (wt[i] <= w) {
dp[i][w] = max(knapsack(i + 1, w, wt, v, n),
knapsack(i + 1, w - wt[i], wt, v, n) + v[i]);
} else
dp[i][w] = knapsack(i + 1, w, wt, v, n);
return dp[i][w];
}
int main() {
faster;
letsgo;
ll w;
cin >> n >> k;
if (n >= 13)
cout << k;
else if (n < 13 && n >= 6)
cout << k / 2;
else
cout << 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 848,175 | 848,174 | u116062521 | cpp |
p03035 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B << endl;
else if (A >= 6 || A <= 12)
cout << B / 2 << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B << endl;
else if (A >= 6 && A <= 12)
cout << B / 2 << endl;
else
cout << 0 << endl;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 848,180 | 848,181 | u276682785 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 30) {
cout << b << endl;
} else if (a >= 6 && a <= 12) {
cout << b / 2 << endl;
} else if (a <= 5) {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0 << endl;
} else if (a >= 6 && a <= 12) {
cout << b / 2 << endl;
} else if (a >= 13) {
cout << b << endl;
}
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 848,187 | 848,188 | u679245300 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a >= 13)
ans = b;
else if (a <= 6 && a >= 12)
ans = b / 2;
else
ans = 0;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a >= 13)
ans = b;
else if (a >= 6 && a <= 12)
ans = b / 2;
else
ans = 0;
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,191 | 848,192 | u881647420 | cpp |
p03035 | #include <bits/stdc++.h> // ios_base::sync_with_stdio(false);
#define MAXN 500005 // cin.tie(NULL);
#define di pair<int, int>
#define tri pair<int, di>
#define bi pair<bool, int>
using namespace std;
void swap(int ar[], int i, int j) {
int aux = ar[j];
ar[j] = ar[i];
ar[i] = ar[j];
}
int main() {
int A, B;
cin >> A >> B;
if (A >= 6 && A <= 12)
cout << B / 2;
else if (B <= 5)
cout << 0;
else
cout << B;
}
| #include <bits/stdc++.h> // ios_base::sync_with_stdio(false);
#define MAXN 500005 // cin.tie(NULL);
#define di pair<int, int>
#define tri pair<int, di>
#define bi pair<bool, int>
using namespace std;
void swap(int ar[], int i, int j) {
int aux = ar[j];
ar[j] = ar[i];
ar[i] = ar[j];
}
int main() {
int A, B;
cin >> A >> B;
if (A >= 6 && A <= 12)
cout << B / 2;
else if (A <= 5)
cout << 0;
else
cout << B;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 848,195 | 848,196 | u367086854 | cpp |
p03035 | #include <bits/stdc++.h> // ios_base::sync_with_stdio(false);
#define MAXN 500005 // cin.tie(NULL);
#define di pair<int, int>
#define tri pair<int, di>
#define bi pair<bool, int>
using namespace std;
void swap(int ar[], int i, int j) {
int aux = ar[j];
ar[j] = ar[i];
ar[i] = ar[j];
}
int main() {
int A, B;
cin >> A >> B;
if (A >= 6 && A <= 12)
cout << B / 2;
else if (B <= 5)
cout << 0;
else
cout << A;
}
| #include <bits/stdc++.h> // ios_base::sync_with_stdio(false);
#define MAXN 500005 // cin.tie(NULL);
#define di pair<int, int>
#define tri pair<int, di>
#define bi pair<bool, int>
using namespace std;
void swap(int ar[], int i, int j) {
int aux = ar[j];
ar[j] = ar[i];
ar[i] = ar[j];
}
int main() {
int A, B;
cin >> A >> B;
if (A >= 6 && A <= 12)
cout << B / 2;
else if (A <= 5)
cout << 0;
else
cout << B;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 848,197 | 848,196 | u367086854 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ((ll)n); i++)
#define rep1(i, n) for (ll i = 1; i <= ((ll)n); i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define meow(a) cout << a << " meow\n";
typedef pair<long long, long long> pii;
const ll maxn = 200005;
const ll MOD = 998244353;
double mypow(ll a, ll b) {
double res = 1;
while (b) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ll x, y;
int main() {
// IOS;
while (cin >> x >> y) {
if (x <= 6)
cout << 0 << "\n";
else if (x <= 12)
cout << y / 2 << "\n";
else
cout << y << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ((ll)n); i++)
#define rep1(i, n) for (ll i = 1; i <= ((ll)n); i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define meow(a) cout << a << " meow\n";
typedef pair<long long, long long> pii;
const ll maxn = 200005;
const ll MOD = 998244353;
double mypow(ll a, ll b) {
double res = 1;
while (b) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ll x, y;
int main() {
// IOS;
while (cin >> x >> y) {
if (x < 6)
cout << 0 << "\n";
else if (x <= 12)
cout << y / 2 << "\n";
else
cout << y << "\n";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,206 | 848,207 | u856205835 | cpp |
p03035 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (6 <= A <= 12) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (6 <= A && A <= 12) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 848,217 | 848,218 | u499078067 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<uint> vu;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pii> vpii;
typedef vector<puu> vpuu;
typedef vector<pll> vpll;
typedef vector<pull> vpull;
typedef vector<string> vstr;
typedef vector<double> vdbl;
typedef vector<ldbl> vldbl;
#define pb push_back
#define ppb pop_back
#define pfr push_front
#define ppfr pop_front
#define emp emplace
#define empb emplace_back
#define be begin
#define rbe rbegin
#define all(x) (x).be(), (x).end()
#define rall(x) (x).rbe(), (x).rend()
#define fir first
#define sec second
#define mkp make_pair
#define brif(cond) \
if (cond) \
break
#define ctif(cond) \
if (cond) \
continue
#define retif(cond) \
if (cond) \
return
void canhazfast() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
while (b) {
T q = a / b;
a %= b;
swap(a, b);
x0 -= q * x1;
swap(x0, x1);
y0 -= q * y1;
swap(y0, y1);
}
x = x0;
y = y0;
return a;
}
int ctz(uint x) { return __builtin_ctz(x); }
int ctzll(ull x) { return __builtin_ctzll(x); }
int clz(uint x) { return __builtin_clz(x); }
int clzll(ull x) { return __builtin_clzll(x); }
int popcnt(uint x) { return __builtin_popcount(x); }
int popcntll(ull x) { return __builtin_popcountll(x); }
int bsr(uint x) { return 31 ^ clz(x); }
int bsrll(ull x) { return 63 ^ clzll(x); }
int main() {
canhazfast();
int a, b, ans;
cin >> a >> b;
if (a < 5)
ans = 0;
else if (a < 13)
ans = b / 2;
else
ans = b;
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<uint> vu;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pii> vpii;
typedef vector<puu> vpuu;
typedef vector<pll> vpll;
typedef vector<pull> vpull;
typedef vector<string> vstr;
typedef vector<double> vdbl;
typedef vector<ldbl> vldbl;
#define pb push_back
#define ppb pop_back
#define pfr push_front
#define ppfr pop_front
#define emp emplace
#define empb emplace_back
#define be begin
#define rbe rbegin
#define all(x) (x).be(), (x).end()
#define rall(x) (x).rbe(), (x).rend()
#define fir first
#define sec second
#define mkp make_pair
#define brif(cond) \
if (cond) \
break
#define ctif(cond) \
if (cond) \
continue
#define retif(cond) \
if (cond) \
return
void canhazfast() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
while (b) {
T q = a / b;
a %= b;
swap(a, b);
x0 -= q * x1;
swap(x0, x1);
y0 -= q * y1;
swap(y0, y1);
}
x = x0;
y = y0;
return a;
}
int ctz(uint x) { return __builtin_ctz(x); }
int ctzll(ull x) { return __builtin_ctzll(x); }
int clz(uint x) { return __builtin_clz(x); }
int clzll(ull x) { return __builtin_clzll(x); }
int popcnt(uint x) { return __builtin_popcount(x); }
int popcntll(ull x) { return __builtin_popcountll(x); }
int bsr(uint x) { return 31 ^ clz(x); }
int bsrll(ull x) { return 63 ^ clzll(x); }
int main() {
canhazfast();
int a, b, ans;
cin >> a >> b;
if (a < 6)
ans = 0;
else if (a < 13)
ans = b / 2;
else
ans = b;
cout << ans << '\n';
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,227 | 848,228 | u840905163 | cpp |
p03035 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 12) {
cout << B << endl;
} else if (A > 6) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 12) {
cout << B << endl;
} else if (A > 5) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,245 | 848,246 | u913104858 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (12 > a && a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (12 >= a && a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,247 | 848,248 | u646051775 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(void) {
int A, B;
std::cin >> A >> B;
if (A < 12) {
if (A > 5) {
B = B / 2;
} else {
B = 0;
}
}
std::cout << B << std::endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int A, B;
std::cin >> A >> B;
if (A < 13) {
if (A > 5) {
B = B / 2;
} else {
B = 0;
}
}
std::cout << B << std::endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,253 | 848,254 | u559882532 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
cin >> b;
int ans = 0;
if (a >= 13)
cout << b << endl;
else if (a >= 10)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
cin >> b;
int ans = 0;
if (a >= 13)
cout << b << endl;
else if (a >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,255 | 848,256 | u948459352 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
cin >> n >> m;
if (n > 12)
cout << m << endl;
if (n <= 12 && n > 6)
cout << m / 2 << endl;
if (n < 6)
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
cin >> n >> m;
if (n > 12)
cout << m << endl;
if (n <= 12 && n >= 6)
cout << m / 2 << endl;
if (n < 6)
cout << 0 << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,264 | 848,265 | u966582222 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
if (a <= 5)
cout << 0 << endl;
if (6 <= a <= 12)
cout << b / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
if (a <= 5)
cout << 0 << endl;
if (6 <= a && a <= 12)
cout << b / 2 << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 848,268 | 848,269 | u652712806 | cpp |
p03035 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define c(P) cout << P << "\n"
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i, a, n) for (ll i = a; i < n; i++)
#define frr(i, a, n) for (ll i = n - 1; i >= a; i--)
const ll N = 500005;
const ll mod = 1e9 + 7;
using namespace std;
void solve() {
// string s;
ll n, m, k, x = 0, y = 0, c = 0, q, ans = 0;
cin >> n >> k;
if (n >= 13)
cout << k;
if (n >= 6 and n <= 12)
cout << k / 2;
else
c(0);
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll T = 1;
// cin>>T;
while (T--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
#define ll int
#define pb push_back
#define eb emplace_back
#define c(P) cout << P << "\n"
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i, a, n) for (ll i = a; i < n; i++)
#define frr(i, a, n) for (ll i = n - 1; i >= a; i--)
const ll N = 500005;
const ll mod = 1e9 + 7;
using namespace std;
void solve() {
// string s;
ll n, m, k, x = 0, y = 0, c = 0, q, ans = 0;
cin >> n >> k;
if (n >= 13)
cout << k;
else if (n >= 6 and n <= 12)
cout << k / 2;
else
c(0);
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll T = 1;
// cin>>T;
while (T--) {
solve();
}
return 0;
}
| [
"preprocessor.define.value.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 848,280 | 848,281 | u305721160 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr double INF{1e9};
constexpr int MAGIC_PRIME{1000000000 + 7};
constexpr array<int, 4> dy{-1, 1, 0, 0};
constexpr array<int, 4> dx{0, 0, -1, 1};
constexpr int div_ru(int a, int b) { return (a - b + 1) / b; }
ll pow_mod(ll b, ll e,
ll m) { // https://atcoder.jp/contests/atc002/tasks/atc002_b
ll r = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
r = (r * b) % m;
b = (b * b) % m;
}
return r;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
int ans = 0;
if (a >= 13)
ans = b;
else if (ans >= 6)
ans = b / 2;
else
ans = 0;
cout << ans << endl;
return 0;
}
// _......_
// , ´ <＊y ♪
// i,（i ﾉﾉﾊ）_）
// ﾉ_iﾊﾟ ヮﾟﾉﾊ
// ,´i'_ｿﾉj,〈つ ))
// 〈_,ﾉ＾＾＾ヽ.´
// .＾＾i_ｿ_ｿ^´
// ￣￣ ￣
// vector<vector<int>> mm(h, vector<int>(w, -1));
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr double INF{1e9};
constexpr int MAGIC_PRIME{1000000000 + 7};
constexpr array<int, 4> dy{-1, 1, 0, 0};
constexpr array<int, 4> dx{0, 0, -1, 1};
constexpr int div_ru(int a, int b) { return (a - b + 1) / b; }
ll pow_mod(ll b, ll e,
ll m) { // https://atcoder.jp/contests/atc002/tasks/atc002_b
ll r = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
r = (r * b) % m;
b = (b * b) % m;
}
return r;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
int ans = 0;
if (a >= 13)
ans = b;
else if (a >= 6)
ans = b / 2;
else
ans = 0;
cout << ans << endl;
return 0;
}
// _......_
// , ´ <＊y ♪
// i,（i ﾉﾉﾊ）_）
// ﾉ_iﾊﾟ ヮﾟﾉﾊ
// ,´i'_ｿﾉj,〈つ ))
// 〈_,ﾉ＾＾＾ヽ.´
// .＾＾i_ｿ_ｿ^´
// ￣￣ ￣
// vector<vector<int>> mm(h, vector<int>(w, -1));
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 848,284 | 848,285 | u076506345 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int inf = (1 << 30);
int mod = 1e9 + 7;
int64_t inf64 = (1LL << 60);
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) {
T g = gcd(a, b);
return a / g * b;
}
bool check(vector<int> a, int index, int key) {
if (a[index] >= key)
return true;
else
return false;
}
int lower_bound(vector<int> a, int key) {
int left = -1, right = a.size();
while (right - left > 1) {
int mid = left + (left + right) / 2;
if (check(a, mid, key))
right = mid;
else
left = mid;
}
return right;
}
int main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B << endl;
else if (A >= 6)
cout << (2 / B) << endl;
else
cout << 0 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int inf = (1 << 30);
int mod = 1e9 + 7;
int64_t inf64 = (1LL << 60);
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) {
T g = gcd(a, b);
return a / g * b;
}
bool check(vector<int> a, int index, int key) {
if (a[index] >= key)
return true;
else
return false;
}
int lower_bound(vector<int> a, int key) {
int left = -1, right = a.size();
while (right - left > 1) {
int mid = left + (left + right) / 2;
if (check(a, mid, key))
right = mid;
else
left = mid;
}
return right;
}
int main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B << endl;
else if (A >= 6)
cout << (B / 2) << endl;
else
cout << 0 << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 848,295 | 848,296 | u152315108 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << setprecision(8) << setiosflags(ios::fixed);
int a, b;
cin >> a >> b;
if (13 <= a)
cout << b << endl;
else if (6 <= b)
cout << b / 2 << endl;
else
cout << "0\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << setprecision(8) << setiosflags(ios::fixed);
int a, b;
cin >> a >> b;
if (13 <= a)
cout << b << endl;
else if (6 <= a)
cout << b / 2 << endl;
else
cout << "0\n";
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 848,333 | 848,334 | u090097090 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n > 12)
cout << m << endl;
else if (n > 6)
cout << m / 2 << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n > 12)
cout << m << endl;
else if (n >= 6)
cout << m / 2 << endl;
else
cout << 0 << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,339 | 848,340 | u269278772 | cpp |
p03035 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
int a, b;
int main(void) {
cin >> a >> b;
int ret;
if (a >= 13)
ret = b;
else if (a < 5)
ret = 0;
else
ret = b / 2;
cout << ret << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
int a, b;
int main(void) {
cin >> a >> b;
int ret;
if (a >= 13)
ret = b;
else if (a <= 5)
ret = 0;
else
ret = b / 2;
cout << ret << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,349 | 848,350 | u728082661 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a < 5) {
cout << 0 << endl;
return 0;
}
if (a <= 12) {
cout << b / 2 << endl;
return 0;
}
cout << b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0 << endl;
return 0;
}
if (a <= 12) {
cout << b / 2 << endl;
return 0;
}
cout << b << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,363 | 848,364 | u616029737 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (a > 12) {
ans = b;
} else if (5 >= a) {
ans = 0;
} else {
ans = b / 2;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (a > 12) {
ans = b;
} else if (5 >= a) {
ans = 0;
} else {
ans = b / 2;
}
cout << ans;
}
| [] | 848,369 | 848,370 | u005570675 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0 << endl;
} else if (5 < a < 13) {
cout << b / 2 << endl;
} else {
cout << b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0 << endl;
} else if (a < 13) {
cout << b / 2 << endl;
} else {
cout << b << endl;
}
} | [
"expression.operation.binary.remove"
] | 848,377 | 848,378 | u794565416 | cpp |
p03035 | #include <bits/stdc++.h>
#define ll long long
#define hell 1000000007
#define F first
#define re 15000000
#define S second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (ll int i = a; i < b; i++)
#define pi 3.1415926536
#define Mod 998244353
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b;
if (a >= 6 && a <= 12)
cout << b / 2;
else
cout << 0;
} | #include <bits/stdc++.h>
#define ll long long
#define hell 1000000007
#define F first
#define re 15000000
#define S second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (ll int i = a; i < b; i++)
#define pi 3.1415926536
#define Mod 998244353
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b;
if (a >= 6 && a <= 12)
cout << b / 2;
else if (a < 6)
cout << 0;
} | [
"control_flow.branch.if.add"
] | 848,381 | 848,382 | u069325246 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
cout << 0 << endl;
} else if (A >= 13) {
cout << B << endl;
} else {
cout << A / 2 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
cout << 0 << endl;
} else if (A >= 13) {
cout << B << endl;
} else {
cout << B / 2 << endl;
}
}
| [
"identifier.change",
"io.output.change"
] | 848,387 | 848,388 | u989696545 | cpp |
p03035 | #include <bits/stdc++.h>
#define hell 1000000007
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll vector<pair<ll, ll>>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define F first
#define S second
#define rep(i, a, b) for (i = a; i < b; i++)
#define parr(a, n) \
for (ll it = 0; it < n; it++) \
cout << a[it] << " "; \
cout << endl;
#define pcont(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
#define ret(x) return cout << x, 0;
#define endl '\n'
/*constants*/
#define MAXN 100005
#define PI 3.14159265358979323846
/*debug*/
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll i, j, n, m, k, cnt = 0, ans = 0, t = 1;
cin >> n >> m;
if (n >= 13)
ret(m) if (n >= 5 && n < 13) ret(m / 2) ret(0)
return 0;
} | #include <bits/stdc++.h>
#define hell 1000000007
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll vector<pair<ll, ll>>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define F first
#define S second
#define rep(i, a, b) for (i = a; i < b; i++)
#define parr(a, n) \
for (ll it = 0; it < n; it++) \
cout << a[it] << " "; \
cout << endl;
#define pcont(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
#define ret(x) return cout << x, 0;
#define endl '\n'
/*constants*/
#define MAXN 100005
#define PI 3.14159265358979323846
/*debug*/
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll i, j, n, m, k, cnt = 0, ans = 0, t = 1;
cin >> n >> m;
if (n >= 13)
ret(m) if (n > 5 && n < 13) ret(m / 2) ret(0)
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,389 | 848,390 | u974440381 | cpp |
p03035 | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a >= 12) {
cout << b << endl;
} else if (a > 5) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b << endl;
} else if (a > 5) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,391 | 848,392 | u118875091 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef long double ld;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
constexpr ll MOD = 1e9 + 7;
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
#define Sort(x) sort(x.begin(), x.end())
#define Reverse(x) reverse(x.begin(), x.end())
#define ABS(a, b) ((a) < (b) ? (b) - (a) : (a) - (b))
#define nbit(n) (1ll << (n))
// sort(begin(x), end(x), greater<ll>());
// lower_bound(a.begin(), a.end(), val): a[i] ≥ valである最左の位置
// upper_bound(a.begin(), a.end(), val): a[i] > valである最左の位置
// Returns minimum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmin(T &a, T b) {
if (a > b) {
a = b;
}
return a;
}
// Returns maximum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmax(T &a, T b) {
if (a < b) {
a = b;
}
return a;
}
// a = (a+b)%MOD;
void addmod(ll &a, ll b) { a = (a + b) % MOD; }
template <typename T> void dumpContents(const T &v, const string &msg) {
cerr << "### " << msg << " ###\n";
for (const auto &x : v) {
cerr << x << " ";
}
cerr << endl;
}
struct before_main_function {
before_main_function() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
#define endl "\n"
}
} before_main_function;
// ========== end of template ==========
int main(int argc, char **argv) {
int A, B;
cin >> A >> B;
if (A < 5) {
B = 0;
} else if (A < 13) {
B /= 2;
}
cout << B << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef long double ld;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
constexpr ll MOD = 1e9 + 7;
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
#define Sort(x) sort(x.begin(), x.end())
#define Reverse(x) reverse(x.begin(), x.end())
#define ABS(a, b) ((a) < (b) ? (b) - (a) : (a) - (b))
#define nbit(n) (1ll << (n))
// sort(begin(x), end(x), greater<ll>());
// lower_bound(a.begin(), a.end(), val): a[i] ≥ valである最左の位置
// upper_bound(a.begin(), a.end(), val): a[i] > valである最左の位置
// Returns minimum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmin(T &a, T b) {
if (a > b) {
a = b;
}
return a;
}
// Returns maximum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmax(T &a, T b) {
if (a < b) {
a = b;
}
return a;
}
// a = (a+b)%MOD;
void addmod(ll &a, ll b) { a = (a + b) % MOD; }
template <typename T> void dumpContents(const T &v, const string &msg) {
cerr << "### " << msg << " ###\n";
for (const auto &x : v) {
cerr << x << " ";
}
cerr << endl;
}
struct before_main_function {
before_main_function() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
#define endl "\n"
}
} before_main_function;
// ========== end of template ==========
int main(int argc, char **argv) {
int A, B;
cin >> A >> B;
if (A <= 5) {
B = 0;
} else if (A < 13) {
B /= 2;
}
cout << B << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,393 | 848,394 | u106804623 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define MX LLONG_MAX
#define MN LLONG_MIN
const int N = 1e5 + 5;
const ll mod = 1e9 + 7;
ll powermodm(ll x, ll n, ll M) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % M;
x = (x * x) % M;
n = n / 2;
}
return result;
}
ll power(ll _a, ll _b) {
ll _r = 1;
while (_b) {
if (_b % 2 == 1)
_r = (_r * _a);
_b /= 2;
_a = (_a * _a);
}
return _r;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (max(a, b) / gcd(a, b)) * min(a, b); }
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a < 5)
cout << 0;
else
cout << (b / 2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define MX LLONG_MAX
#define MN LLONG_MIN
const int N = 1e5 + 5;
const ll mod = 1e9 + 7;
ll powermodm(ll x, ll n, ll M) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % M;
x = (x * x) % M;
n = n / 2;
}
return result;
}
ll power(ll _a, ll _b) {
ll _r = 1;
while (_b) {
if (_b % 2 == 1)
_r = (_r * _a);
_b /= 2;
_a = (_a * _a);
}
return _r;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (max(a, b) / gcd(a, b)) * min(a, b); }
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a <= 5)
cout << 0;
else
cout << (b / 2);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,395 | 848,396 | u015252678 | cpp |
p03035 | // A
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int A, B;
int main() {
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (A >= 6 && A < 12) {
cout << B / 2 << endl;
} else {
cout << "0" << endl;
}
return 0;
}
| // A
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int A, B;
int main() {
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
} else {
cout << "0" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,405 | 848,406 | u799752754 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.