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 |
|---|---|---|---|---|---|---|---|
p02972 | #include <bits/stdc++.h>
#define SORT(c) sort((c).begin(), (c).end())
#define db(x) cout << #x << "=" << x << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define reprs(i, m, n) for (int i = n; i >= m; i--)
#defi... | #include <bits/stdc++.h>
#define SORT(c) sort((c).begin(), (c).end())
#define db(x) cout << #x << "=" << x << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define reprs(i, m, n) for (int i = n; i >= m; i--)
#define E... | [
"expression.operation.binary.add"
] | 779,103 | 779,104 | u556276145 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long cc;
cc N, K, i, j, k, a[500000], sub = 0, n = 0;
cc judge = 0, Ans[500000], J[500000];
string S;
int main() {
cin >> N;
for (i = 1; i <= N; i++) {
cin >> a[i];... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long cc;
cc N, K, i, j, k, a[500000], sub = 0, n = 0;
cc judge = 0, Ans[500000], J[500000];
string S;
int main() {
cin >> N;
for (i = 1; i <= N; i++) {
cin >> a[i];... | [
"assignment.add"
] | 779,105 | 779,106 | u839537391 | cpp |
p02972 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
//#include<windows.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9 + 7;
Int INF = 1e18;
double EPS = 0.00000001;
// Int mod = 1e6+3;
int mai... |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
//#include<windows.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9 + 7;
Int INF = 1e18;
double EPS = 0.00000001;
// Int mod = 1e6+3;
int mai... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 779,107 | 779,108 | u959822889 | cpp |
p02972 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
//#include<windows.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9 + 7;
Int INF = 1e18;
double EPS = 0.00000001;
// Int mod = 1e6+3;
int mai... |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
//#include<windows.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9 + 7;
Int INF = 1e18;
double EPS = 0.00000001;
// Int mod = 1e6+3;
int mai... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 779,109 | 779,108 | u959822889 | cpp |
p02972 | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#... | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#... | [
"io.output.change"
] | 779,110 | 779,111 | u713333397 | cpp |
p02972 | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#... | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 779,112 | 779,111 | u713333397 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int a[200010];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[20010];
queue<int> q;
int balls = 0;
for (int i = n - 1; i >= 0; i--) {
int k = n / (i + 1);
int count = 0;
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int n;
cin >> n;
int a[200010];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[200010];
queue<int> q;
long long int balls = 0;
for (int i = n - 1; i >= 0; i--) {
int k = n / (i + 1);
int count =... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 779,119 | 779,116 | u164474813 | cpp |
p02972 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++... | [
"io.output.change"
] | 779,120 | 779,121 | u434662823 | cpp |
p02972 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++... | [] | 779,122 | 779,121 | u434662823 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | [
"assignment.value.change",
"identifier.change",
"assignment.change"
] | 779,130 | 779,131 | u543189005 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [] | 779,138 | 779,139 | u403813525 | cpp |
p02972 | #include <cstdlib>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::cin.ignore();
int n = N;
std::vector<int> A;
A.reserve(N);
while (n-- > 0) {
int a;
std::cin >> a;
A.push_back(a);
}
std::vector<int> ans(N, 0);
int m = 0;
for (int i = N - 1; i >= 0; --i... | #include <cstdlib>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::cin.ignore();
int n = N;
std::vector<int> A;
A.reserve(N);
while (n-- > 0) {
int a;
std::cin >> a;
A.push_back(a);
}
std::vector<int> ans(N, 0);
int m = 0;
for (int i = N - 1; i >= 0; --i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 779,144 | 779,143 | u317230226 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 779,145 | 779,146 | u051652188 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
bool boxs[200005];
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; ++i) {
cin >> a[i];
}
string ans;
int cnt = 0;
for (int i = N; i >= 1; --i) {
int sum = 0;
for (int j = N / i; j > 1; --j) {
if (boxs[j])
... | #include <bits/stdc++.h>
using namespace std;
bool boxs[200005];
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; ++i) {
cin >> a[i];
}
string ans;
int cnt = 0;
for (int i = N; i >= 1; --i) {
int sum = 0;
for (int j = N / i; j > 1; --j) {
if (boxs[j * ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 779,160 | 779,161 | u159619403 | cpp |
p02972 | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
int wk;
for (int i = 0; i < n; i++) {
cin >> wk;
a.push_back(wk);
}
vector<int> ans(n);
for (int i = 0; i < n; i++)
ans[i] = 0;
int sum;
int index;
for (int... | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
int wk;
for (int i = 0; i < n; i++) {
cin >> wk;
a.push_back(wk);
}
vector<int> ans(n);
for (int i = 0; i < n; i++)
ans[i] = 0;
int sum;
int index;
for (int... | [
"assignment.value.change",
"identifier.change"
] | 779,162 | 779,163 | u845284573 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int num, i, j, a, m = 0;
cin >> num;
vector<int> d(num + 1), ans(num + 1, false);
for (i = 1; i <= num >> 1; i++)
scanf("%d", &d[i]);
for (; i <= num; i++) {
scanf("%d", &d[i]);
ans[i] = d[i];
if... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int num, i, j, a, m = 0;
cin >> num;
vector<int> d(num + 1), ans(num + 1, false);
for (i = 1; i <= num >> 1; i++)
scanf("%d", &d[i]);
for (; i <= num; i++) {
scanf("%d", &d[i]);
ans[i] = d[i];
if... | [
"assignment.value.change",
"identifier.change"
] | 779,170 | 779,171 | u583354994 | cpp |
p02972 | #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... | [
"assignment.change"
] | 779,174 | 779,175 | u317711717 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[200000];
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
for (int j = i + i; j <= n; j += i) {
a[i] ^= a[j];
}
if (a[i]) {
ans++;
}
}
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
int a[200000];
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
for (int j = i + i; j <= n; j += i) {
a[i] ^= a[j];
}
if (a[i]) {
ans++;
}
}
cout << ans << endl;... | [] | 779,176 | 779,177 | u335832380 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
int tmp;
cin >> tmp;
A[i] = tmp;
}
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
int tmp;
cin >> tmp;
A[i] = tmp;
}
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <... | [] | 779,178 | 779,179 | u108648546 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
int tmp;
cin >> tmp;
A[i] = tmp;
}
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= N;... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
int tmp;
cin >> tmp;
A[i] = tmp;
}
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <... | [
"control_flow.loop.for.initializer.change",
"literal.string.change",
"io.output.change"
] | 779,180 | 779,179 | u108648546 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 779,181 | 779,182 | u843175622 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 779,183 | 779,184 | u942393279 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vin... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vin... | [
"call.remove",
"io.output.change"
] | 779,190 | 779,191 | u547748135 | cpp |
p02972 | /*
こんにちは。あたしはｶｳｶﾞｰﾙ。
redcoderになるためAtCoderを巡る旅をしてます。
＿_
ヽ|＿_|ノ ﾓｫ
||‘‐‘||ﾚ _)_, ―‐ 、
/(Ｙ (ヽ＿ /・ ヽ ￣ヽ
∠ ＿ ゝ ｀^ヽ ﾉ.::::_(ノヽ
_/ヽ /ヽ￣￣/ヽ
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout <... | /*
こんにちは。あたしはｶｳｶﾞｰﾙ。
redcoderになるためAtCoderを巡る旅をしてます。
＿_
ヽ|＿_|ノ ﾓｫ
||‘‐‘||ﾚ _)_, ―‐ 、
/(Ｙ (ヽ＿ /・ ヽ ￣ヽ
∠ ＿ ゝ ｀^ヽ ﾉ.::::_(ノヽ
_/ヽ /ヽ￣￣/ヽ
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout <... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,198 | 779,199 | u038027079 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define all(v) v.begin(), v.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define all(v) v.begin(), v.end()
#defin... | [
"call.function.change",
"io.output.change",
"expression.operation.binary.remove"
] | 779,200 | 779,201 | u996003680 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[i];
if (cnt % 2 ... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[j];
if (cnt % 2 ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,204 | 779,205 | u032723841 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i; j <= n; j += i)
cnt += k[i];
if (cnt % 2 != a... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[j];
if (cnt % 2 ... | [
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,206 | 779,205 | u032723841 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[i];
if ((cnt & 1)... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[j];
if (cnt % 2 ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 779,207 | 779,205 | u032723841 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[i];
if ((cnt % 2)... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[j];
if (cnt % 2 ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 779,208 | 779,205 | u032723841 | cpp |
p02972 | // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n, c = 0;
cin >> n;
vector<int> arr(n + 1), ans(n + 1);
for (int i = 1; i <... | // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n, c = 0;
cin >> n;
vector<int> arr(n + 1), ans(n + 1);
for (int i = 1; i <... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,209 | 779,210 | u692176965 | cpp |
p02972 | // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n, c = 0;
cin >> n;
vector<int> arr(n + 1), ans(n + 1);
for (int i = 1; i <... | // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n, c = 0;
cin >> n;
vector<int> arr(n + 1), ans(n + 1);
for (int i = 1; i <... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.update.change"
] | 779,211 | 779,210 | u692176965 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> yakusu(int n) {
vector<int> result;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
result.push_back(i);
if (i != n / i) {
result.push_back(n / i);
}
}
}
sort(result.begin(), resu... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> yakusu(int n) {
vector<int> result;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
result.push_back(i);
if (i != n / i) {
result.push_back(n / i);
}
}
}
sort(result.begin(), resu... | [] | 779,214 | 779,215 | u626881915 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using v = vector<T>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
templa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using v = vector<T>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
templa... | [
"assignment.value.change",
"identifier.change"
] | 779,222 | 779,223 | u136378781 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int mp[200001] = {};
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int j = n; j >= 1; j--) {
if ((mp[j] + a[j]) % 2 == 1) {
b[j] += 1;
cnt++;
for (long... | #include <bits/stdc++.h>
using namespace std;
int mp[200001] = {};
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int j = n; j >= 1; j--) {
if ((mp[j] + a[j]) % 2 == 1) {
b[j] += 1;
cnt++;
for (long... | [] | 779,227 | 779,228 | u546943614 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define vec vector
int main(void) {
int n;
cin >> n;
vec<int> a(n + 1), b(n + 1, 0);
rep(i, n) cin >> a[i + 1];
for (int i = n; i > 0; i--) {
int m = n / i;
int sum = 0;
for (int j = 2;... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define vec vector
int main(void) {
int n;
cin >> n;
vec<int> a(n + 1), b(n + 1, 0);
rep(i, n) cin >> a[i + 1];
for (int i = n; i > 0; i--) {
int m = n / i;
int sum = 0;
for (int j = 2;... | [
"assignment.change",
"control_flow.loop.for.condition.change"
] | 779,231 | 779,230 | u433219236 | cpp |
p02972 | #include <cstdio>
#define ran 202202
int n;
int a[ran], b[ran];
int v[ran], lv;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
lv = 0;
for (int i = n; i > 0; i--) {
b[i] = a[i];
for (int j = i + i; j <= n; j += i)
b[i] ^= a[j];
if (b[i] > 0)
v[lv++]... | #include <cstdio>
#define ran 202202
int n;
int a[ran], b[ran];
int v[ran], lv;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
lv = 0;
for (int i = n; i > 0; i--) {
b[i] = a[i];
for (int j = i + i; j <= n; j += i)
b[i] ^= b[j];
if (b[i] > 0)
v[lv++]... | [
"assignment.value.change",
"identifier.change"
] | 779,232 | 779,233 | u534772498 | cpp |
p02972 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef ULLONG
typedef unsigned long long ULLONG;
#endif
#ifndef LLONG
typedef long long LLONG;
#endif
template <class _T> static _T tp_abs(const _T &a) {
return ((a... |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef ULLONG
typedef unsigned long long ULLONG;
#endif
#ifndef LLONG
typedef long long LLONG;
#endif
template <class _T> static _T tp_abs(const _T &a) {
return ((a... | [] | 779,239 | 779,240 | u887675488 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> ans(n + 1);
int sum = 0;
for (int i = n; i >= 1; i--) {
int count = 0, j = 2;
while (i * j < n + 1) {
cou... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> ans(n + 1);
int sum = 0;
for (int i = n; i >= 1; i--) {
int count = 0, j = 2;
while (i * j < n + 1) {
cou... | [
"call.remove",
"call.arguments.change"
] | 779,250 | 779,251 | u324549724 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<int> A(N);
vector<int> C(N, 0);
vector<int> B(0);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int j = N - 1; j > -1; j--) {
int l = j + 1;
int X = N / l;
int Y = 0;
for (int i = X; i > 1; i--)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<int> A(N);
vector<int> C(N, 0);
vector<int> B(0);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int j = N - 1; j > -1; j--) {
int l = j + 1;
int X = N / l;
int Y = 0;
for (int i = X; i > 1; i--)
... | [] | 779,252 | 779,253 | u618604643 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<int> A(N);
vector<int> C(N, 0);
vector<int> B(0);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int j = N - 1; j > -1; j--) {
int l = j + 1;
int X = N / l;
int Y = 0;
for (int i = X; i > 1; i--)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<int> A(N);
vector<int> C(N, 0);
vector<int> B(0);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int j = N - 1; j > -1; j--) {
int l = j + 1;
int X = N / l;
int Y = 0;
for (int i = X; i > 1; i--)
... | [
"assignment.change"
] | 779,255 | 779,253 | u618604643 | cpp |
p02972 | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
ll N;
ll sum = 0;
cin >> N;
vector<ll> arr(N);
for (ll i = 0; i < N; i++) {
cin >> arr[i];
}
vector<ll> ar(N + 1... | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
ll N;
ll sum = 0;
cin >> N;
vector<ll> arr(N);
for (ll i = 0; i < N; i++) {
cin >> arr[i];
}
vector<ll> ar(N + 1... | [
"expression.operator.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 779,256 | 779,257 | u267902533 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int c;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
}
for (int i = N; i >= 1; i--) {
c = 0;
for (int j = 2; j <= N / i; j++) {
c += B.at(i * j);
}
if (c / ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int c;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
}
for (int i = N; i >= 1; i--) {
c = 0;
for (int j = 2; j <= N / i; j++) {
c += B.at(i * j);
}
if (c % ... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 779,258 | 779,259 | u072774815 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define M_DEBUG if (0)
int L_MAX = 2 * 100000;
int main() {
int n = 0;
cin >> n;
assert(1 <= n && n <= L_MAX);
vector<int> a_list;
a_list.push_back(-1); // 問題のインデックスと一致させたいので 1 から始める
for (int i = 0; i < n; i++) {
int a;
cin >> a;
assert(a == 0 |... | #include <bits/stdc++.h>
using namespace std;
#define M_DEBUG if (0)
int L_MAX = 2 * 100000;
int main() {
int n = 0;
cin >> n;
assert(1 <= n && n <= L_MAX);
vector<int> a_list;
a_list.push_back(-1); // 問題のインデックスと一致させたいので 1 から始める
for (int i = 0; i < n; i++) {
int a;
cin >> a;
assert(a == 0 |... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,280 | 779,281 | u861890385 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
vector<int> c;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int count = 0;
for (int i = n; i >= 1; i--) {
int sum =... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
vector<int> c;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int count = 0;
for (int i = n; i >= 1; i--) {
int sum =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,282 | 779,283 | u125693891 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
vector<int> c;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int count = 0;
for (int i = n; i >= 1; i--) {
int sum =... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
vector<int> c;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int count = 0;
for (int i = n; i >= 1; i--) {
int sum =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 779,284 | 779,283 | u125693891 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<bool> ans(N + 1, false);
int num = 0;
bool all_zero = true;
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
if (A.at(i) == 1)
all_zero = false;
}
for (int i ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<bool> ans(N + 1, false);
int num = 0;
bool all_zero = true;
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
if (A.at(i) == 1)
all_zero = false;
}
for (int i ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,294 | 779,295 | u372299304 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<bool> ans(N + 1, false);
int num = 0;
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
}
for (int i = N; i >= 1; i--) {
if (i >= N / 2 + 1) {
if (A.at(i) == 1)... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<bool> ans(N + 1, false);
int num = 0;
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
}
for (int i = N; i >= 1; i--) {
if (i >= N / 2 + 1) {
if (A.at(i) == 1)... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,296 | 779,297 | u372299304 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> p;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll ... | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> p;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 779,298 | 779,299 | u916743460 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
vector<int> A(200001, 0);
void So(int x) {
if (x == 1)
return;
A[0]++;
int y = sqrt(x) + 1;
for (int i = 2; i <= y; i++) {
if (x % i == 0) {
A[i - 1]++;
if (i * i != x)
A[x / i - 1]++;
}
}
}
int main() {
int N, M = 0;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
vector<int> A(200001, 0);
void So(int x) {
if (x == 1)
return;
A[0]++;
int y = sqrt(x);
for (int i = 2; i <= y; i++) {
if (x % i == 0) {
A[i - 1]++;
if (i * i != x)
A[x / i - 1]++;
}
}
}
int main() {
int N, M = 0;
cin >> N;
... | [
"expression.operation.binary.remove"
] | 779,306 | 779,307 | u045811375 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0); // 1 origin
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b(n + 1, 0); // 1 origin
bool flag = true;
for (int i = n; i >= 1; i--) {
if (n / i < 2) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0); // 1 origin
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b(n + 1, 0); // 1 origin
bool flag = true;
for (int i = n; i >= 1; i--) {
if (n / i < 2) {
... | [
"control_flow.loop.for.initializer.change"
] | 779,310 | 779,311 | u056123277 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i <... | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i <... | [
"control_flow.branch.if.condition.change"
] | 779,334 | 779,335 | u556660175 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 779,351 | 779,352 | u209767598 | cpp |
p02972 | #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 + 1);
... | #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 + 1);
... | [
"control_flow.loop.for.initializer.change"
] | 779,355 | 779,356 | u136509923 | cpp |
p02972 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
#define f(i, n) for (int i = 0; i < n; ++i)
#define pb push_back
void input() {
ll n;
cin >> n;
vector<ll> a(n);
f(i, n) cin >> a[i];
vector<ll> ans(n, 0);
for (ll i = n; i >= 1; --i) {
ll cnt = 0;
for (l... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
#define f(i, n) for (int i = 0; i < n; ++i)
#define pb push_back
void input() {
ll n;
cin >> n;
vector<ll> a(n);
f(i, n) cin >> a[i];
vector<ll> ans(n, 0);
for (ll i = n; i >= 1; --i) {
ll cnt = 0;
for (l... | [
"io.output.change"
] | 779,358 | 779,359 | u993121447 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, j;
cin >> N;
vector<int> a(N + 1);
set<int> r;
for (i = 1; i <= N; i++)
cin >> a.at(i);
for (i = N; i >= 1; i--) {
if (i > N / 2) {
if (a.at(i))
r.insert(i);
} else {
int x = 0, j = i * 2;
while (j >... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, j;
cin >> N;
vector<int> a(N + 1);
set<int> r;
for (i = 1; i <= N; i++)
cin >> a.at(i);
for (i = N; i >= 1; i--) {
if (i > N / 2) {
if (a.at(i))
r.insert(i);
} else {
int x = 0, j = i * 2;
while (j <... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 779,369 | 779,370 | u211109468 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<long long> vl;
signed main(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<long long> vl;
signed main(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,373 | 779,374 | u244583418 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<bool> a(n + 1);
vector<bool> b(n + 1);
vector<ll> out;
for (ll i = 1; i <= n; i++) {
ll x;
cin >> x;
if (x == 0)
a[i] = false;
else
a[i] = true;
}
ll num = n / 2;
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<bool> a(n + 1);
vector<bool> b(n + 1);
vector<ll> out;
for (ll i = 1; i <= n; i++) {
ll x;
cin >> x;
if (x == 0)
a[i] = false;
else
a[i] = true;
}
ll num = n / 2;
for (... | [
"literal.number.change",
"variable_declaration.value.change"
] | 779,375 | 779,376 | u855186748 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
int n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
int n;
... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 779,379 | 779,380 | u110681742 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n, cnt = 0;
cin >> n;
vector<int> as(n), ans(n);
for (int i = 0; i < n; i++)
cin >> as[i];
for (int f = n; f >= 1; f--) {
int res = 0;
for (int j = f * 2; j <= n; j += f) {
res ^= ans[j - 1];
}
if (res ^ as[f - 1]... | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n, cnt = 0;
cin >> n;
vector<int> as(n), ans(n);
for (int i = 0; i < n; i++)
cin >> as[i];
for (int f = n; f >= 1; f--) {
int res = 0;
for (int j = f * 2; j <= n; j += f) {
res ^= ans[j - 1];
}
if (res ^ as[f - 1]... | [
"io.output.change"
] | 779,382 | 779,383 | u344412812 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
//-----------------------------------------------
//------------------------------------------------
int main() {
ll n, count;
cin >> n;
vector<ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
//-----------------------------------------------
//------------------------------------------------
int main() {
ll n, count;
cin >> n;
vector<ll... | [
"expression.operation.binary.add"
] | 779,386 | 779,387 | u764744362 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
//-----------------------------------------------
//------------------------------------------------
int main() {
ll n;
cin >> n;
vector<ll> a(n +... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
//-----------------------------------------------
//------------------------------------------------
int main() {
ll n, count;
cin >> n;
vector<ll... | [
"variable_declaration.add"
] | 779,388 | 779,387 | u764744362 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <string>
#include <unordered_map>
#include <utility>
... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <string>
#include <unordered_map>
#include <utility>
... | [
"assignment.value.change"
] | 779,389 | 779,390 | u501289321 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define rrep(i, a, b) for (ll i = b - 1; i >= a; i--)
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
rrep(i, 1, n + 1) {
for (ll j = i * 2; j <= n; j += i)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define rrep(i, a, b) for (ll i = b - 1; i >= a; i--)
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
rrep(i, 1, n + 1) {
for (ll j = i * 2; j <= n; j += i)
... | [] | 779,391 | 779,392 | u874644572 | cpp |
p02972 | #include <bits/stdc++.h>
const int mod = 1e9 + 7;
using LL = long long;
using namespace std;
namespace ndifix {
template <class T> void rsort(T &v) { std::sort(v.rbegin(), v.rend()); }
} // end of namespace ndifix
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
ve... | #include <bits/stdc++.h>
const int mod = 1e9 + 7;
using LL = long long;
using namespace std;
namespace ndifix {
template <class T> void rsort(T &v) { std::sort(v.rbegin(), v.rend()); }
} // end of namespace ndifix
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
ve... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,399 | 779,400 | u819160021 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
int b[N + 1];
vector<int> v;
a[0] = 0;
b[0] = 0;
int count = 0;
int tmp = 0;
for (int i = 0; i < N; i++) {
a[i + 1] = 0... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
int b[N + 1];
vector<int> v;
a[0] = 0;
b[0] = 0;
int count = 0;
int tmp = 0;
for (int i = 0; i < N; i++) {
a[i + 1] = 0... | [] | 779,403 | 779,404 | u899929023 | cpp |
p02972 | // abc134_d.cpp
// Sat Jul 20 20:59:18 2019
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typed... | // abc134_d.cpp
// Sat Jul 20 20:59:18 2019
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typed... | [
"assignment.value.change",
"identifier.change",
"assignment.variable.change"
] | 779,405 | 779,406 | u628871447 | cpp |
p02972 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | [
"expression.operation.binary.add"
] | 779,413 | 779,414 | u031448582 | cpp |
p02972 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
int b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N / 2 + 1; i < N; i++) {
b[i] = a[i];
}
int ex;
for (int i = N / 2; i >= 0; i--) {
ex = 0;
// for(int j=((i+1)*2... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
int b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N / 2 + 1; i < N; i++) {
b[i] = a[i];
}
int ex;
for (int i = N / 2; i >= 0; i--) {
ex = 0;
// for(int j=((i+1)*2... | [
"assignment.value.change",
"identifier.change"
] | 779,417 | 779,418 | u740222581 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 200000 + 5;
int a[N];
int b[N];
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i; --i) {
int sum = 0;
for (int j = i; j <= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 200000 + 5;
int a[N];
int b[N];
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i; --i) {
int sum = 0;
for (int j = i; j <=... | [
"control_flow.loop.for.condition.change",
"call.remove",
"expression.operation.binary.remove"
] | 779,429 | 779,430 | u455472057 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 200000 + 5;
int a[N];
int b[N];
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i; --i) {
int sum = 0;
for (int j = i; j <= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 200000 + 5;
int a[N];
int b[N];
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i; --i) {
int sum = 0;
for (int j = i; j <=... | [
"control_flow.loop.for.condition.change",
"call.remove",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 779,431 | 779,430 | u455472057 | cpp |
p02972 | // Catchharsh
// I Luv Kunj017
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | // Catchharsh
// I Luv Kunj017
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 779,432 | 779,433 | u992424580 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
vector<int> c(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
b[i] = 0;
c[i] = 0;
}
// ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
vector<int> c(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
b[i] = 0;
c[i] = 0;
}
// ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 779,436 | 779,437 | u022433269 | cpp |
p02972 | #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... | [
"call.arguments.change"
] | 779,438 | 779,439 | u404075706 | cpp |
p02972 | #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... | [
"call.arguments.change"
] | 779,440 | 779,439 | u404075706 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pi 3.14159265358979323846264
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<long long>
#define vpii vector<pair<int, int>>
#define ll long long
#define fi first
#define se second
#... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pi 3.14159265358979323846264
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<long long>
#define vpii vector<pair<int, int>>
#define ll long long
#define fi first
#define se second
#... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,445 | 779,444 | u471585927 | cpp |
p02972 | #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) cout << "debug (" #a "):" << endl << (a) << endl;
typedef uint64_t ulint;
typ... | #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) cout << "debug (" #a "):" << endl << (a) << endl;
typedef uint64_t ulint;
typ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,452 | 779,451 | u561976793 | cpp |
p02972 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long n, a[200001] = {0}, i, cnt[200001] = {0}, b[200001] = {0}, j = 0,
m = 0;
long long f = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
if (cnt[i] % 2 != a[i]) {
m... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long n, a[200001] = {0}, i, cnt[200001] = {0}, b[200001] = {0}, j = 0,
m = 0;
long long f = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
if (cnt[i] % 2 != a[i]) {
m... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 779,453 | 779,454 | u196254124 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball;
vector<int> current(n + 1, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball;
vector<int> current(n + 1, ... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 779,456 | 779,457 | u553807330 | cpp |
p02972 | #include <algorithm>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n, 0);
for (int i = 1; i <= n; i++) {
... | #include <algorithm>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(2 * n), b(2 * n, 0);
for (int i = 1; i <= n;... | [
"assignment.change"
] | 779,462 | 779,463 | u579882657 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define srt(a) sort(a.be... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define srt(a) sort(a.be... | [] | 779,663 | 779,664 | u392058778 | cpp |
p02972 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
int count = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
sum = 0;
for (int j = 2;; j++) {
if ((i + 1) * j - 1 > n)
break;
sum += a[(i + 1) * j - 1];
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
int count = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
sum = 0;
for (int j = 2;; j++) {
if ((i + 1) * j > n)
break;
sum += a[(i + 1) * j - 1];
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 779,665 | 779,666 | u832158848 | cpp |
p02972 | // AtCoder Beginner Contest 134 - D
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n + 1];
bool b[n + 1];
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
bool ok = 1;
for (int i = n; i >= 1; i--) {
if... | // AtCoder Beginner Contest 134 - D
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
scanf("%d", &n);
bool a[n + 1];
bool b[n + 1];
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
bool ok = 1;
for (int i = n; i >= 1; i--) {
i... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,668 | 779,669 | u586624341 | cpp |
p02972 | // AtCoder Beginner Contest 134 - D
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n + 1];
bool b[n + 1];
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
bool ok = 1;
for (int i = n; i >= 1; i--) {
if... | // AtCoder Beginner Contest 134 - D
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
scanf("%d", &n);
bool a[n + 1];
bool b[n + 1];
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
bool ok = 1;
for (int i = n; i >= 1; i--) {
i... | [
"variable_declaration.type.primitive.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 779,670 | 779,669 | u586624341 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n, i;
int ans = 0;
cin >> n;
int a[n + 1];
a[0] = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n, i;
int ans = 0;
cin >> n;
int a[n + 1];
a[0] = 0;
for (... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 779,675 | 779,676 | u127768253 | cpp |
p02972 | #include <cstdio>
#include <iostream>
using namespace std;
int n, cnt, a[200010], b[200010];
int main() {
cin >> n;
for (register int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (register int i = n; i >= 1; --i) {
int sum = 0;
for (register int j = i * 2; j <= n; ++j)
sum += b[j];
if (sum % ... | #include <cstdio>
#include <iostream>
using namespace std;
int n, cnt, a[200010], b[200010];
int main() {
cin >> n;
for (register int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (register int i = n; i >= 1; --i) {
int sum = 0;
for (register int j = i * 2; j <= n; j += i)
sum += b[j];
if (sum... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 779,677 | 779,678 | u557325877 | cpp |
p02972 | #include <iostream>
using namespace std;
int n;
int main() {
cin >> n;
int a[n], box[n], M = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i > n / 2 - 1) {
box[i] = a[i];
if (a[i] == 1)
M++;
} else
box[i] = 0;
}
for (int i = n / 2; i > 0; i--) {
int sum = 0;
... | #include <iostream>
using namespace std;
int n;
int main() {
cin >> n;
int a[n], box[n], M = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i > n / 2 - 1) {
box[i] = a[i];
if (a[i] == 1)
M++;
} else
box[i] = 0;
}
for (int i = n / 2; i > 0; i--) {
int sum = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 779,681 | 779,682 | u190679129 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const auto MOD = 1000000007;
const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int,... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const auto MOD = 1000000007;
const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int,... | [] | 779,688 | 779,689 | u587724217 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
using namespace __gnu_pbds;
#define st first
#define nd second
void debug_out() { cerr << endl;... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
using namespace __gnu_pbds;
#define st first
#define nd second
void debug_out() { cerr << endl;... | [
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 779,690 | 779,691 | u454937339 | cpp |
p02972 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const int MOD = (int)... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const int MOD = (int)... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 779,694 | 779,693 | u952094438 | cpp |
p02972 | #include <iostream>
int n, a[200000], m, b[200000], tmp;
int main() {
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int i = n; i >= 1; i--) {
for (int j = i; j <= n / 2; j *= 2) {
tmp += b[j - 1];
}
if ((tmp % 2) != a[i - 1])
b[i - 1] = 1;
tmp = 0;
... | #include <iostream>
int n, a[200000], m, b[200000], tmp;
int main() {
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int i = n; i >= 1; i--) {
for (int j = i; j <= n; j += i) {
tmp += b[j - 1];
}
if ((tmp % 2) != a[i - 1])
b[i - 1] = 1;
tmp = 0;
}
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.update.change",
"assignment.change"
] | 779,699 | 779,700 | u688065650 | cpp |
p02972 | #include <bits/stdc++.h>
#include <math.h>
#include <sstream>
#include <string>
using namespace std;
#define endl "\n"
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <math.h>
#include <sstream>
#include <string>
using namespace std;
#define endl "\n"
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,703 | 779,704 | u806556718 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, m, t, p = 0;
bool c; // t:0
cin >> n;
m = n / 2;
vector<short> b(n);
vector<short> g(n);
for... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, m, t, p = 0;
bool c; // t:0
cin >> n;
m = n / 2;
vector<short> b(n);
vector<short> g(n);
for... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 779,706 | 779,707 | u468506413 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int M = 0;
vector<int> b(n, 0... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int M = 0;
vector<int> b(n, 0... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 779,715 | 779,716 | u115306811 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<in... | [
"call.arguments.change"
] | 779,731 | 779,732 | u006493569 | cpp |
p02972 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int index(int numToFind, std::vector<int> vectorToFindIn) {
int len = vectorToFindIn.size();
for (int i = 0; i < len; i++) {
if (vectorToFindIn[i] == numToFind) {
return i;
}
}
return -1;
}
int main() {
ios_base::sync_with_stdi... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int index(int numToFind, std::vector<int> vectorToFindIn) {
int len = vectorToFindIn.size();
for (int i = 0; i < len; i++) {
if (vectorToFindIn[i] == numToFind) {
return i;
}
}
return -1;
}
int main() {
ios_base::sync_with_stdi... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,733 | 779,734 | u674114383 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 779,735 | 779,736 | u730476362 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 779,737 | 779,736 | u730476362 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 779,738 | 779,736 | u730476362 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
// Repetitions
#define FOR(i, a, n) for (ll i = ((ll)a); i < ((ll)n); ++i)
#define FORR(i, s, g) for (ll i = ((ll)s - 1); i >= ((ll)g); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
// Container Utils
#define ALL(v) (v).begin(), (v).end()
#define R... | #include <bits/stdc++.h>
using namespace std;
// Repetitions
#define FOR(i, a, n) for (ll i = ((ll)a); i < ((ll)n); ++i)
#define FORR(i, s, g) for (ll i = ((ll)s - 1); i >= ((ll)g); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
// Container Utils
#define ALL(v) (v).begin(), (v).end()
#define R... | [
"expression.operation.binary.add"
] | 779,745 | 779,746 | u203062059 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
vector<int> div(int N) {
vector<int> ret;
for (int i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N)
ret.push_back(N / i);
}
}
return (ret);
}
signed ... | #include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
vector<int> div(int N) {
vector<int> ret;
for (int i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N)
ret.push_back(N / i);
}
}
return (ret);
}
signed ... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,747 | 779,748 | u840810569 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.