problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
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(... | #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(... | [
"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, 1... | #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(... | [
"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<s... | // 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<s... | [
"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 ... | #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 ... | [
"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()
#defi... | #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()
#defi... | [
"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 ... | #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 ... | [
"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); ... | /*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); ... | [
"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,... | #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,... | [
"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 >> ... | #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 >> ... | [
"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 n... | #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 n... | [
"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 > ... | #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 > ... | [
"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
... | #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
... | [
"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 <... | #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 <... | [
"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 (l... | #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 (l... | [
"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... | /*{{{*/
#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... | [
"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... | #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... | [
"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())
#def... | #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())
#defi... | [
"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 <... | #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 <... | [
"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 lo... | #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 lo... | [
"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 lo... | #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 lo... | [
"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... | #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... | [
"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;
typ... | #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;
typ... | [
"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... | #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... | [
"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)... | #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)... | [
"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)... | #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)... | [
"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 na... | #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 na... | [
"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 na... | #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 na... | [
"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 <v... | #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 <v... | [
"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.