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 <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__ <<... | [
"call.arguments.change"
] | 782,058 | 782,059 | u525288965 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
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]] += 1;
}
if (cnt[0] == n) {
cout << "Yes" << endl;
return 0;
}
if (n % 3 != 0) {
cout << "No" << endl;
return 0... | #include <bits/stdc++.h>
using namespace std;
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]] += 1;
}
if (cnt[0] == n) {
cout << "Yes" << endl;
return 0;
}
if (n % 3 != 0) {
cout << "No" << endl;
return 0... | [
"control_flow.branch.if.condition.change"
] | 782,066 | 782,065 | u138486156 | cpp |
p02975 | /*
гонфлад
*/
#pragma ARCENIY_KIRILLOV_UVIDEL_KROKODILOV
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("no-stack-protector")
//#pragma GCC push_options
//#pragma GCC optimize ("unroll-l... | /*
гонфлад
*/
#pragma ARCENIY_KIRILLOV_UVIDEL_KROKODILOV
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("no-stack-protector")
//#pragma GCC push_options
//#pragma GCC optimize ("unroll-l... | [
"control_flow.branch.if.condition.change"
] | 782,069 | 782,070 | u122149278 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long n;
cin >> n;
map<long long, long long> mp;
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
mp[a]++;
}
if (mp.size() == 1) {
for (auto x : mp) {
if (x.fi... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long n;
cin >> n;
map<long long, long long> mp;
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
mp[a]++;
}
if (mp.size() == 1) {
for (auto x : mp) {
if (x.fi... | [
"control_flow.branch.if.condition.change"
] | 782,080 | 782,081 | u136869985 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (... | [
"control_flow.branch.if.condition.change"
] | 782,084 | 782,085 | u057866967 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define f first
#define s second
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
ll... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define f first
#define s second
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
ll... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,093 | 782,094 | u714262341 | cpp |
p02975 | /*author ADITYA BANSAL
//~ MNNIT ALLAHABAD */
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace std;
#define db double
#define ll long long
#define ull unsigned long long
ll power(ll, ll);
ll ncr(ll, ll);
void seive();
void ... | /*author ADITYA BANSAL
//~ MNNIT ALLAHABAD */
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace std;
#define db double
#define ll long long
#define ull unsigned long long
ll power(ll, ll);
ll ncr(ll, ll);
void seive();
void ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,101 | 782,102 | u719780128 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
i... | [
"control_flow.branch.if.condition.change"
] | 782,110 | 782,111 | u773916255 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < 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;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < 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"
] | 782,115 | 782,116 | u666394517 | cpp |
p02975 | // https://atcoder.jp/contests/agc035/tasks/agc035_a
// A - XOR Circle
// a,b,a^b でならぶので、a,b,a^bの3種
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define FOR(i, a, b) for (int64_t i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
ll N;
cin >> N;
vector<ll> an(N);
unordered_m... | // https://atcoder.jp/contests/agc035/tasks/agc035_a
// A - XOR Circle
// a,b,a^b でならぶので、a,b,a^bの3種
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define FOR(i, a, b) for (int64_t i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
ll N;
cin >> N;
vector<ll> an(N);
unordered_m... | [
"control_flow.branch.if.condition.change"
] | 782,122 | 782,123 | u182321487 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
auto solve = [&]() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
map<int, int> c;
for (int i = 0; i < n; ++i) {
++c[a[i]];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
auto solve = [&]() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
map<int, int> c;
for (int i = 0; i < n; ++i) {
++c[a[i]];
... | [
"control_flow.branch.if.condition.change"
] | 782,124 | 782,125 | u499656581 | cpp |
p02975 | #include <bits/stdc++.h>
int main() {
using namespace std;
size_t N;
cin >> N;
unordered_map<unsigned long, size_t> mp;
for (unsigned long i = 0, a; i < N; ++i) {
cin >> a;
++mp[a];
}
if (mp.size() > 3)
return 0 & puts("No");
if (mp.size() == 1)
return 0 & puts(mp[0] == N ? "Yes" : "No"... | #include <bits/stdc++.h>
int main() {
using namespace std;
size_t N;
cin >> N;
unordered_map<unsigned long, size_t> mp;
for (unsigned long i = 0, a; i < N; ++i) {
cin >> a;
++mp[a];
}
if (mp.size() > 3)
return 0 & puts("No");
if (mp.size() == 1)
return 0 & puts(mp[0] == N ? "Yes" : "No"... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 782,130 | 782,131 | u462437857 | cpp |
p02975 | #include <bits/stdc++.h>
int main() {
using namespace std;
size_t N;
cin >> N;
unordered_map<unsigned long, size_t> mp;
for (unsigned long i = 0, a; i < N; ++i) {
cin >> a;
++mp[a];
}
if (mp.size() > 3)
return 0 & puts("No");
if (mp.size() == 1)
return 0 & puts(mp[0] == N ? "Yes" : "No"... | #include <bits/stdc++.h>
int main() {
using namespace std;
size_t N;
cin >> N;
unordered_map<unsigned long, size_t> mp;
for (unsigned long i = 0, a; i < N; ++i) {
cin >> a;
++mp[a];
}
if (mp.size() > 3)
return 0 & puts("No");
if (mp.size() == 1)
return 0 & puts(mp[0] == N ? "Yes" : "No"... | [
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 782,130 | 782,132 | u462437857 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a)
cin >> x;
std::sort(a.begin(), a.end());
int k = 0, t = a[0];
vector<int> b(3), c(3);
for (auto &x : a) {
if (t != x)
k++, t = x;
if (k >= 3) {
cout << "No" << ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<long> a(n);
for (auto &x : a)
cin >> x;
std::sort(a.begin(), a.end());
int k = 0, t = a[0];
vector<int> b(3), c(3);
for (auto &x : a) {
if (t != x)
k++, t = x;
if (k >= 3) {
cout << "No" <<... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change"
] | 782,133 | 782,134 | u056944756 | cpp |
p02975 | #include "bits/stdc++.h"
using namespace std;
const int MAXN = 1e5 + 5;
int n, a[MAXN];
map<int, int> num;
vector<int> vals;
int main() {
scanf("%d", &n);
bool doZero = false;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
num[a[i]]++;
if (a[i] == 0)
doZero = true;
}
if (n % 3 == 0) {
... | #include "bits/stdc++.h"
using namespace std;
const int MAXN = 1e5 + 5;
int n, a[MAXN];
map<int, int> num;
vector<int> vals;
int main() {
scanf("%d", &n);
bool doZero = false;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
num[a[i]]++;
if (a[i] == 0)
doZero = true;
}
if (n % 3 == 0) {
... | [
"control_flow.branch.if.condition.change"
] | 782,143 | 782,144 | u198150045 | cpp |
p02975 | #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 curr;
cin >> curr;
mp[curr]++;
}
// case
if (mp.size() == 1 && mp[0] > 0) {
cout << "Yes" << endl;
} else if (mp.size() == 3 && n % 3 == 0) {
vector<int> ar... | #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 curr;
cin >> curr;
mp[curr]++;
}
// case
if (mp.size() == 1 && mp[0] > 0) {
cout << "Yes" << endl;
} else if (mp.size() == 3 && n % 3 == 0) {
vector<int> ar... | [
"control_flow.branch.if.condition.change"
] | 782,156 | 782,157 | u542111796 | cpp |
p02975 | #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 curr;
cin >> curr;
mp[curr]++;
}
// case
if (mp.size() == 1 && mp[0] > 0) {
cout << "Yes" << endl;
} else if (mp.size() == 3 && n % 3 == 0) {
vector<int> ar... | #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 curr;
cin >> curr;
mp[curr]++;
}
// case
if (mp.size() == 1 && mp[0] > 0) {
cout << "Yes" << endl;
} else if (mp.size() == 3 && n % 3 == 0) {
vector<int> ar... | [
"control_flow.branch.if.condition.change"
] | 782,158 | 782,159 | u542111796 | cpp |
p02975 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | [
"control_flow.branch.if.condition.change"
] | 782,160 | 782,161 | u700484101 | cpp |
p02975 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
#define MOD 1000000007
#define EPS 10e-8
ll p[3]; // kazu
ll g[3]; // p[i]no kazu
int main() {
ll n;
ll c = 0... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
#define MOD 1000000007
#define EPS 10e-8
ll p[3]; // kazu
ll g[3]; // p[i]no kazu
int main() {
ll n;
ll c = 0... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 782,169 | 782,170 | u008229752 | cpp |
p02975 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
#define MOD 1000000007
#define EPS 10e-8
ll p[3]; // kazu
ll g[3]; // p[i]no kazu
int main() {
ll n;
ll c = 0... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
#define MOD 1000000007
#define EPS 10e-8
ll p[3]; // kazu
ll g[3]; // p[i]no kazu
int main() {
ll n;
ll c = 0... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 782,169 | 782,171 | u008229752 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 782,174 | 782,175 | u348670055 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 782,176 | 782,175 | u348670055 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | [
"control_flow.branch.if.condition.change"
] | 782,177 | 782,175 | u348670055 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
map<int, int> C;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
sort(A.begin(), A.end());
for (auto i : A)
++C[i];
A.erase(unique(A.begin(), A.end()), A.end());
i... | #include <bits/stdc++.h>
using namespace std;
map<int, int> C;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
sort(A.begin(), A.end());
for (auto i : A)
++C[i];
A.erase(unique(A.begin(), A.end()), A.end());
i... | [
"control_flow.branch.if.condition.change"
] | 782,182 | 782,183 | u935196741 | cpp |
p02975 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool all_zero(vector<int> V) {
bool flag = true;
for (int i = 1; i < V.size(); i++) {
if (V[0] == 0) {
if (V[i - 1] != V[i])
flag = false;
} else {
flag = false;
}
}
return flag;
}
int main() {
i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool all_zero(vector<int> V) {
bool flag = true;
for (int i = 1; i < V.size(); i++) {
if (V[0] == 0) {
if (V[i - 1] != V[i])
flag = false;
} else {
flag = false;
}
}
return flag;
}
int main() {
i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 782,184 | 782,185 | u056123277 | cpp |
p02975 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#pragma warning(disable : 4996)
const int maxn = 100005;
int a[maxn];
map<int, int> Map;
vector<int> E;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
i... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#pragma warning(disable : 4996)
const int maxn = 100005;
int a[maxn];
map<int, int> Map;
vector<int> E;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
i... | [
"control_flow.branch.if.condition.change"
] | 782,188 | 782,189 | u825625766 | cpp |
p02975 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n);
map<long long, int> mp;
for (int i = 0; i < n; i++) {
cin >> v[i];
mp[v[i]]++;
}
if (mp[0] == n)
return !printf("Yes");
if (n % 3 != 0)
return !printf("No");
vector<long long> res;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n);
map<long long, int> mp;
for (int i = 0; i < n; i++) {
cin >> v[i];
mp[v[i]]++;
}
if (mp[0] == n)
return !printf("Yes");
if (n % 3 != 0)
return !printf("No");
vector<long long> res;
... | [
"control_flow.branch.if.condition.change"
] | 782,194 | 782,195 | u717021668 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
unordered_map<ll, ll> mp;
ll zero = 0;
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
unordered_map<ll, ll> mp;
ll zero = 0;
for (int i = 0; i < ... | [
"control_flow.branch.if.condition.change"
] | 782,200 | 782,201 | u637771514 | cpp |
p02975 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, x) for (int i = 0; i < x; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> ivec;
const ll N = 1e9 + 7;
int main() {
int n;
cin >> n;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, x) for (int i = 0; i < x; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> ivec;
const ll N = 1e9 + 7;
int main() {
int n;
cin >> n;
... | [
"control_flow.branch.if.condition.change"
] | 782,205 | 782,206 | u899645116 | cpp |
p02975 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, x) for (int i = 0; i < x; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> ivec;
const ll N = 1e9 + 7;
int main() {
int n;
cin >> n;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, x) for (int i = 0; i < x; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> ivec;
const ll N = 1e9 + 7;
int main() {
int n;
cin >> n;
... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 782,207 | 782,206 | u899645116 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [] | 782,210 | 782,211 | u093922224 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
map<int, int> occs;
for (int i = 0; i < n; ++i) {
int x;
scanf("%d", &x);
occs[x]++;
}
// a b a^b a b a^b a (= b)
// x x 0 x x 0
//
string answer = "No";
if (occs.count(0) > 0 && occs[0] == n)
answer... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
map<int, int> occs;
for (int i = 0; i < n; ++i) {
int x;
scanf("%d", &x);
occs[x]++;
}
// a b a^b a b a^b a (= b)
// x x 0 x x 0
//
string answer = "No";
if (occs.count(0) > 0 && occs[0] == n)
answer... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 782,218 | 782,219 | u904217313 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
map<int, int> occs;
for (int i = 0; i < n; ++i) {
int x;
scanf("%d", &x);
occs[x]++;
}
// a b a^b a b a^b a (= b)
// x x 0 x x 0
//
string answer = "No";
if (occs.count(0) > 0 && occs[0] == n)
answer... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
map<int, int> occs;
for (int i = 0; i < n; ++i) {
int x;
scanf("%d", &x);
occs[x]++;
}
// a b a^b a b a^b a (= b)
// x x 0 x x 0
//
string answer = "No";
if (occs.count(0) > 0 && occs[0] == n)
answer... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 782,220 | 782,219 | u904217313 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
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.resize(unique(a.begin(), a.end()) - a.begin());
if (a.size() == 1 && a[0] == 0) {
cout <<... | #include <bits/stdc++.h>
using namespace std;
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.resize(unique(a.begin(), a.end()) - a.begin());
if (a.size() == 1 && a[0] == 0) {
cout <<... | [
"control_flow.branch.if.condition.change"
] | 782,227 | 782,228 | u537871123 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> camels(n);
set<int> xo;
for (int i = 0; i < n; i++) {
l... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> camels(n);
set<int> xo;
for (int i = 0; i < n; i++) {
l... | [
"literal.string.change",
"io.output.change"
] | 782,234 | 782,235 | u906095123 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define N 505
#define mod 998244353
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll bexp(ll a, ll b) {... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define N 505
#define mod 998244353
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll bexp(ll a, ll b) {... | [
"control_flow.branch.if.condition.change"
] | 782,247 | 782,246 | u060049558 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define N 505
#define mod 998244353
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll bexp(ll a, ll b) {... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define N 505
#define mod 998244353
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll bexp(ll a, ll b) {... | [
"control_flow.branch.if.condition.change"
] | 782,248 | 782,246 | u060049558 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e5 + 5;
const int MOD = 1e9 + 7;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define FAIL0 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e5 + 5;
const int MOD = 1e9 + 7;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define FAIL0 ... | [
"control_flow.branch.if.condition.change"
] | 782,249 | 782,250 | u066478371 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e5 + 5;
const int MOD = 1e9 + 7;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define FAIL0 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e5 + 5;
const int MOD = 1e9 + 7;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define FAIL0 ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 782,251 | 782,250 | u066478371 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef l... | [
"assignment.value.change"
] | 782,257 | 782,258 | u130834452 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int a[N];
// 36 - 38 - idea
// 39 - 41 - how to code
int main() {
int n;
scanf("%d", &n);
map<int, int> mp;
vector<int> v;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
mp[a[i]]++;
v.push_back(a[i]);
}
sort(v.begin(... | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int a[N];
// 36 - 38 - idea
// 39 - 41 - how to code
int main() {
int n;
scanf("%d", &n);
map<int, int> mp;
vector<int> v;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
mp[a[i]]++;
v.push_back(a[i]);
}
sort(v.begin(... | [
"expression.operation.binary.remove"
] | 782,259 | 782,260 | u939637096 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int a[N];
// 36 - 38 - idea
// 39 - 41 - how to code
int main() {
int n;
scanf("%d", &n);
map<int, int> mp;
vector<int> v;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
mp[a[i]]++;
v.push_back(a[i]);
}
sort(v.begin(... | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int a[N];
// 36 - 38 - idea
// 39 - 41 - how to code
int main() {
int n;
scanf("%d", &n);
map<int, int> mp;
vector<int> v;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
mp[a[i]]++;
v.push_back(a[i]);
}
sort(v.begin(... | [
"assignment.change"
] | 782,261 | 782,260 | u939637096 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a, s;
map<long long, long long> mp;
bool solve();
int main() {
cin >> n;
a.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
if (solve())
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
bool solve() ... | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a, s;
map<long long, long long> mp;
bool solve();
int main() {
cin >> n;
a.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
if (solve())
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
bool solve() ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 782,264 | 782,265 | u269963329 | cpp |
p02975 | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;... | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,266 | 782,267 | u394634573 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
bool f0 = true;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != 0)
f0 = false;
}
if (f0) {
cout << "Yes" << endl;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
bool f0 = true;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != 0)
f0 = false;
}
if (f0) {
cout << "Yes" << endl;
... | [
"control_flow.branch.if.condition.change"
] | 782,268 | 782,269 | u553623615 | cpp |
p02975 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main() {
int n;
cin >> n;
int cnt;
REP(i, n) {
int temp;
cin >> temp;
if (i == 0) {
cnt == temp;
} else {
cnt ^= temp;
}
}
if (cnt == 0... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main() {
int n;
cin >> n;
int cnt;
REP(i, n) {
int temp;
cin >> temp;
if (i == 0) {
cnt = temp;
} else {
cnt ^= temp;
}
}
if (cnt == 0)... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 782,272 | 782,273 | u538853954 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repn(i, n) for (ll i = 0; i <= (ll)(n); i++)
typed... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repn(i, n) for (ll i = 0; i <= (ll)(n); i++)
typed... | [
"control_flow.branch.if.condition.change"
] | 782,285 | 782,286 | u317711717 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
int a, b, c, ax = 0, bx = 0, cx = 0, x = 1;
string ans = "No";
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
a = v[0];
ax++;
for (int i = 1; i < n; i++) {
if (v[i - 1] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
int a, b, c, ax = 0, bx = 0, cx = 0, x = 1;
string ans = "No";
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
a = v[0];
ax++;
for (int i = 1; i < n; i++) {
if (v[i - 1] ... | [
"control_flow.branch.if.condition.change"
] | 782,287 | 782,288 | u249546633 | cpp |
p02975 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
vector<int64> a(N);
vector<int64> num;
int64 num0 = 0, num1 = 0, num2 = 0;
for (int64 i = 0; i < N; i++) {
cin >> a[i];
}
... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
vector<int64> a(N);
vector<int64> num;
int64 num0 = 0, num1 = 0, num2 = 0;
for (int64 i = 0; i < N; i++) {
cin >> a[i];
}
... | [
"control_flow.branch.if.condition.change"
] | 782,289 | 782,290 | u647569169 | cpp |
p02975 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
vector<int64> a(N);
vector<int64> num;
int64 num0 = 0, num1 = 0, num2 = 0;
for (int64 i = 0; i < N; i++) {
cin >> a[i];
}
... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
vector<int64> a(N);
vector<int64> num;
int64 num0 = 0, num1 = 0, num2 = 0;
for (int64 i = 0; i < N; i++) {
cin >> a[i];
}
... | [
"control_flow.branch.if.condition.change"
] | 782,291 | 782,290 | u647569169 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, a[100008];
int main() {
cin >> n;
map<ll, ll> mp;
string ans = "No";
for (ll i = 0; i < n; i++) {
cin >> a[i];
auto it... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, a[100008];
int main() {
cin >> n;
map<ll, ll> mp;
string ans = "No";
for (ll i = 0; i < n; i++) {
cin >> a[i];
auto it... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 782,304 | 782,305 | u388697579 | cpp |
p02975 | #include <bits/stdc++.h>
#define REP(x, y, z) for (int x = y; x <= z; x++)
#define FORD(x, y, z) for (int x = y; x >= z; x--)
#define MSET(x, y) memset(x, y, sizeof(x))
#define FOR(x, y) for (__typeof(y.begin()) x = y.begin(); x != y.end(); x++)
#define F first
#define S second
#define MP make_pair
#define PB push_back... | #include <bits/stdc++.h>
#define REP(x, y, z) for (int x = y; x <= z; x++)
#define FORD(x, y, z) for (int x = y; x >= z; x--)
#define MSET(x, y) memset(x, y, sizeof(x))
#define FOR(x, y) for (__typeof(y.begin()) x = y.begin(); x != y.end(); x++)
#define F first
#define S second
#define MP make_pair
#define PB push_back... | [
"control_flow.branch.if.condition.change"
] | 782,310 | 782,311 | u978434688 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int n;
bool solve() {
int i, j;
string str;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
vector<pair<int, int>> ct;
ct.push_back(make_pair(a[0], 1));
for (i = 1; i < n; i++) {
if (a[i] == a[i -... | #include <bits/stdc++.h>
using namespace std;
int n;
bool solve() {
int i, j;
string str;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
vector<pair<int, int>> ct;
ct.push_back(make_pair(a[0], 1));
for (i = 1; i < n; i++) {
if (a[i] == a[i -... | [
"control_flow.branch.if.condition.change"
] | 782,314 | 782,315 | u309112964 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int n;
bool solve() {
int i, j;
string str;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
vector<pair<int, int>> ct;
ct.push_back(make_pair(a[0], 1));
for (i = 1; i < n; i++) {
if (a[i] == a[i -... | #include <bits/stdc++.h>
using namespace std;
int n;
bool solve() {
int i, j;
string str;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
vector<pair<int, int>> ct;
ct.push_back(make_pair(a[0], 1));
for (i = 1; i < n; i++) {
if (a[i] == a[i -... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 782,316 | 782,315 | u309112964 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
const long long N = 1e5 + 100;
long long n, a[N];
map<long long, long long> cnt;
set<long long> st;
int main() {
ios_base::sync_with_stdio(false);
cin ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
const long long N = 1e5 + 100;
long long n, a[N];
map<long long, long long> cnt;
set<long long> st;
int main() {
ios_base::sync_with_stdio(false);
cin ... | [
"control_flow.branch.if.condition.change"
] | 782,319 | 782,320 | u866968224 | cpp |
p02975 | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int No() {
cout << "No";
return 0;
}
int Yes() {
cout << "Yes";
return 0;
}
int main() {
int a[3][2] = {}, n;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
for (int ... | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int No() {
cout << "No";
return 0;
}
int Yes() {
cout << "Yes";
return 0;
}
int main() {
int a[3][2] = {}, n;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
for (int ... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 782,321 | 782,322 | u145483532 | cpp |
p02975 | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int No() {
cout << "No";
return 0;
}
int Yes() {
cout << "Yes";
return 0;
}
int main() {
int a[3][2] = {}, n;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
for (int ... | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int No() {
cout << "No";
return 0;
}
int Yes() {
cout << "Yes";
return 0;
}
int main() {
int a[3][2] = {}, n;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
for (int ... | [
"control_flow.branch.if.condition.change"
] | 782,323 | 782,322 | u145483532 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline int read() {
int out = 0, fh = 1;
char jp = getchar();
while ((jp > '9' || jp < '0') && jp != '-')
jp = getchar();
if (jp == '-')
fh = -1, jp = getchar();
while (jp >= '0' && jp <= '9')
out = out * 10 + jp - '0', jp = getch... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline int read() {
int out = 0, fh = 1;
char jp = getchar();
while ((jp > '9' || jp < '0') && jp != '-')
jp = getchar();
if (jp == '-')
fh = -1, jp = getchar();
while (jp >= '0' && jp <= '9')
out = out * 10 + jp - '0', jp = getch... | [
"function.return_value.change"
] | 782,332 | 782,333 | u351568836 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
string s;
const int max_n = 1e5 + 10;
int main() {
int n, a[max_n];
pair<int, int> b[3];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
bool flag = true;
for (int i = 0; i < n; ++i) {
if (a[i] != 0) {
flag = false;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
string s;
const int max_n = 1e5 + 10;
int main() {
int n, a[max_n];
pair<int, int> b[3];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
bool flag = true;
for (int i = 0; i < n; ++i) {
if (a[i] != 0) {
flag = false;
break;
}
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 782,336 | 782,337 | u835629653 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
string s;
const int max_n = 1e5 + 10;
int main() {
int n, a[max_n];
pair<int, int> b[3];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
bool flag = true;
for (int i = 0; i < n; ++i) {
if (a[i] != 0) {
flag = false;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
string s;
const int max_n = 1e5 + 10;
int main() {
int n, a[max_n];
pair<int, int> b[3];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
bool flag = true;
for (int i = 0; i < n; ++i) {
if (a[i] != 0) {
flag = false;
break;
}
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 782,338 | 782,337 | u835629653 | cpp |
p02975 | #include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | #include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | [
"expression.operation.binary.remove"
] | 782,339 | 782,340 | u895067736 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = 1LL << 60;
int main()... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = 1LL << 60;
int main()... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 782,344 | 782,345 | u553605501 | cpp |
p02975 | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MAXN 100005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;
typed... | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MAXN 100005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;
typed... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 782,351 | 782,352 | u237254894 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define... | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define... | [
"call.remove",
"call.add"
] | 782,353 | 782,354 | u634743753 | cpp |
p02975 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath> // 変数名にy1が使えなくなるかも…。
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#in... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath> // 変数名にy1が使えなくなるかも…。
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#in... | [
"control_flow.branch.if.condition.change"
] | 782,368 | 782,369 | u370768058 | cpp |
p02975 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stri... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stri... | [
"control_flow.branch.if.condition.change"
] | 782,375 | 782,376 | u313288017 | cpp |
p02975 | //#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a, v) memset((a), (v), sizeof(a))
#define enl printf("\n")
#define case (t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%... | //#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a, v) memset((a), (v), sizeof(a))
#define enl printf("\n")
#define case (t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%... | [
"control_flow.branch.if.condition.change"
] | 782,377 | 782,378 | u270920804 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | [
"control_flow.branch.if.condition.change"
] | 782,379 | 782,380 | u508571192 | cpp |
p02975 | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
ll list[3][2];
void init() {
for (int i = 0; i < 3; i++) {
l... | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
ll list[3][2];
void init() {
for (int i = 0; i < 3; i++) {
l... | [
"expression.operation.binary.remove"
] | 782,383 | 782,384 | u828752458 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 782,396 | 782,397 | u092002408 | cpp |
p02975 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REV(c) reverse((c).begin(), (c).end())
using namespace std;
typedef pair<int, int> P;
// 最大公約数
int64_t gcd(int64_t a, int64_t b) { return b != 0 ? gcd(b, ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REV(c) reverse((c).begin(), (c).end())
using namespace std;
typedef pair<int, int> P;
// 最大公約数
int64_t gcd(int64_t a, int64_t b) { return b != 0 ? gcd(b, ... | [
"call.add"
] | 782,398 | 782,399 | u942230032 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long lo... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long lo... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 782,404 | 782,405 | u754514364 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
map<int, int> cnt;
vector<int> num;
for (int i = 0; i < N; ++i) {
cin >> A[i];
cnt[A[i]] += 1;
if (cnt[A[i]] == 1)
num.push_back(A[i]);
}
if (N % 3) {
if (cnt[0] == N)
cout << "Yes... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
map<int, int> cnt;
vector<int> num;
for (int i = 0; i < N; ++i) {
cin >> A[i];
cnt[A[i]] += 1;
if (cnt[A[i]] == 1)
num.push_back(A[i]);
}
if (N % 3) {
if (cnt[0] == N)
cout << "Yes... | [
"control_flow.branch.if.condition.change"
] | 782,415 | 782,416 | u645369394 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define ... | #include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define ... | [
"control_flow.branch.if.condition.change"
] | 782,425 | 782,426 | u492373312 | cpp |
p02975 | #include <bits/stdc++.h>
#define va first
#define vb second
#define lb lower_bound
#define ub upper_bound
#define pp push_back
#define ep emplace_back
#define all(v) (v).begin(), (v).end()
#define szz(v) ((int)(v).size())
#define psm partial_sum
#define acm accumulate
#define fio ... | #include <bits/stdc++.h>
#define va first
#define vb second
#define lb lower_bound
#define ub upper_bound
#define pp push_back
#define ep emplace_back
#define all(v) (v).begin(), (v).end()
#define szz(v) ((int)(v).size())
#define psm partial_sum
#define acm accumulate
#define fio ... | [] | 782,427 | 782,428 | u582763758 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int n, a[100010], l[10];
vector<int> v;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
v.push_back(a[i]);
}
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
if (v[0] == 0) {
if (v.size() > 2) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
int n, a[100010], l[10];
vector<int> v;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
v.push_back(a[i]);
}
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
if (v[0] == 0) {
if (v.size() > 2) {
cout << ... | [
"control_flow.branch.if.condition.change"
] | 782,429 | 782,430 | u966582222 | cpp |
p02975 | // failed to generate code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc s... | // failed to generate code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc s... | [
"control_flow.branch.if.condition.change"
] | 782,433 | 782,434 | u709604332 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool solve(int N, vector<ll> k, vector<ll> n) {
if (k.size() == 1) {
if (k[0] == 0) {
return true;
}
} else if (k.size() == 2) {
if (N % 3 != 0)
return false;
if (k[0] == 0) {
if (2 * n[0] == n[1]) {
retur... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool solve(int N, vector<ll> k, vector<ll> n) {
if (k.size() == 1) {
if (k[0] == 0) {
return true;
}
} else if (k.size() == 2) {
if (N % 3 != 0)
return false;
if (k[0] == 0) {
if (2 * n[0] == n[1]) {
retur... | [
"control_flow.branch.if.condition.change"
] | 782,435 | 782,436 | u930841425 | cpp |
p02975 | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
int main() {
LL N;
in >> N;
std::vector<LL> a(N);
rep(i, N) in >> a[i];
std::map<LL, LL> cnt;
rep(i, N)++ cnt[a[i]];
bool ans = false;
if (cnt.size() == 3) {
LL... | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
int main() {
LL N;
in >> N;
std::vector<LL> a(N);
rep(i, N) in >> a[i];
std::map<LL, LL> cnt;
rep(i, N)++ cnt[a[i]];
bool ans = false;
if (cnt.size() == 3) {
LL... | [
"control_flow.branch.if.condition.change"
] | 782,437 | 782,438 | u660613376 | cpp |
p02975 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,449 | 782,450 | u093316595 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
const int maxx = 1e5 + 2;
int a[maxx];
unordered_map<int, int> mp;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == 0)
cnt++;
}
if (cnt == n) {
return... | #include <bits/stdc++.h>
using namespace std;
const int maxx = 1e5 + 2;
int a[maxx];
unordered_map<int, int> mp;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == 0)
cnt++;
}
if (cnt == n) {
return... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 782,453 | 782,454 | u128408308 | cpp |
p02975 | #include <bits/stdc++.h>
#define lowbit(a) ((a) & (-(a)))
using namespace std;
int n;
int a[100000 + 5];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int flag = 0;
for (int i = 0; i < n; i++) {
flag ^= a[i];
}
if (flag == 0)
printf("YES\n");
else
printf("NO\n");
retu... | #include <bits/stdc++.h>
#define lowbit(a) ((a) & (-(a)))
using namespace std;
int n;
int a[100000 + 5];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int flag = 0;
for (int i = 0; i < n; i++) {
flag ^= a[i];
}
if (flag == 0)
printf("Yes\n");
else
printf("No\n");
retu... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 782,455 | 782,456 | u066917439 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define FasterIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define all(v) v... | #include <bits/stdc++.h>
using namespace std;
#define FasterIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define all(v) v... | [
"expression.operation.unary.add",
"control_flow.loop.condition.change"
] | 782,459 | 782,460 | u151681737 | cpp |
p02975 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vecto... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vecto... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 782,465 | 782,466 | u810616694 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, a, x;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
x = x ^ a;
}
if (x == 0)
cout << "yes";
else
cout << "no";
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, a, x;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
x = x ^ a;
}
if (x == 0)
cout << "Yes" << endl;
else
cout << "No";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"io.output.newline.add"
] | 782,467 | 782,468 | u589412018 | cpp |
p02975 | #include <bits/stdc++.h>
#define FOR(a, b, c) for (int a = (b), _for = (c); a < _for; ++a)
#define REP(a, n) FOR(a, 0, n)
#define x first
#define y second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define lf double
using namespace std;
const int MAX = (int)1e5 + 5;
int n;
int p[MAX];
voi... | #include <bits/stdc++.h>
#define FOR(a, b, c) for (int a = (b), _for = (c); a < _for; ++a)
#define REP(a, n) FOR(a, 0, n)
#define x first
#define y second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define lf double
using namespace std;
const int MAX = (int)1e5 + 5;
int n;
int p[MAX];
voi... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 782,469 | 782,470 | u556696449 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INF64 = 3e18;
const un... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INF64 = 3e18;
const un... | [] | 782,473 | 782,474 | u203891294 | cpp |
p02975 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
const int inf = (int)1.05e9;
int main() {
int n;
vector<int> as;
map<int, ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
const int inf = (int)1.05e9;
int main() {
int n;
vector<int> as;
map<int, ... | [] | 782,475 | 782,476 | u643383200 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T> void drop(const T &x) {
cout << x <<... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T> void drop(const T &x) {
cout << x <<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 782,477 | 782,478 | u687214625 | cpp |
p02975 | #include <bits/stdc++.h>
#define pi 3.1415
#define ll long long
#define pii pair<int, int>
#define debug(a) cout << a << '\n'
#define maxn 100009
#define MOD 1000000007
#define INF (int)300009
#define inp freopen("input.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
int main() {
io... | #include <bits/stdc++.h>
#define pi 3.1415
#define ll long long
#define pii pair<int, int>
#define debug(a) cout << a << '\n'
#define maxn 100009
#define MOD 1000000007
#define INF (int)300009
#define inp freopen("input.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
int main() {
io... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,481 | 782,482 | u371493016 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ll long long
#define s second
#define f first
ll n;
ll xr = 0;
ll a[100005];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
xr = (xr ^ a[i]);
}
if (xr == 0) {
cout << "yes" << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ll long long
#define s second
#define f first
ll n;
ll xr = 0;
ll a[100005];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
xr = (xr ^ a[i]);
}
if (xr == 0) {
cout << "Yes" << endl;
return 0;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,483 | 782,484 | u522784682 | cpp |
p02975 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD (long long)1000000007
#define INF (long long)998244353
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD (long long)1000000007
#define INF (long long)998244353
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ... | [
"assignment.change"
] | 782,497 | 782,498 | u122365993 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1.1e5;
int N;
int A[MAXN];
bool go() {
map<int, int> cnts;
for (int i = 0; i < N; i++) {
cnts[A[i]]++;
}
if (cnts.size() == 1) {
return cnts.begin()->first == 0;
} else {
if (N % 3 != 0)
return false;
vector<int> vals;
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1.1e5;
int N;
int A[MAXN];
bool go() {
map<int, int> cnts;
for (int i = 0; i < N; i++) {
cnts[A[i]]++;
}
if (cnts.size() == 1) {
return cnts.begin()->first == 0;
} else {
if (N % 3 != 0)
return false;
vector<int> vals;
... | [
"function.return_value.change"
] | 782,499 | 782,500 | u570944601 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<ll, ll>;
int n;
int A[100005];
void input() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> A[i];
}
void calc() {
if (n % 3 != 0) {
for (int i = 1; i <= n; i++) {
if (A[i] != 0) {
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<ll, ll>;
int n;
int A[100005];
void input() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> A[i];
}
void calc() {
if (n % 3 != 0) {
for (int i = 1; i <= n; i++) {
if (A[i] != 0) {
c... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 782,505 | 782,506 | u610510492 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<ll, ll>;
int n;
int A[100005];
void input() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> A[i];
}
void calc() {
if (n % 3 != 0) {
for (int i = 2; i <= n; i++) {
if (A[i] != A[1]) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<ll, ll>;
int n;
int A[100005];
void input() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> A[i];
}
void calc() {
if (n % 3 != 0) {
for (int i = 1; i <= n; i++) {
if (A[i] != 0) {
c... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operator.compare.cha... | 782,507 | 782,506 | u610510492 | cpp |
p02975 | #include <bits/stdc++.h>
#include <queue>
#include <stack>
using namespace std;
typedef pair<long long int, long long int> pa;
#define resize(A) A.resize(unique(A.begin(), A.end()) - A.begin())
#define pb push_back
#define MAX 200005
long long int MOD = 1e9 + 7;
long long int INF = 1e18;
int main() {
ios_base::sy... | #include <bits/stdc++.h>
#include <queue>
#include <stack>
using namespace std;
typedef pair<long long int, long long int> pa;
#define resize(A) A.resize(unique(A.begin(), A.end()) - A.begin())
#define pb push_back
#define MAX 200005
long long int MOD = 1e9 + 7;
long long int INF = 1e18;
int main() {
ios_base::sy... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 782,510 | 782,511 | u422347032 | cpp |
p02975 | #include <cstdlib>
#include <iostream>
#include <map>
using namespace std;
const int MAXN = 1e5 + 10;
int ar[MAXN];
void yes() {
cout << "Yes" << endl;
exit(0);
}
void no() {
cout << "No" << endl;
exit(0);
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> ar[i];
// if all zero... | #include <cstdlib>
#include <iostream>
#include <map>
using namespace std;
const int MAXN = 1e5 + 10;
int ar[MAXN];
void yes() {
cout << "Yes" << endl;
exit(0);
}
void no() {
cout << "No" << endl;
exit(0);
}
int main() {
// freopen("tmp.txt", "r", stdin);
int n;
cin >> n;
for (int i = 0; i < n; ++... | [] | 782,516 | 782,517 | u017806365 | cpp |
p02975 | #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <ios... | #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <ios... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,518 | 782,519 | u404075706 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x;
cin >> n;
long long ans = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
ans ^= x;
}
if (ans % 2 == 0)
puts("Yes");
else
puts("No");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x;
cin >> n;
long long ans = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
ans ^= x;
}
if (ans == 0)
puts("Yes");
else
puts("No");
return 0;
}
| [
"expression.operation.binary.remove"
] | 782,525 | 782,526 | u485837651 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n;
int ans = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
ans ^= x;
}
if (ans % 2 == 0)
puts("Yes");
else
puts("No");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x;
cin >> n;
long long ans = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
ans ^= x;
}
if (ans == 0)
puts("Yes");
else
puts("No");
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 782,527 | 782,526 | u485837651 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.