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 |
|---|---|---|---|---|---|---|---|
p03029 | // c++
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
int c;
int d;
cin >> a;
cin >> b;
c = a / 3;
d = (b + c) / 2;
cout << d << endl;
}
| // c++
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
int c;
int d;
cin >> a;
cin >> b;
c = a * 3;
d = (b + c) / 2;
cout << d << endl;
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 837,973 | 837,974 | u479202791 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (int)(((A / 3) + P) / 2) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (int)(((A * 3) + P) / 2) << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 837,985 | 837,986 | u590987506 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (int)((A / 3) + P) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (int)(((A * 3) + P) / 2) << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 837,987 | 837,986 | u590987506 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (3 * a + p) / 3;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (3 * a + p) / 2;
} | [
"literal.number.change",
"io.output.change"
] | 838,004 | 838,005 | u929107645 | cpp |
p03029 | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << a * 3 / 2 << endl;
}
| // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2 << endl;
}
| [] | 838,020 | 838,021 | u495386448 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << floor(3 * A + P) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << floor((3 * A + P) / 2) << endl;
return 0;
} | [
"call.arguments.change",
"call.arguments.add"
] | 838,026 | 838,027 | u947426792 | cpp |
p03029 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int a, p;
cin >> a >> p;
cout << (3 * a + p) + 1 / 2 << endl;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int a, p;
cin >> a >> p;
cout << (3 * a + p) / 2 << endl;
} | [
"expression.operation.binary.remove"
] | 838,039 | 838,040 | u654240084 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF = 1LL << 58;
const ll MOD = 1000000007;
typedef vector<pii> vpii;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
int A, P;
cin >> A >> P;
cout << (A + P * 3) / 2 << endl;
// system("pause");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF = 1LL << 58;
const ll MOD = 1000000007;
typedef vector<pii> vpii;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 2 << endl;
// system("pause");
} | [
"expression.operation.binary.remove"
] | 838,048 | 838,049 | u913836622 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF = 1LL << 58;
const ll MOD = 1000000007;
typedef vector<pii> vpii;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
int A, P;
cin >> A >> P;
cout << (A + P * 2) / 2 << endl;
// system("pause");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF = 1LL << 58;
const ll MOD = 1000000007;
typedef vector<pii> vpii;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 2 << endl;
// system("pause");
} | [
"expression.operation.binary.remove"
] | 838,050 | 838,049 | u913836622 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int pie;
int a, p;
cin >> a >> p;
pie = (a * 3) / 2 + p / 2;
cout << pie;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int pie;
int a, p;
cin >> a >> p;
pie = (a * 3 + p) / 2;
cout << pie;
return 0;
} | [
"expression.operation.binary.remove"
] | 838,051 | 838,052 | u369081942 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * 3 + 2) / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * 3 + b) / 2 << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 838,056 | 838,057 | u633402865 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A, P;
cout << (3 * A + P) / 2;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (3 * A + P) / 2;
return 0;
}
| [] | 838,060 | 838,061 | u725133562 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << int((A * 3) / 2) + P << endl;
}
| #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << int((A * 3 + P) / 2) << endl;
}
| [
"expression.operation.binary.remove"
] | 838,064 | 838,065 | u405675992 | cpp |
p03029 | #include <iostream>
#include <numeric>
#include <stdio.h>
using namespace std;
int main() {
int A, P;
cin >> A;
cin >> P;
int kakera = 3 * A + P;
int applepie = P / 2;
cout << applepie;
}
| #include <iostream>
#include <numeric>
#include <stdio.h>
using namespace std;
int main() {
int A, P;
cin >> A;
cin >> P;
int kakera = 3 * A + P;
int applepie = kakera / 2;
cout << applepie;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 838,072 | 838,073 | u038582728 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int b = a * 3;
int c = b + p / 2;
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int b = a * 3;
int c = (b + p) / 2;
cout << c << endl;
} | [] | 838,074 | 838,075 | u098026368 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int b = a * 3;
int c = b / 2;
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int b = a * 3;
int c = (b + p) / 2;
cout << c << endl;
} | [] | 838,076 | 838,075 | u098026368 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
cin >> n >> p;
int res = n * 3 + p;
cout << res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
cin >> n >> p;
int res = n * 3 + p;
cout << res / 2;
return 0;
} | [
"expression.operation.binary.add"
] | 838,077 | 838,078 | u841803074 | cpp |
p03029 | #include "bits/stdc++.h"
using namespace std;
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
int main() {
int a, p;
cin >> a, p;
cout << (a * 3 + p) / 2 << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2 << endl;
} | [] | 838,084 | 838,085 | u572537642 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
int ans;
cin >> A >> P;
P = A * 3;
ans = P / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
int ans;
cin >> A >> P;
P += A * 3;
ans = P / 2;
cout << ans << endl;
}
| [
"assignment.value.change"
] | 838,102 | 838,103 | u193598069 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int a, n;
int main() {
cin >> a >> n;
cout << a * 3 / 2 * n;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a, n;
int main() {
cin >> a >> n;
cout << (a * 3 + n) / 2;
return 0;
}
| [
"expression.operation.binary.remove"
] | 838,121 | 838,122 | u031920644 | cpp |
p03029 | #include <stdio.h>
int main() {
int a, p;
scanf("%d %d", &a, &p);
p += a * 3;
printf("%d\n", p / 3);
return 0;
} | #include <stdio.h>
int main() {
int a, p;
scanf("%d %d", &a, &p);
p += a * 3;
printf("%d\n", p / 2);
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 838,123 | 838,124 | u973705142 | cpp |
p03029 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout << (#x) << "=" << (x) << endl
#define mset(d, val) memset(d, val, sizeof(d))
#define setp(x) cout << fixed << setprecision(x)
#define forn(i, a, b) for (int i = a; i < b; i++)
#define fore(i, a, b) for (int i = a; i <= b; i++)
#define pb push_back
#define F first
#define S second
#define PI 3.14159265358979323846264338327
#define INF 2e14
#define MOD 998244353
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef unsigned long long ull;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define MAXN 100005
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a, p;
cin >> a >> p;
p += a / 3;
cout << p / 2 << '\n';
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout << (#x) << "=" << (x) << endl
#define mset(d, val) memset(d, val, sizeof(d))
#define setp(x) cout << fixed << setprecision(x)
#define forn(i, a, b) for (int i = a; i < b; i++)
#define fore(i, a, b) for (int i = a; i <= b; i++)
#define pb push_back
#define F first
#define S second
#define PI 3.14159265358979323846264338327
#define INF 2e14
#define MOD 998244353
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef unsigned long long ull;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define MAXN 100005
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a, p;
cin >> a >> p;
p += a * 3;
cout << p / 2 << '\n';
return 0;
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 838,129 | 838,130 | u603846802 | cpp |
p03029 | #include <stdio.h>
int main(void) {
int a, p;
scanf("%d %d", &a, &p);
p += a / 3;
printf("%d¥n", p / 2);
return 0;
}
| #include <stdio.h>
int main(void) {
int a, p;
scanf("%d %d", &a, &p);
p += a * 3;
printf("%d\n", p / 2);
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 838,133 | 838,134 | u106524514 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A, P;
int pie = (3 * A + P) / 2;
cout << pie << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int pie = ((3 * A) + P) / 2;
cout << pie << endl;
return 0;
} | [] | 838,165 | 838,166 | u653388379 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << A * 3 + P / 2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (3 * A + P) / 2;
return 0;
} | [
"io.output.change"
] | 838,167 | 838,168 | u901408472 | cpp |
p03029 | // If you are reading this then you are at wrong place.
#include <bits/stdc++.h>
#define mod 1000000007
#define lli long long int
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
bool prime[1000001];
void debug(lli a) { cout << a << endl; }
lli sieve(lli a) {
memset(prime, true, sizeof(prime));
lli p, i;
for (p = 2; p * p <= a; p++) {
if (prime[p] == true) {
for (i = p * 2; i <= a; i += p)
prime[i] = false;
}
}
return 0;
}
lli powermod(lli _a, lli _b, lli _m) {
lli _r = 1;
while (_b) {
if (_b % 2 == 1)
_r = (_r * _a) % _m;
_b /= 2;
_a = (_a * _a) % _m;
}
return _r;
}
lli find_max(lli __a, lli __b) { return __a ^ ((__a ^ __b) & -(__a < __b)); }
lli add(lli __a, lli __b, lli MOD) {
lli x = (__a + __b) % MOD;
return x;
}
lli mul(lli a, lli b, lli MOD) {
lli x = (a * b) % MOD;
return x;
}
lli sub(lli a, lli b, lli MOD) {
lli x = (a - b + MOD) % MOD;
return x;
}
lli div(lli a, lli b, lli MOD) {
lli x = a;
lli y = powermod(b, MOD - 2, MOD);
lli res = (x * y) % MOD;
return res;
}
void printVector(vector<int> a) {
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
}
vector<lli> uniqueIt(vector<lli> temp) {
set<lli> temp1;
for (int i = 0; i < temp.size(); i++) {
temp1.insert(temp[i]);
}
vector<lli> returnIt(temp1.begin(), temp1.end());
return returnIt;
}
vector<lli> findAllPrimeFactors(lli n) {
set<lli> primeFactors;
if (n % 2 == 0) {
primeFactors.insert(2);
while (n % 2 == 0) {
n /= 2;
}
}
for (int i = 3; i <= sqrt(n); i++) {
if (n % i == 0) {
primeFactors.insert(i);
while (n % i == 0) {
n /= i;
}
}
}
if (n > 2) {
primeFactors.insert(n);
}
vector<lli> temp(primeFactors.begin(), primeFactors.end());
return temp;
}
int main() {
// use ./a.out filename(input)
// ifstream cin("input");
// ofstream cout("output.txt");
lli t, i, j;
t = 1;
// cin>>t;
lli counter1 = 0;
while (t--) {
int a, b;
cin >> a >> b;
cout << (2 * a + b) / 2 << endl;
}
} | // If you are reading this then you are at wrong place.
#include <bits/stdc++.h>
#define mod 1000000007
#define lli long long int
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
bool prime[1000001];
void debug(lli a) { cout << a << endl; }
lli sieve(lli a) {
memset(prime, true, sizeof(prime));
lli p, i;
for (p = 2; p * p <= a; p++) {
if (prime[p] == true) {
for (i = p * 2; i <= a; i += p)
prime[i] = false;
}
}
return 0;
}
lli powermod(lli _a, lli _b, lli _m) {
lli _r = 1;
while (_b) {
if (_b % 2 == 1)
_r = (_r * _a) % _m;
_b /= 2;
_a = (_a * _a) % _m;
}
return _r;
}
lli find_max(lli __a, lli __b) { return __a ^ ((__a ^ __b) & -(__a < __b)); }
lli add(lli __a, lli __b, lli MOD) {
lli x = (__a + __b) % MOD;
return x;
}
lli mul(lli a, lli b, lli MOD) {
lli x = (a * b) % MOD;
return x;
}
lli sub(lli a, lli b, lli MOD) {
lli x = (a - b + MOD) % MOD;
return x;
}
lli div(lli a, lli b, lli MOD) {
lli x = a;
lli y = powermod(b, MOD - 2, MOD);
lli res = (x * y) % MOD;
return res;
}
void printVector(vector<int> a) {
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
}
vector<lli> uniqueIt(vector<lli> temp) {
set<lli> temp1;
for (int i = 0; i < temp.size(); i++) {
temp1.insert(temp[i]);
}
vector<lli> returnIt(temp1.begin(), temp1.end());
return returnIt;
}
vector<lli> findAllPrimeFactors(lli n) {
set<lli> primeFactors;
if (n % 2 == 0) {
primeFactors.insert(2);
while (n % 2 == 0) {
n /= 2;
}
}
for (int i = 3; i <= sqrt(n); i++) {
if (n % i == 0) {
primeFactors.insert(i);
while (n % i == 0) {
n /= i;
}
}
}
if (n > 2) {
primeFactors.insert(n);
}
vector<lli> temp(primeFactors.begin(), primeFactors.end());
return temp;
}
int main() {
// use ./a.out filename(input)
// ifstream cin("input");
// ofstream cout("output.txt");
lli t, i, j;
t = 1;
// cin>>t;
lli counter1 = 0;
while (t--) {
int a, b;
cin >> a >> b;
cout << (3 * a + b) / 2 << endl;
}
} | [
"literal.number.change",
"io.output.change"
] | 838,232 | 838,233 | u639274969 | cpp |
p03029 | #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 n, m;
ci(n >> m);
co((3 * n + 2 * m) / 2)
}
| #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 n, m;
ci(n >> m);
co((3 * n + m) / 2)
}
| [
"expression.operation.binary.remove"
] | 838,238 | 838,239 | u835924161 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A, P;
int ans = (A * 3 + P) / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int ans = (A * 3 + P) / 2;
cout << ans << endl;
} | [] | 838,240 | 838,241 | u676496404 | cpp |
p03029 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int a, p;
cin >> a >> p;
cout << 3 * a / p << endl;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int a, p;
cin >> a >> p;
cout << (3 * a + p) / 2 << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 838,242 | 838,243 | u921168761 | cpp |
p03029 |
#include <cstdio>
int main() {
int a, p;
scanf("%d %d", &a, &p);
printf("%d\n", a * 3 / 2);
return 0;
} |
#include <cstdio>
int main() {
int a, p;
scanf("%d %d", &a, &p);
printf("%d\n", (a * 3 + p) / 2);
return 0;
} | [
"call.arguments.change"
] | 838,250 | 838,251 | u289709148 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, P;
cin >> A >> P;
A = A * 3;
cout << (A + P) % 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, P;
cin >> A >> P;
A = A * 3;
cout << (A + P) / 2 << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 838,272 | 838,273 | u794246018 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P, tot, sum;
cin >> A >> P;
tot = A * 3 + P;
sum = tot / 2;
cout << tot << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P, tot, sum;
cin >> A >> P;
tot = A * 3 + P;
sum = tot / 2;
cout << sum << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 838,189 | 838,190 | u757389058 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
p += a / 3;
cout << (p / 2) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
p += a * 3;
cout << (p / 2) << '\n';
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 838,205 | 838,206 | u855248478 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
cin >> n >> p;
cout << (3 * n * p) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
cin >> n >> p;
cout << (3 * n + p) / 2 << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 838,207 | 838,208 | u039431852 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int ans;
ans = A * 3 / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int ans;
ans = (A * 3 + P) / 2;
cout << ans << endl;
return 0;
}
| [] | 838,215 | 838,216 | u276588887 | cpp |
p03029 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define repR(i, n) for (ll i = n; i >= 0; ++i)
#define FDS(i, n) for (ll i = 0; i < n; ++i)
#define FDSR(i, n) for (ll i = n; i >= 0; ++i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define VSORT(v) sort(v.begin(), v.end());
#define VREV(v) reverse(v.begin(), v.end());
#define INF 999999999
#define itn ll
#define ednl endl
using namespace std;
typedef long long ll;
template <typename Typell> Typell G_C_D(Typell a, Typell b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
while (b != 0) {
a %= b;
if (a == 0)
return b;
b %= a;
}
return a;
}
template <typename Typell> Typell G_C_D(const std::vector<Typell> &list) {
Typell a = list[0];
for (size_t i = 1; i < list.size(); ++i) {
a = G_C_D(a, list[i]);
}
return a;
}
template <typename Typell> Typell L_C_M(Typell a, Typell b) {
if (a == 0 && b == 0)
return 0;
return a / G_C_D(a, b) * b;
}
template <typename Typell> Typell L_C_M(const std::vector<Typell> &list) {
Typell a = list[0];
for (size_t i = 1; i < list.size(); ++i) {
a = L_C_M(a, list[i]);
}
return a;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, t;
cin >> n >> t;
n *= 3;
n += t;
cout << 3 / 2 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define repR(i, n) for (ll i = n; i >= 0; ++i)
#define FDS(i, n) for (ll i = 0; i < n; ++i)
#define FDSR(i, n) for (ll i = n; i >= 0; ++i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define VSORT(v) sort(v.begin(), v.end());
#define VREV(v) reverse(v.begin(), v.end());
#define INF 999999999
#define itn ll
#define ednl endl
using namespace std;
typedef long long ll;
template <typename Typell> Typell G_C_D(Typell a, Typell b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
while (b != 0) {
a %= b;
if (a == 0)
return b;
b %= a;
}
return a;
}
template <typename Typell> Typell G_C_D(const std::vector<Typell> &list) {
Typell a = list[0];
for (size_t i = 1; i < list.size(); ++i) {
a = G_C_D(a, list[i]);
}
return a;
}
template <typename Typell> Typell L_C_M(Typell a, Typell b) {
if (a == 0 && b == 0)
return 0;
return a / G_C_D(a, b) * b;
}
template <typename Typell> Typell L_C_M(const std::vector<Typell> &list) {
Typell a = list[0];
for (size_t i = 1; i < list.size(); ++i) {
a = L_C_M(a, list[i]);
}
return a;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, t;
cin >> n >> t;
n *= 3;
n += t;
cout << n / 2 << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 838,317 | 838,318 | u870797515 | cpp |
p03029 |
#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, P;
LL ans = 0;
cin >> A >> P;
ans = A * 3 + P;
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, P;
LL ans = 0;
cin >> A >> P;
ans = (A * 3 + P) / 2;
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 838,353 | 838,354 | u335104842 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << ((a / 3) + b) / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << ((a * 3) + b) / 2 << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 838,394 | 838,395 | u884910741 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = a * 3;
c = a + b;
c = c / 2;
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = a * 3;
c = c + b;
c = c / 2;
cout << c << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 838,402 | 838,403 | u153794369 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const ll Inf = 1LL << 62;
int main() {
#ifdef Mr_Emrul
freopen("inputf.in", "r", stdin);
#endif /// Mr_Emrul
int a, b;
cin >> a >> b;
b += a / 3;
cout << b / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const ll Inf = 1LL << 62;
int main() {
#ifdef Mr_Emrul
freopen("inputf.in", "r", stdin);
#endif /// Mr_Emrul
int a, b;
cin >> a >> b;
b += a * 3;
cout << b / 2 << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 838,412 | 838,413 | u229186574 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define Rep(x, y) for (int k = x; k < y; k++)
#define str string
#define vint vector<int>
#define vvint vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vool vector<bool>
#define vtr vector<str>
#define vvtr vector<vector<str>>
#define pb() push_back()
#define elif else if
#define all(x) x.begin(), x.end()
// function
int shizuku(int);
// UnionFind
struct UnionFind {
vint par;
UnionFind(int N) : par(N) { rep(0, N) par[i] = i; }
int root(int x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y) { return root(x) == root(y); }
};
signed main() {
int pow, D, G, N, M, X, count = 0, count2 = 0;
double d;
int C = 'A' - 'a';
char op;
str S, T;
cin >> N >> M;
cout << (N * 3 + M) / 3 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define Rep(x, y) for (int k = x; k < y; k++)
#define str string
#define vint vector<int>
#define vvint vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vool vector<bool>
#define vtr vector<str>
#define vvtr vector<vector<str>>
#define pb() push_back()
#define elif else if
#define all(x) x.begin(), x.end()
// function
int shizuku(int);
// UnionFind
struct UnionFind {
vint par;
UnionFind(int N) : par(N) { rep(0, N) par[i] = i; }
int root(int x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y) { return root(x) == root(y); }
};
signed main() {
int pow, D, G, N, M, X, count = 0, count2 = 0;
double d;
int C = 'A' - 'a';
char op;
str S, T;
cin >> N >> M;
cout << (N * 3 + M) / 2 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 838,420 | 838,421 | u347579224 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * 3 + b / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * 3 + b) / 2 << endl;
return 0;
} | [] | 838,431 | 838,432 | u931511759 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, P;
cin >> A >> P;
cout << (A / 3 + P) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 2 << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 838,433 | 838,434 | u360441331 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P, i, a, k;
cin >> A >> P;
a = 3 * A;
i = a + P;
k = i % 2;
cout << k << endl;
// ここにプログラムを追記
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P, i, a, k;
cin >> A >> P;
a = 3 * A;
i = a + P;
k = i / 2;
cout << k << endl;
// ここにプログラムを追記
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 838,449 | 838,450 | u801884816 | cpp |
p03029 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fu(i, r, t) for (int i = r; i <= t; i++)
#define fd(i, r, t) for (int i = r; i >= t; i--)
#define Set set<int>
#define int long long
#define P pair<int, int>
const int maxn = 1005;
const int INF = 1e17 + 6;
using namespace std;
int n, m, a[maxn], b[maxn], c[maxn];
set<int> T;
int32_t main() {
IOS;
cin >> n >> m;
cout << (n + m / 2);
return 0;
}
| #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fu(i, r, t) for (int i = r; i <= t; i++)
#define fd(i, r, t) for (int i = r; i >= t; i--)
#define Set set<int>
#define int long long
#define P pair<int, int>
const int maxn = 1005;
const int INF = 1e17 + 6;
using namespace std;
int n, m, a[maxn], b[maxn], c[maxn];
set<int> T;
int32_t main() {
IOS;
cin >> n >> m;
cout << (n * 3 + m) / 2;
return 0;
}
| [
"expression.operation.binary.add"
] | 838,453 | 838,454 | u020160935 | cpp |
p03029 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, p;
cin >> a >> p;
cout << (a * 2 + p) / 2 << "\n";
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2 << "\n";
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 838,455 | 838,456 | u640255289 | cpp |
p03029 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) \
a ^= b; \
b ^= a; \
a ^= b;
//#define for(i,a,b) for (ll i=(a);i<(ll)b; i++)
#define print(x) std::cout << x << std::endl;
using namespace std;
typedef long long ll;
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first = 0, bool replace_empty = 0);
bool isContain(int value, int under, int top);
vector<int> range(int x);
int get_ab(string str) {
bool isA = false;
int res = 0;
if (str[0] == 'A')
isA = true;
for (int i = 1; i < str.length(); i++) {
if (isA && str[i] == 'B') {
res++;
isA = false;
} else if (str[i] == 'A')
isA = true;
else
isA = false;
}
return res;
}
vector<bool> isVisited;
vector<int> Accu;
vector<vector<int>> Datas;
int N;
void DEF(int pos, int sum) {
bool all_visited = true;
rep(i, N) if (isVisited[i] == false) {
all_visited = false;
break;
}
Accu[pos] = sum;
rep(i, N) {
if (isVisited[i] == true)
continue; //すでに訪れている
if (Datas[pos][i] == -1)
continue; //繋がっていない
isVisited[i] = true;
DEF(i, sum + Datas[pos][i]);
}
}
ll gcd(ll A, ll B) {
int r = A % B;
while (r != 0) {
A = B;
B = r;
r = A % B;
}
return B;
}
int main(void) {
// Program Start
int A, P;
cin >> A >> P;
cout << (3 * A + P) / 3 << endl;
ProgramEndPointLabel:;
// Program End
system("pause");
return 0;
}
vector<int> range(int y) {
vector<int> result(y);
for (int i = 0; i < y; i++)
result[i] = i;
return result;
}
bool isContain(int value, int under, int top) {
if (under <= value && value <= top)
return true;
return false;
}
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first, bool replace_empty) {
using S = std::string;
using C = std::string::value_type;
using N = std::string::size_type;
struct {
auto len(const S &s) { return s.size(); }
auto len(const C *p) { return std::char_traits<C>::length(p); }
auto len(const C c) { return 1; }
auto sub(S *s, const S &t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C *t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C t, N pos, N len) { s->replace(pos, len, 1, t); }
auto ins(S *s, const S &t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C *t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C t, N pos) { s->insert(pos, 1, t); }
} util;
N target_length = util.len(target);
N replacement_length = util.len(replacement);
if (target_length == 0) {
if (!replace_empty || replacement_length == 0)
return s;
N n = s.size() + replacement_length * (1 + s.size());
s.reserve(!replace_first ? n : s.size() + replacement_length);
for (N i = 0; i < n; i += 1 + replacement_length) {
util.ins(&s, replacement, i);
if (replace_first)
break;
}
return s;
}
N pos = 0;
while ((pos = s.find(target, pos)) != std::string::npos) {
util.sub(&s, replacement, pos, target_length);
if (replace_first)
return s;
pos += replacement_length;
}
return s;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) \
a ^= b; \
b ^= a; \
a ^= b;
//#define for(i,a,b) for (ll i=(a);i<(ll)b; i++)
#define print(x) std::cout << x << std::endl;
using namespace std;
typedef long long ll;
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first = 0, bool replace_empty = 0);
bool isContain(int value, int under, int top);
vector<int> range(int x);
int get_ab(string str) {
bool isA = false;
int res = 0;
if (str[0] == 'A')
isA = true;
for (int i = 1; i < str.length(); i++) {
if (isA && str[i] == 'B') {
res++;
isA = false;
} else if (str[i] == 'A')
isA = true;
else
isA = false;
}
return res;
}
vector<bool> isVisited;
vector<int> Accu;
vector<vector<int>> Datas;
int N;
void DEF(int pos, int sum) {
bool all_visited = true;
rep(i, N) if (isVisited[i] == false) {
all_visited = false;
break;
}
Accu[pos] = sum;
rep(i, N) {
if (isVisited[i] == true)
continue; //すでに訪れている
if (Datas[pos][i] == -1)
continue; //繋がっていない
isVisited[i] = true;
DEF(i, sum + Datas[pos][i]);
}
}
ll gcd(ll A, ll B) {
int r = A % B;
while (r != 0) {
A = B;
B = r;
r = A % B;
}
return B;
}
int main(void) {
// Program Start
int A, P;
cin >> A >> P;
cout << (3 * A + P) / 2 << endl;
ProgramEndPointLabel:;
// Program End
system("pause");
return 0;
}
vector<int> range(int y) {
vector<int> result(y);
for (int i = 0; i < y; i++)
result[i] = i;
return result;
}
bool isContain(int value, int under, int top) {
if (under <= value && value <= top)
return true;
return false;
}
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first, bool replace_empty) {
using S = std::string;
using C = std::string::value_type;
using N = std::string::size_type;
struct {
auto len(const S &s) { return s.size(); }
auto len(const C *p) { return std::char_traits<C>::length(p); }
auto len(const C c) { return 1; }
auto sub(S *s, const S &t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C *t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C t, N pos, N len) { s->replace(pos, len, 1, t); }
auto ins(S *s, const S &t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C *t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C t, N pos) { s->insert(pos, 1, t); }
} util;
N target_length = util.len(target);
N replacement_length = util.len(replacement);
if (target_length == 0) {
if (!replace_empty || replacement_length == 0)
return s;
N n = s.size() + replacement_length * (1 + s.size());
s.reserve(!replace_first ? n : s.size() + replacement_length);
for (N i = 0; i < n; i += 1 + replacement_length) {
util.ins(&s, replacement, i);
if (replace_first)
break;
}
return s;
}
N pos = 0;
while ((pos = s.find(target, pos)) != std::string::npos) {
util.sub(&s, replacement, pos, target_length);
if (replace_first)
return s;
pos += replacement_length;
}
return s;
}
| [
"literal.number.change",
"io.output.change"
] | 838,457 | 838,458 | u040251933 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
scanf("%d%d", &n, &m);
printf("%d", (3 * n + m) / 3);
} | #include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
scanf("%d%d", &n, &m);
printf("%d", (3 * n + m) / 2);
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 838,459 | 838,460 | u159583166 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pll pair<long long, long long>
#define pdd pair<long double, long double>
#define mp make_pair
#define pb push_back
#define pf push_front
priority_queue<pll, vector<pll>, greater<pll>> pq;
priority_queue<ll, vector<ll>, greater<ll>> p;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, p;
cin >> a >> p;
a *= 3;
a += p;
cout << a / p;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pll pair<long long, long long>
#define pdd pair<long double, long double>
#define mp make_pair
#define pb push_back
#define pf push_front
priority_queue<pll, vector<pll>, greater<pll>> pq;
priority_queue<ll, vector<ll>, greater<ll>> p;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, p;
cin >> a >> p;
a *= 3;
a += p;
cout << a / 2;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 838,461 | 838,462 | u029479695 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a <= x && x < b; }
template <typename T> T ceil(T a, T b) { return a / b + !!(a % b); }
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &a) {
out << '(' << a.first << ',' << a.second << ')';
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << '[';
for (const T &i : a)
out << i << ',';
out << ']';
return out;
}
template <class T> ostream &operator<<(ostream &out, const set<T> &a) {
out << '{';
for (const T &i : a)
out << i << ',';
out << '}';
return out;
}
template <class T, class S>
ostream &operator<<(ostream &out, const map<T, S> &a) {
out << '{';
for (auto &i : a)
out << i << ',';
out << '}';
return out;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, p;
cin >> a >> p;
cout << a * 3 / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a <= x && x < b; }
template <typename T> T ceil(T a, T b) { return a / b + !!(a % b); }
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &a) {
out << '(' << a.first << ',' << a.second << ')';
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << '[';
for (const T &i : a)
out << i << ',';
out << ']';
return out;
}
template <class T> ostream &operator<<(ostream &out, const set<T> &a) {
out << '{';
for (const T &i : a)
out << i << ',';
out << '}';
return out;
}
template <class T, class S>
ostream &operator<<(ostream &out, const map<T, S> &a) {
out << '{';
for (auto &i : a)
out << i << ',';
out << '}';
return out;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2 << endl;
return 0;
}
| [] | 838,465 | 838,466 | u333917945 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int p2;
p2 = 3 * a + p;
int ans;
ans = (p2 - p2 % 2) / 2;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int p2;
p2 = 3 * a + p;
int ans;
ans = (p2 - p2 % 2) / 2;
cout << ans;
return 0;
}
| [] | 838,469 | 838,470 | u057617112 | cpp |
p03029 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
cout << (a * 3) / 2 << endl;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
cout << (a * 3 + b) / 2 << endl;
} | [
"expression.operation.binary.add"
] | 838,475 | 838,476 | u650918644 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) rep(i, 0, n)
#define RREP(i, n) rrep(i, n, 0)
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 3 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) rep(i, 0, n)
#define RREP(i, n) rrep(i, n, 0)
int main() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 838,482 | 838,483 | u973991908 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int ans = 0;
ans = (A * 3 + P) / 3;
cout << ans;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int ans = (A * 3 + P) / 2;
cout << ans;
return 0;
} | [
"variable_declaration.remove",
"literal.number.change",
"expression.operation.binary.change"
] | 838,488 | 838,489 | u240544830 | cpp |
p03029 |
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
cout << n * 3 + a / 2;
} |
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
cout << (n * 3 + a) / 2;
} | [] | 838,490 | 838,491 | u098679988 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int count = 0;
count = (A * 3) / 2;
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int count = 0;
count = (A * 3 + P) / 2;
cout << count << endl;
return 0;
}
| [
"assignment.change"
] | 838,496 | 838,497 | u910362203 | cpp |
p03029 | #include <bits/stdc++.h> //atcoder.128.A
using namespace std;
int main() {
int a, p;
cin >> a >> p;
p += 2 * a;
cout << p / 2;
return 0;
} | #include <bits/stdc++.h> //atcoder.128.A
using namespace std;
int main() {
int a, p;
cin >> a >> p;
p += 3 * a;
cout << p / 2;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 838,504 | 838,505 | u014014258 | cpp |
p03029 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int a = a * 3 + P;
cout << a / 2 << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int a = A * 3 + P;
cout << a / 2 << endl;
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 838,506 | 838,507 | u821732221 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * 3 + b) / 3;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * 3 + b) / 2;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 838,513 | 838,514 | u664716463 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (A * 3) / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 2 << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 838,519 | 838,520 | u541263126 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << ((a * 2) + p) / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
cout << ((a * 3) + p) / 2 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 838,523 | 838,524 | u494546941 | cpp |
p03029 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, P;
// input
cin >> A >> P;
// output
cout << A * 3 / 2 << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, P;
// input
cin >> A >> P;
// output
cout << (A * 3 + P) / 2 << endl;
return 0;
}
| [] | 838,525 | 838,526 | u332258971 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int A, P;
int sum = 0;
cin >> A >> P;
sum = A * 3 + P;
cout << sum % 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, P;
int sum;
cin >> A >> P;
sum = A * 3 + P;
cout << sum / 2 << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 838,531 | 838,532 | u077117247 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 3 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << (A * 3 + P) / 2 << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 838,535 | 838,536 | u806709002 | cpp |
p03029 | #include <iostream>
int main() {
int a, p;
std::cin >> a >> p;
int s = a * 3 + 2;
std::cout << s / 2;
} | #include <iostream>
int main() {
int a, p;
std::cin >> a >> p;
int s = a * 3 + p;
std::cout << s / 2;
} | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 838,537 | 838,538 | u592236625 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
scanf("%d %d", &A, &P);
cout << (A * 3 + P) / 3 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
scanf("%d %d", &A, &P);
cout << (A * 3 + P) / 2 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 838,541 | 838,542 | u054501336 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int answer = 0;
answer = 3 * A - P;
cout << answer / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
int answer = 0;
answer = 3 * A + P;
cout << answer / 2 << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 838,559 | 838,560 | u003761219 | cpp |
p03029 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, p, c;
cin >> a >> p;
a *= 3;
p += a;
c = floor(p / 3.0);
cout << c << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, p, c;
cin >> a >> p;
a *= 3;
p += a;
c = floor(p / 2.0);
cout << c << endl;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 838,587 | 838,588 | u133765395 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int k = p / 2;
int rem = k % 2;
int ac = a * 3;
int ans = (rem + ac) / 2;
cout << ans + k;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p;
cin >> a >> p;
int k = p / 2;
int rem = p % 2;
int ac = a * 3;
int ans = (rem + ac) / 2;
cout << ans + k;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 838,589 | 838,590 | u014321021 | cpp |
p03029 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = a * 3;
cout << c / b;
cout << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = (a * 3) + b;
cout << c / 2;
cout << endl;
}
| [
"assignment.change",
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 838,591 | 838,592 | u401902038 | cpp |
p03029 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p, o;
cin >> a >> p;
o = a * 3 + p;
cout << o / 3 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p, o;
cin >> a >> p;
o = a * 3 + p;
cout << o / 2 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 838,604 | 838,605 | u117534860 | cpp |
p03027 | // Heaplax
#include <bits/stdc++.h>
#define N 1000005
#define LL long long
#define LOG(x) cerr << #x << " = " << x << endl
#define add_edge(u, v) nxt[++cnt] = head[u], head[u] = cnt, to[cnt] = v
#define open(x) freopen(#x ".in", "r", stdin), freopen(#x ".out", "w", stdout)
char ch;
bool fs;
void re(int &x) {
while (ch = getchar(), ch < 33)
;
if (ch == '-')
fs = 1, x = 0;
else
fs = 0, x = ch - 48;
while (ch = getchar(), ch > 33)
x = x * 10 + ch - 48;
if (fs)
x = -x;
}
using namespace std;
const int mod = 1000003;
int q;
int x, d, n;
int fac[N], ifac[N], inv[N];
int mi(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = 1ll * res * a % mod;
a = 1ll * a * a % mod;
b >>= 1;
}
return res;
}
int main() {
inv[0] = inv[1] = ifac[0] = fac[0] = 1;
for (int i = 1; i < N; ++i) {
if (i > 1)
inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
fac[i] = 1ll * fac[i - 1] * i % mod;
ifac[i] = 1ll * ifac[i - 1] * inv[i] % mod;
}
re(q);
while (q--) {
re(x), re(d), re(n);
if (!d) {
printf("%d\n", mi(x, n));
continue;
}
int w = (mod - x) * mi(d, mod - 2) % mod;
if (n - 1 >= w || (!x && n > mod)) {
puts("0");
continue;
}
x = 1ll * x * mi(d, mod - 2) % mod;
if (x + n - 1 >= mod) {
puts("0");
continue;
}
int ans = 1ll * mi(d, n) * (x ? ifac[x - 1] : 1) % mod;
ans = 1ll * ans * fac[x + n - 1] % mod;
printf("%d\n", ans);
}
}
| // Heaplax
#include <bits/stdc++.h>
#define N 1000005
#define LL long long
#define LOG(x) cerr << #x << " = " << x << endl
#define add_edge(u, v) nxt[++cnt] = head[u], head[u] = cnt, to[cnt] = v
#define open(x) freopen(#x ".in", "r", stdin), freopen(#x ".out", "w", stdout)
char ch;
bool fs;
void re(int &x) {
while (ch = getchar(), ch < 33)
;
if (ch == '-')
fs = 1, x = 0;
else
fs = 0, x = ch - 48;
while (ch = getchar(), ch > 33)
x = x * 10 + ch - 48;
if (fs)
x = -x;
}
using namespace std;
const int mod = 1000003;
int q;
int x, d, n;
int fac[N], ifac[N], inv[N];
int mi(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = 1ll * res * a % mod;
a = 1ll * a * a % mod;
b >>= 1;
}
return res;
}
int main() {
inv[0] = inv[1] = ifac[0] = fac[0] = 1;
for (int i = 1; i < N; ++i) {
if (i > 1)
inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
fac[i] = 1ll * fac[i - 1] * i % mod;
ifac[i] = 1ll * ifac[i - 1] * inv[i] % mod;
}
re(q);
while (q--) {
re(x), re(d), re(n);
if (!d) {
printf("%d\n", mi(x, n));
continue;
}
int w = 1ll * (mod - x) * mi(d, mod - 2) % mod;
if (n - 1 >= w || (!x && n > mod)) {
puts("0");
continue;
}
x = 1ll * x * mi(d, mod - 2) % mod;
if (x + n - 1 >= mod) {
puts("0");
continue;
}
int ans = 1ll * mi(d, n) * (x ? ifac[x - 1] : 1) % mod;
ans = 1ll * ans * fac[x + n - 1] % mod;
printf("%d\n", ans);
}
}
| [
"assignment.change"
] | 838,608 | 838,609 | u832435941 | cpp |
p03027 | // Heaplax
#include <bits/stdc++.h>
#define N 1000005
#define LL long long
#define LOG(x) cerr << #x << " = " << x << endl
#define add_edge(u, v) nxt[++cnt] = head[u], head[u] = cnt, to[cnt] = v
#define open(x) freopen(#x ".in", "r", stdin), freopen(#x ".out", "w", stdout)
char ch;
bool fs;
void re(int &x) {
while (ch = getchar(), ch < 33)
;
if (ch == '-')
fs = 1, x = 0;
else
fs = 0, x = ch - 48;
while (ch = getchar(), ch > 33)
x = x * 10 + ch - 48;
if (fs)
x = -x;
}
using namespace std;
const int mod = 1000003;
int q;
int x, d, n;
int fac[N], ifac[N], inv[N];
int mi(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = 1ll * res * a % mod;
a = 1ll * a * a % mod;
b >>= 1;
}
return res;
}
int main() {
inv[0] = inv[1] = ifac[0] = fac[0] = 1;
for (int i = 1; i < N; ++i) {
if (i > 1)
inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
fac[i] = 1ll * fac[i - 1] * i % mod;
ifac[i] = 1ll * ifac[i - 1] * inv[i] % mod;
}
re(q);
while (q--) {
re(x), re(d), re(n);
if (!d) {
printf("%d\n", mi(x, n));
continue;
}
int w = (mod - x) * mi(d, mod - 2) % mod;
if (n - 1 >= w || (!x && n > mod)) {
puts("0");
continue;
}
x = 1ll * x * mi(d, mod - 2) % mod;
if (x + n - 1 >= mod) {
puts("0");
continue;
}
int ans = 1ll * mi(d, n) * (x ? ifac[x - 1] : 0) % mod;
ans = 1ll * ans * fac[x + n - 1] % mod;
printf("%d\n", ans);
}
}
| // Heaplax
#include <bits/stdc++.h>
#define N 1000005
#define LL long long
#define LOG(x) cerr << #x << " = " << x << endl
#define add_edge(u, v) nxt[++cnt] = head[u], head[u] = cnt, to[cnt] = v
#define open(x) freopen(#x ".in", "r", stdin), freopen(#x ".out", "w", stdout)
char ch;
bool fs;
void re(int &x) {
while (ch = getchar(), ch < 33)
;
if (ch == '-')
fs = 1, x = 0;
else
fs = 0, x = ch - 48;
while (ch = getchar(), ch > 33)
x = x * 10 + ch - 48;
if (fs)
x = -x;
}
using namespace std;
const int mod = 1000003;
int q;
int x, d, n;
int fac[N], ifac[N], inv[N];
int mi(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = 1ll * res * a % mod;
a = 1ll * a * a % mod;
b >>= 1;
}
return res;
}
int main() {
inv[0] = inv[1] = ifac[0] = fac[0] = 1;
for (int i = 1; i < N; ++i) {
if (i > 1)
inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
fac[i] = 1ll * fac[i - 1] * i % mod;
ifac[i] = 1ll * ifac[i - 1] * inv[i] % mod;
}
re(q);
while (q--) {
re(x), re(d), re(n);
if (!d) {
printf("%d\n", mi(x, n));
continue;
}
int w = 1ll * (mod - x) * mi(d, mod - 2) % mod;
if (n - 1 >= w || (!x && n > mod)) {
puts("0");
continue;
}
x = 1ll * x * mi(d, mod - 2) % mod;
if (x + n - 1 >= mod) {
puts("0");
continue;
}
int ans = 1ll * mi(d, n) * (x ? ifac[x - 1] : 1) % mod;
ans = 1ll * ans * fac[x + n - 1] % mod;
printf("%d\n", ans);
}
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 838,610 | 838,609 | u832435941 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); i++)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); i--)
#define CHMIN(a, b) (a) = min((a), (b))
#define CHMAX(a, b) (a) = max((a), (b))
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
REP(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
const ll MOD = 1000003ll;
// ? https://en.wikipedia.org/wiki/Arithmetic_progression#Product
ll fact[MOD];
ll ifact[MOD];
ll modpow(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1)
r = r * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return r;
}
ll modinv(ll a) { return modpow(a, MOD - 2); }
int main() {
int q;
scanf("%d", &q);
// precalc
fact[0] = 1;
FOR(i, 1, MOD) fact[i] = fact[i - 1] * i % MOD;
ifact[MOD - 1] = modinv(fact[MOD - 1]);
FORR(i, 1, MOD) ifact[i - 1] = ifact[i] * i % MOD;
// query
while (q--) {
ll n, a, d;
scanf("%lld%lld%lld", &a, &d, &n);
ll iv = a * modinv(d) % MOD;
if (d == 0) {
printf("%lld", modpow(a, n));
continue;
} else if (a == 0 || iv + n - 1 >= MOD) {
puts("0");
continue;
}
// calc
ll ans = modpow(d, n) * fact[iv + n - 1] % MOD * ifact[iv - 1] % MOD;
printf("%lld\n", ans);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); i++)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); i--)
#define CHMIN(a, b) (a) = min((a), (b))
#define CHMAX(a, b) (a) = max((a), (b))
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
REP(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
const ll MOD = 1000003ll;
// ? https://en.wikipedia.org/wiki/Arithmetic_progression#Product
ll fact[MOD];
ll ifact[MOD];
ll modpow(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1)
r = r * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return r;
}
ll modinv(ll a) { return modpow(a, MOD - 2); }
int main() {
int q;
scanf("%d", &q);
// precalc
fact[0] = 1;
FOR(i, 1, MOD) fact[i] = fact[i - 1] * i % MOD;
ifact[MOD - 1] = modinv(fact[MOD - 1]);
FORR(i, 1, MOD) ifact[i - 1] = ifact[i] * i % MOD;
// query
while (q--) {
ll n, a, d;
scanf("%lld%lld%lld", &a, &d, &n);
ll iv = a * modinv(d) % MOD;
if (d == 0) {
printf("%lld\n", modpow(a, n));
continue;
} else if (a == 0 || iv + n - 1 >= MOD) {
puts("0");
continue;
}
// calc
ll ans = modpow(d, n) * fact[iv + n - 1] % MOD * ifact[iv - 1] % MOD;
printf("%lld\n", ans);
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 838,617 | 838,618 | u462560753 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); i++)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); i--)
#define CHMIN(a, b) (a) = min((a), (b))
#define CHMAX(a, b) (a) = max((a), (b))
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
REP(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
const ll MOD = 1000003ll;
// ? https://en.wikipedia.org/wiki/Arithmetic_progression#Product
ll fact[MOD];
ll ifact[MOD];
ll modpow(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1)
r = r * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return r;
}
ll modinv(ll a) { return modpow(a, MOD - 2); }
int main() {
int q;
scanf("%d", &q);
// precalc
fact[0] = 1;
FOR(i, 1, MOD) fact[i] = fact[i - 1] * i % MOD;
ifact[MOD - 1] = modinv(fact[MOD - 1]);
FORR(i, 1, MOD) ifact[i - 1] = ifact[i] * i % MOD;
// query
while (q--) {
ll n, a, d;
scanf("%lld%lld%lld", &a, &d, &n);
ll iv = a * modinv(d) % MOD;
if (d == 0) {
printf("%lld", a * n % MOD);
continue;
} else if (a == 0 || iv + n - 1 >= MOD) {
puts("0");
continue;
}
// calc
ll ans = modpow(d, n) * fact[iv + n - 1] % MOD * ifact[iv - 1] % MOD;
printf("%lld\n", ans);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); i++)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); i--)
#define CHMIN(a, b) (a) = min((a), (b))
#define CHMAX(a, b) (a) = max((a), (b))
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
REP(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
const ll MOD = 1000003ll;
// ? https://en.wikipedia.org/wiki/Arithmetic_progression#Product
ll fact[MOD];
ll ifact[MOD];
ll modpow(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1)
r = r * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return r;
}
ll modinv(ll a) { return modpow(a, MOD - 2); }
int main() {
int q;
scanf("%d", &q);
// precalc
fact[0] = 1;
FOR(i, 1, MOD) fact[i] = fact[i - 1] * i % MOD;
ifact[MOD - 1] = modinv(fact[MOD - 1]);
FORR(i, 1, MOD) ifact[i - 1] = ifact[i] * i % MOD;
// query
while (q--) {
ll n, a, d;
scanf("%lld%lld%lld", &a, &d, &n);
ll iv = a * modinv(d) % MOD;
if (d == 0) {
printf("%lld\n", modpow(a, n));
continue;
} else if (a == 0 || iv + n - 1 >= MOD) {
puts("0");
continue;
}
// calc
ll ans = modpow(d, n) * fact[iv + n - 1] % MOD * ifact[iv - 1] % MOD;
printf("%lld\n", ans);
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add",
"call.add",
"expression.operation.binary.change"
] | 838,619 | 838,618 | u462560753 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000003;
ll inv[1000010];
ll FactorialInv[1000010];
ll Factorial[1000010];
ll beki(ll a, ll b) {
if (b == 0) {
return 1;
}
ll ans = beki(a, b / 2);
ans = ans * ans % mod;
if (b % 2 == 1) {
ans = ans * a % mod;
}
return ans;
}
void init_combination() {
inv[1] = 1;
FactorialInv[1] = 1;
Factorial[1] = 1;
Factorial[0] = 1;
FactorialInv[0] = 1;
inv[0] = 1;
for (int i = 2; i < 1000010; i++) {
inv[i] = beki(i, mod - 2);
Factorial[i] = Factorial[i - 1] * i % mod;
FactorialInv[i] = FactorialInv[i - 1] * inv[i] % mod;
}
}
ll combination(ll a, ll b) {
if ((a == b) || (b == 0)) {
return 1;
}
ll ans = Factorial[a] * FactorialInv[b] % mod;
ans = ans * FactorialInv[a - b] % mod;
return ans;
}
ll product[1000100];
int main() {
// cout.precision(10);
cin.tie(0);
ios::sync_with_stdio(false);
init_combination();
product[0] = 1;
for (ll i = 1; i <= mod; i++) {
product[i] = product[i - 1] * i % mod;
// cerr << i << " " << product[i] << " " << inv[product[i]];
// cerr << " " << product[i] * inv[product[i]] % mod << endl;
}
ll Q;
cin >> Q;
while (Q--) {
ll x, d, n;
cin >> x >> d >> n;
if (x == 0) {
cout << 0 << endl;
continue;
}
if (d == 0) {
cout << x * n % mod << endl;
continue;
}
ll ans = beki(d, n);
ll start = x * inv[d] % mod;
// cerr << start << endl;
if (start + n - 1 >= mod) {
cout << 0 << endl;
continue;
}
cout << (ans * product[start + n - 1] % mod) * inv[product[start - 1]] % mod
<< endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000003;
ll inv[1000010];
ll FactorialInv[1000010];
ll Factorial[1000010];
ll beki(ll a, ll b) {
if (b == 0) {
return 1;
}
ll ans = beki(a, b / 2);
ans = ans * ans % mod;
if (b % 2 == 1) {
ans = ans * a % mod;
}
return ans;
}
void init_combination() {
inv[1] = 1;
FactorialInv[1] = 1;
Factorial[1] = 1;
Factorial[0] = 1;
FactorialInv[0] = 1;
inv[0] = 1;
for (int i = 2; i < 1000010; i++) {
inv[i] = beki(i, mod - 2);
Factorial[i] = Factorial[i - 1] * i % mod;
FactorialInv[i] = FactorialInv[i - 1] * inv[i] % mod;
}
}
ll combination(ll a, ll b) {
if ((a == b) || (b == 0)) {
return 1;
}
ll ans = Factorial[a] * FactorialInv[b] % mod;
ans = ans * FactorialInv[a - b] % mod;
return ans;
}
ll product[1000100];
int main() {
// cout.precision(10);
cin.tie(0);
ios::sync_with_stdio(false);
init_combination();
product[0] = 1;
for (ll i = 1; i <= mod; i++) {
product[i] = product[i - 1] * i % mod;
// cerr << i << " " << product[i] << " " << inv[product[i]];
// cerr << " " << product[i] * inv[product[i]] % mod << endl;
}
ll Q;
cin >> Q;
while (Q--) {
ll x, d, n;
cin >> x >> d >> n;
if (x == 0) {
cout << 0 << endl;
continue;
}
if (d == 0) {
cout << beki(x, n) << endl;
continue;
}
ll ans = beki(d, n);
ll start = x * inv[d] % mod;
// cerr << start << endl;
if (start + n - 1 >= mod) {
cout << 0 << endl;
continue;
}
cout << (ans * product[start + n - 1] % mod) * inv[product[start - 1]] % mod
<< endl;
}
return 0;
}
| [
"call.add",
"io.output.change"
] | 838,620 | 838,621 | u980655160 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a(n);
rep(i, n) {
string s;
int p;
cin >> s >> p;
p *= -1;
a.push_back(tie(s, p, i));
}
sort(a.begin(), a.end());
rep(i, n) {
string s;
int p, id;
tie(s, p, id) = a.at(i);
cout << id + 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a;
rep(i, n) {
string s;
int p;
cin >> s >> p;
p *= -1;
a.push_back(tie(s, p, i));
}
sort(a.begin(), a.end());
rep(i, n) {
string s;
int p, id;
tie(s, p, id) = a.at(i);
cout << id + 1 << endl;
}
return 0;
} | [] | 838,643 | 838,644 | u442855610 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a(n);
rep(i, n) {
string s;
int p;
cin >> s >> p;
p *= -1;
a.push_back(tie(s, p, i));
}
sort(a.begin(), a.end());
rep(i, n) {
string s;
int p, id;
tie(s, p, id) = a.at(i);
cout << id << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a;
rep(i, n) {
string s;
int p;
cin >> s >> p;
p *= -1;
a.push_back(tie(s, p, i));
}
sort(a.begin(), a.end());
rep(i, n) {
string s;
int p, id;
tie(s, p, id) = a.at(i);
cout << id + 1 << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 838,645 | 838,644 | u442855610 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
pair<pair<string, int>, int> a[105];
for (ll i = 1; i <= n; i++) {
cin >> a[i].first.first >> a[i].first.second;
a[i].first.second *= -1;
a[i].second = i;
}
sort(a, a + n);
for (ll i = 1; i <= n; i++) {
cout << a[i].second << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
pair<pair<string, int>, int> a[105];
for (ll i = 1; i <= n; i++) {
cin >> a[i].first.first >> a[i].first.second;
a[i].first.second *= -1;
a[i].second = i;
}
sort(a, a + n + 1);
for (ll i = 1; i <= n; i++) {
cout << a[i].second << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 838,646 | 838,647 | u077051605 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
pair<pair<string, int>, int> a[n];
for (ll i = 1; i <= n; i++) {
cin >> a[i].first.first >> a[i].first.second;
a[i].first.second *= -1;
a[i].second = i;
}
sort(a, a + n);
for (ll i = 1; i <= n; i++) {
cout << a[i].second << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
pair<pair<string, int>, int> a[105];
for (ll i = 1; i <= n; i++) {
cin >> a[i].first.first >> a[i].first.second;
a[i].first.second *= -1;
a[i].second = i;
}
sort(a, a + n + 1);
for (ll i = 1; i <= n; i++) {
cout << a[i].second << endl;
}
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 838,648 | 838,647 | u077051605 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; n++)
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> data;
rep(i, N) {
string s;
int p;
cin >> s >> p;
data.push_back(make_tuple(s, -p, i + 1));
}
sort(data.begin(), data.end());
rep(i, N) { cout << get<2>(data[i]) << endl; }
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> data;
rep(i, N) {
string s;
int p;
cin >> s >> p;
data.push_back(make_tuple(s, -p, i + 1));
}
sort(data.begin(), data.end());
rep(i, N) { cout << get<2>(data[i]) << endl; }
return 0;
}
| [
"preprocessor.define.value.change"
] | 838,652 | 838,653 | u391446672 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
pair<pair<string, int>, int> p[101];
for (int i = 1; i <= n; i++) {
string name;
int score;
cin >> name >> score;
p[i] = make_pair(make_pair(name, -score), i);
}
sort(p, p + n);
for (int i = 1; i <= n; i++)
cout << p[i].second << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
pair<pair<string, int>, int> p[101];
for (int i = 0; i < n; i++) {
string name;
int score;
cin >> name >> score;
p[i] = make_pair(make_pair(name, -score), i + 1);
}
sort(p, p + n);
for (int i = 0; i < n; i++)
cout << p[i].second << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 838,663 | 838,664 | u524568016 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, b;
cin >> N;
vector<pair<pair<string, int>, int>> data;
string a;
for (int i = 0; i < N; i++) {
cin >> a >> b;
data.push_back(make_pair(make_pair(a, b), i + 1));
}
sort(data.begin(), data.end());
for (int i = 0; i < N; i++)
cout << data.at(i).second << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, b;
cin >> N;
vector<pair<pair<string, int>, int>> data;
string a;
for (int i = 0; i < N; i++) {
cin >> a >> b;
data.push_back(make_pair(make_pair(a, -b), i + 1));
}
sort(data.begin(), data.end());
for (int i = 0; i < N; i++)
cout << data.at(i).second << endl;
} | [
"expression.operation.unary.add",
"call.arguments.change"
] | 838,673 | 838,674 | u332183856 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> res(103);
for (int i = 0; i < n; i++) {
string name;
int score;
int num = i;
cin >> name >> score;
res[i] = make_tuple(name, score, i);
}
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > 0; j--) {
if (get<0>(res[j]) < get<0>(res[j - 1])) {
tuple<string, int, int> temp = res[j - 1];
res[j - 1] = res[j];
res[j] = temp;
}
if (get<0>(res[j]) == get<0>(res[j - 1])) {
if (get<1>(res[j]) > get<1>(res[j - 1])) {
tuple<string, int, int> tmp = res[j - 1];
res[j - 1] = res[j];
res[j] = tmp;
}
}
}
}
for (int i = 0; i < n; i++) {
cout << get<2>(res[i]) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> res(103);
for (int i = 0; i < n; i++) {
string name;
int score;
int num = i;
cin >> name >> score;
res[i] = make_tuple(name, score, i);
}
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > 0; j--) {
if (get<0>(res[j]) < get<0>(res[j - 1])) {
tuple<string, int, int> temp = res[j - 1];
res[j - 1] = res[j];
res[j] = temp;
}
if (get<0>(res[j]) == get<0>(res[j - 1])) {
if (get<1>(res[j]) > get<1>(res[j - 1])) {
tuple<string, int, int> tmp = res[j - 1];
res[j - 1] = res[j];
res[j] = tmp;
}
}
}
}
for (int i = 0; i < n; i++) {
cout << get<2>(res[i]) + 1 << endl;
}
} | [
"expression.operation.binary.add"
] | 838,675 | 838,676 | u266826227 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a;
for (int i = 1; i <= n; i++) {
string s;
int p;
cin >> s >> p;
p = -p;
a.push_back(make_tuple(s, p, i));
}
sort(a.begin(), a.end());
for (int i = 1; i <= n; i++) {
cout << get<2>(a[i]) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a;
for (int i = 1; i <= n; i++) {
string s;
int p;
cin >> s >> p;
p = -p;
a.push_back(make_tuple(s, p, i));
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
cout << get<2>(a[i]) << endl;
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 838,692 | 838,693 | u814773738 | cpp |
p03030 | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
return 0; \
}();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll, ll>
#define debug(x) cout << x << "\n";
#define debug cout << "debugged\n";
#define minval -2e9
#define maxval 2e9
long double PI = 3.14159265358979323846;
const ll M = 1e9 + 7;
const ll inf = 1e18;
const ll ms = 2e5 + 5;
fast;
ll n, m, c, ans;
bool compare(pair<string, ll> &a, pair<string, ll> &b) {
if (a.first == b.first)
return a.second > b.second;
return lexicographical_compare(a.first.begin(), a.first.end(),
b.first.begin(), b.first.end());
}
void solve() {
cin >> n;
vector<pair<string, ll>> vc(n), vcc(n);
for (ll i = 0; i < n; i++) {
cin >> vc[i].first >> vc[i].second;
vcc[i].first = vc[i].first;
vcc[i].second = vc[i].second;
}
sort(vcc.begin(), vcc.end(), compare);
for (auto it : vc) {
for (ll i = 0; i < n; i++) {
if (it.first == vcc[i].first && it.second == vcc[i].second) {
cout << i + 1 << endl;
break;
}
}
}
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// int t;cin>>t;while(t--)
{ solve(); }
return 0;
} | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
return 0; \
}();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll, ll>
#define debug(x) cout << x << "\n";
#define debug cout << "debugged\n";
#define minval -2e9
#define maxval 2e9
long double PI = 3.14159265358979323846;
const ll M = 1e9 + 7;
const ll inf = 1e18;
const ll ms = 2e5 + 5;
fast;
ll n, m, c, ans;
bool compare(pair<string, ll> &a, pair<string, ll> &b) {
if (a.first == b.first)
return a.second > b.second;
return lexicographical_compare(a.first.begin(), a.first.end(),
b.first.begin(), b.first.end());
}
void solve() {
cin >> n;
vector<pair<string, ll>> vc(n), vcc(n);
for (ll i = 0; i < n; i++) {
cin >> vc[i].first >> vc[i].second;
vcc[i].first = vc[i].first;
vcc[i].second = vc[i].second;
}
sort(vcc.begin(), vcc.end(), compare);
for (auto it : vcc) {
for (ll i = 0; i < n; i++) {
if (it.first == vc[i].first && it.second == vc[i].second) {
cout << i + 1 << endl;
break;
}
}
}
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// int t;cin>>t;while(t--)
{ solve(); }
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 838,699 | 838,700 | u526639495 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> data(N);
string s;
int point;
for (int i = 0; i < N; i++) {
cin >> s >> point;
data.at(i) = make_tuple(s, point, i + 1);
}
sort(data.begin(), data.end());
for (int i = 0; i < N; i++) {
cout << get<2>(data.at(i)) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> data(N);
string s;
int point;
for (int i = 0; i < N; i++) {
cin >> s >> point;
data.at(i) = make_tuple(s, -point, i + 1);
}
sort(data.begin(), data.end());
for (int i = 0; i < N; i++) {
cout << get<2>(data.at(i)) << endl;
}
}
| [
"expression.operation.unary.add",
"call.arguments.change"
] | 838,715 | 838,716 | u611945374 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> t;
for (int i = 0; i < n; i++) {
string tmp_s;
int tmp_p;
cin >> tmp_s >> tmp_p;
t.emplace_back(tmp_s, -tmp_p, i);
}
sort(t.begin(), t.end());
for (int i = 0; i < n; i++) {
cout << get<2>(t[i]) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> t;
for (int i = 0; i < n; i++) {
string tmp_s;
int tmp_p;
cin >> tmp_s >> tmp_p;
t.emplace_back(tmp_s, -tmp_p, i + 1);
}
sort(t.begin(), t.end());
for (int i = 0; i < n; i++) {
cout << get<2>(t[i]) << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 838,717 | 838,718 | u221391729 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); ++i)
#define F first
#define S second
const double PI = acos(-1);
// fixed<<setprecision(11)<<
char in[120];
pair<pair<string, int>, int> p[110];
int main() {
int a;
cin >> a;
rep(i, a) {
int t;
cin >> in[i + 1] >> t;
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
rep(i, a) cout << p[i].second + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); ++i)
#define F first
#define S second
const double PI = acos(-1);
// fixed<<setprecision(11)<<
char in[120];
pair<pair<string, int>, int> p[110];
int main() {
int a;
cin >> a;
rep(i, a) {
int t;
cin >> in >> t;
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
rep(i, a) cout << p[i].second + 1 << endl;
} | [] | 838,733 | 838,734 | u884476319 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); ++i)
#define F first
#define S second
const double PI = acos(-1);
// fixed<<setprecision(11)<<
char in[120];
pair<pair<string, int>, int> p[110];
int main() {
int a;
cin >> a;
rep(i, a) {
int t;
cin >> in[i] >> t;
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
rep(i, a) cout << p[i].second + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); ++i)
#define F first
#define S second
const double PI = acos(-1);
// fixed<<setprecision(11)<<
char in[120];
pair<pair<string, int>, int> p[110];
int main() {
int a;
cin >> a;
rep(i, a) {
int t;
cin >> in >> t;
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
rep(i, a) cout << p[i].second + 1 << endl;
} | [] | 838,735 | 838,734 | u884476319 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
using tsii = tuple<string, int, int>;
vector<tsii> vec(N);
for (int i = 0; i < N; i++) {
int P;
string S;
cin >> S >> P;
vec.at(i) = make_tuple(S, 100 - P, i);
}
sort(vec.begin(), vec.end());
for (tsii i : vec)
cout << get<2>(i) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
using tsii = tuple<string, int, int>;
vector<tsii> vec(N);
for (int i = 0; i < N; i++) {
int P;
string S;
cin >> S >> P;
vec.at(i) = make_tuple(S, 100 - P, i);
}
sort(vec.begin(), vec.end());
for (tsii i : vec)
cout << get<2>(i) + 1 << endl;
} | [
"expression.operation.binary.add"
] | 838,757 | 838,758 | u306482197 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a;
for (int i = 1; i <= n; i++) {
string s;
int p;
cin >> s >> p;
a.push_back(tie(s, p, i));
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
string s;
int p;
int id;
tie(s, p, id) = a.at(i);
cout << id << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a;
for (int i = 1; i <= n; i++) {
string s;
int p;
cin >> s >> p;
p = -p;
a.push_back(tie(s, p, i));
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
string s;
int p;
int id;
tie(s, p, id) = a.at(i);
cout << id << endl;
}
}
| [
"assignment.add"
] | 838,759 | 838,760 | u166378830 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a;
for (int i = 1; i <= n; i++) {
string s;
int p;
cin >> s >> p;
a.push_back(tie(s, p, i));
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
string s;
int p;
int id;
tie(s, p, id) = a.at(i);
cout << id << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a;
for (int i = 1; i <= n; i++) {
string s;
int p;
cin >> s >> p;
p = -p;
a.push_back(tie(s, p, i));
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
string s;
int p;
int id;
tie(s, p, id) = a.at(i);
cout << id << endl;
}
} | [
"assignment.add"
] | 838,759 | 838,761 | u166378830 | cpp |
p03030 | #include <iomanip>
#include <iostream>
/*cout <<setprecision(11)<<ret<<endl;で、数字部分を計11桁表示*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// Shift+Command+bでデバッグ
//その後ターミナルで./a.outを実行
//入力を貼り付ける
//////////////////
// A
/*int main(void){
int a,p;cin >>a >>p;
cout<<(a*3+p)/2<<endl;
return 0;
}*/
//////////////////
// B
int main(void) {
int n;
cin >> n;
vector<pair<string, pair<int, int>>> box(n);
rep(i, n) {
cin >> box[i].first >> box[i].second.first;
box[i].second.second = i + 1;
box[i].second.first *= -1;
}
sort(box.begin(), box.end());
// rep(i,n)cout <<box[i].first<<" "<<box[i].second.first<<"
// "<<box[i].second.second<<endl;
rep(i, n) cout << box[i].second.second;
cout << endl;
return 0;
}
//////////////////
// C
/*int main(void){
return 0;
}*/
//////////////////
// D
/*int main(void){
return 0;
}*/
//////////////////
// E
/*int main(void){
return 0;
}*/
//////////////////
// F
/*int main(void){
return 0;
}*/
| #include <iomanip>
#include <iostream>
/*cout <<setprecision(11)<<ret<<endl;で、数字部分を計11桁表示*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// Shift+Command+bでデバッグ
//その後ターミナルで./a.outを実行
//入力を貼り付ける
//////////////////
// A
/*int main(void){
int a,p;cin >>a >>p;
cout<<(a*3+p)/2<<endl;
return 0;
}*/
//////////////////
// B
int main(void) {
int n;
cin >> n;
vector<pair<string, pair<int, int>>> box(n);
rep(i, n) {
cin >> box[i].first >> box[i].second.first;
box[i].second.second = i + 1;
box[i].second.first *= -1;
}
sort(box.begin(), box.end());
// rep(i,n)cout <<box[i].first<<" "<<box[i].second.first<<"
// "<<box[i].second.second<<endl;
rep(i, n) cout << box[i].second.second << endl;
return 0;
}
//////////////////
// C
/*int main(void){
return 0;
}*/
//////////////////
// D
/*int main(void){
return 0;
}*/
//////////////////
// E
/*int main(void){
return 0;
}*/
//////////////////
// F
/*int main(void){
return 0;
}*/
| [] | 838,782 | 838,783 | u317432339 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> score(n);
rep(i, n) {
string s;
int p;
cin >> s >> p;
p = -p;
score[i] = tie(s, p, i);
}
sort(score.begin(), score.end());
rep(i, n) cout << get<2>(score[i]) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> score(n);
rep(i, n) {
string s;
int p;
cin >> s >> p;
p = -p;
score[i] = tie(s, p, i);
}
sort(score.begin(), score.end());
rep(i, n) cout << get<2>(score[i]) + 1 << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 838,784 | 838,785 | u866879589 | cpp |
p03030 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> t(n);
rep(i, n) {
string s;
int point;
cin >> s >> point;
t[i] = make_tuple(s, point, i + 1);
}
sort(t.begin(), t.end());
rep(i, n) {
string s;
int point;
int a;
tie(s, point, a) = t[i];
cout << a << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> t(n);
rep(i, n) {
string s;
int point;
cin >> s >> point;
t[i] = make_tuple(s, -point, i + 1);
}
sort(t.begin(), t.end());
rep(i, n) {
string s;
int point;
int a;
tie(s, point, a) = t[i];
cout << a << endl;
}
} | [
"expression.operation.unary.add",
"call.arguments.change"
] | 838,792 | 838,793 | u742494009 | cpp |
p03030 | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const int maxn = 100 + 10;
const int inf = 0x3f3f3f3f;
struct node {
string city;
int res;
};
node da[maxn];
int n, ans[maxn];
int read() {
int x;
scanf("%d", &x);
return x;
}
bool cmp(node x, node y) {
if (x.city == y.city) {
return x.res > y.res;
} else {
return x.city < y.city;
}
}
void init() {
for (int i = 1; i < maxn; i++) {
ans[i] = i;
}
}
int main() {
init();
n = read();
for (int i = 1; i <= n; i++) {
cin >> da[i].city;
da[i].res = read();
}
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i == j) {
continue;
}
int x = ans[i], y = ans[j];
if (da[x].city == da[y].city) {
if (da[x].res < da[y].res) {
swap(ans[i], ans[j]);
}
} else {
if (da[x].city > da[x].city) {
swap(ans[i], ans[j]);
}
}
}
}
for (int i = 1; i <= n; i++) {
cout << ans[i] << endl;
}
} | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const int maxn = 100 + 10;
const int inf = 0x3f3f3f3f;
struct node {
string city;
int res;
};
node da[maxn];
int n, ans[maxn];
int read() {
int x;
scanf("%d", &x);
return x;
}
bool cmp(node x, node y) {
if (x.city == y.city) {
return x.res > y.res;
} else {
return x.city < y.city;
}
}
void init() {
for (int i = 1; i < maxn; i++) {
ans[i] = i;
}
}
int main() {
init();
n = read();
for (int i = 1; i <= n; i++) {
cin >> da[i].city;
da[i].res = read();
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j) {
continue;
}
int x = ans[i], y = ans[j];
if (da[x].city == da[y].city) {
if (da[x].res > da[y].res) {
swap(ans[i], ans[j]);
}
} else {
if (da[x].city < da[y].city) {
swap(ans[i], ans[j]);
}
}
}
}
for (int i = 1; i <= n; i++) {
cout << ans[i] << endl;
}
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 838,794 | 838,795 | u089230684 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
pair<pair<string, int>, int> t[110];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int score;
string name;
cin >> name >> score;
t[i] = make_pair(make_pair(name, score), i + 1);
}
// sort(t.begin(),t.end());
std::sort(t, t + N);
for (int i = 0; i < N; i++) {
cout << t[i].second << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
pair<pair<string, int>, int> t[110]; //なぜint mainよりも前に宣言？
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int score;
string name;
cin >> name >> score;
t[i] = make_pair(make_pair(name, score * (-1)), i + 1);
}
// sort(t.begin(),t.end()); なぜこれじゃダメ？
std::sort(t, t + N);
for (int i = 0; i < N; i++) {
cout << t[i].second << endl;
}
}
/*ここから駄目だったやつ
tuple<string,int,int> t[110]; tuple型でやろうとした
for(int i=0;i<N;i++){
int score;
string name;
cin>>name>>score;
t[i]=make_tuple(name,score*(-1),i+1);
}
std::sort(t,t+N);
for(int i=0;i<N;i++){
cout<<t[i].third<<endl; tupleはこういう風に参照できない？
}
}
*/ | [
"assignment.change"
] | 838,802 | 838,803 | u458713847 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
pair<pair<string, int>, int> t[110];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int score;
string name;
cin >> name >> score;
t[i] = make_pair(make_pair(name, score), i + 1);
}
// sort(t.begin(),t.end());
std::sort(t, t + N);
for (int i = 0; i < N; i++) {
cout << t[i].second << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
pair<pair<string, int>, int> t[110];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int score;
string name;
cin >> name >> score;
t[i] = make_pair(make_pair(name, score * (-1)), i + 1);
}
// sort(t.begin(),t.end());
std::sort(t, t + N);
for (int i = 0; i < N; i++) {
cout << t[i].second << endl;
}
}
| [
"assignment.change"
] | 838,802 | 838,804 | u458713847 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> Guide(N);
for (int i = 0; i < N; i++) {
int s, p;
cin >> s >> p;
Guide.at(i) = make_tuple(s, -p, i);
}
sort(Guide.begin(), Guide.end());
for (int i = 0; i < N; i++) {
cout << get<2>(Guide.at(i)) + 1 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> Guide(N);
for (int i = 0; i < N; i++) {
string s;
int p;
cin >> s >> p;
Guide.at(i) = make_tuple(s, -p, i);
}
sort(Guide.begin(), Guide.end());
for (int i = 0; i < N; i++) {
cout << get<2>(Guide.at(i)) + 1 << endl;
}
} | [
"variable_declaration.type.change"
] | 838,827 | 838,828 | u646263311 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.