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 |
|---|---|---|---|---|---|---|---|
p03037 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define up(i, a, b) for (register int i = (a); i <= ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define up(i, a, b) for (register int i = (a); i <= ... | [
"call.add",
"call.arguments.change"
] | 852,622 | 852,623 | u084557456 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int a = 0x7fffffff, b;
int main() {
cin >> n >> m;
for (int x, y, i = 0; i < m; ++i) {
cin >> x >> y;
if (y < a)
a = y;
if (x > b)
b = x;
}
cout << a - b + 1;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, m;
int a = 0x7fffffff, b;
int main() {
cin >> n >> m;
for (int x, y, i = 0; i < m; ++i) {
cin >> x >> y;
if (y < a)
a = y;
if (x > b)
b = x;
}
cout << max(0, a - b + 1);
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 852,628 | 852,629 | u676842959 | cpp |
p03037 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define LL long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPA(i, n) for (int i = 1; i < (n); ++i)
#define PII pair<int, int>
#define PLI pair<long long, int>
#define MOD... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define LL long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPA(i, n) for (int i = 1; i < (n); ++i)
#define PII pair<int, int>
#define PLI pair<long long, int>
#define MOD... | [
"call.add",
"call.arguments.change"
] | 852,638 | 852,639 | u493610446 | cpp |
p03037 | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
int main() {
ll ans, n, m;
cin >> n >> m;
ll Lmax, Rmin;
f... | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
int main() {
ll ans, n, m;
cin >> n >> m;
ll Lmax = 0, Rmin ... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 852,644 | 852,645 | u828752458 | cpp |
p03037 | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | [
"call.add",
"call.arguments.add"
] | 852,648 | 852,649 | u292813062 | cpp |
p03037 | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | [
"call.arguments.add",
"call.arguments.change"
] | 852,654 | 852,655 | u209713918 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int n, m, min, max;
int a, b;
min = 1;
cin >> n >> m;
max = n;
for (int i = 0; i < m; i++) {
cin >> a >> b;
if (min < a) {
min = a;
}
if (b < max) {
max = b;
}
}
if (min < max) {
cout << max - min + 1 << endl;
... | #include <iostream>
using namespace std;
int main() {
int n, m, min, max;
int a, b;
min = 1;
cin >> n >> m;
max = n;
for (int i = 0; i < m; i++) {
cin >> a >> b;
if (min < a) {
min = a;
}
if (b < max) {
max = b;
}
}
if (min <= max) {
cout << max - min + 1 << endl;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 852,656 | 852,657 | u382826454 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
int N, M;
cin >> N... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
int N, M;
cin >> N... | [
"expression.unary.arithmetic.remove"
] | 852,664 | 852,665 | u600896094 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int n, m;
int l[200000], r[200000];
signed main() {
cin >> n >> m;
int mi = n, mx = 0;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int n, m;
int l[200000], r[200000];
signed main() {
cin >> n >> m;
int mi = n, mx = 0;
for (int i =... | [
"call.add",
"call.arguments.add"
] | 852,668 | 852,669 | u263858205 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int L[101000];
int R[101000];
cin >> N >> M;
int maxl = 0;
int minr = 1000000;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
if (maxl < L[i]) {
max... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int L[101000];
int R[101000];
cin >> N >> M;
int maxl = 0;
int minr = 1000000;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
if (maxl < L[i]) {
max... | [
"call.add",
"call.arguments.change"
] | 852,674 | 852,675 | u982234424 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, M;
cin >> N >> M;
int l = 0, r = N;
for (int i = 0; i < M; i++) {
int Li, Ri;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, M;
cin >> N >> M;
int l = 0, r = N;
for (int i = 0; i < M; i++) {
int Li, Ri;
... | [
"call.add",
"call.arguments.change"
] | 852,678 | 852,679 | u050706842 | cpp |
p03033 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iter... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iter... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 852,692 | 852,693 | u989345508 | cpp |
p03033 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
class LazySegmentTree {
// TODO... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
class LazySegmentTree {
// TODO... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"variable_declaration.value.change",
"identifier.change"
] | 852,718 | 852,719 | u843522325 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll... | [
"assignment.value.change",
"identifier.change"
] | 852,725 | 852,726 | u355335354 | cpp |
p03033 | #include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
template <typename T> map<T, int> coordinate_compression(vector<T> x) {
int n = x.size();
vector<int> y(n);
iota(y.begin(), y.end(), 0);
sort... | #include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
template <typename T> map<T, int> coordinate_compression(vector<T> x) {
int n = x.size();
vector<int> y(n);
iota(y.begin(), y.end(), 0);
sort... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 852,727 | 852,728 | u141642872 | cpp |
p03033 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<... | [
"call.arguments.change",
"expression.unary.arithmetic.remove"
] | 852,747 | 852,748 | u828388155 | cpp |
p03033 |
#include <time.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream> // ifstream, ofstream
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <omp.h... |
#include <time.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream> // ifstream, ofstream
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <omp.h... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 852,757 | 852,758 | u279976468 | cpp |
p03033 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#includ... | [
"control_flow.loop.condition.change",
"call.function.change"
] | 852,791 | 852,792 | u698883164 | cpp |
p03033 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define F first
#define S second
using namespace std;
typedef long long ll;
const ll M = 4e18;
struct st {
ll s, e, i;
};
bool operator<(st p, st q) { return p.i > q.i; }
bool cmp(st p, st q) { return p.s < q.s; }
ll ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define F first
#define S second
using namespace std;
typedef long long ll;
const ll M = 4e18;
struct st {
ll s, e, i;
};
bool operator<(st p, st q) { return p.i > q.i; }
bool cmp(st p, st q) { return p.s < q.s; }
ll ... | [
"control_flow.loop.for.condition.change"
] | 852,799 | 852,800 | u307227472 | cpp |
p03038 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"variable_declaration.type.change"
] | 852,821 | 852,822 | u493520238 | cpp |
p03038 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 852,825 | 852,826 | u809967037 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
bool compair(pair<ll, ll> a, pair<ll, ll> b) {
if (a.second != b.second)
return a.second > b.second;
else
return a.first > b.first;
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
bool compair(pair<ll, ll> a, pair<ll, ll> b) {
if (a.second != b.second)
return a.second > b.second;
else
return a.first > b.first;
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
... | [
"identifier.change",
"call.arguments.change"
] | 852,827 | 852,828 | u105533331 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | [
"literal.number.change",
"assignment.value.change"
] | 852,829 | 852,830 | u644224332 | cpp |
p03038 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define arr array
using namespace std;
const int e = 2e6 + 69;
const ll mod = 1e9 + 7;
ll a[e];
arr<int, 2> b[e];
// beginner 1999 127
int main() {
int n, m;
cin >> n >> m;
multiset<arr<int, 2>, greater<arr<int, 2>>> cur;
for (int i = 1; i ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define arr array
using namespace std;
const int e = 2e6 + 69;
const ll mod = 1e9 + 7;
ll a[e];
arr<int, 2> b[e];
// beginner 1999 127
int main() {
int n, m;
cin >> n >> m;
multiset<arr<int, 2>, greater<arr<int, 2>>> cur;
for (int i = 1; i ... | [
"assignment.change"
] | 852,835 | 852,836 | u424316992 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using pint = pair<int, int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
int main() {
int n... | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using pint = pair<int, int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
int main() {
int n... | [
"variable_declaration.type.change"
] | 852,859 | 852,860 | u825601908 | cpp |
p03038 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(n);
vector<vector<ll>> bc(m, vector<ll>(2));
rep(i, n) { cin >> a[i]; }
rep(i, m) { cin >> bc[i][1] >> bc[i][0];... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(n);
vector<vector<ll>> bc(m, vector<ll>(2));
rep(i, n) { cin >> a[i]; }
rep(i, m) { cin >> bc[i][1] >> bc[i][0];... | [
"expression.operation.binary.remove"
] | 852,863 | 852,864 | u992471673 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using graph = vector<vector<int>>;
using pii = pair<int, int>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using graph = vector<vector<int>>;
using pii = pair<int, int>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#defin... | [] | 852,868 | 852,869 | u425848474 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long> v;
vector<pair<long long, int>> cards;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
for (int i = 0; i < m; i++) {
int x;
long long... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long> v;
vector<pair<long long, int>> cards;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
for (int i = 0; i < m; i++) {
int x;
long long... | [
"assignment.change"
] | 852,870 | 852,871 | u041775325 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#defi... | [
"call.add"
] | 852,872 | 852,873 | u053035261 | cpp |
p03038 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define LL long long
typedef pair<LL, LL> P;
bool pairCompare(const P &first... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define LL long long
typedef pair<LL, LL> P;
bool pairCompare(const P &first... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 852,908 | 852,909 | u330661451 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<int> a;
for (int i = 0; i < n; i++) {
int ta;
cin >> ta;
a.emplace... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<int> a;
for (int i = 0; i < n; i++) {
int ta;
cin >> ta;
a.emplace... | [
"call.function.change",
"call.arguments.change"
] | 852,910 | 852,911 | u568501780 | cpp |
p03038 | #include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
scanf("%d %d", &N, &M);
vector<pair<int, int>> cards;
for (int i = 0; i < N; i++) {
int a;
scanf("%d", &a);
cards.push_back(pair<int, int>(a, 1));
}
for (int i = 0; i < M; i++... | #include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
scanf("%d %d", &N, &M);
vector<pair<int, int>> cards;
for (int i = 0; i < N; i++) {
int a;
scanf("%d", &a);
cards.push_back(pair<int, int>(a, 1));
}
for (int i = 0; i < M; i++... | [
"type_conversion.add"
] | 852,912 | 852,913 | u316549668 | cpp |
p03038 | #include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
scanf("%d %d", &N, &M);
vector<pair<int, int>> cards;
for (int i = 0; i < N; i++) {
int a;
scanf("%d", &a);
cards.push_back(pair<int, int>(a, 1));
}
for (int i = 0; i < M; i++... | #include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
scanf("%d %d", &N, &M);
vector<pair<int, int>> cards;
for (int i = 0; i < N; i++) {
int a;
scanf("%d", &a);
cards.push_back(pair<int, int>(a, 1));
}
for (int i = 0; i < M; i++... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 852,914 | 852,913 | u316549668 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 852,929 | 852,930 | u358859892 | cpp |
p03038 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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 ALL(v) (v.begin(), v.end(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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 ALL(v) (v.begin(), v.end(... | [
"variable_declaration.type.change"
] | 852,941 | 852,942 | u459105164 | cpp |
p03038 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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 ALL(v) (v.begin(), v.end(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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 ALL(v) (v.begin(), v.end(... | [
"variable_declaration.type.change"
] | 852,941 | 852,943 | u459105164 | cpp |
p03038 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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 ALL(v) (v.begin(), v.end(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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 ALL(v) (v.begin(), v.end(... | [
"variable_declaration.type.change"
] | 852,941 | 852,944 | u459105164 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
map<int, ll> mp;
for (int i = 0; i < m; i++) {
int b, c;
cin >> b >> c;
mp[c] += b;
}
ll ans = 0;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
map<int, ll> mp;
for (int i = 0; i < m; i++) {
int b, c;
cin >> b >> c;
mp[c] += b;
}
ll ans = 0;
for (int i =... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 852,945 | 852,946 | u804999113 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef struct BC {
int B;
int C;
BC(int b_, int c_) {
B = b_;
C = c_;
}
bool operator<(const BC &other) const { return C < other.C; }
bool operator>(const BC &other) const { return C > other.C; }
} bc_t;
int main(void) {
int N, M;
cin >> N >> M... | #include <bits/stdc++.h>
using namespace std;
typedef struct BC {
int B;
int C;
BC(int b_, int c_) {
B = b_;
C = c_;
}
bool operator<(const BC &other) const { return C < other.C; }
bool operator>(const BC &other) const { return C > other.C; }
} bc_t;
int main(void) {
int N, M;
cin >> N >> M... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 852,949 | 852,950 | u018916376 | cpp |
p03038 | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#i... | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#i... | [
"call.function.change",
"call.arguments.change"
] | 852,956 | 852,957 | u926006934 | cpp |
p03038 | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#i... | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#i... | [
"call.function.change",
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 852,958 | 852,957 | u926006934 | cpp |
p03038 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
typedef vector<int> vec;
typedef vector<vec> mat;
bool f(P x... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
typedef vector<int> vec;
typedef vector<vec> mat;
bool f(P x... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 852,970 | 852,969 | u416773418 | cpp |
p03038 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
typedef vector<int> vec;
typedef vector<vec> mat;
bool f(P x... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
typedef vector<int> vec;
typedef vector<vec> mat;
bool f(P x... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 852,971 | 852,969 | u416773418 | cpp |
p03038 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"assignment.value.change"
] | 852,972 | 852,973 | u358055446 | cpp |
p03038 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
void solve() {
int n, m;
cin >> n >> m;
priority_queue<pair<int, int>> a;
rep(i, n) {
int x;
cin >> x;
a.push(make_pair(x, 1));
}
rep(i, m) {
int b, c;
cin >> b >> c;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
void solve() {
int n, m;
cin >> n >> m;
priority_queue<pair<int, int>> a;
rep(i, n) {
int x;
cin >> x;
a.push(make_pair(x, 1));
}
rep(i, m) {
int b, c;
cin >> b >> c;
... | [
"type_conversion.add"
] | 852,980 | 852,981 | u280175105 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int, vector<int>, greater<int>> que;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
que.push(a);
}
vector<pair<int, int>> v;
for (int i = 0; i < N; i++) {
int B, C;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int, vector<int>, greater<int>> que;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
que.push(a);
}
vector<pair<int, int>> v;
for (int i = 0; i < M; i++) {
int B, C;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 852,988 | 852,989 | u580402951 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
map<ll, ll> mp;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
mp[A]++;
}
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
mp[b] += a;
}
vector<pair<int, int>> p;
f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
map<ll, ll> mp;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
mp[A]++;
}
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
mp[b] += a;
}
vector<pair<ll, ll>> p;
for... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change",
"call.add",
"call.arguments.add"
] | 852,990 | 852,991 | u580402951 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long sum = 0;
vector<int> a(n);
vector<pair<int, int>> b(m);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
for (int i = 0; i < m; i++) {
cin >> b.at(i).second >> b.at(i).first;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long sum = 0;
vector<int> a(n);
vector<pair<int, int>> b(m);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
for (int i = 0; i < m; i++) {
cin >> b.at(i).second >> b.at(i).first;... | [
"expression.operation.binary.remove"
] | 853,003 | 853,004 | u770067864 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i, n) cin >> a.at(i);
vector<pair<ll, ll>> sousa;
rep(i, m) {
ll b, c;
cin >> b >> c;
sousa.p... | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i, n) cin >> a.at(i);
vector<pair<ll, ll>> sousa;
rep(i, m) {
ll b, c;
cin >> b >> c;
sousa.p... | [
"control_flow.loop.condition.change"
] | 853,019 | 853,020 | u748819456 | cpp |
p03038 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ull = long long unsigned;
using P = pair<int, int>;
const int INF = 1001001;
const int NMAX = 8;
int main() {
int n, m;
cin >> n >> m;
priority_queue<int, vector<int>, greater<int>> a;
rep(i... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ull = long long unsigned;
using P = pair<int, int>;
const int INF = 1001001;
const int NMAX = 8;
int main() {
int n, m;
cin >> n >> m;
priority_queue<ll, vector<ll>, greater<ll>> a;
rep(i, n... | [
"variable_declaration.type.change"
] | 853,025 | 853,026 | u289381123 | cpp |
p03038 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
priority_queue<P> q;
rep(i, n) {
cin >> a[i];
q.push(P(a[i], 1));
}
rep(i, m) {
int b, c;
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
priority_queue<P> q;
rep(i, n) {
cin >> a[i];
q.push(P(a[i], 1));
}
rep(i, m) {
int b, c;
c... | [
"variable_declaration.type.change"
] | 853,027 | 853,028 | u289381123 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
/*for(int i=0; i<n; i++){
cout << a.at(i) << endl;
}
cout << endl;*/
vector<tuple<int, int>> bc(m);
int b, c;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
/*for(int i=0; i<n; i++){
cout << a.at(i) << endl;
}
cout << endl;*/
vector<tuple<int, int>> bc(m);
int b, c;... | [
"control_flow.branch.if.condition.change"
] | 853,044 | 853,045 | u291332466 | cpp |
p03038 | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
ll total = 0;
vector<ll> a(n);
vector<P> p(n);
rep(i, n) {
cin >> a[i];
total += a[... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
ll total = 0;
vector<int> a(n);
vector<P> p(m);
rep(i, n) {
cin >> a[i];
total += a... | [
"variable_declaration.type.change"
] | 853,046 | 853,047 | u563170985 | cpp |
p03038 |
#include <bits/stdc++.h>
using namespace std;
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll lo... |
#include <bits/stdc++.h>
using namespace std;
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll lo... | [
"variable_declaration.type.change"
] | 853,055 | 853,056 | u572033996 | cpp |
p03038 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
// Acknowledgement: Special thanks to kyomukyomupurin, who developed this
// template.
template <class T, class U>
std::os... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
// Acknowledgement: Special thanks to kyomukyomupurin, who developed this
// template.
template <class T, class U>
std::os... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 853,062 | 853,063 | u721166818 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<ll> A(N), C(M);
vector<int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<ll> A(N), C(M);
vector<int... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 853,064 | 853,065 | u137747137 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<ll> A(N), C(M);
vector<int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<ll> A(N), C(M);
vector<int... | [] | 853,066 | 853,065 | u137747137 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | [
"assignment.value.change"
] | 853,075 | 853,076 | u722640678 | cpp |
p03038 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second > b.second;
} else {
return a.first > b.first;
}
}
int main() {
int N, M;
cin >> N... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second > b.second;
} else {
return a.first > b.first;
}
}
int main() {
int N, M;
cin >> N... | [
"variable_declaration.type.primitive.change"
] | 853,079 | 853,080 | u969116807 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
using int_greater_PQ = priority_queue<int, vector<int>, greater<int>>;
int main() {
int N, M;
cin >> N >> M;
int_greater_PQ A;
for (size_t i = 0; i < N; i++) {
int a;
cin... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
using int_greater_PQ = priority_queue<int, vector<int>, greater<int>>;
int main() {
int N, M;
cin >> N >> M;
int_greater_PQ A;
for (size_t i = 0; i < N; i++) {
int a;
cin... | [
"assignment.variable.change"
] | 853,090 | 853,091 | u272632379 | cpp |
p03038 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"variable_declaration.type.change"
] | 853,092 | 853,093 | u802045251 | cpp |
p03038 | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define f first
#define s second
#define pb push_back
#define pp push
#define RETURN exit(0)
#define pow(x, y) (int)(pow(x, y))
#define ceil... | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define f first
#define s second
#define pb push_back
#define pp push
#define RETURN exit(0)
#define pow(x, y) (int)(pow(x, y))
#define ceil... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 853,104 | 853,105 | u956319190 | cpp |
p03038 | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define f first
#define s second
#define pb push_back
#define pp push
#define RETURN exit(0)
#define pow(x, y) (int)(pow(x, y))
#define ceil... | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define f first
#define s second
#define pb push_back
#define pp push
#define RETURN exit(0)
#define pow(x, y) (int)(pow(x, y))
#define ceil... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 853,106 | 853,105 | u956319190 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<ll> A;
ll sum = 0;
for (int i = 0; i < N; i++) {
ll _in;
cin >> _in;
sum += _in;
A.push_back(_in);
}
sort(A.begin(), A.end());
// point, count
vector<pair<ll, ll>>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<ll> A;
ll sum = 0;
for (int i = 0; i < N; i++) {
ll _in;
cin >> _in;
sum += _in;
A.push_back(_in);
}
sort(A.begin(), A.end());
// point, count
vector<pair<ll, ll>>... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 853,109 | 853,110 | u303453927 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr ll mod = 998244353;
int main() {
int n, m;
cin >> n >> m;
map<ll, ll> mp;
rep(i, n) {
int a;
cin >> a;
mp[-a]++;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
constexpr ll mod = 998244353;
int main() {
int n, m;
cin >> n >> m;
map<ll, ll> mp;
rep(i, n) {
int a;
cin >> a;
mp[-a]++;
}
... | [
"call.arguments.change"
] | 853,142 | 853,143 | u108540384 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
typedef long long ll;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int dx[] = {0, 0, -1, 1};
int dy[... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
typedef long long ll;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int dx[] = {0, 0, -1, 1};
int dy[... | [
"assignment.add"
] | 853,144 | 853,145 | u277556971 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j;
int N, M;
cin >> N >> M;
vector<int> A(N);
vector<pair<int, int>> P(M);
for (i = 0; i < N; i++)
cin >> A[i];
//都合上，BとCを逆順に入力している
for (i = 0; i < M; i++)
cin >> P[i].second >> P[i].first;
/... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j;
int N, M;
cin >> N >> M;
vector<int> A(N);
vector<pair<int, int>> P(M + 1);
for (i = 0; i < N; i++)
cin >> A[i];
//都合上，BとCを逆順に入力している
for (i = 0; i < M; i++)
cin >> P[i].second >> P[i].first;
... | [
"assignment.change"
] | 853,151 | 853,152 | u537852947 | cpp |
p03038 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
bool my_compare(pair<ll, ll> a, pair<ll, ll> b) {
// 基本はfirstで比較
if (a.first != b.first) {
return a.first > b.first; // 降順
... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
bool my_compare(pair<ll, ll> a, pair<ll, ll> b) {
if (a.first != b.first) {
return a.first > b.first;
}
if (a.second != b.s... | [
"misc.opposites",
"function.return_value.change",
"variable_declaration.value.change"
] | 853,155 | 853,154 | u178536051 | cpp |
p03038 | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n)... | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n)... | [
"variable_declaration.type.change"
] | 853,163 | 853,164 | u840105874 | cpp |
p03038 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#incl... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#incl... | [
"variable_declaration.type.change"
] | 853,167 | 853,168 | u519950235 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m, cnt = 0;
scanf("%d %d", &n, &m);
vector<int> v(2 * n);
vector<pair<int, int>> p(m);
rep(i, n) scanf("%d", &v[i]);
rep(i, m) scanf("%d %d", &p[i].second, &p[i].first);
sort(p.begin(), p... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m, cnt = 0;
scanf("%d %d", &n, &m);
vector<int> v(2 * n);
vector<pair<int, int>> p(m);
rep(i, n) scanf("%d", &v[i]);
rep(i, m) scanf("%d %d", &p[i].second, &p[i].first);
sort(p.begin(), p... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 853,172 | 853,173 | u983711104 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
vector<ll> A(N);
rep(i, N) { cin >> A[i]; }
sort(A.begin(), A.end());
typedef pair<ll, ll> P;
vector<P> B... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
vector<ll> A(N);
rep(i, N) { cin >> A[i]; }
sort(A.begin(), A.end());
typedef pair<ll, ll> P;
vector<P> B... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 853,190 | 853,189 | u821284362 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, m, cnt = 0, tmp;
ll ans = 0;
pair<int, int> a[200000];
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, m, cnt = 0, tmp;
ll ans = 0;
pair<ll, ll> a[200000];
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].se... | [] | 853,193 | 853,194 | u831873811 | cpp |
p03038 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | [
"control_flow.branch.if.condition.change"
] | 853,197 | 853,198 | u031448582 | cpp |
p03038 | /**
* Title:
* Url:
*/
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int n, m;
cin >> n >> m;
ve... | /**
* Title:
* Url:
*/
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int n, m;
cin >> n >> m;
ve... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 853,201 | 853,202 | u036744414 | cpp |
p03038 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
// typedef pair<int, int> P;
typedef pair<ll, ll> P;
// const double INF = 1e10;
const ll INF = 1001001001;
#define mins(x, y) x = min(x, y)
#define maxs(x, y) ... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
// typedef pair<int, int> P;
typedef pair<ll, ll> P;
// const double INF = 1e10;
const ll INF = 1001001001;
#define mins(x, y) x = min(x, y)
#define maxs(x, y) ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 853,203 | 853,204 | u564182781 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
typedef long long ll;
typedef pair<int, int> P;
signed main() {
int n, m;
cin >> n >> m;
priority_queue<int> que;
rep(i, n) {
int a;
cin >> a;
que.push(-a);
}
vector<P> v;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
typedef long long ll;
typedef pair<int, int> P;
signed main() {
int n, m;
cin >> n >> m;
priority_queue<int> que;
rep(i, n) {
int a;
cin >> a;
que.push(-a);
}
vector<P> v;
... | [
"misc.opposites",
"variable_declaration.value.change"
] | 853,211 | 853,212 | u224590796 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#define LLI long long int
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#define LLI long long int
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A... | [
"variable_declaration.type.change"
] | 853,217 | 853,218 | u537874719 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> card(n + m);
for (int i = 0; i < n; i++) {
cin >> card.at(i).first;
card.at(i).second = 1;
}
for (int i = 0; i < m; i++) {
cin >> card.at(i + n).second >> card.at(i + n).first;
}
sort(... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, m;
cin >> n >> m;
vector<pair<long, long>> card(n + m);
for (int i = 0; i < n; i++) {
cin >> card.at(i).first;
card.at(i).second = 1;
}
for (int i = 0; i < m; i++) {
cin >> card.at(i + n).second >> card.at(i + n).first;
}
so... | [
"variable_declaration.type.primitive.change"
] | 853,223 | 853,224 | u820236331 | cpp |
p03038 | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
/*
1, 2, 3
2, 5
5, 2, 3 = 10
2, 5, 3 = 10
*/
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
REP(i, 0, N) cin >> A[i];
vector... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
/*
1, 2, 3
2, 5
5, 2, 3 = 10
2, 5, 3 = 10
*/
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
REP(i, 0, N) cin >> A[i];
vector... | [
"control_flow.branch.if.condition.change"
] | 853,229 | 853,230 | u483992368 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
//↓0-originか1-originでn回繰り返し
#define rep(i, n) for (int i = 0; i < ((in... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
//↓0-originか1-originでn回繰り返し
#define rep(i, n) for (int i = 0; i < ((in... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 853,235 | 853,236 | u457985479 | cpp |
p03038 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
using namespace std;
template <typename T> std::vector<size_t> argsort(T array) {
vector<size_t> indices(array.size());
std::iota(indices.begin(), indices.end(), 0); // range
std::sort(indices.begin(), indices.end(),
[&array](size_t i1, si... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
using namespace std;
template <typename T> std::vector<size_t> argsort(T array) {
vector<size_t> indices(array.size());
std::iota(indices.begin(), indices.end(), 0); // range
std::sort(indices.begin(), indices.end(),
[&array](size_t i1, si... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 853,239 | 853,240 | u794543767 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
v.push_back(make_pair(a, 1));
}
for (int i = 0; i < m; ++i) {
int b, c;
cin >> b >> c;
v.push_back(make_pair(c, b));
}
sor... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<long long, int>> v;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
v.push_back(make_pair(a, 1));
}
for (int i = 0; i < m; ++i) {
int b, c;
cin >> b >> c;
v.push_back(make_pair(c, b));
}... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,247 | 853,248 | u320241053 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
priority_queue<int, vector<int>> pq;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
pq.push(a);
}
priority_... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
priority_queue<int, vector<int>> pq;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
pq.push(a);
}
priority_... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,253 | 853,254 | u156778176 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a;
cin >> n >> m;
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a;
mp[a]++;
}
int b, c;
for (int i = 0; i < m; i++) {
cin >> b >> c;
mp[c] += b;
}
long long ans = 0, sum = 0;
for (map<int, int>::reverse_i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a;
cin >> n >> m;
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a;
mp[a]++;
}
int b, c;
for (int i = 0; i < m; i++) {
cin >> b >> c;
mp[c] += b;
}
long long ans = 0, sum = 0;
for (map<int, int>::reverse_i... | [
"assignment.value.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,255 | 853,256 | u142234618 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int s, t, a[100010], b[100010], c[100010];
cin >> s >> t;
for (int i = 0; i < s; i++)
cin >> a[i];
for (int i = 0; i < t; i++) {
cin >> b[i] >> c[i];
}
vector<pair<long long, long long>> p;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int s, t, a[100010], b[100010], c[100010];
cin >> s >> t;
for (int i = 0; i < s; i++)
cin >> a[i];
for (int i = 0; i < t; i++) {
cin >> b[i] >> c[i];
}
vector<pair<long long int, long long ... | [
"variable_declaration.type.widen.change"
] | 853,269 | 853,270 | u530329977 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n, m;
cin >> n >> m;
ll s = 0;
vector<pair<ll, ll>> p(m + n);
for (int i = 0; i < m + n; i++) {
if (i < n) {
ll a;
cin >> a;
p[i] = make_pair(a, 1);
} else {
ll b, c;
cin >> b >> c;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n, m;
cin >> n >> m;
ll s = 0;
vector<pair<ll, ll>> p(m + n);
for (int i = 0; i < m + n; i++) {
if (i < n) {
ll a;
cin >> a;
p[i] = make_pair(a, 1);
} else {
ll b, c;
cin >> b >> c;
... | [
"variable_declaration.type.change"
] | 853,284 | 853,285 | u588744968 | cpp |
p03038 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int N, M;
priority_queue<pair<int, int>> que;
int main() {
cin >> N >> M;
int A[N];
int B[M];
int C[M];
vector<in... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int N, M;
priority_queue<pair<int, int>> que;
int main() {
cin >> N >> M;
int A[N];
int B[M];
int C[M];
vector<in... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,290 | 853,291 | u298628832 | cpp |
p03038 | // in the name of god
// if you read this code please search about imam hussain
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back;
#define X first;
#define Y second;
#define pii pair<int, int>;
#define migmig \
i... | // in the name of god
// if you read this code please search about imam hussain
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back;
#define X first;
#define Y second;
#define pii pair<int, int>;
#define migmig \
i... | [
"variable_declaration.type.primitive.change"
] | 853,292 | 853,293 | u433132072 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a.begin(), a.end());
vector<pair<int, int>> v(m);
for (int i = 0; i < m; ++i) {
int b, c;
cin >> b >> c;
v[i] = {c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a.begin(), a.end());
vector<pair<int, ll>> v(m);
for (int i = 0; i < m; ++i) {
int b;
ll c;
cin >> b >> c;
v[i]... | [] | 853,300 | 853,301 | u402472923 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int, int> pii;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define all(x) (x).begin(), (x).end()
#define s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int, int> pii;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define all(x) (x).begin(), (x).end()
#define s... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 853,302 | 853,303 | u035566695 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
vector<P> p(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
for (int i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
vector<P> p(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
for (int i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.function.change"
] | 853,312 | 853,313 | u351265848 | cpp |
p03038 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
int i;
int main() {
int N, M;
cin >> N >> M;
vector<ll> A(N), B(M), C(M);
rep(i, N) cin >> A[i];
priority_queue<pair<int, int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
int i;
int main() {
int N, M;
cin >> N >> M;
vector<ll> A(N), B(M), C(M);
rep(i, N) cin >> A[i];
priority_queue<pair<int, int... | [
"variable_declaration.type.change"
] | 853,314 | 853,315 | u979078704 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll BIG = 1000000007;
struct pea {
int b;
int c;
}... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll BIG = 1000000007;
struct pea {
ll b;
ll c;
};
... | [
"variable_declaration.type.change"
] | 853,316 | 853,317 | u004411048 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
bool compare_by_second(pa... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
bool compare_by_second(pa... | [
"control_flow.loop.condition.change"
] | 853,321 | 853,322 | u397070717 | cpp |
p03038 | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test1 cout << "test1" << endl;
#define test2 cout << "test2" << endl;
#define fixprecision(n) \
fixed; \
cout << setprecision(n... | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test1 cout << "test1" << endl;
#define test2 cout << "test2" << endl;
#define fixprecision(n) \
fixed; \
cout << setprecision(n... | [
"assignment.value.change"
] | 853,333 | 853,334 | u936790121 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool compare_by_second(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second)
return a.second > b.second;
else
return a.first > b.first;
}
int main() {
int n, m;
cin >> n >> m;
vector<long long> a(n);
for (int ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool compare_by_second(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second)
return a.second > b.second;
else
return a.first > b.first;
}
int main() {
int n, m;
cin >> n >> m;
vector<long long> a(n);
for (int ... | [
"call.function.change",
"assignment.change"
] | 853,344 | 853,345 | u313043608 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool compare_by_second(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second)
return a.second > b.second;
else
return a.first > b.first;
}
int main() {
int n, m;
cin >> n >> m;
vector<long long> a(n);
for (int ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool compare_by_second(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second)
return a.second > b.second;
else
return a.first > b.first;
}
int main() {
int n, m;
cin >> n >> m;
vector<long long> a(n);
for (int ... | [
"assignment.change"
] | 853,346 | 853,345 | u313043608 | cpp |
p03038 | #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 853,351 | 853,352 | u561443723 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define lpsbd(i, s, b, d) for (size_t i = (s); i < (b); i += (d))
#define lpsb(i, s, b) for (size_t i = (s); i < (b); i++)
#define lpn(i, n) for (size_t i = 0; i < (n); i++)
#define fa(i, x) for (auto &i : x)
#define vcd(t, n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define lpsbd(i, s, b, d) for (size_t i = (s); i < (b); i += (d))
#define lpsb(i, s, b) for (size_t i = (s); i < (b); i++)
#define lpn(i, n) for (size_t i = 0; i < (n); i++)
#define fa(i, x) for (auto &i : x)
#define vcd(t, n... | [
"variable_declaration.type.change"
] | 853,353 | 853,354 | u330913290 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.