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 |
|---|---|---|---|---|---|---|---|
p03688 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,359,517 | 1,359,518 | u190018920 | cpp |
p03688 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
template <class S, class T> inline S min_L(S a, T b) { return a <= b ? a : b; }
template <class S, class T> inline S max_L(S a, T b) { return a >= b ? a : b; }
inline void rd(int &x) {
int k;
int m = 0;
x = 0;
for (;;) {
k = getchar... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
template <class S, class T> inline S min_L(S a, T b) { return a <= b ? a : b; }
template <class S, class T> inline S max_L(S a, T b) { return a >= b ? a : b; }
inline void rd(int &x) {
int k;
int m = 0;
x = 0;
for (;;) {
k = getchar... | [
"control_flow.branch.if.condition.change"
] | 1,359,524 | 1,359,525 | u066369439 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
int N;
cin >> N;
map<int, int> a;
rep(i, N) {
int tmp;
cin >> tmp;
a[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
int N;
cin >> N;
map<int, int> a;
rep(i, N) {
int tmp;
cin >> tmp;
a[... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,530 | 1,359,531 | u680707192 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
int N;
cin >> N;
map<int, int> a;
rep(i, N) {
int tmp;
cin >> tmp;
a[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
int N;
cin >> N;
map<int, int> a;
rep(i, N) {
int tmp;
cin >> tmp;
a[... | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,532 | 1,359,531 | u680707192 | cpp |
p03688 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,359,536 | 1,359,537 | u756088996 | cpp |
p03688 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,359,538 | 1,359,537 | u756088996 | cpp |
p03688 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,359,539 | 1,359,537 | u756088996 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int mn = a[0], mx = a[0];
for (int i = 1; i < n; i++) {
mn = min(mn, a[i]);
mx = max... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int mn = a[0], mx = a[0];
for (int i = 1; i < n; i++) {
mn = min(mn, a[i]);
mx = max... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,540 | 1,359,541 | u168698471 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int mn = a[0], mx = a[0];
for (int i = 1; i < n; i++) {
mn = min(mn, a[i]);
mx = max... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int mn = a[0], mx = a[0];
for (int i = 1; i < n; i++) {
mn = min(mn, a[i]);
mx = max... | [
"control_flow.branch.if.condition.change"
] | 1,359,542 | 1,359,541 | u168698471 | cpp |
p03688 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,359,543 | 1,359,544 | u783675879 | cpp |
p03688 | /// supercalifragilisticexpialidocious.
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | /// supercalifragilisticexpialidocious.
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | [
"control_flow.branch.if.condition.change"
] | 1,359,547 | 1,359,548 | u983079208 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(), V.end()
#define ll long long
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(all(A));
if (A[N - 1] - A[0] > 1) {
cout << "No" << endl;
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(), V.end()
#define ll long long
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(all(A));
if (A[N - 1] - A[0] > 1) {
cout << "No" << endl;
return 0;
}... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,550 | 1,359,551 | u045811375 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 * 1000 + 23;
int n, a[MAXN];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int mx = *max_element(a, a + n), mn = *min_element(a, a + n),
x = count(a, a + n, mx), y = count(a, a + n, mn);
if (mx - mn > 1)
retur... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 * 1000 + 23;
int n, a[MAXN];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int mx = *max_element(a, a + n), mn = *min_element(a, a + n),
x = count(a, a + n, mx), y = count(a, a + n, mn);
if (mx - mn > 1)
retur... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,552 | 1,359,553 | u596342425 | cpp |
p03688 | #include <iostream>
using namespace std;
int n, mn, mx, mn_count, mx_count;
int a;
int main() {
mn_count = mx_count = 0;
mn = 2000 * 1000 * 1000;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a > mx) {
mx = a;
mx_count = 0;
}
if (a < mn) {
mn = a;
mn_count = 0;... | #include <iostream>
using namespace std;
int n, mn, mx, mn_count, mx_count;
int a;
int main() {
mn_count = mx_count = 0;
mn = 2000 * 1000 * 1000;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a > mx) {
mx = a;
mx_count = 0;
}
if (a < mn) {
mn = a;
mn_count = 0;... | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,359,554 | 1,359,555 | u699904147 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
bool solve() {
int N, a;
cin >> N;
map<int, int> A;
for (int i = 0; i < N; i++) {
cin >> a;
A[a]++;
}
if (A.size() == 1) {
int k = A.begin()->first;
if (k == N - 1)
return true;
if (2 * k <= N)
return true;
return false;
} ... | #include <bits/stdc++.h>
using namespace std;
bool solve() {
int N, a;
cin >> N;
map<int, int> A;
for (int i = 0; i < N; i++) {
cin >> a;
A[a]++;
}
if (A.size() == 1) {
int k = A.begin()->first;
if (k == N - 1)
return true;
if (2 * k <= N)
return true;
return false;
} ... | [
"control_flow.return.add"
] | 1,359,556 | 1,359,557 | u930841425 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
// tourist set
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 <typ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
// tourist set
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 <typ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,359,558 | 1,359,559 | u432688695 | cpp |
p03688 | // こういう問題が解けるようになる気がしない
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int k = *max_element(a.begin(), a.end());
int l = *min_element(a.begin(), a.end());
string ans;
if (k - l ... | // こういう問題が解けるようになる気がしない
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int k = *max_element(a.begin(), a.end());
int l = *min_element(a.begin(), a.end());
string ans;
if (k - l ... | [
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change"
] | 1,359,567 | 1,359,568 | u734519000 | cpp |
p03688 | // こういう問題が解けるようになる気がしない
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int k = *max_element(a.begin(), a.end());
int l = *min_element(a.begin(), a.end());
string ans;
if (k - l ... | // こういう問題が解けるようになる気がしない
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int k = *max_element(a.begin(), a.end());
int l = *min_element(a.begin(), a.end());
string ans;
if (k - l ... | [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,569 | 1,359,568 | u734519000 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n);
bool same = 1;
ll mx = 0;
rep(i, n) {
cin >> a[i];
mx = max(mx, a[i]);
}
rep(i, n - 1) if (a[i] != a[i + 1]) same = 0;
if (same)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n);
bool same = 1;
ll mx = 0;
rep(i, n) {
cin >> a[i];
mx = max(mx, a[i]);
}
rep(i, n - 1) if (a[i] != a[i + 1]) same = 0;
if (same)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,359,570 | 1,359,571 | u419307948 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
tem... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
tem... | [
"control_flow.branch.if.condition.change"
] | 1,359,572 | 1,359,573 | u334351654 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
tem... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
tem... | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,574 | 1,359,573 | u334351654 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[n - 1] - a[0] > 1) {
cout << "No\n";
} else if (a[n - 1] - a[0] == 0)... | /*input
5
1 1 1 2 2
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[n - 1] - a[0] > 1) {
cout << "No\n";
} else i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,577 | 1,359,578 | u387147192 | cpp |
p03688 |
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
int num = 1;
int group = 0;
int mode = 0;
bool sw = false;
for (int i = 0; i < n; ++i) {
int tmp;
std::cin >> tmp;
if (sw)
break;
switch (mode) {
case 0:
group = tmp;
++mode;
break;
c... |
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
int num = 1;
int group = 0;
int mode = 0;
bool sw = false;
for (int i = 0; i < n; ++i) {
int tmp;
std::cin >> tmp;
if (sw)
break;
switch (mode) {
case 0:
group = tmp;
++mode;
break;
c... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,359,579 | 1,359,580 | u331630877 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
vector<int> a(N);
REP(i, N) { cin >> a[i]; }
sort(a.begin(), a.end());
int smallCount = 0;
int bigCount = 0;
for (int i = 1; i < N; i++) {
if (a[i] != a[i - 1]) {
smallCou... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
vector<int> a(N);
REP(i, N) { cin >> a[i]; }
sort(a.begin(), a.end());
int smallCount = 0;
int bigCount = 0;
for (int i = 1; i < N; i++) {
if (a[i] != a[i - 1]) {
smallCou... | [
"control_flow.branch.if.condition.change"
] | 1,359,581 | 1,359,582 | u951672936 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
long long b = a[0];
long long c = a[0];
for (int i = 1; i < N; i++) {
if (b < a[i]) {
b = a[i];
}
if (c > a[i]) {
c = a[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
long long b = a[0];
long long c = a[0];
for (int i = 1; i < N; i++) {
if (b < a[i]) {
b = a[i];
}
if (c > a[i]) {
c = a[i];
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,583 | 1,359,584 | u279032855 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <vector>
#define le... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <vector>
#define le... | [
"expression.operation.binary.add"
] | 1,359,589 | 1,359,590 | u146975530 | cpp |
p03688 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vecto... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vecto... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.remove"
] | 1,359,591 | 1,359,592 | u077337864 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n];
int m = 1e9;
int M = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
m = min(m, a[i]);
M = max(M, a[i]);
}
int c[n] = {};
if (M - m > ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n];
int m = 1e9;
int M = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
m = min(m, a[i]);
M = max(M, a[i]);
}
int c[n] = {};
if (M - m > ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,593 | 1,359,594 | u676029460 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | [
"variable_declaration.value.change"
] | 1,359,595 | 1,359,596 | u721367699 | cpp |
p03688 | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define ... | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,603 | 1,359,604 | u218842729 | cpp |
p03688 | #include <bits/stdc++.h>
#define Fst first
#define Snd second
#define RG register
#define mp make_pair
#define mem(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int UI;
typedef unsigned long long ULL;
template <typename T> inline void read(T &x) {
ch... | #include <bits/stdc++.h>
#define Fst first
#define Snd second
#define RG register
#define mp make_pair
#define mem(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int UI;
typedef unsigned long long ULL;
template <typename T> inline void read(T &x) {
ch... | [
"control_flow.branch.if.condition.change"
] | 1,359,609 | 1,359,610 | u065333757 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define st(arr, a) memset(arr, a, sizeof arr)
#define nl cout << endl
#define real signed
#define endl '\n'
#define bitcount(x) __builtin_popcountll(x)
const int MOD = 1000000007ll;
#define forn(i, a, b) for (i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define st(arr, a) memset(arr, a, sizeof arr)
#define nl cout << endl
#define real signed
#define endl '\n'
#define bitcount(x) __builtin_popcountll(x)
const int MOD = 1000000007ll;
#define forn(i, a, b) for (i... | [
"control_flow.branch.if.condition.change"
] | 1,359,611 | 1,359,612 | u782238920 | cpp |
p03688 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
ty... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
ty... | [
"control_flow.branch.if.condition.change"
] | 1,359,613 | 1,359,614 | u004342119 | cpp |
p03688 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
ty... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
ty... | [
"control_flow.branch.if.condition.change"
] | 1,359,615 | 1,359,614 | u004342119 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
bool solve() {
int N;
cin >> N;
int a = 0, b = 0;
map<int, int> m;
for (int i = 0; i < N; i++) {
int t;
cin >> t;
m[t]++;
if (a)
b = t;
else
a = t;
}
if (m.size() > 2)
return false;
if (m.size() == 1) {
if (a == N - ... | #include <bits/stdc++.h>
using namespace std;
bool solve() {
int N;
cin >> N;
int a = 0, b = 0;
map<int, int> m;
for (int i = 0; i < N; i++) {
int t;
cin >> t;
m[t]++;
if (a && a != t)
b = t;
else
a = t;
}
if (m.size() > 2)
return false;
if (m.size() == 1) {
if ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,359,616 | 1,359,617 | u946322619 | cpp |
p03688 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real =... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,618 | 1,359,619 | u876978301 | cpp |
p03688 | #include <cstdio>
#include <iostream>
int inf = 1e9;
int main() {
int n;
scanf("%d", &n);
int m1 = inf, m2 = inf, s1 = 0, s2 = 0;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (x < m1) {
if (m2 != inf)
return 0 * puts("No");
m2 = m1;
s2 = s1;
m1 = x;
... | #include <cstdio>
#include <iostream>
int inf = 1e9;
int main() {
int n;
scanf("%d", &n);
int m1 = inf, m2 = inf, s1 = 0, s2 = 0;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (x < m1) {
if (m2 != inf)
return 0 * puts("No");
m2 = m1;
s2 = s1;
m1 = x;
... | [
"control_flow.branch.if.condition.change"
] | 1,359,620 | 1,359,621 | u220632857 | cpp |
p03688 | #include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
const int N = 1e5 + 5;
int n, nval, xval, val[N];
inline int nxi() {
int x = 0;
char c;
while (((c = getchar()) > '9' || c < '0') && c != '-')
;
const bool f = (c == '-') && (c = getchar());
while (x = x * 10 - 48 + c, (c = getch... | #include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
const int N = 1e5 + 5;
int n, nval, xval, val[N];
inline int nxi() {
int x = 0;
char c;
while (((c = getchar()) > '9' || c < '0') && c != '-')
;
const bool f = (c == '-') && (c = getchar());
while (x = x * 10 - 48 + c, (c = getch... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,359,622 | 1,359,623 | u379976159 | cpp |
p03688 | #if 1
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int long long
#define uint unsi... | #if 1
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int long long
#define uint unsi... | [
"control_flow.branch.if.condition.change"
] | 1,359,624 | 1,359,625 | u154068540 | cpp |
p03686 | #include <algorithm>
#include <cstdio>
#include <queue>
using namespace std;
#define Maxn 200000
int tmp[Maxn + 5];
struct Person {
int l, r;
friend bool operator<(Person p, Person q) {
if (p.l == q.l) {
return p.r < q.r;
}
return p.l < q.l;
}
} a[Maxn + 5];
priority_queue<int, vector<int>, grea... | #include <algorithm>
#include <cstdio>
#include <queue>
using namespace std;
#define Maxn 200000
int tmp[Maxn + 5];
struct Person {
int l, r;
friend bool operator<(Person p, Person q) {
if (p.l == q.l) {
return p.r < q.r;
}
return p.l < q.l;
}
} a[Maxn + 5];
priority_queue<int, vector<int>, grea... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,359,807 | 1,359,808 | u410132794 | cpp |
p03686 | #include <algorithm>
#include <cstdio>
#include <queue>
using namespace std;
#define Maxn 200000
int tmp[Maxn + 5];
struct Person {
int l, r;
friend bool operator<(Person p, Person q) {
if (p.l == q.l) {
return p.r < q.r;
}
return p.l < q.l;
}
} a[Maxn + 5];
priority_queue<int, vector<int>, grea... | #include <algorithm>
#include <cstdio>
#include <queue>
using namespace std;
#define Maxn 200000
int tmp[Maxn + 5];
struct Person {
int l, r;
friend bool operator<(Person p, Person q) {
if (p.l == q.l) {
return p.r < q.r;
}
return p.l < q.l;
}
} a[Maxn + 5];
priority_queue<int, vector<int>, grea... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,359,809 | 1,359,808 | u410132794 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
.........
`;!!!!!!!!!;;;;;;;;::::::'''''''``''''''''````````````````````....`:;;;;;:'.....`:|$$$$$$$|;;;:`.
..........`''``...`''``. ........ ... ... .... ... ... '
........
'!!!!!!!!!;;;;;;;:::::::::''''':::'... | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
.........
`;!!!!!!!!!;;;;;;;;::::::'''''''``''''''''````````````````````....`:;;;;;:'.....`:|$$$$$$$|;;;:`.
..........`''``...`''``. ........ ... ... .... ... ... '
........
'!!!!!!!!!;;;;;;;:::::::::''''':::'... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,359,810 | 1,359,811 | u545001286 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
.........
`;!!!!!!!!!;;;;;;;;::::::'''''''``''''''''````````````````````....`:;;;;;:'.....`:|$$$$$$$|;;;:`.
..........`''``...`''``. ........ ... ... .... ... ... '
........
'!!!!!!!!!;;;;;;;:::::::::''''':::'... | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
.........
`;!!!!!!!!!;;;;;;;;::::::'''''''``''''''''````````````````````....`:;;;;;:'.....`:|$$$$$$$|;;;:`.
..........`''``...`''``. ........ ... ... .... ... ... '
........
'!!!!!!!!!;;;;;;;:::::::::''''':::'... | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,359,812 | 1,359,811 | u545001286 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
.........
`;!!!!!!!!!;;;;;;;;::::::'''''''``''''''''````````````````````....`:;;;;;:'.....`:|$$$$$$$|;;;:`.
..........`''``...`''``. ........ ... ... .... ... ... '
........
'!!!!!!!!!;;;;;;;:::::::::''''':::'... | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
.........
`;!!!!!!!!!;;;;;;;;::::::'''''''``''''''''````````````````````....`:;;;;;:'.....`:|$$$$$$$|;;;:`.
..........`''``...`''``. ........ ... ... .... ... ... '
........
'!!!!!!!!!;;;;;;;:::::::::''''':::'... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,359,813 | 1,359,811 | u545001286 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef double db;
typedef long long ll;
typedef pair<int, int> P;
const int MAXN = 2e5 + 10;
vector<int> p[MAXN];
int n, m;
#define mid ((l + r) >> 1)
#define ls k << 1
#define rs k << 1 | 1
#define lc k << 1, l, mid
... | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef double db;
typedef long long ll;
typedef pair<int, int> P;
const int MAXN = 2e5 + 10;
vector<int> p[MAXN];
int n, m;
#define mid ((l + r) >> 1)
#define ls k << 1
#define rs k << 1 | 1
#define lc k << 1, l, mid
... | [
"expression.operation.binary.add"
] | 1,359,828 | 1,359,829 | u182914272 | cpp |
p03686 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef unsigne... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef unsigne... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,359,830 | 1,359,831 | u955723966 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
const int MAXT = 530000;
using lint = long long;
using pi = pair<int, int>;
const int mod = 1e9 + 7;
int n, m;
pi a[MAXN];
struct seg {
int tree[MAXT], lazy[MAXT];
void lazydown(int p) {
tree[2 * p] += lazy[p];
tree[2 * p + 1] += lazy[p... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
const int MAXT = 530000;
using lint = long long;
using pi = pair<int, int>;
const int mod = 1e9 + 7;
int n, m;
pi a[MAXN];
struct seg {
int tree[MAXT], lazy[MAXT];
void lazydown(int p) {
tree[2 * p] += lazy[p];
tree[2 * p + 1] += lazy[p... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,359,836 | 1,359,837 | u329802369 | cpp |
p03686 | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#inclu... | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#inclu... | [
"expression.operation.binary.remove"
] | 1,359,844 | 1,359,845 | u468700753 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
const int N = 200010;
struct data {
int l, r;
bool operator<(const data &b) const { return l == b.l ? r > b.r : l < b.l; }
} x[N];
int a[N];
bool cmp(int a, int b) { return a > b; }
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
... | #include <bits/stdc++.h>
using namespace std;
const int N = 200010;
struct data {
int l, r;
bool operator<(const data &b) const { return l == b.l ? r > b.r : l < b.l; }
} x[N];
int a[N];
bool cmp(int a, int b) { return a > b; }
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,852 | 1,359,853 | u653602630 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,359,858 | 1,359,859 | u742529680 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,359,860 | 1,359,859 | u742529680 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
int n, m, ans;
int tag[maxn * 4], mx[maxn * 4];
pair<int, int> a[maxn];
void pushdown(int x) {
if (tag[x]) {
tag[x << 1] += tag[x];
tag[x << 1 | 1] += tag[x];
mx[x << 1] += tag[x];
mx[x << 1 | 1] += tag[x];
tag[x] = 0;
}
}
i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
int n, m, ans;
int tag[maxn * 4], mx[maxn * 4];
pair<int, int> a[maxn];
void pushdown(int x) {
if (tag[x]) {
tag[x << 1] += tag[x];
tag[x << 1 | 1] += tag[x];
mx[x << 1] += tag[x];
mx[x << 1 | 1] += tag[x];
tag[x] = 0;
}
}
i... | [
"assignment.change"
] | 1,359,870 | 1,359,871 | u321555339 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MX = 200020;
int N, M;
vector<pii> seg;
struct BIT {
vector<int> tree, lazy;
void init() {
tree = vector<int>(4 * MX, 0);
lazy = vector<int>(4 * MX, 0);
}
void prop(int l, int r, int n) {
if (l != r) {
tree[2... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MX = 200020;
int N, M;
vector<pii> seg;
struct BIT {
vector<int> tree, lazy;
void init() {
tree = vector<int>(4 * MX, 0);
lazy = vector<int>(4 * MX, 0);
}
void prop(int l, int r, int n) {
if (l != r) {
tree[2... | [
"call.add",
"call.arguments.add"
] | 1,359,890 | 1,359,891 | u333877810 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MX = 200020;
int N, M;
vector<pii> seg;
struct BIT {
vector<int> tree, lazy;
void init() {
tree = vector<int>(4 * MX, 0);
lazy = vector<int>(4 * MX, 0);
}
void prop(int l, int r, int n) {
if (l != r) {
tree[2... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MX = 200020;
int N, M;
vector<pii> seg;
struct BIT {
vector<int> tree, lazy;
void init() {
tree = vector<int>(4 * MX, 0);
lazy = vector<int>(4 * MX, 0);
}
void prop(int l, int r, int n) {
if (l != r) {
tree[2... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 1,359,892 | 1,359,891 | u333877810 | cpp |
p03686 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#define MAXN 200010
using namespace std;
int n, m;
pair<int, int> a[MAXN];
priority_queue<int> S1, S2;
int main() {
#ifdef DEBUG
freopen("F.in", "r", stdin);
#endif
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d%d", ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#define MAXN 200010
using namespace std;
int n, m;
pair<int, int> a[MAXN];
priority_queue<int> S1, S2;
int main() {
#ifdef DEBUG
freopen("F.in", "r", stdin);
#endif
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d%d", ... | [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change"
] | 1,359,897 | 1,359,898 | u568200549 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 1 << 19;
const int INF = 1 << 28;
const int def = -INF;
struct MaxSegTree2 {
int n;
ll segMax[2 * MAX_N - 1], segAdd[2 * MAX_N - 1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 1 << 19;
const int INF = 1 << 28;
const int def = -INF;
struct MaxSegTree2 {
int n;
ll segMax[2 * MAX_N - 1], segAdd[2 * MAX_N - 1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n... | [
"control_flow.loop.for.initializer.change"
] | 1,359,903 | 1,359,904 | u815524843 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define mk(a, b) make_pair(a, b)
typedef pair<int, int> pii;
int N, M, N_;
pii taka[200020];
pii seg[1600020];
void init() {
N_ = 1;
while (N_ < M + 2)
N_ *= 2;
for (int i = 0; i < N * 2 - 1; i++)
seg[i] = mk(0, 0);
ret... | #include <bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define mk(a, b) make_pair(a, b)
typedef pair<int, int> pii;
int N, M, N_;
pii taka[200020];
pii seg[1600020];
void init() {
N_ = 1;
while (N_ < M + 2)
N_ *= 2;
for (int i = 0; i < N * 2 - 1; i++)
seg[i] = mk(0, 0);
ret... | [
"expression.operation.binary.remove"
] | 1,359,910 | 1,359,911 | u205655980 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define mk(a, b) make_pair(a, b)
typedef pair<int, int> pii;
int N, M, N_;
pii taka[200020];
pii seg[800020];
void init() {
N_ = 1;
while (N_ < M + 2)
N_ *= 2;
for (int i = 0; i < N * 2 - 1; i++)
seg[i] = mk(0, 0);
retu... | #include <bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define mk(a, b) make_pair(a, b)
typedef pair<int, int> pii;
int N, M, N_;
pii taka[200020];
pii seg[1600020];
void init() {
N_ = 1;
while (N_ < M + 2)
N_ *= 2;
for (int i = 0; i < N * 2 - 1; i++)
seg[i] = mk(0, 0);
ret... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 1,359,912 | 1,359,911 | u205655980 | cpp |
p03686 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + (ll)b) % mod
#define MUL(a, b) a = (a * (ll)b) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rer(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) (a).begin(), (a).end()
#define se... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + (ll)b) % mod
#define MUL(a, b) a = (a * (ll)b) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rer(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) (a).begin(), (a).end()
#define se... | [
"expression.operation.binary.add"
] | 1,359,918 | 1,359,919 | u491153752 | cpp |
p03686 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + (ll)b) % mod
#define MUL(a, b) a = (a * (ll)b) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rer(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) (a).begin(), (a).end()
#define se... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + (ll)b) % mod
#define MUL(a, b) a = (a * (ll)b) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rer(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) (a).begin(), (a).end()
#define se... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,359,920 | 1,359,919 | u491153752 | cpp |
p03686 | // arc076 F
// by Cydiater
// 2017.6.30
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define up(i, j, n) for (int i = j; i <= n; i++)
#define down(i, j, n) for (int i = j; i >= n; i--)
#define cmax(a, b) a = max(a, b)
#define cmin(a, b) a = min(a, b)
#define SZ(x) (int)x.size()
const int MAXN =... | // arc076 F
// by Cydiater
// 2017.6.30
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define up(i, j, n) for (int i = j; i <= n; i++)
#define down(i, j, n) for (int i = j; i >= n; i--)
#define cmax(a, b) a = max(a, b)
#define cmin(a, b) a = min(a, b)
#define SZ(x) (int)x.size()
const int MAXN =... | [
"literal.number.change",
"call.arguments.change"
] | 1,359,921 | 1,359,922 | u220113889 | cpp |
p03686 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <sys/time.h>
#include... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <sys/time.h>
#include... | [
"call.add",
"call.arguments.change"
] | 1,359,926 | 1,359,932 | u441096482 | cpp |
p03686 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <sys/time.h>
#include... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <sys/time.h>
#include... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change",
"assignment.value.change"
] | 1,359,937 | 1,359,932 | u441096482 | cpp |
p03686 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, x, n) for (int i = x; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(X) (X).begin(), (X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
type... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, x, n) for (int i = x; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(X) (X).begin(), (X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
type... | [
"control_flow.branch.if.condition.change"
] | 1,359,945 | 1,359,946 | u703805376 | cpp |
p03686 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
//---------------------------------------------------------------------------------------------------
template <... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
//---------------------------------------------------------------------------------------------------
template <... | [
"literal.number.change",
"assignment.value.change"
] | 1,359,951 | 1,359,952 | u141378465 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
typedef long long LL;
typedef pair<LL, LL> P;
const LL MAX_N = ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
typedef long long LL;
typedef pair<LL, LL> P;
const LL MAX_N = ... | [
"expression.unary.arithmetic.remove",
"expression.unary.arithmetic.add"
] | 1,359,956 | 1,359,957 | u723297297 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, m, it[4 * N], lazy[4 * N];
vector<int> go[N];
void build(int i, int l, int r) {
if (l == r) {
it[i] = l - m;
return;
}
int mid = (l + r) >> 1;
build(i << 1, l, mid);
build(i << 1 | 1, mid + 1, r);
it[i] = max(it[i << 1], i... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, m, it[4 * N], lazy[4 * N];
vector<int> go[N];
void build(int i, int l, int r) {
if (l == r) {
it[i] = l - m;
return;
}
int mid = (l + r) >> 1;
build(i << 1, l, mid);
build(i << 1 | 1, mid + 1, r);
it[i] = max(it[i << 1], i... | [
"assignment.change"
] | 1,359,960 | 1,359,961 | u405500492 | cpp |
p03686 |
#include <bits/stdc++.h>
using namespace std;
int n;
int m;
#define MAX 200002
vector<pair<int, int>> v;
bool cmp(pair<int, int> a, pair<int, int> b) { return a.first > b.first; }
deque<int> d;
int L() {
for (int i = 0; i < v.size(); i++) {
d.push_back(v[i].first);
}
sort(d.begin(), d.end());
int siz =... |
#include <bits/stdc++.h>
using namespace std;
int n;
int m;
#define MAX 200002
vector<pair<int, int>> v;
bool cmp(pair<int, int> a, pair<int, int> b) { return a.first > b.first; }
deque<int> d;
int L() {
for (int i = 0; i < v.size(); i++) {
d.push_back(v[i].first);
}
sort(d.begin(), d.end());
int siz =... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,359,966 | 1,359,967 | u466917094 | cpp |
p03686 | #include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll inf = 1e18;
ll n, m, mx, cr, ans;
pll a[200005];
vector<ll> s[200005];
priority_queue<ll> pq, pp;
struct segtree {
ll val[888888], lazy[888888];
void lazydown(ll P) {
val[2 ... | #include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll inf = 1e18;
ll n, m, mx, cr, ans;
pll a[200005];
vector<ll> s[200005];
priority_queue<ll> pq, pp;
struct segtree {
ll val[888888], lazy[888888];
void lazydown(ll P) {
val[2 ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,359,970 | 1,359,971 | u804419743 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define rrep(i, a, b) for (int i = b; i-- > (a);)
#define all(v) v.begin(), v.end()
#define trav(x, v) for (auto &x : v)
#define sz(v) (int)(v).size()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define rrep(i, a, b) for (int i = b; i-- > (a);)
#define all(v) v.begin(), v.end()
#define trav(x, v) for (auto &x : v)
#define sz(v) (int)(v).size()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,972 | 1,359,973 | u184907406 | cpp |
p03687 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> count(N, 0);
for (int i = 0; i < N; i++) {
int A = 0;
int B = 0;
int C = 0;
for (int j = 0; j < N; j++) {
if (S.at(i) == S.at(j)) {
count.at(i) = max(count.at(i), abs(i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> count(N, 0);
for (int i = 0; i < N; i++) {
int A = 0;
int B = 0;
int C = 0;
for (int j = 0; j < N; j++) {
if (S.at(i) == S.at(j)) {
count.at(i) = max(count.at(i), abs(C ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,359,980 | 1,359,981 | u710877960 | cpp |
p03688 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define ll long long
#define pb push_back
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) > (y) ? (y) : (x)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define ll long long
#define pb push_back
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) > (y) ? (y) : (x)... | [] | 1,359,925 | 1,359,927 | u456178666 | cpp |
p03688 | #include <bits/stdc++.h>
int a[100005], n, k;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
std::sort(a + 1, a + n + 1);
if (a[1] == a[n])
puts(a[1] == n - 1 || (a[1] && a[1] <= n / 2) ? "Yes" : "No");
else {
for (k = 1; a[k] == a[k + 1]; ++k)
;
if (a[... | #include <bits/stdc++.h>
int a[100005], n, k;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
std::sort(a + 1, a + n + 1);
if (a[1] == a[n])
puts(a[1] == n - 1 || (a[1] && a[1] <= n / 2) ? "Yes" : "No");
else {
for (k = 1; a[k] == a[k + 1]; ++k)
;
if (a[... | [
"control_flow.branch.if.condition.change"
] | 1,359,928 | 1,359,929 | u863548642 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> arr;
int main() {
scanf("%d", &N);
arr.resize(N);
for (int i = 0; i < N; i++) {
scanf("%d", &arr[i]);
}
sort(arr.begin(), arr.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
if (arr[i] == arr[0])
cnt++;
if (arr[i] != ... | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> arr;
int main() {
scanf("%d", &N);
arr.resize(N);
for (int i = 0; i < N; i++) {
scanf("%d", &arr[i]);
}
sort(arr.begin(), arr.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
if (arr[i] == arr[0])
cnt++;
if (arr[i] != ... | [
"expression.operation.binary.remove"
] | 1,359,930 | 1,359,931 | u333877810 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
const int N = 100100;
int col[N];
int tru[N];
int cnt = 1;
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &col[i]);
}
int mn = *min_element(col, col + n);
int mx = *max_element(col, col + n);
// printf("%d %d\n", mn, m... | #include <bits/stdc++.h>
using namespace std;
const int N = 100100;
int col[N];
int tru[N];
int cnt = 1;
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &col[i]);
}
int mn = *min_element(col, col + n);
int mx = *max_element(col, col + n);
// printf("%d %d\n", mn, m... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,933 | 1,359,934 | u939637096 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,359,938 | 1,359,939 | u742529680 | cpp |
p03688 | #include <iostream>
using namespace std;
int n, a[100001], ma, mi, p;
int main() {
cin >> n;
mi = 1e9;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
ma = max(ma, a[i]);
mi = min(mi, a[i]);
}
if (ma - mi > 1) {
cout << "No" << endl;
} else {
if (ma == mi) {
if (ma + 1 != n && ma << 1 ... | #include <iostream>
using namespace std;
int n, a[100001], ma, mi, p;
int main() {
cin >> n;
mi = 1e9;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
ma = max(ma, a[i]);
mi = min(mi, a[i]);
}
if (ma - mi > 1) {
cout << "No" << endl;
} else {
if (ma == mi) {
if (ma + 1 != n && ma << 1 ... | [
"control_flow.branch.if.condition.change"
] | 1,359,940 | 1,359,941 | u203063262 | cpp |
p03688 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define N 100020
const int INF = 1 << 30;
int a[N];
int main() {
// freopen("in.in", "r", stdin);
// freopen("out.out", "w", stdout)... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define N 100020
const int INF = 1 << 30;
int a[N];
int main() {
// freopen("in.in", "r", stdin);
// freopen("out.out", "w", stdout)... | [
"control_flow.branch.if.condition.change"
] | 1,359,987 | 1,359,988 | u123025781 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <sta... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <sta... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,359,989 | 1,359,990 | u319223598 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int N;
vector<int> V;
vector<pii> W;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int a;
scanf("%d", &a);
V.push_back(a);
}
sort(V.begin(), V.end());
for (int i = 0; i < V.size(); i++) {
if (i == 0 || W... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int N;
vector<int> V;
vector<pii> W;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int a;
scanf("%d", &a);
V.push_back(a);
}
sort(V.begin(), V.end());
for (int i = 0; i < V.size(); i++) {
if (i == 0 || W... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,991 | 1,359,992 | u205655980 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cassert>
#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 ... | #include <algorithm>
#include <bitset>
#include <cassert>
#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 ... | [
"expression.operation.binary.remove"
] | 1,359,993 | 1,359,994 | u013671577 | cpp |
p03688 | #include <algorithm>
#include <cstdio>
using namespace std;
int A[100005], n, mini, maxi;
int main() {
mini = 1e9;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &A[i]);
mini = min(mini, A[i]);
maxi = max(maxi, A[i]);
}
if (maxi - mini >= 2) {
puts("No");
return 0;
}
int c... | #include <algorithm>
#include <cstdio>
using namespace std;
int A[100005], n, mini, maxi;
int main() {
mini = 1e9;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &A[i]);
mini = min(mini, A[i]);
maxi = max(maxi, A[i]);
}
if (maxi - mini >= 2) {
puts("No");
return 0;
}
int c... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.change"
] | 1,360,003 | 1,360,004 | u289043411 | cpp |
p03688 | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 1e5 + 1e3 + 7;
int n, a[N], mx, mn = N * 2;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]), mx = max(mx, a[i]), mn = min(mn, a[i]);
if (mx - mn >= 2) {
cout << "No";
return 0;
}
if (mn > n / ... | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 1e5 + 1e3 + 7;
int n, a[N], mx, mn = N * 2;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]), mx = max(mx, a[i]), mn = min(mn, a[i]);
if (mx - mn >= 2) {
cout << "No";
return 0;
}
if (mn > n / ... | [
"literal.string.change",
"io.output.change"
] | 1,360,006 | 1,360,007 | u569427587 | cpp |
p03688 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + (ll)b) % mod
#define MUL(a, b) a = (a * (ll)b) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rer(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) (a).begin(), (a).end()
#define se... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + (ll)b) % mod
#define MUL(a, b) a = (a * (ll)b) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rer(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) (a).begin(), (a).end()
#define se... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,360,010 | 1,360,011 | u491153752 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back
using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;
const int inf = 100... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back
using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;
const int inf = 100... | [
"control_flow.branch.if.condition.change"
] | 1,360,016 | 1,360,017 | u802071009 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
#define X first
#define Y second
const int MAXN = 100010;
int n;
int a[MAXN];
int main() {
scanf("%d", &n);
ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
#define X first
#define Y second
const int MAXN = 100010;
int n;
int a[MAXN];
int main() {
scanf("%d", &n);
ma... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 1,360,022 | 1,360,023 | u918714262 | cpp |
p03688 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[100001] = {};
int min = 10000000;
int max = -1;
for (int i = 0; i < n; i++) {
cin >> a[i];
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[100001] = {};
int min = 10000000;
int max = -1;
for (int i = 0; i < n; i++) {
cin >> a[i];
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,360,024 | 1,360,025 | u782516204 | cpp |
p03688 | #include <bits/stdc++.h>
#include <unistd.h>
#define ll long long
#define ull unsigned long long
#define inf 1000000007
#define inf16 0x3f3f3f3f
#define INF 1000000000000000007LL
#define VI vector<int>
#define VPII vector<pair<int, int>>
#define VLL vector<ll>
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define... | #include <bits/stdc++.h>
#include <unistd.h>
#define ll long long
#define ull unsigned long long
#define inf 1000000007
#define inf16 0x3f3f3f3f
#define INF 1000000000000000007LL
#define VI vector<int>
#define VPII vector<pair<int, int>>
#define VLL vector<ll>
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define... | [] | 1,360,028 | 1,360,029 | u521402758 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <... | [
"control_flow.branch.if.condition.change"
] | 1,360,030 | 1,360,031 | u840220558 | cpp |
p03688 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define TRACE(x) cerr << #x << " " << x << endl
#define FOR(i, a... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define TRACE(x) cerr << #x << " " << x << endl
#define FOR(i, a... | [
"control_flow.branch.if.condition.change"
] | 1,360,034 | 1,360,035 | u158072123 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,360,038 | 1,360,039 | u443010331 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,360,040 | 1,360,039 | u443010331 | cpp |
p03688 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int N;
int a[100001];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
int b = 0;
int bnum = 0;
int c = 0;
int cnum = 0;
bool check = true;
for (int i = 0; i < N; ++i) {
cin >> a[i];
if (bnum == 0... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int N;
int a[100001];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
int b = 0;
int bnum = 0;
int c = 0;
int cnum = 0;
bool check = true;
for (int i = 0; i < N; ++i) {
cin >> a[i];
if (bnum == 0... | [
"control_flow.branch.if.condition.change"
] | 1,360,041 | 1,360,042 | u130529502 | cpp |
p03688 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"call.arguments.change"
] | 1,360,043 | 1,360,044 | u938924220 | cpp |
p03688 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define gep(i, g, j) for (int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it, c) ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define gep(i, g, j) for (int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it, c) ... | [
"preprocessor.define.value.change"
] | 1,360,045 | 1,360,046 | u457283867 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N], cnt[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
cnt[a[i]]++;
}
int m = n;
while (!cnt[m])
m--;
int s = n - cnt[m];
if (cnt[m - 1] != s)
return puts("No"), 0;
if (m ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N], cnt[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
cnt[a[i]]++;
}
int m = n;
while (!cnt[m])
m--;
int s = n - cnt[m];
if (cnt[m - 1] != s)
return puts("No"), 0;
if (m ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,360,049 | 1,360,050 | u719378199 | cpp |
p03688 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typed... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typed... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,360,051 | 1,360,052 | u161904081 | cpp |
p03688 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n = 0;
vector<int> v = {};
scanf("%d", &n);
v.resize(n);
int cntmin = 0;
int cntmax = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
int max = *max_element(v.begin(), v.end());
int min = *m... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n = 0;
vector<int> v = {};
scanf("%d", &n);
v.resize(n);
int cntmin = 0;
int cntmax = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
int max = *max_element(v.begin(), v.end());
int min = *m... | [
"control_flow.branch.if.condition.change"
] | 1,360,057 | 1,360,058 | u620059302 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j) for (int i = 0; i < (int)(j); i++)
#define repeat(i, j, k) for (int i = (j); i < (int)(k); i++)
#define all(v) v.begin(), v.end()
#define debug(x) cerr << #x << " : " << x << endl
template <class T> bool ... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j) for (int i = 0; i < (int)(j); i++)
#define repeat(i, j, k) for (int i = (j); i < (int)(k); i++)
#define all(v) v.begin(), v.end()
#define debug(x) cerr << #x << " : " << x << endl
template <class T> bool ... | [
"control_flow.branch.if.condition.change"
] | 1,360,061 | 1,360,062 | u233367006 | cpp |
p03688 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define L... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define L... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,360,065 | 1,360,066 | u651830993 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.