problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03034 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | [] | 844,896 | 844,897 | u762921614 | cpp |
p03034 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | [
"control_flow.loop.for.condition.change"
] | 844,898 | 844,897 | u762921614 | cpp |
p03034 | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
LL p = 1000000007ll;
int main(void) {
LL n;
cin >> n;
vector<LL> s(n);
for (auto &x : s)
cin >> x;
LL answer = 0;
FOR(a, 1, n / 2 - 1) {
LL tmp = 0... | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
LL p = 1000000007ll;
int main(void) {
LL n;
cin >> n;
vector<LL> s(n);
for (auto &x : s)
cin >> x;
LL answer = 0;
FOR(a, 1, n) {
LL tmp = 0;
fo... | [
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 844,904 | 844,903 | u633757735 | cpp |
p03034 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#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... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#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... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 844,920 | 844,921 | u016572066 | cpp |
p03034 | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
const int maxn = 111111;
int A[maxn];
bool vis[maxn];
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; ++i)
scanf("%d", A + i);
LL Ans = 0;
for (int i = 1; i < N; ++i) {
LL ans = 0;
for (int j = 0, k = N - ... | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
const int maxn = 111111;
int A[maxn];
bool vis[maxn];
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; ++i)
scanf("%d", A + i);
LL Ans = 0;
for (int i = 1; i < N; ++i) {
LL ans = 0;
for (int j = 0, k = N - ... | [
"control_flow.loop.for.condition.change"
] | 844,926 | 844,927 | u136503093 | cpp |
p03035 | #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 844,930 | 844,931 | u503170128 | cpp |
p03035 | #include <iostream>
using namespace std;
int solve(int A, int B) {
if (A >= 13)
return B;
else if (A <= 12)
return B / 2;
else
return 0;
}
int main() {
int A, B;
cin >> A >> B;
int answer = solve(A, B);
cout << answer;
return 0;
} | #include <iostream>
using namespace std;
int solve(int A, int B) {
if (A >= 13)
return B;
else if (A >= 6)
return B / 2;
else
return 0;
}
int main() {
int A, B;
cin >> A >> B;
int answer = solve(A, B);
cout << answer;
return 0;
} | [] | 844,932 | 844,933 | u483483585 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
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;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | [
"identifier.change",
"io.output.change"
] | 844,934 | 844,935 | u523698212 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a > 5)
cout << 6 / 2 << endl;
else
cout << 0 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 844,945 | 844,946 | u618263300 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
const int N = 1e7;
ll v[N + 10];
ll a[N + 10];
bool compare(string &a, string &b) {
string f = a + b, c = b + a;
return f < c;
}
int main() {
ll a, b;
cin >> a >> b;
if (a >= 13... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
const int N = 1e7;
ll v[N + 10];
ll a[N + 10];
bool compare(string &a, string &b) {
string f = a + b, c = b + a;
return f < c;
}
int main() {
ll a, b;
cin >> a >> b;
if (a >= 13... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 844,952 | 844,953 | u152437290 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
const int N = 1e7;
ll v[N + 10];
ll a[N + 10];
bool compare(string &a, string &b) {
string f = a + b, c = b + a;
return f < c;
}
int main() {
ll a, b;
cin >> a >> b;
if (a > 13)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
const int N = 1e7;
ll v[N + 10];
ll a[N + 10];
bool compare(string &a, string &b) {
string f = a + b, c = b + a;
return f < c;
}
int main() {
ll a, b;
cin >> a >> b;
if (a >= 13... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 844,954 | 844,953 | u152437290 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
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) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
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) ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 844,959 | 844,960 | u278557766 | cpp |
p03035 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int a, b, cost;
cin >> a >> b;
if (a >= 13) {
cost = b;
} else if (a >= 6 && a <= 12) {
cost = 13 / 2;
} else
cost = 0;
cout << cost;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int a, b, cost;
cin >> a >> b;
if (a >= 13) {
cost = b;
} else if (a >= 6 && a <= 12) {
cost = b / 2;
} else
cost = 0;
cout << cost;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 844,966 | 844,967 | u222481461 | 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 <= 5)
cout << 0 << endl;
else if (6 <= A && A <= 12)
cout << A / 2 << endl;
else
cout << A << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int 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;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 844,968 | 844,969 | u629603666 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if (x < 6) {
cout << 0;
} else if (x < 13) {
cout << x / 2;
} else {
cout << x;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if (x < 6) {
cout << 0;
} else if (x < 13) {
cout << y / 2;
} else {
cout << y;
}
} | [
"identifier.change",
"io.output.change"
] | 844,970 | 844,971 | u565670345 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (a >= 13)
ans = b;
if (a <= 5)
ans = 0;
else
ans = b / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (a >= 13)
ans = b;
else if (a <= 5)
ans = 0;
else
ans = b / 2;
cout << ans << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 844,979 | 844,980 | u184943320 | cpp |
p03035 | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
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;... | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
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;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 844,981 | 844,982 | u526278960 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
int a, b;
cin >... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
int a, b;
cin >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 844,987 | 844,988 | u678961336 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n - 1; i >= (int)(k); i--)
#define all(x) (x).begin(), (x).end()
#define chm... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n - 1; i >= (int)(k); i--)
#define all(x) (x).begin(), (x).end()
#define chm... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 844,989 | 844,990 | u823083725 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
}
if (A <= 5) {
cout << 0 << endl;
} else {
cout << B / 2 << endl;
}
return 0;
} | #include <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;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 844,991 | 844,992 | u757670973 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
}
if (A <= 5) {
cout << 0 << endl;
} else {
cout << B / 2 << endl;
}
}
| #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;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.return.add",
"control_flow.return.0.add"
] | 844,993 | 844,992 | u757670973 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vec... | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vec... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,004 | 845,005 | u682820318 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout <<... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout <<... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,006 | 845,007 | u596311864 | cpp |
p03035 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int a, b;
cin >> a ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int a, b;
cin >> a ... | [
"identifier.change",
"io.output.change"
] | 845,011 | 845,012 | u239409893 | cpp |
p03035 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int a, b;
cin >> a ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int a, b;
cin >> a ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 845,013 | 845,012 | u239409893 | cpp |
p03035 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tupl... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tupl... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,014 | 845,015 | u577774192 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0;
}
if (a >= 6 && a <= 12) {
cout << b / 2;
} else {
cout << b;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0;
} else if (a >= 6 && a <= 12) {
cout << b / 2;
} else {
cout << b;
}
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,024 | 845,025 | u018679195 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b <= 5) {
cout << 0;
} else {
if (b <= 12) {
cout << b / 2;
} else {
cout << b;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0;
} else {
if (a <= 12) {
cout << b / 2;
} else {
cout << b;
}
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,030 | 845,031 | u644497121 | cpp |
p03035 | /*
author : nishi5451
created: 11.08.2020 21:56:19
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (b >= 13)
cout << b << endl;
else if (b <= 5)
cout << 0 << endl;
else
cout ... | /*
author : nishi5451
created: 11.08.2020 22:00:58
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
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 ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,061 | 845,062 | u033937898 | cpp |
p03035 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define r... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define r... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,067 | 845,068 | u003425494 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 || a < 13) {
cout << b / 2 << endl;
} else if (a < 6) {
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 (a >= 6 && a < 13) {
cout << b / 2 << endl;
} else if (a < 6) {
cout << b * 0 << endl;
}
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 845,074 | 845,075 | u089230684 | cpp |
p03035 | #include <iostream>
int main() {
int A, B;
std::cin >> A >> B;
int ret = B;
if (A < 5) {
ret = 0;
} else if (A <= 12) {
ret = B / 2;
}
std::cout << ret << std::endl;
return 0;
}
| #include <iostream>
int main() {
int A, B;
std::cin >> A >> B;
int ret = B;
if (A <= 5) {
ret = 0;
} else if (A <= 12) {
ret = B / 2;
}
std::cout << ret << std::endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,096 | 845,097 | u306805217 | 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 (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;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,119 | 845,120 | u112478047 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
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 < ... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
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 < ... | [
"identifier.change",
"io.output.change"
] | 845,125 | 845,126 | u892615201 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << A << endl;
} else if (A >= 6 && 12 >= A) {
cout << A / 2 << endl;
}
else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (A >= 6 && 12 >= A) {
cout << B / 2 << endl;
}
else {
cout << 0 << endl;
}
} | [
"identifier.change",
"io.output.change"
] | 845,144 | 845,145 | u714624983 | cpp |
p03035 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector... | [
"identifier.change",
"io.output.change"
] | 845,146 | 845,147 | u311099484 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
int s[n], t[n], x[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
int s[n], t[n], x[... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,153 | 845,154 | u949755084 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [
"assignment.change"
] | 845,163 | 845,164 | u096883693 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; ... | [
"variable_declaration.type.change"
] | 845,218 | 845,219 | u506255180 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 845,230 | 845,231 | u640323045 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 845,232 | 845,231 | u640323045 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct RW {
ll S, T, X;
};
int main() {
ll N, Q;
cin >> N >> Q;
vector<ll> p;
vector<RW> R(N);
for (int i = 0; i < N; i++) {
cin >> R[i].S >> R[i].T >> R[i].X;
RW r = R[i];
p.push_back(r.S - r.X - 1);
p.push_back(r.S - r.X... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct RW {
ll S, T, X;
};
int main() {
ll N, Q;
cin >> N >> Q;
vector<ll> p;
vector<RW> R(N);
for (int i = 0; i < N; i++) {
cin >> R[i].S >> R[i].T >> R[i].X;
RW r = R[i];
p.push_back(r.S - r.X - 1);
p.push_back(r.S - r.X... | [
"call.function.change"
] | 845,263 | 845,264 | u930841425 | cpp |
p03033 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; ... | [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change",
"call.arguments.change"
] | 845,274 | 845,275 | u993688697 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (13 <= A) {
cout << B << endl;
} else if (6 <= A < 13) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (13 <= A) {
cout << B << endl;
} else if (6 <= A && A <= 12) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 845,296 | 845,297 | u084069244 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 12) {
cout << B << endl;
}
if (A < 6) {
cout << 0 << endl;
}
if (A > 6 && A < 13) {
cout << B / 2 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 12) {
cout << B << endl;
}
if (A < 6) {
cout << 0 << endl;
}
if (A > 5 && A < 13) {
cout << B / 2 << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,306 | 845,307 | u425231382 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
cout << 0 << endl;
} else if (a <= 12) {
cout << b << endl;
} else {
cout << (b / 2) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
cout << 0 << endl;
} else if (a <= 12) {
cout << b / 2 << endl;
} else {
cout << b << endl;
}
} | [
"expression.operation.binary.add"
] | 845,321 | 845,322 | u654466549 | cpp |
p03035 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a < 5)
cout << 0 << endl;
else
cout << b /... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << b ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,332 | 845,333 | u849151695 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long int ll;
typedef unsigned long long ull;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inlin... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long int ll;
typedef unsigned long long ull;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inlin... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,346 | 845,347 | u077104253 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a =... | [
"expression.operation.binary.remove"
] | 845,352 | 845,353 | u609061751 | cpp |
p03035 | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int a, b, fare;
cin >> a >> b;
if (a >= 13) {
fare = a;
} else if (a >= 6) {
fare = a / 2;
} else {
fare = 0;
}
cout << fare << endl;
} | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int a, b, fare;
cin >> a >> b;
if (a >= 13) {
fare = b;
} else if (a >= 6) {
fare = b / 2;
} else {
fare = 0;
}
cout << fare << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 845,354 | 845,355 | u790493075 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int a, b;
cin >> a >> b;
if (a == 0) {
cout << 0 << endl;
} else if (6 ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0 << endl;
} else if (6 ... | [] | 845,368 | 845,369 | u651235280 | cpp |
p03035 | #include "bits/stdc++.h"
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define forn(ii, nn) for (int ii = 0; ii < nn; ++ii)
#define gcd(ade, bde) __gcd(ade, bde)
#define vi vector<int>
#define vll vector<ll>
#define v... | #include "bits/stdc++.h"
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define forn(ii, nn) for (int ii = 0; ii < nn; ++ii)
#define gcd(ade, bde) __gcd(ade, bde)
#define vi vector<int>
#define vll vector<ll>
#define v... | [
"expression.operation.binary.add"
] | 845,385 | 845,386 | u403668916 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << end... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << end... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,389 | 845,390 | u789673498 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
if (a <= 12 && a >= 6)
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 <= 12 && a >= 6)
cout << b / 2;
else
cout << 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,395 | 845,396 | u478705580 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 13)
cout << b;
if (a < 12 && a >= 6)
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 <= 12 && a >= 6)
cout << b / 2;
else
cout << 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,397 | 845,396 | u478705580 | cpp |
p03035 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
int main() {
ll a, b;
cin >> a >> b;
if (a < 7)
cout << 0 << endl;
else if (a < 13)
cout << b / 2 << endl;
else
cout << b << endl;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
int main() {
ll a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << endl;
else if (a < 13)
cout << b / 2 << endl;
else
cout << b << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,398 | 845,399 | u016987091 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,408 | 845,409 | u531461815 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (5 >= A) {
cout << 0;
} else if (12 > A) {
cout << B / 2;
} else {
cout << B;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (5 >= A) {
cout << 0;
} else if (12 >= A) {
cout << B / 2;
} else {
cout << B;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,410 | 845,411 | u659267170 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
temp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
temp... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,423 | 845,424 | u164181205 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a <= 5)
cout << 0 << endl;
if (6 <= a && a <= 12)
cout << b / 2 << endl;
else
cout << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,425 | 845,426 | u442855610 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a <= 12 && a >= 6)
cout... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 12 && a >= 6)
cou... | [
"expression.operation.binary.add"
] | 845,438 | 845,439 | u025047544 | cpp |
p03033 | #include <algorithm>
#include <queue>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include <cstdio>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
#include <set>
using namespace std;
int main() {
const int n = getInt();
const int q = getInt();
vector<int> s(n);
vector<int> t(n);
... | #include <algorithm>
#include <queue>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include <cstdio>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
#include <set>
using namespace std;
int main() {
const int n = getInt();
const int q = getInt();
vector<int> s(n);
vector<int> t(n);
... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 845,449 | 845,450 | u433133366 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll, ll> ii;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define RST(i, n) memset(i, n, sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define X fi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll, ll> ii;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define RST(i, n) memset(i, n, sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define X fi... | [
"expression.operation.binary.remove"
] | 845,478 | 845,479 | u829484206 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D[i]; }
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D[i]; }
... | [
"call.arguments.change"
] | 845,483 | 845,484 | u243122218 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
//設定
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D[i]; }
... | [
"call.arguments.change"
] | 845,485 | 845,484 | u243122218 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
int ans[200010], nex[200010], dis[200010];
struct node {
int s, t, x;
friend bool operator<(const node &a, const node &b) { return a.x < b.x; }
} a[200010];
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
int ans[200010], nex[200010], dis[200010];
struct node {
int s, t, x;
friend bool operator<(const node &a, const node &b) { return a.x < b.x; }
} a[200010];
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int ... | [
"control_flow.loop.for.update.change"
] | 845,499 | 845,500 | u535623178 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <ty... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <ty... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 845,518 | 845,519 | u745250049 | cpp |
p03033 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... | [
"expression.operation.binary.remove",
"assignment.change"
] | 845,549 | 845,550 | u614497125 | cpp |
p03033 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#includ... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... | [
"call.arguments.change"
] | 845,551 | 845,550 | u614497125 | cpp |
p03033 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#de... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#de... | [
"control_flow.loop.for.update.change",
"call.arguments.change"
] | 845,558 | 845,559 | u816910105 | cpp |
p03033 | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) ... | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 845,561 | 845,562 | u933068010 | cpp |
p03033 | #include <bits/stdc++.h>
/// TONI BO$$ was here
/// #MLC
using namespace std;
struct inter {
int s, t, x;
} v[200001];
int d[200001];
int arbint[800001];
void update(int a, int b, int x, int st, int dr, int nod) {
if (st >= a && dr <= b) {
arbint[nod] = min(arbint[nod], x);
return;
}
int mij = (st +... | #include <bits/stdc++.h>
/// TONI BO$$ was here
/// #MLC
using namespace std;
struct inter {
int s, t, x;
} v[200001];
int d[200001];
int arbint[800001];
void update(int a, int b, int x, int st, int dr, int nod) {
if (st >= a && dr <= b) {
arbint[nod] = min(arbint[nod], x);
return;
}
int mij = (st +... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,567 | 845,568 | u503211001 | cpp |
p03033 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 845,569 | 845,570 | u468700753 | cpp |
p03035 | #include <cstdio>
using namespace std;
int main() {
int A, B;
scanf("%d %d", &A, &B);
if (B >= 13)
printf("%d", B);
else if (B >= 6)
printf("%d", B / 2);
else
printf("0");
return 0;
} | #include <cstdio>
using namespace std;
int main() {
int A, B;
scanf("%d %d", &A, &B);
if (A >= 13)
printf("%d", B);
else if (A >= 6)
printf("%d", B / 2);
else
printf("0");
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,580 | 845,581 | u316549668 | cpp |
p03035 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,582 | 845,583 | u102602414 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if (a <= 6)
cout << 0 << '\n';
else if (a < 13)
cout << b / 2 << '\n';
else
cout << b << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << '\n';
else if (a < 13)
cout << b / 2 << '\n';
else
cout << b << '\n';
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,584 | 845,585 | u855677173 | cpp |
p03035 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | [
"control_flow.branch.if.condition.change"
] | 845,602 | 845,603 | u341447450 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (6 <= a <= 12)
cout << b / 2 << endl;
else if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (6 <= a && a <= 12)
cout << b / 2 << endl;
if (a >= 13)
cout << b << endl;
if (a <= 5)
cout << 0 << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 845,619 | 845,620 | u864785784 | 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 < 13) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (6 <= a && a <= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 845,631 | 845,632 | u755918658 | 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 {
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 {
cout << 0 << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,633 | 845,632 | u755918658 | 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;
}
}
| #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,634 | 845,632 | u755918658 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (6 <= a <= 12)
cout << b / 2;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (6 <= a && a <= 12)
cout << b / 2;
else
cout << 0;
} | [
"control_flow.branch.if.condition.change"
] | 845,635 | 845,636 | u330919736 | 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 <= b <= 12)
cout << b / 2;
else
cout << 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (6 <= a && a <= 12)
cout << b / 2;
else
cout << 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,637 | 845,636 | u330919736 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
int main() {
int a, b, c, d, x;
double da, db;
string s, ss,... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
int main() {
int a, b, c, d, x;
double da, db;
string s, ss,... | [] | 845,640 | 845,641 | u392422101 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
int main() {
int a, b, c, d, x;
double da, db;
string s, ss,... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
int main() {
int a, b, c, d, x;
double da, db;
string s, ss,... | [
"expression.operation.binary.add"
] | 845,642 | 845,641 | u392422101 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define imx INT_MAX
#define imn INT_MIN
#define llmx LLONG_MAX
#define llmn LLONG_MIN
#define fi first
#define se second
#define pb push_back
#define f_s(a) sort(a.begin(), a.end())
#define b_s(a) sort(a.rbegin(), a.rend())
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define imx INT_MAX
#define imn INT_MIN
#define llmx LLONG_MAX
#define llmn LLONG_MIN
#define fi first
#define se second
#define pb push_back
#define f_s(a) sort(a.begin(), a.end())
#define b_s(a) sort(a.rbegin(), a.rend())
#... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,643 | 845,644 | u644164234 | cpp |
p03035 | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ... | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,650 | 845,651 | u803173123 | 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 << int(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 && a <= 12) {
cout << int(b / 2) << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 845,652 | 845,653 | u277868339 | cpp |
p03035 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6 && a < 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6 && a <= 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,664 | 845,665 | u101048376 | 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;
}
} | #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,673 | 845,674 | u046313635 | cpp |
p03035 | #include <iostream>
#include <list>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
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 <iostream>
#include <list>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
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"
] | 845,711 | 845,712 | u947750088 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | [
"identifier.change",
"io.output.change"
] | 845,715 | 845,716 | u474760662 | cpp |
p03035 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b << endl;
} else if (a < 12 && 5 < a) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b << endl;
} else if (a <= 12 && 5 < a) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,734 | 845,735 | u519899937 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(void) {
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 <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B << endl;
else if (6 <= A && A <= 12)
cout << B / 2 << endl;
else
cout << 0 << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 845,752 | 845,753 | u998349161 | 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 >= 12)
cout << b << endl;
if (a >= 6 && a < 12)
cout << b / 2 << endl;
if (a < 6)
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
if (a >= 6 && a < 13)
cout << b / 2 << endl;
if (a < 6)
cout << 0 << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,754 | 845,755 | u321168841 | cpp |
p03035 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,756 | 845,757 | u545938555 | 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 (b <= 5) {
cout << 0 << endl;
} else {
cout << b / 2 << 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 << 0 << endl;
} else {
cout << b / 2 << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,792 | 845,793 | u176218583 | cpp |
p03035 | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
if (a <= 5)
cout << "0" << endl;
else
cout << b / 2 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string.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;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,797 | 845,798 | u027762862 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (b <= 5)
cout << 0 << endl;
else if (b >= 6 && b <= 12)
cout << a / 2 << endl;
else
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> b >> a;
if (b <= 5)
cout << 0 << endl;
else if (b >= 6 && b <= 12)
cout << a / 2 << endl;
else
cout << a << endl;
}
| [
"expression.operation.binary.remove"
] | 845,799 | 845,800 | u233383925 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (b <= 5)
cout << 0 << endl;
else if (b >= 6 && b <= 12)
cout << b / 2 << endl;
else
cout << b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> b >> a;
if (b <= 5)
cout << 0 << endl;
else if (b >= 6 && b <= 12)
cout << a / 2 << endl;
else
cout << a << endl;
}
| [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 845,801 | 845,800 | u233383925 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.