problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02975 | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
map<long long int, long long int> cnt;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
cnt[a]++;
}
auto itr = cnt.begin();
auto itr1 = cnt.begin();
it... | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
map<long long int, long long int> cnt;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
cnt[a]++;
}
auto itr = cnt.begin();
auto itr1 = cnt.begin();
it... | [
"control_flow.branch.if.condition.change"
] | 781,607 | 781,608 | u858670323 | cpp |
p02975 | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
map<long long int, int> cnt;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
cnt[a]++;
}
auto itr = cnt.begin();
auto itr1 = cnt.begin();
itr1++;
auto itr2 = ... | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
map<long long int, long long int> cnt;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
cnt[a]++;
}
auto itr = cnt.begin();
auto itr1 = cnt.begin();
it... | [
"control_flow.branch.if.condition.change"
] | 781,609 | 781,608 | u858670323 | cpp |
p02975 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#include <cctype>
#include <cm... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#include <cctype>
#include <cm... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 781,610 | 781,611 | u592290074 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL... | [
"control_flow.branch.if.condition.change"
] | 781,619 | 781,620 | u187878098 | cpp |
p02975 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
set<int> b;
for (int i = 0; i < n; i++) {
cin >> a[i];
b.insert(a[i]);
}
sort(a.begin(), a.end());
if (b.size() > 3) {
cout << "No" << endl;
}... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
set<int> b;
for (int i = 0; i < n; i++) {
cin >> a[i];
b.insert(a[i]);
}
sort(a.begin(), a.end());
if (b.size() > 3) {
cout << "No" << endl;
}... | [
"control_flow.branch.if.condition.change"
] | 781,623 | 781,624 | u955202970 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vec... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 781,627 | 781,628 | u009414205 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vec... | [
"expression.operation.binary.remove"
] | 781,629 | 781,628 | u009414205 | cpp |
p02975 | #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 S = a[0];
for (int i = 0; i < N; i++)
S = S ^ a[i];
if (S == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #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 S = a[0];
for (int i = 1; i < N; i++)
S = S ^ a[i];
if (S == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.return.add",
"control_flow.return.0.add"
] | 781,638 | 781,639 | u265359795 | cpp |
p02975 | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
w = -1;
c = getchar();
}
while (c <= '9' && c >=... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
w = -1;
c = getchar();
}
while (c <= '9' && c >=... | [
"control_flow.branch.if.condition.change"
] | 781,640 | 781,641 | u766349042 | cpp |
p02975 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | [
"expression.operation.binary.remove"
] | 781,644 | 781,645 | u803893892 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// n回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) /... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// n回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) /... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 781,646 | 781,647 | u457985479 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// n回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) /... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// n回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) /... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 781,648 | 781,647 | u457985479 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// n回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) /... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// n回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) /... | [
"control_flow.branch.if.condition.change"
] | 781,649 | 781,647 | u457985479 | cpp |
p02975 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
int main(void) {
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n % 3 != 1) {
int ok = 1;
for (int i = 0; i < n; i++) {
if (a[i] != 0)
... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
int main(void) {
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n % 3 != 0) {
int ok = 1;
for (int i = 0; i < n; i++) {
if (a[i] != 0)
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 781,652 | 781,653 | u755121033 | cpp |
p02975 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep3(i, a, b) for (ll i = a; i >= b; i--)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#de... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep3(i, a, b) for (ll i = a; i >= b; i--)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#de... | [
"control_flow.branch.if.condition.change"
] | 781,654 | 781,655 | u882039496 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
using PP = pair<long, long>;
const int INF = 1e9;
template <class T> T Next() {
T buf;
cin >> buf;
return buf;
}
const int MOD = 1000000007;
int n, m;
int dp[51][51][626];
void add(int &a, int b) {
a += b;
if (a >= MOD)
a -= MOD;
}
int main() {
cin >> n >>... | #include <bits/stdc++.h>
using namespace std;
using PP = pair<long, long>;
const int INF = 1e9;
template <class T> T Next() {
T buf;
cin >> buf;
return buf;
}
const int MOD = 1000000007;
int n, m;
int dp[51][51][1301];
void add(int &a, int b) {
a += b;
if (a >= MOD)
a -= MOD;
}
int main() {
cin >> n >... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 781,662 | 781,663 | u993619636 | cpp |
p02974 | #include <bits/stdc++.h>
#define ALL(x) x.begin(), x.end()
#define mset(a, b) memset(a, b, sizeof a)
#define rep(i, a, b) for (int i(a), i##_END_(b); i <= i##_END_; i++)
#define drep(i, a, b) for (int i(a), i##_END_(b); i >= i##_END_; i--)
using namespace std;
template <class T> inline bool tomax(T &a, T b) { return a ... | #include <bits/stdc++.h>
#define ALL(x) x.begin(), x.end()
#define mset(a, b) memset(a, b, sizeof a)
#define rep(i, a, b) for (int i(a), i##_END_(b); i <= i##_END_; i++)
#define drep(i, a, b) for (int i(a), i##_END_(b); i >= i##_END_; i--)
using namespace std;
template <class T> inline bool tomax(T &a, T b) { return a ... | [
"assignment.change"
] | 781,668 | 781,669 | u226153407 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
rep(i, N) cin >> a[i];
set<int> b(a, a + N);
if (b.size() > 3) {
cout << "No" << endl;
return 0;
}
vector<int> cnt(b.size());
int k = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
rep(i, N) cin >> a[i];
set<int> b(a, a + N);
if (b.size() > 3) {
cout << "No" << endl;
return 0;
}
vector<int> cnt(b.size());
int k = 0;
... | [
"control_flow.branch.if.condition.change",
"variable_declaration.type.change"
] | 781,680 | 781,681 | u499062271 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
rep(i, N) cin >> a[i];
set<int> b(a, a + N);
if (b.size() > 3) {
cout << "No" << endl;
return 0;
}
vector<int> cnt(b.size());
int k = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
rep(i, N) cin >> a[i];
set<int> b(a, a + N);
if (b.size() > 3) {
cout << "No" << endl;
return 0;
}
vector<int> cnt(b.size());
int k = 0;
... | [
"control_flow.branch.if.condition.change"
] | 781,682 | 781,681 | u499062271 | cpp |
p02975 | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 781,687 | 781,688 | u026342954 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | [
"call.remove"
] | 781,689 | 781,690 | u370785250 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | [
"control_flow.branch.if.condition.change"
] | 781,691 | 781,690 | u370785250 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | [
"control_flow.branch.if.condition.change"
] | 781,694 | 781,695 | u947236878 | cpp |
p02975 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"assignment.value.change"
] | 781,700 | 781,701 | u151236434 | cpp |
p02975 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int ... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 781,702 | 781,703 | u730499268 | cpp |
p02975 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<int, int> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
}
int k = m.size();
bool ans = false;
if (m[0] == n) {
ans = true;
} els... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<int, int> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
}
int k = m.size();
bool ans = false;
if (m[0] == n) {
ans = true;
} els... | [
"control_flow.branch.if.condition.change"
] | 781,704 | 781,705 | u936558609 | cpp |
p02975 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"control_flow.branch.if.condition.change"
] | 781,711 | 781,712 | u841131859 | cpp |
p02975 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"control_flow.branch.if.condition.change"
] | 781,711 | 781,713 | u841131859 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
map<ll, ll> mp{};
REP(i, N) cin >> A[i], mp[A[i]]++;
if (mp.size() == 1) {
if (mp[0] != 0)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
map<ll, ll> mp{};
REP(i, N) cin >> A[i], mp[A[i]]++;
if (mp.size() == 1) {
if (mp[0] != 0)... | [
"control_flow.branch.if.condition.change"
] | 781,726 | 781,727 | u893239355 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ll long long
#define ld long double
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0... | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ll long long
#define ld long double
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0... | [
"call.arguments.add",
"call.arguments.change"
] | 781,728 | 781,729 | u342075214 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
map<int, int> mp;
rep(i, n)++ mp[a[i]];
int cnt = 0;
bool exist = false;
for (auto itr ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
map<int, int> mp;
rep(i, n)++ mp[a[i]];
int cnt = 0;
bool exist = false;
for (auto itr ... | [
"control_flow.branch.if.condition.change"
] | 781,736 | 781,737 | u714642046 | cpp |
p02975 | #include <bits/stdc++.h>
#include <cstdint>
#include <vector>
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (l); i >= (int)(r); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n - 1, 0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf... | #include <bits/stdc++.h>
#include <cstdint>
#include <vector>
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (l); i >= (int)(r); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n - 1, 0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf... | [
"call.arguments.add",
"control_flow.branch.if.condition.change"
] | 781,755 | 781,756 | u762160119 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int z = 0;
set<int> st;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
z++;
st.insert(a[i]);
}
if (z == n) {
cout << "Yes" << endl;
return 0;
}
if (st.size() == 2 && ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int z = 0;
set<int> st;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
z++;
st.insert(a[i]);
}
if (z == n) {
cout << "Yes" << endl;
return 0;
}
if (st.size() == 2 && ... | [
"control_flow.branch.if.condition.change"
] | 781,757 | 781,758 | u174509352 | cpp |
p02975 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 781,767 | 781,768 | u225660136 | cpp |
p02975 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | [
"expression.operation.binary.remove"
] | 781,767 | 781,769 | u225660136 | cpp |
p02975 | #include <iostream>
//#include <iomanip>
//#include <string>
#include <vector>
//#include <algorithm>
//#include <utility>
//#include <set>
#include <map>
//#include <queue>
//#include <deque>
//#include <bitset>
//#include <math.h>
using namespace std;
using ll = long long;
// using ld = long double ;
using vll = vect... | #include <iostream>
//#include <iomanip>
//#include <string>
#include <vector>
//#include <algorithm>
//#include <utility>
//#include <set>
#include <map>
//#include <queue>
//#include <deque>
//#include <bitset>
//#include <math.h>
using namespace std;
using ll = long long;
// using ld = long double ;
using vll = vect... | [
"call.arguments.change"
] | 781,799 | 781,800 | u993074316 | cpp |
p02975 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a)... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a)... | [
"call.remove"
] | 781,802 | 781,803 | u876335718 | cpp |
p02975 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int x, i, y, j;
int chk = 0;
cin >> x;
int *ar = (int *)malloc(x * sizeof(int));
for (i = 1; i <= x; i++) {
cin >> y;
ar[i - 1] = y;
}
for (j = 0; j < x; j++) {
chk = chk ^ ar[j];
}
if (chk == 0) {
cout << "yes"... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int x, i, y, j;
int chk = 0;
cin >> x;
int *ar = (int *)malloc(x * sizeof(int));
for (i = 1; i <= x; i++) {
cin >> y;
ar[i - 1] = y;
}
for (j = 0; j < x; j++) {
chk = chk ^ ar[j];
}
if (chk == 0) {
cout << "Yes"... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 781,804 | 781,805 | u018679195 | cpp |
p02975 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a[112345];
int main() {
int n, i;
cin >> n;
for (i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
vector<pair<int, int>> t;
int cnt = 0;
t.push_back({a[0], 1});
for (i = 1; i < n; ++i) {
if (a[i] != a[i - 1]) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a[112345];
int main() {
int n, i;
cin >> n;
for (i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
vector<pair<int, int>> t;
int cnt = 0;
t.push_back({a[0], 1});
for (i = 1; i < n; ++i) {
if (a[i] != a[i - 1]) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 781,818 | 781,819 | u505492660 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template <class T> using VE = vector<T>;
template <class T> using P = pair<T, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template <class T> using VE = vector<T>;
template <class T> using P = pair<T, ... | [
"control_flow.branch.if.condition.change"
] | 781,820 | 781,821 | u836743234 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | [
"control_flow.branch.if.condition.change",
"variable_declaration.add"
] | 781,822 | 781,823 | u371051907 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
vector<int> a(N);
map<int, int> Mp;
for (int i = 0; i < N; i++) {
cin >> a[i];
Mp[a... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
vector<int> a(N);
map<int, int> Mp;
for (int i = 0; i < N; i++) {
cin >> a[i];
Mp[a... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 781,824 | 781,825 | u237390401 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | [
"control_flow.branch.if.condition.change"
] | 781,829 | 781,830 | u600402037 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | [
"control_flow.branch.if.condition.change"
] | 781,831 | 781,830 | u600402037 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | [
"control_flow.branch.if.condition.change"
] | 781,829 | 781,832 | u600402037 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | [
"control_flow.branch.if.condition.change"
] | 781,831 | 781,832 | u600402037 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (... | [
"control_flow.branch.if.condition.change"
] | 781,835 | 781,836 | u813559924 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
// using ll = long long;
#define int long long
#define LOG(variable) cout << #variable ":\t" << (variable) << endl
#define LOGCON(i, container) \
for (int(i) = 0; (i) < (container).size(); ++(i)) ... | #include <bits/stdc++.h>
using namespace std;
// using ll = long long;
#define int long long
#define LOG(variable) cout << #variable ":\t" << (variable) << endl
#define LOGCON(i, container) \
for (int(i) = 0; (i) < (container).size(); ++(i)) ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 781,837 | 781,838 | u323748756 | cpp |
p02975 | /*
_____________ _____________ _____________ _____________
_____________ ( ___________) | _________ ) (___________ )
(___________ ) ( ___________) ( ( | | | ) | )
) ) ( ( ( (___________ | |_________| ) ___________| )
___________) ) ( (___________
(_____... | /*
_____________ _____________ _____________ _____________
_____________ ( ___________) | _________ ) (___________ )
(___________ ) ( ___________) ( ( | | | ) | )
) ) ( ( ( (___________ | |_________| ) ___________| )
___________) ) ( (___________
(_____... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 781,841 | 781,842 | u137653400 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
... | [
"control_flow.branch.if.condition.change"
] | 781,843 | 781,844 | u344125947 | cpp |
p02975 | #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.at(i);
map<int, int> m;
for (int i = 0; i < n; i++)
m[a.at(i)]++;
if (m[0] == n) {
puts("Yes");
return 0;
} else if (n % 3) {
puts("No");
return 0;
... | #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.at(i);
map<int, int> m;
for (int i = 0; i < n; i++)
m[a.at(i)]++;
if (m[0] == n) {
puts("Yes");
return 0;
} else if (n % 3) {
puts("No");
return 0;
... | [
"control_flow.branch.if.condition.change"
] | 781,845 | 781,846 | u697658632 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [] | 781,847 | 781,848 | u987913144 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
map<int, int> M;
rep(i, N) {
int a;
cin >> a;
M[a]++;
}
if (M.size() == 1 && M.find(0) != M.end()) {
cout << "Yes" << ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
map<int, int> M;
rep(i, N) {
int a;
cin >> a;
M[a]++;
}
if (M.size() == 1 && M.find(0) != M.end()) {
cout << "Yes" << ... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 781,849 | 781,850 | u741815956 | cpp |
p02975 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"control_flow.branch.if.condition.change"
] | 781,851 | 781,852 | u136342563 | cpp |
p02975 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 781,854 | 781,852 | u136342563 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
#define INF 0x3f3f3f3f
#define MOD 998244353LL
#define EPSILON 0.00001
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
#define INF 0x3f3f3f3f
#define MOD 998244353LL
#define EPSILON 0.00001
#define ... | [
"control_flow.branch.if.condition.change"
] | 781,855 | 781,856 | u396284099 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i =... | [
"call.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"call.add"
] | 781,857 | 781,858 | u001566280 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = (ll)1e10;
int main() {
ll n = 0;
auto a = vector<ll>(n, 0);
for (auto &i : a)
cin >> i;
auto ans = 0;
for (auto &i : a)
ans ^= i;
cout << (ans == 0 ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = (ll)1e10;
int main() {
ll n = 0;
cin >> n;
auto a = vector<ll>(n, 0);
for (auto &i : a)
cin >> i;
auto ans = 0;
for (auto &i : a)
ans ^= i;
cout << (ans == 0 ? "Yes" : "No");
return 0;
} | [] | 781,872 | 781,873 | u533749093 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N);
int cnt[4] = {0};
int tmp[4] = {0};
int pos = 0;
tmp[0] = a[0];
cnt[pos]++;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N);
int cnt[4] = {0};
int tmp[4] = {0};
int pos = 0;
tmp[0] = a[0];
cnt[pos]++;
for (int i = 1; i... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 781,874 | 781,875 | u872581897 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
re... | [
"control_flow.branch.if.condition.change"
] | 781,878 | 781,879 | u980655160 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long a, b;
cin >> a;
for (int i = 0; i < N; i++) {
cin >> b;
a ^= b;
}
cout << (a == 0 ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long a, b;
cin >> a;
for (int i = 0; i < N - 1; i++) {
cin >> b;
a ^= b;
}
cout << (a == 0 ? "Yes" : "No") << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 781,882 | 781,883 | u239087789 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
struct edge {
int from, to;
ll cost;
};
class Eratosthenes {
public:
vector<bool> prime;
Eratosthenes(ll size) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
struct edge {
int from, to;
ll cost;
};
class Eratosthenes {
public:
vector<bool> prime;
Eratosthenes(ll size) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 781,911 | 781,912 | u181806820 | cpp |
p02975 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
int n;
pair<int, int> res1, res2, res3;
main() {
cin >> n;
res1.F = res2.F = res3.F = 2e9;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (x < res1.F)
res3 = res2, res2 = res1, res1.F = x, res1.S = 1;
else i... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
int n;
pair<int, int> res1, res2, res3;
main() {
cin >> n;
res1.F = res2.F = res3.F = 2e9;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (x < res1.F)
res3 = res2, res2 = res1, res1.F = x, res1.S = 1;
else i... | [
"control_flow.branch.if.condition.change"
] | 781,926 | 781,927 | u898791488 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
signed main() {
int n;
cin >> n;
vector<int> a(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
if (mp[0] == n) {
cout << "Yes" << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
signed main() {
int n;
cin >> n;
vector<int> a(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
if (mp[0] == n) {
cout << "Yes" << endl;
... | [
"control_flow.branch.if.condition.change"
] | 781,932 | 781,933 | u344122377 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
signed main() {
int n;
cin >> n;
vector<int> a(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
if (mp[0] == n) {
cout << "Yes" << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
signed main() {
int n;
cin >> n;
vector<int> a(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
if (mp[0] == n) {
cout << "Yes" << endl;
... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 781,934 | 781,933 | u344122377 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt = 0;
int n;
cin >> n;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll b[n];
b[0] = a[0];
cnt = 1;
for (i = 1; i < n; i++) {
if (a[i - 1] != a[i])
b[cnt++] = a[i];
}
if (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt = 0;
int n;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll b[n];
b[0] = a[0];
cnt = 1;
for (i = 1; i < n; i++) {
if (a[i - 1] != a[i])
b[cnt++] = a[i];
}
if ... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 781,935 | 781,936 | u952130512 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt = 0;
int n;
cin >> n;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll b[n];
b[0] = a[0];
cnt = 1;
for (i = 1; i < n; i++) {
if (a[i - 1] != a[i])
b[cnt++] = a[i];
}
if (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt = 0;
int n;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll b[n];
b[0] = a[0];
cnt = 1;
for (i = 1; i < n; i++) {
if (a[i - 1] != a[i])
b[cnt++] = a[i];
}
if ... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 781,937 | 781,936 | u952130512 | cpp |
p02975 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int n;
vector<int> a;
int main() {
cin >> n;
a.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
map<int, int> count;
for (int _a : a) {
if (count.find(_a) == count.end())
count[_a] = 1;
else
count[_a]++;
... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int n;
vector<int> a;
int main() {
cin >> n;
a.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
map<int, int> count;
for (int _a : a) {
if (count.find(_a) == count.end())
count[_a] = 1;
else
count[_a]++;
... | [] | 781,940 | 781,941 | u886790158 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"control_flow.branch.if.condition.change"
] | 781,942 | 781,943 | u696290869 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"control_flow.branch.if.condition.change"
] | 781,944 | 781,943 | u696290869 | cpp |
p02975 | #include <algorithm>
#include <iostream>
using namespace std;
const int maxn = 1e5 + 10;
int a[maxn];
int num[4], id = 0, cnt = 0, v = -1;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
if (n % 3 != 0) {
for (int i = 1; i <= n; ++i)
if (a[i] != 0) {
cout << "No" ... | #include <algorithm>
#include <iostream>
using namespace std;
const int maxn = 1e5 + 10;
int a[maxn];
int num[4], id = 0, cnt = 0, v = -1;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
if (n % 3 != 0) {
for (int i = 1; i <= n; ++i)
if (a[i] != 0) {
cout << "No" ... | [
"control_flow.branch.if.condition.change"
] | 781,945 | 781,946 | u420303440 | cpp |
p02975 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int main() {
int N;
cin >> N;
map<int, int> cnt;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
cnt[a[i]]++;
}
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a.end()), a.end());
if... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int main() {
int N;
cin >> N;
map<int, int> cnt;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
cnt[a[i]]++;
}
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a.end()), a.end());
if... | [
"control_flow.branch.if.condition.change"
] | 781,950 | 781,951 | u243961437 | cpp |
p02975 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> a(N);
map<int, int> cnt;
for (int i = 0; i < N; i++) {
cin >> a[i];
cnt[a[i]]++;
}
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> a(N);
map<int, int> cnt;
for (int i = 0; i < N; i++) {
cin >> a[i];
cnt[a[i]]++;
}
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a... | [
"control_flow.branch.if.condition.change"
] | 781,952 | 781,953 | u243961437 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
map<int, int> mp;
for (auto &x : a) {
cin >> x;
mp[x]++;
}
sort(a.begin(), a.end());
unique(a.begin(), a.end());
if (mp.size() == 3) {
if ((mp[a[0]] == mp[a[1]]) && (mp[a[1]] == mp[a[2]]) &&
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
map<int, int> mp;
for (auto &x : a) {
cin >> x;
mp[x]++;
}
sort(a.begin(), a.end());
unique(a.begin(), a.end());
if (mp.size() == 3) {
if ((mp[a[0]] == mp[a[1]]) && (mp[a[1]] == mp[a[2]]) &&
... | [
"control_flow.branch.if.condition.change"
] | 781,954 | 781,955 | u096840034 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (mp[a] == 0) {
c.push_back(a);
}
mp[a]++;
}
sort(c.begin(), c.end());
if (c.size() == 1) {
if (c[0] == 0) {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (mp[a] == 0) {
c.push_back(a);
}
mp[a]++;
}
sort(c.begin(), c.end());
if (c.size() == 1) {
if (c[0] == 0) {
c... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 781,956 | 781,957 | u244626757 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define gsort(x) sort(x, x + n, greater<ll>());
#define sync \
ios_base::sync_w... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define gsort(x) sort(x, x + n, greater<ll>());
#define sync \
ios_base::sync_w... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 781,960 | 781,961 | u808256772 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
unordered_map<int, int> mp;
int n, a[maxn];
int tot = 0;
int cnt[maxn];
int b[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
if (!mp.count(a[i])) {
mp[a[i]] = ++tot;
b[tot] = a[i]... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
unordered_map<int, int> mp;
int n, a[maxn];
int tot = 0;
int cnt[maxn];
int b[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
if (!mp.count(a[i])) {
mp[a[i]] = ++tot;
b[tot] = a[i]... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 781,962 | 781,963 | u861136518 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, a[maxn];
int main() {
scanf("%d", &n);
long long ans = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
ans ^= a[i];
}
sort(a + 1, a + 1 + n);
n = unique(a + 1, a + 1 + n) - a - 1;
if (n < 3 || ans)
puts("N... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, a[maxn];
int main() {
scanf("%d", &n);
long long ans = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
ans ^= a[i];
}
sort(a + 1, a + 1 + n);
n = unique(a + 1, a + 1 + n) - a - 1;
if (ans)
puts("No");
el... | [
"expression.operation.binary.remove"
] | 781,964 | 781,965 | u861136518 | cpp |
p02975 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
t... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
t... | [
"control_flow.branch.if.condition.change"
] | 781,968 | 781,969 | u757628628 | cpp |
p02975 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll MOD = 998244353;
int main() {
int N, A;
cin >> N;
map<int, int> mp;
rep(i, N) {
cin >> A;
auto itr = mp.find(A);
if (itr != mp.end())
mp[A]++;
else
mp[A] = 1;... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll MOD = 998244353;
int main() {
int N, A;
cin >> N;
map<int, int> mp;
rep(i, N) {
cin >> A;
auto itr = mp.find(A);
if (itr != mp.end())
mp[A]++;
else
mp[A] = 1;... | [
"control_flow.branch.if.condition.change"
] | 781,975 | 781,976 | u555962250 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define INF 11000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int N, coun... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define INF 11000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int N, coun... | [
"assignment.add"
] | 781,977 | 781,978 | u591914971 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
mp[a]++;
}
bool ans = true;
if (mp.size() == 3) {
for (auto p : mp) {
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
mp[a]++;
}
bool ans = true;
if (mp.size() == 3) {
for (auto p : mp) {
if (... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 781,995 | 781,996 | u708258059 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
mp[a]++;
}
bool ans = true;
if (mp.size() == 3) {
for (auto p : mp) {
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
mp[a]++;
}
bool ans = true;
if (mp.size() == 3) {
for (auto p : mp) {
if (... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 781,997 | 781,996 | u708258059 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
mp[a]++;
}
bool ans = true;
if (mp.size() == 3) {
for (auto p : mp) {
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
mp[a]++;
}
bool ans = true;
if (mp.size() == 3) {
for (auto p : mp) {
if (... | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 781,998 | 781,996 | u708258059 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep_down(i, n) for (int i = n - 1; i >= 0; --i)
#define ALL(a) (a)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep_down(i, n) for (int i = n - 1; i >= 0; --i)
#define ALL(a) (a)... | [
"expression.operation.binary.remove"
] | 781,999 | 782,000 | u288087195 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, i0, n) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, i0, n) ... | [
"call.function.change",
"control_flow.branch.if.condition.change"
] | 782,005 | 782,006 | u358748139 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, i0, n) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, i0, n) ... | [
"control_flow.branch.if.condition.change"
] | 782,007 | 782,006 | u358748139 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> xs(n);
for (int &x : xs) {
cin >> x;
}
if (n % 3 != 0) {
for (int x : xs) {
if (x != 0) {
cout << "No" << endl;
return 0;
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> xs(n);
for (int &x : xs) {
cin >> x;
}
if (n % 3 != 0) {
for (int x : xs) {
if (x != 0) {
cout << "No" << endl;
return 0;
}
}
cou... | [
"control_flow.branch.if.condition.change"
] | 782,008 | 782,009 | u813181182 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | [
"expression.operation.binary.remove"
] | 782,010 | 782,011 | u685892567 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (LLONG_MAX)
#define MOD (1000000007)
#define MAX (100000)
#define pii pair<int, int>
/////////////////////////////////////////////////////////
class XY ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (LLONG_MAX)
#define MOD (1000000007)
#define MAX (100000)
#define pii pair<int, int>
/////////////////////////////////////////////////////////
class XY ... | [
"control_flow.branch.if.condition.change"
] | 782,021 | 782,022 | u855985627 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
const int MOD = 1000000007;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
int main() {
int N;
cin >> N;
map<int, int> mp;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
const int MOD = 1000000007;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
int main() {
int N;
cin >> N;
map<int, int> mp;
... | [
"control_flow.branch.if.condition.change"
] | 782,030 | 782,031 | u095756391 | cpp |
p02975 | #include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define loop(i, a, b) for (int i = a; i < (b); ++i)
#define in(v) cin >> v;
#define out(v) cout << v << "\n"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
in(N);
int A[N];
bool is_... | #include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define loop(i, a, b) for (int i = a; i < (b); ++i)
#define in(v) cin >> v;
#define out(v) cout << v << "\n"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
in(N);
int A[N];
bool is_... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 782,032 | 782,033 | u025592199 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000007;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N);
if (A[0] == 0 && A[N - 1] == 0) {
cout << "Yes" << endl;
return 0;
}
if (N % 3 != 0) {
cout << "No" << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000007;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N);
if (A[0] == 0 && A[N - 1] == 0) {
cout << "Yes" << endl;
return 0;
}
if (N % 3 != 0) {
cout << "No" << endl;
ret... | [
"control_flow.branch.if.condition.change"
] | 782,034 | 782,035 | u415916075 | cpp |
p02975 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#ifdef _debug
#define out(i) cout << #i << ' ' << i
#else
#define out(i)
#endif
using ll = long long;
using ull = unsigned long long;
using ul = unsigned;
using db = double;
#define int ul
const int maxn = 200001;
int n;
int a[maxn];
map<int, int>... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#ifdef _debug
#define out(i) cout << #i << ' ' << i
#else
#define out(i)
#endif
using ll = long long;
using ull = unsigned long long;
using ul = unsigned;
using db = double;
#define int ul
const int maxn = 200001;
int n;
int a[maxn];
map<int, int>... | [
"expression.operation.binary.remove"
] | 782,036 | 782,037 | u233690053 | cpp |
p02975 | #include <bits/stdc++.h>
#define int long long
#define lint long long
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) m... | #include <bits/stdc++.h>
#define int long long
#define lint long long
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) m... | [
"control_flow.branch.if.condition.change"
] | 782,038 | 782,039 | u141642872 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
map<int, int> m;
vector<pair<int, int>> pairs;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
m[v]++;
}
for (auto it : m) {
pairs.emplace_back(it.first, it.second);
}
if (pairs.size() == 3 && pairs[0].second == pai... | #include <bits/stdc++.h>
using namespace std;
map<int, int> m;
vector<pair<int, int>> pairs;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
m[v]++;
}
for (auto it : m) {
pairs.emplace_back(it.first, it.second);
}
if (pairs.size() == 3 && pairs[0].second == pai... | [
"control_flow.branch.if.condition.change"
] | 782,040 | 782,041 | u087498247 | cpp |
p02975 | #include <algorithm>
#include <cstdio>
const int MN = 100005;
int N, A[MN], B[MN], C[MN], M;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i)
scanf("%d", &A[i]), B[i] = A[i];
std::sort(B + 1, B + N + 1), M = std::unique(B + 1, B + N + 1) - B - 1;
if (M > 3)
return puts("No"), 0;
if (M == ... | #include <algorithm>
#include <cstdio>
const int MN = 100005;
int N, A[MN], B[MN], C[MN], M;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i)
scanf("%d", &A[i]), B[i] = A[i];
std::sort(B + 1, B + N + 1), M = std::unique(B + 1, B + N + 1) - B - 1;
if (M > 3)
return puts("No"), 0;
if (M == ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 782,042 | 782,043 | u095826906 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define int long long
#define mn 100005
#define inf 4444444444444444444
#define mod 100... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define int long long
#define mn 100005
#define inf 4444444444444444444
#define mod 100... | [] | 782,049 | 782,050 | u624520031 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define int long long
#define mn 100005
#define inf 4444444444444444444
#define mod 100... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define int long long
#define mn 100005
#define inf 4444444444444444444
#define mod 100... | [
"control_flow.branch.if.condition.change"
] | 782,051 | 782,050 | u624520031 | cpp |
p02975 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG ce... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG ce... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 782,052 | 782,053 | u905715926 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.