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>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B << endl;
if (6 <= A && A < 13)
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;
if (6 <= A && A < 13)
cout << B / 2 << endl;
if (A < 6)
cout << 0 << endl;
} | [
"control_flow.branch.if.condition.change"
] | 845,812 | 845,813 | u372622736 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
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;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
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"
] | 845,814 | 845,815 | u985524697 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) std::cout << "☆" << x << endl
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#define check(x) \
if (false) \
cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) \
if (false) \
cout << "☆" << x << endl
#endif
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b;
} else if (a > 6) {
cout << b / 2;
} else {
cout << 0;
}
return 0;
}
/*
//よく使うやつ
int N;
cin >> N;
vector<int> list(N);
for (int i = 0; i < N; i++) {
cin >> list[i];
}
// for文
for (int i = 0; i < N; i++) {
}
//配列
vector<int> list;
list.at(i)
vector<vector<int>> list(10, vector<int>(10));
sort(all(list));
sort(all(list), greater<int>());
//配列の内容表示
dout << "====listの内容====\n";
for (int i = 0; i < N; i++) dout << list[i] << endl;
dout << "====ここまで====\n";
*/
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) std::cout << "☆" << x << endl
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#define check(x) \
if (false) \
cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) \
if (false) \
cout << "☆" << x << endl
#endif
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b;
} else if (a > 5) {
cout << b / 2;
} else {
cout << 0;
}
return 0;
}
/*
//よく使うやつ
int N;
cin >> N;
vector<int> list(N);
for (int i = 0; i < N; i++) {
cin >> list[i];
}
// for文
for (int i = 0; i < N; i++) {
}
//配列
vector<int> list;
list.at(i)
vector<vector<int>> list(10, vector<int>(10));
sort(all(list));
sort(all(list), greater<int>());
//配列の内容表示
dout << "====listの内容====\n";
for (int i = 0; i < N; i++) dout << list[i] << endl;
dout << "====ここまで====\n";
*/
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,822 | 845,823 | u043964516 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A;
cin >> B;
if (A < 5) {
cout << 0;
} else if (A < 12) {
cout << B / 2;
} else {
cout << B;
}
}
| #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A;
cin >> B;
if (A <= 5) {
cout << 0;
} else if (A <= 12) {
cout << B / 2;
} else {
cout << B;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,834 | 845,835 | u010415482 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
cout << 0;
} else if (6 <= A <= 12) {
cout << B / 2;
} else if (13 <= A) {
cout << B;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
cout << 0;
} else if (6 <= A and A <= 12) {
cout << B / 2;
} else if (13 <= A) {
cout << B;
}
}
| [
"control_flow.branch.if.condition.change"
] | 845,843 | 845,844 | u574687269 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < 6) {
cout << 0;
}
if (A < 13) {
cout << B / 2;
} else {
cout << B;
}
} | #include <bits/stdc++.h>
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;
}
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,852 | 845,853 | u168017191 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG // GCC5.4.1で配列の範囲外アクセスをエラーにする
// cmdで g++ test.cpp とするとコンパイルできる
//制限1秒なら10^6は余裕 10^7は多分間に合う 10^8はよほど単純でないと厳しい
#define ALL(x) x.begin(), x.end()
typedef long long ll; // long long
typedef pair<int, int> pii; // pair<int,int>
typedef vector<int> vi; // vector<int>
typedef vector<vector<int>> vvi; // vector<vector<int>>
typedef vector<ll> vll; // vector<long long>
typedef vector<vector<ll>> vvll; // vector<vector<long long>>
// const int MOD=998244353;
const int MOD = 1000000007; // 10^9+7
const double PI = 3.1415926535;
int main() {
int A, B;
cin >> A >> B;
if (B <= 5) {
cout << 0 << endl;
} else if (6 <= B && B <= 12) {
cout << A / 2 << endl;
} else {
cout << A << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG // GCC5.4.1で配列の範囲外アクセスをエラーにする
// cmdで g++ test.cpp とするとコンパイルできる
//制限1秒なら10^6は余裕 10^7は多分間に合う 10^8はよほど単純でないと厳しい
#define ALL(x) x.begin(), x.end()
typedef long long ll; // long long
typedef pair<int, int> pii; // pair<int,int>
typedef vector<int> vi; // vector<int>
typedef vector<vector<int>> vvi; // vector<vector<int>>
typedef vector<ll> vll; // vector<long long>
typedef vector<vector<ll>> vvll; // vector<vector<long long>>
// const int MOD=998244353;
const int MOD = 1000000007; // 10^9+7
const double PI = 3.1415926535;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
cout << 0 << endl;
} else if (6 <= A && A <= 12) {
cout << B / 2 << endl;
} else {
cout << B << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 845,854 | 845,855 | u783255320 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (lli i = s; i < n; i++)
#define RREP(i, s, n) for (lli i = s; i >= n; i--)
#define MOD 1000000007
#define NUM 2520
#define DEBUG 1
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define INF (1LL << 50)
signed main() {
lli a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (lli i = s; i < n; i++)
#define RREP(i, s, n) for (lli i = s; i >= n; i--)
#define MOD 1000000007
#define NUM 2520
#define DEBUG 1
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define INF (1LL << 50)
signed main() {
lli 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"
] | 845,866 | 845,867 | u041513069 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a < 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,870 | 845,871 | u754114382 | cpp |
p03035 | #include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, s, n) for (i64 i = (s), i##_limit = (n); i < i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#define VAR(type, ...) \
type __VA_ARGS__; \
read(__VA_ARGS__);
#ifndef DBG
#define dump(...)
#endif
using namespace std;
using i64 = int_fast64_t;
using pii = pair<i64, i64>;
template <class T, class U> inline bool chmax(T &a, const U &b) {
return b > a && (a = b, true);
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return b < a && (a = b, true);
}
constexpr int INF = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;
template <class T> inline vector<T> makeV(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto makeV(const T &initValue, size_t sz, Args... args) {
return vector<decltype(makeV<T>(initValue, args...))>(
sz, makeV<T>(initValue, args...));
}
template <class T> inline istream &operator>>(istream &is, vector<T> &vec) {
for (auto &e : vec)
is >> e;
return is;
}
inline void read() {}
template <class Head, class... Tail>
inline void read(Head &head, Tail &...tail) {
cin >> head;
read(tail...);
}
inline void print() { cout << "\n"; }
template <class Head, class... Tail>
inline void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail))
cout << ' ';
print(forward<Tail>(tail)...);
}
template <class T>
inline ostream &operator<<(ostream &os, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e : vec)
os << e << delim[&e == &vec.back()];
return os;
}
// }}} End Header
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
VAR(int, a, b);
if (a < 5) {
print(0);
} else if (a >= 6 && a <= 12) {
print(b / 2);
} else {
print(b);
}
return 0;
}
| #include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, s, n) for (i64 i = (s), i##_limit = (n); i < i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#define VAR(type, ...) \
type __VA_ARGS__; \
read(__VA_ARGS__);
#ifndef DBG
#define dump(...)
#endif
using namespace std;
using i64 = int_fast64_t;
using pii = pair<i64, i64>;
template <class T, class U> inline bool chmax(T &a, const U &b) {
return b > a && (a = b, true);
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return b < a && (a = b, true);
}
constexpr int INF = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;
template <class T> inline vector<T> makeV(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto makeV(const T &initValue, size_t sz, Args... args) {
return vector<decltype(makeV<T>(initValue, args...))>(
sz, makeV<T>(initValue, args...));
}
template <class T> inline istream &operator>>(istream &is, vector<T> &vec) {
for (auto &e : vec)
is >> e;
return is;
}
inline void read() {}
template <class Head, class... Tail>
inline void read(Head &head, Tail &...tail) {
cin >> head;
read(tail...);
}
inline void print() { cout << "\n"; }
template <class Head, class... Tail>
inline void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail))
cout << ' ';
print(forward<Tail>(tail)...);
}
template <class T>
inline ostream &operator<<(ostream &os, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e : vec)
os << e << delim[&e == &vec.back()];
return os;
}
// }}} End Header
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
VAR(int, a, b);
if (a <= 5) {
print(0);
} else if (a >= 6 && a <= 12) {
print(b / 2);
} else {
print(b);
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,878 | 845,879 | u897304429 | 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 >= 5)
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 > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,880 | 845,881 | u540724932 | cpp |
p03035 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#define _SILENCE_CXX17_RESULT_OF_DEPRECATION_WARNING
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)
using namespace std;
using LL = long long;
using ld = long double;
using VB = vector<bool>;
using VVB = vector<VB>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VS = vector<string>;
using VD = vector<double>;
using PII = pair<int, int>;
using VP = vector<PII>;
using PLL = pair<LL, LL>;
using VPL = vector<PLL>;
template <class T> using Grid = vector<vector<T>>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr LL inf_ll = (LL)1e18, MOD = 1000000007;
constexpr ld PI = M_PI, EPS = 1e-12;
template <class T> inline void Sort(T &a) noexcept { sort(all(a)); }
template <class T> inline void RSort(T &a) noexcept { sort(rall(a)); }
template <class T> inline void Reverse(T &a) noexcept { reverse(all(a)); }
template <class T> inline void Unique(T &a) noexcept {
a.erase(unique(all(a)), a.end());
}
template <class T> inline T Sorted(T a) noexcept {
Sort(a);
return a;
}
template <class T> inline T RSorted(T a) noexcept {
RSort(a);
return a;
}
template <class T> inline T Reversed(T a) noexcept {
Reverse(a);
return a;
}
template <class T> inline T Uniqued(T a) noexcept {
Unique(a);
return a;
}
template <class T> inline auto Max(const T &a) noexcept {
return *max_element(all(a));
}
template <class T> inline auto Min(const T &a) noexcept {
return *min_element(all(a));
}
template <class T> inline int MaxPos(const T &a) noexcept {
return max_element(all(a)) - a.begin();
}
template <class T> inline int MinPos(const T &a) noexcept {
return min_element(all(a)) - a.begin();
}
template <class T, class U> inline int Count(const T &a, const U &v) noexcept {
return count(all(a), v);
}
template <class T, class U> inline int Find(const T &a, const U &v) noexcept {
return find(all(a), v) - a.begin();
}
template <class T, class U> inline U Sum(const T &a, const U &v) noexcept {
return accumulate(all(a), v);
}
template <class T, class U> inline int Lower(const T &a, const U &v) noexcept {
return lower_bound(all(a), v) - a.begin();
}
template <class T, class U> inline int Upper(const T &a, const U &v) noexcept {
return upper_bound(all(a), v) - a.begin();
}
template <class T, class P> inline void RemoveIf(T &a, P f) noexcept {
a.erase(remove_if(all(a), f), a.end());
}
template <class T> inline T Age(T n, T m) noexcept { return (n + m - 1) / m; }
template <class T> inline T Age2(T n, T m) noexcept { return Age(n, m) * m; }
template <class T> inline T Tri(T n) noexcept {
return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
}
template <class T = long long> inline T BIT(int b) noexcept {
return T{1} << b;
}
template <class T> inline T Gcd(T n, T m) noexcept {
return m ? Gcd(m, n % m) : n;
}
template <class T> inline T Lcm(T n, T m) noexcept { return n / Gcd(n, m) * m; }
template <class T, class U = typename T::value_type>
inline U Gcd2(const T &v) noexcept {
return accumulate(next(v.begin()), v.end(), U(*v.begin()), Gcd<U>);
}
template <class T, class U = typename T::value_type>
inline U Lcm2(const T &v) noexcept {
return accumulate(next(v.begin()), v.end(), U(*v.begin()), Lcm<U>);
}
template <class T> inline T Pow(T a, T n) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r *= a;
a *= a;
n /= 2;
}
return r;
}
template <class T> inline T Powmod(T a, T n, T m = MOD) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r = r * a % m, n--;
else
a = a * a % m, n /= 2;
}
return r;
}
template <class T> inline bool chmax(T &a, const T &b) noexcept {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) noexcept {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool inRange(const T &v, const T &min, const T &max) noexcept {
return min <= v && v <= max;
}
inline string operator*(string s, int n) noexcept {
string ret;
rep(i, n) ret += s;
return ret;
}
// --- input --- //
#if defined(_WIN32) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
inline int gc() noexcept { return getchar_unlocked(); }
template <class T> inline void InputF(T &v) noexcept { cin >> v; }
inline void InputF(char &v) noexcept {
while (isspace(v = gc()))
;
}
inline void InputF(bool &v) noexcept {
char c;
InputF(c);
v = c == '1';
}
inline void InputF(string &v) noexcept {
char c;
for (InputF(c); !isspace(c); c = gc())
v += c;
}
inline void InputF(int &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(long long &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(double &v) noexcept {
double dp = 1;
bool neg = false, adp = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c) || c == '.'; c = gc()) {
if (c == '.')
adp = true;
else if (adp)
v += (c - '0') * (dp *= 0.1);
else
v = v * 10 + (c - '0');
}
if (neg)
v = -v;
}
template <class T, class U> inline void InputF(pair<T, U> &v) noexcept {
InputF(v.first);
InputF(v.second);
}
template <class T> inline void InputF(vector<T> &v) noexcept {
for (auto &e : v)
InputF(e);
}
template <class T> inline T InputF() {
T v;
InputF(v);
return v;
}
struct InputV {
int n, m;
InputV(int N) : n(N), m(0) {}
InputV(pair<int, int> N) : n(N.first), m(N.second) {}
template <class T> operator vector<T>() noexcept {
vector<T> v(n);
InputF(v);
return v;
}
template <class T> operator vector<vector<T>>() noexcept {
vector<vector<T>> v(n, vector<T>(m));
InputF(v);
return v;
}
};
struct Input {
template <class T> operator T() noexcept { return InputF<T>(); }
int operator--(int) {
int v;
InputF(v);
v--;
return v;
}
InputV operator[](int n) noexcept { return InputV(n); }
InputV operator[](pair<int, int> n) noexcept { return InputV(n); }
void operator()() {}
template <class H, class... T> void operator()(H &&h, T &&...t) {
InputF(h);
operator()(forward<T>(t)...);
}
template <class T, size_t W> array<vector<T>, W> get(int H) {
array<vector<T>, W> ret;
for (int i = 0; i < H; ++i)
for (int j = 0; j < W; ++j)
ret[j].push_back(InputF<T>());
return ret;
}
} in;
#define input(type) InputF<type>()
// --- output --- //
struct BoolStr {
const char *t, *f;
BoolStr(const char *_t, const char *_f) : t(_t), f(_f) {}
} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
const char *d, *l;
DivStr(const char *_d, const char *_l) : d(_d), l(_l) {}
} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"),
no_endl(" ", "");
class Output {
BoolStr B{Yes};
DivStr D{spc};
bool isPrint = true;
void p(double v) { printf("%.20f", v); }
void p(long double v) { printf("%.20Lf", v); }
void p(int v) { printf("%d", v); }
void p(LL v) { printf("%lld", v); }
void p(char v) { putchar(v); }
void p(bool v) { printf("%s", v ? B.t : B.f); }
template <class T> void p(const T &v) { cout << v; }
template <class T, class U> void p(const pair<T, U> &v) {
p(v.first);
printf("%s", D.d);
p(v.second);
}
template <class T> void p(const vector<T> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.d);
p(v[i]);
}
}
template <class T> void p(const vector<vector<T>> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.l);
p(v[i]);
}
}
void p(const BoolStr &v) {
B = v;
isPrint = false;
}
void p(const DivStr &v) {
D = v;
isPrint = false;
}
public:
Output &operator()() {
printf("%s", D.l);
return *this;
}
template <class H> Output &operator()(H &&h) {
p(h);
if (isPrint)
printf("%s", D.l);
isPrint = true;
return *this;
}
template <class H, class... T> Output &operator()(H &&h, T &&...t) {
p(h);
if (isPrint)
printf("%s", D.d);
isPrint = true;
return operator()(forward<T>(t)...);
}
template <class... T> void exit(T &&...t) {
operator()(forward<T>(t)...);
std::exit(EXIT_SUCCESS);
}
Output &flush() {
cout.flush();
return *this;
}
Output &set_bs(const char *t, const char *f) {
B = BoolStr(t, f);
return *this;
}
} out;
// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) (void(0))
#endif
template <class T> struct Step {
class It {
T a, b, c;
public:
constexpr It() : a(T()), b(T()), c(T()) {}
constexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {}
constexpr It &operator++() {
--b;
a += c;
return *this;
}
constexpr It operator++(int) {
It tmp = *this;
--b;
a += c;
return tmp;
}
constexpr const T &operator*() const { return a; }
constexpr const T *operator->() const { return &a; }
constexpr bool operator==(const It &other) const { return b == other.b; }
constexpr bool operator!=(const It &other) const { return !(b == other.b); }
constexpr T start() const { return a; }
constexpr T count() const { return b; }
constexpr T step() const { return c; }
};
constexpr Step(T b, T c, T s) : be(b, c, s) {}
constexpr It begin() const { return be; }
constexpr It end() const { return en; }
constexpr T start() const { return be.start(); }
constexpr T count() const { return be.count(); }
constexpr T step() const { return be.step(); }
operator vector<T>() const { return as_vector(); }
vector<T> as_vector() const {
vector<T> res;
res.reserve(count());
each([&](T i) { res.push_back(i); });
return res;
}
template <class F> void each(F f) const {
for (T i : *this)
f(i);
}
template <class F> auto map(F f) const {
vector<decay_t<result_of_t<F(T)>>> res;
res.reserve(count());
each([&](T i) { res.push_back(f(i)); });
return res;
}
template <class F> int count_if(F f) const {
int res = 0;
each([&](T i) { i += f(i); });
return res;
}
template <class F> vector<T> select(F f) const {
vector<T> res;
each([&](T i) {
if (f(i))
res.push_back(i);
});
return res;
}
template <class F> auto sum(F f) const {
decay_t<result_of_t<F(T)>> res = 0;
each([&](T i) { res += f(i); });
return res;
}
using value_type = T;
using iterator = It;
private:
It be, en;
};
template <class T> inline constexpr auto step(T a) { return Step<T>(0, a, 1); }
template <class T> inline constexpr auto step(T a, T b) {
return Step<T>(a, b - a, 1);
}
template <class T> inline constexpr auto step(T a, T b, T c) {
return Step<T>(a, (b - a - 1) / c + 1, c);
}
template <class F> auto MakeVector(size_t size, F f) {
vector<decay_t<result_of_t<F(size_t)>>> res(size);
for (size_t i = 0; i < size; ++i)
res[i] = f(i);
return res;
}
template <class T> T Slice(const T &v, size_t i, size_t len) {
return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size()))
: T();
}
template <class T, class F> void Each(T &v, F f) {
for (auto &e : v)
f(e);
}
template <class T, class F> auto Map(const T &v, F f) {
vector<decay_t<result_of_t<F(typename T::value_type)>>> res(v.size());
size_t i = 0;
for (const auto &e : v)
res[i++] = f(e);
return res;
}
template <class T, class F> auto MapIndex(const T &v, F f) {
vector<decay_t<result_of_t<F(size_t, typename T::value_type)>>> res(v.size());
size_t i = 0;
for (auto it = v.begin(); it != v.end(); ++it, ++i)
res[i] = f(i, *it);
return res;
}
template <class T, class F> auto Select(const T &v, F f) {
T res;
for (const auto &e : v)
if (f(e))
res.push_back(e);
return res;
}
template <class T, class F> vector<size_t> TrueIndex(const T &v, F f) {
vector<size_t> res;
size_t i = 0;
for (const auto &e : v) {
if (f(e))
res.push_back(i);
++i;
}
return res;
}
// ---------------------------------------------------------------- //
int main() {
int a = in, b = in;
if (a >= 13) {
out(b);
} else if (a >= 6) {
out(b / 10);
} else {
out(0);
}
} | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#define _SILENCE_CXX17_RESULT_OF_DEPRECATION_WARNING
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)
using namespace std;
using LL = long long;
using ld = long double;
using VB = vector<bool>;
using VVB = vector<VB>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VS = vector<string>;
using VD = vector<double>;
using PII = pair<int, int>;
using VP = vector<PII>;
using PLL = pair<LL, LL>;
using VPL = vector<PLL>;
template <class T> using Grid = vector<vector<T>>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr LL inf_ll = (LL)1e18, MOD = 1000000007;
constexpr ld PI = M_PI, EPS = 1e-12;
template <class T> inline void Sort(T &a) noexcept { sort(all(a)); }
template <class T> inline void RSort(T &a) noexcept { sort(rall(a)); }
template <class T> inline void Reverse(T &a) noexcept { reverse(all(a)); }
template <class T> inline void Unique(T &a) noexcept {
a.erase(unique(all(a)), a.end());
}
template <class T> inline T Sorted(T a) noexcept {
Sort(a);
return a;
}
template <class T> inline T RSorted(T a) noexcept {
RSort(a);
return a;
}
template <class T> inline T Reversed(T a) noexcept {
Reverse(a);
return a;
}
template <class T> inline T Uniqued(T a) noexcept {
Unique(a);
return a;
}
template <class T> inline auto Max(const T &a) noexcept {
return *max_element(all(a));
}
template <class T> inline auto Min(const T &a) noexcept {
return *min_element(all(a));
}
template <class T> inline int MaxPos(const T &a) noexcept {
return max_element(all(a)) - a.begin();
}
template <class T> inline int MinPos(const T &a) noexcept {
return min_element(all(a)) - a.begin();
}
template <class T, class U> inline int Count(const T &a, const U &v) noexcept {
return count(all(a), v);
}
template <class T, class U> inline int Find(const T &a, const U &v) noexcept {
return find(all(a), v) - a.begin();
}
template <class T, class U> inline U Sum(const T &a, const U &v) noexcept {
return accumulate(all(a), v);
}
template <class T, class U> inline int Lower(const T &a, const U &v) noexcept {
return lower_bound(all(a), v) - a.begin();
}
template <class T, class U> inline int Upper(const T &a, const U &v) noexcept {
return upper_bound(all(a), v) - a.begin();
}
template <class T, class P> inline void RemoveIf(T &a, P f) noexcept {
a.erase(remove_if(all(a), f), a.end());
}
template <class T> inline T Age(T n, T m) noexcept { return (n + m - 1) / m; }
template <class T> inline T Age2(T n, T m) noexcept { return Age(n, m) * m; }
template <class T> inline T Tri(T n) noexcept {
return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
}
template <class T = long long> inline T BIT(int b) noexcept {
return T{1} << b;
}
template <class T> inline T Gcd(T n, T m) noexcept {
return m ? Gcd(m, n % m) : n;
}
template <class T> inline T Lcm(T n, T m) noexcept { return n / Gcd(n, m) * m; }
template <class T, class U = typename T::value_type>
inline U Gcd2(const T &v) noexcept {
return accumulate(next(v.begin()), v.end(), U(*v.begin()), Gcd<U>);
}
template <class T, class U = typename T::value_type>
inline U Lcm2(const T &v) noexcept {
return accumulate(next(v.begin()), v.end(), U(*v.begin()), Lcm<U>);
}
template <class T> inline T Pow(T a, T n) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r *= a;
a *= a;
n /= 2;
}
return r;
}
template <class T> inline T Powmod(T a, T n, T m = MOD) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r = r * a % m, n--;
else
a = a * a % m, n /= 2;
}
return r;
}
template <class T> inline bool chmax(T &a, const T &b) noexcept {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) noexcept {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool inRange(const T &v, const T &min, const T &max) noexcept {
return min <= v && v <= max;
}
inline string operator*(string s, int n) noexcept {
string ret;
rep(i, n) ret += s;
return ret;
}
// --- input --- //
#if defined(_WIN32) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
inline int gc() noexcept { return getchar_unlocked(); }
template <class T> inline void InputF(T &v) noexcept { cin >> v; }
inline void InputF(char &v) noexcept {
while (isspace(v = gc()))
;
}
inline void InputF(bool &v) noexcept {
char c;
InputF(c);
v = c == '1';
}
inline void InputF(string &v) noexcept {
char c;
for (InputF(c); !isspace(c); c = gc())
v += c;
}
inline void InputF(int &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(long long &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(double &v) noexcept {
double dp = 1;
bool neg = false, adp = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c) || c == '.'; c = gc()) {
if (c == '.')
adp = true;
else if (adp)
v += (c - '0') * (dp *= 0.1);
else
v = v * 10 + (c - '0');
}
if (neg)
v = -v;
}
template <class T, class U> inline void InputF(pair<T, U> &v) noexcept {
InputF(v.first);
InputF(v.second);
}
template <class T> inline void InputF(vector<T> &v) noexcept {
for (auto &e : v)
InputF(e);
}
template <class T> inline T InputF() {
T v;
InputF(v);
return v;
}
struct InputV {
int n, m;
InputV(int N) : n(N), m(0) {}
InputV(pair<int, int> N) : n(N.first), m(N.second) {}
template <class T> operator vector<T>() noexcept {
vector<T> v(n);
InputF(v);
return v;
}
template <class T> operator vector<vector<T>>() noexcept {
vector<vector<T>> v(n, vector<T>(m));
InputF(v);
return v;
}
};
struct Input {
template <class T> operator T() noexcept { return InputF<T>(); }
int operator--(int) {
int v;
InputF(v);
v--;
return v;
}
InputV operator[](int n) noexcept { return InputV(n); }
InputV operator[](pair<int, int> n) noexcept { return InputV(n); }
void operator()() {}
template <class H, class... T> void operator()(H &&h, T &&...t) {
InputF(h);
operator()(forward<T>(t)...);
}
template <class T, size_t W> array<vector<T>, W> get(int H) {
array<vector<T>, W> ret;
for (int i = 0; i < H; ++i)
for (int j = 0; j < W; ++j)
ret[j].push_back(InputF<T>());
return ret;
}
} in;
#define input(type) InputF<type>()
// --- output --- //
struct BoolStr {
const char *t, *f;
BoolStr(const char *_t, const char *_f) : t(_t), f(_f) {}
} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
const char *d, *l;
DivStr(const char *_d, const char *_l) : d(_d), l(_l) {}
} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"),
no_endl(" ", "");
class Output {
BoolStr B{Yes};
DivStr D{spc};
bool isPrint = true;
void p(double v) { printf("%.20f", v); }
void p(long double v) { printf("%.20Lf", v); }
void p(int v) { printf("%d", v); }
void p(LL v) { printf("%lld", v); }
void p(char v) { putchar(v); }
void p(bool v) { printf("%s", v ? B.t : B.f); }
template <class T> void p(const T &v) { cout << v; }
template <class T, class U> void p(const pair<T, U> &v) {
p(v.first);
printf("%s", D.d);
p(v.second);
}
template <class T> void p(const vector<T> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.d);
p(v[i]);
}
}
template <class T> void p(const vector<vector<T>> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.l);
p(v[i]);
}
}
void p(const BoolStr &v) {
B = v;
isPrint = false;
}
void p(const DivStr &v) {
D = v;
isPrint = false;
}
public:
Output &operator()() {
printf("%s", D.l);
return *this;
}
template <class H> Output &operator()(H &&h) {
p(h);
if (isPrint)
printf("%s", D.l);
isPrint = true;
return *this;
}
template <class H, class... T> Output &operator()(H &&h, T &&...t) {
p(h);
if (isPrint)
printf("%s", D.d);
isPrint = true;
return operator()(forward<T>(t)...);
}
template <class... T> void exit(T &&...t) {
operator()(forward<T>(t)...);
std::exit(EXIT_SUCCESS);
}
Output &flush() {
cout.flush();
return *this;
}
Output &set_bs(const char *t, const char *f) {
B = BoolStr(t, f);
return *this;
}
} out;
// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) (void(0))
#endif
template <class T> struct Step {
class It {
T a, b, c;
public:
constexpr It() : a(T()), b(T()), c(T()) {}
constexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {}
constexpr It &operator++() {
--b;
a += c;
return *this;
}
constexpr It operator++(int) {
It tmp = *this;
--b;
a += c;
return tmp;
}
constexpr const T &operator*() const { return a; }
constexpr const T *operator->() const { return &a; }
constexpr bool operator==(const It &other) const { return b == other.b; }
constexpr bool operator!=(const It &other) const { return !(b == other.b); }
constexpr T start() const { return a; }
constexpr T count() const { return b; }
constexpr T step() const { return c; }
};
constexpr Step(T b, T c, T s) : be(b, c, s) {}
constexpr It begin() const { return be; }
constexpr It end() const { return en; }
constexpr T start() const { return be.start(); }
constexpr T count() const { return be.count(); }
constexpr T step() const { return be.step(); }
operator vector<T>() const { return as_vector(); }
vector<T> as_vector() const {
vector<T> res;
res.reserve(count());
each([&](T i) { res.push_back(i); });
return res;
}
template <class F> void each(F f) const {
for (T i : *this)
f(i);
}
template <class F> auto map(F f) const {
vector<decay_t<result_of_t<F(T)>>> res;
res.reserve(count());
each([&](T i) { res.push_back(f(i)); });
return res;
}
template <class F> int count_if(F f) const {
int res = 0;
each([&](T i) { i += f(i); });
return res;
}
template <class F> vector<T> select(F f) const {
vector<T> res;
each([&](T i) {
if (f(i))
res.push_back(i);
});
return res;
}
template <class F> auto sum(F f) const {
decay_t<result_of_t<F(T)>> res = 0;
each([&](T i) { res += f(i); });
return res;
}
using value_type = T;
using iterator = It;
private:
It be, en;
};
template <class T> inline constexpr auto step(T a) { return Step<T>(0, a, 1); }
template <class T> inline constexpr auto step(T a, T b) {
return Step<T>(a, b - a, 1);
}
template <class T> inline constexpr auto step(T a, T b, T c) {
return Step<T>(a, (b - a - 1) / c + 1, c);
}
template <class F> auto MakeVector(size_t size, F f) {
vector<decay_t<result_of_t<F(size_t)>>> res(size);
for (size_t i = 0; i < size; ++i)
res[i] = f(i);
return res;
}
template <class T> T Slice(const T &v, size_t i, size_t len) {
return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size()))
: T();
}
template <class T, class F> void Each(T &v, F f) {
for (auto &e : v)
f(e);
}
template <class T, class F> auto Map(const T &v, F f) {
vector<decay_t<result_of_t<F(typename T::value_type)>>> res(v.size());
size_t i = 0;
for (const auto &e : v)
res[i++] = f(e);
return res;
}
template <class T, class F> auto MapIndex(const T &v, F f) {
vector<decay_t<result_of_t<F(size_t, typename T::value_type)>>> res(v.size());
size_t i = 0;
for (auto it = v.begin(); it != v.end(); ++it, ++i)
res[i] = f(i, *it);
return res;
}
template <class T, class F> auto Select(const T &v, F f) {
T res;
for (const auto &e : v)
if (f(e))
res.push_back(e);
return res;
}
template <class T, class F> vector<size_t> TrueIndex(const T &v, F f) {
vector<size_t> res;
size_t i = 0;
for (const auto &e : v) {
if (f(e))
res.push_back(i);
++i;
}
return res;
}
// ---------------------------------------------------------------- //
int main() {
int a = in, b = in;
if (a >= 13) {
out(b);
} else if (a >= 6) {
out(b / 2);
} else {
out(0);
}
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 845,884 | 845,885 | u172873334 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b;
if (a == 0) {
cout << "0";
} else {
if (a <= 13) {
t = b / 2;
cout << t;
} else {
cout << b;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b;
if (a < 6) {
cout << "0";
} else {
if (a < 13) {
t = b / 2;
cout << t;
} else {
cout << b;
}
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,906 | 845,905 | u698398824 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b;
if (a == 0) {
cout << "0";
} else {
if (a < 13) {
t = b / 2;
cout << t;
} else {
cout << b;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b;
if (a < 6) {
cout << "0";
} else {
if (a < 13) {
t = b / 2;
cout << t;
} else {
cout << b;
}
}
return 0;
}
| [] | 845,907 | 845,905 | u698398824 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c = b / 2;
if (a <= 5) {
cout << "0";
} else if (a >= 6 && a <= 12) {
cout << b / 2;
} else if (a > 13) {
cout << c;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c = b / 2;
if (a <= 5) {
cout << "0";
} else if (a >= 6 && a <= 12) {
cout << c;
} else if (a >= 13) {
cout << b;
}
} | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,912 | 845,911 | u901555384 | 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 (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 > 12) {
cout << B << endl;
} else if (6 <= A && A <= 12) {
cout << B / 2 << endl;
} else if (A < 6) {
cout << 0 << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 845,913 | 845,914 | u120459216 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
cout << "0";
else if (a < 13)
cout << b / 2;
else
b;
} | #include <bits/stdc++.h>
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;
}
| [
"io.output.change"
] | 845,917 | 845,918 | u636497829 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (13 <= a)
cout << b;
else if (a <= 6 && a <= 12)
cout << b / 2;
else
cout << "0";
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (13 <= a)
cout << b;
else if (6 <= a && a <= 12)
cout << b / 2;
else
cout << "0";
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 845,925 | 845,926 | u639300218 | 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 <= 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 > 12) {
cout << b << endl;
} else if (a <= 12 && a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 845,933 | 845,934 | u517889509 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
if (6 <= n && n <= 2)
m /= 2;
if (n <= 5)
m = 0;
cout << m << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
if (6 <= n && n <= 12)
m /= 2;
if (n <= 5)
m = 0;
cout << m << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,935 | 845,936 | u388372553 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n, k;
while (cin >> n >> k) {
if (n == 0)
cout << "0" << endl;
else if (n <= 12)
cout << k / 2 << endl;
else
cout << k << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n, k;
while (cin >> n >> k) {
if (n <= 5)
cout << "0" << endl;
else if (n <= 12)
cout << k / 2 << endl;
else
cout << k << endl;
}
return 0;
}
| [] | 845,941 | 845,942 | u207235471 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define FOR(i, x, n) for (int i = x; i < (int)n; i++)
#define REP(i, n) FOR(i, 0, n)
#define debug(x) #x << "=" << (x) << "(L" << __LINE__ << ")"
#define show(x) cout << #x << "=" << x << endl
#define show2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define show3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
const ld eps = 1e-9, pi = acos(-1.0);
const ld EPS = 1e-8;
const int INF = INT_MAX / 2;
const ll LINF = LONG_MAX / 2;
const int MOD = 1000000007;
template <class T> inline void amin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> inline void amax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll a, b;
cin >> a >> b;
int ans = 0;
if (a >= 13) {
ans = b;
} else if (a >= 5) {
ans = b / 2;
}
cout << fixed << setprecision(10);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define FOR(i, x, n) for (int i = x; i < (int)n; i++)
#define REP(i, n) FOR(i, 0, n)
#define debug(x) #x << "=" << (x) << "(L" << __LINE__ << ")"
#define show(x) cout << #x << "=" << x << endl
#define show2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define show3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
const ld eps = 1e-9, pi = acos(-1.0);
const ld EPS = 1e-8;
const int INF = INT_MAX / 2;
const ll LINF = LONG_MAX / 2;
const int MOD = 1000000007;
template <class T> inline void amin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> inline void amax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll a, b;
cin >> a >> b;
int ans = 0;
if (a >= 13) {
ans = b;
} else if (a >= 6) {
ans = b / 2;
}
cout << fixed << setprecision(10);
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,943 | 845,944 | u693378622 | cpp |
p03035 | ///******* In the name of Allah *******///
#include <bits/stdc++.h>
using namespace std;
long int gcd(long int a, long int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void Ok() {
long long int a, b, c, d[1013], e, f, g, h, t, i,
j = 0, k, l1, l2, m, n, x, y, sum, ans_1, ans_2, ans_3, cnt, Max, Min,
flag, div, rcv, temp;
long double aa, bb, cc, dd, ee, ff, gg;
char aaa[100013], bbb[1013], ccc[1013], alpbt;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 && a <= 12) {
ans_1 = b / 2;
cout << b << endl;
} else {
cout << "0" << endl;
}
return;
}
int main() {
Ok();
return 0;
}
| ///******* In the name of Allah *******///
#include <bits/stdc++.h>
using namespace std;
long int gcd(long int a, long int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void Ok() {
long long int a, b, c, d[1013], e, f, g, h, t, i,
j = 0, k, l1, l2, m, n, x, y, sum, ans_1, ans_2, ans_3, cnt, Max, Min,
flag, div, rcv, temp;
long double aa, bb, cc, dd, ee, ff, gg;
char aaa[100013], bbb[1013], ccc[1013], alpbt;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 && a <= 12) {
ans_1 = b / 2;
cout << ans_1 << endl;
} else {
cout << "0" << endl;
}
return;
}
int main() {
Ok();
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 845,945 | 845,946 | u370844911 | cpp |
p03035 | #define _GLIBCXX_DEBUG
#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
cout << 0 << endl;
} | #define _GLIBCXX_DEBUG
#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
cout << 0 << endl;
} | [
"control_flow.branch.if.condition.change"
] | 845,965 | 845,966 | u138273120 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
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.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 845,969 | 845,970 | u190761897 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B;
return 0;
}
if (5 <= A && A <= 12) {
cout << B / 2;
return 0;
}
cout << 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B;
return 0;
}
if (5 < A && A <= 12) {
cout << B / 2;
return 0;
}
cout << 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,975 | 845,976 | u545364250 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B;
return 0;
if (5 <= A && A <= 12)
cout << B / 2;
return 0;
cout << 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B;
return 0;
}
if (5 < A && A <= 12) {
cout << B / 2;
return 0;
}
cout << 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,977 | 845,976 | u545364250 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B;
return 0;
if (5 <= A && A >= 12)
cout << B / 2;
return 0;
cout << 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B;
return 0;
}
if (5 < A && A <= 12) {
cout << B / 2;
return 0;
}
cout << 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 845,978 | 845,976 | u545364250 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B;
return 0;
if (5 <= A && B <= 12)
cout << B / 2;
return 0;
cout << 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B;
return 0;
}
if (5 < A && A <= 12) {
cout << B / 2;
return 0;
}
cout << 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 845,979 | 845,976 | u545364250 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 6 && A < 13) {
cout << B / 2;
} else if (A <= 5) {
cout << 0;
} else {
cout << B;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 5 && A < 13) {
cout << B / 2;
} else if (A <= 5) {
cout << 0;
} else {
cout << B;
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,986 | 845,987 | u242828339 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5)
cout << 0 << endl;
if (5 < a && 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 <= 5)
cout << 0 << endl;
else if (5 < a && a < 13)
cout << b / 2 << endl;
else
cout << b << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,990 | 845,991 | u613960672 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n, k;
cin >> n >> k;
if (n < 6)
cout << "0" << endl;
else if (n < 13)
cout << n / 2 << endl;
else
cout << n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n, k;
cin >> n >> k;
if (n < 6)
cout << "0" << endl;
else if (n < 13)
cout << k / 2 << endl;
else
cout << k << endl;
}
| [
"identifier.change",
"io.output.change"
] | 846,011 | 846,012 | u730271001 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b > 12) {
cout << b << endl;
} else if (b > 5) {
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;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 846,015 | 846,016 | u164352406 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define INF 1e9
#define all(v) v.begin(), v.end()
typedef long long ll;
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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define INF 1e9
#define all(v) v.begin(), v.end()
typedef long long ll;
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;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,017 | 846,018 | u328179672 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(item) cout << (item) << '\n';
#define PRINT_VEC(V) \
for (auto v : (V)) \
cout << v << ' '
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (b >= 13)
PRINT(b)
else if (b >= 6)
PRINT((int)b / 2)
else
PRINT(0)
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(item) cout << (item) << '\n';
#define PRINT_VEC(V) \
for (auto v : (V)) \
cout << v << ' '
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a >= 13)
PRINT(b)
else if (a >= 6)
PRINT((int)b / 2)
else
PRINT(0)
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 846,019 | 846,020 | u223960644 | cpp |
p03035 | #include <bits/stdc++.h>
#define intt long long
#define pb push_back
#define mk make_pair
#define ii pair<intt, intt>
#define sc second
#define fr first
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x >= 12)
cout << y << endl;
else if (x >= 6)
cout << y / 2 << endl;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define intt long long
#define pb push_back
#define mk make_pair
#define ii pair<intt, intt>
#define sc second
#define fr first
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x >= 13)
cout << y << endl;
else if (x >= 6)
cout << y / 2 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 846,028 | 846,029 | u391642469 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a >= 6 && a <= 12) {
ans = b / 2;
} else if (a <= 5) {
ans = b / 4;
} else {
ans = b;
}
Cout(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a >= 6 && a <= 12) {
ans = b / 2;
} else if (a <= 5) {
ans = 0;
} else {
ans = b;
}
Cout(ans);
return 0;
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 846,057 | 846,058 | u833549197 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
return 0;
} else if (a >= 6 && a < 12) {
cout << b / 2 << endl;
return 0;
} else {
cout << 0 << endl;
return 0;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
return 0;
} else if (a >= 6 && a <= 12) {
cout << b / 2 << endl;
return 0;
} else {
cout << 0 << endl;
return 0;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,069 | 846,070 | u480172743 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (13 >= a) {
cout << b << endl;
} else if (a <= 5) {
cout << 0 << endl;
} else {
cout << b / 2 << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (13 <= a) {
cout << b << endl;
} else if (a <= 5) {
cout << 0 << endl;
} else {
cout << b / 2 << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,081 | 846,082 | u924451152 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (13 >= a) {
cout << a << endl;
} else if (a <= 5) {
cout << 0 << endl;
} else {
cout << a / 2 << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (13 <= a) {
cout << b << endl;
} else if (a <= 5) {
cout << 0 << endl;
} else {
cout << b / 2 << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 846,083 | 846,082 | u924451152 | cpp |
p03035 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a;
cin >> b;
if (a >= 13) {
cout << b << endl;
} else if (6 <= a <= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a;
cin >> 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"
] | 846,104 | 846,105 | u161418539 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int mod = 1000000007;
const int mod1 = 998244353;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (b > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int mod = 1000000007;
const int mod1 = 998244353;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 846,106 | 846,107 | u480831358 | 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 (6 <= A && A <= 12) {
cout << B / 2 << endl;
} else if (13 <= A) {
cout << B << 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 (6 <= A && A <= 12) {
cout << (B / 2) << endl;
} else if (13 <= A) {
cout << B << endl;
}
return 0;
} | [] | 846,110 | 846,111 | u767481489 | 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 (6 <= A <= 12) {
cout << B / 2 << endl;
} else if (13 <= A) {
cout << B << 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 (6 <= A && A <= 12) {
cout << (B / 2) << endl;
} else if (13 <= A) {
cout << B << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 846,112 | 846,111 | u767481489 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a >= 13) {
cout << b << endl;
} else if (a <= 5) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a >= 13) {
cout << b << endl;
} else if (a <= 5) {
cout << 0 << endl;
} else {
cout << b / 2 << endl;
}
} | [
"control_flow.branch.else.add"
] | 846,131 | 846,132 | u731750763 | 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 && A <= 1) {
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 (6 <= A && A <= 12) {
cout << B / 2 << endl;
}
if (A <= 5) {
cout << 0 << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 846,140 | 846,141 | u762502257 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a > 12)
cout << a;
else if (a >= 6 && a <= 12)
cout << a / 2;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a > 12)
cout << b;
else if (a >= 6 && a <= 12)
cout << b / 2;
else
cout << 0;
} | [
"identifier.change",
"io.output.change"
] | 846,146 | 846,147 | u901813121 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 6 && a <= 12)
b = b / 2;
else if (a < 6)
b = 0;
cout << b;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 6 && a <= 12)
b = b / 2;
else if (a < 6)
b = 0;
cout << b;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,175 | 846,176 | u798851723 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000000;
ll max(ll a, ll b) {
if (a > b) {
return a;
}
return b;
}
ll min(ll a, ll b) {
if (a > b) {
return b;
}
return a;
}
///////////////////////////
int main() {
ll a, b;
cin >> a >> b;
if (a >= 13) {
cout << b;
} else if (a >= 12) {
cout << b / 2;
} else {
cout << 0;
}
system("PAUSE");
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000000;
ll max(ll a, ll b) {
if (a > b) {
return a;
}
return b;
}
ll min(ll a, ll b) {
if (a > b) {
return b;
}
return a;
}
///////////////////////////
int main() {
ll a, b;
cin >> a >> b;
if (a >= 13) {
cout << b;
} else if (a >= 6) {
cout << b / 2;
} else {
cout << 0;
}
system("PAUSE");
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 846,180 | 846,181 | u004411048 | 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 >= 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,192 | 846,193 | u615258936 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b;
} else if (1 >= 6 && 12 >= a) {
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 && 12 >= a) {
cout << b / 2;
} else {
cout << 0;
}
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 846,194 | 846,195 | u584169254 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b;
} else if (b >= 6 && 12 >= b) {
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 && 12 >= a) {
cout << b / 2;
} else {
cout << 0;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 846,196 | 846,195 | u584169254 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define co(n) cout << n << endl
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 5)
co(0);
else if (a >= 12)
co(b / 2);
else
co(b);
}
| #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define co(n) cout << n << endl
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5)
co(0);
else if (a <= 12)
co(b / 2);
else
co(b);
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,199 | 846,200 | u558115145 | cpp |
p03035 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;
#define all(v) v.begin(), v.end()
#define showVector(v) \
REP(i, v.size()) { \
p(v[i]); \
p(" ") \
} \
pl("")
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;
}
typedef pair<int, int> P_ii;
typedef pair<double, double> P_dd;
typedef long long int ll;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
const int MOD = 1000000007;
const ll INF = (ll)1e12;
void addM(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
void mulM(long long &a, long long b) { a = ((a % MOD) * (b % MOD)) % MOD; }
bool compare_by_second(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
ll dp[20][2][2]; // 桁決めた桁、未満フラグ、４or9を含むフラグ
int main() {
ll a, b;
cin >> a >> b;
if (a <= 5)
pl(0) else if (1 <= 12) pl(b / 2) else pl(b)
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;
#define all(v) v.begin(), v.end()
#define showVector(v) \
REP(i, v.size()) { \
p(v[i]); \
p(" ") \
} \
pl("")
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;
}
typedef pair<int, int> P_ii;
typedef pair<double, double> P_dd;
typedef long long int ll;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
const int MOD = 1000000007;
const ll INF = (ll)1e12;
void addM(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
void mulM(long long &a, long long b) { a = ((a % MOD) * (b % MOD)) % MOD; }
bool compare_by_second(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
ll dp[20][2][2]; // 桁決めた桁、未満フラグ、４or9を含むフラグ
int main() {
ll a, b;
cin >> a >> b;
if (a <= 5)
pl(0) else if (a <= 12) pl(b / 2) else pl(b)
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 846,209 | 846,210 | u491550356 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x;
if (x > 12) {
cout << y;
} else if (x <= 12 && x >= 6) {
cout << y / 2;
} else {
cout << "0";
}
} | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x > 12) {
cout << y;
} else if (x <= 12 && x >= 6) {
cout << y / 2;
} else {
cout << "0";
}
} | [
"expression.operation.binary.add"
] | 846,211 | 846,212 | u212846403 | 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 <= 5) {
cout << "0" << 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 >= 13) {
cout << b << endl;
} else if (a <= 5) {
cout << "0" << endl;
} else {
cout << b / 2 << endl;
}
return 0;
} | [] | 846,226 | 846,227 | u767995501 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
int A, B;
cin >> A >> B;
if (13 <= A)
cout << B << endl;
else if (4 <= A)
cout << B / 2 << endl;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
int A, B;
cin >> A >> B;
if (13 <= A)
cout << B << endl;
else if (6 <= A)
cout << B / 2 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 846,238 | 846,239 | u624678037 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (a >= 6 && a <= 12)
b %= 2;
if (a < 6)
b = 0;
cout << b << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (a >= 6 && a <= 12)
b /= 2;
if (a < 6)
b = 0;
cout << b << endl;
} | [
"expression.operator.change"
] | 846,244 | 846,245 | u402472923 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A, B;
if (A >= 13)
cout << B;
else if (A >= 6 && A <= 12)
cout << B / 2;
else if (A <= 5)
cout << 0;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
if (A >= 13)
cout << B;
if (A >= 6 && A <= 12)
cout << B / 2;
if (A <= 5)
cout << 0;
return 0;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 846,263 | 846,264 | u265789933 | 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;
return 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;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 846,269 | 846,270 | u469239325 | 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;
}
return 0;
} | #include <iostream>
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;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 846,285 | 846,286 | u961443099 | 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 >= 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 (a >= 6 && a <= 12)
cout << b / 2;
else {
cout << 0;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,290 | 846,291 | u062198110 | 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;
} else if (6 <= A <= 12) {
cout << B / 2 << endl;
} else if (A < 6) {
cout << 0 << endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
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 < 6) {
cout << 0 << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 846,295 | 846,296 | u020193852 | cpp |
p03035 | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d", &a, &b);
if (a >= 13) {
printf("%d\n", b);
} else if (6 <= a) {
printf("%d\n", b / 2);
} else {
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 (6 <= a) {
printf("%d\n", b / 2);
} else {
printf("0\n");
}
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 846,299 | 846,300 | u180133008 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define revrep(i, N) for (int i = N - 1; i >= 0; i--)
#define coutline cout << "------------ (" << __LINE__ << ")" << endl;
typedef long long ll;
int main(void) {
int A, B;
cin >> A >> B;
int ret = 0;
if (A >= 13) {
ret = B;
} else if (6 <= B && B <= 12) {
ret = B / 2;
}
cout << ret << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define revrep(i, N) for (int i = N - 1; i >= 0; i--)
#define coutline cout << "------------ (" << __LINE__ << ")" << endl;
typedef long long ll;
int main(void) {
int A, B;
cin >> A >> B;
int ret = 0;
if (A >= 13) {
ret = B;
} else if (6 <= A && A <= 12) {
ret = B / 2;
}
cout << ret << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 846,320 | 846,321 | u668140376 | cpp |
p03035 | #include <bits/stdc++.h>
void solve(int a, int b) {
if (a < 5)
printf("0");
else if (a < 13)
printf("%d", b / 2);
else
printf("%d", b);
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int a = 0, b = 0;
std::cin >> a >> b;
solve(a, b);
return 0;
}
| #include <bits/stdc++.h>
void solve(int a, int b) {
if (a <= 5)
printf("0");
else if (a < 13)
printf("%d", b / 2);
else
printf("%d", b);
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int a = 0, b = 0;
std::cin >> a >> b;
solve(a, b);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,347 | 846,348 | u942174595 | 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
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;
}
| [
"expression.operation.binary.remove"
] | 846,351 | 846,352 | u623687794 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x; i < n; ++i)
int main() {
int a, b;
cin >> a >> b;
int p = 0;
if (p >= 13)
p = b;
else if (p >= 6)
p = b / 2;
cout << p << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x; i < n; ++i)
int main() {
int a, b;
cin >> a >> b;
int p = 0;
if (a >= 13)
p = b;
else if (a >= 6)
p = b / 2;
cout << p << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 846,359 | 846,360 | u445401544 | cpp |
p03035 | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d %d", &a, &b);
if (13 <= a) {
printf("%d\n", b);
} else if (6 <= a && 12 >= a) {
printf("%d\n", b - 50);
} else {
printf("0\n");
}
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b;
scanf("%d %d", &a, &b);
if (13 <= a) {
printf("%d\n", b);
} else if (6 <= a && 12 >= a) {
printf("%d\n", b / 2);
} else {
printf("0\n");
}
return 0;
}
| [] | 846,361 | 846,362 | u785727223 | cpp |
p03035 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
return 0;
} else if (6 <= a < 12) {
cout << b / 2 << endl;
return 0;
} else if (a < 6) {
cout << "0" << endl;
}
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
return 0;
} else if (6 <= a && a <= 12) {
cout << b / 2 << endl;
return 0;
} else if (a <= 5) {
cout << "0" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 846,373 | 846,374 | u927933718 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a < 5) {
cout << 0;
} else if (a < 13) {
cout << b / 2;
} else {
cout << b;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a <= 5) {
cout << 0;
} else if (a < 13) {
cout << b / 2;
} else {
cout << b;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,384 | 846,385 | u777477705 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0;
return 0;
}
if (a >= 6 or a <= 12) {
cout << b / 2;
return 0;
}
cout << b;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0;
return 0;
}
if (a >= 6 and a <= 12) {
cout << b / 2;
return 0;
}
cout << b;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 846,386 | 846,387 | u798678713 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 12) {
cout << A << endl;
} else if (6 <= A && A <= 12) {
cout << A / 2 << endl;
} else {
cout << "0" << endl;
}
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 12) {
cout << B << endl;
} else if (6 <= A && A <= 12) {
cout << B / 2 << endl;
} else {
cout << "0" << endl;
}
}
| [
"identifier.change",
"io.output.change"
] | 846,396 | 846,397 | u433048345 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A = 0, B = 0;
cin >> A >> B;
int half = B / 2;
if (A == 0) {
cout << "0" << endl;
} else if (6 <= A && A <= 12) {
cout << half << endl;
} else {
cout << B << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A = 0, B = 0;
cin >> A >> B;
int half = B / 2;
if (A <= 5) {
cout << "0" << endl;
} else if (6 <= A && A <= 12) {
cout << half << endl;
} else {
cout << B << endl;
}
return 0;
} | [] | 846,400 | 846,401 | u400694042 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi for
#define mod (1000000007)
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int desc(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << a << endl;
} else if (a >= 6) {
cout << a / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi for
#define mod (1000000007)
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int desc(const void *a, const void *b) { return *(int *)b - *(int *)a; }
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;
} | [
"identifier.change",
"io.output.change"
] | 846,402 | 846,403 | u801513186 | cpp |
p03035 | #include <stdio.h>
int main() {
int A, B, y;
scanf("%d %d", &A, &B);
if (A < 5)
y = 0;
else if (A >= 6 && A <= 12)
y = B / 2;
else
y = B;
printf("%d\n", y);
return 0;
}
| #include <stdio.h>
int main() {
int A, B, y;
scanf("%d %d", &A, &B);
if (A < 6)
y = 0;
else if (A >= 6 && A <= 12)
y = B / 2;
else
y = B;
printf("%d\n", y);
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 846,414 | 846,415 | u560936174 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
int main() {
int A, B;
cin >> A >> B;
int result = 0;
if (A <= 6 && A >= 12)
result = B / 2;
if (A >= 13)
result = B;
cout << result << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
int main() {
int A, B;
cin >> A >> B;
int result = 0;
if (A >= 6 && A <= 12)
result = B / 2;
if (A >= 13)
result = B;
cout << result << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,449 | 846,450 | u680707192 | 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 > 0)
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 > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 846,451 | 846,452 | u938841444 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (6 < a && a < 13)
b /= 2;
else if (5 >= a)
b = 0;
cout << b << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (6 <= a && a < 13)
b /= 2;
else if (5 >= a)
b = 0;
cout << b << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,459 | 846,460 | u980485808 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (6 < a && a < 13)
b /= 2;
else if (5 <= a)
b = 0;
cout << b << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (6 <= a && a < 13)
b /= 2;
else if (5 >= a)
b = 0;
cout << b << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 846,461 | 846,460 | u980485808 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (6 <= a && a <= 12)
b /= 2;
else if (5 > a)
b = 0;
cout << b << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (6 <= a && a <= 12)
b /= 2;
else if (5 >= a)
b = 0;
cout << b << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,462 | 846,463 | u980485808 | 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 << B << 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;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 846,470 | 846,471 | u204523044 | cpp |
p03035 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
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;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
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;
return 0;
}
| [] | 846,477 | 846,478 | u136473852 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii vector<vi>
#define vs vector<string>
#define vss vector<vs>
#define all(x) x.begin(), x.end()
#define pi 3.1415926536
#define ff first
#define ss second
#define pq priority_queue
#define ipair pair<int, int>
#define spair pair<string, string>
#define lpair pair<LL, LL>
#define MP make_pair
#define INF 2147483647
#define _INF -2147483647
#define MM multimap
#define PB push_back
#define MAXN 100004
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (6 <= A && 12 <= A) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii vector<vi>
#define vs vector<string>
#define vss vector<vs>
#define all(x) x.begin(), x.end()
#define pi 3.1415926536
#define ff first
#define ss second
#define pq priority_queue
#define ipair pair<int, int>
#define spair pair<string, string>
#define lpair pair<LL, LL>
#define MP make_pair
#define INF 2147483647
#define _INF -2147483647
#define MM multimap
#define PB push_back
#define MAXN 100004
using namespace std;
typedef long long ll;
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;
}
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 846,497 | 846,498 | u075520262 | 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 < 6)
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 (6 <= a && a <= 12)
cout << b / 2 << endl;
else if (a < 6)
cout << '0' << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,506 | 846,507 | u738459792 | cpp |
p03035 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <string.h>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
void solve() {
int a, b;
cin >> a >> b;
if (6 <= a <= 12)
b /= 2;
if (a <= 5)
b = 0;
cout << b << endl;
}
int main() {
solve();
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <string.h>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
void solve() {
int a, b;
cin >> a >> b;
if (6 <= a && a <= 12)
b /= 2;
if (a <= 5)
b = 0;
cout << b << endl;
}
int main() {
solve();
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 846,549 | 846,550 | u272496669 | cpp |
p03035 | #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;
} | #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;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 846,588 | 846,589 | u404145225 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, cost = 0;
cin >> A >> B;
if (A <= 5) {
cost = 0;
} else if (6 <= A <= 12) {
cost = B / 2;
} else {
cost = B;
}
cout << cost << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, cost = 0;
cin >> A >> B;
if (A <= 5) {
cost = 0;
} else if (A < 13) {
cost = B / 2;
} else {
cost = B;
}
cout << cost << endl;
}
| [
"expression.operation.binary.remove"
] | 846,597 | 846,598 | u959353968 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, cost;
cin >> A >> B;
if (A <= 5) {
cost = 0;
} else if (5 < A < 13) {
cost = B / 2;
} else {
cost = B;
}
cout << cost << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, cost = 0;
cin >> A >> B;
if (A <= 5) {
cost = 0;
} else if (A < 13) {
cost = B / 2;
} else {
cost = B;
}
cout << cost << endl;
}
| [
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 846,600 | 846,598 | u959353968 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, cost;
cin >> A >> B;
if (A <= 5) {
cost = 0;
} else if (A >= 13) {
cost = B / 2;
} else {
cost = B;
}
cout << cost << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, cost = 0;
cin >> A >> B;
if (A <= 5) {
cost = 0;
} else if (A < 13) {
cost = B / 2;
} else {
cost = B;
}
cout << cost << endl;
}
| [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,601 | 846,598 | u959353968 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, cost;
cin >> A >> B;
if (A >= 5) {
cost = 0;
} else if (A <= 13) {
cost = B / 2;
} else {
cost = B;
}
cout << cost << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, cost = 0;
cin >> A >> B;
if (A <= 5) {
cost = 0;
} else if (A < 13) {
cost = B / 2;
} else {
cost = B;
}
cout << cost << endl;
}
| [
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 846,602 | 846,598 | u959353968 | cpp |
p03035 | // c++
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 && a <= 12) {
cout << "b / 2" << endl;
} else {
cout << "0" << endl;
}
}
| // c++
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 && a <= 12) {
cout << b / 2 << endl;
} else {
cout << "0" << endl;
}
}
| [] | 846,606 | 846,607 | u479202791 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans;
if (B >= 13) {
ans = B;
} else if (B >= 6) {
ans = B / 2;
} else {
ans = 0;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans;
if (A >= 13) {
ans = B;
} else if (A >= 6) {
ans = B / 2;
} else {
ans = 0;
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 846,610 | 846,611 | u299529534 | 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"
] | 846,619 | 846,620 | u388787692 | cpp |
p03035 | #include <iostream>
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;
// }
cout << (a > 6) * ((a > 12) ? b : b / 2) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a >= 6) * ((a > 12) ? b : b / 2) << endl;
return 0;
}
| [
"expression.operator.compare.change",
"io.output.change"
] | 846,624 | 846,625 | u647653350 | cpp |
p03035 | #include <iostream>
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;
// }
cout << (a > 6) * (a > 12 ? b : b / 2) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a >= 6) * ((a > 12) ? b : b / 2) << endl;
return 0;
}
| [
"expression.operator.compare.change",
"io.output.change"
] | 846,626 | 846,625 | u647653350 | cpp |
p03035 | #include <iostream>
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;
// }
cout << (a > 6) * ((a > 12) ? b : b / 2) << endl;
return 0;
}
| #include <iostream>
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;
// }
cout << (a >= 6) * ((a > 12) ? b : b / 2) << endl;
return 0;
}
| [
"expression.operator.compare.change",
"io.output.change"
] | 846,624 | 846,627 | u647653350 | cpp |
p03035 | #include <iostream>
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;
// }
cout << (a > 6) * (a > 12 ? b : b / 2) << endl;
return 0;
}
| #include <iostream>
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;
// }
cout << (a >= 6) * ((a > 12) ? b : b / 2) << endl;
return 0;
}
| [
"expression.operator.compare.change",
"io.output.change"
] | 846,626 | 846,627 | u647653350 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0 << endl;
} else if (a <= 12) {
cout << b << endl;
} else {
cout << b << endl;
}
return 0;
}
| #include <iostream>
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;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 846,628 | 846,629 | u647653350 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < n; ++i)
#define FORR(i, s, n) for (int i = n - 1; i >= s; --i)
#define ALL(c) (c).begin(), (c).end()
#define CLEAR(v) memset(v, 0, sizeof(v))
#define MP(a, b) make_pair((a), (b))
#define ABS(a) ((a) > 0 ? (a) : -(a))
#define F first
#define S second
int main(int argc, char **argv) {
int a, b;
cin >> a >> b;
cout << (a >= 13 ? b : a >= 12 ? b / 2 : 0) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < n; ++i)
#define FORR(i, s, n) for (int i = n - 1; i >= s; --i)
#define ALL(c) (c).begin(), (c).end()
#define CLEAR(v) memset(v, 0, sizeof(v))
#define MP(a, b) make_pair((a), (b))
#define ABS(a) ((a) > 0 ? (a) : -(a))
#define F first
#define S second
int main(int argc, char **argv) {
int a, b;
cin >> a >> b;
cout << (a >= 13 ? b : a >= 6 ? b / 2 : 0) << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 846,647 | 846,648 | u900485130 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.