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 <algorithm>
#include <iostream>
#include <iterator>
#include <limits>
#include <vector>
using namespace std;
using ll = long long;
ll solve(vector<ll> &va, vector<ll> &memo) {
for (int i = 0; i < va.size(); ++i) {
*lower_bound(memo.begin(), memo.end(), va[i]) = va[i];
}
auto r_it = lower_bound(me... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <limits>
#include <vector>
using namespace std;
using ll = long long;
ll solve(vector<ll> &va, vector<ll> &memo) {
for (int i = 0; i < va.size(); ++i) {
*upper_bound(memo.begin(), memo.end(), va[i]) = va[i];
}
auto r_it = lower_bound(me... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 781,262 | 781,263 | u289545075 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
deque<ll> q;
for (int i = 0; i < N; i++) {
ll tmp;
cin >> tmp;
auto itr = lower_bound(q.begin(), q.end(), tmp)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
deque<ll> q;
for (int i = 0; i < N; i++) {
ll tmp;
cin >> tmp;
auto itr = lower_bound(q.begin(), q.end(), tmp)... | [
"call.arguments.change",
"call.arguments.add"
] | 781,264 | 781,265 | u190875453 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
deque<int> q;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
auto itr = lower_bound(q.begin(), q.end(), tm... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
deque<ll> q;
for (int i = 0; i < N; i++) {
ll tmp;
cin >> tmp;
auto itr = lower_bound(q.begin(), q.end(), tmp)... | [
"variable_declaration.type.change",
"call.arguments.change",
"call.arguments.add"
] | 781,266 | 781,265 | u190875453 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
multiset<int> act;
int t;
for (int i = 0; i < N; i++) {
cin >> t;
if (!act.size() || *act.begin() >= t)
act.insert(t);
else {
auto p = act.upper_bound(t);
p--;
act.erase(p);
act.insert(t);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
multiset<int> act;
int t;
for (int i = 0; i < N; i++) {
cin >> t;
if (!act.size() || *act.begin() >= t)
act.insert(t);
else {
auto p = act.lower_bound(t);
p--;
act.erase(p);
act.insert(t);
... | [
"call.function.change"
] | 781,267 | 781,268 | u015490689 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef... | [
"call.arguments.change"
] | 781,269 | 781,270 | u595084562 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
int main() {
int N;
cin >> N;
multiset<long long> s;
long long a;
rep(i, N) {
cin >> a;
s.insert(a);
set<long long>::iterator ite;
;
ite = s.find(a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
int main() {
int N;
cin >> N;
multiset<long long> s;
long long a;
rep(i, N) {
cin >> a;
s.insert(a);
multiset<long long>::iterator ite;
;
ite = s.f... | [
"call.arguments.change"
] | 781,271 | 781,272 | u879436400 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
int main() {
int N;
cin >> N;
multiset<long long> s;
long long a;
rep(i, N) {
cin >> a;
s.insert(a);
multiset<long long>::iterator ite;
;
ite = s.f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
int main() {
int N;
cin >> N;
multiset<long long> s;
long long a;
rep(i, N) {
cin >> a;
s.insert(a);
multiset<long long>::iterator ite;
;
ite = s.f... | [
"call.arguments.change"
] | 781,273 | 781,272 | u879436400 | cpp |
p02973 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) ... | [
"variable_declaration.type.change"
] | 781,274 | 781,275 | u102602414 | cpp |
p02973 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) ... | [
"call.function.change"
] | 781,276 | 781,275 | u102602414 | cpp |
p02973 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) ... | [
"call.function.change"
] | 781,276 | 781,277 | u102602414 | cpp |
p02973 | #include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | #include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"assignment.variable.change"
] | 781,278 | 781,279 | u261965335 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> b;
b.push_back(a[N - 1]);
for (int i = 1; i < N; i++) {
if (a[N - 1 - i] >= b[b.size() - 1])
b.push_back(a[N - 1 - i]);
else {
auto c = lo... | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> b;
b.push_back(a[N - 1]);
for (int i = 1; i < N; i++) {
if (a[N - 1 - i] >= b[b.size() - 1])
b.push_back(a[N - 1 - i]);
else {
auto c = up... | [
"identifier.change",
"call.function.change"
] | 781,280 | 781,281 | u315542000 | cpp |
p02973 | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typena... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typena... | [
"identifier.change",
"call.function.change",
"call.add"
] | 781,282 | 781,283 | u432688695 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[100005];
int main() {
cin.tie(0);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[100005];
int main() {
cin.tie(0);
... | [] | 781,286 | 781,287 | u340980616 | cpp |
p02973 | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(... | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 781,288 | 781,289 | u184929210 | cpp |
p02973 | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(... | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 781,290 | 781,291 | u184929210 | cpp |
p02973 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, s, e) for (ll i = s; i >= e; i--)
#defi... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, s, e) for (ll i = s; i >= e; i--)
#defi... | [
"assignment.change"
] | 781,292 | 781,293 | u026620445 | cpp |
p02973 | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <util... | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <util... | [
"call.arguments.change"
] | 781,294 | 781,295 | u426683236 | cpp |
p02973 | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <util... | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <util... | [
"call.function.change",
"call.arguments.change"
] | 781,296 | 781,295 | u426683236 | cpp |
p02973 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#endif
#include <algorithm>
#include <array>
#include <bitset>
#include <casser... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#endif
#include <algorithm>
#include <array>
#include <bitset>
#include <casser... | [
"variable_declaration.type.change"
] | 781,301 | 781,302 | u859396346 | cpp |
p02973 | // In The Name of Allah
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int inf = 1e9 + 10;
int a[N], dp[N];
bool isVal(int x, int y) { return (y <= dp[x]); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin ... | // In The Name of Allah
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int inf = 1e9 + 10;
int a[N], dp[N];
bool isVal(int x, int y) { return (y <= dp[x]); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 781,303 | 781,304 | u091252319 | cpp |
p02973 | // In The Name of Allah
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int inf = 1e9 + 10;
int a[N], dp[N];
bool isVal(int x, int y) { return (y < dp[x]); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >... | // In The Name of Allah
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int inf = 1e9 + 10;
int a[N], dp[N];
bool isVal(int x, int y) { return (y <= dp[x]); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin ... | [
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change"
] | 781,305 | 781,304 | u091252319 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
multiset<int> bst;
int a;
cin >> a;
bst.insert(a);
for (int i = 1; i < n; i++) {
cin >> a;
auto ptr = bst.lower_bound(a);
if (ptr == bst.begin()) {
bst.insert(a);
} else {
ptr--;
bst.erase(*... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
multiset<int> bst;
int a;
cin >> a;
bst.insert(a);
for (int i = 1; i < n; i++) {
cin >> a;
auto ptr = bst.lower_bound(a);
if (ptr == bst.begin()) {
bst.insert(a);
} else {
ptr--;
bst.erase(p... | [
"call.arguments.change"
] | 781,306 | 781,307 | u388927326 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
multiset<ll> st;
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++) {
auto itr = st.lower_bound(a[i]);
if (st.begin() != itr) {
itr--;
st.erase(*itr);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
multiset<ll> st;
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++) {
auto itr = st.lower_bound(a[i]);
if (st.begin() != itr) {
itr--;
st.erase(itr);
... | [
"call.arguments.change"
] | 781,320 | 781,321 | u855186748 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
multiset<ll> st;
for (ll i = 0; i < n; i++) {
cin >> a[i];
a[i] *= -1;
}
for (ll i = 0; i < n; i++) {
auto itr = st.upper_bound(a[i]);
if (st.end() != itr) {
st.erase(*i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
multiset<ll> st;
for (ll i = 0; i < n; i++) {
cin >> a[i];
a[i] *= -1;
}
for (ll i = 0; i < n; i++) {
auto itr = st.upper_bound(a[i]);
if (st.end() != itr) {
st.erase(it... | [
"call.arguments.change"
] | 781,322 | 781,323 | u855186748 | cpp |
p02973 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mind(a, b) (a > b ? b : a)
#define ma... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mind(a, b) (a > b ? b : a)
#define ma... | [
"call.arguments.change"
] | 781,324 | 781,325 | u226155577 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define re register
#define ll long long
inline int gi() {
int f = 1, sum = 0;
char ch = getchar();
while (ch > '9' || ch < '0')... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define re register
#define ll long long
inline int gi() {
int f = 1, sum = 0;
char ch = getchar();
while (ch > '9' || ch < '0')... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 781,326 | 781,327 | u043445068 | cpp |
p02973 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
... | [
"variable_declaration.remove",
"call.arguments.change"
] | 781,328 | 781,329 | u334624175 | cpp |
p02973 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair
int N, A[100000];
vector<int> dp;
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
reverse(A, A + N);
dp.resize(N);
for (int i = 0; i < N; i++)
dp[i] = INT_MAX;
for (int i = 0... | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair
int N, A[100000];
vector<int> dp;
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
reverse(A, A + N);
dp.resize(N);
for (int i = 0; i < N; i++)
dp[i] = INT_MAX;
for (int i = 0... | [
"assignment.change"
] | 781,332 | 781,333 | u422592877 | cpp |
p02973 | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int n;
int cnt = 0;
deque<int> q;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
auto it = lower_bound(q.begin(), q.end(), a);
if (it == q.begin()) {
q.push_front(a);
} else {
q[i... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int n;
int cnt = 0;
deque<int> q;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
auto it = lower_bound(q.begin(), q.end(), a);
if (it == q.begin()) {
q.push_front(a);
} else {
q[i... | [
"assignment.change"
] | 781,338 | 781,339 | u585670083 | cpp |
p02973 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 100001;
int main() {
int N;
int A[MAX];
deque<int> color;
cin >> N;
for (... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 100001;
int main() {
int N;
int A[MAX];
deque<int> color;
cin >> N;
for (... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 781,340 | 781,341 | u105959367 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define N 100010
int a[N], dp[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
dp[1] = a[1];
int len = 1;
for (int i = 2; i <= n; i++) {
if (dp[len] >= a[i])
dp[++len] = a[i];
else {
int p, l = 1, ... | #include <bits/stdc++.h>
using namespace std;
#define N 100010
int a[N], dp[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
dp[1] = a[1];
int len = 1;
for (int i = 2; i <= n; i++) {
if (dp[len] >= a[i])
dp[++len] = a[i];
else {
int p, l = 1, ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 781,342 | 781,343 | u820628270 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int a[maxn];
int dp[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n / 2; i++)
swap(a[i], a[n - i + 1]);
dp[1] = a[1];
int k = 1;
for (int i = 2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int a[maxn];
int dp[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n / 2; i++)
swap(a[i], a[n - i + 1]);
dp[1] = a[1];
int k = 1;
for (int i = 2... | [
"expression.operation.binary.remove"
] | 781,346 | 781,347 | u914135866 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int a[maxn];
int dp[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n / 2; i++)
swap(a[i], a[n - i + 1]);
dp[1] = a[1];
int k = 1;
for (int i = 2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int a[maxn];
int dp[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n / 2; i++)
swap(a[i], a[n - i + 1]);
dp[1] = a[1];
int k = 1;
for (int i = 2... | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 781,346 | 781,348 | u914135866 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
us... | [
"import.add",
"call.arguments.change"
] | 781,353 | 781,354 | u608258653 | cpp |
p02973 | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1ll << 62;
int main() {
int n;
cin >> n;
multiset<int> s;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
auto it = s.lowe... | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1ll << 62;
int main() {
int n;
cin >> n;
multiset<int> s;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
auto it = s.lowe... | [
"call.arguments.change"
] | 781,360 | 781,361 | u699193595 | cpp |
p02973 | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1ll << 62;
int main() {
int n;
cin >> n;
set<int> s;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
auto it = s.lower_bou... | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1ll << 62;
int main() {
int n;
cin >> n;
multiset<int> s;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
auto it = s.lowe... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 781,362 | 781,361 | u699193595 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 781,363 | 781,364 | u316170293 | cpp |
p02973 | #include <bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define pii pair<int, int>
#define REP(i, a) for (int(i) = 0; (i) < (a); (i)++)
#define RREP(i, a) for (int(i) = a - 1; (i) >= (0); (i)--)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define MOD 10000... | #include <bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define pii pair<int, int>
#define REP(i, a) for (int(i) = 0; (i) < (a); (i)++)
#define RREP(i, a) for (int(i) = a - 1; (i) >= (0); (i)--)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define MOD 10000... | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 781,369 | 781,370 | u026483463 | cpp |
p02973 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | [
"variable_declaration.add",
"call.arguments.change"
] | 781,388 | 781,389 | u017271745 | cpp |
p02973 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | [
"call.arguments.change"
] | 781,388 | 781,390 | u017271745 | cpp |
p02973 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#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> col... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#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> col... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 781,391 | 781,392 | u115306811 | cpp |
p02973 | #include <algorithm>
#include <deque>
#include <iostream>
using namespace std;
int main() {
long N;
cin >> N;
deque<long> LDS;
for (size_t n = 0; n < N; ++n) {
long A;
cin >> A;
auto it = lower_bound(LDS.begin(), LDS.end(), A);
if (it == LDS.begin())
LDS.push_front(A);
else
*i... | #include <algorithm>
#include <deque>
#include <iostream>
using namespace std;
int main() {
long N;
cin >> N;
deque<long> LDS;
for (size_t n = 0; n < N; ++n) {
long A;
cin >> A;
auto it = lower_bound(LDS.begin(), LDS.end(), A);
if (it == LDS.begin())
LDS.push_front(A);
else
*(... | [] | 781,393 | 781,394 | u762603420 | cpp |
p02973 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typ... | [
"assignment.change"
] | 781,395 | 781,396 | u723550619 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | [
"identifier.change",
"call.function.change"
] | 781,397 | 781,398 | u330661451 | cpp |
p02973 | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
int n;
cin >> n;
vector<LL> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
reverse(a.begin(), a.end());
vector<LL> dp(n, 1e9);
dp[0] = a[0];
LL length = 1;
for (int i = 1; i < n; i++) {
if (dp[length - 1] <= a[i... | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
int n;
cin >> n;
vector<LL> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
reverse(a.begin(), a.end());
vector<LL> dp(n, 1e9);
dp[0] = a[0];
LL length = 1;
for (int i = 1; i < n; i++) {
if (dp[length - 1] <= a[i... | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 781,399 | 781,400 | u392423112 | cpp |
p02973 | // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> a... | // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> a... | [] | 781,403 | 781,404 | u692176965 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 781,407 | 781,408 | u069450081 | cpp |
p02973 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 781,412 | 781,413 | u017293723 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; \... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; \... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 781,416 | 781,417 | u993688697 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; \... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; \... | [
"variable_declaration.type.change"
] | 781,418 | 781,417 | u993688697 | cpp |
p02973 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
#define ITR(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
using namespace std;
usi... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
#define ITR(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
using namespace std;
usi... | [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 781,421 | 781,422 | u203033720 | cpp |
p02973 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
#define fin \
{ ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
#define fin \
{ ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 781,429 | 781,430 | u942774736 | cpp |
p02973 | #include <algorithm>
#include <bits/stdc++.h>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
int A[100010] = {};
for (int i = 0; i < N; i++)
cin >> A[i];
multiset<int> S;
S.insert(-1145141919);
S.insert(1145141919);
S.insert(A[0]);
for (int i = 1; i < N; i++) {
auto it = S.l... | #include <algorithm>
#include <bits/stdc++.h>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
int A[100010] = {};
for (int i = 0; i < N; i++)
cin >> A[i];
multiset<int> S;
S.insert(-1145141919);
S.insert(1145141919);
S.insert(A[0]);
for (int i = 1; i < N; i++) {
auto it = S.l... | [
"call.arguments.change"
] | 781,431 | 781,432 | u465638326 | cpp |
p02973 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
vector<int> V(N), dp(N, -1);
rep(i, 0, N) cin >> V[i];
rep(i, 0, N) {
auto itr = upper_bound(dp.rbegin(), d... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
vector<int> V(N), dp(N, -1);
rep(i, 0, N) cin >> V[i];
rep(i, 0, N) {
auto itr = lower_bound(dp.rbegin(), d... | [
"identifier.change",
"call.function.change"
] | 781,433 | 781,434 | u157322125 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
auto low = lower_bound(v.begin(), v.end(), A);
if (low == v.begin()) {
v.push_back(A);
} else {
low--;
*low = A;
}
}
cout << v.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
auto low = lower_bound(v.rbegin(), v.rend(), A);
if (low == v.rbegin()) {
v.push_back(A);
} else {
low--;
*low = A;
}
}
cout <<... | [
"call.function.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 781,435 | 781,436 | u904833081 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
const int N = 300030;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
const int N = 300030;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 781,437 | 781,438 | u278557567 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
for (int i = 0; i < n; i++) {
cin >> a[n];
}
vector<long long int> b(2);
b.at(0) = 1000000001;
b.at(1) = a[0] - 1;
int x;
for (int i = 0; i < n; i++) {
x = b.size();
if (b.at(x - 1) >= a[i])... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long int> b(2);
b.at(0) = 1000000001;
b.at(1) = a[0] - 1;
int x;
for (int i = 0; i < n; i++) {
x = b.size();
if (b.at(x - 1) >= a[i])... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 781,445 | 781,446 | u704064492 | cpp |
p02973 | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++)
cin >> A[i];
map<int, int> m;
int ans = 0;
for (int i = 1; i <= N; i++) {
if (m.empty()) {
m[-A[i]]++;
ans++;
... | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++)
cin >> A[i];
map<int, int> m;
int ans = 0;
for (int i = 1; i <= N; i++) {
if (m.empty()) {
m[-A[i]]++;
ans++;
... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 781,458 | 781,459 | u623954643 | cpp |
p02973 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (auto &x : a)
x = -x;
set<int> dp;
for (int i = 0; i < n; ++i) {
auto it = dp.upper_bound(a[i]);
if (it == dp.end())
dp... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (auto &x : a)
x = -x;
multiset<int> dp;
for (int i = 0; i < n; ++i) {
auto it = dp.upper_bound(a[i]);
if (it == dp.end())
... | [
"variable_declaration.type.change"
] | 781,460 | 781,461 | u698760125 | cpp |
p02973 | #include <algorithm>
#include <bitset>
//#include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <t... | #include <algorithm>
#include <bitset>
//#include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <t... | [
"identifier.change",
"call.function.change"
] | 781,462 | 781,463 | u373586461 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
// ๅคๆฐใใณใๅ
ใcoutใcerr
#define DUMPOUT cerr
// ๆๅบๆใฏใณใกใณใใขใฆใ
#define DEBUG_
// #define int long long // intใงๆธใใใใฉๅฟ้
ใชใจใใซlong longใซๅคๆใใ
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* cpp template {{{ */
/* short */
#define pb pus... | #include <bits/stdc++.h>
using namespace std;
// ๅคๆฐใใณใๅ
ใcoutใcerr
#define DUMPOUT cerr
// ๆๅบๆใฏใณใกใณใใขใฆใ
#define DEBUG_
// #define int long long // intใงๆธใใใใฉๅฟ้
ใชใจใใซlong longใซๅคๆใใ
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* cpp template {{{ */
/* short */
#define pb pus... | [] | 781,464 | 781,465 | u545411641 | cpp |
p02973 | /*
ใชใผใใผ
10**6 ไฝ่ฃใๆใฃใฆ้ใซๅใ
10**7 ใใใใ้ใซๅใ ไฝ่ฃใๆใฃใฆ้ใซๅใ
10**8 ้ๅธธใซใทใณใใซใชๅฆ็ใงใชใ้ใๅณใใ ใใใใ้ใซๅใ
10**9 ้ๅธธใซใทใณใใซใชๅฆ็ใงใชใ้ใๅณใใ
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// ๅๆกใฎๅใ่จ็ฎใใ้ขๆฐ
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n ใ 0 ใซใชใใพใง
sum += n % 10;
n /= 10;
}
return s... | /*
ใชใผใใผ
10**6 ไฝ่ฃใๆใฃใฆ้ใซๅใ
10**7 ใใใใ้ใซๅใ ไฝ่ฃใๆใฃใฆ้ใซๅใ
10**8 ้ๅธธใซใทใณใใซใชๅฆ็ใงใชใ้ใๅณใใ ใใใใ้ใซๅใ
10**9 ้ๅธธใซใทใณใใซใชๅฆ็ใงใชใ้ใๅณใใ
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// ๅๆกใฎๅใ่จ็ฎใใ้ขๆฐ
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n ใ 0 ใซใชใใพใง
sum += n % 10;
n /= 10;
}
return s... | [
"assignment.change"
] | 781,468 | 781,469 | u757738907 | cpp |
p02973 | #include <cstdio>
#include <set>
using namespace std;
#define lb lower_bound
int N, ans;
set<int> s;
int main() {
scanf("%d", &N);
for (int i = 0, A; i < N; i++) {
scanf("%d", &A);
set<int>::iterator it = s.lb(A);
if (it == s.begin())
ans++;
else
it--, s.erase(it);
s.insert(A);
}
... | #include <cstdio>
#include <set>
using namespace std;
#define lb lower_bound
int N, ans;
multiset<int> s;
int main() {
scanf("%d", &N);
for (int i = 0, A; i < N; i++) {
scanf("%d", &A);
set<int>::iterator it = s.lb(A);
if (it == s.begin())
ans++;
else
it--, s.erase(it);
s.insert(A);
... | [
"variable_declaration.type.change"
] | 781,470 | 781,471 | u014376901 | cpp |
p02973 | /***"In the name of Allah(swt), the most gracious, most merciful. Allah(swt)
* blesses with knowledge whom he wants."***/
/*Header file starts here*/
//#include<bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cst... | /***"In the name of Allah(swt), the most gracious, most merciful. Allah(swt)
* blesses with knowledge whom he wants."***/
/*Header file starts here*/
//#include<bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cst... | [
"variable_declaration.type.change"
] | 781,472 | 781,473 | u081421133 | cpp |
p02973 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int a[maxn];
multiset<int> st;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (st.size() == 0) {
st.insert(a[i]);
} else {
multiset<int>::iterator iter = st.lower_bound(a[i]);
if (it... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int a[maxn];
multiset<int> st;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (st.size() == 0) {
st.insert(a[i]);
} else {
multiset<int>::iterator iter = st.lower_bound(a[i]);
if (it... | [
"call.arguments.change"
] | 781,474 | 781,475 | u940054416 | cpp |
p02975 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 781,479 | 781,480 | u564182781 | cpp |
p02975 | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
// typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define sz(x) ll(x.size())
// t... | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
// typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define sz(x) ll(x.size())
// t... | [
"control_flow.branch.if.condition.change"
] | 781,481 | 781,482 | u564182781 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
//#define _GLIBCXX_DEBUG
signed main() {
int N;
cin >> N;
vector<int> a(N);
rep(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
//#define _GLIBCXX_DEBUG
signed main() {
int N;
cin >> N;
vector<int> a(N);
rep(... | [
"control_flow.branch.if.condition.change"
] | 781,485 | 781,486 | u914707890 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for (int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = lon... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for (int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = lon... | [
"control_flow.branch.if.condition.change"
] | 781,489 | 781,490 | u712993629 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sd(x) scanf("%d", &(x))
#define pii pair<int, int>
#define F first
#define S second
#define all(c) ((c).begin()), ((c).end())
#define sz(x) ((int)(x).size())
#define ld long double
template <class T, class U>
ostream &operator<<(ostream &os, c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sd(x) scanf("%d", &(x))
#define pii pair<int, int>
#define F first
#define S second
#define all(c) ((c).begin()), ((c).end())
#define sz(x) ((int)(x).size())
#define ld long double
template <class T, class U>
ostream &operator<<(ostream &os, c... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 781,491 | 781,492 | u908558278 | cpp |
p02975 | // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define ll long long
#define MOD 998244353 // 100000000 //1000000007 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((int)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n;... | // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define ll long long
#define MOD 998244353 // 100000000 //1000000007 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((int)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n;... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 781,493 | 781,494 | u448570453 | cpp |
p02975 | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9 + 7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge {
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w) {}
};
using graph = vector<vector... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9 + 7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge {
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w) {}
};
using graph = vector<vector... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 781,500 | 781,501 | u473023730 | cpp |
p02975 | // {{{ by unolight
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#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++)... | // {{{ by unolight
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#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++)... | [
"control_flow.branch.if.condition.change"
] | 781,507 | 781,508 | u385825353 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> t;
vector<int> three;
map<int, int> mp;
rep(i, n) {
cin >> a[i];
mp[a[i]]++;
}
if (mp.size(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> t;
vector<int> three;
map<int, int> mp;
rep(i, n) {
cin >> a[i];
mp[a[i]]++;
}
if (mp.size(... | [
"control_flow.branch.if.condition.change"
] | 781,516 | 781,517 | u233586402 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> t;
vector<int> three;
map<int, int> mp;
rep(i, n) {
cin >> a[i];
mp[a[i]]++;
}
if (mp.size(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> t;
vector<int> three;
map<int, int> mp;
rep(i, n) {
cin >> a[i];
mp[a[i]]++;
}
if (mp.size(... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 781,518 | 781,517 | u233586402 | cpp |
p02975 |
#include <algorithm>
#include <chrono>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#... |
#include <algorithm>
#include <chrono>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#... | [
"control_flow.branch.if.condition.change"
] | 781,519 | 781,520 | u405653069 | cpp |
p02975 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef lon... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef lon... | [
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 781,521 | 781,522 | u188706971 | cpp |
p02975 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef lon... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef lon... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 781,523 | 781,522 | u188706971 | cpp |
p02975 | #include <cstdio>
#include <iostream>
#include <map>
using namespace std;
int main() {
long long n;
cin >> n;
map<long long, long long> T;
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
if (T.find(a) == T.end()) {
T[a] = 1;
} else {
T[a] += 1;
}
}
if (T.size() ... | #include <cstdio>
#include <iostream>
#include <map>
using namespace std;
int main() {
long long n;
cin >> n;
map<long long, long long> T;
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
if (T.find(a) == T.end()) {
T[a] = 1;
} else {
T[a] += 1;
}
}
if (T.size() ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 781,524 | 781,525 | u418879326 | cpp |
p02975 | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // ๅๆกใฎๅใ่จ็ฎใใใ
int getDigit(int n); // ๆฐๅญใฎๆกๆฐใๅๅพใใใ
string upper(string str); // ่ฑๅญใๅคงๆๅญใซๅคๆใใใ
strin... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // ๅๆกใฎๅใ่จ็ฎใใใ
int getDigit(int n); // ๆฐๅญใฎๆกๆฐใๅๅพใใใ
string upper(string str); // ่ฑๅญใๅคงๆๅญใซๅคๆใใใ
strin... | [
"control_flow.branch.if.condition.change"
] | 781,529 | 781,530 | u610897920 | cpp |
p02975 | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // ๅๆกใฎๅใ่จ็ฎใใใ
int getDigit(int n); // ๆฐๅญใฎๆกๆฐใๅๅพใใใ
string upper(string str); // ่ฑๅญใๅคงๆๅญใซๅคๆใใใ
strin... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // ๅๆกใฎๅใ่จ็ฎใใใ
int getDigit(int n); // ๆฐๅญใฎๆกๆฐใๅๅพใใใ
string upper(string str); // ่ฑๅญใๅคงๆๅญใซๅคๆใใใ
strin... | [
"control_flow.branch.if.condition.change"
] | 781,531 | 781,530 | u610897920 | cpp |
p02975 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
#define finn \
{ ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
#define finn \
{ ... | [
"control_flow.branch.if.condition.change"
] | 781,536 | 781,537 | u942774736 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ini, n) for (int i = ini; i < n; i++)
#define _rep(i, ini, n) for (int i = ini; i >= n; i--)
#define ToEnd(a) a.begin(), a.end()
uint64_t MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(n, 0, N) cin >> A.at(n);
map<int, int> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ini, n) for (int i = ini; i < n; i++)
#define _rep(i, ini, n) for (int i = ini; i >= n; i--)
#define ToEnd(a) a.begin(), a.end()
uint64_t MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(n, 0, N) cin >> A.at(n);
map<int, int> ... | [] | 781,538 | 781,539 | u190679129 | cpp |
p02975 | #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 MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
int main() ... | #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 MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
int main() ... | [
"control_flow.branch.if.condition.change"
] | 781,548 | 781,549 | u135626132 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | [
"control_flow.branch.if.condition.change"
] | 781,550 | 781,551 | u604329931 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | [
"control_flow.branch.if.condition.change"
] | 781,552 | 781,551 | u604329931 | cpp |
p02975 | // Ruthless Coding
#include <bits/stdc++.h>
#define uni(x) (x).resize(unique(ALL(x)) - (x).begin())
#define fprint(v) \
for (auto x : v) \
cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
... | // Ruthless Coding
#include <bits/stdc++.h>
#define uni(x) (x).resize(unique(ALL(x)) - (x).begin())
#define fprint(v) \
for (auto x : v) \
cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
... | [
"control_flow.branch.if.condition.change"
] | 781,553 | 781,554 | u048400646 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
LL N;
cin >> N;
// vector<LL> a(N);
unordered_map<LL, LL> m;
for (int i = 0; i < N; i++) {
LL a;
cin >> a;
m[a]++;
}
bool flag = true;
if (m.size() > 3) {
flag = false;
} else if (m.size() == 3) {
LL... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
LL N;
cin >> N;
// vector<LL> a(N);
unordered_map<LL, LL> m;
for (int i = 0; i < N; i++) {
LL a;
cin >> a;
m[a]++;
}
bool flag = true;
if (m.size() > 3) {
flag = false;
} else if (m.size() == 3) {
LL... | [
"control_flow.branch.if.condition.change"
] | 781,555 | 781,556 | u293072892 | cpp |
p02975 | #include <bits/stdc++.h>
//----***ใในใผใใคใ***----
using namespace std;
#define int long long
//----***ๅๅฎ็พฉ***----
using ll = long long;
using P = pair<int, int>;
//----***Like a Pythonista***----
#define REP(ii, jj, nn) for (ll ii = jj; ii < (nn); ii++)
#define RREP(ii, nn, jj) for (ll ii = nn; jj < ii; ii--)
#define ea... | #include <bits/stdc++.h>
//----***ใในใผใใคใ***----
using namespace std;
#define int long long
//----***ๅๅฎ็พฉ***----
using ll = long long;
using P = pair<int, int>;
//----***Like a Pythonista***----
#define REP(ii, jj, nn) for (ll ii = jj; ii < (nn); ii++)
#define RREP(ii, nn, jj) for (ll ii = nn; jj < ii; ii--)
#define ea... | [
"control_flow.branch.if.condition.change"
] | 781,557 | 781,558 | u526459074 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<unsigned int> a(n);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
vector<un... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<unsigned int> a(n);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
vector<un... | [
"control_flow.branch.if.condition.change"
] | 781,561 | 781,562 | u790655960 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
vector<int> b = a;... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<unsigned int> a(n);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
vector<un... | [
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change"
] | 781,563 | 781,562 | u790655960 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> a(N);
for (ll i = 0; i < N; i+... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> a(N);
for (ll i = 0; i < N; i+... | [
"control_flow.branch.if.condition.change"
] | 781,566 | 781,567 | u378155378 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <un... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <un... | [
"control_flow.branch.if.condition.change"
] | 781,571 | 781,572 | u275797573 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>=... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>=... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 781,588 | 781,589 | u303297838 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define r... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define r... | [
"control_flow.branch.if.condition.change"
] | 781,593 | 781,594 | u705296057 | cpp |
p02975 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | [
"expression.operation.binary.remove"
] | 781,597 | 781,598 | u614128939 | cpp |
p02975 | #include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i... | #include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i... | [
"assignment.value.change"
] | 781,601 | 781,602 | u618604643 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
signed main(void) {
int n, x[3], cnt_0;
cin >> n;
vector<int> a(n);
map<ll, ll> mp;
bool ok;
cnt_0 = 0;
rep(i, n) {
cin >> a[i];
if (a[i] == 0)
cnt_0++;
mp[a[i]]++;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
signed main(void) {
int n, x[3], cnt_0;
cin >> n;
vector<int> a(n);
map<ll, ll> mp;
bool ok;
cnt_0 = 0;
rep(i, n) {
cin >> a[i];
if (a[i] == 0)
cnt_0++;
mp[a[i]]++;
}
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 781,603 | 781,604 | u890331732 | cpp |
p02975 | // a_2 = a_1 xor a_3 = (a_0 xor a_2) xor a_3
// ใใฎใใจใใใ a_0 xor a_3 = 0 ใคใพใ a_0 = a_3ใงใใใใจใใใใใ
// N == 3*k (k = 1,2,3,...)ใฎใจใใ
// {a_i}ใ3ใคใฎๆฐใใๆใใb_0, b_1, b_2ใจใใฆใb_0 xor b_1 =
// b_2ใๆใ็ซใคใๅคๅฎ N % 3 != 0
// ใชใใๅ
จใฆใฎๆฐใ็ญใใใชใใ(0ใซใชใ)ใฉใใๅคๅฎ
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N... | // a_2 = a_1 xor a_3 = (a_0 xor a_2) xor a_3
// ใใฎใใจใใใ a_0 xor a_3 = 0 ใคใพใ a_0 = a_3ใงใใใใจใใใใใ
// N == 3*k (k = 1,2,3,...)ใฎใจใใ
// {a_i}ใ3ใคใฎๆฐใใๆใใb_0, b_1, b_2ใจใใฆใb_0 xor b_1 =
// b_2ใๆใ็ซใคใๅคๅฎ N % 3 != 0
// ใชใใๅ
จใฆใฎๆฐใ็ญใใใชใใ(0ใซใชใ)ใฉใใๅคๅฎ
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N... | [
"control_flow.branch.if.condition.change"
] | 781,605 | 781,606 | u816645498 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.