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 =... | #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 =... | [
"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 =... | #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 =... | [
"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, ... | #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, ... | [
"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); ... | // 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); ... | [
"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 (l... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
using ll = long long;
using db = double;
using st = string;
using ch = char;
using vll = V<ll>;
using vpll = V<pair<ll, ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
#define FOR(i, a, b) for (l... | [
"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... | #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... | [
"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())
#def... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
#define rSort(a) sort(a.rbegin(), a.rend())
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#def... | [
"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 /... | #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 /... | [
"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>
#d... | #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>
#d... | [
"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... | #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... | [
"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;
... | #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;
... | [
"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 ^=... | #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 ^=... | [
"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>, g... | #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>, g... | [
"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 ... | #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 ... | [] | 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 (c... | // 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 (c... | [
"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 (c... | // 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 (c... | [
"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 < ... | #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 < ... | [
"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 < ... | #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 < ... | [
"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;
re... | #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;
re... | [
"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(), ... | #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.e... | [] | 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(), ... | #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.e... | [
"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... | #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 <= ... | [
"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++... | #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 <= ... | [
"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... | #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... | [
"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++)
c... | #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++)
... | [
"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++)
c... | #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++)
... | [
"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 (i... | #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 (i... | [
"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++) {
co... | #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++) {
cou... | [
"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(NUL... | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | [
"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++) {
... | #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++) {... | [
"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++) {
... | #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++)... | [
"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<pai... | #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<pai... | [] | 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<pai... | #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<pai... | [] | 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)
... | #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)
... | [
"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;
i... | #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;
... | [
"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;
i... | #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;
... | [
"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を実行
//入力を貼り付ける
////... | #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を実行
//入力を貼り付ける
////... | [] | 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, ... | #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, ... | [
"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... | #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(), ... | [
"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.c... | #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.c... | [
"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);
... | #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(... | [
"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);
... | #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 +... | [
"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>(... | #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... | [
"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.