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 |
|---|---|---|---|---|---|---|---|
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int D, r, ans;
cin >> r >> D >> ans;
for (int i = 0; i < 10; i++) {
ans += r * ans - D;
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int D, r, ans;
cin >> r >> D >> ans;
for (int i = 0; i < 10; i++) {
ans = r * ans - D;
cout << ans << endl;
}
} | [
"assignment.value.change"
] | 848,411 | 848,412 | u704011915 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t D, r, ans;
cin >> D >> r >> ans;
for (int i = 0; i < 10; i++) {
ans += r * ans - D;
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int D, r, ans;
cin >> r >> D >> ans;
for (int i = 0; i < 10; i++) {
ans = r * ans - D;
cout << ans << endl;
}
} | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove",
"assignment.value.change"
] | 848,413 | 848,412 | u704011915 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int D, r, ans;
cin >> D >> r >> ans;
for (int i = 0; i < 10; i++) {
ans += r * ans - D;
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int D, r, ans;
cin >> r >> D >> ans;
for (int i = 0; i < 10; i++) {
ans = r * ans - D;
cout << ans << endl;
}
} | [
"expression.operation.binary.remove",
"assignment.value.change"
] | 848,414 | 848,412 | u704011915 | cpp |
p03036 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using namespace std;
using ll = long long;
int main() {
int r, d;
vector<ll> x(11);
cin >> r >> d >> x[0];
rep(i, 10) x[i + 1] = (ll)r * x[i] - d;
rep(i, 11) cout << x[i] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using namespace std;
using ll = long long;
int main() {
int r, d;
vector<ll> x(11);
cin >> r >> d >> x[0];
rep(i, 10) x[i + 1] = (ll)r * x[i] - d;
rep(i, 10) cout << x[i + 1] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 848,427 | 848,428 | u058958514 | cpp |
p03036 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using namespace std;
using ll = long long;
int main() {
int r, d;
vector<ll> x(11);
cin >> r >> d >> x[0];
rep(i, 10) x[i + 1] = r * x[i] - d;
rep(i, 11) cout << x[i] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using namespace std;
using ll = long long;
int main() {
int r, d;
vector<ll> x(11);
cin >> r >> d >> x[0];
rep(i, 10) x[i + 1] = (ll)r * x[i] - d;
rep(i, 10) cout << x[i + 1] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 848,429 | 848,428 | u058958514 | cpp |
p03036 | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<string>
#define lin1(x) \
ll int x; \
x = scan();
#define lin2(x, y) \
ll int x, y; \
x = scan(), y = scan();
#define lin3(x, y, z) \
ll int x, y, z; \
x = scan(), y = scan(), z = scan();
#define pb(x) push_back(x)
#define makep(x, y) make_pair(x, y)
#define mx(a, b) (a) > (b) ? (a) : (b)
#define mn(a, b) (a) < (b) ? (a) : (b)
#define fori(s, e) for (i = s; i <= e; i++)
#define forj(s, e) for (j = s; j <= e; j++)
#define fork(s, e) for (k = s; k <= e; k++)
#define rep(i, s, e) for (int i = s; i <= e; i++)
#define brep(i, s, e) for (int i = s; i >= e; i--)
#define all(x) x.begin(), x.end()
#define mem(x, y) memset(x, y, sizeof(x));
#define bits1(x) __builtin_popcount(x)
#define pi 3.14159265358979323846264338327950
#define MOD7 1000000007
#define MOD9 1000000009
#define fast \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
using namespace std::tr1;
int main() {
#ifdef RAHUL
freopen("input.txt", "r", stdin);
#endif
int r, d, x;
cin >> r >> d >> x;
int max = x;
for (int i = 0; i < d; ++i) {
/* code */
max = r * max - d;
cout << max << endl;
}
return 0;
} | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<string>
#define lin1(x) \
ll int x; \
x = scan();
#define lin2(x, y) \
ll int x, y; \
x = scan(), y = scan();
#define lin3(x, y, z) \
ll int x, y, z; \
x = scan(), y = scan(), z = scan();
#define pb(x) push_back(x)
#define makep(x, y) make_pair(x, y)
#define mx(a, b) (a) > (b) ? (a) : (b)
#define mn(a, b) (a) < (b) ? (a) : (b)
#define fori(s, e) for (i = s; i <= e; i++)
#define forj(s, e) for (j = s; j <= e; j++)
#define fork(s, e) for (k = s; k <= e; k++)
#define rep(i, s, e) for (int i = s; i <= e; i++)
#define brep(i, s, e) for (int i = s; i >= e; i--)
#define all(x) x.begin(), x.end()
#define mem(x, y) memset(x, y, sizeof(x));
#define bits1(x) __builtin_popcount(x)
#define pi 3.14159265358979323846264338327950
#define MOD7 1000000007
#define MOD9 1000000009
#define fast \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
using namespace std::tr1;
int main() {
#ifdef RAHUL
freopen("input.txt", "r", stdin);
#endif
int r, d, x;
cin >> r >> d >> x;
int max = x;
for (int i = 0; i < 10; ++i) {
/* code */
max = r * max - d;
cout << max << endl;
}
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 848,432 | 848,433 | u113081402 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 6 && a <= 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (6 <= a && a <= 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 848,438 | 848,439 | u787972656 | cpp |
p03035 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
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 (5 >= A) {
cout << 0 << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
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 (5 >= A) {
cout << 0 << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,447 | 848,448 | u560801892 | 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"
] | 848,460 | 848,461 | u431475157 | 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"
] | 848,462 | 848,461 | u431475157 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define optimize_cin() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define MSG(x) std::cout << #x << " : " << x << "\n";
using namespace std;
using lint = long long;
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 (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
cout << 0 << endl;
} else if (A <= 6 && A <= 12) {
cout << B / 2 << endl;
} else {
cout << B << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define optimize_cin() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define MSG(x) std::cout << #x << " : " << x << "\n";
using namespace std;
using lint = long long;
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 (b < a) {
a = b;
return 1;
}
return 0;
}
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;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 848,474 | 848,475 | u890870565 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(void) {
int age, fee;
int result;
cin >> age >> fee;
// age = stoi(age);
if (13 <= age) {
result = fee;
} else if (6 <= age && age <= 12) {
result = fee;
} else {
result = 0;
}
cout << fee << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int age, fee;
int result;
cin >> age >> fee;
if (13 <= age) {
result = fee;
} else if (6 <= age && age <= 12) {
result = fee / 2;
} else {
result = 0;
}
cout << result << endl;
return 0;
}
| [
"assignment.change",
"identifier.change",
"io.output.change"
] | 848,476 | 848,477 | u631279504 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int x, y, z;
cin >> x >> y;
if (x >= 13) {
z = y;
} else if (x >= 5 && x <= 12) {
z = y / 2;
} else {
z = 0;
}
cout << z << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int x, y, z;
cin >> x >> y;
if (x >= 13) {
z = y;
} else if (x > 5 && x <= 12) {
z = y / 2;
} else {
z = 0;
}
cout << z << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,487 | 848,488 | u759162415 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A;
int B;
int C = 0;
cin >> A;
cin >> B;
if (A >= 13) {
cout << B << endl;
} else if (A >= 6 && A <= 12) {
cout << int(B / 2) << endl;
} else if (A < 5) {
cout << C << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A;
int B;
int C = 0;
cin >> A;
cin >> B;
if (A >= 13) {
cout << B << endl;
} else if (A >= 6 && A <= 12) {
cout << int(B / 2) << endl;
} else if (A <= 5) {
cout << C << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,489 | 848,490 | u822037230 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A;
int B;
int C = 0;
cin >> A;
cin >> B;
if (A >= 13) {
cout << B << endl;
} else if (A >= 6 && A <= 12) {
cout << B / 2 << endl;
} else if (A < 5) {
cout << C << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A;
int B;
int C = 0;
cin >> A;
cin >> B;
if (A >= 13) {
cout << B << endl;
} else if (A >= 6 && A <= 12) {
cout << int(B / 2) << endl;
} else if (A <= 5) {
cout << C << endl;
}
return 0;
} | [
"call.add",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,491 | 848,490 | u822037230 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 || a <= 12) {
cout << b / 2 << endl;
} else {
cout << "0" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 && a <= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 848,494 | 848,495 | u638860516 | 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 > 13 && a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a < 13 && a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,498 | 848,499 | u006721330 | 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;
}
}
| #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;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,521 | 848,522 | u342466195 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef unsigned char UINT8;
typedef short SINT16;
typedef unsigned short UINT16;
typedef int SINT32;
typedef unsigned int UINT32;
typedef long long SINT64;
typedef unsigned long long UINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(a) ((a) > (0) ? (a) : -(a))
#define rep(i, a, b) for (int(i) = int(a); (i) < int(b); (i)++)
#define rrep(i, a, b) for (int(i) = int(a); (i) >= int(b); (i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define pute(a) cout << endl
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define F first
#define S second
#define Pii pair<SINT32, SINT32>
#define Pll pair<SINT64, SINT64>
#define Piii pair<SINT32, pair<SINT32, SINT32>>
#define Plll pair<SINT64, pair<SINT64, SINT64>>
#define Vll(a, b, c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a, b, c, d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
int main() {
SINT64 A, B;
cin >> A >> B;
if (A >= 13) {
put(A);
} else if (A >= 6) {
put(A / 2);
} else {
put(0);
}
return 0;
}
// vector<vector<SINT64>> data(N,vector<SINT32>(3));
////2次元配列 vector<vector<vector<SINT64>>>
//data(N,vector<vector<SINT64>>(3,vector<SINT64>(3))); //3次元配列
// Vll(data,N,N); //2次元配列
// Vlll(data,N,N,N); //3次元配列
// sort(data.begin(),data.end());
// sort(data.begin(),data.end(),std::greater<SINT64>());
// __gcd(A,B);
// data.emplace_back(BUF); //後ろに追加
// data.erase(std::unique(data.begin(), data.end()), data.end());
// //ソート後に使用 同じ値を消す
// data.insert(data.begin() + X, 0); //X番目の要素に0を挿入
/*
vector<Pii> data(N);
rep(i,0,N) {
cin >> data[i].F;
cin >> data[i].S;
}
sort(data.begin(),data.end());
*/
/*
vector<Piii> data(N);
rep(i,0,N) {
cin >> data[i].F;
cin >> data[i].S.F;
cin >> data[i].S.S;
}
sort(data.begin(),data.end());
*/
// posi = lower_bound(data.begin(),data.end(), X) - data.begin();
// // X以上を探す posi = lower_bound(data.begin(),data.end(),make_pair(X,0)) -
// data.begin(); //pair
/* 文字列回転
string N;
cin >> N;
N = N[N.length()-1] + N.substr(0,N.length()-1);
s = to_string(i); //ストリング変換
*/
/* 文字列合成
string N,M;
cin >> N >> M;
SINT64 ans = 0;
ans = stoi(N+M);
*/
/*
//ワーシャルフロイド
vector<vector<SINT32>> dist(N,vector<SINT32>(N));
rep(i,0,N) {
rep(j,0,N) {
if (i != j) {
dist[i][j] = INF;
}
}
}
rep(k,0,N) {
rep(i,0,N) {
rep(j,0,N) {
dist[i][j] = MIN(dist[i][j], dist[i][k]+dist[k][j]);
}
}
}
*/
/* 優先度付きキュー
priority_queue<SINT64, vector<SINT64>, greater<SINT64>> data;
//小さいほうから取り出せる priority_queue<SINT64, vector<SINT64>> data;
//大きいほうから取り出せる
data.push(X); //X を挿入
data.top(); //先頭データ読み
data.pop(); //先頭データ削除
*/
/* SET コンテナ
set<SINT64> data;
data.insert(X); //X を挿入
data.erase(data.begin()); //先頭を削除
data.erase(--data.end()); //末尾を削除
*data.begin(); //先頭要素にアクセス
*data.rbegin(); //末尾要素にアクセス
//全表示
set<SINT64>::iterator it; //イテレータを用意
for(it = data.begin(); it != data.end(); it++) {
cout << *it << " ";
}
cout << endl;
//N番目を一部表示
set<SINT64>::iterator it; // イテレータを用意
it = data.begin();
rep (i,0,N) {
it++;
}
cout << *it << endl;
*/
/* map
map<string,SINT32> mp;
SINT32 N = 0;
SINT32 mx = 0;
cin >> N;
for (SINT32 i = 0; i < N; i++) {
string s;
cin >> s;
mp[s]++;
}
for(auto it=mp.begin();it!=mp.end();it++) {
mx=max(mx,it->second);
}
*/
/*
//順列全表示
//sortしてからでないと全列挙にならない
sort(data.begin(),data.end());
do {
cout << buf << endl;
rep(i,0,R) {
cout << data[i] << " ";
}
cout << endl;
} while (next_permutation(data.begin(),data.end()));
*/
// 桁指定表示
// ans = ans * M_PI;
// cout << setprecision(15) << ans << endl; | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef unsigned char UINT8;
typedef short SINT16;
typedef unsigned short UINT16;
typedef int SINT32;
typedef unsigned int UINT32;
typedef long long SINT64;
typedef unsigned long long UINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(a) ((a) > (0) ? (a) : -(a))
#define rep(i, a, b) for (int(i) = int(a); (i) < int(b); (i)++)
#define rrep(i, a, b) for (int(i) = int(a); (i) >= int(b); (i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define pute(a) cout << endl
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define F first
#define S second
#define Pii pair<SINT32, SINT32>
#define Pll pair<SINT64, SINT64>
#define Piii pair<SINT32, pair<SINT32, SINT32>>
#define Plll pair<SINT64, pair<SINT64, SINT64>>
#define Vll(a, b, c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a, b, c, d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
int main() {
SINT64 A, B;
cin >> A >> B;
if (A >= 13) {
put(B);
} else if (A >= 6) {
put(B / 2);
} else {
put(0);
}
return 0;
}
// vector<vector<SINT64>> data(N,vector<SINT32>(3));
////2次元配列 vector<vector<vector<SINT64>>>
//data(N,vector<vector<SINT64>>(3,vector<SINT64>(3))); //3次元配列
// Vll(data,N,N); //2次元配列
// Vlll(data,N,N,N); //3次元配列
// sort(data.begin(),data.end());
// sort(data.begin(),data.end(),std::greater<SINT64>());
// __gcd(A,B);
// data.emplace_back(BUF); //後ろに追加
// data.erase(std::unique(data.begin(), data.end()), data.end());
// //ソート後に使用 同じ値を消す
// data.insert(data.begin() + X, 0); //X番目の要素に0を挿入
/*
vector<Pii> data(N);
rep(i,0,N) {
cin >> data[i].F;
cin >> data[i].S;
}
sort(data.begin(),data.end());
*/
/*
vector<Piii> data(N);
rep(i,0,N) {
cin >> data[i].F;
cin >> data[i].S.F;
cin >> data[i].S.S;
}
sort(data.begin(),data.end());
*/
// posi = lower_bound(data.begin(),data.end(), X) - data.begin();
// // X以上を探す posi = lower_bound(data.begin(),data.end(),make_pair(X,0)) -
// data.begin(); //pair
/* 文字列回転
string N;
cin >> N;
N = N[N.length()-1] + N.substr(0,N.length()-1);
s = to_string(i); //ストリング変換
*/
/* 文字列合成
string N,M;
cin >> N >> M;
SINT64 ans = 0;
ans = stoi(N+M);
*/
/*
//ワーシャルフロイド
vector<vector<SINT32>> dist(N,vector<SINT32>(N));
rep(i,0,N) {
rep(j,0,N) {
if (i != j) {
dist[i][j] = INF;
}
}
}
rep(k,0,N) {
rep(i,0,N) {
rep(j,0,N) {
dist[i][j] = MIN(dist[i][j], dist[i][k]+dist[k][j]);
}
}
}
*/
/* 優先度付きキュー
priority_queue<SINT64, vector<SINT64>, greater<SINT64>> data;
//小さいほうから取り出せる priority_queue<SINT64, vector<SINT64>> data;
//大きいほうから取り出せる
data.push(X); //X を挿入
data.top(); //先頭データ読み
data.pop(); //先頭データ削除
*/
/* SET コンテナ
set<SINT64> data;
data.insert(X); //X を挿入
data.erase(data.begin()); //先頭を削除
data.erase(--data.end()); //末尾を削除
*data.begin(); //先頭要素にアクセス
*data.rbegin(); //末尾要素にアクセス
//全表示
set<SINT64>::iterator it; //イテレータを用意
for(it = data.begin(); it != data.end(); it++) {
cout << *it << " ";
}
cout << endl;
//N番目を一部表示
set<SINT64>::iterator it; // イテレータを用意
it = data.begin();
rep (i,0,N) {
it++;
}
cout << *it << endl;
*/
/* map
map<string,SINT32> mp;
SINT32 N = 0;
SINT32 mx = 0;
cin >> N;
for (SINT32 i = 0; i < N; i++) {
string s;
cin >> s;
mp[s]++;
}
for(auto it=mp.begin();it!=mp.end();it++) {
mx=max(mx,it->second);
}
*/
/*
//順列全表示
//sortしてからでないと全列挙にならない
sort(data.begin(),data.end());
do {
cout << buf << endl;
rep(i,0,R) {
cout << data[i] << " ";
}
cout << endl;
} while (next_permutation(data.begin(),data.end()));
*/
// 桁指定表示
// ans = ans * M_PI;
// cout << setprecision(15) << ans << endl; | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 848,546 | 848,547 | u824905100 | cpp |
p03035 | /*input
12 100
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
signed main() {
IOS;
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 5) {
cout << b / 2 << endl;
} else
cout << 0;
return 0;
}
| /*input
12 100
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
signed main() {
IOS;
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a > 5) {
cout << b / 2 << endl;
} else
cout << 0;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,560 | 848,561 | u367694521 | cpp |
p03035 |
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define NUM 100001
int main() {
int A, B;
cin >> A >> B;
if (A > 12) {
cout << B << endl;
}
if (6 <= A && A <= 12) {
cout << B / 2 << endl;
}
if (A < 5) {
cout << 0 << endl;
}
return 0;
} | #include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define NUM 100001
int main() {
int A, B;
cin >> A >> B;
if (A > 12) {
cout << B << endl;
}
if (6 <= A && A <= 12) {
cout << B / 2 << endl;
}
if (A <= 5) {
cout << 0 << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,562 | 848,563 | u551841275 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int money = 0;
if (A <= 5) {
money = 0;
} else if (6 <= A <= 12) {
money = B / 2;
} else {
money = B;
}
cout << money << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int money = 0;
if (A <= 5) {
money = 0;
} else if (6 <= A && A <= 12) {
money = B / 2;
} else {
money = B;
}
cout << money << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 848,564 | 848,565 | u910362203 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B, ans;
cin >> A >> B;
ans = 0;
if (A > 12) {
ans = B;
} else if (A > 6) {
ans = B / 2;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B, ans;
cin >> A >> B;
ans = 0;
if (A > 12) {
ans = B;
} else if (A > 5) {
ans = B / 2;
}
cout << ans << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,576 | 848,577 | u056033056 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ul;
typedef signed long long ll;
ul over = 1000000007;
mt19937 mt(time(nullptr));
// uniform_int_distribution< int > rand_int(0, 10) // rand[0, 10] inclusive
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ul;
typedef signed long long ll;
ul over = 1000000007;
mt19937 mt(time(nullptr));
// uniform_int_distribution< int > rand_int(0, 10) // rand[0, 10] inclusive
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,580 | 848,581 | u691764803 | 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;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 12) {
cout << B << endl;
} else if (A < 6) {
cout << 0 << endl;
} else {
cout << B / 2 << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,582 | 848,583 | u615294224 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (13 <= a) {
cout << b << endl;
} else if (5 < a) {
cout << b << endl;
} else
cout << 0 << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (13 <= a) {
cout << b << endl;
} else if (5 < a) {
cout << b / 2 << endl;
} else
cout << 0 << endl;
}
| [
"expression.operation.binary.add"
] | 848,586 | 848,587 | u559218489 | cpp |
p03035 | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
int main() {
int A, B;
cin >> A >> B;
int ret = 0;
if (B >= 13)
ret = B;
else if (B >= 6)
ret = B / 2;
else
ret = 0;
cout << ret << endl;
}
void cheatsheet() {
// loop
// vector<int> vec(10);
vector<int> vecloop;
REP(i, 10) { vecloop.push_back(i); }
// swap
int a = 1;
int b = 5;
swap(a, b); // -> a = 5, b = 1
// sort
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
sort(arr, arr + 9, greater<int>()); // 9 8 7 6 5 4 3 2 1
// lower
vector<int> vec(arr, end(arr));
sort(vec.begin(), vec.end());
cout << lower_bound(vec.begin(), vec.end(), 2)[0]; // 2
// map
map<Pll, ll> m;
m[Pll(10, 100)] = 100;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
int main() {
int A, B;
cin >> A >> B;
int ret = 0;
if (A >= 13)
ret = B;
else if (A >= 6)
ret = B / 2;
else
ret = 0;
cout << ret << endl;
}
void cheatsheet() {
// loop
// vector<int> vec(10);
vector<int> vecloop;
REP(i, 10) { vecloop.push_back(i); }
// swap
int a = 1;
int b = 5;
swap(a, b); // -> a = 5, b = 1
// sort
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
sort(arr, arr + 9, greater<int>()); // 9 8 7 6 5 4 3 2 1
// lower
vector<int> vec(arr, end(arr));
sort(vec.begin(), vec.end());
cout << lower_bound(vec.begin(), vec.end(), 2)[0]; // 2
// map
map<Pll, ll> m;
m[Pll(10, 100)] = 100;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 848,588 | 848,589 | u176686904 | 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 < 13 && a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a < 13 && a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [] | 848,590 | 848,591 | u514429645 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <sys/timeb.h>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(i, 0, n)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFL 1100000000000000000LL
#define EPS (1e-10)
#define MOD 1000000007
#define PI 3.1415926536
#define RMAX 4294967295
typedef long long ll;
typedef pair<int, int> Pi;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<Pi> vPi;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<double>> vvd;
typedef vector<vector<Pi>> vvPi;
typedef priority_queue<int, vector<int>, greater<int>> pqli;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqlll;
typedef priority_queue<Pi, vector<Pi>, greater<Pi>> pqlP;
struct Edge {
int from, to, cost;
bool operator<(Edge e) { return cost < e.cost; }
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
template <class T> using vec = vector<T>;
template <class T> using pql = priority_queue<T, vector<T>, greater<T>>;
string debug_show(Pi a) {
return "(" + to_string(a.first) + "," + to_string(a.second) + ")";
}
template <class T> struct augEdge {
T from, to;
int cost;
bool operator<(augEdge e) { return cost < e.cost; }
bool operator>(augEdge e) { return cost > e.cost; }
};
template <class T> using augGraph = vector<augEdge<T>>;
bool pairCompare(const Pi &firstElof, const Pi &secondElof) {
return firstElof.second > secondElof.second;
}
ll gcd(ll a, ll b) {
ll temp;
while (a % b != 0) {
temp = b;
b = a % b;
a = temp;
}
return b;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 12 && a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <sys/timeb.h>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(i, 0, n)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFL 1100000000000000000LL
#define EPS (1e-10)
#define MOD 1000000007
#define PI 3.1415926536
#define RMAX 4294967295
typedef long long ll;
typedef pair<int, int> Pi;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<Pi> vPi;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<double>> vvd;
typedef vector<vector<Pi>> vvPi;
typedef priority_queue<int, vector<int>, greater<int>> pqli;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqlll;
typedef priority_queue<Pi, vector<Pi>, greater<Pi>> pqlP;
struct Edge {
int from, to, cost;
bool operator<(Edge e) { return cost < e.cost; }
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
template <class T> using vec = vector<T>;
template <class T> using pql = priority_queue<T, vector<T>, greater<T>>;
string debug_show(Pi a) {
return "(" + to_string(a.first) + "," + to_string(a.second) + ")";
}
template <class T> struct augEdge {
T from, to;
int cost;
bool operator<(augEdge e) { return cost < e.cost; }
bool operator>(augEdge e) { return cost > e.cost; }
};
template <class T> using augGraph = vector<augEdge<T>>;
bool pairCompare(const Pi &firstElof, const Pi &secondElof) {
return firstElof.second > secondElof.second;
}
ll gcd(ll a, ll b) {
ll temp;
while (a % b != 0) {
temp = b;
b = a % b;
a = temp;
}
return b;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a <= 12 && a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,594 | 848,595 | u702133921 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline T GCD(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline T LCM(T a, T b) { return a * b / GCD(a, b); }
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;
}
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline T GCD(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline T LCM(T a, T b) { return a * b / GCD(a, b); }
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b << endl;
} else if (a > 5) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,608 | 848,607 | u962104148 | cpp |
p03035 | #include <bits/stdc++.h>
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;
} | #include <bits/stdc++.h>
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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,609 | 848,610 | u281368263 | cpp |
p03035 | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
#define yes "Yes"
#define no "No"
typedef pair<int, int> P;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a >= 13)
print(b);
else if (a < 5)
print(0);
else
print(b / 2);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
#define yes "Yes"
#define no "No"
typedef pair<int, int> P;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a >= 13)
print(b);
else if (a <= 5)
print(0);
else
print(b / 2);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,611 | 848,612 | u601825761 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int N, S;
cin >> S >> N;
if (S >= 13) {
cout << N << endl;
} else if (S >= 6) {
cout << S / 2 << endl;
} else {
cout << "0" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, S;
cin >> S >> N;
if (S >= 13) {
cout << N << endl;
} else if (S >= 6) {
cout << N / 2 << endl;
} else {
cout << "0" << endl;
}
return 0;
} | [
"identifier.change",
"io.output.change"
] | 848,628 | 848,629 | u534015096 | cpp |
p03035 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <queue>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void solve(int n, int k, vector<char> &cv) { cv[k - 1] = cv[k - 1] + 0x20; }
int main(int argc, char const *argv[]) {
int a, b;
cin >> a;
cin >> b;
if (a < 6) {
cout << 0;
} else if (6 <= a && a < 13) {
cout << b / 2;
} else {
cout << a;
}
return 0;
}
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <queue>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void solve(int n, int k, vector<char> &cv) { cv[k - 1] = cv[k - 1] + 0x20; }
int main(int argc, char const *argv[]) {
int a, b;
cin >> a;
cin >> b;
if (a < 6) {
cout << 0;
} else if (6 <= a && a < 13) {
cout << b / 2;
} else {
cout << b;
}
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 848,630 | 848,631 | u767777873 | 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 (6 < 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 < 6)
cout << 0 << endl;
else if (6 <= a && a < 13)
cout << b / 2 << endl;
else
cout << b << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,634 | 848,635 | u066137306 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
int main() {
int a, b;
cin >> a >> b;
if (13 <= a) {
cout << b << endl;
} else if (6 <= a <= 12) {
cout << b / 2 << endl;
} else if (a <= 5) {
b = 0;
cout << b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
int main() {
int a, b;
cin >> a >> b;
if (13 <= a) {
cout << b << endl;
} else if (6 <= a && a <= 12) {
cout << b / 2 << endl;
} else if (a <= 5) {
b = 0;
cout << b << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 848,645 | 848,646 | u960490836 | cpp |
p03035 | #include <iostream>
#include <stdio.h>
int main(int argc, char **argv) {
int A, B;
std::cin >> A;
std::cin >> B;
int C = A > 12 ? B : A > 6 ? B / 2 : 0;
std::cout << C;
return 0;
} | #include <iostream>
#include <stdio.h>
int main(int argc, char **argv) {
int A, B;
std::cin >> A;
std::cin >> B;
int C = A > 12 ? B : A > 5 ? B / 2 : 0;
std::cout << C;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 848,655 | 848,656 | u547728054 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, kk;
cin >> N >> K;
if (N < 5) {
cout << 0 << endl;
} else if (N < 13) {
cout << K / 2 << endl;
} else {
cout << K << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, kk;
cin >> N >> K;
if (N < 6) {
cout << 0 << endl;
} else if (N < 13) {
cout << K / 2 << endl;
} else {
cout << K << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 848,666 | 848,667 | u041855176 | cpp |
p03035 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
using ll = long long;
using db = double;
using st = string;
using ch = char;
using vll = V<ll>;
using vpll = V<pair<ll, ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i > (ll)(a); i--)
#define oFOR(i, a, b) for (ll i = (a); i < (ll)(b); i += 2)
#define bgn begin()
#define en end()
#define SORT(a) sort((a).bgn, (a).en)
#define REV(a) reverse((a).bgn, (a).en)
#define M(a, b) max(a, b)
#define rM(a, b) min(a, b)
#define fi first
#define se second
#define sz size()
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) __lcm(a, b)
#define co(a) cout << a << endl;
#define ci(a) cin >> a;
int main() {
ll a, b;
ci(a >> b);
if (a >= 13) {
co(b)
} else if (6 <= a || a <= 12) {
co(b / 2)
} else {
co(0)
}
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
using ll = long long;
using db = double;
using st = string;
using ch = char;
using vll = V<ll>;
using vpll = V<pair<ll, ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i > (ll)(a); i--)
#define oFOR(i, a, b) for (ll i = (a); i < (ll)(b); i += 2)
#define bgn begin()
#define en end()
#define SORT(a) sort((a).bgn, (a).en)
#define REV(a) reverse((a).bgn, (a).en)
#define M(a, b) max(a, b)
#define rM(a, b) min(a, b)
#define fi first
#define se second
#define sz size()
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) __lcm(a, b)
#define co(a) cout << a << endl;
#define ci(a) cin >> a;
int main() {
ll a, b;
ci(a >> b);
if (a >= 13) {
co(b)
} else if (6 <= a && a <= 12) {
co(b / 2)
} else {
co(0)
}
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 848,703 | 848,704 | u835924161 | cpp |
p03035 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
if (12 < A)
ans = B;
if (6 <= A || A <= 12)
ans = B / 2;
if (A == 0)
ans = 0;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
if (12 < A)
ans = B;
if (6 <= A && A <= 12)
ans = B / 2;
if (A == 0)
ans = 0;
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 848,707 | 848,708 | u771072294 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
if (6 <= a <= 12)
cout << b / 2 << endl;
if (a <= 5)
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;
if (6 <= a && a <= 12)
cout << b / 2 << endl;
if (a <= 5)
cout << "0" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 848,709 | 848,710 | u326785296 | cpp |
p03035 | /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (ll(i) = (n)-1; (i) >= 0; (i)--)
#define FOR(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define FORR(i, a, b) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define DEBUG(x) cout << #x << ": " << x << endl
#define CHMAX(a, b) a = max((a), (b))
#define CHMIN(a, b) a = min((a), (b))
/*}}}*/
int main() {
ll a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << endl;
if (a > 12)
cout << b << endl;
else
cout << b / 2 << endl;
return 0;
}
| /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (ll(i) = (n)-1; (i) >= 0; (i)--)
#define FOR(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define FORR(i, a, b) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define DEBUG(x) cout << #x << ": " << x << endl
#define CHMAX(a, b) a = max((a), (b))
#define CHMIN(a, b) a = min((a), (b))
/*}}}*/
int main() {
ll a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << endl;
else if (a > 12)
cout << b << endl;
else
cout << b / 2 << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 848,711 | 848,712 | u088893297 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define LP(i, n) for (int i = 0; i < n; i++)
#define LPIN(n, a) \
for (int i = 0; i < n; i++) \
cin >> a[i]
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 <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define LP(i, n) for (int i = 0; i < n; i++)
#define LPIN(n, a) \
for (int i = 0; i < n; i++) \
cin >> a[i]
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"
] | 848,717 | 848,718 | u271153916 | cpp |
p03035 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
if (A >= 13)
ans = B;
else if (A <= 12 && B >= 6)
ans = B / 2;
cout << ans << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
if (A >= 13)
ans = B;
else if (A <= 12 && A >= 6)
ans = B / 2;
cout << ans << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 848,721 | 848,722 | u912048901 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
cout << 0 << endl;
} else if (a < 13) {
cout << 50 << endl;
} else {
cout << 100 << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
cout << 0 << endl;
} else if (a < 13) {
cout << b / 2 << endl;
} else {
cout << b << endl;
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 848,732 | 848,733 | u564755644 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
B = 0;
} else if (A > 6 && A <= 12) {
B = B / 2;
} else {
B = B;
}
cout << B << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
B = 0;
} else if (A >= 6 && A <= 12) {
B = B / 2;
} else {
B = B;
}
cout << B << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,734 | 848,735 | u453634104 | cpp |
p03035 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
#define rSort(a) sort(a.rbegin(), a.rend())
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define Sum(a) accumulate(a.begin(), a.end(), 0)
#define REP(i, n) for (UI i = 0; i < n; i++)
#define REPR(i, n) for (UI i = n; i >= 0; i--)
#define FOR(i, m, n) for (UI i = m; i < n; i++)
#define pb(i) push_back(i)
#define MOD (LL)1e9 + 7;
#define INF (LL)1 << 62;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
LL A, B;
LL ans = 0;
cin >> A >> B;
if (A >= 13) {
ans = B;
} else if (A > 6 && A <= 12) {
ans = B / 2;
} else {
ans = 0;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
#define rSort(a) sort(a.rbegin(), a.rend())
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define Sum(a) accumulate(a.begin(), a.end(), 0)
#define REP(i, n) for (UI i = 0; i < n; i++)
#define REPR(i, n) for (UI i = n; i >= 0; i--)
#define FOR(i, m, n) for (UI i = m; i < n; i++)
#define pb(i) push_back(i)
#define MOD (LL)1e9 + 7;
#define INF (LL)1 << 62;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
LL A, B;
LL ans = 0;
cin >> A >> B;
if (A >= 13) {
ans = B;
} else if (A >= 6 && A <= 12) {
ans = B / 2;
} else {
ans = 0;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,740 | 848,741 | u335104842 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (13 <= A) {
cout << B;
} else if (6 <= A <= 12) {
cout << B / 2;
} else if (A <= 5) {
cout << 0;
}
} | #include <bits/stdc++.h>
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 if (A <= 5) {
cout << 0;
}
} | [
"control_flow.branch.if.condition.change"
] | 848,745 | 848,746 | u379928983 | cpp |
p03035 | #include <algorithm>
#include <iostream>
#include <string>
int main() {
int a;
int b;
std::cin >> a >> b;
int r;
if (a < 5) {
r = 0;
} else if (a <= 12) {
r = b / 2;
} else {
r = b;
}
std::cout << r << std::endl;
} | #include <algorithm>
#include <iostream>
#include <string>
int main() {
int a;
int b;
std::cin >> a >> b;
int r;
if (a <= 5) {
r = 0;
} else if (a <= 12) {
r = b / 2;
} else {
r = b;
}
std::cout << r << std::endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 848,752 | 848,753 | u099124596 | cpp |
p03036 | // Darker and Darker
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
long long ans = x;
rep(i, 11) {
cout << ans << endl;
ans = ans * r - d;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
long long ans = x * r - d;
rep(i, 10) {
cout << ans << endl;
ans = ans * r - d;
}
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 848,759 | 848,760 | u642384509 | cpp |
p03036 | /*
author : nishi5451
created : 15.08.2020 00:47:50
*/
#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 r, d, x;
cin >> r >> d >> x;
rep(i, 20) {
x = r * x - d;
cout << x << endl;
}
return 0;
} | /*
author : nishi5451
created : 15.08.2020 00:47:50
*/
#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 r, d, x;
cin >> r >> d >> x;
rep(i, 10) {
x = r * x - d;
cout << x << endl;
}
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 848,765 | 848,766 | u033937898 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
long long r, D, x;
cin >> r >> D >> x;
for (int i = 0; i < 10; i++) {
x = r * x - D;
}
cout << x << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
long long r, D, x;
cin >> r >> D >> x;
for (int i = 0; i < 10; i++) {
x = r * x - D;
cout << x << endl;
}
} | [] | 848,767 | 848,768 | u686962993 | cpp |
p03036 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main() {
ll r, d, x;
cin >> r >> d >> x;
ll ans = x;
rrep(i, 10) {
ans = ans * r - d;
mes(ans);
}
mes(0);
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main() {
ll r, d, x;
cin >> r >> d >> x;
ll ans = x;
rrep(i, 10) {
ans = ans * r - d;
mes(ans);
}
}
| [
"call.remove"
] | 848,774 | 848,775 | u038537254 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
long long sum = 0;
for (int i = 0; i < 10; i++) {
sum = sum * r - d;
cout << sum << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
int sum = x;
for (int i = 0; i < 10; i++) {
sum = sum * r - d;
cout << sum << endl;
}
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 848,815 | 848,816 | u736265891 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, r, d;
cin >> r >> d >> x;
for (int i = 2000; i <= 2010; i++) {
x = r * x - d;
cout << x << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, r, d;
cin >> r >> d >> x;
for (int i = 2001; i <= 2010; i++) {
x = r * x - d;
cout << x << endl;
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 848,819 | 848,820 | u487914635 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
x = r * x - d;
cout << x;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
x = r * x - d;
cout << x << endl;
}
return 0;
} | [
"io.output.newline.add"
] | 848,823 | 848,824 | u313970998 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
int a[12];
a[0] = x;
for (int i = 1; i < 10; i++) {
a[i] = r * a[i - 1] - D;
}
for (int i = 1; i < 11; i++)
cout << a[i] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
int a[12];
a[0] = x;
for (int i = 1; i < 11; i++) {
a[i] = r * a[i - 1] - D;
}
for (int i = 1; i < 11; i++)
cout << a[i] << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 848,825 | 848,826 | u392973556 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
int a[12];
a[0] = x;
for (int i = 1; i < 10; i++) {
a[i] = r * a[i - 1] - D;
}
for (int i = 0; i < 10; i++)
cout << a[i] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
int a[12];
a[0] = x;
for (int i = 1; i < 11; i++) {
a[i] = r * a[i - 1] - D;
}
for (int i = 1; i < 11; i++)
cout << a[i] << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 848,827 | 848,826 | u392973556 | cpp |
p03036 | #include <stdio.h>
int main(void) {
int r, x, K;
scanf("%d %d %d", &r, &K, &x);
for (int loop = 0; loop < 10; loop++) {
x = x * r - K;
printf("%d", x);
}
return 0;
} | #include <stdio.h>
int main(void) {
int r, x, K;
scanf("%d %d %d", &r, &K, &x);
for (int loop = 0; loop < 10; loop++) {
x = x * r - K;
printf("%d\n", x);
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 848,828 | 848,829 | u716903426 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
using ll = long long;
using vl = vector<long long>;
using P = pair<long long, long long>;
int main() {
ll r, d, x0;
cin >> r >> d >> x0;
vl x(11);
x[0] = x0;
rep(i, 9) { x[i + 1] = r * x[i] - d; }
rep(i, 9) cout << x[i + 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
using ll = long long;
using vl = vector<long long>;
using P = pair<long long, long long>;
int main() {
ll r, d, x0;
cin >> r >> d >> x0;
vl x(11);
x[0] = x0;
rep(i, 10) { x[i + 1] = r * x[i] - d; }
rep(i, 10) cout << x[i + 1] << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 848,830 | 848,831 | u583628727 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
using ll = long long;
using vl = vector<long long>;
using P = pair<long long, long long>;
int main() {
ll r, d, x0;
cin >> r >> d >> x0;
vl x(11);
x[0] = x0;
rep(i, 9) { x[i + 1] = r * x[i] - d; }
rep(i, 10) cout << x[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
using ll = long long;
using vl = vector<long long>;
using P = pair<long long, long long>;
int main() {
ll r, d, x0;
cin >> r >> d >> x0;
vl x(11);
x[0] = x0;
rep(i, 10) { x[i + 1] = r * x[i] - d; }
rep(i, 10) cout << x[i + 1] << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 848,832 | 848,831 | u583628727 | cpp |
p03036 | #include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int r, d, init;
cin >> r >> d >> init;
int ans[11];
ans[0] = init;
for (int i = 1; i < 10; i++) {
ans[i] = ans[i - 1] * r - d;
cout << ans[i] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int r, d, init;
cin >> r >> d >> init;
int ans[11];
ans[0] = init;
for (int i = 1; i < 11; i++) {
ans[i] = ans[i - 1] * r - d;
cout << ans[i] << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 848,835 | 848,836 | u904995051 | cpp |
p03036 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
long long r, d, x;
cin >> r >> d >> x;
rep(i, 9) {
x = r * x - d;
cout << x << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
long long r, d, x;
cin >> r >> d >> x;
rep(i, 10) {
x = r * x - d;
cout << x << endl;
}
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 848,837 | 848,838 | u890331732 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x;
cin >> r, d, x;
for (int i = 0; i < 10; i++) {
x = r * x - d;
cout << x << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
x = r * x - d;
cout << x << endl;
}
return 0;
}
| [] | 848,846 | 848,847 | u233383925 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 2000; i < 2011; i++) {
x = x * r - d;
cout << x << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 2000; i < 2010; i++) {
x = x * r - d;
cout << x << endl;
}
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 848,853 | 848,854 | u371051907 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int r, D, x;
cin >> r >> D >> x;
for (int i = 0; i < 10; i++) {
x = r * x - D;
cout << r << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int r, D, x;
cin >> r >> D >> x;
for (int i = 0; i < 10; i++) {
x = r * x - D;
cout << x << endl;
}
}
| [
"identifier.change",
"io.output.change"
] | 848,860 | 848,861 | u101777447 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int r, D, x;
cin >> r >> D >> x;
for (int i = 0; i < 10; i++) {
r = r * x - D;
cout << r << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int r, D, x;
cin >> r >> D >> x;
for (int i = 0; i < 10; i++) {
x = r * x - D;
cout << x << endl;
}
}
| [
"assignment.variable.change",
"identifier.change",
"io.output.change"
] | 848,862 | 848,861 | u101777447 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> V;
#define rep(a, j, n) for (ll i = a; i < j; i = i + n)
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll INF = 1000000009;
ll i;
int main() {
ll r, d;
V x(11);
cin >> r >> d >> x.at(0);
rep(1, 11, 1) {
x.at(i) = r * x.at(i) - d;
cout << x.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> V;
#define rep(a, j, n) for (ll i = a; i < j; i = i + n)
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll INF = 1000000009;
ll i;
int main() {
ll r, d;
V x(11);
cin >> r >> d >> x.at(0);
rep(1, 11, 1) {
x.at(i) = r * x.at(i - 1) - d;
cout << x.at(i) << endl;
}
} | [
"assignment.change"
] | 848,865 | 848,866 | u696486967 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < 10; i++) {
c = 2 * c - b;
cout << c << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < 10; i++) {
c = a * c - b;
cout << c << endl;
}
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 848,869 | 848,870 | u613960672 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
vector<int> x(11);
cin >> r >> D >> x.at(0);
for (int i = 1; i < 11; i++) {
x.at(i) = r * x.at(i - 1) - D;
}
for (int i = 0; i < 11; i++) {
cout << x.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
vector<int> x(11);
cin >> r >> D >> x.at(0);
for (int i = 1; i < 11; i++) {
x.at(i) = r * x.at(i - 1) - D;
}
for (int i = 1; i < 11; i++) {
cout << x.at(i) << endl;
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 848,873 | 848,874 | u568010843 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long r, D, x;
cin >> r, D, x;
for (int i = 0; i < 10; i++) {
int x2 = r * x - D;
cout << x2 << endl;
x = x2;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long r, D, x;
cin >> r >> D >> x;
for (int i = 0; i < 10; i++) {
long long x2 = r * x - D;
cout << x2 << endl;
x = x2;
}
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 848,879 | 848,880 | u351265848 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
long long r, d, x, xn;
cin >> r >> d >> x;
REP(i, 10) {
xn = r * x - d;
cout << xn;
x = xn;
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
long long r, d, x, xn;
cin >> r >> d >> x;
REP(i, 10) {
xn = r * x - d;
cout << xn << endl;
x = xn;
}
} | [
"io.output.newline.add"
] | 848,888 | 848,889 | u082801599 | cpp |
p03036 | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
// #include <bits/stdc++.h> all
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
static const int giga = pow(10, 9);
// double pi = 3.141592653589793238463;
int main(void) {
int r, d, x;
cin >> r >> d >> x;
int temp = x;
for (int i = 1; i <= 10; i++) {
temp = r * temp - 10;
cout << temp << endl;
}
return 0;
} | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
// #include <bits/stdc++.h> all
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
static const int giga = pow(10, 9);
// double pi = 3.141592653589793238463;
int main(void) {
int r, d, x;
cin >> r >> d >> x;
int temp = x;
for (int i = 1; i <= 10; i++) {
temp = r * temp - d;
cout << temp << endl;
}
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 848,890 | 848,891 | u746560455 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
long long x;
cin >> r >> D >> x;
for (int i = 0; i < 10; i++) {
x = r * x - D;
cout << x;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
long long x;
cin >> r >> D >> x;
for (int i = 0; i < 10; i++) {
x = r * x - D;
cout << x << "\n";
}
return 0;
} | [
"io.output.change"
] | 848,912 | 848,913 | u777477705 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int r, D, x;
cin >> r >> D >> x;
cout << x;
for (int i = 0; i < 10; i++) {
x = r * x - D;
cout << x << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int r, D, x;
cin >> r >> D >> x;
// cout << x;
for (int i = 0; i < 10; i++) {
x = r * x - D;
cout << x << endl;
}
return 0;
}
| [] | 848,914 | 848,915 | u767481489 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
// 入力受け取り, 入次数も管理する
int r, d, r2000;
cin >> r >> d >> r2000;
double data[11];
data[0] = r2000;
for (int i = 0; i < 10; i++) {
data[i + 1] = r * data[i] - d;
}
for (int i = 1; i <= 10; i++) {
cout << data[i] << "\n";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// 入力受け取り, 入次数も管理する
int r, d, r2000;
cin >> r >> d >> r2000;
double data[11];
data[0] = r2000;
for (int i = 0; i < 10; i++) {
data[i + 1] = r * data[i] - d;
}
for (int i = 1; i <= 10; i++) {
cout << (int)data[i] << "\n";
}
}
| [
"type_conversion.add"
] | 848,916 | 848,917 | u878116546 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
cin >> r >> D;
vector<int> X(10);
cin >> X.at(0);
for (int i = 0; i < 9; i++) {
X.at(i + 1) = r * X.at(i) - D;
cout << X.at(i + 1) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
cin >> r >> D;
vector<int> X(11);
cin >> X.at(0);
for (int i = 0; i < 10; i++) {
X.at(i + 1) = r * X.at(i) - D;
cout << X.at(i + 1) << endl;
}
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 848,920 | 848,921 | u550374978 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
cin >> r >> D;
vector<int> X;
cin >> X.at(0);
for (int i = 0; i < 10; i++) {
X.at(i + 1) = r * X.at(i) - D;
cout << X.at(i + 1) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
cin >> r >> D;
vector<int> X(11);
cin >> X.at(0);
for (int i = 0; i < 10; i++) {
X.at(i + 1) = r * X.at(i) - D;
cout << X.at(i + 1) << endl;
}
return 0;
}
| [
"call.arguments.add"
] | 848,922 | 848,921 | u550374978 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < 10; i++) {
a = a * c - b;
cout << a << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < 10; i++) {
c = a * c - b;
cout << c << endl;
}
} | [
"assignment.variable.change",
"identifier.change",
"io.output.change"
] | 848,927 | 848,928 | u577451218 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, d, xi;
int i, t;
cin >> r >> d >> xi;
t = d;
for (i = 0; i < 10; i++) {
t = ((r * t) - d);
cout << t << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, d, xi;
int i, t;
cin >> r >> d >> xi;
t = xi;
for (i = 0; i < 10; i++) {
t = ((r * t) - d);
cout << t << endl;
}
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 848,929 | 848,930 | u641500793 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, d, xi;
int i, t;
cin >> r >> d >> xi;
for (i = 0; i < 10; i++) {
t = ((r * t) - d);
cout << t << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, d, xi;
int i, t;
cin >> r >> d >> xi;
t = xi;
for (i = 0; i < 10; i++) {
t = ((r * t) - d);
cout << t << endl;
}
return 0;
}
| [
"assignment.add"
] | 848,931 | 848,930 | u641500793 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
int mo[11];
mo[0] = x;
for (int i = 1; i <= 10; i++) {
mo[i] = mo[i - 1] * r - d;
}
for (auto m : mo) {
cout << m << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
int mo[10];
mo[0] = x * r - d;
for (int i = 1; i <= 10; i++) {
mo[i] = mo[i - 1] * r - d;
}
for (auto m : mo) {
cout << m << endl;
}
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 848,942 | 848,943 | u264547551 | cpp |
p03036 | // Author:: Mohammad Faisal
// BEGINNING WITH THE NAME OF ALMIGHTY GOD ALLAH
#include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, n;
cin >> r >> d >> n;
int val;
for (int i = 2; i <= 10; i++) {
cout << r * n - d << endl;
n = r * n - d;
}
return 0;
}
| // Author:: Mohammad Faisal
// BEGINNING WITH THE NAME OF ALMIGHTY GOD ALLAH
#include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, n;
cin >> r >> d >> n;
// int val;
for (int i = 1; i <= 10; i++) {
cout << r * n - d << endl;
n = r * n - d;
}
return 0;
}
| [
"variable_declaration.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 848,956 | 848,957 | u993949676 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define Pi P<int, int>
#define elif else if
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
int c = 1;
for (int i = a; i >= b; i--)
c *= i;
return c;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
//先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
// 最短距離の表:c
// スタート:sx,sy
// ゴール:gx,gy
/*int bfs(V<V<char>> a){
Q<P<int,int>> b;
fo(i,a.sz){
fo(j,a[0].sz){
c[i][j]==INF;
}
}
b.push({sx,sy});
c[sx][sy]=0;
while(b.sz){
P d=b.front();
b.pop();
if(d=={gx,gy})
break;
fo(i,4){
int e=d.fi+mawari4[i],f=d.se+mawari4[i];
if(naka(e,f,a)&&a[e][f]=='.'&&c[e][f]==INF){
b.push({e,f});
c[e][f]==c[d.fi][d.se]+1;
}
}
}
return c[gx][gy];
}*/
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
signed main() {
int a, b, c;
cin >> a >> b >> c;
fo(i, 9) {
c = a * c - b;
cout << c << endl;
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define Pi P<int, int>
#define elif else if
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
int c = 1;
for (int i = a; i >= b; i--)
c *= i;
return c;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
//先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
// 最短距離の表:c
// スタート:sx,sy
// ゴール:gx,gy
/*int bfs(V<V<char>> a){
Q<P<int,int>> b;
fo(i,a.sz){
fo(j,a[0].sz){
c[i][j]==INF;
}
}
b.push({sx,sy});
c[sx][sy]=0;
while(b.sz){
P d=b.front();
b.pop();
if(d=={gx,gy})
break;
fo(i,4){
int e=d.fi+mawari4[i],f=d.se+mawari4[i];
if(naka(e,f,a)&&a[e][f]=='.'&&c[e][f]==INF){
b.push({e,f});
c[e][f]==c[d.fi][d.se]+1;
}
}
}
return c[gx][gy];
}*/
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
signed main() {
int a, b, c;
cin >> a >> b >> c;
fo(i, 10) {
c = a * c - b;
cout << c << endl;
}
cout << endl;
}
| [
"literal.number.change",
"call.arguments.change"
] | 848,960 | 848,961 | u790461875 | cpp |
p03036 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(obj) obj.begin(), obj.end()
#define UNIQUE(v) v.erase(unique(All(v)), v.end());
typedef long long ll;
typedef pair<int, int> P;
vector<P> vecp;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define N 1000
// input
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int r, d, x;
cin >> r >> d >> x;
REP(i, 10) {
int tmp = r * x - d;
cout << r * x - d;
x = tmp;
}
} | #include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(obj) obj.begin(), obj.end()
#define UNIQUE(v) v.erase(unique(All(v)), v.end());
typedef long long ll;
typedef pair<int, int> P;
vector<P> vecp;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define N 1000
// input
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int r, d, x;
cin >> r >> d >> x;
REP(i, 10) {
int tmp = r * x - d;
cout << r * x - d << endl;
x = tmp;
}
} | [
"io.output.newline.add"
] | 848,975 | 848,976 | u531746660 | cpp |
p03036 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(obj) obj.begin(), obj.end()
#define UNIQUE(v) v.erase(unique(All(v)), v.end());
typedef long long ll;
typedef pair<int, int> P;
vector<P> vecp;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define N 1000
// input
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int r, d, x;
cin >> r >> d >> x;
REP(i, d) {
int tmp = r * x - d;
cout << r * x - d;
x = tmp;
}
} | #include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(obj) obj.begin(), obj.end()
#define UNIQUE(v) v.erase(unique(All(v)), v.end());
typedef long long ll;
typedef pair<int, int> P;
vector<P> vecp;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define N 1000
// input
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int r, d, x;
cin >> r >> d >> x;
REP(i, 10) {
int tmp = r * x - d;
cout << r * x - d << endl;
x = tmp;
}
} | [
"io.output.newline.add"
] | 848,977 | 848,976 | u531746660 | cpp |
p03036 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
long rx[100];
rx[0] = (r * x) - D;
cout << rx[0] << endl;
for (int i = 1; i < 10; i++) {
rx[i] = 2 * rx[i - 1] - D;
cout << rx[i] << endl;
}
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
long rx[100];
rx[0] = (r * x) - D;
cout << rx[0] << endl;
for (int i = 1; i < 10; i++) {
rx[i] = r * rx[i - 1] - D;
cout << rx[i] << endl;
}
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 848,982 | 848,983 | u027424986 | cpp |
p03036 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
long rx[100];
rx[0] = (r * x) - 10;
cout << rx[0] << endl;
for (int i = 1; i < 10; i++) {
rx[i] = 2 * rx[i - 1] - D;
cout << rx[i] << endl;
}
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
long rx[100];
rx[0] = (r * x) - D;
cout << rx[0] << endl;
for (int i = 1; i < 10; i++) {
rx[i] = r * rx[i - 1] - D;
cout << rx[i] << endl;
}
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 848,984 | 848,983 | u027424986 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, d, x0;
int prex;
cin >> r >> d >> x0;
prex = x0;
for (int i = 0; i < 11; i++) {
cout << prex * r - d << endl;
prex = prex * r - d;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, d, x0;
int prex;
cin >> r >> d >> x0;
prex = x0;
for (int i = 0; i < 10; i++) {
cout << prex * r - d << endl;
prex = prex * r - d;
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 848,991 | 848,992 | u657208344 | cpp |
p03036 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
cin >> r >> D;
vector<int> W(11);
cin >> W.at(0);
for (int i = 1; i < 11; i++) {
W.at(i) = r * W.at(i - 1) - D;
}
for (int i = 0; i < 11; i++) {
cout << W.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, D;
cin >> r >> D;
vector<int> W(11);
cin >> W.at(0);
for (int i = 1; i < 11; i++) {
W.at(i) = r * W.at(i - 1) - D;
}
for (int i = 1; i < 11; i++) {
cout << W.at(i) << endl;
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 848,995 | 848,996 | u387371565 | cpp |
p03035 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define whlie while
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define inf 1001001001
#define infLL ((1LL << 61) - 1LL << 31)
#define mod 1000000007
#define FOR(i, a, b) for (int(i) = ((int)a); (i) < ((int)b); (i)++) // [a,b)
#define rep(i, N) FOR((i), 0, ((int)N)) // [0,N)
#define FORR(i, a, b) for (int(i) = ((int)b) - 1; (i) >= ((int)a); (i)--)
#define repr(i, N) FORR((i), 0, ((int)N))
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define vrep(v, it) for (auto it = v.begin(); it != v.end(); it++)
#define vrepr(v, it) for (auto it = v.rbegin(); it != v.rend(); it++)
#define inx(t, ...) \
t __VA_ARGS__; \
in(__VA_ARGS__)
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define inpii(...) \
pii __VA_ARGS__; \
in(__VA_ARGS__)
#define invi(v, ...) \
vi v; \
in(v, ##__VA_ARGS__)
#define invl(v, ...) \
vl v; \
in(v, ##__VA_ARGS__)
#define mem(ar, val) memset((ar), (val), sizeof(ar))
#define mem0(ar) memset((ar), 0, sizeof(ar))
#define mem1(ar) memset((ar), -1, sizeof(ar))
#ifdef LOCAL
#define dbg(...) fprintf(stderr, __VA_ARGS__)
#define trc(...) \
do { \
cout << #__VA_ARGS__ << "="; \
dbg_out(__VA_ARGS__); \
} while (0)
#define stopif(val) assert(!(val))
#define vdbg(v, ...) \
do { \
cout << #v << " = "; \
vector_debug(v, ##__VA_ARGS__); \
} while (0)
#else
#define dbg(...) 1
#define trc(...) 1
#define stopif(...) 1
#define vdbg(...) 1
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vector<int>> vvi;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(15);
}
} iosetup;
int gcd(int a, int b) {
if (a > b)
swap(a, b);
return a == 0 ? b : gcd(b % a, a);
}
ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
return a == 0 ? b : gcd(b % a, a);
}
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
inline int pow(int a, int b) {
int ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(ll a, ll b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(int a, ll b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(ll a, int b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
template <typename T, typename U> inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U> inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename C> inline void _cin(C &c) { cin >> c; }
template <typename T, typename U> inline void _cin(pair<T, U> &p) {
cin >> p.fi;
cin >> p.se;
}
template <typename C> inline void _cout(const C &c) { cout << c; }
template <typename T, typename U> inline void _cout(const pair<T, U> &p) {
cout << p.fi << ' ' << p.se;
}
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
_cin(t);
in(u...);
}
void out() { cout << endl; }
template <typename T, class... U> void out(const T &t, U... u) {
_cout(t);
if (sizeof...(u))
cout << ' ';
out(u...);
}
template <typename C> inline void in(vector<C> &v, int N = -1) {
if (sz(v) != 0) {
int M = (N == -1) ? sz(v) : N;
rep(i, M) _cin(v[i]);
} else {
C c;
rep(i, N) v.pb((_cin(c), c));
}
}
template <typename C> inline void in(C v[], int N) { rep(i, N) _cin(v[i]); }
template <typename C> inline void out(const vector<C> &v, int N = -1) {
int M = (N == -1) ? sz(v) : N;
rep(i, M) {
cout << ((i) ? " " : "");
_cout(v[i]);
}
cout << endl;
}
template <typename C> inline void out(C v[], int N) {
rep(i, N) {
cout << ((i) ? " " : "");
_cout(v[i]);
}
cout << endl;
}
template <typename C> inline void vector_debug(const vector<C> &v, int N = -1) {
cout << "{";
int M = (N == -1) ? sz(v) : N;
rep(i, M) {
cout << ((i) ? ", " : "");
_cout(v[i]);
}
cout << "}";
}
template <typename C> inline void vector_debug(C v[], int N) {
cout << "{";
rep(i, N) {
cout << ((i) ? ", " : "");
_cout(*(v + i));
}
cout << "}\n";
}
void dbg_out() { cout << endl; }
template <typename T, class... U> void dbg_out(const T &t, U... u) {
_cout(t);
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C, class... U> void dbg_out(const vector<C> &v, U... u) {
vector_debug(v);
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C, class... U>
void dbg_out(const vector<vector<C>> &v, U... u) {
cout << "{ ";
rep(i, sz(v)) {
if (i)
cout << ", ";
vector_debug(v[i]);
}
cout << " }";
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C> inline C vmax(const vector<C> &v) {
C n = v[0];
rep(i, sz(v)) amax(n, v[i]);
return n;
}
template <typename C> inline C vmax(C v[], int N) {
C n = v[0];
rep(i, N) amax(n, v[i]);
return n;
}
template <typename C> inline C vmin(const vector<C> &v) {
C n = v[0];
rep(i, sz(v)) amin(n, v[i]);
return n;
}
template <typename C> inline C vmin(C v[], int N) {
C n = v[0];
rep(i, N) amin(n, v[i]);
return n;
}
template <typename C> inline C vsum(const vector<C> &v) {
C n = 0;
rep(i, sz(v)) n += v[i];
return n;
}
template <typename C> inline C vsum(C v[], int N) {
C n = 0;
rep(i, N) n += v[i];
return n;
}
////////////
/// main ///
////////////
int main() {
ini(A, B);
if (B >= 13)
out(A);
else if (6 <= B)
out(A / 2);
else
out(0);
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define whlie while
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define inf 1001001001
#define infLL ((1LL << 61) - 1LL << 31)
#define mod 1000000007
#define FOR(i, a, b) for (int(i) = ((int)a); (i) < ((int)b); (i)++) // [a,b)
#define rep(i, N) FOR((i), 0, ((int)N)) // [0,N)
#define FORR(i, a, b) for (int(i) = ((int)b) - 1; (i) >= ((int)a); (i)--)
#define repr(i, N) FORR((i), 0, ((int)N))
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define vrep(v, it) for (auto it = v.begin(); it != v.end(); it++)
#define vrepr(v, it) for (auto it = v.rbegin(); it != v.rend(); it++)
#define inx(t, ...) \
t __VA_ARGS__; \
in(__VA_ARGS__)
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define inpii(...) \
pii __VA_ARGS__; \
in(__VA_ARGS__)
#define invi(v, ...) \
vi v; \
in(v, ##__VA_ARGS__)
#define invl(v, ...) \
vl v; \
in(v, ##__VA_ARGS__)
#define mem(ar, val) memset((ar), (val), sizeof(ar))
#define mem0(ar) memset((ar), 0, sizeof(ar))
#define mem1(ar) memset((ar), -1, sizeof(ar))
#ifdef LOCAL
#define dbg(...) fprintf(stderr, __VA_ARGS__)
#define trc(...) \
do { \
cout << #__VA_ARGS__ << "="; \
dbg_out(__VA_ARGS__); \
} while (0)
#define stopif(val) assert(!(val))
#define vdbg(v, ...) \
do { \
cout << #v << " = "; \
vector_debug(v, ##__VA_ARGS__); \
} while (0)
#else
#define dbg(...) 1
#define trc(...) 1
#define stopif(...) 1
#define vdbg(...) 1
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vector<int>> vvi;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(15);
}
} iosetup;
int gcd(int a, int b) {
if (a > b)
swap(a, b);
return a == 0 ? b : gcd(b % a, a);
}
ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
return a == 0 ? b : gcd(b % a, a);
}
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
inline int pow(int a, int b) {
int ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(ll a, ll b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(int a, ll b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
inline ll pow(ll a, int b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
template <typename T, typename U> inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U> inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename C> inline void _cin(C &c) { cin >> c; }
template <typename T, typename U> inline void _cin(pair<T, U> &p) {
cin >> p.fi;
cin >> p.se;
}
template <typename C> inline void _cout(const C &c) { cout << c; }
template <typename T, typename U> inline void _cout(const pair<T, U> &p) {
cout << p.fi << ' ' << p.se;
}
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
_cin(t);
in(u...);
}
void out() { cout << endl; }
template <typename T, class... U> void out(const T &t, U... u) {
_cout(t);
if (sizeof...(u))
cout << ' ';
out(u...);
}
template <typename C> inline void in(vector<C> &v, int N = -1) {
if (sz(v) != 0) {
int M = (N == -1) ? sz(v) : N;
rep(i, M) _cin(v[i]);
} else {
C c;
rep(i, N) v.pb((_cin(c), c));
}
}
template <typename C> inline void in(C v[], int N) { rep(i, N) _cin(v[i]); }
template <typename C> inline void out(const vector<C> &v, int N = -1) {
int M = (N == -1) ? sz(v) : N;
rep(i, M) {
cout << ((i) ? " " : "");
_cout(v[i]);
}
cout << endl;
}
template <typename C> inline void out(C v[], int N) {
rep(i, N) {
cout << ((i) ? " " : "");
_cout(v[i]);
}
cout << endl;
}
template <typename C> inline void vector_debug(const vector<C> &v, int N = -1) {
cout << "{";
int M = (N == -1) ? sz(v) : N;
rep(i, M) {
cout << ((i) ? ", " : "");
_cout(v[i]);
}
cout << "}";
}
template <typename C> inline void vector_debug(C v[], int N) {
cout << "{";
rep(i, N) {
cout << ((i) ? ", " : "");
_cout(*(v + i));
}
cout << "}\n";
}
void dbg_out() { cout << endl; }
template <typename T, class... U> void dbg_out(const T &t, U... u) {
_cout(t);
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C, class... U> void dbg_out(const vector<C> &v, U... u) {
vector_debug(v);
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C, class... U>
void dbg_out(const vector<vector<C>> &v, U... u) {
cout << "{ ";
rep(i, sz(v)) {
if (i)
cout << ", ";
vector_debug(v[i]);
}
cout << " }";
if (sizeof...(u))
cout << ", ";
dbg_out(u...);
}
template <typename C> inline C vmax(const vector<C> &v) {
C n = v[0];
rep(i, sz(v)) amax(n, v[i]);
return n;
}
template <typename C> inline C vmax(C v[], int N) {
C n = v[0];
rep(i, N) amax(n, v[i]);
return n;
}
template <typename C> inline C vmin(const vector<C> &v) {
C n = v[0];
rep(i, sz(v)) amin(n, v[i]);
return n;
}
template <typename C> inline C vmin(C v[], int N) {
C n = v[0];
rep(i, N) amin(n, v[i]);
return n;
}
template <typename C> inline C vsum(const vector<C> &v) {
C n = 0;
rep(i, sz(v)) n += v[i];
return n;
}
template <typename C> inline C vsum(C v[], int N) {
C n = 0;
rep(i, N) n += v[i];
return n;
}
////////////
/// main ///
////////////
int main() {
ini(A, B);
if (A >= 13)
out(B);
else if (6 <= A)
out(B / 2);
else
out(0);
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 849,001 | 849,002 | u168578024 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, d, x, ans[100];
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
if (i == 0) {
ans[i] = x * r - d;
} else {
ans[i] = ans[0] * r - d;
}
cout << ans[i] << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int r, d, x, ans[100];
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
if (i == 0) {
ans[0] = x * r - d;
} else {
ans[i] = ans[i - 1] * r - d;
}
cout << ans[i] << endl;
}
} | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"assignment.change"
] | 849,014 | 849,015 | u691856718 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
x = r * x - d;
cout << x;
}
cout << endl;
} | #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
x = r * x - d;
cout << x << endl;
}
} | [] | 849,018 | 849,019 | u000113982 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < d; i++) {
x = r * x - d;
cout << x << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 1; i <= 10; i++) {
x = (r * x) - d;
cout << x << endl;
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change"
] | 849,020 | 849,021 | u018679195 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < d; i++) {
x = r * x - d;
cout << x << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
for (int i = 2000; i < 2010; i++) {
x = r * x - D;
cout << x << endl;
}
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"assignment.value.change"
] | 849,020 | 849,023 | u018679195 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < d; i++) {
x = r * x - d;
cout << x << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
x = r * x - d;
cout << x << endl;
}
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 849,020 | 849,024 | u018679195 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < d; i++) {
x = r * x - d;
cout << x << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
x = r * x - d;
cout << x << endl;
}
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 849,020 | 849,025 | u018679195 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
for (int i = 0; i < D; i++) {
x = (r * x) - D;
cout << x << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
x = (r * x) - d;
cout << x << endl;
}
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"assignment.value.change"
] | 849,026 | 849,027 | u089230684 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
for (int i = 0; i < D; i++) {
x = r * x - D;
cout << x << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
x = (r * x - d);
cout << x << endl;
}
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"assignment.value.change"
] | 849,028 | 849,029 | u353919145 | cpp |
p03036 | #include <iostream>
using namespace std;
int main() {
int r, D, x;
cin >> r >> D >> x;
for (int i = 0; i < D; i++) {
x = r * x - D;
cout << x << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
x = r * x - d;
cout << x << endl;
}
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"assignment.value.change"
] | 849,028 | 849,030 | u353919145 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.