problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> Color(N);
for (int i = 0; i < N; i++) {
Color[i] = -1;
}
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
Color[c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> Color(N);
for (int i = 0; i < N; i++) {
Color[i] = -1;
}
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
Color[c... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,468 | 780,465 | u883982500 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y)... | [
"expression.operation.unary.add"
] | 780,473 | 780,474 | u987594251 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y)... | [
"expression.operation.unary.add",
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,475 | 780,474 | u987594251 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int... | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 780,476 | 780,477 | u973991908 | cpp |
p02973 | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int64_t rll() {
long long n;
scanf("%lld", &n);
return n;
}
struct SegTree {
std::vector<int> data;
int n;
SegTree(int n_) {
for (n = 1; n < n_; n *= 2)
;
data.resize(2 * n);
}
void set(int i, int val) {
fo... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int64_t rll() {
long long n;
scanf("%lld", &n);
return n;
}
struct SegTree {
std::vector<int> data;
int n;
SegTree(int n_) {
for (n = 1; n < n_; n *= 2)
;
data.resize(2 * n);
}
void set(int i, int val) {
fo... | [] | 780,478 | 780,479 | u040490988 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0,... | #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0,... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 780,484 | 780,485 | u022832318 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int n, a[200010], ans[200010], la;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n / 2; i++)
swap(a[i], a[n - i + 1]);
for (int i = 1; i <= n; i++) {
if (ans[la] <= a[i])
ans[++la] = a[i];
else {
... | #include <bits/stdc++.h>
using namespace std;
int n, a[200010], ans[200010], la;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n / 2; i++)
swap(a[i], a[n - i + 1]);
for (int i = 1; i <= n; i++) {
if (ans[la] <= a[i])
ans[++la] = a[i];
else {
... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,488 | 780,489 | u727652622 | cpp |
p02973 | #include <iostream>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
set<int> seta;
int res = 0;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
if (seta.empty()) {
seta.insert(A);
res++;
} else {
set<int>::iterator itr = seta.lower_bound(A);
if (itr ==... | #include <iostream>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
multiset<int> seta;
int res = 0;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
if (seta.empty()) {
seta.insert(A);
res++;
} else {
multiset<int>::iterator itr = seta.lower_bound(A);
... | [
"variable_declaration.type.change"
] | 780,490 | 780,491 | u755090102 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int arr[N], n, val[N];
multiset<int> myset;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
myset.insert(-arr[0]);
for (int i = 1; i < n; i++) {
int val = (*myset.rbegin());
if (-val >= arr[i])
myset.insert... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int arr[N], n, val[N];
multiset<int> myset;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
myset.insert(-arr[0]);
for (int i = 1; i < n; i++) {
int val = (*myset.rbegin());
if (-val >= arr[i])
myset.insert... | [
"call.function.change",
"call.arguments.change"
] | 780,506 | 780,507 | u221592478 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
int n;
function... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
int n;
function... | [
"expression.operation.binary.add"
] | 780,513 | 780,514 | u656572785 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
int n;
function... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
int n;
function... | [
"expression.operation.binary.add"
] | 780,515 | 780,514 | u656572785 | cpp |
p02973 | #include <algorithm>
#include <climits>
#include <cstdio>
int n;
int a[100005];
int d[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
d[i] = INT_MIN;
}
d[1] = a[1];
int ans = 1;
for (int i = 2; i <= n; i++) {
if (a[i] <= d[ans])
d[++ans] = a[i];
... | #include <algorithm>
#include <climits>
#include <cstdio>
int n;
int a[100005];
int d[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
d[i] = INT_MIN;
}
d[1] = a[1];
int ans = 1;
for (int i = 2; i <= n; i++) {
if (a[i] <= d[ans])
d[++ans] = a[i];
... | [
"variable_declaration.remove",
"variable_declaration.value.change"
] | 780,518 | 780,519 | u358689692 | cpp |
p02973 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
a.push_back(tmp);
}
vector<int> ans;
// ans.push_back(a[0]);
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
a.push_back(tmp);
}
vector<int> ans;
// ans.push_back(a[0]);
for (int i = 0; i < n; i++) {
... | [
"expression.operation.unary.add"
] | 780,522 | 780,523 | u269476572 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), l(n);
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
a[i] = -tmp;
}
l[0] = a[0];
int length = 1;
for (int i = 1; i < n; ++i) {
if (l[length - 1] <= a[i])
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), l(n);
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
a[i] = -tmp;
}
l[0] = a[0];
int length = 1;
for (int i = 1; i < n; ++i) {
if (l[length - 1] <= a[i])
... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,526 | 780,527 | u848359007 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), l(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
l[0] = a[0];
int length = 1;
for (int i = 1; i < n; ++i) {
if (l[length - 1] >= a[i])
l[length++] = a[i];
else
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), l(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
l[0] = a[0];
int length = 1;
for (int i = 1; i < n; ++i) {
if (l[length - 1] >= a[i])
l[length++] = a[i];
else
... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change"
] | 780,528 | 780,529 | u848359007 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
ll lis(vector<ll> a) {
int n = a.size();
const ll INF = 1e10;
vector<ll> d((n + 1), INF);
d[0] = -1 * INF;
for (int i = 0; i < n; i++) {
ll j = upper_bound(d.begin(), d.end(), a[i]) - d.begin();
if (d[j - 1] < a[i] && a[i] < d[j])
... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
ll lis(vector<ll> a) {
int n = a.size();
const ll INF = 1e10;
vector<ll> d((n + 1), INF);
d[0] = -1 * INF;
for (int i = 0; i < n; i++) {
ll j = upper_bound(d.begin(), d.end(), a[i]) - d.begin();
if (d[j - 1] <= a[i] && a[i] <= d[j])... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,530 | 780,531 | u673058289 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll... | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll... | [
"control_flow.branch.if.condition.change",
"call.function.change",
"assignment.variable.change",
"identifier.change",
"expression.operation.binary.change"
] | 780,538 | 780,539 | u336011173 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll... | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll... | [
"control_flow.branch.if.condition.change",
"call.function.change"
] | 780,540 | 780,539 | u336011173 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = lower_bound(L.begin(), L.begin() + length,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
// 広義単調減少部分列の長さ
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = upper_bound(L.begin(), L.b... | [
"identifier.change",
"call.function.change"
] | 780,543 | 780,544 | u634209474 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = lower_bound(L.begin(), L.begin() + length,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
// 広義最長減少部分列の長さ
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = upper_bound(L.begin(), L.b... | [
"identifier.change",
"call.function.change"
] | 780,543 | 780,545 | u634209474 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = lower_bound(L.begin(), L.end(), A[i]);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = upper_bound(L.begin(), L.begin() + length,... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 780,546 | 780,547 | u634209474 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = lower_bound(L.begin(), L.begin() + length,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A, L;
int solve() {
L[0] = A[0];
int length = 1;
for (int i = 1; i < N; i++) {
if (L[length - 1] <= A[i]) {
L[length] = A[i];
length++;
} else {
auto iter = upper_bound(L.begin(), L.begin() + length,... | [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 780,543 | 780,547 | u634209474 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//===
int bs(Vi &vec, int x) {
int left = 0, right = static_cast<int>(vec.size());
while (right - left > 1) {
int mid = (right + left) / 2;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//===
int bs(Vi &vec, int x) {
int left = -1, right = static_cast<int>(vec.size());
while (right - left > 1) {
int mid = (right + left) / 2... | [
"literal.number.change",
"variable_declaration.value.change"
] | 780,548 | 780,549 | u067237725 | cpp |
p02973 | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | [
"call.arguments.change"
] | 780,554 | 780,555 | u003873207 | cpp |
p02973 | #include <bits/stdc++.h>
#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pdd pair<double, double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#defi... | #include <bits/stdc++.h>
#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pdd pair<double, double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#defi... | [
"assignment.value.change"
] | 780,556 | 780,557 | u029888376 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long in... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long in... | [
"expression.operation.binary.add"
] | 780,560 | 780,561 | u463697306 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7;
string yn(bool f) { return f ? "Yes" : ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7;
string yn(bool f) { return f ? "Yes" : ... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,562 | 780,563 | u233393801 | cpp |
p02973 | #pragma region include
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = (int)(n); i < int(m); i++)
using namesp... | #pragma region include
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = (int)(n); i < int(m); i++)
using namesp... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.remove"
] | 780,568 | 780,569 | u165374901 | cpp |
p02973 | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0)... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
#define set multiset
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1,... | [] | 780,579 | 780,580 | u317754719 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()... | [
"call.function.change"
] | 780,581 | 780,582 | u281168735 | cpp |
p02973 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 99999999999999, inf = 199999;
const long long int mo... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 99999999999999, inf = 199999;
const long long int mo... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"expression.operation.unary.arithmetic.remove"
] | 780,583 | 780,584 | u018872912 | cpp |
p02973 | #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>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int solve(int n, vector<ll> a) {
set<ll> s;
rep(i, n) {
auto it = s.lower_bound(a[i]);
if (it != ... | #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>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int solve(int n, vector<ll> a) {
multiset<ll> s;
rep(i, n) {
auto it = s.lower_bound(a[i]);
if (i... | [
"variable_declaration.type.change"
] | 780,589 | 780,590 | u766280310 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
const int inf = 1001001001;
int main() {
int n;
cin >> n;
vint a(n);
rep(i, n) cin >> a[i];
deque<int> d;
rep(i, n) {
int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
const int inf = 1001001001;
int main() {
int n;
cin >> n;
vint a(n);
rep(i, n) cin >> a[i];
deque<int> d;
rep(i, n) {
int... | [
"assignment.change"
] | 780,591 | 780,592 | u697968316 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define all(x) (x).begin(), (x).end()
#define P pair<int, int>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
rep(i, n) {
int num;
cin >> num;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define all(x) (x).begin(), (x).end()
#define P pair<int, int>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
rep(i, n) {
int num;
cin >> num;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 780,595 | 780,596 | u437779154 | cpp |
p02973 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,601 | 780,602 | u385825353 | cpp |
p02973 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,603 | 780,602 | u385825353 | cpp |
p02973 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(... | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 780,604 | 780,602 | u385825353 | cpp |
p02973 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for (int i ... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for (int i ... | [
"call.add",
"call.arguments.change"
] | 780,609 | 780,610 | u626595726 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int m... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int m... | [
"assignment.change"
] | 780,611 | 780,612 | u521389909 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A(100001);
void solve() {
map<int, int> mp;
int ans = 1;
mp[A[1]] = 1;
for (int i = 2; i <= N; ++i) {
if (A[i] > mp.begin()->first) {
auto itr = mp.lower_bound(A[i]);
itr--;
itr->second--;
if (itr->second <= 0)
... | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A(100001);
void solve() {
map<int, int> mp;
int ans = 1;
mp[A[1]] = 1;
for (int i = 2; i <= N; ++i) {
if (A[i] > mp.begin()->first) {
auto itr = mp.lower_bound(A[i]);
itr--;
itr->second--;
if (itr->second <= 0)
... | [
"assignment.value.change"
] | 780,613 | 780,614 | u269291896 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define drep(i, n) for (int... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define drep(i, n) for (int... | [
"expression.operation.binary.remove",
"expression.unary.arithmetic.add"
] | 780,617 | 780,618 | u655777757 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> v;
int ans = 200000;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
auto j = upper_bou... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> v;
int ans = 200000;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
auto j = upper_bou... | [
"expression.operation.binary.remove"
] | 780,619 | 780,620 | u724012411 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | [
"call.arguments.change"
] | 780,621 | 780,622 | u063131621 | cpp |
p02973 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | [
"call.arguments.change"
] | 780,628 | 780,629 | u880221923 | cpp |
p02973 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool ch... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool ch... | [
"call.arguments.change"
] | 780,630 | 780,631 | u644332191 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
#define mod 1e9 + 7
vector<int> A, color(1, 0);
int binary(int key) {
int left = ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
#define mod 1e9 + 7
vector<int> A, color(1, 0);
int binary(int key) {
int left = ... | [
"call.arguments.change"
] | 780,636 | 780,637 | u174434198 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV... | [
"assignment.change"
] | 780,638 | 780,639 | u366381207 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define revrepeat(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revrep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define revrepeat(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revrep(i, n) ... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 780,659 | 780,658 | u765690804 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), ... | [
"variable_declaration.type.change"
] | 780,660 | 780,661 | u912359563 | cpp |
p02973 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 780,670 | 780,671 | u857644621 | cpp |
p02973 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) ... | #include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) ... | [] | 780,672 | 780,673 | u768152935 | cpp |
p02973 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) ... | #include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) ... | [
"assignment.change"
] | 780,674 | 780,675 | u768152935 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const double PI = 3.14159265358979323846;
const int waru = 1000000007;
const int INF = 2000000000;
#define vec2(a, y, x) vector<vector<int>> a(y... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const double PI = 3.14159265358979323846;
const int waru = 1000000007;
const int INF = 2000000000;
#define vec2(a, y, x) vector<vector<int>> a(y... | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,676 | 780,677 | u424602097 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#... | [
"call.arguments.change",
"call.function.change"
] | 780,678 | 780,679 | u035009844 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#... | [
"variable_declaration.type.change",
"call.function.change",
"call.arguments.change"
] | 780,680 | 780,679 | u035009844 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#... | [
"call.function.change",
"call.arguments.change"
] | 780,681 | 780,679 | u035009844 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long l... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 780,684 | 780,685 | u324825702 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5;
int arr[N + 100];
multiset<int> st;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
}
for (int i = 1; i <= n; i++) {
auto ... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5;
int arr[N + 100];
multiset<int> st;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
}
for (int i = 1; i <= n; i++) {
auto ... | [
"call.arguments.change"
] | 780,686 | 780,687 | u116018262 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [] | 780,690 | 780,691 | u347057617 | cpp |
p02973 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).end()
#define CERR ... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).end()
#define CERR ... | [
"expression.operation.binary.remove"
] | 780,692 | 780,693 | u145078501 | cpp |
p02973 | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
deque<int> d;
for (int i = 0; i < N; i++) {
int p = lower_bound(d.begin(), d.end(), A[i]) - d.begin();
if (p... | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
deque<int> d;
for (int i = 0; i < N; i++) {
int p = lower_bound(d.begin(), d.end(), A[i]) - d.begin();
if (p... | [
"call.function.change"
] | 780,696 | 780,697 | u188117876 | cpp |
p02973 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
template <typename F, typename S>
std::ostream &operator<<(ostream &os, const ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
template <typename F, typename S>
std::ostream &operator<<(ostream &os, const ... | [
"variable_declaration.type.change"
] | 780,698 | 780,699 | u176354582 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | [
"call.arguments.change"
] | 780,702 | 780,703 | u106297876 | cpp |
p02973 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin()... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin()... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"call.remove"
] | 780,708 | 780,709 | u524019694 | cpp |
p02973 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin()... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin()... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,710 | 780,709 | u524019694 | cpp |
p02973 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, end) for (int i = begin; i > end; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
const int... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, end) for (int i = begin; i > end; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
const int... | [
"variable_declaration.name.change",
"identifier.change",
"call.function.change",
"assignment.variable.change"
] | 780,715 | 780,716 | u372177994 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | [
"call.arguments.change"
] | 780,717 | 780,718 | u242679311 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 100000000000000000;
double PI = 3.1415926535;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<int>>;
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 100000000000000000;
double PI = 3.1415926535;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<int>>;
int main() {
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.variable.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 780,719 | 780,720 | u393754572 | cpp |
p02973 | #include <bits/stdc++.h>
#include <bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for (ll i = st; i < ed; i++)
#define repn(i, st, ed) for (ll i = st; i <= ed; i++)
#define repb(i, ed, st) for (ll i = ed; i >= st; i--)
#define all(v) v.be... | #include <bits/stdc++.h>
#include <bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for (ll i = st; i < ed; i++)
#define repn(i, st, ed) for (ll i = st; i <= ed; i++)
#define repb(i, ed, st) for (ll i = ed; i >= st; i--)
#define all(v) v.be... | [
"call.arguments.change"
] | 780,721 | 780,722 | u230147738 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
arr[i] = -arr[i];
}
vector<int> val(n + 1, 1e9 + 7);
val[0] = arr[0];
int mx = 1;
for (int i = 1; i < n; i++) {
auto lb = lower_bound(val.begin(),... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
arr[i] = -arr[i];
}
vector<int> val(n + 1, 1e9 + 7);
val[0] = arr[0];
int mx = 1;
for (int i = 1; i < n; i++) {
auto lb = upper_bound(val.begin(),... | [
"identifier.change",
"call.function.change"
] | 780,729 | 780,730 | u024496314 | cpp |
p02973 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long A[100000];
long long bins[10... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long A[100000];
long long bins[10... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 780,731 | 780,732 | u623349537 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
/*
vector.push_back()
vector<int> hoge(3,-1); {-1,-1,-1}
vector<vector<int>> hogehoge(2,vector<int>(2,-1)); {{-1,-1},{-1,-1}}
cin >>temp;
scanf("%d %d %d",&A,&B,&Q);
sort(a.begin(),a.end());
a.push_back(4000000000000);
a.insert(a.begin(),-1000000000000);
upper_bound(a.begi... | #include <bits/stdc++.h>
using namespace std;
/*
vector.push_back()
vector<int> hoge(3,-1); {-1,-1,-1}
vector<vector<int>> hogehoge(2,vector<int>(2,-1)); {{-1,-1},{-1,-1}}
cin >>temp;
scanf("%d %d %d",&A,&B,&Q);
sort(a.begin(),a.end());
a.push_back(4000000000000);
a.insert(a.begin(),-1000000000000);
upper_bound(a.begi... | [
"call.remove"
] | 780,737 | 780,738 | u231685196 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b;
for (int i = 0; i < n; i++) {
... | [] | 780,741 | 780,742 | u637771514 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b;
for (int i = 0; i < n; i++) {
... | [] | 780,743 | 780,742 | u637771514 | cpp |
p02973 | // finish date: 2019/07/20
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vecto... | // finish date: 2019/07/20
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vecto... | [] | 780,744 | 780,745 | u285660186 | cpp |
p02973 | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespa... | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespa... | [
"variable_declaration.type.change"
] | 780,752 | 780,753 | u751730221 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change"
] | 780,754 | 780,755 | u058297300 | cpp |
p02973 | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
vector<int> color_max;
int ... | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
vector<int> color_max;
int ... | [
"identifier.change",
"call.function.change",
"assignment.change"
] | 780,756 | 780,757 | u545206239 | cpp |
p02973 | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
vector<int> color_max;
int ... | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
vector<int> color_max;
int ... | [
"identifier.change",
"call.function.change"
] | 780,758 | 780,757 | u545206239 | cpp |
p02973 | /*==============================================*\
ID: shahidul_brur
Name: Md. Shahidul Islam
Study: CSE, BRUR
Address: Rangpur, Bangladesh
mail: shahidul.cse.brur@gmail.com
FB : fb.com/shahidul.brur
Blog: shahidul-brur.blogspot.com(in Bengali),
shahidul-brur-en.blogspot.com(in English)
... | /*==============================================*\
ID: shahidul_brur
Name: Md. Shahidul Islam
Study: CSE, BRUR
Address: Rangpur, Bangladesh
mail: shahidul.cse.brur@gmail.com
FB : fb.com/shahidul.brur
Blog: shahidul-brur.blogspot.com(in Bengali),
shahidul-brur-en.blogspot.com(in English)
... | [
"identifier.change",
"call.arguments.change"
] | 780,763 | 780,764 | u094186324 | cpp |
p02973 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
constexpr ll mod = 1000000007;
v... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
constexpr ll mod = 1000000007;
v... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 780,769 | 780,770 | u752288070 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define SORT(v, n) sort(v, v + n)
#define rep(i, n) FOR(i, 0, n)
#define EPS (1e-7)
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define SORT(v, n) sort(v, v + n)
#define rep(i, n) FOR(i, 0, n)
#define EPS (1e-7)
#de... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,774 | 780,775 | u097408484 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int n, a[100010];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> b;
b.push_back(a[0]);
for (int i = 1; i < n; i++) {
if (a[i] <= *b.begin()) {
b.insert(b.begin(), a[i]);
} else {
*(upper_bound(b.begin(), b.end... | #include <bits/stdc++.h>
using namespace std;
int n, a[100010];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> b;
b.push_back(a[0]);
for (int i = 1; i < n; i++) {
if (a[i] <= *b.begin()) {
b.insert(b.begin(), a[i]);
} else {
*(lower_bound(b.begin(), b.end... | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,787 | 780,788 | u576357314 | cpp |
p02973 | #include "bits/stdc++.h"
#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##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_overload3(__VA_ARGS__,... | #include "bits/stdc++.h"
#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##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_overload3(__VA_ARGS__,... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.add"
] | 780,789 | 780,790 | u751488284 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define in... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define in... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,791 | 780,792 | u268571052 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a;
cin >> n;
vector<int> vec(200000, 0);
auto ibegin = vec.end();
for (int i = 0; i < n; i++) {
cin >> a;
auto itr = lower_bound(ibegin, vec.end(), a);
if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a;
cin >> n;
vector<int> vec(200000, 0);
auto ibegin = vec.end();
for (int i = 0; i < n; i++) {
cin >> a;
auto itr = lower_bound(ibegin, vec.end(), a);
// ... | [
"expression.unary.arithmetic.add"
] | 780,793 | 780,794 | u905270643 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define initdp(a, b) \
for (int i = 0; i <= a; i++) ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define initdp(a, b) \
for (int i = 0; i <= a; i++) ... | [
"assignment.value.change",
"identifier.change"
] | 780,797 | 780,798 | u133630059 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> a(N);
copy_n(istream_iterator<unsigned long>(cin), N, a.begin());
vector<vector<unsigned long>> factor(N + 1);
for (unsigned long i = 1; i < N; ++i)
for (unsigned long j = 2 * i; j < N; j += i... | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> a(N);
copy_n(istream_iterator<unsigned long>(cin), N, a.begin());
vector<vector<unsigned long>> factor(N + 1);
for (unsigned long i = 1; i <= N; ++i)
for (unsigned long j = 2 * i; j <= N; j +=... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 780,799 | 780,800 | u462437857 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> a(N);
copy_n(istream_iterator<unsigned long>(cin), N, a.begin());
vector<vector<unsigned long>> factor(N + 1);
for (unsigned long i = 1; i < N; ++i)
for (unsigned long j = i; j < N; j += i)
... | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> a(N);
copy_n(istream_iterator<unsigned long>(cin), N, a.begin());
vector<vector<unsigned long>> factor(N + 1);
for (unsigned long i = 1; i <= N; ++i)
for (unsigned long j = 2 * i; j <= N; j +=... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 780,801 | 780,800 | u462437857 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | [
"assignment.value.change",
"identifier.change"
] | 780,804 | 780,805 | u462560753 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
V<> a(n);
for (auto &&e : a)
cin >> e;
a.insert(begin(a), -1);
... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
V<> a(n);
for (auto &&e : a)
cin >> e;
a.insert(begin(a), -1);
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 780,806 | 780,807 | u536580583 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | [
"assignment.value.change",
"identifier.change"
] | 780,808 | 780,809 | u899635344 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i ... | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 780,810 | 780,811 | u434231045 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i ... | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i ... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 780,812 | 780,811 | u434231045 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | [
"expression.operation.binary.remove"
] | 780,819 | 780,820 | u016572066 | cpp |
p02973 | #include <bits/stdc++.h>
// g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 // 10^9+7
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
map<ll, ll> M;
rep(i, N) {
map<ll, ll>::iterator it = M.lo... | #include <bits/stdc++.h>
// g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 // 10^9+7
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
map<ll, ll> M;
rep(i, N) {
map<ll, ll>::iterator it = M.lo... | [
"control_flow.branch.if.condition.change"
] | 780,829 | 780,830 | u805616568 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI = acos(-1);
int main() {
int N;
cin >> N;
vector<int> A;
rep(i, N) {
int a;
cin >> a;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI = acos(-1);
int main() {
int N;
cin >> N;
vector<int> A;
rep(i, N) {
int a;
cin >> a;
... | [
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 780,838 | 780,839 | u663191260 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI = acos(-1);
int main() {
int N;
cin >> N;
vector<int> A;
rep(i, N) {
int a;
cin >> a;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI = acos(-1);
int main() {
int N;
cin >> N;
deque<int> A;
rep(i, N) {
int a;
cin >> a;
... | [
"variable_declaration.type.change",
"call.function.change"
] | 780,840 | 780,841 | u663191260 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
c... | [
"variable_declaration.type.change",
"call.function.change",
"assignment.variable.change",
"identifier.change"
] | 780,851 | 780,852 | u280175105 | cpp |
p02973 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
const int N = 100001;
int f[N];
int f1[N];
int d[N];
int n, ans, ans1;
int main() {
scanf("%d", &n);
for (int i = n; i >= 1; i--)
scanf("%d", &d[i]);
int len = 1, len1 = 1;
f[1] = f1[1] = d[1];
for (int i = ... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
const int N = 100001;
int f[N];
int f1[N];
int d[N];
int n, ans, ans1;
int main() {
scanf("%d", &n);
for (int i = n; i >= 1; i--)
scanf("%d", &d[i]);
int len = 1, len1 = 1;
f[1] = f1[1] = d[1];
for (int i = ... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 780,856 | 780,857 | u863370423 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.