problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03141 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <sys/timeb.h>
#inclu... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <sys/timeb.h>
#inclu... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 941,386 | 941,387 | u366676780 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | [
"identifier.change",
"call.function.change"
] | 941,388 | 941,389 | u172929647 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
long long inf = 1e9 + 7;
int main(void) {
long long n;
cin >> n;
vector<long long> a(n), b(n), d(n);
vector<pair<int, int>> bridge(n);
for (int i = 0; i < n;... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
long long inf = 1e9 + 7;
int main(void) {
long long n;
cin >> n;
vector<long long> a(n), b(n), d(n);
vector<pair<long long, long long>> bridge(n);
for (int i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,392 | 941,393 | u921168761 | cpp |
p03141 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
typedef long long LL;
#define dd c = getchar()
inline int read() {
int a = 0, b = 1, dd;
while (!isdigit(c)) {
if (c == '-')
b = -b;
dd;
}
while (isdigit(c)) {
a = a * 10 + c - '0';
dd;
}
ret... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
typedef long long LL;
#define dd c = getchar()
inline int read() {
int a = 0, b = 1, dd;
while (!isdigit(c)) {
if (c == '-')
b = -b;
dd;
}
while (isdigit(c)) {
a = a * 10 + c - '0';
dd;
}
ret... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,398 | 941,399 | u000109997 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
vector<tuple<long long, long long, long long>> v;
cin >> N;
for (int i = 0; i < N; ++i) {
long long a, b;
cin >> a >> b;
v.push_back(make_tuple(a - b, a, -b));
}
sort(v.begin(), v.end());
long long result = 0;
for ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
vector<tuple<long long, long long, long long>> v;
cin >> N;
for (int i = 0; i < N; ++i) {
long long a, b;
cin >> a >> b;
v.push_back(make_tuple(a + b, a, b));
}
sort(v.begin(), v.end());
long long result = 0;
for (... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.unary.arithmetic.remove",
"expression.operator.change"
] | 941,400 | 941,401 | u003080851 | cpp |
p03141 | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LL long long
#define LD long double
#define FOR(i, a, b) for (int i = (int)a; i <= (int)b; i++)
#define RFOR(i, a, b) for (int i = (int)a; i >= (int)b; i--)
#define int LL
using namespace std;
const int MX = 1e5... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LL long long
#define LD long double
#define FOR(i, a, b) for (int i = (int)a; i <= (int)b; i++)
#define RFOR(i, a, b) for (int i = (int)a; i >= (int)b; i--)
#define int LL
using namespace std;
const int MX = 1e5... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,407 | 941,408 | u472870759 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct Pair {
long long score;
int index;
Pair(long long s, int i) {
score = s;
index = i;
}
bool operator<(const Pair &another) const { return score < another.score; };
};
int main() {
int n;
cin >> n... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct Pair {
long long score;
int index;
Pair(long long s, int i) {
score = s;
index = i;
}
bool operator<(const Pair &another) const { return score < another.score; };
};
int main() {
int n;
cin >> n... | [
"assignment.change"
] | 941,411 | 941,412 | u847307807 | cpp |
p03141 | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | [] | 941,420 | 941,421 | u539339654 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define dbg(x) cerr << #x "=" << x << endl;
typedef long long LL;
typedef pair<LL, LL> P;
#define x first
#define y second
const int MAX_N = 1e5 + 100;
P A[MAX_N], B[MAX_N];
LL orA[MAX_N], orB[MAX_N];
int N;
bool cmp(P a, P b) { return a.x > b.x; }
int main() {
// freo... | #include <bits/stdc++.h>
using namespace std;
#define dbg(x) cerr << #x "=" << x << endl;
typedef long long LL;
typedef pair<LL, LL> P;
#define x first
#define y second
const int MAX_N = 1e5 + 100;
P A[MAX_N], B[MAX_N];
LL orA[MAX_N], orB[MAX_N];
int N;
bool cmp(P a, P b) { return a.x > b.x; }
int main() {
// freo... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,430 | 941,431 | u466497827 | cpp |
p03141 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
long long score[100000];
long long A[100000], B[100000];
int index[100000];
cin >> N;
for (int i = 0; i < N; i++) {
long long a, b;
cin >> A[i] >> B[i];
score[i] = A[i] + B[i];
index[i] = i;
}
sort(index,... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
long long score[100000];
long long A[100000], B[100000];
int index[100000];
cin >> N;
for (int i = 0; i < N; i++) {
long long a, b;
cin >> A[i] >> B[i];
score[i] = A[i] + B[i];
index[i] = i;
}
sort(index,... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,438 | 941,439 | u721980697 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef tuple<ll, ll, int> P;
bool cmp(const P &a, const P &b) {
if (get<1>(a) == get<1>(b)) {
return get<0>(a) > get<0>(b);
} else {
return get<1>(a) > get<1>(b);
}
}
int main() {
i... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef tuple<ll, ll, int> P;
bool cmp(const P &a, const P &b) {
if (get<1>(a) == get<1>(b)) {
return get<0>(a) > get<0>(b);
} else {
return get<1>(a) > get<1>(b);
}
}
int main() {
i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,440 | 941,441 | u508729896 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef tuple<ll, ll, int> P;
bool cmp(const P &a, const P &b) {
if (get<1>(a) == get<1>(b)) {
return get<0>(a) > get<0>(b);
} else {
return get<1>(a) > get<1>(b);
}
}
int main() {
i... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef tuple<ll, ll, int> P;
bool cmp(const P &a, const P &b) {
if (get<1>(a) == get<1>(b)) {
return get<0>(a) > get<0>(b);
} else {
return get<1>(a) > get<1>(b);
}
}
int main() {
i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 941,442 | 941,441 | u508729896 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define INF 2100000000
#define INVALID -1
using namespace std;
int dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};
class Ryouri {
public:
long long int a, b;
bool operator<(const Ryouri &an... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define INF 2100000000
#define INVALID -1
using namespace std;
int dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};
class Ryouri {
public:
long long int a, b;
bool operator<(const Ryouri &an... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,443 | 941,444 | u697367509 | cpp |
p03141 | #include <bits/stdc++.h>
#define uint unsigned int
#define ld long double
#define int long long
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define uint unsigned int
#define ld long double
#define int long long
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | [
"expression.operation.unary.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"expression.operator.change"
] | 941,449 | 941,450 | u578751202 | cpp |
p03141 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, ans, a, b, cnt, cn;
vector<P> v, v2;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end()... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, ans, a, b, cnt, cn;
vector<P> v, v2;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end()... | [
"expression.operation.binary.add"
] | 941,451 | 941,452 | u050428930 | cpp |
p03141 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, ans, a, b, cnt, cn;
vector<P> v, v2;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end()... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, ans, a, b, cnt, cn;
vector<P> v, v2;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end()... | [
"call.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,453 | 941,452 | u050428930 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<iii> viii;
#define REP(i, n) for (ll ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<iii> viii;
#define REP(i, n) for (ll ... | [
"expression.operation.unary.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 941,454 | 941,455 | u957084285 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<iii> viii;
#define REP(i, n) for (ll ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<iii> viii;
#define REP(i, n) for (ll ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,456 | 941,455 | u957084285 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
deque<long long> a(n), b(n);
deque<pair<long long, int>> c(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i] = {a[i] + b[i], a[i]};
}
sort(c.begin(), c.end());
bool turn = true;
long long ans1 = 0;
long lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
deque<long long> a(n), b(n);
deque<pair<long long, int>> c(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i] = {a[i] + b[i], a[i]};
}
sort(c.rbegin(), c.rend());
bool turn = true;
long long ans1 = 0;
long ... | [
"call.function.change",
"call.arguments.change"
] | 941,462 | 941,463 | u521364030 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<ll>> v(n, vector<ll>(3));
for (int i = 0; i < n; i++) {
cin >> v[i][1] >> v[i][2];
v[i][0] = v[i][1] - v[i][2];
}
sort(v.begin(), v.end());
reverse(v.... | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<ll>> v(n, vector<ll>(3));
for (int i = 0; i < n; i++) {
cin >> v[i][1] >> v[i][2];
v[i][0] = v[i][1] + v[i][2];
}
sort(v.begin(), v.end());
reverse(v.... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,471 | 941,472 | u412908746 | cpp |
p03141 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, b) for (int i = a; i >= b; i--)
#define int long long
#define all(a) a.begin(), a.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 10000000... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, b) for (int i = a; i >= b; i--)
#define int long long
#define all(a) a.begin(), a.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 10000000... | [
"call.remove",
"assignment.value.change",
"call.arguments.change"
] | 941,473 | 941,474 | u984730891 | cpp |
p03141 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, b) for (int i = a; i >= b; i--)
#define int long long
#define all(a) a.begin(), a.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 10000000... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, b) for (int i = a; i >= b; i--)
#define int long long
#define all(a) a.begin(), a.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 10000000... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.function.change",
"call.arguments.change"
] | 941,475 | 941,474 | u984730891 | cpp |
p03141 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,476 | 941,477 | u102602414 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change"
] | 941,478 | 941,479 | u472675932 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change"
] | 941,480 | 941,479 | u472675932 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define repn(i, n) for (int i = n; i >= 0; i--)
typedef long long int ll;
int main() {
ll n;
ll ans = 0;
ll a[100000], b[100000], c[100000]... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define repn(i, n) for (int i = n; i >= 0; i--)
typedef long long int ll;
int main() {
ll n;
ll ans = 0;
ll a[100000], b[100000], c[100000]... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.change"
] | 941,487 | 941,488 | u386769326 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define repn(i, n) for (int i = n; i >= 0; i--)
typedef long long int ll;
int main() {
ll n;
ll ans = 0;
int a[100000], b[100000], c[100000... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define repn(i, n) for (int i = n; i >= 0; i--)
typedef long long int ll;
int main() {
ll n;
ll ans = 0;
ll a[100000], b[100000], c[100000]... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.change"
] | 941,489 | 941,488 | u386769326 | cpp |
p03141 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define ALL(x) begin(x), end(x)
using ll = long long;
using namespace std;
ll solve(int n, vector<ll> const &a, vector<ll> const &b) {
vector<int> order(n);
iota(ALL(order), 0);
sort(ALL(order), [&](int i, int j) { return a[i] - b[... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define ALL(x) begin(x), end(x)
using ll = long long;
using namespace std;
ll solve(int n, vector<ll> const &a, vector<ll> const &b) {
vector<int> order(n);
iota(ALL(order), 0);
sort(ALL(order), [&](int i, int j) { return a[i] + b[... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operator.compare.change"
] | 941,492 | 941,493 | u207056619 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | [
"call.function.change",
"call.arguments.change"
] | 941,496 | 941,497 | u340303097 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
pii A[100009];
int main() {
long long ans = 0;
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d%d", &A[i].first, &A[i].second);
sort(A, A + N,
[&](pii P, pii Q) { return P.first + P.second < Q.first + Q.second;... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
pii A[100009];
int main() {
long long ans = 0;
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d%d", &A[i].first, &A[i].second);
sort(A, A + N,
[&](pii P, pii Q) { return P.first + P.second > Q.first + Q.second;... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,500 | 941,501 | u052065730 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < (n); i++)
using namespace std;
void solve() {
long N;
ci... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < (n); i++)
using namespace std;
void solve() {
long N;
ci... | [
"call.function.change",
"call.arguments.change"
] | 941,502 | 941,503 | u995792346 | cpp |
p03141 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 941,508 | 941,509 | u407614884 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,510 | 941,511 | u656771711 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 1000000007, MAX = 100003;
struct point {
ll diff;
ll a;
ll b;
int num;
};
auto compare1 = [](point &A, point &B) {
if (A.diff == B.diff)
return A.a < B.a;
return A.diff > B.diff;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 1000000007, MAX = 100003;
struct point {
ll diff;
ll a;
ll b;
int num;
};
auto compare1 = [](point &A, point &B) {
if (A.diff == B.diff)
return A.a < B.a;
return A.diff < B.diff;
... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operator.arithmetic.change",
"assignment.value.change"
] | 941,512 | 941,513 | u133391510 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))... | [
"call.remove",
"call.arguments.change"
] | 941,518 | 941,519 | u305138467 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, int> P;
int main() {
int N;
cin >> N;
vector<long long> A(N), B(N);
vector<P> v(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
long long s = A[i] + B[i];
v[i] = P(s, i);
}
sort(v.begin(), v.end(), greater<P>());
lo... | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, int> P;
int main() {
int N;
cin >> N;
vector<long long> A(N), B(N);
vector<P> v(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
long long s = A[i] + B[i];
v[i] = P(s, i);
}
sort(v.begin(), v.end(), greater<P>());
lo... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 941,520 | 941,521 | u413492096 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
long long ans1, ans2, n;
vector<pii> vec;
bool cmp(pii a, pii b) { return a.first + a.second < b.first + b.second; }
bool flag = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
vec.push_back(pii(a... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
long long ans1, ans2, n;
vector<pii> vec;
bool cmp(pii a, pii b) { return a.first + a.second < b.first + b.second; }
bool flag = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
vec.push_back(pii(a... | [
"call.arguments.add"
] | 941,522 | 941,523 | u138661009 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int n, a[N], b[N], c[N];
long long ans;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
iota(c, c + n, 0);
sort(c, c + n, [](int A, int B) { return (a[A] + b[A] > a[B]... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int n, a[N], b[N], c[N];
long long ans;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
iota(c, c + n, 0);
sort(c, c + n, [](int A, int B) { return (a[A] + b[A] > a[B]... | [
"assignment.value.change"
] | 941,524 | 941,525 | u163061394 | cpp |
p03141 | // * *********** ********* * ** *
// * * * * *** * * * * *
// * * * * *** * * * * *
// *********** *********** *** ********* * *
// ... | // * *********** ********* * ** *
// * * * * *** * * * * *
// * * * * *** * * * * *
// *********** *********** *** ********* * *
// ... | [] | 941,526 | 941,527 | u217574537 | cpp |
p03141 | #include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
long double PI = 3.14159265;
const int N = 2e6 + 1000;
long long int ans, ans1, ans2, ans3;
long long int n, m, h;
long long int a[N];
long long int b[N];
long long int c[N];
string s, t;
int main() {
ios::sync_with_stdio(false), cin.... | #include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
long double PI = 3.14159265;
const int N = 2e6 + 1000;
long long int ans, ans1, ans2, ans3;
long long int n, m, h;
long long int a[N];
long long int b[N];
long long int c[N];
string s, t;
int main() {
ios::sync_with_stdio(false), cin.... | [
"expression.operator.change"
] | 941,532 | 941,533 | u917609891 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long ans, a[N], b[N];
int n;
vector<int> v;
bool cmp(int i, int j) { return ((a[i] + b[i]) > (a[j] + b[j])); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long ans, a[N], b[N];
int n;
vector<int> v;
bool cmp(int i, int j) { return ((a[i] + b[i]) > (a[j] + b[j])); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i... | [
"call.arguments.add"
] | 941,534 | 941,535 | u503381547 | cpp |
p03141 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define RE... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define RE... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,542 | 941,543 | u055303078 | cpp |
p03141 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define RE... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define RE... | [
"variable_declaration.type.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,544 | 941,543 | u055303078 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
long long n;
typedef pair<long long, long long> pll;
bool cmp(pll x, pll y) { return x.first + x.second > y.first + y.second; }
pll dd[100010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> dd[i].first >> dd[i].second;
}
sort(dd + 1, dd + n + 1);
... | #include <bits/stdc++.h>
using namespace std;
long long n;
typedef pair<long long, long long> pll;
bool cmp(pll x, pll y) { return x.first + x.second > y.first + y.second; }
pll dd[100010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> dd[i].first >> dd[i].second;
}
sort(dd + 1, dd + n + 1, c... | [
"call.arguments.add"
] | 941,549 | 941,550 | u313427116 | cpp |
p03141 | #include <algorithm>
#include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 100000;
int main() {
int N, A, B;
static int p[MAX];
int64_t ans = 0;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> A >> B;
p[i] = A + B;
ans -= B;
}
sort(p, p + N);
for (int i = 0; i < ... | #include <algorithm>
#include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 100000;
int main() {
int N, A, B;
static int p[MAX];
int64_t ans = 0;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> A >> B;
p[i] = -(A + B);
ans -= B;
}
sort(p, p + N);
for (int i = 0; i... | [
"expression.operator.change"
] | 941,555 | 941,556 | u550314572 | cpp |
p03141 | #include <algorithm>
#include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 100000;
int main() {
int N;
static pair<int, pair<int, int>> p[MAX];
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> p[i].second.first >> p[i].second.second;
p[i].first = p[i].second.first + p[i].seco... | #include <algorithm>
#include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 100000;
int main() {
int N;
static pair<int, pair<int, int>> p[MAX];
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> p[i].second.first >> p[i].second.second;
p[i].first = -p[i].second.first - p[i].sec... | [
"expression.operation.unary.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,557 | 941,558 | u550314572 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <random>
#include <vector>
using namespace std;
int N;
pair<long long, pair<long long, long long>> P[100000];
int main(void) {
long long a, b;
scanf("%d", &N);
for (int i = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <random>
#include <vector>
using namespace std;
int N;
pair<long long, pair<long long, long long>> P[100000];
int main(void) {
long long a, b;
scanf("%d", &N);
for (int i = ... | [] | 941,568 | 941,569 | u828732026 | cpp |
p03141 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
return (a.second + a.first > b.second + b.first) ||
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
return (a.second + a.first > b.second + b.first) ||
... | [
"assignment.add"
] | 941,570 | 941,571 | u122365993 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll d[100005];
int main() {
int N;
cin >> N;
ll a, b;
ll ret = 0;
for (int i = 0; i < N; i++) {
cin >> a >> b;
ret -= b;
d[i] = a + b;
}
sort(d, d + N, less<ll>());
for (int i = 0; i < N; i +... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll d[100005];
int main() {
int N;
cin >> N;
ll a, b;
ll ret = 0;
for (int i = 0; i < N; i++) {
cin >> a >> b;
ret -= b;
d[i] = a + b;
}
sort(d, d + N, greater<ll>());
for (int i = 0; i < N; ... | [
"identifier.change",
"call.arguments.change"
] | 941,574 | 941,575 | u608234874 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define sz size
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORN(i, a, b) for (int i = a; i <= b; i++)
#define FORRN(i, a, b) for (int i = (a); i >= (b); i--)
#define FORR(i, a, b) fo... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define sz size
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORN(i, a, b) for (int i = a; i <= b; i++)
#define FORRN(i, a, b) for (int i = (a); i >= (b); i--)
#define FORR(i, a, b) fo... | [
"literal.number.type.widen.change"
] | 941,578 | 941,579 | u921592714 | cpp |
p03141 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
long a[n], b[n], c[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i] = a[i] + b[i];
ans -= b[i];
}
sort(c, c + n);
for (int j = 0; j < n; j += 2)
ans += c[j];
cout << ans <<... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
long a[n], b[n], c[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i] = a[i] + b[i];
ans -= b[i];
}
sort(c, c + n);
for (int j = 0; j < n; j += 2)
ans += c[n - j - 1];
cout <... | [
"assignment.change"
] | 941,580 | 941,581 | u014847606 | cpp |
p03141 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
#define P pair
// stoi(s): string to int
// stod(... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
#define P pair
// stoi(s): string to int
// stod(... | [
"variable_declaration.type.change"
] | 941,582 | 941,583 | u493080913 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// https://qiita.com/Nasupl_r/items/35a903a4a69932c26c83
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
std::vector<int> vec(n);
int sumao = 0;
for (int i = 0; i ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// https://qiita.com/Nasupl_r/items/35a903a4a69932c26c83
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
std::vector<int> vec(n);
long sumao = 0;
for (int i = 0; i... | [
"variable_declaration.type.primitive.change"
] | 941,584 | 941,585 | u097443428 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// https://qiita.com/Nasupl_r/items/35a903a4a69932c26c83
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
std::vector<int> vec(n);
int sumao = 0;
for (int i = 0; i ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// https://qiita.com/Nasupl_r/items/35a903a4a69932c26c83
int n;
cin >> n;
long a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
std::vector<int> vec(n);
long sumao = 0;
for (int i = 0; ... | [
"variable_declaration.type.primitive.change"
] | 941,584 | 941,586 | u097443428 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#el... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#el... | [
"call.remove",
"call.arguments.change"
] | 941,589 | 941,590 | u633020228 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,591 | 941,592 | u406158207 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
// vector<pair<uint, uint>> d;
uint d[100000];
int main(int, char **) {
unsigned int n;
ll t = 0;
cin >> n;
// d.resize(n);
for (unsigned int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
d[i] = a + b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
// vector<pair<uint, uint>> d;
ll d[100000];
int main(int, char **) {
unsigned int n;
ll t = 0;
cin >> n;
// d.resize(n);
for (unsigned int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
d[i] = -a - b;... | [
"variable_declaration.type.change",
"expression.operation.unary.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.change"
] | 941,596 | 941,597 | u869644355 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
vector<pair<ll, ll>> d;
int main(int, char **) {
unsigned int n;
ll t = 0, s = 0;
cin >> n;
d.resize(n);
for (unsigned int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
d[i].first = a + b;
d[i].second = a;
}
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<pair<ll, ll>> d;
int main(int, char **) {
unsigned int n;
ll t = 0, s = 0;
cin >> n;
d.resize(n);
for (unsigned int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
d[i].first = a + b;
d[i].second = a;
}
sort(d.beg... | [
"variable_declaration.type.narrow.change"
] | 941,602 | 941,603 | u869644355 | cpp |
p03141 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int mai... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 941,606 | 941,607 | u650565403 | cpp |
p03141 | #include <bits/stdc++.h>
#define INF (1 << 31) - 1 // INT_MAX/2
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
int main(int argc, char *argv[]) {
int N;
std::cin >> N;
std::vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
#define INF (1 << 31) - 1 // INT_MAX/2
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
int main(int argc, char *argv[]) {
int N;
std::cin >> N;
std::vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
... | [
"expression.operation.binary.remove"
] | 941,610 | 941,611 | u458798873 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
int N;
long long ans = 0;
cin >> N;
vector<long long> A(N), B(N), sum;
for (int i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
sum.push_back(A.at(i) + B.at(i))... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
int N;
long long ans = 0;
cin >> N;
vector<long long> A(N), B(N), sum;
for (int i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
sum.push_back(A.at(i) + B.at(i))... | [
"call.arguments.add"
] | 941,612 | 941,613 | u441250130 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, x, y;
vector<pair<ll, ll>> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y;
v.push_back({x + y, x});
}
sort(v.begin(), v.end());
ll a = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
a ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, x, y;
vector<pair<ll, ll>> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y;
v.push_back({x + y, x});
}
sort(v.rbegin(), v.rend());
ll a = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
... | [
"call.function.change",
"call.arguments.change"
] | 941,614 | 941,615 | u673058289 | cpp |
p03141 | #include <algorithm>
#include <iostream>
using namespace std;
struct Data {
long a;
long b;
long c;
};
bool cmp(const Data &a, const Data &b) { return a.c < b.c; }
int main() {
int N, ans = 0;
long temp;
cin >> N;
bool taka = true;
struct Data num[N];
for (int i = 0; i < N; i++) {
cin >> num[... | #include <algorithm>
#include <iostream>
using namespace std;
struct Data {
long a;
long b;
long c;
};
bool cmp(const Data &a, const Data &b) { return a.c < b.c; }
int main() {
int N;
long temp, ans = 0;
cin >> N;
bool taka = true;
struct Data num[N];
for (int i = 0; i < N; i++) {
cin >> num[... | [
"variable_declaration.add",
"variable_declaration.remove"
] | 941,616 | 941,617 | u912533549 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define len(val) static_cast<long long>(val.size())
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
ll A[100005], B[100005];
pair<ll, pair<ll, ll>> x[100005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N... | #include <bits/stdc++.h>
using namespace std;
#define len(val) static_cast<long long>(val.size())
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
ll A[100005], B[100005];
pair<ll, pair<ll, ll>> x[100005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N... | [
"call.remove",
"assignment.value.change",
"call.arguments.change"
] | 941,618 | 941,619 | u295988383 | cpp |
p03141 | #include <iostream>
#include <queue>
using namespace std;
struct dish {
long long A;
long long B;
};
int main() {
// 整数の入力
long long N, K, i, a_i, b_i, sumA, sumB;
sumA = 0LL;
sumB = 0LL;
auto c = [](dish p1, dish p2) { return (p1.A + p1.B) > (p2.A + p2.B); };
priority_queue<dish, vector<dish>, declt... | #include <iostream>
#include <queue>
using namespace std;
struct dish {
long long A;
long long B;
};
int main() {
// 整数の入力
long long N, K, i, a_i, b_i, sumA, sumB;
sumA = 0LL;
sumB = 0LL;
auto c = [](dish p1, dish p2) { return (p1.A + p1.B) < (p2.A + p2.B); };
priority_queue<dish, vector<dish>, declt... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,622 | 941,623 | u902500155 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, b_sum = 0;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i] = a[i] + b[i];
b_sum += b[i];
}
sort(c, c + n);
reverse(c, c + n);
int score = 0;
for (int i = 0; i < n; i++) {
if (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, b_sum = 0;
cin >> n;
long a[n], b[n], c[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i] = a[i] + b[i];
b_sum += b[i];
}
sort(c, c + n);
reverse(c, c + n);
long score = 0;
for (int i = 0; i < n; i++) {
if... | [
"variable_declaration.type.primitive.change"
] | 941,624 | 941,625 | u875541682 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
const long long INF = 1LL << 60; // どういう意味だろうか
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inli... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
const long long INF = 1LL << 60; // どういう意味だろうか
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inli... | [
"expression.operation.binary.add"
] | 941,626 | 941,627 | u635329504 | cpp |
p03141 | #include <algorithm>
#include <iostream>
using namespace std;
typedef pair<long long, int> P;
long long a[100010], b[100010];
P c[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i] = P(a[i] + b[i], i);
}
sort(c, c + n);
long long takahashi = 0, aoki = 0;... | #include <algorithm>
#include <iostream>
using namespace std;
typedef pair<long long, int> P;
long long a[100010], b[100010];
P c[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i] = P(a[i] + b[i], i);
}
sort(c, c + n);
long long takahashi = 0, aoki = 0;... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 941,636 | 941,637 | u678503521 | cpp |
p03141 | /*input
6
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i, n) for (int i = 1; i <= n; i++)
#define RED(... | /*input
6
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i, n) for (int i = 1; i <= n; i++)
#define RED(... | [] | 941,642 | 941,643 | u799165954 | cpp |
p03141 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
const int maxn = 100002;
l... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
const int maxn = 100002;
l... | [
"call.function.change",
"call.arguments.change"
] | 941,648 | 941,649 | u499373855 | cpp |
p03141 | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int n;
P p[100005];
ll a[100005], b[100005], c[100005];
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld%lld", &a[i], &b[i]);
c[i] = a[i] + b[i];
p[i] = P(c[i... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int n;
P p[100005];
ll a[100005], b[100005], c[100005];
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld%lld", &a[i], &b[i]);
c[i] = a[i] + b[i];
p[i] = P(c[i... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,650 | 941,651 | u854869949 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A[100000], B[100000];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i] >> B[i];
vector<int> order;
for (int i = 0; i < N; i++)
order.push_back(i);
sort(order.begin(), order.end(),
[&](int a, int b) { return A[a] + B[a] > A[b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A[100000], B[100000];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i] >> B[i];
vector<int> order;
for (int i = 0; i < N; i++)
order.push_back(i);
sort(order.begin(), order.end(),
[&](int a, int b) { return A[a] + B[a] > A[b... | [] | 941,652 | 941,653 | u314396879 | cpp |
p03141 | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool cmp(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return a.first - a.second > b.first - b.second;
}
int main(void) {
int N;
scan... | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool cmp(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return a.first + a.second > b.first + b.second;
}
int main(void) {
int N;
scan... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,656 | 941,657 | u601717680 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<pair<ll, ll>> vs;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
vs.emplace_back(A + B, A);
}
sort(vs.begin(), vs.end());
ll res = 0, t = 1;
for (auto p : vs) {
res += t ? p.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<pair<ll, ll>> vs;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
vs.emplace_back(A + B, A);
}
sort(vs.rbegin(), vs.rend());
ll res = 0, t = 1;
for (auto p : vs) {
res += t ? ... | [
"call.function.change",
"call.arguments.change"
] | 941,658 | 941,659 | u752161277 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
vector<pair<long, long>> D(N);
for (auto &i : D)
cin >> i.first >> i.second;
sort(D.begin(), D.end(),
[](auto a, auto b) { return a.first + a.second < b.second + b.first; });
long long A(0), B(0), d(0);
for (auto i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
vector<pair<long, long>> D(N);
for (auto &i : D)
cin >> i.first >> i.second;
sort(D.rbegin(), D.rend(),
[](auto a, auto b) { return a.first + a.second < b.second + b.first; });
long long A(0), B(0), d(0);
for (auto ... | [
"call.function.change",
"call.arguments.change"
] | 941,660 | 941,661 | u462437857 | cpp |
p03141 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | [
"call.function.change",
"call.arguments.change"
] | 941,662 | 941,663 | u075551644 | cpp |
p03141 | #include <bits/stdc++.h>
#define show(x) std::cerr << #x << " = " << (x) << std::endl
using ll = long long;
template <typename T> constexpr T MOD = static_cast<T>(1000000007);
template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 16;
int main() {
int N;
std::cin >> N;
using P = std::pair<ll, ll>... | #include <bits/stdc++.h>
#define show(x) std::cerr << #x << " = " << (x) << std::endl
using ll = long long;
template <typename T> constexpr T MOD = static_cast<T>(1000000007);
template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 16;
int main() {
int N;
std::cin >> N;
using P = std::pair<ll, ll>... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,664 | 941,665 | u603303736 | cpp |
p03141 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [] | 941,666 | 941,667 | u352642493 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin ... | [
"call.function.change",
"call.arguments.change"
] | 941,668 | 941,669 | u864888234 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
#define mod (long)(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
#define mod (long)(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 ... | [
"call.arguments.add"
] | 941,670 | 941,671 | u115888500 | cpp |
p03141 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
P p[200000];
int main() {
int n;
scanf("%d", &n);
rep(i, n) { scanf("%d%d... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
P p[200000];
int main() {
int n;
scanf("%d", &n);
rep(i, n) { scanf("%d%d... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,672 | 941,673 | u781091740 | cpp |
p03142 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | [] | 941,680 | 941,681 | u221285045 | cpp |
p03142 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
void md(int index, vector<vector<int>> &child, vector<int> &height,
vector<int> &r) {
for (int i = 0; i < child[index].size(); ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
void md(int index, vector<vector<int>> &child, vector<int> &height,
vector<int> &r) {
for (int i = 0; i < child[index].size(); ... | [] | 941,694 | 941,695 | u898331860 | cpp |
p03142 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
constexpr int mod = 1e9 + 7;
constexpr int32_t inf = 1001001001;
constexpr int64_t infll = 1001001001001001001ll;
constex... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
constexpr int mod = 1e9 + 7;
constexpr int32_t inf = 1001001001;
constexpr int64_t infll = 1001001001001001001ll;
constex... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 941,702 | 941,703 | u802071009 | cpp |
p03142 | /// Kazuki Hoshino
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define inf 1000000000
#def... | /// Kazuki Hoshino
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define inf 1000000000
#def... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 941,708 | 941,709 | u284140331 | cpp |
p03142 | #include <stdio.h>
#include <stdlib.h>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdint.h>
#include <string.h>
#include <unordered_set>
#define _USE_MATH_DEFINES
#include <math.h>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <queue>
... | #include <stdio.h>
#include <stdlib.h>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdint.h>
#include <string.h>
#include <unordered_set>
#define _USE_MATH_DEFINES
#include <math.h>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <queue>
... | [
"variable_declaration.type.change"
] | 941,710 | 941,711 | u462405902 | cpp |
p03142 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | [
"assignment.change"
] | 941,712 | 941,713 | u202239169 | cpp |
p03142 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef ... | [
"function.return_value.change"
] | 941,714 | 941,715 | u957084285 | cpp |
p03142 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, n) for (int i = 1; i <= n; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n, m;
#define N 100010
int deg[N];
vector<... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, n) for (int i = 1; i <= n; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n, m;
#define N 100010
int deg[N];
vector<... | [
"expression.operation.binary.add"
] | 941,716 | 941,717 | u736446591 | cpp |
p03141 | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
ll n;
cin >> n;
vector<pair<ll, ll>> v;
ll A[n];
ll B[n];
for (ll i = 0; i < n; i++) {
cin >> A[i] >> B[i];
v.push_back({A[i] + B[i], i});
}
sort(v.begin(), v.end());
reverse(v.begin(), v.e... | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
ll n;
cin >> n;
vector<pair<ll, ll>> v;
ll A[n];
ll B[n];
for (ll i = 0; i < n; i++) {
cin >> A[i] >> B[i];
v.push_back({A[i] + B[i], i});
}
sort(v.begin(), v.end());
reverse(v.begin(), v.e... | [] | 941,718 | 941,719 | u206580411 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<ll, ll>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int main() {
int n;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<ll, ll>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int main() {
int n;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.function.change",
"call.arguments.change"
] | 941,722 | 941,723 | u482544950 | cpp |
p03141 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
using vi = vector<int>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using ll = long long;
int main(void) {
int n;
while (scanf("%d", &n) == 1) {
vi a(n), b(n);
vpii ab(n);
for (int i = 0; i < n; i++) {
sca... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
using vi = vector<int>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using ll = long long;
int main(void) {
int n;
while (scanf("%d", &n) == 1) {
vi a(n), b(n);
vpii ab(n);
for (int i = 0; i < n; i++) {
sca... | [
"call.function.change",
"call.arguments.change"
] | 941,724 | 941,725 | u565795452 | cpp |
p03141 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
using vi = vector<int>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using ll = long long;
int main(void) {
int n;
while (scanf("%d", &n) == 1) {
vi a(n), b(n);
vpii ab(n);
for (int i = 0; i < n; i++) {
sca... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
using vi = vector<int>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using ll = long long;
int main(void) {
int n;
while (scanf("%d", &n) == 1) {
vi a(n), b(n);
vpii ab(n);
for (int i = 0; i < n; i++) {
sca... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.function.change",
"call.arguments.change"
] | 941,726 | 941,725 | u565795452 | cpp |
p03141 | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | [] | 941,729 | 941,730 | u318334550 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool comp(pair<ll, ll> a, pair<ll, ll> b) {
if (a.first != b.first) {
return a.first > b.first;
} else {
return a.second < b.second;
}
}
int main() {
ll N;
cin >> N;
vector<ll> A(N), B(N);
vector<pair<ll, ll>> d(N);
for (ll i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool comp(pair<ll, ll> a, pair<ll, ll> b) {
if (a.first != b.first) {
return a.first < b.first;
} else {
return a.second < b.second;
}
}
int main() {
ll N;
cin >> N;
vector<ll> A(N), B(N);
vector<pair<ll, ll>> d(N);
for (ll i... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,731 | 941,732 | u672541593 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool comp(pair<ll, ll> a, pair<ll, ll> b) {
if (a.first != b.first) {
return a.first > b.first;
} else {
return a.second < b.second;
}
}
int main() {
ll N;
cin >> N;
vector<ll> A(N), B(N);
vector<pair<ll, ll>> d(N);
for (ll i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool comp(pair<ll, ll> a, pair<ll, ll> b) {
if (a.first != b.first) {
return a.first < b.first;
} else {
return a.second < b.second;
}
}
int main() {
ll N;
cin >> N;
vector<ll> A(N), B(N);
vector<pair<ll, ll>> d(N);
for (ll i... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operator.arithmetic.change",
"assignment.value.change"
] | 941,733 | 941,732 | u672541593 | cpp |
p03141 | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
struct Dish {
long long A, B;
};
int main() {
int N;
cin >> N;
vector<Dish> dish(N);
for (int i = 0; i < N; i++)
cin >> dish[i].A >> dish[i].B;
sort(dish.begin(), dish.end(),
[](const Dish &l, const Dish &r) { return (r.A + r.B ... | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
struct Dish {
long long A, B;
};
int main() {
int N;
cin >> N;
vector<Dish> dish(N);
for (int i = 0; i < N; i++)
cin >> dish[i].A >> dish[i].B;
sort(dish.begin(), dish.end(),
[](const Dish &l, const Dish &r) { return (l.A + l.B ... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,734 | 941,735 | u623115612 | cpp |
p03141 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define all(c) (c).begin(), (c... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define all(c) (c).begin(), (c... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,736 | 941,737 | u559765551 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> a(n), b(n);
vector<pair<pair<int, int>, int>> c(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i].first.first = a[i] - b[i];
c[i].first.s... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> a(n), b(n);
vector<pair<pair<int, int>, int>> c(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i].first.first = -(a[i] + b[i]);
c[i].firs... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,746 | 941,747 | u205367115 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | [
"identifier.change",
"call.function.change"
] | 941,755 | 941,756 | u211681714 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.