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 | #pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
... | #pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 782,537 | 782,538 | u715750943 | cpp |
p02975 | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long LL;
const int maxn = 2e5 + 5;
int n, a[maxn], num[maxn][2], num0;
int main() {
scanf("%d", &n);
fo(i, 1, n) scanf("%d", &a[i]);
sort(a + 1, a + 1 +... | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long LL;
const int maxn = 2e5 + 5;
int n, a[maxn], num[maxn][2], num0;
int main() {
scanf("%d", &n);
fo(i, 1, n) scanf("%d", &a[i]);
sort(a + 1, a + 1 +... | [
"control_flow.branch.if.condition.change"
] | 782,543 | 782,544 | u527820217 | cpp |
p02975 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 782,545 | 782,546 | u971371794 | cpp |
p02975 | // In the name of God
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
#define int long long
map<int, int> mp;
vector<int> types;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
bool nonz... | // In the name of God
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
#define int long long
map<int, int> mp;
vector<int> types;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
bool nonz... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 782,547 | 782,548 | u832023241 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define MP make_pair
#define test cout << "test" << endl;
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
// const ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define MP make_pair
#define test cout << "test" << endl;
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
// const ... | [
"control_flow.branch.if.condition.change"
] | 782,558 | 782,559 | u898167769 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int long long
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int long long
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <=... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 782,560 | 782,561 | u027861917 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int long long
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int long long
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <=... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 782,562 | 782,561 | u027861917 | cpp |
p02975 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> a(N);
for (auto &x : a)
cin >> x;
map<int, int> bucket;
for (au... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> a(N);
for (auto &x : a)
cin >> x;
map<int, int> bucket;
for (au... | [
"control_flow.branch.if.condition.change"
] | 782,563 | 782,564 | u042105122 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define mp(a, b) make_pair(a, b)
#define ff first
#define setp(a) setprecision(a) << fixed
#define ss second
#define fori(v) for (ll i = 0; i < v; i++)
#define forj(v) for (ll j = 0; j < v; j++)
#define fork(v) for (ll k = 0; k < v; k++)
#define forl(v) for (ll l = 0; l < v... | #include <bits/stdc++.h>
using namespace std;
#define mp(a, b) make_pair(a, b)
#define ff first
#define setp(a) setprecision(a) << fixed
#define ss second
#define fori(v) for (ll i = 0; i < v; i++)
#define forj(v) for (ll j = 0; j < v; j++)
#define fork(v) for (ll k = 0; k < v; k++)
#define forl(v) for (ll l = 0; l < v... | [
"control_flow.branch.if.condition.change"
] | 782,565 | 782,566 | u936253056 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll n, A[200000];
cin >> n;
rep(i, n) cin >> A[i];
int z = 1;
if (n % 3) {
sort(A, A + n);
if (A[0] != A[n - 1])
z = 0;
} else {
z = 0;
sort(A, A + n);
if (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll n, A[200000];
cin >> n;
rep(i, n) cin >> A[i];
int z = 1;
if (n % 3) {
sort(A, A + n);
if (A[0] != A[n - 1])
z = 0;
} else {
z = 0;
sort(A, A + n);
if (... | [
"control_flow.branch.if.condition.change"
] | 782,569 | 782,570 | u441296840 | cpp |
p02975 | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template<typename key, typename val>
// using ordered_tree =
// tree<key, val, greater<>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ... | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template<typename key, typename val>
// using ordered_tree =
// tree<key, val, greater<>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ... | [
"variable_declaration.name.change",
"identifier.change",
"variable_declaration.value.change"
] | 782,573 | 782,574 | u432090061 | cpp |
p02975 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 782,577 | 782,578 | u472675932 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100000];
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int tmp = a[0];
for (int i = 1; i < n; i++)
tmp ^= a[i];
if (!tmp)
cout << "YES";
else
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100000];
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int tmp = a[0];
for (int i = 1; i < n; i++)
tmp ^= a[i];
if (!tmp)
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,585 | 782,586 | u242556886 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(name) name.begin(), name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(name) name.begin(), name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 782,591 | 782,592 | u633020228 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(name) name.begin(), name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(name) name.begin(), name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 782,593 | 782,592 | u633020228 | cpp |
p02975 | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
i... | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
i... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 782,594 | 782,595 | u504322356 | cpp |
p02975 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
bool solve(int N, vector<int> &a) {
map<int, int> s;
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
bool solve(int N, vector<int> &a) {
map<int, int> s;
for (int i = 0; i < N; i++) {
... | [
"control_flow.branch.if.condition.change"
] | 782,608 | 782,609 | u383226932 | cpp |
p02975 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | [
"control_flow.branch.if.condition.change"
] | 782,616 | 782,617 | u202928696 | cpp |
p02975 | #pragma GCC optimize("03")
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
// CHECK FOR N = 1 OR OTHER DUMB TESTS
using namespace std;
int n, a[100100];
set<int> s;
map<int, int> mp;
int tr(int x, int y, int z) {
map<int, int> m;
int v[100100];
v[1] = x;
v[2] = y;
v[3] = z... | #pragma GCC optimize("03")
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
// CHECK FOR N = 1 OR OTHER DUMB TESTS
using namespace std;
int n, a[100100];
set<int> s;
map<int, int> mp;
int tr(int x, int y, int z) {
map<int, int> m;
int v[100100];
v[1] = x;
v[2] = y;
v[3] = z... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change"
] | 782,624 | 782,623 | u093252820 | cpp |
p02975 | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#ifdef... | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#ifdef... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 782,625 | 782,626 | u317879811 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A[100010];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i <= N; i++) {
if (N == i) {
cout << "Yes" << endl;
return 0;
}
if (A[i] != 0)
break;
}
sort(A, A + N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A[100010];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i <= N; i++) {
if (N == i) {
cout << "Yes" << endl;
return 0;
}
if (A[i] != 0)
break;
}
sort(A, A + N... | [
"control_flow.branch.if.condition.change"
] | 782,629 | 782,630 | u205655980 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
typedef int def; // default parameter for loops
#define fori(a) for (def i = 0; i < (a); i++)
#define fori1(a) for (def i = 1; i <= (a); i++)
#define fori_(a) for (def i = (a)-1; i >= 0; i--)
#... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
typedef int def; // default parameter for loops
#define fori(a) for (def i = 0; i < (a); i++)
#define fori1(a) for (def i = 1; i <= (a); i++)
#define fori_(a) for (def i = (a)-1; i >= 0; i--)
#... | [
"control_flow.branch.if.condition.change"
] | 782,631 | 782,632 | u723931013 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll arr[n + 1];
map<ll, ll> mp;
ll x = 0;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
x = x ^ arr[i];
}
if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll arr[n + 1];
map<ll, ll> mp;
ll x = 0;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
x = x ^ arr[i];
}
if ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,638 | 782,639 | u482090956 | cpp |
p02975 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 782,640 | 782,641 | u041282550 | cpp |
p02975 | /*================================================================
* Copyright (C) 2019 Sangfor Ltd. All rights reserved.
*
* 文件名称：A.cpp
* 创 建 者： badcw
* 创建日期：2019年05月01日
*
================================================================*/
#include <bits/stdc++.h>
#define ll long long
using namespace std;
con... | /*================================================================
* Copyright (C) 2019 Sangfor Ltd. All rights reserved.
*
* 文件名称：A.cpp
* 创 建 者： badcw
* 创建日期：2019年05月01日
*
================================================================*/
#include <bits/stdc++.h>
#define ll long long
using namespace std;
con... | [
"control_flow.branch.if.condition.change"
] | 782,642 | 782,643 | u480959879 | cpp |
p02975 | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 782,644 | 782,645 | u656721037 | cpp |
p02975 | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | [
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 782,646 | 782,645 | u656721037 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
map<int, int> mp;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &c);
mp[c]++;
}
if (n % 3 != 0) {
if (mp.size() > 1 || mp.find(0) == mp.end())
cout << "No\n";
else
cout << "Yes\n";
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
map<int, int> mp;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &c);
mp[c]++;
}
if (n % 3 != 0) {
if (mp.size() > 1 || mp.find(0) == mp.end())
cout << "No\n";
else
cout << "Yes\n";
return 0;... | [
"control_flow.branch.if.condition.change"
] | 782,647 | 782,648 | u858138344 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
map<int, int> mp;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &c);
mp[c]++;
}
if (n % 3 != 0) {
if (mp.size() > 1 || mp.find(0) == mp.end())
cout << "No\n";
else
cout << "Yes\n";
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
map<int, int> mp;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &c);
mp[c]++;
}
if (n % 3 != 0) {
if (mp.size() > 1 || mp.find(0) == mp.end())
cout << "No\n";
else
cout << "Yes\n";
return 0;... | [
"control_flow.branch.if.condition.change"
] | 782,649 | 782,648 | u858138344 | cpp |
p02975 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include ... | [
"control_flow.branch.if.condition.change"
] | 782,654 | 782,655 | u287305727 | cpp |
p02976 | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define INF (1 << 30)
#define INFL (1LL << 60)
#define MOD 1000000007LL
#define EPS ((ld)(1e-9))
#define sz(x) ((int)(x).size())
#define setz(x) memset(x, 0, sizeof(x))
#define all(x) (x).begin(... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define INF (1 << 30)
#define INFL (1LL << 60)
#define MOD 1000000007LL
#define EPS ((ld)(1e-9))
#define sz(x) ((int)(x).size())
#define setz(x) memset(x, 0, sizeof(x))
#define all(x) (x).begin(... | [
"identifier.change",
"expression.operation.binary.change",
"io.output.change"
] | 782,688 | 782,689 | u236019708 | cpp |
p02976 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// gp_hash_table<int, int> mapka;
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#defi... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// gp_hash_table<int, int> mapka;
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#defi... | [
"literal.string.change",
"io.output.change"
] | 782,692 | 782,693 | u200679581 | cpp |
p02976 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 7;
const int inf = INT_MAX;
const ll inff = 1e18;
const ll mod = 1e9 + 7;
#define pii pair<int, int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 7;
const int inf = INT_MAX;
const ll inff = 1e18;
const ll mod = 1e9 + 7;
#define pii pair<int, int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 782,700 | 782,701 | u175665488 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,705 | 782,706 | u895971408 | cpp |
p02975 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,707 | 782,708 | u050698451 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x = 0;
int n;
cin >> n;
while (n--) {
int a;
cin >> a;
x ^= a;
}
cout << (!x ? "yes" : "no");
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x = 0;
int n;
cin >> n;
while (n--) {
int a;
cin >> a;
x ^= a;
}
cout << (!x ? "Yes" : "No");
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,709 | 782,710 | u815544868 | cpp |
p02976 | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define N 100010
#define NO !printf("No\n")
typedef long long ll;
inline ll read() {
ll x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define N 100010
#define NO !printf("-1\n")
typedef long long ll;
inline ll read() {
ll x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >... | [
"preprocessor.define.value.change"
] | 782,711 | 782,712 | u979500307 | cpp |
p02976 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define fastInp \
cin.tie(0); \
cout.tie(0); ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define fastInp \
cin.tie(0); \
cout.tie(0); ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 782,721 | 782,722 | u701929021 | cpp |
p02976 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
#define eb emplace_back
template <class T> void... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
#define eb emplace_back
template <class T> void... | [] | 782,723 | 782,724 | u006686215 | cpp |
p02976 | #include <bits/stdc++.h>
#define PI 3.14159265358979323846264338327950288419
using namespace std;
int n, m;
int deg[100005];
int a[100005], b[100005];
int par[100005];
vector<int> tedge[100005];
int f(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = f(par[x]);
}
}
void dfs(int cur, int... | #include <bits/stdc++.h>
#define PI 3.14159265358979323846264338327950288419
using namespace std;
int n, m;
int deg[100005];
int a[100005], b[100005];
int par[100005];
vector<int> tedge[100005];
int f(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = f(par[x]);
}
}
void dfs(int cur, int... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 782,751 | 782,752 | u996283645 | cpp |
p02976 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<vector<ll>>> VVV... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<vector<ll>>> VVV... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 782,762 | 782,763 | u592686932 | cpp |
p02976 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(void) {
int N, M;
cin >> N >> M;
if (M % 2 == 1) {
cout << "-1" << endl;
return 0;
}
vector<vector<int>> to(M);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(void) {
int N, M;
cin >> N >> M;
if (M % 2 == 1) {
cout << "-1" << endl;
return 0;
}
vector<vector<int>> to(N);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b)... | [] | 782,764 | 782,765 | u904123392 | cpp |
p02976 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [] | 782,766 | 782,767 | u633284019 | cpp |
p02976 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | [
"io.output.change"
] | 782,772 | 782,773 | u965730380 | cpp |
p02976 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unor... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unor... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 782,787 | 782,788 | u022774106 | cpp |
p02976 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int n, m;
vector<vector<int>> g(101000);
vector<int> deg(101000), depth(101000, -1);
vector<pair<int, int>> ans;
void dfs(int v, int p) {
for (auto u : g[v]) {
if (depth[u] == -1) {
dep... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int n, m;
vector<vector<int>> g(101000);
vector<int> deg(101000), depth(101000, -1);
vector<pair<int, int>> ans;
void dfs(int v, int p) {
for (auto u : g[v]) {
if (depth[u] == -1) {
dep... | [
"identifier.change",
"call.arguments.change"
] | 782,789 | 782,790 | u604231488 | cpp |
p02976 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int n, m;
vector<vector<int>> g(101000);
vector<int> deg(101000), depth(101000, -1);
vector<pair<int, int>> ans;
void dfs(int v, int p) {
for (auto u : g[v]) {
if (depth[u] == -1) {
dep... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int n, m;
vector<vector<int>> g(101000);
vector<int> deg(101000), depth(101000, -1);
vector<pair<int, int>> ans;
void dfs(int v, int p) {
for (auto u : g[v]) {
if (depth[u] == -1) {
dep... | [
"control_flow.return.add",
"identifier.change",
"call.arguments.change"
] | 782,791 | 782,790 | u604231488 | cpp |
p02976 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int n, m;
vector<vector<int>> g(101000);
vector<int> deg(101000), depth(101000, -1);
vector<pair<int, int>> ans;
void dfs(int v, int p) {
for (auto u : g[v]) {
if (depth[u] == -1) {
dep... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int n, m;
vector<vector<int>> g(101000);
vector<int> deg(101000), depth(101000, -1);
vector<pair<int, int>> ans;
void dfs(int v, int p) {
for (auto u : g[v]) {
if (depth[u] == -1) {
dep... | [
"control_flow.return.add",
"identifier.change",
"call.arguments.change"
] | 782,792 | 782,790 | u604231488 | cpp |
p02976 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int n, m;
vector<vector<int>> g(101000);
vector<int> deg(n), depth(n, -1);
vector<pair<int, int>> ans;
void dfs(int v, int p) {
for (auto u : g[v]) {
if (depth[u] == -1) {
depth[u] = de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int n, m;
vector<vector<int>> g(101000);
vector<int> deg(101000), depth(101000, -1);
vector<pair<int, int>> ans;
void dfs(int v, int p) {
for (auto u : g[v]) {
if (depth[u] == -1) {
dep... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.return.add",
"identifier.change"
] | 782,793 | 782,790 | u604231488 | cpp |
p02976 | #include <algorithm>
#include <bits/stdc++.h>
#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-... | #include <algorithm>
#include <bits/stdc++.h>
#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-... | [] | 782,808 | 782,809 | u358748139 | cpp |
p02976 | #include <algorithm>
#include <bits/stdc++.h>
#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-... | #include <algorithm>
#include <bits/stdc++.h>
#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-... | [
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 782,810 | 782,809 | u358748139 | cpp |
p02976 | #include <cstdio>
#include <vector>
const int MN = 100005;
int N, M;
std::vector<int> G[MN];
int vis[MN], dep[MN], col[MN];
void DFS(int u, int f) {
vis[u] = 1, dep[u] = dep[f] + 1;
for (auto v : G[u]) {
if (v == f)
continue;
if (vis[v]) {
if (dep[v] < dep[u])
col[u] ^= 1, printf("%d ... | #include <cstdio>
#include <vector>
const int MN = 100005;
int N, M;
std::vector<int> G[MN];
int vis[MN], dep[MN], col[MN];
void DFS(int u, int f) {
vis[u] = 1, dep[u] = dep[f] + 1;
for (auto v : G[u]) {
if (v == f)
continue;
if (vis[v]) {
if (dep[v] < dep[u])
col[u] ^= 1, printf("%d ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 782,822 | 782,823 | u095826906 | cpp |
p02975 | // interestingLSY
#include <bits/stdc++.h>
using namespace std;
#define il inline
#define elif else if
// Type
#define ld double
#define ll long long
#define ull unsigned ll
// Vector
#define vc vector
#define Pb push_back
#define Pf push_front
#define Eb emplace_back
#define All(x) x.begin(), x.end()
#define AllRev(... | // interestingLSY
#include <bits/stdc++.h>
using namespace std;
#define il inline
#define elif else if
// Type
#define ld double
#define ll long long
#define ull unsigned ll
// Vector
#define vc vector
#define Pb push_back
#define Pf push_front
#define Eb emplace_back
#define All(x) x.begin(), x.end()
#define AllRev(... | [
"control_flow.branch.if.condition.change"
] | 782,828 | 782,829 | u065793287 | cpp |
p02975 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"control_flow.branch.if.condition.change"
] | 782,830 | 782,831 | u628047647 | cpp |
p02975 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string.h>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = (1 <<... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string.h>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = (1 <<... | [
"control_flow.branch.if.condition.change"
] | 782,835 | 782,836 | u394033362 | cpp |
p02975 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string.h>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = (1 <<... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string.h>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = (1 <<... | [
"control_flow.branch.if.condition.change"
] | 782,837 | 782,836 | u394033362 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N], n;
int main() {
scanf("%d", &n);
int sum = 0, sum1 = 0, sum2 = 0, sum3 = 0, x = -1, y = -1, z = -1;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] == 0)
sum++;
else if (x == -1)
x = a[i], sum1 = 1;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N], n;
int main() {
scanf("%d", &n);
int sum = 0, sum1 = 0, sum2 = 0, sum3 = 0, x = -1, y = -1, z = -1;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] == 0)
sum++;
else if (x == -1)
x = a[i], sum1 = 1;
... | [
"control_flow.branch.if.condition.change"
] | 782,840 | 782,841 | u374819456 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N], n;
int main() {
scanf("%d", &n);
int sum = 0, sum1 = 0, sum2 = 0, sum3 = 0, x = -1, y = -1, z = -1;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] == 0)
sum++;
else if (x == -1)
x = a[i], sum1 = 1;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N], n;
int main() {
scanf("%d", &n);
int sum = 0, sum1 = 0, sum2 = 0, sum3 = 0, x = -1, y = -1, z = -1;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] == 0)
sum++;
else if (x == -1)
x = a[i], sum1 = 1;
... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 782,842 | 782,841 | u374819456 | cpp |
p02975 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n;
c... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n;
c... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_access.subscript.index.change"
] | 782,848 | 782,849 | u032189172 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef std::pair<int, int> ipair;
int main() {
int N;
cin >> N;
ll a[N];
map<int, int> log;
for ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef std::pair<int, int> ipair;
int main() {
int N;
cin >> N;
ll a[N];
map<int, int> log;
for ... | [
"literal.string.change",
"io.output.change"
] | 782,852 | 782,853 | u775224245 | cpp |
p02975 | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_A main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int... | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_A main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.opposites",
"assignment.value.change"
] | 782,862 | 782,863 | u404244809 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb ... | [] | 782,868 | 782,869 | u698883164 | cpp |
p02975 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
// input
int N;
cin >> N;
vector<i... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
// input
int N;
cin >> N;
vector<i... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 782,875 | 782,876 | u017293723 | cpp |
p02975 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
// input
int N;
cin >> N;
vector<i... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
// input
int N;
cin >> N;
vector<i... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 782,877 | 782,876 | u017293723 | cpp |
p02975 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
// input
int N;
cin >> N;
vector<i... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
// input
int N;
cin >> N;
vector<i... | [
"literal.string.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 782,878 | 782,876 | u017293723 | cpp |
p02975 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
// input
int N;
cin >> N;
vector<i... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
// input
int N;
cin >> N;
vector<i... | [
"control_flow.branch.if.condition.change"
] | 782,879 | 782,876 | u017293723 | cpp |
p02975 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
bool allzero = true;
rep(i, N) {
if (a[i] != 0)
allzero = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
bool allzero = true;
rep(i, N) {
if (a[i] != 0)
allzero = ... | [
"control_flow.branch.if.condition.change"
] | 782,880 | 782,881 | u755830696 | cpp |
p02975 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N);
bool big_flag = true; //全部0であるかを判定
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] != 0) {
big_flag = false;
}
}
if (N % 3 == 1 || N %... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N);
bool big_flag = true; //全部0であるかを判定
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] != 0) {
big_flag = false;
}
}
if (N % 3 == 1 || N %... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 782,882 | 782,883 | u904123392 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n];
bool allzero = true;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != 0)
allzero = false;
}
bool pos = true;
if (allzero) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n];
bool allzero = true;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != 0)
allzero = false;
}
bool pos = true;
if (allzero) {
... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 782,892 | 782,893 | u676029460 | cpp |
p02975 | #include <algorithm> // sort
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ABS(x) ((x) > 0 ? (x) : -(x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
using namespace std;
typedef long long ll;
ll newton(long lon... | #include <algorithm> // sort
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ABS(x) ((x) > 0 ? (x) : -(x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
using namespace std;
typedef long long ll;
ll newton(long lon... | [
"control_flow.branch.if.condition.change"
] | 782,894 | 782,895 | u869595612 | 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> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
if (N % 3 != 0) {
cout << ((A[0] == 0 && A[N - 1] == 0) ? "Yes" : "No") << '\n';
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
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());
if (N % 3 != 0) {
cout << ((A[0] == 0 && A[N - 1] == 0) ? "Yes" : "No") << '\n';
r... | [] | 782,898 | 782,899 | u782098901 | 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> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
if (N % 3 != 0) {
cout << (A[0] == 0 && A[N - 1] == 0 ? "Yes" : "No") << '\n';
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
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());
if (N % 3 != 0) {
cout << ((A[0] == 0 && A[N - 1] == 0) ? "Yes" : "No") << '\n';
r... | [
"control_flow.branch.if.condition.change"
] | 782,900 | 782,899 | u782098901 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
map<int, int> cnt;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
cnt[x]++;
}
if (cnt.size() == 1 && cnt.count(0))
cout << "Yes" << endl;
else if (n % 3 == 0) {
int ans = 1;
vector<int> a;
for (auto u : cnt)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
map<int, int> cnt;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
cnt[x]++;
}
if (cnt.size() == 1 && cnt.count(0))
cout << "Yes" << endl;
else if (n % 3 == 0) {
int ans = 1;
vector<int> a;
for (auto u : cnt)
... | [] | 782,904 | 782,905 | u410358766 | cpp |
p02975 | #include <cstdio>
#include <map>
using namespace std;
typedef pair<int, int> pii;
#define fi first
#define se second
const int maxn = 100000;
int N, a[maxn];
pii b[3];
map<int, int> m;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &a[i]), m[a[i]]++;
if (m.size() == 1 && m[0] == N)
... | #include <cstdio>
#include <map>
using namespace std;
typedef pair<int, int> pii;
#define fi first
#define se second
const int maxn = 100000;
int N, a[maxn];
pii b[3];
map<int, int> m;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &a[i]), m[a[i]]++;
if (m.size() == 1 && m[0] == N)
... | [
"control_flow.branch.if.condition.change"
] | 782,908 | 782,909 | u014376901 | cpp |
p02975 | #include <cstdio>
#include <map>
using namespace std;
typedef pair<int, int> pii;
#define fi first
#define se second
const int maxn = 100000;
int N, a[maxn];
pii b[3];
map<int, int> m;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &a[i]), m[a[i]]++;
if (m.size() == 1 && m[0] == N)
... | #include <cstdio>
#include <map>
using namespace std;
typedef pair<int, int> pii;
#define fi first
#define se second
const int maxn = 100000;
int N, a[maxn];
pii b[3];
map<int, int> m;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &a[i]), m[a[i]]++;
if (m.size() == 1 && m[0] == N)
... | [
"control_flow.branch.if.condition.change",
"call.remove"
] | 782,910 | 782,909 | u014376901 | cpp |
p02975 | #include <cstdio>
#include <map>
using namespace std;
typedef pair<int, int> pii;
#define fi first
#define se second
const int maxn = 100000;
int N, a[maxn];
pii b[3];
map<int, int> m;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &a[i]), m[a[i]]++;
if (m.size() == 1 && m[0] == N)
... | #include <cstdio>
#include <map>
using namespace std;
typedef pair<int, int> pii;
#define fi first
#define se second
const int maxn = 100000;
int N, a[maxn];
pii b[3];
map<int, int> m;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &a[i]), m[a[i]]++;
if (m.size() == 1 && m[0] == N)
... | [
"control_flow.branch.if.condition.change"
] | 782,911 | 782,909 | u014376901 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define REP(i, N) for (int i = 0; i < N; i++)
using namespace std;
int gcd(int a, int b) { return b ? gcd(b,... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define REP(i, N) for (int i = 0; i < N; i++)
using namespace std;
int gcd(int a, int b) { return b ? gcd(b,... | [
"variable_declaration.type.narrow.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 782,912 | 782,913 | u766779796 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define REP(i, N) for (int i = 0; i < N; i++)
using namespace std;
int gcd(int a, int b) { return b ? gcd(b,... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define REP(i, N) for (int i = 0; i < N; i++)
using namespace std;
int gcd(int a, int b) { return b ? gcd(b,... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 782,914 | 782,913 | u766779796 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long long... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long long... | [
"control_flow.branch.if.condition.change"
] | 782,917 | 782,918 | u484460274 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long long... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long long... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 782,919 | 782,918 | u484460274 | cpp |
p02975 | #include <bits/stdc++.h>
typedef uintmax_t ull;
typedef intmax_t ll;
typedef uint64_t ul;
typedef uint32_t ui;
typedef uint8_t uc;
using namespace std;
int main(void) {
ui N{};
cin >> N;
vector<ull> originalBits(N);
map<ull, ul> mapA{};
for (size_t i = 0; i < N; ++i) {
cin >> originalBits[i];
if ... | #include <bits/stdc++.h>
typedef uintmax_t ull;
typedef intmax_t ll;
typedef uint64_t ul;
typedef uint32_t ui;
typedef uint8_t uc;
using namespace std;
int main(void) {
ui N{};
cin >> N;
vector<ull> originalBits(N);
map<ull, ul> mapA{};
for (size_t i = 0; i < N; ++i) {
cin >> originalBits[i];
if ... | [
"expression.operation.unary.add"
] | 782,924 | 782,925 | u072526305 | cpp |
p02975 | #include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
map<int, int> a;
for (int i = 0; i < n; ++i) {
int now;
cin >> now;
a[now]++;
}
if (a.size() == 1) {
if (a.find(0) != a.e... | #include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
map<int, int> a;
for (int i = 0; i < n; ++i) {
int now;
cin >> now;
a[now]++;
}
if (a.size() == 1) {
if (a.find(0) != a.e... | [
"control_flow.branch.if.condition.change"
] | 782,928 | 782,929 | u004426682 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
const int N = 200 * 1000 + 17;
const int MOD = 1000 * 1000 * 1000 + 7;
int n;
int a[N];
bool read() {
if (!(cin >> n))
return false;
for (int i = 0; i < n; ++i)
cin >> a[i];
return true;
}
void solve() {
sort(a, a + n);
if (a[0] == a[n]) {
if (... | #include <bits/stdc++.h>
using namespace std;
const int N = 200 * 1000 + 17;
const int MOD = 1000 * 1000 * 1000 + 7;
int n;
int a[N];
bool read() {
if (!(cin >> n))
return false;
for (int i = 0; i < n; ++i)
cin >> a[i];
return true;
}
void solve() {
sort(a, a + n);
if (a[0] == a[n - 1]) {
... | [
"control_flow.branch.if.condition.change"
] | 782,930 | 782,931 | u138919616 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
class Main {
private:
public:
int n;
};
int main() {
int n;
cin >> n;
// cout << n <<endl;
vector<int> list(n);
for (int i = 0; i < n; i++) {
cin >> list.at(i);
}
vector<string> str(n);
for (int i = 0; i < n; i++) {
stringstream ss;
ss << bits... | #include <bits/stdc++.h>
using namespace std;
class Main {
private:
public:
int n;
};
int main() {
int n;
cin >> n;
// cout << n <<endl;
vector<int> list(n);
for (int i = 0; i < n; i++) {
cin >> list.at(i);
}
vector<string> str(n);
for (int i = 0; i < n; i++) {
stringstream ss;
ss << bits... | [
"literal.string.change",
"literal.string.case.change"
] | 782,940 | 782,941 | u982152304 | cpp |
p02975 |
#include <algorithm>
#include <cstddef>
#include <iostream>
#include <map>
#include <vector>
using si = std::int32_t;
using ui = std::uint32_t;
using ull = std::uint64_t;
si main() {
ui n;
std::cin >> n;
// std::vector<ull> an(n);
std::map<ull, ull> mp;
for (ui i{}; i < n; ++i) {
ui t;
std::cin >>... |
#include <algorithm>
#include <cstddef>
#include <iostream>
#include <map>
#include <vector>
using si = std::int32_t;
using ui = std::uint32_t;
using ull = std::uint64_t;
si main() {
ui n;
std::cin >> n;
// std::vector<ull> an(n);
std::map<ull, ull> mp;
for (ui i{}; i < n; ++i) {
ui t;
std::cin >>... | [
"call.remove"
] | 782,953 | 782,954 | u837286475 | cpp |
p02975 |
#include <algorithm>
#include <cstddef>
#include <iostream>
#include <map>
#include <vector>
using si = std::int32_t;
using ui = std::uint32_t;
using ull = std::uint64_t;
si main() {
ui n;
std::cin >> n;
// std::vector<ull> an(n);
std::map<ull, ull> mp;
for (ui i{}; i < n; ++i) {
ui t;
std::cin >>... |
#include <algorithm>
#include <cstddef>
#include <iostream>
#include <map>
#include <vector>
using si = std::int32_t;
using ui = std::uint32_t;
using ull = std::uint64_t;
si main() {
ui n;
std::cin >> n;
// std::vector<ull> an(n);
std::map<ull, ull> mp;
for (ui i{}; i < n; ++i) {
ui t;
std::cin >>... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"call.remove"
] | 782,955 | 782,954 | u837286475 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
bool all0 = true;
ll a[N];
map<int, int... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
bool all0 = true;
int a[N];
map<int, in... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 782,958 | 782,959 | u492131209 | cpp |
p02975 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | [
"assignment.compound.arithmetic.replace.remove",
"expression.operator.arithmetic.replace.add",
"control_flow.branch.if.condition.change"
] | 782,960 | 782,961 | u239493918 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i... | #include <bits/stdc++.h>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 782,974 | 782,975 | u517411077 | cpp |
p02975 | #ifndef LOCAL
#include "bits/stdc++.h"
#endif
#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##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_o... | #ifndef LOCAL
#include "bits/stdc++.h"
#endif
#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##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_o... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 782,976 | 782,977 | u751488284 | cpp |
p02975 | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for... | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for... | [
"control_flow.branch.if.condition.change"
] | 782,978 | 782,979 | u136509923 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered... | [
"control_flow.branch.if.condition.change"
] | 782,984 | 782,985 | u453246394 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered... | [
"expression.operation.binary.remove"
] | 782,987 | 782,988 | u453246394 | cpp |
p02975 | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
int a[100005];
map<int, int> mp;
int main(void) {
scanf("%d", &n);
bool flag0 = true;
int zo = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] != 0)
flag0 =... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
int a[100005];
map<int, int> mp;
int main(void) {
scanf("%d", &n);
bool flag0 = true;
int zo = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] != 0)
flag0 =... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 782,998 | 782,999 | u854869949 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> a(n);
bool zero = true;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zero = false;
}
if (zero) {
cout << "Yes" << endl;
return 0;
}
if (n % 3 != 0) {
cout << "No" << endl... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> a(n);
bool zero = true;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != 0)
zero = false;
}
if (zero) {
cout << "Yes" << endl;
return 0;
}
if (n % 3 != 0) {
cout << "No" << endl... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 783,000 | 783,001 | u924215188 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, i, x;
map<ll, ll> l;
cin >> N;
for (i = 0; i < N; i++) {
cin >> x;
if (l.count(x))
l.at(x)++;
else
l[x] = 1;
}
if (l.size() == 3) {
ll c[3];
i = 0;
for (pair<ll, ll> p : l) {
c[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, i, x;
map<ll, ll> l;
cin >> N;
for (i = 0; i < N; i++) {
cin >> x;
if (l.count(x))
l.at(x)++;
else
l[x] = 1;
}
if (l.size() == 3) {
ll c[3];
i = 0;
for (pair<ll, ll> p : l) {
c[... | [
"control_flow.branch.if.condition.change"
] | 783,004 | 783,005 | u211109468 | cpp |
p02975 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long ll;
int main(void) {
int N, sho;
cin >> N;
ll a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
bool zero = true;
for (int i = 0; i < N; i++)
if (a[i] != 0)
zero = false;
if (zero) {
cout << "Yes... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long ll;
int main(void) {
int N, sho;
cin >> N;
ll a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
bool zero = true;
for (int i = 0; i < N; i++)
if (a[i] != 0)
zero = false;
if (zero) {
cout << "Yes... | [
"control_flow.branch.if.condition.change"
] | 783,006 | 783,007 | u895536055 | cpp |
p02975 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long ll;
int main(void) {
int N, sho;
cin >> N;
ll a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
bool zero = true;
for (int i = 0; i < N; i++)
if (a[i] != 0)
zero = false;
if (zero) {
cout << "Yes... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long ll;
int main(void) {
int N, sho;
cin >> N;
ll a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
bool zero = true;
for (int i = 0; i < N; i++)
if (a[i] != 0)
zero = false;
if (zero) {
cout << "Yes... | [
"control_flow.branch.if.condition.change"
] | 783,008 | 783,007 | u895536055 | cpp |
p02975 | #include <cstdio>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, i;
map<int, int> mp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
int x;
scanf("%d", &x);
mp[x]++;
}
if (mp[0] == n) {
puts("Yes");
} else if (n % 3 == 0) {
map<int, int>::iterator it;
... | #include <cstdio>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, i;
map<int, int> mp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
int x;
scanf("%d", &x);
mp[x]++;
}
if (mp[0] == n) {
puts("Yes");
} else if (n % 3 == 0) {
map<int, int>::iterator it;
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 783,009 | 783,010 | u387061829 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | [] | 783,013 | 783,014 | u568652083 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.