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 <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
map<char, int> a;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a <= 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
map<char, int> a;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a <= 12 & a > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 846,658 | 846,659 | u677400065 | 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 << B / 2 << endl;
}
return 0;
} |
#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;
}
return 0;
} | [] | 846,660 | 846,661 | u964124095 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (A < 6 ? 0 : (B < 13 ? B / 2 : B)) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (A < 6 ? 0 : (A < 13 ? B / 2 : B)) << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 846,666 | 846,667 | u183530284 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
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 if (a <= 5)
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
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 if (a <= 5)
cout << 0 << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,668 | 846,669 | u568419568 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
// B is an even number
if (a > 12) {
/* tam fiyat */
cout << a;
} else if (a > 5) {
/* yarı fiyat */
cout << a / 2;
} else {
/* bedava */
cout << "0";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
// B is an even number
if (a > 12) {
/* tam fiyat */
cout << b;
} else if (a > 5) {
/* yarı fiyat */
cout << b / 2;
} else {
/* bedava */
cout << "0";
}
return 0;
} | [
"identifier.change",
"io.output.change"
] | 846,672 | 846,673 | u863190862 | cpp |
p03035 | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int a, b, ans;
cin >> a >> b;
if (a < 5) {
ans = 0;
} else if (a <= 12) {
ans = b / 2;
} else {
ans = b;
}
cout << ans;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int a, b, ans;
cin >> a >> b;
if (a <= 5) {
ans = 0;
} else if (a <= 12) {
ans = b / 2;
} else {
ans = b;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 846,689 | 846,690 | u285043842 | cpp |
p03035 | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int a, b, ans;
cin >> a >> b;
if (a < 5) {
ans = 0;
} else if (a <= 12) {
ans = b / 2;
} else {
ans = b;
}
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int a, b, ans;
cin >> a >> b;
if (a <= 5) {
ans = 0;
} else if (a <= 12) {
ans = b / 2;
} else {
ans = b;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,691 | 846,690 | u285043842 | cpp |
p03035 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define clr(v, d) memset(v, d, sizeof(v))
const double EPS = 1e-8;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const ll mod = ll(1e9 + 7);
int dx[] = {0, 0, -1, 1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
const int N = 1000001;
#define endl '\n'
#define ever \
; \
;
#define F first
#define S second
#define pii pair<int, int>
#define sz(v) ((int)((v).size()))
#define pll pair<ll, ll>
void stop() {
#ifndef ONLINE_JUDGE
system("pause");
#endif
}
void file() {
#ifndef ONLINE_JUDGE
freopen("pizza.in", "r", stdin);
freopen("pizza.out", "w", stdout);
#endif
}
struct point {
double x, y;
};
ull gcd(ull a, ull b) { return !b ? a : gcd(b, a % b); }
ll fixMod(ll a, ll b) { return ((a % b) + b) % b; }
double triangle_area(int x1, int y1, int x2, int y2, int x3, int y3) {
return abs((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)) / 2.;
};
ll dis(point a, point b) {
ll x = a.x - b.x, y = a.y - b.y;
return x * x + y * y;
}
ull LCM(ull a, ull b) { return a / gcd(a, b) * b; }
ll power(ll x, ll y) {
if (y == 0)
return 1;
if (y == 1)
return x;
ll r = power(x, y / 2) % mod;
return r % mod * r % mod * power(x, y % 2) % mod;
}
int main() {
fast ll a, b;
cin >> a >> b;
if (a > 12)
cout << b;
else if (a < 5)
cout << 0;
else
cout << b / 2;
stop();
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define clr(v, d) memset(v, d, sizeof(v))
const double EPS = 1e-8;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const ll mod = ll(1e9 + 7);
int dx[] = {0, 0, -1, 1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
const int N = 1000001;
#define endl '\n'
#define ever \
; \
;
#define F first
#define S second
#define pii pair<int, int>
#define sz(v) ((int)((v).size()))
#define pll pair<ll, ll>
void stop() {
#ifndef ONLINE_JUDGE
system("pause");
#endif
}
void file() {
#ifndef ONLINE_JUDGE
freopen("pizza.in", "r", stdin);
freopen("pizza.out", "w", stdout);
#endif
}
struct point {
double x, y;
};
ull gcd(ull a, ull b) { return !b ? a : gcd(b, a % b); }
ll fixMod(ll a, ll b) { return ((a % b) + b) % b; }
double triangle_area(int x1, int y1, int x2, int y2, int x3, int y3) {
return abs((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)) / 2.;
};
ll dis(point a, point b) {
ll x = a.x - b.x, y = a.y - b.y;
return x * x + y * y;
}
ull LCM(ull a, ull b) { return a / gcd(a, b) * b; }
ll power(ll x, ll y) {
if (y == 0)
return 1;
if (y == 1)
return x;
ll r = power(x, y / 2) % mod;
return r % mod * r % mod * power(x, y % 2) % mod;
}
int main() {
fast ll a, b;
cin >> a >> b;
if (a > 12)
cout << b;
else if (a <= 5)
cout << 0;
else
cout << b / 2;
stop();
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,692 | 846,693 | u915266922 | 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 >= 6)
cout << B / 2 << endl;
else
cout << B / 4 << endl;
}
| #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;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"expression.operation.binary.remove"
] | 846,696 | 846,697 | u469953228 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
using ll = long long;
static const ll mod = 1e9 + 7;
static const ll INF = 1LL << 50;
using namespace std;
struct UF {
vector<int> par; //親
vector<int> Rank; //木の深さ
UF(int n) { init(n); }
//初期化
void init(int n) {
par.resize(n);
Rank.resize(n);
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
//木の根を求める
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
// xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return; //すでに同じ集合に属している
if (Rank[x] < Rank[y]) { //高さが小さい方を下に
par[x] = y;
} else {
par[y] = x;
if (Rank[x] == Rank[y])
Rank[x]++; //同じだとrankが変わらないままになるので増やす（それ以外は大きい方のrankが採用される）
}
}
// xとyが同じ集合に属するかを判定
bool same(int x, int y) { return find(x) == find(y); }
};
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;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
using ll = long long;
static const ll mod = 1e9 + 7;
static const ll INF = 1LL << 50;
using namespace std;
struct UF {
vector<int> par; //親
vector<int> Rank; //木の深さ
UF(int n) { init(n); }
//初期化
void init(int n) {
par.resize(n);
Rank.resize(n);
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
//木の根を求める
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
// xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return; //すでに同じ集合に属している
if (Rank[x] < Rank[y]) { //高さが小さい方を下に
par[x] = y;
} else {
par[y] = x;
if (Rank[x] == Rank[y])
Rank[x]++; //同じだとrankが変わらないままになるので増やす（それ以外は大きい方のrankが採用される）
}
}
// xとyが同じ集合に属するかを判定
bool same(int x, int y) { return find(x) == find(y); }
};
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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,698 | 846,699 | u698883164 | cpp |
p03035 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
if (n >= 13) {
cout << n << endl;
} else if (n >= 6) {
a = a / 2;
cout << n << endl;
} else
cout << 0 << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
if (n >= 13) {
cout << a << endl;
} else if (n >= 6) {
a = a / 2;
cout << a << endl;
} else
cout << 0 << endl;
} | [
"identifier.change",
"io.output.change"
] | 846,709 | 846,710 | u743473047 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
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;
}
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if (A <= 12)
B /= 2;
if (B <= 5)
B = 0;
cout << B << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
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;
}
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if (A <= 12)
B /= 2;
if (A <= 5)
B = 0;
cout << B << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 846,730 | 846,731 | u980655160 | 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 <= 12 && A >= 6)
;
{ cout << B / 2 << endl; }
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 (A <= 12 && A >= 6) {
cout << B / 2 << endl;
} else if (A <= 5) {
cout << 0 << endl;
}
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 846,738 | 846,739 | u224951113 | 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;
}
return 0;
}
| #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 << "0" << endl;
} else {
cout << b / 2 << endl;
}
return 0;
}
| [
"control_flow.branch.else.add"
] | 846,750 | 846,751 | u525242559 | 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 << endl;
} else {
cout << b << endl;
}
return 0;
}
| #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 << "0" << endl;
} else {
cout << b / 2 << endl;
}
return 0;
}
| [
"io.output.change"
] | 846,752 | 846,751 | u525242559 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a >= 6)
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 a, b;
int main() {
cin >> a >> b;
if (a >= 13)
cout << b << "\n";
else if (a >= 6)
cout << b / 2 << "\n";
else
cout << "0\n";
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 846,755 | 846,756 | u114207999 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
} else if (A <= 5) {
A = 0;
} else {
A = A / 2;
}
cout << A << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
} else if (A <= 5) {
B = 0;
} else {
B = B / 2;
}
cout << B << endl;
} | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 846,779 | 846,780 | u173511648 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << a;
} else if (a >= 6) {
cout << b / 2;
} else {
cout << 0;
}
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b;
} else if (a >= 6) {
cout << b / 2;
} else {
cout << 0;
}
}
| [
"identifier.change",
"io.output.change"
] | 846,783 | 846,784 | u276796245 | cpp |
p03035 | #include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define pii pair<int, int>
#define plli pair<lli, lli>
#define F(i, n) for (lli(i) = 0; (i) < (n); (i)++)
#define FR(i, n) for (ll(i) = (n)-1; (i) >= 0; (i)--)
#define FSG(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define FSGR(i, a, b) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define VALD(n) cout << #n << ": " << n << endl;
int main() {
int a, b;
cin >> a >> b;
int price = b;
if (a <= 5) {
price = 0;
} else if (a >= 6 && a <= 12) {
price = b / 2;
}
cout << b << endl;
return 0;
}
| #include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define pii pair<int, int>
#define plli pair<lli, lli>
#define F(i, n) for (lli(i) = 0; (i) < (n); (i)++)
#define FR(i, n) for (ll(i) = (n)-1; (i) >= 0; (i)--)
#define FSG(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define FSGR(i, a, b) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define VALD(n) cout << #n << ": " << n << endl;
int main() {
int a, b;
cin >> a >> b;
int price = b;
if (a <= 5) {
price = 0;
} else if (a >= 6 && a <= 12) {
price = b / 2;
}
cout << price << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 846,787 | 846,788 | u201489353 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a < 5)
cout << 0 << endl;
else if (a < 13)
cout << b / 2 << endl;
else
cout << b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << endl;
else if (a < 13)
cout << b / 2 << endl;
else
cout << b << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 846,795 | 846,796 | u598726179 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a < 5)
cout << 0 << endl;
else if (a < 12)
cout << b / 2 << endl;
else
cout << b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << endl;
else if (a < 13)
cout << b / 2 << endl;
else
cout << b << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 846,797 | 846,796 | u598726179 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define DEBUG(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
typedef long long ll;
typedef unsigned long long ull;
struct edge {
int u, v;
ll w;
};
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6 && 12 <= a)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define DEBUG(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
typedef long long ll;
typedef unsigned long long ull;
struct edge {
int u, v;
ll w;
};
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6 && 12 >= a)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,804 | 846,805 | u112581208 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define DEBUG(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
typedef long long ll;
typedef unsigned long long ull;
struct edge {
int u, v;
ll w;
};
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (b >= 6 && 12 <= b)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define DEBUG(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
typedef long long ll;
typedef unsigned long long ull;
struct edge {
int u, v;
ll w;
};
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6 && 12 >= a)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 846,806 | 846,805 | u112581208 | cpp |
p03035 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll MOD = 1000000007;
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;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹) */
///////////////////////////////////////////////
int main() {
int A, B, ans;
cin >> A >> B;
ans = 0;
if (A >= 13) {
ans = B;
}
if (A >= 6) {
ans = B / 2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll MOD = 1000000007;
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;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹) */
///////////////////////////////////////////////
int main() {
int A, B, ans;
cin >> A >> B;
ans = 0;
if (A >= 13) {
ans = B;
} else if (A >= 6) {
ans = B / 2;
}
cout << ans << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 846,809 | 846,810 | u532894762 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < 6) {
cout << 0 << endl;
}
if (A < 13) {
cout << B / 2 << endl;
} else {
cout << B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < 6) {
cout << 0 << endl;
} else if (A < 13) {
cout << B / 2 << endl;
} else {
cout << B << endl;
}
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 846,827 | 846,828 | u494379309 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (6 <= 12) {
cout << B / 2 << endl;
} else if (0 <= 5) {
cout << 0 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
//年齢が13歳以上の場合の結果を出力する処理
} else if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
//年齢が6歳以上かつ12歳以下の場合の結果を出力する処理
} else if (0 <= 5) {
cout << 0 << endl;
//年齢が5歳以下の場合の結果を出力する処理
}
} | [
"control_flow.branch.if.condition.change"
] | 846,834 | 846,835 | u600215903 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A <= 13) {
cout << B << endl;
} else if (6 <= 12) {
cout << B / 2 << endl;
} else if (0 <= 5) {
cout << 0 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
//年齢が13歳以上の場合の結果を出力する処理
} else if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
//年齢が6歳以上かつ12歳以下の場合の結果を出力する処理
} else if (0 <= 5) {
cout << 0 << endl;
//年齢が5歳以下の場合の結果を出力する処理
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,836 | 846,835 | u600215903 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (6 <= 12) {
cout << B / 2 << endl;
} else if (0 <= 5) {
cout << 0 << endl;
}
} | // ABC127のA問題を解いてみた
#include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
//年齢が13歳以上の場合の結果を出力する処理
} else if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
//年齢が6歳以上かつ12歳以下の場合の結果を出力する処理
} else if (0 <= 5) {
cout << 0 << endl;
//年齢が5歳以下の場合の結果を出力する処理
}
}
| [
"control_flow.branch.if.condition.change"
] | 846,834 | 846,837 | u600215903 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A <= 13) {
cout << B << endl;
} else if (6 <= 12) {
cout << B / 2 << endl;
} else if (0 <= 5) {
cout << 0 << endl;
}
} | // ABC127のA問題を解いてみた
#include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
//年齢が13歳以上の場合の結果を出力する処理
} else if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
//年齢が6歳以上かつ12歳以下の場合の結果を出力する処理
} else if (0 <= 5) {
cout << 0 << endl;
//年齢が5歳以下の場合の結果を出力する処理
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,836 | 846,837 | u600215903 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (6 <= 12) {
cout << B / 2 << endl;
} else if (0 <= 5) {
cout << 0 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
} else if (0 <= 5) {
cout << 0 << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 846,834 | 846,838 | u600215903 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A <= 13) {
cout << B << endl;
} else if (6 <= 12) {
cout << B / 2 << endl;
} else if (0 <= 5) {
cout << 0 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int A;
//高橋くんの年齢
int B;
//観覧車の料金
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
} else if (0 <= 5) {
cout << 0 << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,836 | 846,838 | u600215903 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int Bhalf = B / 2;
if (A <= 5) {
cout << 0 << endl;
}
if (A >= 13) {
cout << B << endl;
} else {
cout << Bhalf << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int Bhalf = B / 2;
if (A <= 5) {
cout << 0 << endl;
} else if (A >= 13) {
cout << B << endl;
} else {
cout << Bhalf << endl;
}
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 846,850 | 846,851 | u636605529 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int Bhalf = B / 2;
if (A < 5) {
cout << 0 << endl;
}
if (A >= 13) {
cout << B << endl;
} else {
cout << Bhalf << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int Bhalf = B / 2;
if (A <= 5) {
cout << 0 << endl;
} else if (A >= 13) {
cout << B << endl;
} else {
cout << Bhalf << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 846,852 | 846,851 | u636605529 | 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 << B / 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;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,853 | 846,854 | u525974535 | cpp |
p03035 | #include <bits/stdc++.h>
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;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
typedef long long ll;
const int mod = 1e9 + 7;
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>
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;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
typedef long long ll;
const int mod = 1e9 + 7;
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;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,857 | 846,858 | u170650966 | cpp |
p03035 | #include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
#define LL long long
#define MOD 1000000007
// cout << (c)?"Yay!":":(" << endl;
// sort(a.begin(), a.end(), std::greater<int>());
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (6 < a)
cout << 0 << endl;
else {
cout << b / 2 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
#define LL long long
#define MOD 1000000007
// cout << (c)?"Yay!":":(" << endl;
// sort(a.begin(), a.end(), std::greater<int>());
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (6 > a)
cout << 0 << endl;
else {
cout << b / 2 << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,859 | 846,860 | u393086221 | 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;
}
| #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;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 846,884 | 846,885 | u223172354 | cpp |
p03035 | #include <algorithm>
#include <iostream>
using namespace std;
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;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
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;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,886 | 846,887 | u308684517 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
if (a <= 5)
cout << 0;
else
cout << b / 2;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
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;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 846,899 | 846,900 | u741134767 | cpp |
p03035 | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define fi first
#define se second
#define mp make_pair
#define rev reverse
#define dans dump(ans)
#define MOD 1000000007
#define amp(v, n) (v).count(n) ? v[n]++ : v[n] = 1
#define sysp system("pause")
#define PI acos(-1)
#define pf push_front
#define ins insert
//{
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class... A> inline void dump() { cout << endl; }
template <class... A> inline void dump_rest() { cout << endl; }
template <class T, class... A>
inline void dump_rest(const T &first, const A &...rest) {
cout << dump_interval << first;
dump_rest(rest...);
}
template <class T, class... A>
inline void dump(const T &first, const A &...rest) {
cout << first;
dump_rest(rest...);
}
template <class... A> inline void debug() { cerr << endl; }
template <class... A> inline void debug_rest() { cerr << endl; }
template <class T, class... A>
inline void debug_rest(const T &first, const A &...rest) {
cerr << debug_interval << first;
debug_rest(rest...);
}
template <class T, class... A>
inline void debug(const T &first, const A &...rest) {
if (debug_toggle)
cerr << first, debug_rest(rest...);
}
unsigned XorShift(void) {
static unsigned x = 123456789;
static unsigned y = 362436069;
static unsigned z = 521288629;
static unsigned w = 88675123;
unsigned t;
t = x ^ (x << 11);
x = y;
y = z;
z = w;
return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
//}
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <int m> class mint {
private:
int i;
public:
mint() : i(0) {}
mint(int i) : i((i % m + m) % m) {}
mint operator+(const mint &o) { return o.i + i; }
mint operator*(const mint &o) { return o.i * i; }
mint operator-() { return -i; }
operator int() { return i; }
};
//}
int a, b;
main() {
cin >> a >> b;
if (b <= 5)
dump(0);
else if (b >= 13)
dump(b);
else
dump(b / 2);
} | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define fi first
#define se second
#define mp make_pair
#define rev reverse
#define dans dump(ans)
#define MOD 1000000007
#define amp(v, n) (v).count(n) ? v[n]++ : v[n] = 1
#define sysp system("pause")
#define PI acos(-1)
#define pf push_front
#define ins insert
//{
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class... A> inline void dump() { cout << endl; }
template <class... A> inline void dump_rest() { cout << endl; }
template <class T, class... A>
inline void dump_rest(const T &first, const A &...rest) {
cout << dump_interval << first;
dump_rest(rest...);
}
template <class T, class... A>
inline void dump(const T &first, const A &...rest) {
cout << first;
dump_rest(rest...);
}
template <class... A> inline void debug() { cerr << endl; }
template <class... A> inline void debug_rest() { cerr << endl; }
template <class T, class... A>
inline void debug_rest(const T &first, const A &...rest) {
cerr << debug_interval << first;
debug_rest(rest...);
}
template <class T, class... A>
inline void debug(const T &first, const A &...rest) {
if (debug_toggle)
cerr << first, debug_rest(rest...);
}
unsigned XorShift(void) {
static unsigned x = 123456789;
static unsigned y = 362436069;
static unsigned z = 521288629;
static unsigned w = 88675123;
unsigned t;
t = x ^ (x << 11);
x = y;
y = z;
z = w;
return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
//}
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <int m> class mint {
private:
int i;
public:
mint() : i(0) {}
mint(int i) : i((i % m + m) % m) {}
mint operator+(const mint &o) { return o.i + i; }
mint operator*(const mint &o) { return o.i * i; }
mint operator-() { return -i; }
operator int() { return i; }
};
//}
int a, b;
main() {
cin >> a >> b;
if (a <= 5)
dump(0);
else if (a >= 13)
dump(b);
else
dump(b / 2);
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 846,917 | 846,918 | u130196064 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a, b;
cin >> a >> b;
int ans = b;
if (6 <= a || a <= 12)
ans /= 2;
if (a < 6)
ans = 0;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a, b;
cin >> a >> b;
int ans = b;
if (6 <= a && a <= 12)
ans /= 2;
if (a < 6)
ans = 0;
cout << ans << endl;
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 846,919 | 846,920 | u237022500 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> a, b;
if (a > 12) {
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, ans;
cin >> a >> b;
if (a > 12) {
ans = b;
} else if (a >= 6 && a <= 12) {
ans = b / 2;
} else {
ans = 0;
}
cout << ans << endl;
}
| [] | 846,921 | 846,922 | u018807058 | 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 >= 6 && a < 12) {
cout << b / 2 << endl;
}
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;
}
if (a >= 6 && a <= 12) {
cout << b / 2 << endl;
}
if (a <= 5) {
cout << "0" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,942 | 846,943 | u572559885 | 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 >= 6 && a < 12) {
cout << b / 2 << endl;
}
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;
}
if (a >= 6 && a <= 12) {
cout << b / 2 << endl;
}
if (a <= 5) {
cout << "0" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,944 | 846,943 | u572559885 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B;
} else if (6 <= A <= 12) {
cout << B / 2;
} else {
cout << 0;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B;
} else if (6 <= A && A <= 12) {
cout << B / 2;
} else {
cout << 0;
}
}
| [
"control_flow.branch.if.condition.change"
] | 846,970 | 846,971 | u447604786 | cpp |
p03035 | #include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std; //このネームスペースを使う
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 << B * 0 << endl;
}
return 0;
}
| #include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std; //このネームスペースを使う
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 << B * 0 << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,972 | 846,973 | u040883309 | cpp |
p03035 | #include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std; //このネームスペースを使う
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 << B * 0 << endl;
}
return 0;
}
| #include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std; //このネームスペースを使う
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 << B * 0 << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 846,974 | 846,973 | u040883309 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a > 6 && a < 13) {
cout << b / 2 << endl;
} else {
cout << '0' << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 && a < 13) {
cout << b / 2 << endl;
} else {
cout << '0' << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,988 | 846,989 | u304517780 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 13) {
cout << b;
} else if (12 >= a && a > 6) {
cout << b / 2;
} else {
cout << 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b;
} else if (12 >= a && a >= 6) {
cout << b / 2;
} else {
cout << 0;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,999 | 847,000 | u318027064 | cpp |
p03035 | #include <iostream>
using namespace std;
main() {
int a, b, ans;
cin >> a >> b;
if (a >= 13) {
ans = b;
} else if (a < 12 && a >= 6) {
ans = b / 2;
} else {
ans = 0;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
main() {
int a, b, ans;
cin >> a >> b;
if (a >= 13) {
ans = b;
} else if (a >= 6) {
ans = b / 2;
} else {
ans = 0;
}
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 847,014 | 847,015 | u703537155 | cpp |
p03035 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#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 <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#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,016 | 847,017 | u374765578 | cpp |
p03035 | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d%d", &a, &b);
if (a >= 13)
printf("%d\n", b);
else if (a >= 6)
printf("%d\n", b / 2);
else if (a >= 5)
printf("0\n");
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b;
scanf("%d%d", &a, &b);
if (a >= 13)
printf("%d\n", b);
else if (a >= 6)
printf("%d\n", b / 2);
else if (a <= 5)
printf("0\n");
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,018 | 847,019 | u177948670 | cpp |
p03035 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define shandom_ruffle random_shuffle
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001; // check the limits, dummy
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a > 4)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
}
// read the question correctly (ll vs int)
// template by super1 derived from bqi343
| #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define shandom_ruffle random_shuffle
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001; // check the limits, dummy
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
}
// read the question correctly (ll vs int)
// template by super1 derived from bqi343
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,025 | 847,026 | u422558819 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B;
else if (6 <= A <= 12)
cout << B / 2;
else
cout << '0';
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B;
else if (6 <= A && A <= 12)
cout << B / 2;
else
cout << '0';
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 847,060 | 847,061 | u164385976 | cpp |
p03035 | #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
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;
}
// INT_MAX 2,147,483,647 = 2*1.0e9
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
if (A > 12)
ans = B;
else if (A > 6)
ans = B / 2;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
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;
}
// INT_MAX 2,147,483,647 = 2*1.0e9
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
if (A >= 13)
ans = B;
else if (A >= 6)
ans = B / 2;
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,083 | 847,084 | u561443723 | cpp |
p03035 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 6)
cout << 0 << endl;
else if (A <= 12)
cout << B / 2 << endl;
else
cout << B << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < 6)
cout << 0 << endl;
else if (A <= 12)
cout << B / 2 << endl;
else
cout << B << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,085 | 847,086 | u041662998 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B;
}
else if (6 <= A <= 12) {
cout << B / 2;
}
else {
cout << 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B;
}
else if (6 <= A && A <= 12) {
cout << B / 2;
}
else {
cout << 0;
}
} | [
"control_flow.branch.if.condition.change"
] | 847,087 | 847,088 | u677149659 | 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 or A <= 12) {
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 (6 <= A and A <= 12) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 847,119 | 847,120 | u263715385 | 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;
if (a <= 12 && a >= 6)
ans = b / 2;
if (a < 5)
ans = 0;
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a >= 13)
ans = b;
if (a <= 12 && a >= 6)
ans = b / 2;
if (a < 5)
ans = 0;
cout << ans;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,174 | 847,175 | u249546633 | 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;
if (a <= 12 && a >= 6)
ans = b / 2;
if (a < 5)
ans = 0;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a >= 13)
ans = b;
if (a <= 12 && a >= 6)
ans = b / 2;
if (a < 5)
ans = 0;
cout << ans;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,176 | 847,175 | u249546633 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
printf("0\n");
else if (a > 12)
printf("%d\n", b);
else
printf("%d/2\n", b);
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
printf("0\n");
else if (a > 12)
printf("%d\n", b);
else
printf("%d\n", b / 2);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 847,179 | 847,180 | u981451025 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
printf("0\n");
else if (a > 12)
printf("%d/2\n", b);
else
printf("%d\n", b);
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
printf("0\n");
else if (a > 12)
printf("%d\n", b);
else
printf("%d\n", b / 2);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 847,181 | 847,180 | u981451025 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
printf("0\n");
else if (a > 12)
printf("%d/2\n", &b);
else
printf("%d\n", &b);
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
printf("0\n");
else if (a > 12)
printf("%d\n", b);
else
printf("%d\n", b / 2);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 847,182 | 847,180 | u981451025 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
printf("0\n");
else if (a > 12)
printf("%d\n", &b);
else
printf("%d/2\n", &b);
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
printf("0\n");
else if (a > 12)
printf("%d\n", b);
else
printf("%d\n", b / 2);
} | [
"call.arguments.change",
"literal.string.change",
"io.output.change"
] | 847,183 | 847,180 | u981451025 | cpp |
p03035 | #include <iostream>
int main() {
int A;
int B;
std::cin >> A;
std::cin >> B;
std::cout << (A >= 13) ? B : ((A >= 6) ? B / 2 : 0);
} | #include <iostream>
int main() {
int A;
int B;
std::cin >> A;
std::cin >> B;
std::cout << ((A >= 13) ? B : (A >= 6) ? (B / 2) : 0);
}
| [] | 847,198 | 847,199 | u425547861 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
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;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
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,206 | 847,207 | u773916255 | cpp |
p03035 | #include <stdio.h>
int main(void) {
int a, b, ret;
ret = scanf("%d %d", &a, &b);
if (b >= 13) {
printf("%d\n", b);
} else if (b >= 6 && b <= 12) {
printf("%d\n", b / 2);
} else {
printf("0\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, ret;
ret = scanf("%d %d", &a, &b);
if (a >= 13) {
printf("%d\n", b);
} else if (a >= 6 && a <= 12) {
printf("%d\n", b / 2);
} else {
printf("0\n");
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 847,226 | 847,227 | u106524514 | cpp |
p03035 | #include <iostream>
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 <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B << endl;
else if (6 <= A)
cout << B / 2 << endl;
else
cout << 0 << endl;
}
| [
"expression.operation.binary.remove"
] | 847,243 | 847,244 | u532401120 | cpp |
p03035 | #include <iostream>
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 <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B << endl;
else if (6 <= A)
cout << B / 2 << endl;
else
cout << 0 << endl;
}
| [
"expression.operation.binary.remove"
] | 847,245 | 847,244 | u532401120 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (b <= 12 && b >= 6)
cout << b / 2;
else
cout << "0";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a <= 12 && a >= 6)
cout << b / 2;
else
cout << "0";
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 847,246 | 847,247 | u409343817 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (b <= 12 && b >= 5)
cout << b / 2;
else
cout << "0";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a <= 12 && a >= 6)
cout << b / 2;
else
cout << "0";
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 847,248 | 847,247 | u409343817 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin >> A;
if (A >= 13)
cout << B << endl;
if (A < 13 && A >= 6)
cout << B / 2 << endl;
if (A < 6)
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin >> A;
cin >> B;
if (A >= 13)
cout << B << endl;
if (A < 13 && A >= 6)
cout << B / 2 << endl;
if (A < 6)
cout << 0 << endl;
} | [] | 847,251 | 847,252 | u783598783 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int age, charge, hisCharge;
cin >> age >> charge;
if (age >= 13) {
hisCharge = charge;
} else if (age <= 12 || age >= 6) {
hisCharge = charge / 2;
} else if (age <= 5) {
hisCharge = 0;
}
cout << hisCharge << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int age, charge, hisCharge;
cin >> age >> charge;
if (age >= 13) {
hisCharge = charge;
} else if (age <= 12 && age >= 6) {
hisCharge = charge / 2;
} else if (age <= 5) {
hisCharge = 0;
}
cout << hisCharge << endl;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 847,253 | 847,254 | u657465456 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int age, charge, hisCharge;
cin >> age >> charge;
if (age >= 13) {
hisCharge = charge;
} else if (age <= 12 || age >= 6) {
hisCharge = charge / 2;
} else if (age <= 6) {
hisCharge = 0;
}
cout << hisCharge << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int age, charge, hisCharge;
cin >> age >> charge;
if (age >= 13) {
hisCharge = charge;
} else if (age <= 12 && age >= 6) {
hisCharge = charge / 2;
} else if (age <= 5) {
hisCharge = 0;
}
cout << hisCharge << endl;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 847,256 | 847,254 | u657465456 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == 0)
cout << "0" << endl;
else if (A >= 13)
cout << B << endl;
else
cout << B / 2 << endl;
} | #include <iostream>
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;
} | [] | 847,259 | 847,260 | u771266615 | cpp |
p03035 | /*
* omg.cpp
*
* Created on: 2019/06/03
* Author: J01003
*/
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> a >> b;
if (a > 12) {
cout << b << endl;
} else if (a > 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| /*
* omg.cpp
*
* Created on: 2019/06/03
* Author: J01003
*/
#include <iostream>
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;
}
return 0;
}
| [
"variable_declaration.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,261 | 847,262 | u023758930 | cpp |
p03035 | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if (a >= 13) {
std::cout << b << std::endl;
} else if (a <= 5) {
std::cout << b / 2 << std::endl;
} else {
std::cout << 0 << std::endl;
}
} | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if (a >= 13) {
std::cout << b << std::endl;
} else if (a <= 5) {
std::cout << 0 << std::endl;
} else {
std::cout << b / 2 << std::endl;
}
} | [
"control_flow.branch.else.add"
] | 847,263 | 847,264 | u702008643 | cpp |
p03035 | #include <iostream>
using namespace std;
int A;
int B;
int ans;
int main() {
cin >> A;
cin >> B;
if (A >= 13) {
ans = B;
}
if (A <= 12) {
if (A >= 7) {
ans = B / 2;
}
if (A <= 6) {
ans = 0;
}
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int A;
int B;
int ans;
int main() {
cin >> A;
cin >> B;
if (A >= 13) {
ans = B;
}
if (A <= 12) {
if (A >= 6) {
ans = B / 2;
}
if (A <= 5) {
ans = 0;
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,272 | 847,273 | u268314747 | cpp |
p03035 | #include <iostream>
using namespace std;
int A;
int B;
int ans;
int main() {
cin >> A;
cin >> B;
if (A >= 13) {
ans = B;
}
if (A <= 12) {
if (A >= 7) {
ans = B / 2;
}
if (A >= 6) {
ans = 0;
}
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int A;
int B;
int ans;
int main() {
cin >> A;
cin >> B;
if (A >= 13) {
ans = B;
}
if (A <= 12) {
if (A >= 6) {
ans = B / 2;
}
if (A <= 5) {
ans = 0;
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,274 | 847,273 | u268314747 | cpp |
p03035 | #include <iostream>
using namespace std;
int A;
int B;
int ans;
int main() {
cin >> A;
cin >> B;
if (A >= 13) {
ans = B;
}
if (A <= 12) {
if (A != 0) {
ans = B / 2;
}
}
if (A == 0) {
ans = 0;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int A;
int B;
int ans;
int main() {
cin >> A;
cin >> B;
if (A >= 13) {
ans = B;
}
if (A <= 12) {
if (A >= 6) {
ans = B / 2;
}
if (A <= 5) {
ans = 0;
}
}
cout << ans << endl;
}
| [] | 847,275 | 847,273 | u268314747 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (A < 5) {
cout << 0 << endl;
} else {
cout << B / 2 << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (A <= 5) {
cout << 0 << endl;
} else {
cout << B / 2 << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,304 | 847,305 | u910219223 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b;
} else if (a <= 12 && b >= 6) {
cout << b / 2;
} else {
cout << 0;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b;
} else if (a <= 12 && a >= 6) {
cout << b / 2;
} else {
cout << 0;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 847,317 | 847,318 | u509420256 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int price;
if (A > 13) {
price = B;
} else if (A < 5) {
price = 0;
} else {
price = B / 2;
}
cout << price << endl;
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int price;
if (A >= 13) {
price = B;
} else if (A <= 5) {
price = 0;
} else {
price = B / 2;
}
cout << price << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,324 | 847,323 | u991381137 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << a;
else if (a >= 6)
cout << a / 2;
else
cout << "0";
cout << "\n";
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a >= 6)
cout << b / 2;
else
cout << "0";
cout << "\n";
} | [
"identifier.change",
"io.output.change"
] | 847,344 | 847,345 | u299345923 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0;
} else if (a <= 6) {
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 <= 12) {
cout << b / 2;
} else {
cout << b;
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,356 | 847,357 | u308643604 | cpp |
p03035 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a, 0, sizeof(a))
#define inf (1ll << 60)
#define Yes(f) \
cout << (f ? "Yes" : "No") << endl // fが真の場合Yesを出力、偽の場合Noを出力
#define yes(f) cout << (f ? "yes" : "no") << endl
#define YES(f) cout << (f ? "YES" : "NO") << endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
using namespace std;
const int mod = 1e9 + 7;
signed main() {
int a, b;
cin >> a >> b;
int ans;
if (a < 12)
ans = b;
else if (5 < a && a <= 12)
ans = b / 2;
else
ans = 0;
cout << ans << endl;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a, 0, sizeof(a))
#define inf (1ll << 60)
#define Yes(f) \
cout << (f ? "Yes" : "No") << endl // fが真の場合Yesを出力、偽の場合Noを出力
#define yes(f) cout << (f ? "yes" : "no") << endl
#define YES(f) cout << (f ? "YES" : "NO") << endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
using namespace std;
const int mod = 1e9 + 7;
signed main() {
int a, b;
cin >> a >> b;
int ans;
if (12 < a)
ans = b;
else if (5 < a && a <= 12)
ans = b / 2;
else
ans = 0;
cout << ans << endl;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 847,362 | 847,363 | u775507068 | cpp |
p03035 | #include <bits/stdc++.h>
int main() {
int a, b, ans = 0;
scanf("%d %d", &a, &b);
if (a >= 13) {
ans = b;
} else if (a >= 5) {
ans = b >> 1;
}
printf("%d\n", ans);
}
| #include <bits/stdc++.h>
int main() {
int a, b, ans = 0;
scanf("%d %d", &a, &b);
if (a >= 13) {
ans = b;
} else if (a >= 6) {
ans = b >> 1;
}
printf("%d\n", ans);
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,382 | 847,383 | u738532317 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int a, b;
void Enter() { cin >> a >> b; }
void Solve() {
if (a <= 5)
cout < 0;
else if (6 <= a && a <= 12)
cout << b / 2;
else
cout << b;
}
int main() {
Enter();
Solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a, b;
void Enter() { cin >> a >> b; }
void Solve() {
if (a <= 5)
cout << 0;
else if (6 <= a && a <= 12)
cout << b / 2;
else
cout << b;
}
int main() {
Enter();
Solve();
return 0;
}
| [
"io.output.change"
] | 847,404 | 847,405 | u495673021 | cpp |
p03035 | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a <= 5)
cout << 0;
if (a >= 6 && a <= 12)
cout << b / 2;
else
cout << b;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a <= 5)
cout << 0;
else if (a >= 6 && a <= 12)
cout << b / 2;
else
cout << b;
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 847,412 | 847,413 | u869759633 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b;
} else if (a < 5) {
cout << 0;
} else {
cout << b / 2;
}
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b;
} else if (a < 6) {
cout << 0;
} else {
cout << b / 2;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 847,420 | 847,421 | u687204015 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
main() {
int A, B, money;
cin >> A >> B;
if (A >= 13) {
money = B;
}
if (12 >= A && A >= 6) {
money = B / 2;
} else
money = 0;
cout << money << endl;
} | #include <bits/stdc++.h>
using namespace std;
main() {
int A, B, money;
cin >> A >> B;
if (A >= 13) {
money = B;
} else if (12 >= A && A >= 6) {
money = B / 2;
} else
money = 0;
cout << money << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 847,426 | 847,427 | u076426414 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
main() {
int A, B, money;
cin >> A >> B;
if (A >= 13) {
money = B;
}
if (12 >= A || A >= 6) {
money = B / 2;
} else
money = 0;
cout << money << endl;
} | #include <bits/stdc++.h>
using namespace std;
main() {
int A, B, money;
cin >> A >> B;
if (A >= 13) {
money = B;
} else if (12 >= A && A >= 6) {
money = B / 2;
} else
money = 0;
cout << money << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 847,428 | 847,427 | u076426414 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cout << #x << ": " << x << endl
#define repn(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, a) for (int i = 0; i < (a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define endl '\n'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen("input.in", "r", stdin);
// freopen("output.out", "w", stdout);
int a, b;
cin >> a >> b;
if (a >= b)
cout << b << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
return 0;
}
/*
Things to look out for:
- Integer overflows
- Array bounds
- Special cases
Be careful!
*/
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cout << #x << ": " << x << endl
#define repn(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, a) for (int i = 0; i < (a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define endl '\n'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen("input.in", "r", stdin);
// freopen("output.out", "w", stdout);
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
return 0;
}
/*
Things to look out for:
- Integer overflows
- Array bounds
- Special cases
Be careful!
*/
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 847,451 | 847,452 | u626595726 | 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 (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 > 12) {
cout << B << endl;
} else if (12 >= A && A >= 6) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 847,464 | 847,465 | u801530021 | cpp |
p03035 | #include <bits/stdc++.h>
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 <= 6) {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
}
if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
}
if (A < 6) {
cout << 0 << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 847,510 | 847,511 | u493005987 | cpp |
p03035 | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------------------
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i > n; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, m) RFOR(i, m, 0)
// container util
//------------------------------------------
#define pb(a) push_back(a)
#define fst first
#define snd second
#define SORT(V) sort((V).begin(), (V).end())
#define REV(V) reverse((V).begin(), (V).end())
// constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// grobal variable
//------------------------------------------
// def function, class
//------------------------------------------
// main
//------------------------------------------
signed main() {
int A, B;
cin >> A >> B;
if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
} else if (B <= 5) {
cout << 0 << endl;
} else {
cout << B << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------------------
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i > n; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, m) RFOR(i, m, 0)
// container util
//------------------------------------------
#define pb(a) push_back(a)
#define fst first
#define snd second
#define SORT(V) sort((V).begin(), (V).end())
#define REV(V) reverse((V).begin(), (V).end())
// constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// grobal variable
//------------------------------------------
// def function, class
//------------------------------------------
// main
//------------------------------------------
signed main() {
int A, B;
cin >> A >> B;
if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
} else if (A <= 5) {
cout << 0 << endl;
} else {
cout << B << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 847,514 | 847,515 | u055131803 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
double pi = 3.141592653589793;
ll mod = 1000000007;
ll INF = 1000000001;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
}
if (a <= 5) {
cout << 0 << endl;
} else {
cout << b / 2 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
double pi = 3.141592653589793;
ll mod = 1000000007;
ll INF = 1000000001;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a <= 5) {
cout << 0 << endl;
} else {
cout << b / 2 << endl;
}
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 847,530 | 847,531 | u033602950 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<char, char> pcc;
#define ZP(a, len) setfill('0') << setw(len) << right << a
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const ll LINF = 1e11;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
void solve() {
int a, b;
cin >> a >> b;
if (13 >= a) {
cout << b << "\n";
} else if (6 >= a) {
cout << b / 2 << "\n";
} else {
cout << 0 << "\n";
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<char, char> pcc;
#define ZP(a, len) setfill('0') << setw(len) << right << a
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const ll LINF = 1e11;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
void solve() {
int a, b;
cin >> a >> b;
if (13 <= a) {
cout << b << "\n";
} else if (6 <= a) {
cout << b / 2 << "\n";
} else {
cout << 0 << "\n";
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,561 | 847,562 | u159619403 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int age, yen;
cin >> age >> yen;
if (age >= 13)
cout << age * yen << endl;
else if ((age >= 6) && (age <= 12))
cout << (age * yen) / 2 << endl;
else
cout << "0" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int age, yen;
cin >> age >> yen;
if (age >= 13)
cout << yen << endl;
else if ((age >= 6) && (age <= 12))
cout << yen / 2 << endl;
else
cout << "0" << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 847,567 | 847,568 | u953753178 | cpp |
p03035 | // https://atcoder.jp/contests/abc127/tasks/abc127_a
#include <bits/stdc++.h>
using namespace std;
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;
}
| // https://atcoder.jp/contests/abc127/tasks/abc127_a
#include <bits/stdc++.h>
using namespace std;
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;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 847,571 | 847,572 | u729751480 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.