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 <bits/stdc++.h>
//#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int mini = 1e9;
int maxi = 0;
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
mini = min(a[i], mini);
maxi = max(a[i], maxi);
}
if (min... | #include <bits/stdc++.h>
//#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int mini = 1e9;
int maxi = 0;
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
mini = min(a[i], mini);
maxi = max(a[i], maxi);
}
if (min... | [
"control_flow.branch.if.condition.change"
] | 1,359,368 | 1,359,367 | u512749016 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<vector<ll>>> VVV... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<vector<ll>>> VVV... | [
"expression.operation.binary.remove"
] | 1,359,369 | 1,359,370 | u592686932 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[N - 1] - a[0] > 1) {
cout << "No" << endl;
} else if (a[0] == a[N - 1]) {
if (a[0] * 2 <= N || a[0] == N - 1) {
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[N - 1] - a[0] > 1) {
cout << "No" << endl;
} else if (a[0] == a[N - 1]) {
if (a[0] * 2 <= N || a[0] == N - 1) {
cou... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,371 | 1,359,372 | u424374375 | cpp |
p03688 | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
//#include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#... | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
//#include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#... | [
"control_flow.branch.if.condition.change"
] | 1,359,378 | 1,359,379 | u338903636 | cpp |
p03688 | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
//#include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#... | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
//#include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,378 | 1,359,380 | u338903636 | cpp |
p03688 | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
// 插入此處
int a[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
if (a[n - 1] - a[0] > 1) {
printf("No\n");
} else if (a[n - 1] == a[0]) {... | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
// 插入此處
int a[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
if (a[n - 1] - a[0] > 1) {
printf("No\n");
} else if (a[n - 1] == a[0]) {... | [
"control_flow.branch.if.condition.change"
] | 1,359,381 | 1,359,382 | u360239609 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define zero_pad(num) setfill('0') << std::right << setw(num... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define zero_pad(num) setfill('0') << std::right << setw(num... | [
"expression.operation.binary.remove"
] | 1,359,390 | 1,359,391 | u342075214 | cpp |
p03688 | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_... | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,392 | 1,359,393 | u145483532 | cpp |
p03688 | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_... | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,394 | 1,359,393 | u145483532 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | [
"control_flow.branch.if.condition.change"
] | 1,359,395 | 1,359,396 | u322177979 | cpp |
p03688 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,397 | 1,359,398 | u089177147 | cpp |
p03688 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.change"
] | 1,359,399 | 1,359,398 | u089177147 | cpp |
p03688 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,400 | 1,359,398 | u089177147 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | [
"control_flow.branch.if.condition.change"
] | 1,359,408 | 1,359,409 | u319279308 | cpp |
p03688 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inclu... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inclu... | [] | 1,359,412 | 1,359,413 | u221285045 | cpp |
p03688 | // atcoder/agc016/B/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first <<... | // atcoder/agc016/B/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first <<... | [] | 1,359,414 | 1,359,415 | u768334187 | cpp |
p03688 | // atcoder/agc016/B/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first <<... | // atcoder/agc016/B/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first <<... | [
"call.function.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.condition.change"
] | 1,359,417 | 1,359,415 | u768334187 | cpp |
p03688 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define rep2(i, n, m) for (long long i = n; i <= m; i++)
#define rep3(i, n, m) for (long long i = n; i >= m; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using graph = vector<v... | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define rep2(i, n, m) for (long long i = n; i <= m; i++)
#define rep3(i, n, m) for (long long i = n; i >= m; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using graph = vector<v... | [
"expression.operation.binary.remove"
] | 1,359,420 | 1,359,421 | u449123607 | cpp |
p03688 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define rep2(i, n, m) for (long long i = n; i <= m; i++)
#define rep3(i, n, m) for (long long i = n; i >= m; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using graph = vector<v... | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define rep2(i, n, m) for (long long i = n; i <= m; i++)
#define rep3(i, n, m) for (long long i = n; i >= m; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using graph = vector<v... | [
"expression.operation.binary.remove",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,359,422 | 1,359,421 | u449123607 | cpp |
p03688 | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <u... | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <u... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,423 | 1,359,424 | u302000346 | cpp |
p03688 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | [
"control_flow.branch.if.condition.change"
] | 1,359,430 | 1,359,431 | u096616343 | cpp |
p03688 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | [
"control_flow.branch.if.condition.change"
] | 1,359,432 | 1,359,431 | u096616343 | cpp |
p03688 | // includes
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered... | // includes
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,359,435 | 1,359,436 | u424110125 | cpp |
p03688 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | [
"control_flow.branch.if.condition.change"
] | 1,359,445 | 1,359,446 | u965730380 | cpp |
p03688 | #include <iostream>
#include <map>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, maxx = 0, minn = 233333333, cnt = 0;
cin >> n;
for (int i = 1, x; i <= n; ++i) {
cin >> x;
if (x < minn)
cnt = 0;
maxx = max(maxx, x);
minn = min(minn, x);
if (x == minn)
cn... | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, maxx = 0, minn = 233333333, cnt = 0;
cin >> n;
for (int i = 1, x; i <= n; ++i) {
cin >> x;
if (x < minn)
cnt = 0;
maxx = max(maxx, x);
minn = min(minn, x);
if (x == minn)
cnt++;
}
if (... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,359,630 | 1,359,631 | u420065047 | cpp |
p03688 | #include <algorithm>
#include <cstdio>
using namespace std;
const int N = 1e5 + 10;
int cnt, mx, mn = 1e9, n, t[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &t[i]), mx = max(mx, t[i]), mn = min(mn, t[i]);
if (mx != mn + 1) {
puts("No");
return 0;
}
if (mx == mn) {
... | #include <algorithm>
#include <cstdio>
using namespace std;
const int N = 1e5 + 10;
int cnt, mx, mn = 1e9, n, t[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &t[i]), mx = max(mx, t[i]), mn = min(mn, t[i]);
if (mx - mn > 1) {
puts("No");
return 0;
}
if (mx == mn) {
... | [
"control_flow.branch.if.condition.change"
] | 1,359,632 | 1,359,633 | u515800625 | cpp |
p03688 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struc... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struc... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,359,634 | 1,359,635 | u539402331 | cpp |
p03688 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double pi = 3.141592653589793238;
int n, k[100005];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> k[i];
}
sort(k, k + n);
if (k[n - 1] - k[0] >= 2) {
cout <<... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double pi = 3.141592653589793238;
int n, k[100005];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> k[i];
}
sort(k, k + n);
if (k[n - 1] - k[0] >= 2) {
cout <<... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,359,636 | 1,359,637 | u539402331 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
int k = A[0], l = k + 1;
for (int i = 1; i < N; ++i) {
if (A[i] == k - 1) {
l = k;
} else if (A[i] == k) {
} else if (A[i] == l) {
k = l;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
int k = A[0], l = k + 1;
for (int i = 1; i < N; ++i) {
if (A[i] == k - 1) {
l = k;
} else if (A[i] == k) {
} else if (A[i] == l) {
k = l;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,640 | 1,359,641 | u645369394 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int ma = 0, mi = 1000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
ma = max(a[i], ma);
mi = min(a[i], mi);
}
if (ma - mi >= 2) {
cout << "No" << endl;
return 0;
}
if (ma == mi) {
if (a[0]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int ma = 0, mi = 1000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
ma = max(a[i], ma);
mi = min(a[i], mi);
}
if (ma - mi >= 2) {
cout << "No" << endl;
return 0;
}
if (ma == mi) {
if (a[0]... | [] | 1,359,644 | 1,359,645 | u357265888 | cpp |
p03688 | #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>
#include <unordered_map>
#inclu... | #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>
#include <unordered_map>
#inclu... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,648 | 1,359,649 | u811004127 | cpp |
p03688 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define vel vector<int>
#define vvel vector<vel>
#define veb vector<bool>
#define pin pair<int, int>
#define mp make_pair
#define int long long
using namespace std;
void mmin(int &a, int b... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define vel vector<int>
#define vvel vector<vel>
#define veb vector<bool>
#define pin pair<int, int>
#define mp make_pair
#define int long long
using namespace std;
void mmin(int &a, int b... | [
"control_flow.branch.if.condition.change"
] | 1,359,650 | 1,359,651 | u021034020 | cpp |
p03688 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tim... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tim... | [
"control_flow.branch.if.condition.change"
] | 1,359,656 | 1,359,657 | u313288017 | cpp |
p03688 | #include <bits/stdc++.h>
inline int read() {
int x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
ch = getchar();
if (ch == '-')
w = -1;
}
while (ch <= '9' && ch >= '0') {
x = (x << 1) + (x << 3) + ch - '0';
ch = getchar();
}
return x * w;
}
using namespace std;
typedef long... | #include <bits/stdc++.h>
inline int read() {
int x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
ch = getchar();
if (ch == '-')
w = -1;
}
while (ch <= '9' && ch >= '0') {
x = (x << 1) + (x << 3) + ch - '0';
ch = getchar();
}
return x * w;
}
using namespace std;
typedef long... | [
"control_flow.branch.if.condition.change"
] | 1,359,658 | 1,359,659 | u774775710 | cpp |
p03688 | /**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAj... | /**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAj... | [
"literal.string.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,359,666 | 1,359,667 | u819815859 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,671 | 1,359,672 | u591883167 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,673 | 1,359,672 | u591883167 | cpp |
p03688 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int x, y, i, n, c;
vector<int> a(100010);
cin >> n;
x = 10000000;
y = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
x = min(x, a[i]);
y = max(y, a[i]);
}
for (i = 0; i < n; i++) {
if ((y - x) > 1) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int x, y, i, n, c;
vector<int> a(100010);
cin >> n;
x = 10000000;
y = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
x = min(x, a[i]);
y = max(y, a[i]);
}
for (i = 0; i < n; i++) {
if ((y - x) > 1) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,678 | 1,359,679 | u621509943 | cpp |
p03688 | #include "bits/stdc++.h"
using namespace std;
#define int long long
int mod = 1e9 + 7;
signed main() {
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" << endl;
return 0;
}
if (a[0] == a[n - 1]) {
... | #include "bits/stdc++.h"
using namespace std;
#define int long long
int mod = 1e9 + 7;
signed main() {
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" << endl;
return 0;
}
if (a[0] == a[n - 1]) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,682 | 1,359,683 | u890465662 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
const int MaxN = 1e5 + 5;
int N, Mx, Mn = 1 << 30, Cnt;
int A[MaxN];
int main() {
int i;
scanf("%d", &N);
for (i = 1; i <= N; i++) {
scanf("%d", &A[i]);
Mx = max(Mx, A[i]);
Mn = min(Mn, A[i]);
}
if (Mx > Mx + 1) {
puts("No");
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
const int MaxN = 1e5 + 5;
int N, Mx, Mn = 1 << 30, Cnt;
int A[MaxN];
int main() {
int i;
scanf("%d", &N);
for (i = 1; i <= N; i++) {
scanf("%d", &A[i]);
Mx = max(Mx, A[i]);
Mn = min(Mn, A[i]);
}
if (Mx > Mn + 1) {
puts("No");
return 0;
}
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,686 | 1,359,687 | u133158342 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
const int MaxN = 1e5 + 5;
int N, Mx, Mn = 1 << 30, Cnt;
int A[MaxN];
int main() {
int i;
scanf("%d", &N);
for (i = 1; i <= N; i++) {
scanf("%d", &A[i]);
Mx = max(Mx, A[i]);
Mn = min(Mn, A[i]);
}
if (Mx > Mx + 1) {
puts("NO");
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
const int MaxN = 1e5 + 5;
int N, Mx, Mn = 1 << 30, Cnt;
int A[MaxN];
int main() {
int i;
scanf("%d", &N);
for (i = 1; i <= N; i++) {
scanf("%d", &A[i]);
Mx = max(Mx, A[i]);
Mn = min(Mn, A[i]);
}
if (Mx > Mn + 1) {
puts("No");
return 0;
}
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,359,688 | 1,359,687 | u133158342 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 55;
int n, a[N], mn = N, mx, cmx, cm1;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i], mn = min(mn, a[i]), mx = max(mx, a[i]);
if (mx - mn <= 1) {
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 55;
int n, a[N], mn = N, mx, cmx, cm1;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i], mn = min(mn, a[i]), mx = max(mx, a[i]);
if (mx - mn <= 1) {
for (int i = 0; i < n; ++i) {
... | [
"control_flow.return.add"
] | 1,359,689 | 1,359,690 | u725475134 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <string>
#include <type_... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <string>
#include <type_... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,359,691 | 1,359,692 | u318857467 | cpp |
p03688 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n;
int a[100100];
int ma, mi = 0x3f3f3f3f;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]), ma = max(ma, a[i]), mi = min(mi, a[i]);
if (ma - mi > 2) {
puts("No");
return... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n;
int a[100100];
int ma, mi = 0x3f3f3f3f;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]), ma = max(ma, a[i]), mi = min(mi, a[i]);
if (ma - mi >= 2) {
puts("No");
retur... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,359,702 | 1,359,703 | u863047114 | cpp |
p03688 | #include <bits/stdc++.h>
#define FI first
#define SE second
#define PB push_back
#define ll long long
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ROF(i, a, b) for (int i = b - 1; i >= a; i--)
#define YES(i) cout << (i ? "YES" : "NO") << endl
#define Yes(i) cout << (i ? "Yes" : "No") << endl
#define co(i) c... | #include <bits/stdc++.h>
#define FI first
#define SE second
#define PB push_back
#define ll long long
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ROF(i, a, b) for (int i = b - 1; i >= a; i--)
#define YES(i) cout << (i ? "YES" : "NO") << endl
#define Yes(i) cout << (i ? "Yes" : "No") << endl
#define co(i) c... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.remove"
] | 1,359,706 | 1,359,707 | u094270015 | cpp |
p03688 | #include <cstdio>
#define neko 100010
#define qwq return printf("Yes\n"), 0
#define orz return printf("No\n"), 0
#define f(i, a, b) for (register int i = (a); i <= (b); i = -(~i))
int n, minx = 1e9, maxn, a[neko], cnt;
int cmin(int a, int b) { return a < b ? a : b; }
int cmax(int a, int b) { return a > b ? a : b; }
int... | #include <cstdio>
#define neko 100010
#define qwq return printf("Yes\n"), 0
#define orz return printf("No\n"), 0
#define f(i, a, b) for (register int i = (a); i <= (b); i = -(~i))
int n, minx = 1e9, maxn, a[neko], cnt;
int cmin(int a, int b) { return a < b ? a : b; }
int cmax(int a, int b) { return a > b ? a : b; }
int... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,708 | 1,359,709 | u854012554 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin... | [
"control_flow.branch.if.condition.change"
] | 1,359,710 | 1,359,711 | u110383845 | cpp |
p03688 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[100001];
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int mn = 1e9 + 7;
int mx = 0;
int kl = 0, kr = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
mn = min(mn, a[i]);
mx = max(mx, a[i]);
}... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[100001];
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int mn = 1e9 + 7;
int mx = 0;
int kl = 0, kr = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
mn = min(mn, a[i]);
mx = max(mx, a[i]);
}... | [
"control_flow.branch.if.condition.change"
] | 1,359,712 | 1,359,713 | u758996710 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
const int MX = 100 * 1000 + 7;
int a[MX];
int main() {
#ifdef BZ
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a... | #include <bits/stdc++.h>
using namespace std;
const int MX = 100 * 1000 + 7;
int a[MX];
int main() {
#ifdef BZ
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,716 | 1,359,717 | u636185144 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
if (a[n] - a[1] >= 2)
puts("No");
else if (a[n] == a[1] && a[n] == n - 1)
puts("Yes");
else {
int pos;
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
if (a[n] - a[1] >= 2)
puts("No");
else if (a[n] == a[1] && a[n] == n - 1)
puts("Yes");
else {
int pos;
for (int i = 1; i <... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,359,718 | 1,359,719 | u210511199 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
if (a[n] - a[1] >= 2)
puts("No");
else if (a[n] == a[1] && a[n] == n - 1)
puts("Yes");
else {
int pos;
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
if (a[n] - a[1] >= 2)
puts("No");
else if (a[n] == a[1] && a[n] == n - 1)
puts("Yes");
else {
int pos;
for (int i = 1; i <... | [
"control_flow.branch.if.condition.change"
] | 1,359,720 | 1,359,719 | u210511199 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int N;
int a[110000];
signed main() {
cin >> N;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int N;
int a[110000];
signed main() {
cin >> N;
for (int i = 0; i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,725 | 1,359,726 | u450832845 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,727 | 1,359,728 | u898651494 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,729 | 1,359,728 | u898651494 | cpp |
p03688 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,359,735 | 1,359,736 | u980655160 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define Rep(b, e, i) for (int i = b; i <= e... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define Rep(b, e, i) for (int i = b; i <= e... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,737 | 1,359,738 | u344412812 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1e9 + 7;
const LL LINF = 1LL << 62;
const int INF = 1 << 17;
int main() {
int N;
cin >> N;
int maxi = 0, mini = INF;
map<int, int> mp;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
mp[x]++;... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1e9 + 7;
const LL LINF = 1LL << 62;
const int INF = 1 << 17;
int main() {
int N;
cin >> N;
int maxi = 0, mini = INF;
map<int, int> mp;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
mp[x]++;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,739 | 1,359,740 | u640323045 | cpp |
p03688 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ROF(i, a, b) for (int i = b - 1; i >= a; i--)
#define FI first
#define SE second
#define SI size()
#define VE vector<... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ROF(i, a, b) for (int i = b - 1; i >= a; i--)
#define FI first
#define SE second
#define SI size()
#define VE vector<... | [
"identifier.change",
"call.function.change"
] | 1,359,744 | 1,359,745 | u587366956 | cpp |
p03688 | #include <bits/stdc++.h>
#define L long long
using namespace std;
int n, x[100010], l = 1e9, r, a, b;
int main() {
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &x[i]);
l = min(l, x[i]);
r = max(r, x[i]);
}
for (i ... | #include <bits/stdc++.h>
#define L long long
using namespace std;
int n, x[100010], l = 1e9, r, a, b;
int main() {
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &x[i]);
l = min(l, x[i]);
r = max(r, x[i]);
}
for (i ... | [
"control_flow.branch.if.condition.change"
] | 1,359,748 | 1,359,749 | u773072209 | cpp |
p03688 | #include <bits/stdc++.h>
#define L long long
using namespace std;
int n, x[100010], l = 1e9, r, a, b;
int main() {
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &x[i]);
l = min(l, x[i]);
r = max(r, x[i]);
}
for (i ... | #include <bits/stdc++.h>
#define L long long
using namespace std;
int n, x[100010], l = 1e9, r, a, b;
int main() {
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &x[i]);
l = min(l, x[i]);
r = max(r, x[i]);
}
for (i ... | [
"control_flow.branch.if.condition.change"
] | 1,359,750 | 1,359,749 | u773072209 | cpp |
p03688 | // Be Name Khoda
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma optimize O3
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template... | // Be Name Khoda
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma optimize O3
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template... | [
"control_flow.branch.if.condition.change"
] | 1,359,753 | 1,359,752 | u059425619 | cpp |
p03688 | // Be Name Khoda
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma optimize O3
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template... | // Be Name Khoda
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma optimize O3
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,359,754 | 1,359,752 | u059425619 | cpp |
p03688 | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi f... | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi f... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,359,755 | 1,359,756 | u284102701 | cpp |
p03688 | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi f... | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi f... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 1,359,757 | 1,359,756 | u284102701 | cpp |
p03688 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define rep(i, a, b) for (int i = (a), _ = (b); i <= _; ++i)
#define per(i, a, b) for (int i = (a), _ = (b); i >= _; --i)
#define For(i, a, b) for (int i = (a), _ = (b); i < _; ++i)
#define ri rd<int>
using n... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define rep(i, a, b) for (int i = (a), _ = (b); i <= _; ++i)
#define per(i, a, b) for (int i = (a), _ = (b); i >= _; --i)
#define For(i, a, b) for (int i = (a), _ = (b); i < _; ++i)
#define ri rd<int>
using n... | [
"control_flow.branch.if.condition.change"
] | 1,359,760 | 1,359,761 | u790210499 | cpp |
p03688 | #include <algorithm>
#include <cstdio>
int N, a[100001], Max, Min, CMax, CMin;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++)
scanf("%d", a + i);
Max = *std::max_element(a + 1, a + N + 1);
Min = *std::min_element(a + 1, a + N + 1);
CMax = std::count(a + 1, a + N + 1, Max);
CMin = std::count(... | #include <algorithm>
#include <cstdio>
int N, a[100001], Max, Min, CMax, CMin;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++)
scanf("%d", a + i);
Max = *std::max_element(a + 1, a + N + 1);
Min = *std::min_element(a + 1, a + N + 1);
CMax = std::count(a + 1, a + N + 1, Max);
CMin = std::count(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,766 | 1,359,767 | u804977105 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define EPS (1e-7)
#define INF 1e9
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int vx[] = {0, 1, ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define EPS (1e-7)
#define INF 1e9
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int vx[] = {0, 1, ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,770 | 1,359,771 | u369883202 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define EPS (1e-7)
#define INF 1e9
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int vx[] = {0, 1, ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define EPS (1e-7)
#define INF 1e9
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int vx[] = {0, 1, ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,359,772 | 1,359,771 | u369883202 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 1e5 + 100;
int gi() {
int w = ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 1e5 + 100;
int gi() {
int w = ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,359,775 | 1,359,776 | u014125471 | cpp |
p03688 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
const int MAXN = (int)2e5;
array<int, MAXN> arr;
void No() {
cout << "No" << endl;
exit(0);
}
void Yes() {
cout << "Yes" << endl;
exit(0);
}
in... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
const int MAXN = (int)2e5;
array<int, MAXN> arr;
void No() {
cout << "No" << endl;
exit(0);
}
void Yes() {
cout << "Yes" << endl;
exit(0);
}
in... | [
"control_flow.branch.if.condition.change"
] | 1,359,777 | 1,359,778 | u803705885 | cpp |
p03688 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(n) for (int i = 0; i < n; i++)
#define repp(j, n) for (int j = 0; j < n; j++)
#define reppp(i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(n) for (int i = 0; i < n; i++)
#define repp(j, n) for (int j = 0; j < n; j++)
#define reppp(i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,781 | 1,359,782 | u986399983 | cpp |
p03688 | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,359,783 | 1,359,784 | u631007830 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef v... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,359,785 | 1,359,786 | u912359563 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef v... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,787 | 1,359,788 | u912359563 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.remove"
] | 1,359,793 | 1,359,794 | u013750540 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.remove"
] | 1,359,795 | 1,359,794 | u013750540 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,796 | 1,359,794 | u013750540 | cpp |
p03688 | #include <bits/stdc++.h>
#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 debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 100005;
int n, mx, mn, a[maxn];
int main() {
scanf("%... | #include <bits/stdc++.h>
#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 debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 100005;
int n, mx, mn, a[maxn];
int main() {
scanf("%... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change"
] | 1,359,799 | 1,359,800 | u242259691 | cpp |
p03688 | #include <algorithm>
#include <deque>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
#define INF 2100000000
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}... | #include <algorithm>
#include <deque>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
#define INF 2100000000
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,447 | 1,359,448 | u630211216 | cpp |
p03688 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,359,454 | 1,359,455 | u391331433 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
template <class T> void chmax(T &x, T y) {
if (x < y)
x = y;
}
template <class T> void chmin(T &x, T y) {
if (x > y)
x = y;
}
#define p pair<int, int>
int N;
vector<int> as;
map<int, int> mp;
int main() {
cin >> N;
int m = 1 << 30, M = 0;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
template <class T> void chmax(T &x, T y) {
if (x < y)
x = y;
}
template <class T> void chmin(T &x, T y) {
if (x > y)
x = y;
}
#define p pair<int, int>
int N;
vector<int> as;
map<int, int> mp;
int main() {
cin >> N;
int m = 1 << 30, M = 0;
for (int i = 0; ... | [
"control_flow.branch.if.condition.change"
] | 1,359,456 | 1,359,457 | u554116180 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,463 | 1,359,464 | u934272719 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int, int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int, int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,467 | 1,359,468 | u839397805 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define LL long long
#define pb push_back
#define mp make_pair
#define M 1000000007
#define y1 fwfwkpoe
#define K 200001
int n;
int a[K];
int main() {
scanf("%d", &n);
... | #include <bits/stdc++.h>
using namespace std;
#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define LL long long
#define pb push_back
#define mp make_pair
#define M 1000000007
#define y1 fwfwkpoe
#define K 200001
int n;
int a[K];
int main() {
scanf("%d", &n);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,469 | 1,359,470 | u062340164 | cpp |
p03688 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i... | [
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,359,482 | 1,359,483 | u425287928 | cpp |
p03688 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i... | [
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,359,484 | 1,359,483 | u425287928 | cpp |
p03688 | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,... | [
"control_flow.branch.if.condition.change"
] | 1,359,487 | 1,359,488 | u591914971 | cpp |
p03688 | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,489 | 1,359,488 | u591914971 | cpp |
p03688 | //#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#d... | //#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#d... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,490 | 1,359,491 | u155416173 | cpp |
p03688 |
#include <bits/stdc++.h>
using namespace std;
;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x) (x).begin(), (x).en... |
#include <bits/stdc++.h>
using namespace std;
;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x) (x).begin(), (x).en... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,359,492 | 1,359,493 | u013628553 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
mp[a]++;
}
if (mp.size() == 1) {
if (mp[n - 1] == n or n >= 2 * (*mp.begin()).first) {
cout << "Yes" << '\n';
} else {
cout << "No" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
mp[a]++;
}
if (mp.size() == 1) {
if (mp[n - 1] == n or n >= 2 * (*mp.begin()).first) {
cout << "Yes" << '\n';
} else {
cout << "No" <<... | [
"expression.operation.binary.remove"
] | 1,359,494 | 1,359,495 | u918753189 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
mp[a]++;
}
if (mp.size() == 1) {
if (mp[n - 1] = n or n >= 2 * (*mp.begin()).first) {
cout << "Yes" << '\n';
} else {
cout << "No" << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
mp[a]++;
}
if (mp.size() == 1) {
if (mp[n - 1] == n or n >= 2 * (*mp.begin()).first) {
cout << "Yes" << '\n';
} else {
cout << "No" <<... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"expression.operation.binary.remove"
] | 1,359,496 | 1,359,495 | u918753189 | cpp |
p03688 | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | [
"control_flow.branch.if.condition.change"
] | 1,359,499 | 1,359,500 | u759162415 | cpp |
p03688 | ////////////////////////////////////////////
/// ///
/// Template ver. 1.2. rapel ///
/// Fear is Temporary, Regret is Forever ///
/// Must Try and Get AC ///
/// ///
////////////////////////////////////////////
#incl... | ////////////////////////////////////////////
/// ///
/// Template ver. 1.2. rapel ///
/// Fear is Temporary, Regret is Forever ///
/// Must Try and Get AC ///
/// ///
////////////////////////////////////////////
#incl... | [
"control_flow.return.add"
] | 1,359,501 | 1,359,502 | u236830524 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define x first
#define y second
#define pi acosl(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define x first
#define y second
#define pi acosl(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,503 | 1,359,504 | u682550266 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
int n;
scanf("%d", &n);
int minn = 1e9;
int maxx = -1;
int cntmin = 0;
int cntmax = 0;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
int n;
scanf("%d", &n);
int minn = 1e9;
int maxx = -1;
int cntmin = 0;
int cntmax = 0;
for (int i = 0; i < n; i++) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,505 | 1,359,506 | u828669332 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<int, int> P;
const int MOD = 1000000007;
const ll INF = 1e10;
const double EPS =... | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<int, int> P;
const int MOD = 1000000007;
const ll INF = 1e10;
const double EPS =... | [
"control_flow.branch.if.condition.change"
] | 1,359,509 | 1,359,510 | u317754719 | cpp |
p03688 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | [
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,359,511 | 1,359,512 | u525288965 | cpp |
p03688 | #include <bits/stdc++.h>
#define reg register
using namespace std;
int n, a[1000001], sum;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
if (a[n] - a[1] > 1)
cout << "No\n";
else if (a[n] - a[1] == 0) {
if (a[1] * 2 > n || a[1] != n - 1)
cout... | #include <bits/stdc++.h>
#define reg register
using namespace std;
int n, a[1000001], sum;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
if (a[n] - a[1] > 1)
cout << "No\n";
else if (a[n] - a[1] == 0) {
if (a[1] * 2 > n && a[1] != n - 1)
cout... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,359,513 | 1,359,514 | u717396571 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int mi = n, mx = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
mi = min(mi, a[i]);
mx = max(mx, a[i]);
}
if (mx - mi > 1)
cout << "No\n";
else {
if (mx == mi) {
if (mx == n - 1)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int mi = n, mx = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
mi = min(mi, a[i]);
mx = max(mx, a[i]);
}
if (mx - mi > 1)
cout << "No\n";
else {
if (mx == mi) {
if (mx == n - 1)
... | [
"control_flow.branch.if.condition.change"
] | 1,359,515 | 1,359,516 | u923894160 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.