problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03201 | #include <cstdio>
#include <set>
int n, ans;
std::multiset<int> st;
int main() {
int i, a, x, y;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a), st.insert(a);
while (!st.empty()) {
x = *st.rbegin();
st.erase(st.find(x));
for (y = 1; y < x; y <<= 1)
;
std::multiset<int>::iter... | #include <cstdio>
#include <set>
int n, ans;
std::multiset<int> st;
int main() {
int i, a, x, y;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a), st.insert(a);
while (!st.empty()) {
x = *st.rbegin();
st.erase(st.find(x));
for (y = 1; y <= x; y <<= 1)
;
std::multiset<int>::ite... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,685 | 995,686 | u093170535 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 200000 + 10;
int n, vis[maxn], Ans;
ll a[maxn], mx;
inline void solve(ll k) {
vis[0] = 0;
for (int i = 1, j = n; i <= n; i++) {
if (vis[i])
continue;
while (j > 0 && (vis[j] || a[i] + a[j] > k))
j--;
if (j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 200000 + 10;
int n, vis[maxn], Ans;
ll a[maxn], mx;
inline void solve(ll k) {
vis[0] = 0;
for (int i = 1, j = n; i <= n; i++) {
if (vis[i])
continue;
while (j > 0 && (vis[j] || a[i] + a[j] > k))
j--;
if (j... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 995,687 | 995,688 | u323696981 | cpp |
p03201 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,691 | 995,692 | u957188497 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
map<int, int> vis;
int n, ans, k, a[200005];
int tmp[50];
int main() {
tmp[0] = 1;
for (int i = 1; i <= 30; i++)
tmp[i] = tmp[i - 1] << 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
vis[a[i]]++;
}
sort(a + 1, a + n + 1);
fo... | #include <bits/stdc++.h>
using namespace std;
map<int, int> vis;
int n, ans, k, a[200005];
int tmp[50];
int main() {
tmp[0] = 1;
for (int i = 1; i <= 30; i++)
tmp[i] = tmp[i - 1] << 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
vis[a[i]]++;
}
sort(a + 1, a + n + 1);
fo... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 995,696 | 995,697 | u989325410 | cpp |
p03201 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define loop(i, N) for (ll(i) = 0; (i) < (N); ++(i))
struct TEMP_OMAZINAI_ {
TEMP_OMAZINAI_() {
std::ios::sync_wit... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define loop(i, N) for (ll(i) = 0; (i) < (N); ++(i))
struct TEMP_OMAZINAI_ {
TEMP_OMAZINAI_() {
std::ios::sync_wit... | [
"variable_declaration.type.change"
] | 995,700 | 995,701 | u738810131 | cpp |
p03201 | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<LL, LL>
#de... | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<LL, LL>
#de... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 995,702 | 995,703 | u977365687 | cpp |
p03201 | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<LL, LL>
#de... | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<LL, LL>
#de... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"expression.operation.unary.arithmetic.add"
] | 995,707 | 995,703 | u977365687 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5;
int n, ans;
multiset<int, greater<int>> S;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
int i, j;
scanf("%d", &n);
for (i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5;
int n, ans;
multiset<int, greater<int>> S;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
int i, j;
scanf("%d", &n);
for (i = 0; i < n;... | [
"call.add",
"call.arguments.change"
] | 995,708 | 995,709 | u539847337 | cpp |
p03201 | #include <iostream>
#include <set>
using namespace std;
multiset<int> mp;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
mp.insert(x);
}
int ans = 0;
while (!mp.empty()) {
multiset<int>::iterator it = mp.end();
it--;
int x = *it;
mp.erase(it);
f... | #include <iostream>
#include <set>
using namespace std;
multiset<int> mp;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
mp.insert(x);
}
int ans = 0;
while (!mp.empty()) {
multiset<int>::iterator it = mp.end();
it--;
int x = *it;
mp.erase(it);
f... | [
"call.arguments.add",
"call.arguments.change"
] | 995,712 | 995,713 | u640777058 | cpp |
p03201 | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#... | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#... | [
"variable_declaration.type.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 995,714 | 995,715 | u059727354 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define fst first
#define snd second
#define SZ(u) ((int)(u).size())
#define ALL(u) (u).begin(), (u).end()
inline void proc_status() {
ifstream t("/proc/self/status");
cerr << string(istreambuf_iter... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define fst first
#define snd second
#define SZ(u) ((int)(u).size())
#define ALL(u) (u).begin(), (u).end()
inline void proc_status() {
ifstream t("/proc/self/status");
cerr << string(istreambuf_iter... | [] | 995,728 | 995,729 | u284781029 | cpp |
p03201 | #include <iostream>
#include <set>
using namespace std;
int main() {
int n;
cin >> n;
multiset<int> st;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
st.insert(x);
}
int ans = 0;
while (st.size() >= 2) {
int x = *st.rbegin();
st.erase(st.find(x));
for (int i = 30; i >= 0; i--) ... | #include <iostream>
#include <set>
using namespace std;
int main() {
int n;
cin >> n;
multiset<int> st;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
st.insert(x);
}
int ans = 0;
while (st.size() >= 2) {
int x = *st.rbegin();
st.erase(st.find(x));
for (int i = 30; i >= 0; i--) ... | [
"expression.operation.binary.remove"
] | 995,730 | 995,731 | u006493569 | cpp |
p03201 | #include <iostream>
#include <map>
using namespace std;
const int N = 2e5 + 10;
long long a[N], n;
map<long long, int> vis;
int main() {
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
vis[a[i]]++;
}
long long ans = 0;
for (map<long long, int>::iterator it = vis.end(); it != v... | #include <iostream>
#include <map>
using namespace std;
const int N = 2e5 + 10;
long long a[N], n;
map<long long, int> vis;
int main() {
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
vis[a[i]]++;
}
long long ans = 0;
for (map<long long, int>::reverse_iterator it = vis.rbegin... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 995,732 | 995,733 | u034225940 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
multiset<int> w;
int n, a[N], two[N], ans;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
two[0] = 1;
for (int i = 1; i < 32; ++i)
two[i] = two[i - 1] << 1;
sort(a + 1, a + 1 + n);
f... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
multiset<int> w;
int n, a[N], two[N], ans;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
two[0] = 1;
for (int i = 1; i < 32; ++i)
two[i] = two[i - 1] << 1;
sort(a + 1, a + 1 + n);
f... | [
"call.arguments.change",
"call.function.change"
] | 995,734 | 995,735 | u454097714 | cpp |
p03201 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &t : a)
cin >> t;
sort(a.begin(), a.end());
vector<int> used(n, 0);
int r = 0;
for (int target = (1 << 30); target >= 2; target /= 2) {
int low = 0, high = n ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &t : a)
cin >> t;
sort(a.begin(), a.end());
vector<int> used(n, 0);
int r = 0;
for (int target = (1 << 30); target >= 2; target /= 2) {
int low = 0, high = n ... | [
"expression.operation.binary.change"
] | 995,738 | 995,739 | u450325641 | cpp |
p03201 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> a(N);
for (auto &t : a)
cin >> t;
sort(a.begin(), a.end());
vector<int> used(N, 0);
int res = 0;
for (int target = (1 << 30); target >= 2; target /= 2) {
int low = 0, high = N - 1;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (auto &t : a)
cin >> t;
sort(a.begin(), a.end());
vector<int> used(N, 0);
int res = 0;
for (int target = (1 << 30); target >= 2; target /= 2) {
int low = 0, high ... | [] | 995,740 | 995,741 | u002023395 | cpp |
p03201 | #include <bits/stdc++.h>
// statics
using namespace std;
using int64 = int_fast64_t;
using PAIR = pair<int64, int64>;
constexpr int64 INF = 1LL << 40 - 1;
constexpr int64 LINF = 1LL << 60 + 1;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 1e5 + 1;
// init/input
#define int int64
#define INIT ... | #include <bits/stdc++.h>
// statics
using namespace std;
using int64 = int_fast64_t;
using PAIR = pair<int64, int64>;
constexpr int64 INF = 1LL << 40 - 1;
constexpr int64 LINF = 1LL << 60 + 1;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 1e5 + 1;
// init/input
#define int int64
#define INIT ... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 995,751 | 995,752 | u258009780 | cpp |
p03201 | #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 = 200010;
int main() {
int N;
int A[MAX];
map<long long, long long> table;
int... | #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 = 200010;
int main() {
int N;
int A[MAX];
map<long long, long long> table;
int... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 995,753 | 995,754 | u105959367 | cpp |
p03201 | //#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize(4)
//#pragma GCC optimize("unroll-loops")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#... | //#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize(4)
//#pragma GCC optimize("unroll-loops")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 995,757 | 995,758 | u345759767 | cpp |
p03201 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using pii = pair<int, int>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#defi... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using pii = pair<int, int>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#defi... | [
"literal.number.type.widen.change"
] | 995,759 | 995,760 | u949798495 | cpp |
p03201 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
using namespace std;
#define maxn long long(5 * 1e8)
int main() {
long long n = 0;
scanf("%d", &n);
map<long long, long long, greater<long long>> num;
for (long long i = 1; i <= n; ++i) {
long long temp = 0;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
using namespace std;
#define maxn long long(5 * 1e8)
int main() {
long long n = 0;
scanf("%d", &n);
map<long long, long long, greater<long long>> num;
for (long long i = 1; i <= n; ++i) {
long long temp = 0;
... | [
"literal.number.change",
"call.arguments.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 995,770 | 995,771 | u620470879 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> iint;
typedef pair<ll, ll> llll;
#define ALL(x) (x).begin(), (x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; // 10^18
const int inINF = 2147483647; // 10^9
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> iint;
typedef pair<ll, ll> llll;
#define ALL(x) (x).begin(), (x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; // 10^18
const int inINF = 2147483647; // 10^9
... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 995,774 | 995,775 | u478462004 | cpp |
p03201 | #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)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#d... | #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)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#d... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 995,782 | 995,783 | u564182781 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#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 repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#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 repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 995,791 | 995,792 | u104057163 | cpp |
p03201 | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n;
cin >> n;
l... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n;
cin >> n;
l... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,793 | 995,794 | u030992242 | cpp |
p03201 | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n;
cin >> n;
l... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n;
cin >> n;
l... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operation.unary.arithmetic.remove",
"control_flow.branch.if.condition.change"
] | 995,795 | 995,794 | u030992242 | cpp |
p03201 | #include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(A.rbegin(), A.rend());
unordered_map<int, ... | #include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(A.rbegin(), A.rend());
unordered_map<int, ... | [
"control_flow.break.add"
] | 995,798 | 995,799 | u004707990 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(), a.end()
#define SZ(a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(), a.end()
#define SZ(a)... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 995,802 | 995,803 | u194908943 | cpp |
p03201 | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 995,804 | 995,805 | u119974167 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | [
"call.add",
"call.arguments.change"
] | 995,806 | 995,807 | u293391755 | cpp |
p03201 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 995,810 | 995,811 | u415916075 | cpp |
p03201 | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = getchar();
while ... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
inline ll read() {
ll x = 0, w = 1;
char c = getchar();
while (c... | [
"variable_declaration.type.change"
] | 995,812 | 995,813 | u766349042 | cpp |
p03201 | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = getchar();
while ... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
inline ll read() {
ll x = 0, w = 1;
char c = getchar();
while (c... | [
"variable_declaration.type.change"
] | 995,814 | 995,813 | u766349042 | cpp |
p03201 | #include <algorithm>
#include <iostream>
#include <set>
signed main() {
int n;
std::cin >> n;
std::vector<int64_t> a(n);
for (auto &ai : a)
std::cin >> ai;
std::sort(std::rbegin(a), std::rend(a));
std::multiset<int64_t> st(std::begin(a), std::end(a));
int ans = 0;
for (int i = 0; i < n; ++i) {
... | #include <algorithm>
#include <iostream>
#include <set>
signed main() {
int n;
std::cin >> n;
std::vector<int64_t> a(n);
for (auto &ai : a)
std::cin >> ai;
std::sort(std::rbegin(a), std::rend(a));
std::multiset<int64_t> st(std::begin(a), std::end(a));
int ans = 0;
for (int i = 0; i < n; ++i) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"control_flow.loop.for.initializer.change"
] | 995,815 | 995,816 | u423624748 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
using ll = long long;
int main() {
ll n, a;
cin >> n;
multiset<ll, greater<>> st;
rep(i, n) {
cin >> a;
st.insert(a);
}
ll ans = 0;
while (!st.empty()) {
auto it = st.begin();
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
using ll = long long;
int main() {
ll n, a;
cin >> n;
multiset<ll, greater<>> st;
rep(i, n) {
cin >> a;
st.insert(a);
}
ll ans = 0;
while (!st.empty()) {
auto it = st.begin();
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,817 | 995,818 | u134678977 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
using ll = long long;
int main() {
ll n, a;
cin >> n;
multiset<ll, greater<>> st;
rep(i, n) {
cin >> a;
st.insert(a);
}
ll ans = 0;
while (!st.empty()) {
auto it = st.begin();
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
using ll = long long;
int main() {
ll n, a;
cin >> n;
multiset<ll, greater<ll>> st;
rep(i, n) {
cin >> a;
st.insert(a);
}
ll ans = 0;
while (!st.empty()) {
auto it = st.begin();
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,817 | 995,819 | u134678977 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
// https://atcoder.jp/contests/agc029/tasks/agc029_b
int n, ans = 0;
multiset<int> s;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
s.insert(a);
}
while (!s.empty()) {
auto a = s.end();
--a;
s.erase(a);
int b = ... | #include <bits/stdc++.h>
using namespace std;
// https://atcoder.jp/contests/agc029/tasks/agc029_b
int n, ans = 0;
multiset<int> s;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
s.insert(a);
}
while (!s.empty()) {
auto a = s.end();
--a;
s.erase(a);
int b = ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,824 | 995,825 | u154898295 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
int n;
const int maxn = 2e5 + 5;
bool vis[maxn];
int a[maxn];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
int n;
const int maxn = 2e5 + 5;
bool vis[maxn];
int a[maxn];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.... | [
"variable_declaration.type.change"
] | 995,837 | 995,838 | u962264371 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pp = pair<ll, pair<int, int>>;
using Graph = vector<vector<pair<int, ll>>>;
int main() {
int N;
cin >> N;
vector<int> A(N);
map<int, int> m;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
m[A.at(i)]++;
}
sort(A.begin(), A.en... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pp = pair<ll, pair<int, int>>;
using Graph = vector<vector<pair<int, ll>>>;
int main() {
int N;
cin >> N;
vector<int> A(N);
map<int, int> m;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
m[A.at(i)]++;
}
sort(A.begin(), A.en... | [
"expression.unary.arithmetic.add"
] | 995,841 | 995,842 | u630211216 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,851 | 995,852 | u276588887 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
#define int ll
signed main() {
ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
#define int ll
signed main() {
ios::sync_with_stdio(fals... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 995,855 | 995,856 | u864171425 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
#define int ll
signed main() {
ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
#define int ll
signed main() {
ios::sync_with_stdio(fals... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,857 | 995,856 | u864171425 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
#define int ull
signed main() {
ios::sync_with_stdio(fal... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
#define int ll
signed main() {
ios::sync_with_stdio(fals... | [
"preprocessor.define.value.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,858 | 995,856 | u864171425 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
#define int ull
signed main() {
ios::sync_with_stdio(fal... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
#define int ll
signed main() {
ios::sync_with_stdio(fals... | [
"preprocessor.define.value.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 995,859 | 995,856 | u864171425 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().coun... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().coun... | [
"expression.operation.unary.arithmetic.remove"
] | 995,862 | 995,863 | u322084037 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"assignment.change"
] | 995,864 | 995,865 | u824327013 | cpp |
p03201 | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
long long MOD = 1000000007;
vector<int> pow2() {
vector<int> vec(1, 1);
... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
long long MOD = 1000000007;
vector<int> pow2() {
vector<int> vec(1, 1);
... | [
"expression.operation.binary.remove"
] | 995,878 | 995,879 | u658993896 | cpp |
p03201 | #ifdef LOCAL
#pragma GCC optimize("O0")
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include... | #ifdef LOCAL
#pragma GCC optimize("O0")
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include... | [
"control_flow.branch.if.condition.change"
] | 995,892 | 995,893 | u331360010 | cpp |
p03201 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#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; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i)... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#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; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i)... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.remove"
] | 995,894 | 995,895 | u917282863 | cpp |
p03201 | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#i... | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#i... | [
"control_flow.branch.else.add"
] | 995,900 | 995,901 | u768642868 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
const int Maxb = 31;
int n;
map<int, int> M;
int res;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
M[a]++;
}
for (int i = Maxb - 1; i >= 0; i--)
for (map<int, int>::iterator it = M.begin();
it != M.e... | #include <bits/stdc++.h>
using namespace std;
const int Maxb = 31;
int n;
map<int, int> M;
int res;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
M[a]++;
}
for (int i = Maxb - 1; i >= 0; i--)
for (map<int, int>::iterator it = M.begin();
it != M.e... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 995,904 | 995,905 | u055221623 | cpp |
p03201 | /*+lmake
* STD = c++14
* DEFINE += WAAUTOMATON
*/
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#ifdef WAAUTOMATON
#define debug(args...) \
{ ... | /*+lmake
* STD = c++14
* DEFINE += WAAUTOMATON
*/
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#ifdef WAAUTOMATON
#define debug(args...) \
{ ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 995,906 | 995,907 | u275407061 | cpp |
p03201 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RE(i, n) FOR(i, 1, n)
#define REP(i, n) FOR(i, 0, (int)(n)-1)
#define R(i, n) REP(i, n)
#def... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RE(i, n) FOR(i, 1, n)
#define REP(i, n) FOR(i, 0, (int)(n)-1)
#define R(i, n) REP(i, n)
#def... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,908 | 995,909 | u250915148 | cpp |
p03201 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
#define int long long
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
#define int long long
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 995,910 | 995,911 | u749011596 | cpp |
p03201 | //#pragma comment(linker, "/STACK:134217728")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#incl... | //#pragma comment(linker, "/STACK:134217728")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#incl... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,914 | 995,915 | u115089744 | cpp |
p03201 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utili... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utili... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 995,918 | 995,919 | u965315642 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | [] | 995,920 | 995,921 | u901862155 | cpp |
p03201 | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:108777216")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#incl... | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:108777216")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#incl... | [
"variable_declaration.type.change"
] | 995,922 | 995,923 | u713558252 | cpp |
p03202 | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = "... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = "... | [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 995,924 | 995,925 | u120143737 | cpp |
p03202 | /*
Author: QAQAutomaton
Lang: C++
Code: C.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define Debug debug("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#... | /*
Author: QAQAutomaton
Lang: C++
Code: C.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define Debug debug("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.unary.arithmetic.add"
] | 995,926 | 995,927 | u228297051 | cpp |
p03202 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 200007;
int n, flag, l, r, mid, ans, a[N];
int tp, stk[N], num[N];
int check() {
tp = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] > a[i - 1])
continue;
if (!tp)
stk[++tp] = a[i], num[tp] = 1;
else ... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 200007;
int n, flag, l, r, mid, ans, a[N];
int tp, stk[N], num[N];
int check() {
tp = num[0] = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] > a[i - 1])
continue;
if (!tp)
stk[++tp] = a[i], num[tp] = 1;
... | [
"assignment.change"
] | 995,928 | 995,929 | u634600597 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int a[maxn], s[maxn];
int n, top;
bool check(int k) {
top = 0;
for (int i = 2; i <= n; ++i) {
if (a[i] < a[i + 1])
continue;
while (top && s[top] > a[i])
--top;
s[++top] = a[i];
while (top >= k && s[top - k + 1] == ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int a[maxn], s[maxn];
int n, top;
bool check(int k) {
top = 0;
for (int i = 2; i <= n; ++i) {
if (a[i - 1] < a[i])
continue;
while (top && s[top] > a[i])
--top;
s[++top] = a[i];
while (top >= k && s[top - k + 1] == ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 995,930 | 995,931 | u915913072 | cpp |
p03202 | #include <cstdio>
#include <cstring>
using namespace std;
int n, a[210000];
struct node {
int x, p;
} sta[210000];
int top;
bool pand(int x) {
sta[0].p = 0;
top = 1;
sta[1].x = 1;
sta[1].p = a[1];
for (int i = 2; i <= n; i++) {
if (sta[top].p < a[i]) {
if (sta[top].x == 1)
sta[top].p = a[i... | #include <cstdio>
#include <cstring>
using namespace std;
int n, a[210000];
struct node {
int x, p;
} sta[210000];
int top;
bool pand(int x) {
sta[0].p = 0;
top = 1;
sta[1].x = 1;
sta[1].p = a[1];
for (int i = 2; i <= n; i++) {
if (sta[top].p < a[i]) {
if (sta[top].x == 1)
sta[top].p = a[i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 995,940 | 995,941 | u994450353 | cpp |
p03202 | #include <cstdio>
#include <cstring>
using namespace std;
int n, a[210000];
struct node {
int x, p;
} sta[210000];
int top;
bool pand(int x) {
sta[0].p = 0;
top = 1;
sta[1].x = 1;
sta[1].p = a[1];
for (int i = 2; i <= n; i++) {
if (sta[top].p < a[i]) {
if (sta[top].x == 1)
sta[top].p = a[i... | #include <cstdio>
#include <cstring>
using namespace std;
int n, a[210000];
struct node {
int x, p;
} sta[210000];
int top;
bool pand(int x) {
sta[0].p = 0;
top = 1;
sta[1].x = 1;
sta[1].p = a[1];
for (int i = 2; i <= n; i++) {
if (sta[top].p < a[i]) {
if (sta[top].x == 1)
sta[top].p = a[i... | [
"literal.number.change",
"assignment.value.change",
"variable_declaration.value.change"
] | 995,942 | 995,941 | u994450353 | cpp |
p03202 | #include <cstdio>
#include <cstring>
using namespace std;
int n, a[210000];
struct node {
int x, p;
} sta[210000];
int top;
bool pand(int x) {
sta[0].p = 0;
top = 1;
sta[1].x = 0;
sta[1].p = a[1];
for (int i = 2; i <= n; i++) {
if (sta[top].p < a[i]) {
if (sta[top].x == 1)
sta[top].p = a[i... | #include <cstdio>
#include <cstring>
using namespace std;
int n, a[210000];
struct node {
int x, p;
} sta[210000];
int top;
bool pand(int x) {
sta[0].p = 0;
top = 1;
sta[1].x = 0;
sta[1].p = a[1];
for (int i = 2; i <= n; i++) {
if (sta[top].p < a[i]) {
if (sta[top].x == 0)
sta[top].p = a[i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 995,943 | 995,944 | u994450353 | cpp |
p03202 | #include <cstdio>
#include <cstring>
using namespace std;
const int N = 2e5 + 100;
int a[N], d[N], f[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int l = 1, r = n, ans;
while (l <= r) {
int mid = (l + r) >> 1;
d[0] = 0;
bool pd = true;
for (int ... | #include <cstdio>
#include <cstring>
using namespace std;
const int N = 2e5 + 100;
int a[N], d[N], f[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int l = 1, r = n, ans;
while (l <= r) {
int mid = (l + r) >> 1;
d[0] = 0;
bool pd = true;
for (int ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 995,945 | 995,946 | u303252118 | cpp |
p03202 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int maxn = 200010;
int n, top, a[maxn];
struct node {
int w, a;
} zhan[maxn];
bool bz;
void doit(int p, int q) {
if (p == 0) {
bz = false;
return;
}
while (zhan[t... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int maxn = 200010;
int n, top, a[maxn];
struct node {
int w, a;
} zhan[maxn];
bool bz;
void doit(int p, int q) {
if (p == 0) {
bz = false;
return;
}
while (zhan[t... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_declaration.value.change"
] | 995,949 | 995,948 | u969682710 | cpp |
p03202 | #include <bits/stdc++.h>
#define PB push_back
#define MP std::make_pair
#define FI first
#define SE second
#define M 1000005
#define INF 1000000000
int n, S[M], top;
bool flag;
std::pair<int, int> Stack[M];
int read() {
char c = getchar();
int ans = 0;
while (c < '0' || c > '9')
c = getchar();
while (c >= '... | #include <bits/stdc++.h>
#define PB push_back
#define MP std::make_pair
#define FI first
#define SE second
#define M 1000005
#define INF 1000000000
int n, S[M], top;
bool flag = 1;
std::pair<int, int> Stack[M];
int read() {
char c = getchar();
int ans = 0;
while (c < '0' || c > '9')
c = getchar();
while (c ... | [
"variable_declaration.value.change"
] | 995,952 | 995,953 | u281390654 | cpp |
p03202 | using namespace std;
#include <algorithm>
#include <cstdio>
#include <cstring>
#define N 200010
#define ll long long
int n;
int a[N];
ll k[N], b[N];
bool eql(ll d, ll k, ll b) {
ll s = 1;
for (; k && d <= b && s * d <= b; k >>= 1, d *= d)
if (k & 1)
s *= d;
return k == 0 && s == b;
}
bool judge(int d) {... | using namespace std;
#include <algorithm>
#include <cstdio>
#include <cstring>
#define N 200010
#define ll long long
int n;
int a[N];
ll k[N], b[N];
bool eql(ll d, ll k, ll b) {
ll s = 1;
for (; k && d <= b && s * d <= b; k >>= 1, d *= d)
if (k & 1)
s *= d;
return k == 0 && s == b;
}
bool judge(int d) {... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 995,954 | 995,955 | u870378262 | cpp |
p03202 | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'
using ll = long long;
using db = long double;
using ii = pair<int, int>;
const int N = ... | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'
using ll = long long;
using db = long double;
using ii = pair<int, int>;
const int N = ... | [
"expression.operation.binary.remove"
] | 995,956 | 995,957 | u220114950 | cpp |
p03202 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | [
"assignment.change"
] | 995,958 | 995,959 | u802434195 | cpp |
p03202 | // FUCKED UP FUCKED UP FUCKED UP FUCKED UP FUCKED UP
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(), x.end()
#define MP make_pair
typedef lon... | // FUCKED UP FUCKED UP FUCKED UP FUCKED UP FUCKED UP
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(), x.end()
#define MP make_pair
typedef lon... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 995,964 | 995,965 | u942137018 | cpp |
p03202 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#includ... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#includ... | [
"expression.operation.binary.remove"
] | 995,967 | 995,968 | u943070796 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64 i = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define STRINGIFY(n) #n
#define TOSTRING(n) STRINGIFY(n)
#define PREFIX "#" TOSTRING(__LINE__) "| "
#define debug(x) ... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64 i = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define STRINGIFY(n) #n
#define TOSTRING(n) STRINGIFY(n)
#define PREFIX "#" TOSTRING(__LINE__) "| "
#define debug(x) ... | [
"assignment.variable.change"
] | 995,979 | 995,980 | u852585808 | cpp |
p03202 | // todo idef DEBUGで、境界チェック付きのvectorを作りたい
// http://marycore.jp/prog/cpp/class-extension-methods/
//現状ifdef DEBUG が何故か動かないので出来ない
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixe... | // todo idef DEBUGで、境界チェック付きのvectorを作りたい
// http://marycore.jp/prog/cpp/class-extension-methods/
//現状ifdef DEBUG が何故か動かないので出来ない
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixe... | [
"literal.number.change",
"variable_declaration.value.change"
] | 995,981 | 995,982 | u986437843 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
} hoee;
namespace std {
template <> class hash<std::pair<signed, signed>> {
public:
size_t operator()(const std::pair<signed, signed> &x) const ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
} hoee;
namespace std {
template <> class hash<std::pair<signed, signed>> {
public:
size_t operator()(const std::pair<signed, signed> &x) const ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 995,983 | 995,984 | u986437843 | cpp |
p03202 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; ++x)
#define Red(x, y, z) for (int x = y; x >= z; --x)
using namespace std;
const int MAXN... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; ++x)
#define Red(x, y, z) for (int x = y; x >= z; --x)
using namespace std;
const int MAXN... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 995,987 | 995,988 | u710376653 | cpp |
p03202 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; ++x)
#define Red(x, y, z) for (int x = y; x >= z; --x)
using namespace std;
const int MAXN... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; ++x)
#define Red(x, y, z) for (int x = y; x >= z; --x)
using namespace std;
const int MAXN... | [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 995,989 | 995,988 | u710376653 | cpp |
p03202 | // minamoto
#include <bits/stdc++.h>
#define R register
#define fi first
#define se second
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline... | // minamoto
#include <bits/stdc++.h>
#define R register
#define fi first
#define se second
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline... | [
"assignment.change"
] | 995,992 | 995,993 | u561765782 | cpp |
p03202 | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll n;
ll a[200005];
ll sz;
vector<ll> ve, vi;
bool v;
bool vv;
void g(ll p, ll q) {
ll now = p;
while (1) {
if (now == 0) {
vv = true;
return;
}
if (vi.back() == now) {
if (ve.back() ... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll n;
ll a[200005];
ll sz;
vector<ll> ve, vi;
bool v;
bool vv;
void g(ll p, ll q) {
ll now = p;
while (1) {
if (now == 0) {
vv = true;
return;
}
if (vi.back() == now) {
if (ve.back() ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,014 | 996,015 | u307227472 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const ll MOD = 1000000007;
co... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const ll MOD = 1000000007;
co... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 996,020 | 996,021 | u334351654 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define long ll
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
for (auto &e : a)
cin >> e;
{
for (ll i = 1; i < n; i++)
if (a[i - 1] >= a[i])
goto search;
cout ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define long ll
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
for (auto &e : a)
cin >> e;
{
for (ll i = 1; i < n; i++)
if (a[i - 1] >= a[i])
goto search;
cout ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 996,022 | 996,023 | u056944756 | cpp |
p03202 | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr boo... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr boo... | [] | 996,024 | 996,025 | u047554023 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0, _n = (int)(n); i < _n; ++i)
#define ALL(v) (v).begin(), (v).end()
#define CLR(t, v) memset(t, (v), sizeof(t))
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &a) {
return os << "(" ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0, _n = (int)(n); i < _n; ++i)
#define ALL(v) (v).begin(), (v).end()
#define CLR(t, v) memset(t, (v), sizeof(t))
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &a) {
return os << "(" ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 996,031 | 996,032 | u045939752 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 200005;
int n, a[Maxn];
map<int, int> Ma[Maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n; i++)
if (a[i] <= a[i + 1])
goto A;
puts("1");
return 0;
A:
int l = 2, r = n;
w... | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 200005;
int n, a[Maxn];
map<int, int> Ma[Maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n; i++)
if (a[i] >= a[i + 1])
goto A;
puts("1");
return 0;
A:
int l = 2, r = n;
w... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,038 | 996,039 | u032193798 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 200005;
int n, a[Maxn];
map<int, int> Ma[Maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n; i++)
if (a[i] <= a[i + 1])
goto A;
puts("1");
return 0;
A:
int l = 2, r = n;
w... | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 200005;
int n, a[Maxn];
map<int, int> Ma[Maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n; i++)
if (a[i] >= a[i + 1])
goto A;
puts("1");
return 0;
A:
int l = 2, r = n;
w... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.unary.logical.remove",
"control_flow.loop.for.condition.change"
] | 996,040 | 996,039 | u032193798 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 200005;
int n, a[Maxn];
map<int, int> Ma[Maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n; i++)
if (a[i] <= a[i + 1])
goto A;
puts("1");
return 0;
A:
int l = 2, r = n;
w... | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 200005;
int n, a[Maxn];
map<int, int> Ma[Maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n; i++)
if (a[i] >= a[i + 1])
goto A;
puts("1");
return 0;
A:
int l = 2, r = n;
w... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,038 | 996,041 | u032193798 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 200005;
int n, a[Maxn];
map<int, int> Ma[Maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n; i++)
if (a[i] <= a[i + 1])
goto A;
puts("1");
return 0;
A:
int l = 2, r = n;
w... | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 200005;
int n, a[Maxn];
map<int, int> Ma[Maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n; i++)
if (a[i] >= a[i + 1])
goto A;
puts("1");
return 0;
A:
int l = 2, r = n;
w... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.unary.logical.remove",
"control_flow.loop.for.condition.change"
] | 996,040 | 996,041 | u032193798 | cpp |
p03202 | #include <cstdio>
const int N = 2e5 + 6;
int n, A[N];
int a[N], b[N], top;
bool check(int c) {
top = 0;
for (int i = 2; i <= n; ++i)
if (A[i] < A[i - 1]) {
int pos = A[i];
while (top && a[top] > pos)
--top;
if (!top || a[top] != pos)
a[++top] = pos, b[top] = 1;
else {
... | #include <cstdio>
const int N = 2e5 + 6;
int n, A[N];
int a[N], b[N], top;
bool check(int c) {
top = 0;
for (int i = 2; i <= n; ++i)
if (A[i] <= A[i - 1]) {
int pos = A[i];
while (top && a[top] > pos)
--top;
if (!top || a[top] != pos)
a[++top] = pos, b[top] = 1;
else {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 996,042 | 996,043 | u325348815 | cpp |
p03202 | #include <cstdio>
const int N = 2e5 + 6;
int n, A[N];
int a[N], b[N], top;
bool check(int c) {
top = 0;
for (int i = 2; i <= n; ++i)
if (A[i] < A[i - 1]) {
int pos = A[i];
while (top && a[top] > pos)
--top;
if (!top || a[top] != pos)
a[++top] = pos, b[top] = 1;
else {
... | #include <cstdio>
const int N = 2e5 + 6;
int n, A[N];
int a[N], b[N], top;
bool check(int c) {
top = 0;
for (int i = 2; i <= n; ++i)
if (A[i] <= A[i - 1]) {
int pos = A[i];
while (top && a[top] > pos)
--top;
if (!top || a[top] != pos)
a[++top] = pos, b[top] = 1;
else {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"misc.opposites"
] | 996,044 | 996,043 | u325348815 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, a[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
auto chk = [&](int x) {
map<long long, long long> mp;
for (int i = 2; i <= n; i++)
if (a[i - 1] >= a[i]) {
if (x == 1)
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, a[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
auto chk = [&](int x) {
map<int, int> mp;
for (int i = 2; i <= n; i++)
if (a[i - 1] >= a[i]) {
if (x == 1)
return 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"control_flow.loop.condition.change"
] | 996,046 | 996,047 | u813182415 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, a[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
auto chk = [&](int x) {
map<int, int> mp;
for (int i = 2; i <= n; i++)
if (a[i - 1] >= a[i]) {
if (x == 1)
return 0;
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, a[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
auto chk = [&](int x) {
map<int, int> mp;
for (int i = 2; i <= n; i++)
if (a[i - 1] >= a[i]) {
if (x == 1)
return 0;
... | [
"control_flow.loop.condition.change"
] | 996,048 | 996,047 | u813182415 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, a[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
auto chk = [&](int x) {
map<long long, long long> mp;
for (int i = 2; i <= n; i++)
if (a[i - 1] >= a[i]) {
if (x == 1)
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, a[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
auto chk = [&](int x) {
map<long long, long long> mp;
for (int i = 2; i <= n; i++)
if (a[i - 1] >= a[i]) {
if (x == 1)
... | [
"control_flow.loop.condition.change"
] | 996,046 | 996,049 | u813182415 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
int n, l, r, mid, ans;
int a[100005];
struct node {
int u, l, r;
};
int check(int x) {
queue<node> f;
f.push((node){1, 1, a[1]});
for (int i = 2; i <= n; i++) {
if (a[i] > a[i - 1])
f.push((node){1, a[i - 1] + 1, a[i]});
else {
int p;
whil... | #include <bits/stdc++.h>
using namespace std;
int n, l, r, mid, ans;
int a[200005];
struct node {
int u, l, r;
};
int check(int x) {
stack<node> f;
f.push((node){1, 1, a[1]});
for (int i = 2; i <= n; i++) {
if (a[i] > a[i - 1])
f.push((node){1, a[i - 1] + 1, a[i]});
else {
int p;
whil... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.change",
"call.function.change"
] | 996,052 | 996,051 | u742046409 | cpp |
p03202 | #include <bits/stdc++.h>
#define RI register int
typedef long long LL;
#define lc (x << 1)
#define rc (x << 1 | 1)
#define FILEIO(name) \
freopen(name ".in", "r", stdin), freopen(name ".out", "w", stdout);
using namespace std;
char buf[1000000], *p1 = buf, ... | #include <bits/stdc++.h>
#define RI register int
typedef long long LL;
#define lc (x << 1)
#define rc (x << 1 | 1)
#define FILEIO(name) \
freopen(name ".in", "r", stdin), freopen(name ".out", "w", stdout);
using namespace std;
char buf[1000000], *p1 = buf, ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,053 | 996,054 | u465426617 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
int n, a[200001];
struct node {
int x, v;
} s[200001];
bool judge(int x) {
int cnt = 0;
for (int i = 2; i <= n; i++)
if (a[i] <= a[i - 1]) {
if (x == 1)
return false;
while (cnt && s[cnt - 1].x > a[i])
cnt--;
int t = a[i];
w... | #include <bits/stdc++.h>
using namespace std;
int n, a[200001];
struct node {
int x, v;
} s[200001];
bool judge(int x) {
int cnt = 0;
for (int i = 2; i <= n; i++)
if (a[i] <= a[i - 1]) {
if (x == 1)
return false;
while (cnt && s[cnt - 1].x > a[i])
cnt--;
int t = a[i];
w... | [] | 996,057 | 996,058 | u676323984 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vec<int> A(N);
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vec<int> A(N);
for (int i = ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 996,071 | 996,072 | u623954643 | cpp |
p03202 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 996,073 | 996,074 | u212904724 | cpp |
p03202 | #include <bits/stdc++.h>
#define MN 200005
typedef std::pair<int, int> P;
int n, a[MN], lst;
int pos[MN], val[MN], cnt;
bool check(int x) {
cnt = 0;
for (int i = 2; i <= n; i++) {
if (a[i] > a[i - 1])
continue;
for (; cnt && pos[cnt] > a[i]; cnt--)
;
if (pos[cnt] < a[i])
pos[++cnt] = a... | #include <bits/stdc++.h>
#define MN 200005
typedef std::pair<int, int> P;
int n, a[MN], lst;
int pos[MN], val[MN], cnt;
bool check(int x) {
cnt = 0;
for (int i = 2; i <= n; i++) {
if (a[i] > a[i - 1])
continue;
for (; cnt && pos[cnt] > a[i]; cnt--)
;
if (pos[cnt] < a[i])
pos[++cnt] = a... | [] | 996,077 | 996,078 | u734966530 | cpp |
p03202 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
vector<int> g[200200];
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int left = 1, ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
vector<int> g[200200];
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int left = 0, ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 996,085 | 996,086 | u928536113 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.