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 |
|---|---|---|---|---|---|---|---|
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> v;
for (int i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> v;
for (int i = 0; i < n;... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 1,010,023 | 1,010,024 | u862412671 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
} hoee;
//別名
#define int long long
#define vec vector
#define con continue
#define bre break
#define brk break
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs... | #include <bits/stdc++.h>
using namespace std;
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
} hoee;
//別名
#define int long long
#define vec vector
#define con continue
#define bre break
#define brk break
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 1,010,049 | 1,010,050 | u986437843 | cpp |
p03215 | #include <bitset>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
vector<bitset<64>> sums;
for (int i = 0; cin >> a[i]; i++) {
long long sum = 0;
for (int j = i; j >= 0; j--) {
sum += a[j];
sums.emplace_back(sum);
}
}
for ... | #include <bitset>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
vector<bitset<64>> sums;
for (int i = 0; cin >> a[i]; i++) {
long long sum = 0;
for (int j = i; j >= 0; j--) {
sum += a[j];
sums.emplace_back(sum);
}
}
for ... | [
"call.add"
] | 1,010,073 | 1,010,074 | u085367022 | cpp |
p03215 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,010,083 | 1,010,084 | u043443359 | cpp |
p03215 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,010,085 | 1,010,084 | u043443359 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll... | [
"control_flow.branch.if.condition.change",
"literal.number.type.widen.change"
] | 1,010,129 | 1,010,127 | u339937125 | cpp |
p03215 | #include <bits/stdc++.h>
int main() {
int N, K;
scanf("%d%d", &N, &K);
std::vector<int> a(N);
for (auto &e : a)
scanf("%d", &e);
std::vector<int64_t> sum;
sum.reserve(N * (N + 1) / 2);
for (int i{}; i < N; i++) {
int64_t tmp{};
for (int j{i}; j < N; j++) {
tmp += a[j];
sum.push_ba... | #include <bits/stdc++.h>
int main() {
int N, K;
scanf("%d%d", &N, &K);
std::vector<int> a(N);
for (auto &e : a)
scanf("%d", &e);
std::vector<int64_t> sum;
sum.reserve(N * (N + 1) / 2);
for (int i{}; i < N; i++) {
int64_t tmp{};
for (int j{i}; j < N; j++) {
tmp += a[j];
sum.push_ba... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,010,143 | 1,010,144 | u086849314 | cpp |
p03215 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,010,160 | 1,010,161 | u340303097 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll n, k, A[200001], B[200001], ans = 0;
vector<ll> C;
int search() {
ll b;
for (int i = 60; i >= 0; i--) {
ll c = pow(2, i);
ll a = 0;
rep(j, C.size()) if (C[j] >= c && c ^ C[j] == C[j] - c)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll n, k, A[200001], B[200001], ans = 0;
vector<ll> C;
int search() {
ll b;
for (int i = 60; i >= 0; i--) {
ll c = pow(2, i);
ll a = 0;
rep(j, C.size()) if (C[j] >= c && (c ^ C[j]) == C[j] - ... | [
"control_flow.branch.if.condition.change"
] | 1,010,178 | 1,010,179 | u441296840 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#define EPS (1e-7)
#define INF ... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#define EPS (1e-7)
#define INF ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,010,194 | 1,010,195 | u551351897 | cpp |
p03202 | #pragma gcc optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
typedef int64_t lld;
typedef pair<int, int> pii;
typedef pair<lld, lld> pll;
typedef pair<int, pll> pip;
typedef pair<pll, int> ppi;
typedef pair<lld, pll> plp;
typedef pair<pll, lld> ppl;
typedef pair<pll, pll> ppp;
template <typename T> usin... | #pragma gcc optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
typedef int64_t lld;
typedef pair<int, int> pii;
typedef pair<lld, lld> pll;
typedef pair<int, pll> pip;
typedef pair<pll, int> ppi;
typedef pair<lld, pll> plp;
typedef pair<pll, lld> ppl;
typedef pair<pll, pll> ppp;
template <typename T> usin... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,010,203 | 1,010,204 | u579678749 | cpp |
p03202 | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | [
"variable_declaration.type.change",
"assignment.change"
] | 1,010,209 | 1,010,210 | u509674552 | cpp |
p03202 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, j, k) for (int i = j; i <= k; i++)
#define dow(i, j, k) for (int i = j; i >= k; i--)
using namespace std;
const int N = 2e5 + 100;
int n, a[N];
vector<pair<int, int>> mp;
bo... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, j, k) for (int i = j; i <= k; i++)
#define dow(i, j, k) for (int i = j; i >= k; i--)
using namespace std;
const int N = 2e5 + 100;
int n, a[N];
vector<pair<int, int>> mp;
bo... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,010,213 | 1,010,214 | u195794470 | cpp |
p03202 | //#pragma GCC optimize ("-O3","unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#includ... | //#pragma GCC optimize ("-O3","unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#includ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,010,215 | 1,010,216 | u859396346 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 10;
int N, A[MAX_N];
bool check(int sigma) {
static pair<int, int> stk[MAX_N];
int top = 0;
for (int i = 1; i <= N; i++) {
int delta = A[i] - A[i - 1];
if (delta > 0) {
stk[++top] = make_pair(1, delta);
} else {
whil... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 10;
int N, A[MAX_N];
bool check(int sigma) {
static pair<int, int> stk[MAX_N];
int top = 0;
for (int i = 1; i <= N; i++) {
int delta = A[i] - A[i - 1];
if (delta > 0) {
stk[++top] = make_pair(1, delta);
} else {
whil... | [
"control_flow.branch.if.add"
] | 1,010,231 | 1,010,232 | u557835351 | cpp |
p03202 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include ... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include... | [] | 1,010,233 | 1,010,234 | u632353278 | cpp |
p03202 | #include <iostream>
#include <map>
#define lol(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define N 200010
ll n, a[N];
bool $(ll k) {
map<ll, ll> mas;
mas.clear();
lol(i, n - 1) {
if (a[i] < a[i + 1])
continue;
mas[a[i + 1]]++;
for (ll j = a[i + 1]; j > 0; j--)... | #include <iostream>
#include <map>
#define lol(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define N 200010
ll n, a[N];
bool $(ll k) {
map<ll, ll> mas;
mas.clear();
lol(i, n - 1) {
if (a[i] < a[i + 1])
continue;
mas[a[i + 1]]++;
for (ll j = a[i + 1]; j > 0; j--)... | [
"expression.operation.binary.add"
] | 1,010,235 | 1,010,236 | u924885571 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
void rd(int &x) {
int k, m = 0;
x = 0;
for (;;) {
k = getchar_unlocked();
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
x = k - '0';
break;
}
}
for (;;) {
k = getchar_unlocked();
if (k < '0' || k > ... | #include <bits/stdc++.h>
using namespace std;
void rd(int &x) {
int k, m = 0;
x = 0;
for (;;) {
k = getchar_unlocked();
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
x = k - '0';
break;
}
}
for (;;) {
k = getchar_unlocked();
if (k < '0' || k > ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,010,241 | 1,010,242 | u066369439 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
int INF = 1e9 + 7;
using ll = long long;
using P = pair<int, int>;
void normalize(vector<P> &tmp) {
if (tmp.size() == 1)
return;
if (tmp.back().first == tmp[tmp.size() - 2].first) {
tmp[tmp.size() - 2].second += tmp.back().second;
tmp.pop_back();
}
}
voi... | #include <bits/stdc++.h>
using namespace std;
int INF = 1e9 + 7;
using ll = long long;
using P = pair<int, int>;
void normalize(vector<P> &tmp) {
if (tmp.size() == 1)
return;
if (tmp.back().first == tmp[tmp.size() - 2].first) {
tmp[tmp.size() - 2].second += tmp.back().second;
tmp.pop_back();
}
}
voi... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"literal.number.change",
"call.arguments.change"
] | 1,010,245 | 1,010,246 | u410878763 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
void normalize(vector<P> &num) {
if (num.size() > 1) {
if (num.back().first == num[num.size() - 2].first) {
num[num.size() - 2].second += num.back().second;
num.pop_back();
}
}
}
void inc(vector<P> &num) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
void normalize(vector<P> &num) {
if (num.size() > 1) {
if (num.back().first == num[num.size() - 2].first) {
num[num.size() - 2].second += num.back().second;
num.pop_back();
}
}
}
void inc(vector<P> &num) ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,010,247 | 1,010,248 | u410878763 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 1,010,249 | 1,010,250 | u147305315 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 1,010,251 | 1,010,252 | u147305315 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 1,010,253 | 1,010,254 | u147305315 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
// HDU 627235
// USACO bc083db
// timus 251103FD
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define Forn(i, n) for (int i = 1; i <=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
// HDU 627235
// USACO bc083db
// timus 251103FD
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define Forn(i, n) for (int i = 1; i <=... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,255 | 1,010,256 | u683444125 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
// HDU 627235
// USACO bc083db
// timus 251103FD
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define Forn(i, n) for (int i = 1; i <=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
// HDU 627235
// USACO bc083db
// timus 251103FD
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define Forn(i, n) for (int i = 1; i <=... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,257 | 1,010,256 | u683444125 | cpp |
p03202 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int a[200005];
int b[200005];... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int a[200005];
int b[200005];... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,010,258 | 1,010,259 | u871933975 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(it, v) for (auto it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) me... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(it, v) for (auto it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) me... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,010,262 | 1,010,263 | u049262741 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
#define mod 998244353
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3fll
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
const int maxn = 2e5 + 10;
map<int, int> pos;
int n;
int a[maxn];
bool check(int mxnum) {
... | #include <bits/stdc++.h>
using namespace std;
#define mod 998244353
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3fll
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
const int maxn = 2e5 + 10;
map<int, int> pos;
int n;
int a[maxn];
bool check(int mxnum) {
... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 1,010,268 | 1,010,269 | u135208615 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
#define mod 998244353
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3fll
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
const int maxn = 2e5 + 10;
map<int, int> pos;
int n;
int a[maxn];
bool check(int mxnum) {
... | #include <bits/stdc++.h>
using namespace std;
#define mod 998244353
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3fll
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
const int maxn = 2e5 + 10;
map<int, int> pos;
int n;
int a[maxn];
bool check(int mxnum) {
... | [
"literal.number.change",
"control_flow.loop.condition.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,010,270 | 1,010,269 | u135208615 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
#define mod 998244353
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3fll
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
const int maxn = 2e5 + 10;
int n;
int A[maxn];
map<int, int> mp;
vector<int> ids, toe;
boo... | #include <bits/stdc++.h>
using namespace std;
#define mod 998244353
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3fll
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
const int maxn = 2e5 + 10;
int n;
int A[maxn];
map<int, int> mp;
vector<int> ids, toe;
boo... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,271 | 1,010,272 | u135208615 | cpp |
p03202 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <std... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <std... | [
"identifier.change"
] | 1,010,283 | 1,010,284 | u545022164 | cpp |
p03202 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#incl... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#incl... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,285 | 1,010,286 | u811004127 | cpp |
p03202 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#incl... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#incl... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,287 | 1,010,286 | u811004127 | cpp |
p03202 | #include <algorithm>
#include <array>
#include <assert.h>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_map>
#include <vector>
//#include <unordered_set>
//#include <boost/container/static_vector.hpp>
//#include <boost/unord... | #include <algorithm>
#include <array>
#include <assert.h>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_map>
#include <vector>
//#include <unordered_set>
//#include <boost/container/static_vector.hpp>
//#include <boost/unord... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,010,288 | 1,010,289 | u370768058 | cpp |
p03202 | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
#include <complex>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <deque>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <v... | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
#include <complex>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <deque>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <v... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,010,290 | 1,010,291 | u591343832 | cpp |
p03202 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | [
"call.function.change"
] | 1,010,292 | 1,010,293 | u915020369 | cpp |
p03202 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | [
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,010,294 | 1,010,293 | u915020369 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
//#define DEBUG_MODE
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(X) debug_func(X, #X)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout << "=================\n"
#else
#define DEBUG(X) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_LINE 0
#endif
#defin... | #include <bits/stdc++.h>
using namespace std;
//#define DEBUG_MODE
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(X) debug_func(X, #X)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout << "=================\n"
#else
#define DEBUG(X) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_LINE 0
#endif
#defin... | [
"call.remove"
] | 1,010,295 | 1,010,296 | u216962796 | cpp |
p03202 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const double EPS = 1e-10;
const ll INF = 100000000;
const ll MOD = 1000000007;
int n;
ll a[200000];
bool solve(int m) {
vector<P> v;
for (int i = 1; i < n; i++) {
if (a[i ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const double EPS = 1e-10;
const ll INF = 100000000;
const ll MOD = 1000000007;
int n;
ll a[200000];
bool solve(int m) {
vector<P> v;
for (int i = 1; i < n; i++) {
if (a[i ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,010,297 | 1,010,298 | u450494974 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
usi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
usi... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,010,302 | 1,010,303 | u591883167 | cpp |
p03202 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, A[200009];
bool solve(int M) {
vector<pair<int, int>> vec;
vec.push_back(make_pair(1, 0));
for (int i = 0; i < N; i++) {
if (vec[vec.size() - 1].first < A[i]) {
vec.push_back(make_pair(A[i], 1));
} else {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, A[200009];
bool solve(int M) {
vector<pair<int, int>> vec;
vec.push_back(make_pair(1, 0));
for (int i = 0; i < N; i++) {
if (vec[vec.size() - 1].first < A[i]) {
vec.push_back(make_pair(A[i], 1));
} else {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,010,306 | 1,010,307 | u504103417 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int n;
int a[200100];
int digit;
stack<i_i> now;
void printer() {
stack<i_i> sub;
while (!now.empty()) {
sub.push(now.top());... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int n;
int a[200100];
int digit;
stack<i_i> now;
void printer() {
stack<i_i> sub;
while (!now.empty()) {
sub.push(now.top());... | [
"expression.operation.binary.remove"
] | 1,010,308 | 1,010,309 | u980655160 | cpp |
p03202 | #include <cassert>
#include <cstdint>
#include <cstdio>
#include <tuple>
#include <utility>
#include <vector>
class language {
size_t sigma;
size_t length = 0;
std::vector<std::pair<size_t, size_t>> s; // {alpha, run}
void truncate_to(size_t next_len) {
assert(!s.empty());
size_t last = s.back().first... | #include <cassert>
#include <cstdint>
#include <cstdio>
#include <tuple>
#include <utility>
#include <vector>
class language {
size_t sigma;
size_t length = 0;
std::vector<std::pair<size_t, size_t>> s; // {alpha, run}
void truncate_to(size_t next_len) {
assert(!s.empty());
size_t last = s.back().first... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,310 | 1,010,311 | u352499693 | cpp |
p03202 | #include <bits/stdc++.h>
#define M 1000000000
using std::pair;
using std::stack;
using std::vector;
stack<pair<int, int>> Q;
int n;
int a[200020];
vector<int> V;
long long pow(int a, int pw) {
if (pw == 0)
return 1;
long long ans = pow(a, pw / 2);
if (ans == -1)
return -1;
ans = ans * ans;
if (ans >= ... | #include <bits/stdc++.h>
#define M 1000000000
using std::pair;
using std::stack;
using std::vector;
stack<pair<int, int>> Q;
int n;
int a[200020];
vector<int> V;
long long pow(int a, int pw) {
if (pw == 0)
return 1;
long long ans = pow(a, pw / 2);
if (ans == -1)
return -1;
ans = ans * ans;
if (ans >= ... | [
"expression.operation.binary.add"
] | 1,010,315 | 1,010,316 | u684617236 | cpp |
p03202 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
int a[300000];
class UnionFind {
public:
vector<int> par, sz;
public... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
int a[300000];
class UnionFind {
public:
vector<int> par, sz;
public... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,010,320 | 1,010,321 | u781091740 | cpp |
p03202 | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using i64 = long long int;
struct bl {
int first;
int last;
int... | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using i64 = long long int;
struct bl {
int first;
int last;
int... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 1,010,326 | 1,010,327 | u158253287 | cpp |
p03202 | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using i64 = long long int;
struct bl {
int first;
int last;
int... | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using i64 = long long int;
struct bl {
int first;
int last;
int... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,328 | 1,010,327 | u158253287 | cpp |
p03202 | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> P;
int N, a[200005];
vector<P> A; // firstの値がsecond個
void push(int x) { // a[i-1] < a[i]
if ((int)A.size() != 0 && A[(int)A.size() - 1].first == 1) {
A[(int)A.size() - 1].second += x;
return;
}
A.push_back(P(1,... | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> P;
int N, a[200005];
vector<P> A; // firstの値がsecond個
void push(int x) { // a[i-1] < a[i]
if ((int)A.size() != 0 && A[(int)A.size() - 1].first == 1) {
A[(int)A.size() - 1].second += x;
return;
}
A.push_back(P(1,... | [
"call.add"
] | 1,010,329 | 1,010,330 | u192912097 | cpp |
p03202 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#define N 200001
#define LL long long
#define LOG(x) cerr << #x << " = " << x << endl
#d... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#define N 200001
#define LL long long
#define LOG(x) cerr << #x << " = " << x << endl
#d... | [
"call.add"
] | 1,010,333 | 1,010,334 | u832435941 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 5;
int N;
int A[MAX];
bool check(int x) {
vector<pair<int, int>> S;
for (int i = 0; i < N - 1; i++) {
if (A[i + 1] > A[i]) {
continue;
}
if (x <= 1) {
return false;
}
int a = A[i + 1];
while (S.size() && (*(S... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 5;
int N;
int A[MAX];
bool check(int x) {
vector<pair<int, int>> S;
for (int i = 0; i < N - 1; i++) {
if (A[i + 1] > A[i]) {
continue;
}
if (x <= 1) {
return false;
}
int a = A[i + 1];
while (S.size() && (*(S... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 1,010,335 | 1,010,336 | u136901661 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 5;
int N;
int A[MAX];
bool check(int x) {
vector<pair<int, int>> S;
for (int i = 0; i < N - 1; i++) {
if (A[i + 1] > A[i]) {
continue;
}
if (x <= 1) {
return false;
}
int a = A[i + 1];
while (S.size() && (*(S... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 5;
int N;
int A[MAX];
bool check(int x) {
vector<pair<int, int>> S;
for (int i = 0; i < N - 1; i++) {
if (A[i + 1] > A[i]) {
continue;
}
if (x <= 1) {
return false;
}
int a = A[i + 1];
while (S.size() && (*(S... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,337 | 1,010,336 | u136901661 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 11;
int a[N], n;
int chk(int m) {
int i;
if (m == 1) {
for (i = 1; i < n; ++i)
if (a[i] >= a[i + 1])
return 0;
return 1;
}
map<int, int> f;
for (i = 2; i <= n; ++i)
if (a[i] < a[i - 1]) {
f.erase(f.upper_bound(a[... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 11;
int a[N], n;
int chk(int m) {
int i;
if (m == 1) {
for (i = 1; i < n; ++i)
if (a[i] >= a[i + 1])
return 0;
return 1;
}
map<int, int> f;
for (i = 2; i <= n; ++i)
if (a[i] <= a[i - 1]) {
f.erase(f.upper_bound(a... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,010,338 | 1,010,339 | u719994093 | cpp |
p03202 | #include <algorithm>
#include <iostream>
#include <map>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include <cstdio>
#include <queue>
#include <stack>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
#include <set>
using namespace std;
bool check(int n, const vector<int> &a, int m) {
map<... | #include <algorithm>
#include <iostream>
#include <map>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include <cstdio>
#include <queue>
#include <stack>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
#include <set>
using namespace std;
bool check(int n, const vector<int> &a, int m) {
map<... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,010,340 | 1,010,341 | u433133366 | cpp |
p03202 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | [
"identifier.change",
"call.arguments.change"
] | 1,010,342 | 1,010,343 | u579875569 | cpp |
p03202 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | [
"assignment.add"
] | 1,010,344 | 1,010,345 | u423143252 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 8;
int n, a[N], l, r, mid, v, q;
pair<int, int> k, z;
set<pair<int, int>> s;
bool is_val(int x) {
s.clear();
s.insert({0, 0});
for (int i = 1; i < n; i++) {
k = *s.rbegin();
if (a[i] > a[i - 1]) {
if (k.second != 0)
s.inser... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 8;
int n, a[N], l = -1, r, mid, v, q;
pair<int, int> k, z;
set<pair<int, int>> s;
bool is_val(int x) {
s.clear();
s.insert({0, 0});
for (int i = 1; i < n; i++) {
k = *s.rbegin();
if (a[i] > a[i - 1]) {
if (k.second != 0)
s.... | [
"variable_declaration.value.change"
] | 1,010,346 | 1,010,347 | u989469621 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define lg long long
#define db double
#define lb(x) ((x) & -(x))
#define ft first
#define sd second
#define HII cerr << "HI" << endl
#define LLLINE cerr << "@@@@@@@@@@@@@@@@@@@@" << endl
template <clas... | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define lg long long
#define db double
#define lb(x) ((x) & -(x))
#define ft first
#define sd second
#define HII cerr << "HI" << endl
#define LLLINE cerr << "@@@@@@@@@@@@@@@@@@@@" << endl
template <clas... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,010,348 | 1,010,349 | u236677506 | cpp |
p03202 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespa... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespa... | [
"expression.operation.binary.add"
] | 1,010,350 | 1,010,351 | u219786796 | cpp |
p03202 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define fi first
#define se second
#define int long long
using namespace... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define fi first
#define se second
#define int long long
using namespace... | [
"misc.opposites",
"function.return_value.change"
] | 1,010,352 | 1,010,353 | u852113235 | cpp |
p03202 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"call.function.change",
"control_flow.branch.if.add"
] | 1,010,354 | 1,010,355 | u507795624 | cpp |
p03202 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <vector>
#define MAXN 200005
#define MAXM
#define LL long long
#define LD long double
using namespace std;
int n, tag, a[MAXN];
map<int, int>::iterator it;
bool check(int mid) {
map<int, int> num;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <vector>
#define MAXN 200005
#define MAXM
#define LL long long
#define LD long double
using namespace std;
int n, tag, a[MAXN];
map<int, int>::iterator it;
bool check(int mid) {
map<int, int> num;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,010,364 | 1,010,365 | u229056063 | cpp |
p03202 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <vector>
#define MAXN 200005
#define MAXM
#define LL long long
#define LD long double
using namespace std;
int n, tag, a[MAXN];
map<int, int>::iterator it;
bool check(int mid) {
map<int, int> num;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <vector>
#define MAXN 200005
#define MAXM
#define LL long long
#define LD long double
using namespace std;
int n, tag, a[MAXN];
map<int, int>::iterator it;
bool check(int mid) {
map<int, int> num;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,366 | 1,010,365 | u229056063 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)(a); i <= (sign)(b); ++i)
#define Fordown(i, a, b) for (register sign i = (sign)(a); i >= (sign)(b); --i)
const int N = 2e5 + 5;
template <typename T> bool cmax(T &a, T b) { return (a ... | #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)(a); i <= (sign)(b); ++i)
#define Fordown(i, a, b) for (register sign i = (sign)(a); i >= (sign)(b); --i)
const int N = 2e5 + 5;
template <typename T> bool cmax(T &a, T b) { return (a ... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,010,367 | 1,010,368 | u332108407 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)(a); i <= (sign)(b); ++i)
#define Fordown(i, a, b) for (register sign i = (sign)(a); i >= (sign)(b); --i)
const int N = 2e5 + 5;
template <typename T> bool cmax(T &a, T b) { return (a ... | #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)(a); i <= (sign)(b); ++i)
#define Fordown(i, a, b) for (register sign i = (sign)(a); i >= (sign)(b); --i)
const int N = 2e5 + 5;
template <typename T> bool cmax(T &a, T b) { return (a ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 1,010,369 | 1,010,368 | u332108407 | cpp |
p03202 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
typedef pair<int, int> Pi;
typedef pair<long long, long long> P;
typedef pair<long long, P> PP;
typedef pair<P, P> PPP;
const long long MOD = 1e9 + 7;
const long long INF = 5e18;
const int di[4] = {1, 0, -1, 0};
const... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
typedef pair<int, int> Pi;
typedef pair<long long, long long> P;
typedef pair<long long, P> PP;
typedef pair<P, P> PPP;
const long long MOD = 1e9 + 7;
const long long INF = 5e18;
const int di[4] = {1, 0, -1, 0};
const... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,010,370 | 1,010,371 | u732285858 | cpp |
p03202 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
typedef pair<int, int> Pi;
typedef pair<long long, long long> P;
typedef pair<long long, P> PP;
typedef pair<P, P> PPP;
const long long MOD = 1e9 + 7;
const long long INF = 5e18;
const int di[4] = {1, 0, -1, 0};
const... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
typedef pair<int, int> Pi;
typedef pair<long long, long long> P;
typedef pair<long long, P> PP;
typedef pair<P, P> PPP;
const long long MOD = 1e9 + 7;
const long long INF = 5e18;
const int di[4] = {1, 0, -1, 0};
const... | [
"variable_declaration.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,010,372 | 1,010,371 | u732285858 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,373 | 1,010,374 | u759266806 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 7;
int n;
int a[N];
set<pair<int, int>> st;
int now;
void add(int ind, int c) {
if (!st.empty() && st.rbegin()->second == c)
return;
st.insert({ind, c});
}
void remove(int len) {
while (!st.empty() && st.rbegin()->firs... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 7;
int n;
int a[N];
set<pair<int, int>> st;
int now;
void add(int ind, int c) {
if (!st.empty() && st.rbegin()->second == c)
return;
st.insert({ind, c});
}
void remove(int len) {
while (!st.empty() && st.rbegin()->firs... | [
"expression.operation.binary.remove"
] | 1,010,375 | 1,010,376 | u680362152 | cpp |
p03202 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,379 | 1,010,380 | u093922224 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b);... | [
"control_flow.branch.if.condition.change"
] | 1,010,383 | 1,010,384 | u946322619 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> P;
#define REP(i, x, n) for (int i = x; i < n; ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SORT(x) sort((x).begin(), (x).... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> P;
#define REP(i, x, n) for (int i = x; i < n; ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SORT(x) sort((x).begin(), (x).... | [
"control_flow.branch.if.condition.change"
] | 1,010,392 | 1,010,393 | u895641117 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,010,422 | 1,010,423 | u344425917 | cpp |
p03215 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include ... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include ... | [
"literal.number.change",
"call.arguments.change"
] | 1,010,483 | 1,010,484 | u304121198 | cpp |
p03215 | // cf.cpp
#include <algorithm>
#include <bitset>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
#define mp make_pair
#define pb push_back
#define llc (long long)
#define pob pop_ba... | // cf.cpp
#include <algorithm>
#include <bitset>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
#define mp make_pair
#define pb push_back
#define llc (long long)
#define pob pop_ba... | [
"control_flow.branch.if.condition.change"
] | 1,010,497 | 1,010,498 | u768191406 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
int main() {
int_fast64_t N, K;
scanf("%ld%ld", &N, &K);
vector<int_fast64_t> a(N), v;
for (int_fast64_t i = 0; i < N; ++i) {
scanf("%ld", &a[i]);
for (int_fast64_t j = i, k(0); j >= 0; --j)
v.push_back(k += a[j]);
}
int_fast64_t k(0), m(0);
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int_fast64_t N, K;
scanf("%ld%ld", &N, &K);
vector<int_fast64_t> a(N), v;
for (int_fast64_t i = 0; i < N; ++i) {
scanf("%ld", &a[i]);
for (int_fast64_t j = i, k(0); j >= 0; --j)
v.push_back(k += a[j]);
}
int_fast64_t k(0), m(0);
for... | [
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change"
] | 1,010,504 | 1,010,503 | u462437857 | cpp |
p03215 | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (int i = 0; i < N; ++i)
typedef long long int LL;
int main() {
LL N, K;
in >> N >> K;
std::vector<LL> a(N + 1);
rep(i, N) in >> a[i + 1];
std::vector<LL> bits;
rep(i, N) a[i + 1] += a[i];
rep(i, N) {
for (int j ... | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (int i = 0; i < N; ++i)
typedef long long int LL;
int main() {
LL N, K;
in >> N >> K;
std::vector<LL> a(N + 1);
rep(i, N) in >> a[i + 1];
std::vector<LL> bits;
rep(i, N) a[i + 1] += a[i];
rep(i, N) {
for (int j ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,010,505 | 1,010,506 | u660613376 | cpp |
p03215 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define fi first
#define se second
signed main() {
int n, k, a[1009], MAX = 0, cnt[50] = {};
// r(i,64)cout<<((int)1<<i)<<endl;
cin >> n >> k;
r(i, ... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define fi first
#define se second
signed main() {
int n, k, a[1009], MAX = 0, cnt[50] = {};
// r(i,64)cout<<((int)1<<i)<<endl;
cin >> n >> k;
r(i, ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,010,534 | 1,010,535 | u777468981 | cpp |
p03215 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define fi first
#define se second
signed main() {
int n, k, a[1009], MAX = 0, cnt[50] = {};
cin >> n >> k;
r(i, n) cin >> a[i];
vector<int> v;
r... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define fi first
#define se second
signed main() {
int n, k, a[1009], MAX = 0, cnt[50] = {};
// r(i,64)cout<<((int)1<<i)<<endl;
cin >> n >> k;
r(i, ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,010,536 | 1,010,535 | u777468981 | cpp |
p03215 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define fi first
#define se second
signed main() {
int n, k, a[1009], MAX = 0, cnt[44] = {};
cin >> n >> k;
r(i, n) cin >> a[i];
vector<int> v;
r... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define fi first
#define se second
signed main() {
int n, k, a[1009], MAX = 0, cnt[50] = {};
// r(i,64)cout<<((int)1<<i)<<endl;
cin >> n >> k;
r(i, ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.change",
"assignment.value.change",
"identifi... | 1,010,537 | 1,010,535 | u777468981 | cpp |
p03215 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pa... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pa... | [
"call.remove"
] | 1,010,547 | 1,010,548 | u607034173 | cpp |
p03215 | /*+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...) \
{ ... | [
"variable_declaration.array_dimensions.change"
] | 1,010,558 | 1,010,559 | u275407061 | cpp |
p03215 | #include <bits/stdc++.h>
//#include <ext/rope>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define last(s) (s)[(int)((s).size()) - 1]
#define prelast(s) (s)[(int)((s).size()) - 2]
#define all(a) (a).begin(), (a).end()
#define ... | #include <bits/stdc++.h>
//#include <ext/rope>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define last(s) (s)[(int)((s).size()) - 1]
#define prelast(s) (s)[(int)((s).size()) - 2]
#define all(a) (a).begin(), (a).end()
#define ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,570 | 1,010,569 | u417480831 | cpp |
p03215 | #include <bits/stdc++.h>
//#include <ext/rope>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define last(s) (s)[(int)((s).size()) - 1]
#define prelast(s) (s)[(int)((s).size()) - 2]
#define all(a) (a).begin(), (a).end()
#define ... | #include <bits/stdc++.h>
//#include <ext/rope>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define last(s) (s)[(int)((s).size()) - 1]
#define prelast(s) (s)[(int)((s).size()) - 2]
#define all(a) (a).begin(), (a).end()
#define ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,571 | 1,010,569 | u417480831 | cpp |
p03215 | /* ---------- 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",
"control_flow.branch.if.condition.change"
] | 1,010,582 | 1,010,583 | u059727354 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define abs(a) max((a), -(a))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repe(i, n) rep(i, (n) + 1)
#define per(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define pere(i,... | #include <bits/stdc++.h>
using namespace std;
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define abs(a) max((a), -(a))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repe(i, n) rep(i, (n) + 1)
#define per(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define pere(i,... | [
"variable_declaration.type.change"
] | 1,010,598 | 1,010,599 | u405923605 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change"
] | 1,010,673 | 1,010,674 | u461336793 | cpp |
p03215 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
int K;
cin >> K;
ll a[N];
ll R[N + 1];
R[0] = 0;
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
R[i + 1] = R... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
int K;
cin >> K;
ll a[N];
ll R[N + 1];
R[0] = 0;
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
R[i + 1] = R... | [
"control_flow.branch.if.condition.change",
"literal.number.type.widen.change",
"expression.operation.binary.remove"
] | 1,010,675 | 1,010,676 | u083494782 | cpp |
p03215 | /*!enjoy karo yaar!*/
// CF,CC,AtC,SPOJ: hp1999
// HE: hemant269
// HR: hemant2132
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() \
ios::sync_with_stdio(0); \
... | /*!enjoy karo yaar!*/
// CF,CC,AtC,SPOJ: hp1999
// HE: hemant269
// HR: hemant2132
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() \
ios::sync_with_stdio(0); \
... | [] | 1,010,737 | 1,010,738 | u579670739 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
double ave = std::accumulate(a.begin(), a.end(), 0) / a.size();
int min_index = 0;
double min_va... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
double ave = (double)std::accumulate(a.begin(), a.end(), 0) / a.size();
int min_index = 0;
doubl... | [
"type_conversion.add"
] | 1,010,759 | 1,010,760 | u409344313 | cpp |
p03214 | // HTTF.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include "bits/stdc++.h"
//実装が重そうな問題はある程度考えてから書く
//初期化を忘れずに（特に二分探索とか）
//コーナーケースを考えて（特に場合分けとか）
//不可解すぎるバグは配列外参照（配列の長さ）を検討
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B, C) ... | // HTTF.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include "bits/stdc++.h"
//実装が重そうな問題はある程度考えてから書く
//初期化を忘れずに（特に二分探索とか）
//コーナーケースを考えて（特に場合分けとか）
//不可解すぎるバグは配列外参照（配列の長さ）を検討
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B, C) ... | [
"assignment.change"
] | 1,010,761 | 1,010,762 | u295617748 | cpp |
p03214 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int all;
int num = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
all += a[i];
}
int b = a[0] * n - all;
if (b < 0) {
b *= -1;
}
int c;
for (int i = 1; i < n; i++) {
c = a[i]... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int all = 0;
int num = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
all += a[i];
}
int b;
b = a[0] * n - all;
if (b < 0) {
b *= -1;
}
int c;
for (int i = 1; i < n; i++) {
... | [
"variable_declaration.value.change"
] | 1,010,763 | 1,010,764 | u028224916 | cpp |
p03214 | #include <complex>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n;
cin >> n;
vector<double> a(n);
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sum /= n;
double min = 10000;
int number = -1;
for (int i = 0; i < n; i++) {
if (a... | #include <complex>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n;
cin >> n;
vector<double> a(n);
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sum /= n;
double min = 10000;
int number = -1;
for (int i = 0; i < n; i++) {
if (a... | [
"call.add",
"call.arguments.change"
] | 1,010,765 | 1,010,766 | u376082984 | cpp |
p03214 | #include <complex>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n;
cin >> n;
vector<double> a(n);
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sum /= n;
double min = 100;
int number = -1;
for (int i = 0; i < n; i++) {
if (abs... | #include <complex>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n;
cin >> n;
vector<double> a(n);
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sum /= n;
double min = 10000;
int number = -1;
for (int i = 0; i < n; i++) {
if (a... | [
"literal.number.change",
"variable_declaration.value.change",
"call.add",
"call.arguments.change"
] | 1,010,767 | 1,010,766 | u376082984 | cpp |
p03214 |
#include "cstdlib"
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
double mean = 0;
vector<int> a(N);
for (int i = 0; i < N; i++) {
int temp;
cin >> temp;
a[i] = temp;
mean +... | #include "cstdlib"
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
double mean = 0;
vector<int> a(N);
for (int i = 0; i < N; i++) {
int temp;
cin >> temp;
a[i] = temp;
mean +=... | [
"variable_declaration.type.primitive.change"
] | 1,010,768 | 1,010,769 | u324139341 | cpp |
p03214 | #include "cstdlib"
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
double mean = 0;
vector<int> a(N);
for (int i = 0; i < N; i++) {
int temp;
cin >> temp;
a[i] = temp;
mean +=... | #include "cstdlib"
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
double mean = 0;
vector<int> a(N);
for (int i = 0; i < N; i++) {
int temp;
cin >> temp;
a[i] = temp;
mean +=... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,010,770 | 1,010,769 | u324139341 | cpp |
p03214 | #include "cstdlib"
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
double mean = 0;
vector<int> a(N);
for (int i = 0; i < N; i++) {
int temp;
cin >> temp;
a[i] = temp;
mean +=... | #include "cstdlib"
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
double mean = 0;
vector<int> a(N);
for (int i = 0; i < N; i++) {
int temp;
cin >> temp;
a[i] = temp;
mean +=... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,010,771 | 1,010,769 | u324139341 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
sum += a.at(i);
}
double ave = sum / n;
double ans = 0, tmp = 100;
for (int i = 0; i < n; i++) {
if (abs(ave - a.at(i)) < tmp) {
ans = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, sum = 0;
cin >> n;
vector<double> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
sum += a.at(i);
}
double ave = sum / n;
double ans = 0, tmp = 100;
for (int i = 0; i < n; i++) {
if (abs(ave - a.at(i)) < tmp) {
... | [
"variable_declaration.type.primitive.change"
] | 1,010,774 | 1,010,775 | u392423112 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
sum += a.at(i);
}
int ave = sum / n;
int ans = 0, tmp = 100;
for (int i = 0; i < n; i++) {
if (abs(ave - a.at(i)) < tmp) {
ans = i;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, sum = 0;
cin >> n;
vector<double> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
sum += a.at(i);
}
double ave = sum / n;
double ans = 0, tmp = 100;
for (int i = 0; i < n; i++) {
if (abs(ave - a.at(i)) < tmp) {
... | [
"variable_declaration.type.primitive.change"
] | 1,010,776 | 1,010,775 | u392423112 | cpp |
p03214 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int a[105];
int main() {
int n, ave = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
ave += a[i];
}
ave /= n;
int ans = 0;
for (int i = 1; i < n; i++)
if (abs(a[i] - ave) < abs(a[ans] - ave))
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
double a[105];
int main() {
int n;
double ave = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lf", &a[i]);
ave += a[i];
}
ave /= n;
// printf("%lf\n",ave);
int ans = 0;
for (int i = 1; i < n; i++)
if (f... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,010,777 | 1,010,778 | u419776337 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a[110];
cin >> n;
double ave = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
float x = n;
ave /= x;
int minn = 1e9;
int ans = 0;
for (int i = 0; i < n; i+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a[110];
cin >> n;
double ave = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
double x = n;
ave /= x;
double minn = 1e9;
int ans = 0;
for (int i = 0; i < n... | [
"variable_declaration.type.primitive.change"
] | 1,010,781 | 1,010,782 | u261868146 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.