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 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define LOWER_BOUND(A, key) distance(A.begin(), lower_bound(ALL(A), key))
#define UPPER_BOUND(A, key) distance(A.begin(), upper_bound(ALL(A), key))
#define Endl endl
using namespace std;
const int MOD = (int)(1e9 + 7);
const int INF = (int)(1e13 + 7);
const double PI = acos(-1);
int CEIL(int a, int b) {
return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b);
} // ceil() for int
int mod(int a, int b) {
return a >= 0 ? a % b : a - (b * CEIL(a, b));
} // always return positive num
int pow(int x, int y) { // return x^y in order(log(y))
if (x == 0)
return 0;
if (y == 0)
return 1;
int ans = 1;
int digit = (int)((log((double)y) / log((double)2) / 1 + 1));
x %= MOD;
for (int i = 0; i < digit; i++) {
if (((y >> i) & 1u) == 1)
ans = ans * x % MOD;
x = x * x % MOD;
}
return ans;
}
template <class T> void cumulative_sum(T &container) {
for (int i = 0; i < container.size() - 1; i++)
container[i + 1] += container[i];
}
class DPreparingBoxes {
public:
static void solve(istream &cin, ostream &cout) {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> ball(N, 0);
for (int i = N - 1; i >= 0; i--) {
int now = 0;
for (int j = i; j < N; j += (i + 1)) {
now += ball[j];
}
if (now % 2 != a[i]) {
ball[i] = 1;
}
}
cout << accumulate(ALL(ball), 0LL) << endl;
rep(i, N) {
if (ball[i]) {
cout << a[i];
if (i != N - 1) {
cout << " ";
}
}
}
if (accumulate(ALL(ball), 0LL) > 0)
cout << endl;
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
DPreparingBoxes solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define LOWER_BOUND(A, key) distance(A.begin(), lower_bound(ALL(A), key))
#define UPPER_BOUND(A, key) distance(A.begin(), upper_bound(ALL(A), key))
#define Endl endl
using namespace std;
const int MOD = (int)(1e9 + 7);
const int INF = (int)(1e13 + 7);
const double PI = acos(-1);
int CEIL(int a, int b) {
return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b);
} // ceil() for int
int mod(int a, int b) {
return a >= 0 ? a % b : a - (b * CEIL(a, b));
} // always return positive num
int pow(int x, int y) { // return x^y in order(log(y))
if (x == 0)
return 0;
if (y == 0)
return 1;
int ans = 1;
int digit = (int)((log((double)y) / log((double)2) / 1 + 1));
x %= MOD;
for (int i = 0; i < digit; i++) {
if (((y >> i) & 1u) == 1)
ans = ans * x % MOD;
x = x * x % MOD;
}
return ans;
}
template <class T> void cumulative_sum(T &container) {
for (int i = 0; i < container.size() - 1; i++)
container[i + 1] += container[i];
}
class DPreparingBoxes {
public:
static void solve(istream &cin, ostream &cout) {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> ball(N, 0);
for (int i = N - 1; i >= 0; i--) {
int now = 0;
for (int j = i; j < N; j += (i + 1)) {
now += ball[j];
}
if (now % 2 != a[i]) {
ball[i] = 1;
}
}
cout << accumulate(ALL(ball), 0LL) << endl;
rep(i, N) {
if (ball[i]) {
cout << i + 1;
if (i != N - 1) {
cout << " ";
}
}
}
if (accumulate(ALL(ball), 0LL) > 0)
cout << endl;
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
DPreparingBoxes solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| [
"io.output.change"
] | 776,816 | 776,817 | u385244248 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int b[200005];
int main() {
int n;
cin >> n;
int tmp;
int ans;
int count = 0;
for (int i = 1; i < n + 1; i++)
cin >> a[i];
for (int i = n; i >= 0; i++) {
tmp = i;
ans = 0;
while (tmp <= n) {
ans += b[tmp];
tmp += i;
}
if (ans % 2 != a[i]) {
b[i]++;
count++;
}
}
cout << count << endl;
for (int i = 1; i < n + 1; i++)
if (b[i] > 0)
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int b[200005];
int main() {
int n;
cin >> n;
int tmp;
int ans;
int count = 0;
for (int i = 1; i < n + 1; i++)
cin >> a[i];
for (int i = n; i > 0; i--) {
tmp = i;
ans = 0;
while (tmp <= n) {
ans += b[tmp];
tmp += i;
}
if (ans % 2 != a[i]) {
b[i]++;
count++;
}
}
cout << count << endl;
for (int i = 1; i < n + 1; i++)
if (b[i] > 0)
cout << i << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,822 | 776,821 | u983681697 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
int Bcnt = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int total = 0;
for (int j = i + i; j <= N; j += i) {
total += B[i];
}
if (total % 2 != A[i]) {
Bcnt++;
B[i] = 1;
}
}
cout << Bcnt << "\n";
for (int i = 1; i <= N; i++) {
if (B[i]) {
cout << i << " ";
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
int Bcnt = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int total = 0;
for (int j = i + i; j <= N; j += i) {
total ^= B[j];
}
if (total != A[i]) {
Bcnt++;
B[i] = 1;
}
}
cout << Bcnt << "\n";
for (int i = 1; i <= N; i++) {
if (B[i]) {
cout << i << " ";
}
}
return 0;
} | [
"expression.operator.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 776,823 | 776,824 | u557207741 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
int Bcnt = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int total = 0;
for (int j = i + i; j <= N; j += i) {
total += B[i];
}
if (total % 2 != A[i] % 2) {
Bcnt++;
B[i] = 1;
}
}
cout << Bcnt << "\n";
for (int i = 1; i <= N; i++) {
if (B[i]) {
cout << i << " ";
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
int Bcnt = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int total = 0;
for (int j = i + i; j <= N; j += i) {
total ^= B[j];
}
if (total != A[i]) {
Bcnt++;
B[i] = 1;
}
}
cout << Bcnt << "\n";
for (int i = 1; i <= N; i++) {
if (B[i]) {
cout << i << " ";
}
}
return 0;
} | [
"expression.operator.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 776,825 | 776,824 | u557207741 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
int Bcnt = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int total = 0;
for (int j = i + i; j <= N; j += i) {
total += B[i];
}
if (total % 2 != A[i]) {
Bcnt++;
B[i] = 1;
}
}
cout << Bcnt << "\n";
for (int i = 1; i <= N; i++) {
if (B[i]) {
cout << i << " ";
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
int Bcnt = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int total = 0;
for (int j = i + i; j <= N; j += i) {
total += B[j];
}
if (total % 2 != A[i]) {
Bcnt++;
B[i] = 1;
}
}
cout << Bcnt << "\n";
for (int i = 1; i <= N; i++) {
if (B[i]) {
cout << i << " ";
}
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 776,823 | 776,826 | u557207741 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
int Bcnt = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int total = 0;
for (int j = i + i; j <= N; j += i) {
total += B[i];
}
if (total % 2 != A[i] % 2) {
Bcnt++;
B[i] = 1;
}
}
cout << Bcnt << "\n";
for (int i = 1; i <= N; i++) {
if (B[i]) {
cout << i << " ";
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
int Bcnt = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int total = 0;
for (int j = i + i; j <= N; j += i) {
total += B[j];
}
if (total % 2 != A[i]) {
Bcnt++;
B[i] = 1;
}
}
cout << Bcnt << "\n";
for (int i = 1; i <= N; i++) {
if (B[i]) {
cout << i << " ";
}
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 776,825 | 776,826 | u557207741 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define uniq(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
int n;
int a[202000];
bool m[202000];
vector<int> b;
int szb;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) m[i] = false;
rrep(i, n) {
int sum = 0;
for (int ii = (i + 1) * 2; ii < n; ii += (i + 1)) {
sum += (m[ii] ? 1 : 0);
}
m[i] = !((sum % 2) == a[i]);
if (m[i])
b.push_back(i + 1);
}
int szb = sz(b);
cout << szb << endl;
rep(i, szb) { cout << b[i] << ((i == (szb - 1)) ? "\n" : " "); }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define uniq(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
int n;
int a[202000];
bool m[202000];
vector<int> b;
int szb;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) m[i] = false;
rrep(i, n) {
int sum = 0;
for (int ii = ((i + 1) * 2 - 1); ii < n; ii += (i + 1)) {
sum += (m[ii] ? 1 : 0);
}
m[i] = !((sum % 2) == a[i]);
if (m[i])
b.push_back(i + 1);
}
int szb = sz(b);
cout << szb << endl;
rep(i, szb) { cout << b[i] << ((i == (szb - 1)) ? "\n" : " "); }
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 776,827 | 776,828 | u225581241 | cpp |
p02972 | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
int N;
int A[SIZE];
int table[SIZE];
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
table[i] = 0;
}
int num = 0;
stack<int> S;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int k = 2 * i; k <= N; k += i) {
sum += table[k];
}
if (sum % 2 == A[i]) {
// Do noghint
} else {
num++;
A[i] = 1;
S.push(i);
}
}
printf("%d\n", num);
if (num == 0) {
return 0;
}
printf("%d", S.top());
S.pop();
while (!S.empty()) {
printf(" %d", S.top());
S.pop();
}
printf("\n");
return 0;
}
| #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
int N;
int A[SIZE];
int table[SIZE];
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
table[i] = 0;
}
int num = 0;
stack<int> S;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int k = 2 * i; k <= N; k += i) {
sum += table[k];
}
if (sum % 2 == A[i]) {
// Do noghint
} else {
num++;
table[i] = 1;
S.push(i);
}
}
printf("%d\n", num);
if (num == 0) {
return 0;
}
printf("%d", S.top());
S.pop();
while (!S.empty()) {
printf(" %d", S.top());
S.pop();
}
printf("\n");
return 0;
}
| [
"assignment.variable.change",
"identifier.change"
] | 776,829 | 776,830 | u000022466 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, len = 0;
int a[200005], b[200005], ans[200005];
signed main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sumv = 0;
for (int j = 2 * i; j <= n; j++)
sumv = (sumv + b[j]) % 2;
if (sumv == a[i])
b[i] = 0;
else
b[i] = 1;
}
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
ans[++len] = i;
}
cout << len << endl;
for (int i = 1; i <= len; i++)
cout << ans[i] << ' ';
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, len = 0;
int a[200005], b[200005], ans[200005];
signed main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sumv = 0;
for (int j = 2 * i; j <= n; j += i)
sumv = (sumv + b[j]) % 2;
if (sumv == a[i])
b[i] = 0;
else
b[i] = 1;
}
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
ans[++len] = i;
}
cout << len << endl;
for (int i = 1; i <= len; i++)
cout << ans[i] << ' ';
cout << endl;
return 0;
}
| [] | 776,831 | 776,832 | u952557476 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N - 1; i >= 0; i--)
using ll = long long;
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
int main() {
int N, M = 0;
cin >> N;
vi a(N), b(N);
rep(i, N) cin >> a[i];
repr(i, N) {
ll asum = 0;
rep1(j, N / (i + 1) - 1) { asum += b[i + 1 + j * (i + 1)]; }
asum %= 2;
b[i] = (a[i] - asum + 2) % 2;
if (b[i] == 1)
M++;
}
cout << M << "\n";
rep(i, N) {
if (b[i] == 1)
cout << (i + 1) << " ";
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N - 1; i >= 0; i--)
using ll = long long;
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
int main() {
int N, M = 0;
cin >> N;
vi a(N), b(N);
rep(i, N) cin >> a[i];
repr(i, N) {
ll asum = 0;
rep1(j, N / (i + 1) - 1) { asum += b[i + j * (i + 1)]; }
asum %= 2;
b[i] = (a[i] - asum + 2) % 2;
if (b[i] == 1)
M++;
}
cout << M << "\n";
rep(i, N) {
if (b[i] == 1)
cout << (i + 1) << " ";
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 776,833 | 776,834 | u099619676 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), x(n + 1, 0), ans(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a.at(i);
for (int i = n; i >= 1; i--) {
ans.at(i) = x.at(i) ^ a.at(i);
for (int j = 1; j * j <= i; j++) {
if (!(i % j)) {
x.at(j) = x.at(j) ^ ans.at(j);
if ((j != 1) || (j != i % j))
x.at(i / j) = x.at(i / j) ^ ans.at(i / j);
}
}
}
int count = 0;
for (int i = 1; i <= n; i++)
if (ans.at(i))
count++;
cout << count << endl;
for (int i = 1; i <= n; i++)
if (ans.at(i))
cout << i << " ";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), x(n + 1, 0), ans(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a.at(i);
for (int i = n; i >= 1; i--) {
ans.at(i) = x.at(i) ^ a.at(i);
for (int j = 1; j * j <= i; j++) {
if (!(i % j)) {
x.at(j) = x.at(j) ^ ans.at(i);
if ((j != 1) && (j != i / j))
x.at(i / j) = x.at(i / j) ^ ans.at(i);
}
}
}
int count = 0;
for (int i = 1; i <= n; i++)
if (ans.at(i))
count++;
cout << count << endl;
for (int i = 1; i <= n; i++)
if (ans.at(i))
cout << i << " ";
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.remove"
] | 776,837 | 776,838 | u082801599 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int a[200005];
int b[200005] = {0};
int ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int k;
for (int i = n; i >= 1; i--) {
k = 0;
for (int j = i; j <= n; j = j + i) {
k += b[i];
}
if (k % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (b[i]) {
cout << i << " ";
}
}
cout << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int a[200005];
int b[200005] = {0};
int ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int k;
for (int i = n; i >= 1; i--) {
k = 0;
for (int j = i; j <= n; j = j + i) {
k += b[j];
}
if (k % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (b[i]) {
cout << i << " ";
}
}
cout << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 776,846 | 776,847 | u758223800 | cpp |
p02972 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const long long INF = 1LL << 61;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> box(N, 0);
rep(i, N) {
int num = N / (N - i);
int total = 0;
rep(j, num - 1) total += box[(j + 2) * (N - i) - 1];
if (total % 2 == 0) {
if (a[N - i - 1] == 0)
box[N - i - 1] = 0;
else
box[N - i - 1] = 1;
} else {
if (a[N - i - 1] == 0)
box[N - i - 1] = 1;
else
box[N - i - 1] = 0;
}
}
int M = accumulate(box.begin(), box.end(), 0);
if (M % 2 == box[0]) {
cout << M << endl;
rep(i, N) {
if (box[i] == 1)
cout << i + 1 << " ";
}
} else
cout << -1;
} | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const long long INF = 1LL << 61;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> box(N, 0);
rep(i, N) {
int num = N / (N - i);
int total = 0;
rep(j, num - 1) total += box[(j + 2) * (N - i) - 1];
if (total % 2 == 0) {
if (a[N - i - 1] == 0)
box[N - i - 1] = 0;
else
box[N - i - 1] = 1;
} else {
if (a[N - i - 1] == 0)
box[N - i - 1] = 1;
else
box[N - i - 1] = 0;
}
}
int M = accumulate(box.begin(), box.end(), 0);
if (M % 2 == a[0]) {
cout << M << endl;
rep(i, N) {
if (box[i] == 1)
cout << i + 1 << " ";
}
} else
cout << -1;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,848 | 776,849 | u289578952 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int a[200006];
int sum[200006];
int b[200006];
int main() {
int n;
int i, j;
int m = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum[i] = b[i] = 0;
}
vector<int> ans;
for (i = n; i >= 1; i--) {
int sum = 0;
for (j = i; j <= n; j += j) {
sum += b[j];
}
if (a[i] == 0) {
if (sum % 2 == 1) {
b[i] = 1;
ans.push_back(i);
}
}
else {
if (sum % 2 == 0) {
b[i] = 1;
ans.push_back(i);
}
}
}
printf("%d\n", ans.size());
for (i = 0; i < ans.size(); i++) {
printf("%d\n", ans[i]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int a[200006];
int sum[200006];
int b[200006];
int main() {
int n;
int i, j;
int m = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum[i] = b[i] = 0;
}
vector<int> ans;
for (i = n; i >= 1; i--) {
int sum = 0;
for (j = i; j <= n; j += i) {
sum += b[j];
}
if (a[i] == 0) {
if (sum % 2 == 1) {
b[i] = 1;
ans.push_back(i);
}
}
else {
if (sum % 2 == 0) {
b[i] = 1;
ans.push_back(i);
}
}
}
printf("%d\n", ans.size());
for (i = 0; i < ans.size(); i++) {
printf("%d\n", ans[i]);
}
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 776,853 | 776,854 | u253584031 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
// ex.n = 60 = 2^2 * 3 * 5ใชใ{(2, 2), (3, 1), (5, 1)}ใ่ฟใ
vector<P> prime_factorize(int n) {
vector<P> res;
for (int p = 2; p * p <= n; p++) {
if (n % p != 0)
continue;
else {
int num = 0;
while (n % p == 0) {
num++;
n /= p;
}
res.push_back(make_pair(p, num));
}
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cout.precision(20);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
vec b(n + 1, 0);
int m = 0;
RREP(i, n) {
int t = i + 1;
int cnt = 0;
//(n / i)ๅใฎใซใผใ
while (t < n + 1) {
if (b[t] == 1)
cnt++;
t += t;
}
if (cnt % 2 != a[i]) {
b[i + 1]++;
m++;
}
}
cout << m << endl;
REP(i, n + 1) {
if (b[i + 1] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
// ex.n = 60 = 2^2 * 3 * 5ใชใ{(2, 2), (3, 1), (5, 1)}ใ่ฟใ
vector<P> prime_factorize(int n) {
vector<P> res;
for (int p = 2; p * p <= n; p++) {
if (n % p != 0)
continue;
else {
int num = 0;
while (n % p == 0) {
num++;
n /= p;
}
res.push_back(make_pair(p, num));
}
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cout.precision(20);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
vec b(n + 1, 0);
int m = 0;
RREP(i, n) {
int t = i + 1;
int cnt = 0;
//(n / i)ๅใฎใซใผใ
while (t < n + 1) {
if (b[t] == 1)
cnt++;
t += i + 1;
}
if (cnt % 2 != a[i]) {
b[i + 1]++;
m++;
}
}
cout << m << endl;
REP(i, n + 1) {
if (b[i + 1] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
} | [
"assignment.value.change",
"assignment.change"
] | 776,855 | 776,856 | u237054088 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> res(n + 1), a(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i >= n / 2) {
res.at(i + 1) = a.at(i);
if (res.at(i + 1) == 1)
cnt++;
}
}
for (int i = n / 2; i > 0; i--) {
int cnt1 = 2;
while (cnt1 * i <= n) {
res.at(i) += res.at(i * cnt1);
cnt1++;
res.at(i) %= 2;
}
if ((a.at(i - 1) + res.at(i)) % 2 == 0)
res.at(i) = 0;
else {
res.at(i) = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= 10; i++) {
if (res.at(i))
cout << i << " ";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> res(n + 1), a(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i >= n / 2) {
res.at(i + 1) = a.at(i);
if (res.at(i + 1) == 1)
cnt++;
}
}
for (int i = n / 2; i > 0; i--) {
int cnt1 = 2;
while (cnt1 * i <= n) {
res.at(i) += res.at(i * cnt1);
cnt1++;
res.at(i) %= 2;
}
if ((a.at(i - 1) + res.at(i)) % 2 == 0)
res.at(i) = 0;
else {
res.at(i) = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (res.at(i))
cout << i << " ";
}
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,857 | 776,858 | u515131769 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> res(n + 1), a(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i >= n / 2) {
res.at(i + 1) = a.at(i);
if (res.at(i + 1) == 1)
cnt++;
}
}
for (int i = n / 2; i > 0; i--) {
int cnt1 = 2;
while (cnt1 * i <= n) {
res.at(i) += a.at(i * cnt1 - 1);
cnt1++;
res.at(i) %= 2;
}
if ((a.at(i - 1) + res.at(i)) % 2 == 0)
res.at(i) = 0;
else {
res.at(i) = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (res.at(i))
cout << i << " ";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> res(n + 1), a(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i >= n / 2) {
res.at(i + 1) = a.at(i);
if (res.at(i + 1) == 1)
cnt++;
}
}
for (int i = n / 2; i > 0; i--) {
int cnt1 = 2;
while (cnt1 * i <= n) {
res.at(i) += res.at(i * cnt1);
cnt1++;
res.at(i) %= 2;
}
if ((a.at(i - 1) + res.at(i)) % 2 == 0)
res.at(i) = 0;
else {
res.at(i) = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (res.at(i))
cout << i << " ";
}
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.remove"
] | 776,859 | 776,858 | u515131769 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll factorial(ll n) {
if (n == 1) {
return 1;
}
ll ans = factorial(n - 1);
return ans * n;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = mod_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
int main() {
ll n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v.at(i);
vector<ll> res;
vector<ll> sum(n, 0);
for (ll i = n - 1; i >= 0; i--) {
if (sum.at(i) != v.at(i)) {
res.push_back(i + 1);
for (ll j = 1; j * j <= i + 1; j++) {
if ((i + 1) % j == 0) {
sum.at(j)++;
if (j != (i + 1) / j)
sum.at((i + 1) / j)++;
}
}
}
}
sort(res.begin(), res.end());
cout << res.size() << endl;
rep(i, res.size()) {
if (i)
cout << ' ' << res.at(i);
else
cout << res.at(i);
if (i == res.size() - 1)
cout << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll factorial(ll n) {
if (n == 1) {
return 1;
}
ll ans = factorial(n - 1);
return ans * n;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = mod_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
int main() {
ll n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v.at(i);
vector<ll> res;
vector<ll> sum(n, 0);
for (ll i = n - 1; i >= 0; i--) {
if (sum.at(i) % 2 != v.at(i)) {
res.push_back(i + 1);
for (ll j = 1; j * j <= i + 1; j++) {
if ((i + 1) % j == 0) {
sum.at(j - 1)++;
if (j != (i + 1) / j)
sum.at((i + 1) / j - 1)++;
}
}
}
}
sort(res.begin(), res.end());
cout << res.size() << endl;
rep(i, res.size()) {
if (i)
cout << ' ' << res.at(i);
else
cout << res.at(i);
if (i == res.size() - 1)
cout << endl;
}
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add"
] | 776,862 | 776,861 | u785492958 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 10000000000000
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define repN_1(i, n) for (ll i = 0; i < (ll)(n - 1); i++)
#define repM(i, n) for (ll i = (ll)(n - 1); i >= 0; i--)
#define repM1(i, n) for (ll i = (ll)(n - 1); i > 0; i--)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
cout << fixed << setprecision(18);
ll n, m;
cin >> n;
m = 0;
vector<ll> a(n + 1), b(n + 1, 0);
rep1(i, n + 1) cin >> a[i];
ll count = 0;
repM1(i, n + 1) {
ll j = 2;
ll c = 0;
while (i * j <= n) {
c += a[i * j];
j++;
}
if (c % 2 != a[i]) {
b[i] = 1;
count++;
}
}
cout << count << endl;
rep1(i, n + 1) {
if (b[i] == 1)
cout << i << " ";
}
cout << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 10000000000000
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define repN_1(i, n) for (ll i = 0; i < (ll)(n - 1); i++)
#define repM(i, n) for (ll i = (ll)(n - 1); i >= 0; i--)
#define repM1(i, n) for (ll i = (ll)(n - 1); i > 0; i--)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
cout << fixed << setprecision(18);
ll n, m;
cin >> n;
m = 0;
vector<ll> a(n + 1), b(n + 1, 0);
rep1(i, n + 1) cin >> a[i];
ll count = 0;
repM1(i, n + 1) {
ll j = 2;
ll c = 0;
while (i * j <= n) {
c += b[i * j];
j++;
}
if (c % 2 != a[i]) {
b[i] = 1;
count++;
}
}
cout << count << endl;
rep1(i, n + 1) {
if (b[i] == 1)
cout << i << " ";
}
cout << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 776,867 | 776,868 | u466275789 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
using P = pair<int, int>;
#define MOD 1000000007
#define INF 1000000
/*
N=2*10^5
Nๅใฎ็ฎฑใซ็ชๅท1-Nใๆธใใฆใใ
ไปปๆใฎๆดๆฐi(1<=i<=N)ใซๅฏพใใฆ
iใฎๅๆฐใฎ็ชๅทใฎ็ฎฑใฎใใผใซใฎ็ทๅ %2 ==ai
*/
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> b(N + 1, 0);
for (int i = N; i >= 1; i--) {
// Nใฎๅๆฐใใ้ ็ชใซๅ
ฅใใฆใใ
// iใฎๅๆฐใ่ถณใใฆใ๏ผใงๅฒใฃใฆa[i]ใจไธ่ดใใใ0
//ไธ่ดใใชใใใฐ1ใใใ๏ผ๏ผ
int d = 1;
int sum = 0;
while (d * i <= N) {
sum += b[i];
d++;
}
// cout<<sum<<endl;
if (sum % 2 != a[i])
b[i] = 1;
}
int count = 0;
for (int i = 1; i <= N; i++) {
if (b[i] == 1)
count++;
}
cout << count << endl;
for (int i = 1; i <= N; i++) {
if (b[i] == 1)
cout << i << " ";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
using P = pair<int, int>;
#define MOD 1000000007
#define INF 1000000
/*
N=2*10^5
Nๅใฎ็ฎฑใซ็ชๅท1-Nใๆธใใฆใใ
ไปปๆใฎๆดๆฐi(1<=i<=N)ใซๅฏพใใฆ
iใฎๅๆฐใฎ็ชๅทใฎ็ฎฑใฎใใผใซใฎ็ทๅ %2 ==ai
*/
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> b(N + 1, 0);
for (int i = N; i >= 1; i--) {
// Nใฎๅๆฐใใ้ ็ชใซๅ
ฅใใฆใใ
// iใฎๅๆฐใ่ถณใใฆใ๏ผใงๅฒใฃใฆa[i]ใจไธ่ดใใใ0
//ไธ่ดใใชใใใฐ1ใใใ๏ผ๏ผ
int d = 1;
int sum = 0;
while (d * i <= N) {
sum += b[d * i];
d++;
}
// cout<<i<<" "<<sum<<endl;
if (sum % 2 != a[i])
b[i] = 1;
}
// for (int i=1;i<=N;i++)
// cout<<"b["<<i<<"]="<<b[i]<<endl;
int count = 0;
for (int i = 1; i <= N; i++) {
if (b[i] == 1)
count++;
}
cout << count << endl;
for (int i = 1; i <= N; i++) {
if (b[i] == 1)
cout << i << " ";
}
} | [
"assignment.change"
] | 776,869 | 776,870 | u711676593 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//ใใฏใญ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortใชใฉใฎๅผๆฐใ็็ฅใใใ
#define SIZE(x) ((ll)(x).size()) // sizeใsize_tใใllใซ็ดใใฆใใ
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S second
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n);
REP(i, n)
cin >> a[i];
// ้้ ใงๆขใ.
// ่ชๅใๅๆฐใฎใใกไธ็ชๅคงใใใจใใฏใใฎใพใพใใ
// ็ดๆฐใจใใฆไธ็ชๅฐใใใชใใจใใฏไธใฎ็ดๆฐใฎใฟๅ็
งใใ
int ans[n] = {0};
REPD(i, n) {
int sho = n / (i + 1);
if (sho == 1) {
ans[i] = a[i];
} else {
ll counter = 0;
FOR(roop, 2, sho) {
int tmp = (i + 1) * roop - 1;
if (a[tmp] == 1) {
counter++;
}
}
if (counter % 2 == a[i])
continue;
else
ans[i] = 1;
}
}
ll ans_counter = 0;
vector<ll> ansvec;
REP(i, n) {
if (ans[i]) {
ans_counter++;
ansvec.PB(i + 1);
}
}
cout << ans_counter << endl;
if (ans_counter != 0) {
REP(i, SIZE(ansvec))
cout << ansvec[i] << " ";
cout << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//ใใฏใญ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortใชใฉใฎๅผๆฐใ็็ฅใใใ
#define SIZE(x) ((ll)(x).size()) // sizeใsize_tใใllใซ็ดใใฆใใ
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S second
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n);
REP(i, n)
cin >> a[i];
// ้้ ใงๆขใ.
// ่ชๅใๅๆฐใฎใใกไธ็ชๅคงใใใจใใฏใใฎใพใพใใ
// ็ดๆฐใจใใฆไธ็ชๅฐใใใชใใจใใฏไธใฎ็ดๆฐใฎใฟๅ็
งใใ
int ans[n] = {0};
REPD(i, n) {
int sho = n / (i + 1);
if (sho == 1) {
ans[i] = a[i];
} else {
ll counter = 0;
FOR(roop, 2, sho) {
int tmp = (i + 1) * roop - 1;
if (ans[tmp] == 1) {
counter++;
}
}
if (counter % 2 == a[i])
continue;
else
ans[i] = 1;
}
}
ll ans_counter = 0;
vector<ll> ansvec;
REP(i, n) {
if (ans[i]) {
ans_counter++;
ansvec.PB(i + 1);
}
}
cout << ans_counter << endl;
if (ans_counter != 0) {
REP(i, SIZE(ansvec))
cout << ansvec[i] << " ";
cout << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,875 | 776,876 | u053035261 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << ' '
#define inf 100000000000
#define loop(i, n) for (ll i = 0; i < n; i++)
#define graph vector<vector<ll>>
#define P pair<ll, ll>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N), b(N, -1);
loop(i, N) { cin >> a[i]; }
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = i + 1; j <= N; j += i + 1) {
sum ^= b[j - 1];
}
b[i - 1] = sum ^ a[i - 1];
}
vector<int> result;
loop(i, N) {
if (b[i] == 1)
result.push_back(i + 1);
}
cout << result.size() << endl;
loop(i, result.size()) { cout << result[i] << " " << endl; }
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << ' '
#define inf 100000000000
#define loop(i, n) for (ll i = 0; i < n; i++)
#define graph vector<vector<ll>>
#define P pair<ll, ll>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N), b(N, 0);
loop(i, N) { cin >> a[i]; }
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= N; j += i) {
sum ^= b[j - 1];
}
b[i - 1] = sum ^ a[i - 1];
}
vector<int> result;
loop(i, N) {
if (b[i] == 1)
result.push_back(i + 1);
}
cout << result.size() << endl;
loop(i, result.size()) { cout << result[i] << " " << endl; }
} | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.loop.for.update.change"
] | 776,879 | 776,880 | u071036035 | cpp |
p02972 | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
long long N;
cin >> N;
long long a[N];
for (long long i = 0; i < N; ++i)
cin >> a[i];
long long rets[N];
long long c = 0;
for (int i = N; i > 0; --i) {
long long x = 0;
for (long long j = 2; j <= N / i; ++j) {
x += a[i * j - 1];
}
if (x % 2 == 0 && a[i - 1] == 0)
rets[i - 1] = 0;
else if (x % 2 == 0 && a[i - 1] == 1)
rets[i - 1] = 1;
else if (x % 2 == 1 && a[i - 1] == 0)
rets[i - 1] = 1;
else if (x % 2 == 1 && a[i - 1] == 1)
rets[i - 1] = 0;
if (rets[i - 1] == 1)
++c;
}
cout << c << endl;
bool first = true;
if (c > 0) {
for (long long i = 0; i < N; ++i) {
if (rets[i] == 1) {
if (!first)
cout << " ";
cout << i + 1;
first = false;
}
}
cout << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
long long N;
cin >> N;
long long a[N];
for (long long i = 0; i < N; ++i)
cin >> a[i];
long long rets[N];
long long c = 0;
for (int i = N; i > 0; --i) {
long long x = 0;
for (long long j = 2; j <= N / i; ++j) {
x += rets[i * j - 1];
}
if (x % 2 == 0 && a[i - 1] == 0)
rets[i - 1] = 0;
else if (x % 2 == 0 && a[i - 1] == 1)
rets[i - 1] = 1;
else if (x % 2 == 1 && a[i - 1] == 0)
rets[i - 1] = 1;
else if (x % 2 == 1 && a[i - 1] == 1)
rets[i - 1] = 0;
if (rets[i - 1] == 1)
++c;
}
cout << c << endl;
bool first = true;
if (c > 0) {
for (long long i = 0; i < N; ++i) {
if (rets[i] == 1) {
if (!first)
cout << " ";
cout << i + 1;
first = false;
}
}
cout << endl;
}
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 776,881 | 776,882 | u894471318 | cpp |
p02972 | #include <bits/stdc++.h>
//#define <- ใใญใฐใฉใ ใฎๆๅญๅใ็ฝฎๆใใ
// typedef <- ๆฐใใๅใซๅๅใไปใใใใใฎใญใผใฏใผใ
using namespace std;
#define MAX_N 1
typedef long long ll;
const double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> box(N + 1);
stack<int> s;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = N; i >= 1; --i) {
if (2 * i > N) {
box[i] = a[i];
if (a[i] == 1)
s.push(i);
} else {
int maxi = N / i;
int mini = 2;
int sum = 0;
while (1) {
if (maxi < mini)
break;
if (maxi == mini) {
sum += box[maxi];
break;
} else
sum += box[maxi] + box[mini];
maxi--;
mini++;
}
if ((sum + a[i]) % 2 == 1) {
box[i] = 1;
s.push(i);
} else
box[i] = 0;
}
}
if (s.empty())
cout << 0 << endl;
else {
cout << s.size() << endl;
while (!s.empty()) {
cout << s.top() << endl;
s.pop();
}
}
return 0;
} | #include <bits/stdc++.h>
//#define <- ใใญใฐใฉใ ใฎๆๅญๅใ็ฝฎๆใใ
// typedef <- ๆฐใใๅใซๅๅใไปใใใใใฎใญใผใฏใผใ
using namespace std;
#define MAX_N 1
typedef long long ll;
const double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> box(N + 1);
stack<int> s;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = N; i >= 1; --i) {
if (2 * i > N) {
box[i] = a[i];
if (a[i] == 1)
s.push(i);
} else {
int maxi = N / i;
int mini = 2;
int sum = 0;
while (1) {
if (maxi < mini)
break;
if (maxi == mini) {
sum += box[maxi * i];
break;
} else
sum += box[maxi * i] + box[mini * i];
maxi--;
mini++;
}
if ((sum + a[i]) % 2 == 1) {
box[i] = 1;
s.push(i);
} else
box[i] = 0;
}
}
if (s.empty())
cout << 0 << endl;
else {
cout << s.size() << endl;
while (!s.empty()) {
cout << s.top() << endl;
s.pop();
}
}
return 0;
} | [
"assignment.change"
] | 776,883 | 776,884 | u705561278 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define owo \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define mod (ll)(1e9 + 7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) \
for (long blockTime = 0; \
(blockTime == 0 ? (blockTime = clock()) != 0 : false); \
debug("%s time : %.4fs\n", d, \
(double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> PII;
typedef pair<int, int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
int gcd(int A, int B) {
if (!B)
return A;
return gcd(B, A % B);
}
int a[200005];
vector<int> b(200005, 0);
int cnt = 0;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int balls = 0;
for (int j = i; j <= n; j += i)
balls += b[j];
if (balls % 2 != a[i] % 2) {
b[i] = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 0; i < n; i++)
if (b[i])
cout << i << " ";
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define owo \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define mod (ll)(1e9 + 7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) \
for (long blockTime = 0; \
(blockTime == 0 ? (blockTime = clock()) != 0 : false); \
debug("%s time : %.4fs\n", d, \
(double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> PII;
typedef pair<int, int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
int gcd(int A, int B) {
if (!B)
return A;
return gcd(B, A % B);
}
int a[200005];
vector<int> b(200005, 0);
int cnt = 0;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int balls = 0;
for (int j = i; j <= n; j += i)
balls += b[j];
if (balls % 2 != a[i] % 2) {
b[i] = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= n; i++)
if (b[i])
cout << i << " ";
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,887 | 776,888 | u300665398 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, box = 0, zero = 0;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zero++;
}
vector<int> c;
for (int i = n - 1; i > n / 2 - 1; i--) {
if (a[i] == 1) {
b[i] = 1;
box++;
c.push_back(i + 1);
} else
b[i] = 0;
}
for (int i = n / 2 - 1; i >= 0; i--) {
int m = n / (i + 1), count = 0;
for (int j = 2; j <= m; j++) {
count += b[(i + 1) * j];
}
if (count % 2 == 0) {
if (a[i] == 1) {
b[i] = 1;
box++;
c.push_back(i + 1);
} else
b[i] = 0;
} else {
if (a[i] == 1)
b[i] = 0;
else {
b[i] = 1;
box++;
c.push_back(i + 1);
}
}
}
sort(c.begin(), c.end());
if (zero == n)
cout << "0";
else if (box == 0)
cout << "-1";
else {
cout << box << endl;
cout << c[0];
for (int i = 1; i < c.size(); i++) {
cout << " " << c[i];
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, box = 0, zero = 0;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zero++;
}
vector<int> c;
for (int i = n - 1; i > n / 2 - 1; i--) {
if (a[i] == 1) {
b[i] = 1;
box++;
c.push_back(i + 1);
} else
b[i] = 0;
}
for (int i = n / 2 - 1; i >= 0; i--) {
int m = n / (i + 1), count = 0;
for (int j = 2; j <= m; j++) {
count += b[(i + 1) * j - 1];
}
if (count % 2 == 0) {
if (a[i] == 1) {
b[i] = 1;
box++;
c.push_back(i + 1);
} else
b[i] = 0;
} else {
if (a[i] == 1)
b[i] = 0;
else {
b[i] = 1;
box++;
c.push_back(i + 1);
}
}
}
sort(c.begin(), c.end());
if (zero == n)
cout << "0";
else if (box == 0)
cout << "-1";
else {
cout << box << endl;
cout << c[0];
for (int i = 1; i < c.size(); i++) {
cout << " " << c[i];
}
}
return 0;
} | [
"assignment.change"
] | 776,893 | 776,894 | u613326499 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, box = 0, zero = 0;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zero++;
}
vector<int> c;
for (int i = n - 1; i > n / 2 + 1; i--) {
if (a[i] == 1) {
b[i] = 1;
box++;
c.push_back(i + 1);
} else
b[i] = 0;
}
for (int i = n / 2 + 1; i >= 0; i--) {
int m = n / (i + 1), count = 0;
for (int j = 2; j <= m; j++) {
count += b[(i + 1) * j];
}
if (count % 2 == 0) {
if (a[i] == 1) {
b[i] = 1;
box++;
c.push_back(i + 1);
} else
b[i] = 0;
} else {
if (a[i] == 1)
b[i] = 0;
else {
b[i] = 1;
box++;
c.push_back(i + 1);
}
}
}
sort(c.begin(), c.end());
if (zero == n)
cout << "0";
else if (box == 0)
cout << "-1";
else {
cout << box << endl;
cout << c[0];
for (int i = 1; i < c.size(); i++) {
cout << " " << c[i];
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, box = 0, zero = 0;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zero++;
}
vector<int> c;
for (int i = n - 1; i > n / 2 - 1; i--) {
if (a[i] == 1) {
b[i] = 1;
box++;
c.push_back(i + 1);
} else
b[i] = 0;
}
for (int i = n / 2 - 1; i >= 0; i--) {
int m = n / (i + 1), count = 0;
for (int j = 2; j <= m; j++) {
count += b[(i + 1) * j - 1];
}
if (count % 2 == 0) {
if (a[i] == 1) {
b[i] = 1;
box++;
c.push_back(i + 1);
} else
b[i] = 0;
} else {
if (a[i] == 1)
b[i] = 0;
else {
b[i] = 1;
box++;
c.push_back(i + 1);
}
}
}
sort(c.begin(), c.end());
if (zero == n)
cout << "0";
else if (box == 0)
cout << "-1";
else {
cout << box << endl;
cout << c[0];
for (int i = 1; i < c.size(); i++) {
cout << " " << c[i];
}
}
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 776,895 | 776,894 | u613326499 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), cur(n + 1), ans;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int have = 0;
for (int j = 2; j * i <= n; j++) {
have ^= cur[j * i];
}
if ((have * i) % 2 != a[i]) {
cur[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << "\n";
for (int i : ans) {
cout << i << " ";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), cur(n + 1), ans;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int have = 0;
for (int j = 2; j * i <= n; j++) {
have ^= cur[j * i];
}
if (have != a[i]) {
cur[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << "\n";
for (int i : ans) {
cout << i << " ";
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 776,896 | 776,897 | u627941097 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
rep(i, n) cin >> a[i];
int m = 0;
for (int i = n - 1; i >= 0; i--) {
b[i] = a[i];
for (int j = 2; j * (i + 1) <= n - 1; j++) {
b[i] += b[j * (i + 1)];
b[i] %= 2;
}
if (b[i] == 1)
m++;
}
cout << m << endl;
rep(i, n) if (b[i] == 1) cout << i + 1 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
rep(i, n) cin >> a[i];
int m = 0;
for (int i = n - 1; i >= 0; i--) {
b[i] = a[i];
for (int j = 2; j * (i + 1) - 1 <= n - 1; j++) {
b[i] += b[j * (i + 1) - 1];
b[i] %= 2;
}
if (b[i] == 1)
m++;
}
cout << m << endl;
rep(i, n) if (b[i] == 1) cout << i + 1 << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 776,898 | 776,899 | u178814165 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
ll n;
cin >> n;
vll a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vll ans(n + 1, 0);
for (int i = n; i >= 1; i--) {
ll cnt = 0;
for (int k = 2; i * k <= n; k++) {
cnt += ans[k * i];
}
if (cnt % 2 != a[i]) {
ans[i] = 1;
}
}
cout << accumulate(all(ans), 0) << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] == 1) {
cout << 1 << " ";
}
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
ll n;
cin >> n;
vll a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vll ans(n + 1, 0);
for (int i = n; i >= 1; i--) {
ll cnt = 0;
for (int k = 2; i * k <= n; k++) {
cnt += ans[k * i];
}
if (cnt % 2 != a[i]) {
ans[i] = 1;
}
}
cout << accumulate(all(ans), 0) << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] == 1) {
cout << i << " ";
}
}
cout << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 776,903 | 776,904 | u552122040 | 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; 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()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
ll n;
cin >> n;
vll vec(n);
REP(i, n) cin >> vec.at(i);
vll ans(n);
for (int i = n - 1; i >= 0; i--) {
ll total = 0;
for (int j = i + 1; j <= n; j += i + 1) {
total += ans.at(j);
}
if (vec.at(i) != total % 2)
ans.at(i) = 1;
}
cout << count(ALL(ans), 1) << endl;
if (count(ALL(ans), 1) == 0) {
return 0;
}
vll out;
REP(i, n) {
if (ans.at(i) == 1)
out.push_back(i + 1);
}
REP(i, out.size() - 1) { cout << out.at(i) << " "; }
cout << out.at(out.size() - 1) << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
ll n;
cin >> n;
vll vec(n);
REP(i, n) cin >> vec.at(i);
vll ans(n);
for (int i = n - 1; i >= 0; i--) {
ll total = 0;
for (int j = i + 1; j <= n; j += i + 1) {
total += ans.at(j - 1);
}
if (vec.at(i) != total % 2)
ans.at(i) = 1;
}
cout << count(ALL(ans), 1) << endl;
if (count(ALL(ans), 1) == 0) {
return 0;
}
vll out;
REP(i, n) {
if (ans.at(i) == 1)
out.push_back(i + 1);
}
REP(i, out.size() - 1) { cout << out.at(i) << " "; }
cout << out.at(out.size() - 1) << endl;
return 0;
} | [
"assignment.change"
] | 776,905 | 776,906 | u552122040 | 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; 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()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
ll n;
cin >> n;
vll vec(n);
REP(i, n) cin >> vec.at(i);
vll ans(n);
for (int i = n - 1; i >= 0; i--) {
ll total = 0;
for (int j = i + 1; j < n; j += i + 1) {
total += ans.at(j);
}
if (vec.at(i) != total % 2)
ans.at(i) = 1;
}
cout << count(ALL(ans), 1) << endl;
if (count(ALL(ans), 1) == 0) {
return 0;
}
vll out;
REP(i, n) {
if (ans.at(i) == 1)
out.push_back(i + 1);
}
REP(i, out.size() - 1) { cout << out.at(i) << " "; }
cout << out.at(out.size() - 1) << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
ll n;
cin >> n;
vll vec(n);
REP(i, n) cin >> vec.at(i);
vll ans(n);
for (int i = n - 1; i >= 0; i--) {
ll total = 0;
for (int j = i + 1; j <= n; j += i + 1) {
total += ans.at(j - 1);
}
if (vec.at(i) != total % 2)
ans.at(i) = 1;
}
cout << count(ALL(ans), 1) << endl;
if (count(ALL(ans), 1) == 0) {
return 0;
}
vll out;
REP(i, n) {
if (ans.at(i) == 1)
out.push_back(i + 1);
}
REP(i, out.size() - 1) { cout << out.at(i) << " "; }
cout << out.at(out.size() - 1) << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 776,907 | 776,906 | u552122040 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> b(N + 1, -1);
int ret = 0;
for (int i = N; i >= 1; i--) {
int cur = 0;
for (int j = 2 * i; j <= N; j += i)
cur = (cur + a[j]) % 2;
if (cur != a[i])
b[i] = 1, ret++;
else
b[i] = 0;
}
cout << ret << "\n";
for (int i = 1; i <= N; i++)
if (b[i])
cout << i << " ";
cout << "\n";
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> b(N + 1, -1);
int ret = 0;
for (int i = N; i >= 1; i--) {
int cur = 0;
for (int j = 2 * i; j <= N; j += i)
cur = (cur + b[j]) % 2;
if (cur != a[i])
b[i] = 1, ret++;
else
b[i] = 0;
}
cout << ret << "\n";
for (int i = 1; i <= N; i++)
if (b[i])
cout << i << " ";
cout << "\n";
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 776,911 | 776,912 | u586598623 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> b(N + 1, -1);
int ret = 0;
for (int i = N; i >= 1; i--) {
int cur = 0;
for (int j = 2 * i; j <= N; j++)
cur = (cur + a[j]) % 2;
if (cur != a[i])
b[i] = 1, ret++;
else
b[i] = 0;
}
cout << ret << "\n";
for (int i = 1; i <= N; i++)
if (b[i])
cout << i << " ";
cout << "\n";
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> b(N + 1, -1);
int ret = 0;
for (int i = N; i >= 1; i--) {
int cur = 0;
for (int j = 2 * i; j <= N; j += i)
cur = (cur + b[j]) % 2;
if (cur != a[i])
b[i] = 1, ret++;
else
b[i] = 0;
}
cout << ret << "\n";
for (int i = 1; i <= N; i++)
if (b[i])
cout << i << " ";
cout << "\n";
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 776,913 | 776,912 | u586598623 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> ans(n + 1, 0);
for (int i = n; i > 0; --i) {
int ctr = 0;
for (int j = i; j <= n; j += i) {
ctr += ans[j];
}
ctr %= 2;
ans[i] = a[i] ^ ctr;
}
vector<int> p;
rep(i, n + 1) {
if (ans[i]) {
p.push_back(i);
}
}
cout << p.size() << endl;
rep(i, p.size()) {
if (i)
cout << " ";
cout << p[i];
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> ans(n + 1, 0);
for (int i = n; i > 0; --i) {
int ctr = 0;
for (int j = i; j <= n; j += i) {
ctr += ans[j];
}
ctr %= 2;
ans[i] = a[i - 1] ^ ctr;
}
vector<int> p;
rep(i, n + 1) {
if (ans[i]) {
p.push_back(i);
}
}
cout << p.size() << endl;
rep(i, p.size()) {
if (i)
cout << " ";
cout << p[i];
}
cout << endl;
} | [
"assignment.change"
] | 776,923 | 776,924 | u378702452 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++)
cin >> A.at(i);
vector<int> B(N + 1);
for (int i = N; 0 < i; i--) {
int ans = 0;
for (int j = 2; j * i <= N; j++)
B.at(i * j);
int b = (ans + A.at(i)) % 2;
B.at(i) = b;
}
int M = 0;
for (int i = 1; i <= N; i++)
if (B.at(i) == 1)
M++;
cout << M << endl;
for (int i = 1; i <= N; i++)
if (B.at(i) == 1)
cout << i << " ";
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++)
cin >> A.at(i);
vector<int> B(N + 1);
for (int i = N; 0 < i; i--) {
int ans = 0;
for (int j = 2; j * i <= N; j++)
ans += B.at(i * j);
int b = (ans + A.at(i)) % 2;
B.at(i) = b;
}
int M = 0;
for (int i = 1; i <= N; i++)
if (B.at(i) == 1)
M++;
cout << M << endl;
for (int i = 1; i <= N; i++)
if (B.at(i) == 1)
cout << i << " ";
cout << endl;
return 0;
} | [
"assignment.change"
] | 776,928 | 776,929 | u101018317 | cpp |
p02972 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const int INF = +100100100;
// typedef pair<int,int> P;
const int MAX = 1000000;
int n;
vector<int> a(MAX);
int main() {
int n;
cin >> n;
// ll ans=0;
vector<int> a(n + 1), t(n + 1, -1);
rrep(i, n) {
cin >> a[i];
if (i * 2 > n) {
t[i] = a[i];
}
}
for (int i = n; i > 0; i--) {
// int k = 2;
// if(t[i]!=-1)continue;
int s;
// while(i*k<n){
// s+=t[i*k];
// ++k;
// }
for (int j = i * 2; j <= n; j += i) {
s ^= t[j];
}
t[i] = s ^ a[i];
}
// rrep(i,n){
// ans+=t[i];
// }
// cout << ans << endl;
// rrep(i,n)if(t[i])cout << i <<endl;
// return 0;
vector<int> ans;
rrep(i, n) if (t[i]) ans.push_back(i);
cout << ans.size() << endl;
rep(i, ans.size()) {
printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' ');
}
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const int INF = +100100100;
// typedef pair<int,int> P;
const int MAX = 1000000;
int n;
vector<int> a(MAX);
int main() {
int n;
cin >> n;
// ll ans=0;
vector<int> a(n + 1), t(n + 1, -1);
rrep(i, n) {
cin >> a[i];
if (i * 2 > n) {
t[i] = a[i];
}
}
for (int i = n; i > 0; i--) {
// int k = 2;
// if(t[i]!=-1)continue;
int s = 0;
// while(i*k<n){
// s+=t[i*k];
// ++k;
// }
for (int j = i * 2; j <= n; j += i) {
s ^= t[j];
}
t[i] = s ^ a[i];
}
// rrep(i,n){
// ans+=t[i];
// }
// cout << ans << endl;
// rrep(i,n)if(t[i])cout << i <<endl;
// return 0;
vector<int> ans;
rrep(i, n) if (t[i]) ans.push_back(i);
cout << ans.size() << endl;
rep(i, ans.size()) {
printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' ');
}
return 0;
} | [
"variable_declaration.value.change"
] | 776,933 | 776,934 | u412659798 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < a[i].size(); j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < a[i].size(); j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a) {
int n = a.size();
for (int j = 0; j < n; j++) {
if (j != n - 1)
cout << a[j] << " ";
else
cout << a[j] << endl;
}
}
void print(vector<long long int> a) {
int n = a.size();
for (int j = 0; j < n; j++) {
if (j != n - 1)
cout << a[j] << " ";
else
cout << a[j] << endl;
}
}
void print(set<int> a) {
for (auto x : a)
cout << x << " ";
cout << endl;
}
// nใฎ็ดๆฐใ่ฟใ้ขๆฐ.sortใใใฆใชใ.
vector<long long int> divisors(long long int n) {
vector<long long int> res;
for (long long int i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n) {
res.push_back(n / i);
}
}
}
return res;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, 0);
vector<int> ans;
for (int i = n; i > 0; i--) {
int j = i - 1;
if ((a[j] + b[j]) % 2 == 1) {
vector<ll> res = divisors(i);
for (auto x : res)
b[x]++;
ans.push_back(i);
}
}
sort(all(ans));
if (ans.size()) {
cout << ans.size() << endl;
print(ans);
} else {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < a[i].size(); j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < a[i].size(); j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a) {
int n = a.size();
for (int j = 0; j < n; j++) {
if (j != n - 1)
cout << a[j] << " ";
else
cout << a[j] << endl;
}
}
void print(vector<long long int> a) {
int n = a.size();
for (int j = 0; j < n; j++) {
if (j != n - 1)
cout << a[j] << " ";
else
cout << a[j] << endl;
}
}
void print(set<int> a) {
for (auto x : a)
cout << x << " ";
cout << endl;
}
// nใฎ็ดๆฐใ่ฟใ้ขๆฐ.sortใใใฆใชใ.
vector<long long int> divisors(long long int n) {
vector<long long int> res;
for (long long int i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n) {
res.push_back(n / i);
}
}
}
return res;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n + 1, 0);
vector<int> ans;
for (int i = n; i > 0; i--) {
int j = i - 1;
if ((a[j] + b[i]) % 2 == 1) {
vector<ll> res = divisors(i);
for (auto x : res)
b[x]++;
ans.push_back(i);
}
}
sort(all(ans));
if (ans.size()) {
cout << ans.size() << endl;
print(ans);
} else {
cout << 0 << endl;
}
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 776,935 | 776,936 | u131946248 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 1; i <= N; i++)
cin >> A.at(i);
int cnt = 0;
for (int i = N; i > 0; i--) {
for (int j = i + i; j < N; j += i)
A.at(i) ^= A.at(j);
if (A.at(i))
cnt++;
}
cout << cnt << "\n";
for (int i = 1; i <= N; i++)
if (A.at(i))
cout << i << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 1; i <= N; i++)
cin >> A.at(i);
int cnt = 0;
for (int i = N; i > 0; i--) {
for (int j = i + i; j <= N; j += i)
A.at(i) ^= A.at(j);
if (A.at(i))
cnt++;
}
cout << cnt << "\n";
for (int i = 1; i <= N; i++)
if (A.at(i))
cout << i << "\n";
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,941 | 776,942 | u045289115 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
vector<int> A(N, 0);
// reverse(a.begin(),a.end());
int tmp = 0;
for (int i = 0; i < N; i++) {
int j = N - i - 1;
tmp = 0;
for (int l = 1; l <= N % (j + 1); l++) {
int L = l * (j + 1);
tmp += A.at(L - 1);
}
tmp = tmp % 2;
if (tmp != a.at(j)) {
A.at(j) = 1;
}
}
int ans = accumulate(A.begin(), A.end(), 0);
cout << ans << endl;
for (int i = 0; i < N; i++) {
if (A.at(i) == 1) {
if (ans != 1) {
cout << i + 1 << " ";
} else {
cout << i + 1 << endl;
}
ans -= 1;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
vector<int> A(N, 0);
// reverse(a.begin(),a.end());
int tmp = 0;
for (int i = 0; i < N; i++) {
int j = N - i - 1;
tmp = 0;
for (int l = 1; l <= N / (j + 1); l++) {
int L = l * (j + 1);
tmp += A.at(L - 1);
}
tmp = tmp % 2;
if (tmp != a.at(j)) {
A.at(j) = 1;
}
}
int ans = accumulate(A.begin(), A.end(), 0);
cout << ans << endl;
for (int i = 0; i < N; i++) {
if (A.at(i) == 1) {
if (ans != 1) {
cout << i + 1 << " ";
} else {
cout << i + 1 << endl;
}
ans -= 1;
}
}
} | [
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 776,943 | 776,944 | u508077444 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<ll>>;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep1(i, N) cin >> A.at(i);
int M = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int tmp = 0;
for (int j = 2 * i; i * j <= N; j++) {
tmp += B.at(j);
}
if (tmp % 2 != A.at(i)) {
B.at(i)++;
M++;
}
}
cout << M << endl;
rep1(i, N) if (B.at(i)) cout << i << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<ll>>;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep1(i, N) cin >> A.at(i);
int M = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int tmp = 0;
for (int j = 2; i * j <= N; j++) {
tmp += B.at(j * i);
}
if (tmp % 2 != A.at(i)) {
B.at(i)++;
M++;
}
}
cout << M << endl;
rep1(i, N) if (B.at(i)) cout << i << " ";
cout << endl;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"assignment.change"
] | 776,945 | 776,946 | u779216084 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<ll>>;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep1(i, N) cin >> A.at(i);
int M = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int tmp = 0;
for (int j = 2; i * j <= N; j++) {
tmp += B.at(j);
}
if (tmp % 2 != A.at(i)) {
B.at(i)++;
M++;
}
}
cout << M << endl;
rep1(i, N) if (B.at(i)) cout << i << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<ll>>;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep1(i, N) cin >> A.at(i);
int M = 0;
vector<int> B(N + 1, 0);
for (int i = N; i >= 1; i--) {
int tmp = 0;
for (int j = 2; i * j <= N; j++) {
tmp += B.at(j * i);
}
if (tmp % 2 != A.at(i)) {
B.at(i)++;
M++;
}
}
cout << M << endl;
rep1(i, N) if (B.at(i)) cout << i << " ";
cout << endl;
} | [
"assignment.change"
] | 776,947 | 776,946 | u779216084 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void solve() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
vector<ll> ans(N, 0);
rrep(i, N - 1, 0) {
ll a = A[i];
ll j = i + 1;
ll c = 0;
while (j <= N) {
c += ans[j - 1];
j += j;
}
if (c % 2 == a) {
continue;
} else {
ans[i] = 1;
}
}
ll m = accumulate(ans.begin(), ans.end(), 0LL);
cout << m << '\n';
rep(i, N) {
if (ans[i]) {
cout << i + 1 << '\n';
}
}
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void solve() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
vector<ll> ans(N, 0);
rrep(i, N - 1, 0) {
ll a = A[i];
ll j = i + 1;
ll c = 0;
while (j <= N) {
c += ans[j - 1];
j += i + 1;
}
if (c % 2 == a) {
continue;
} else {
ans[i] = 1;
}
}
ll m = accumulate(ans.begin(), ans.end(), 0LL);
cout << m << '\n';
rep(i, N) {
if (ans[i]) {
cout << i + 1 << '\n';
}
}
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| [
"assignment.value.change",
"assignment.change"
] | 776,950 | 776,951 | u427344224 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ll N;
cin >> N;
vector<ll> v(N + 1LL);
for (ll i = 0LL; i < N; i++) {
cin >> v[i + 1LL];
}
vector<ll> ans(N + 1, 0LL);
for (ll i = N; i >= 1; i--) {
ll t = N / i;
ll s = 0LL;
for (ll j = 2LL; j <= t; j++) {
s += ans[j * i];
}
ans[i] = (s + v[i]) % 2LL;
}
ll cnt = 0LL;
for (ll i = 1LL; i < N; i++) {
cnt += ans[i];
}
cout << cnt << endl;
for (ll i = 1LL; i <= N; i++) {
if (ans[i] == 1LL)
cout << i << " ";
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ll N;
cin >> N;
vector<ll> v(N + 1LL);
for (ll i = 0LL; i < N; i++) {
cin >> v[i + 1LL];
}
vector<ll> ans(N + 1, 0LL);
for (ll i = N; i >= 1; i--) {
ll t = N / i;
ll s = 0LL;
for (ll j = 2LL; j <= t; j++) {
s += ans[j * i];
}
ans[i] = (s + v[i]) % 2LL;
}
ll cnt = 0LL;
for (ll i = 1LL; i <= N; i++) {
cnt += ans[i];
}
cout << cnt << endl;
for (ll i = 1LL; i <= N; i++) {
if (ans[i] == 1LL)
cout << i << " ";
}
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,956 | 776,957 | u787139585 | cpp |
p02972 | /*dismint|jjc*/
#include <bits/stdc++.h>
using namespace std;
#define forl(V, S, E) for (int V = S; V < E; V++)
#define ford(V, S, E) for (int V = S; V >= E; V--)
#define fore(E, X) for (auto &E : X)
#define println(X) cout << X << endl
#define printe(X) \
for (auto &E : X) \
cout << E << " "; \
cout << endl
typedef unordered_map<int, unordered_set<int>> graph;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> nums(n), ans(n + 1);
fore(e, nums) cin >> e;
ford(i, n, 1) {
int cnt = 0;
for (int j = i; j <= n; j += n)
cnt += ans[j];
if ((nums[i - 1] and !(cnt % 2)) or (!nums[i - 1] and cnt % 2))
ans[i]++;
}
vector<int> fins;
forl(i, 1, n + 1) if (ans[i]) fins.push_back(i);
println(fins.size());
printe(fins);
}
| /*dismint|jjc*/
#include <bits/stdc++.h>
using namespace std;
#define forl(V, S, E) for (int V = S; V < E; V++)
#define ford(V, S, E) for (int V = S; V >= E; V--)
#define fore(E, X) for (auto &E : X)
#define println(X) cout << X << endl
#define printe(X) \
for (auto &E : X) \
cout << E << " "; \
cout << endl
typedef unordered_map<int, unordered_set<int>> graph;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> nums(n), ans(n + 1);
fore(e, nums) cin >> e;
ford(i, n, 1) {
int cnt = 0;
for (int j = i; j <= n; j += i)
cnt += ans[j];
if ((nums[i - 1] and !(cnt % 2)) or (!nums[i - 1] and cnt % 2))
ans[i]++;
}
vector<int> fins;
forl(i, 1, n + 1) if (ans[i]) fins.push_back(i);
println(fins.size());
printe(fins);
}
| [
"assignment.value.change",
"identifier.change"
] | 776,960 | 776,961 | u602301110 | cpp |
p02972 | //#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/rope>
#define pb push_back
#define F first
#define S second
#define ins insert
#define mp make_pair
#define fo(i, n1, n, x) for (int i = n1; i <= n; i += x)
#define foo(i, n, n1, x) for (int i = n; i >= n1; i -= x)
#define bit __builtin_popcount
#define md (l + ((r - l) / 2))
#define all(x) x.begin(), x.end()
#define eb emplace_back
#define ub upper_bound
#define lb lower_bound
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define file(s) \
if (fopen(s ".in", "r")) \
freopen(s ".in", "r", stdin), freopen(s ".out", "w", stdout)
using namespace std;
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using ll = long long;
//#define int ll
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
const int N = 2e5 + 11, mod = 1e9 + 7, mod2 = 998244353;
const int MAX = 1e5 + 11;
const int INF1 = 2e9 + 11;
const ll INF2 = 6e18 + 11;
const double INF3 = 1e8 + 11;
const int base = 500;
const int P = 31;
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
const int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
const double EPS = 1e-4;
const double PI = acos(-1.0);
// template<typename T> using ordered_set = tree <T, null_type, less <T>,
// rb_tree_tag, tree_order_statistics_node_update>;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, a[N], b[N];
main() {
file("threesum");
ios;
cin >> n;
fo(i, 1, n, 1) cin >> a[i];
fo(i, 1, n, 1) {
int cnt = 0;
fo(j, i, n, i) cnt += b[j];
if (cnt % 2 == a[i])
continue; /*
fo(j, i, n, i) {
if (!b[j]) {
b[j] = 1;
break;
}
}*/
b[i] ^= 1;
}
vi ans;
fo(i, 1, n, 1) {
int cnt = 0;
fo(j, i, n, i) cnt += b[j];
if (cnt % 2 != a[i])
return !(cout << -1);
if (b[i])
ans.eb(i);
}
cout << ans.size() << '\n';
for (int it : ans)
cout << it << " ";
return 0;
}
/**
*/
| //#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/rope>
#define pb push_back
#define F first
#define S second
#define ins insert
#define mp make_pair
#define fo(i, n1, n, x) for (int i = n1; i <= n; i += x)
#define foo(i, n, n1, x) for (int i = n; i >= n1; i -= x)
#define bit __builtin_popcount
#define md (l + ((r - l) / 2))
#define all(x) x.begin(), x.end()
#define eb emplace_back
#define ub upper_bound
#define lb lower_bound
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define file(s) \
if (fopen(s ".in", "r")) \
freopen(s ".in", "r", stdin), freopen(s ".out", "w", stdout)
using namespace std;
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using ll = long long;
//#define int ll
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
const int N = 2e5 + 11, mod = 1e9 + 7, mod2 = 998244353;
const int MAX = 1e5 + 11;
const int INF1 = 2e9 + 11;
const ll INF2 = 6e18 + 11;
const double INF3 = 1e8 + 11;
const int base = 500;
const int P = 31;
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
const int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
const double EPS = 1e-4;
const double PI = acos(-1.0);
// template<typename T> using ordered_set = tree <T, null_type, less <T>,
// rb_tree_tag, tree_order_statistics_node_update>;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, a[N], b[N];
main() {
file("threesum");
ios;
cin >> n;
fo(i, 1, n, 1) cin >> a[i];
foo(i, n, 1, 1) {
int cnt = 0;
fo(j, i, n, i) cnt += b[j];
if (cnt % 2 == a[i])
continue; /*
fo(j, i, n, i) {
if (!b[j]) {
b[j] = 1;
break;
}
}*/
b[i] ^= 1;
}
vi ans;
fo(i, 1, n, 1) {
int cnt = 0;
fo(j, i, n, i) cnt += b[j];
if (cnt % 2 != a[i])
return !(cout << -1);
if (b[i])
ans.eb(i);
}
cout << ans.size() << '\n';
for (int it : ans)
cout << it << " ";
return 0;
}
/**
*/
| [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 776,964 | 776,965 | u202065611 | cpp |
p02972 | #include <bits/stdc++.h>
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 + 1; i++) {
cin >> a.at(i);
}
for (int i = N; i > 0; i--) {
int n = i;
int count = 0;
while (n < N) {
count += b.at(n);
n += i;
}
if (count % 2 != a.at(i)) {
b.at(i) = 1;
} else {
b.at(i) = 0;
}
}
int m = 0;
for (int i = 0; i < N + 1; i++) {
m += b.at(i);
}
cout << m << endl;
for (int i = 1; i < N + 1; i++) {
if (b.at(i) == 1)
cout << i << " ";
}
cout << endl;
} | #include <bits/stdc++.h>
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 + 1; i++) {
cin >> a.at(i);
}
for (int i = N; i > 0; i--) {
int n = i;
int count = 0;
while (n <= N) {
count += b.at(n);
n += i;
}
if (count % 2 != a.at(i)) {
b.at(i) = 1;
} else {
b.at(i) = 0;
}
}
int m = 0;
for (int i = 0; i < N + 1; i++) {
m += b.at(i);
}
cout << m << endl;
for (int i = 1; i < N + 1; i++) {
if (b.at(i) == 1)
cout << i << " ";
}
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 776,966 | 776,967 | u422692699 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1 << (n))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int const INF = 1001001001;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vi a(N);
rep(i, N) cin >> a[i];
vi x(N + 1);
set<int> st;
for (int i = N; i >= 1; --i) {
int cur = a[i - 1];
for (int j = i * 2; j <= N; j++) {
cur += x[j];
}
x[i] = cur % 2;
if (x[i] == 1)
st.insert(i);
}
cout << SZ(st) << endl;
for (auto x : st)
cout << x << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1 << (n))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int const INF = 1001001001;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vi a(N);
rep(i, N) cin >> a[i];
vi x(N + 1);
set<int> st;
for (int i = N; i >= 1; --i) {
int cur = a[i - 1];
for (int j = i * 2; j <= N; j = j + i) {
cur += x[j];
}
x[i] = cur % 2;
if (x[i] == 1)
st.insert(i);
}
cout << SZ(st) << endl;
for (auto x : st)
cout << x << endl;
return 0;
} | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 776,968 | 776,969 | u115838990 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, double>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> ans(n + 1);
rep(i, n) cin >> a[i + 1];
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += ans[j];
}
ans[i] = (ans[i] + a[i]) % 2;
}
int res = 0;
rep(i, n) {
res += ans[i + 1];
// cout<<i+1<<" "<<a[i+1]<<endl;
}
cout << res << endl;
rep(i, n) {
if (ans[i + 1] == 1) {
cout << i + 1 << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, double>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> ans(n + 1);
rep(i, n) cin >> a[i + 1];
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += ans[j];
}
ans[i] = (sum + a[i]) % 2;
}
int res = 0;
rep(i, n) {
res += ans[i + 1];
// cout<<i+1<<" "<<a[i+1]<<endl;
}
cout << res << endl;
rep(i, n) {
if (ans[i + 1] == 1) {
cout << i + 1 << endl;
}
}
return 0;
} | [
"assignment.value.change",
"expression.operation.binary.change"
] | 776,970 | 776,971 | u395287054 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<bool>> vvb;
typedef vector<vector<double>> vvd;
typedef vector<vector<string>> vvs;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI = acos(-1);
// cout<<fixed<<setprecision(10);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void debug(T v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main() {
gearup;
ll n;
cin >> n;
vl a(n + 1);
rep1(i, n + 1) cin >> a[i];
vl b(n + 1);
for (int i = n; i > 0; i--) { // n็ช็ฎใใๅ
ฅใใๅๆฐใ็ขบๅฎใใใ
ll num = 0;
for (int j = 2 * i; j <= n; j += i) {
if (b[j] & 1)
num++;
}
if (a[i] == 0) {
if (num % 2 == 0)
b[i] = 0;
else
b[i] = 1;
} else {
if (num % 2 == 1)
b[i] = 0;
else
b[i] = 1;
}
}
vl res;
rep1(i, n + 1) if (b[i]) res.push_back(1);
if (res.size() == 0) {
out(0);
return 0;
}
out(res.size());
rep(i, res.size()) {
if (i)
cout << " ";
cout << res[i];
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<bool>> vvb;
typedef vector<vector<double>> vvd;
typedef vector<vector<string>> vvs;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI = acos(-1);
// cout<<fixed<<setprecision(10);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void debug(T v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main() {
gearup;
ll n;
cin >> n;
vl a(n + 1);
rep1(i, n + 1) cin >> a[i];
vl b(n + 1);
for (int i = n; i > 0; i--) { // n็ช็ฎใใๅ
ฅใใๅๆฐใ็ขบๅฎใใใ
ll num = 0;
for (int j = 2 * i; j <= n; j += i) {
if (b[j] & 1)
num++;
}
if (a[i] == 0) {
if (num % 2 == 0)
b[i] = 0;
else
b[i] = 1;
} else {
if (num % 2 == 1)
b[i] = 0;
else
b[i] = 1;
}
}
vl res;
rep1(i, n + 1) if (b[i]) res.push_back(i);
if (res.size() == 0) {
out(0);
return 0;
}
out(res.size());
rep(i, res.size()) {
if (i)
cout << " ";
cout << res[i];
}
cout << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 776,978 | 776,979 | u929582923 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll ngcd(vector<ll> a) {
ll res = a[0];
for (ll i = 1; i < a.size() && res != 1; i++)
res = gcd(a[i], res);
return res;
}
ll nlcm(vector<ll> a) {
ll res = a[0];
for (ll i = 1; i < a.size(); i++)
res = lcm(a[i], res);
return res;
}
bool is_prime(ll n) {
if (n < 2)
return false;
for (ll i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
ll digsum(ll n) {
ll res = 0;
while (n)
res += n % 10, n /= 10;
return res;
}
ll digcnt(ll n) {
ll res = 0;
while (n)
res++, n /= 10;
return res;
}
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
sort(res.begin(), res.end());
return res;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0)
++res[i], n /= i;
}
if (n != 1)
res[n] = 1;
return res;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
vb flg(n);
vll cnt(n);
ll ans = 0;
rrep(i, n) {
auto v = divisor(i + 1);
if (cnt[i] % 2 != a[i]) {
flg[i] = true;
ans++;
for (auto e : v) {
cnt[e]++;
}
}
}
cout << ans << endl;
if (ans) {
rep(i, n) {
if (flg[i])
cout << i + 1 << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll ngcd(vector<ll> a) {
ll res = a[0];
for (ll i = 1; i < a.size() && res != 1; i++)
res = gcd(a[i], res);
return res;
}
ll nlcm(vector<ll> a) {
ll res = a[0];
for (ll i = 1; i < a.size(); i++)
res = lcm(a[i], res);
return res;
}
bool is_prime(ll n) {
if (n < 2)
return false;
for (ll i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
ll digsum(ll n) {
ll res = 0;
while (n)
res += n % 10, n /= 10;
return res;
}
ll digcnt(ll n) {
ll res = 0;
while (n)
res++, n /= 10;
return res;
}
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
sort(res.begin(), res.end());
return res;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0)
++res[i], n /= i;
}
if (n != 1)
res[n] = 1;
return res;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
vb flg(n);
vll cnt(n);
ll ans = 0;
rrep(i, n) {
auto v = divisor(i + 1);
if (cnt[i] % 2 != a[i]) {
flg[i] = true;
ans++;
for (auto e : v) {
cnt[e - 1]++;
}
}
}
cout << ans << endl;
if (ans) {
rep(i, n) {
if (flg[i])
cout << i + 1 << endl;
}
}
}
| [
"expression.operation.binary.add"
] | 776,980 | 776,981 | u530107518 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll ngcd(vector<ll> a) {
ll res = a[0];
for (ll i = 1; i < a.size() && res != 1; i++)
res = gcd(a[i], res);
return res;
}
ll nlcm(vector<ll> a) {
ll res = a[0];
for (ll i = 1; i < a.size(); i++)
res = lcm(a[i], res);
return res;
}
bool is_prime(ll n) {
if (n < 2)
return false;
for (ll i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
ll digsum(ll n) {
ll res = 0;
while (n)
res += n % 10, n /= 10;
return res;
}
ll digcnt(ll n) {
ll res = 0;
while (n)
res++, n /= 10;
return res;
}
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
sort(res.begin(), res.end());
return res;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0)
++res[i], n /= i;
}
if (n != 1)
res[n] = 1;
return res;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
vll cnts(n);
vb flgs(n);
rrep(i, n) {
if (cnts[i] % 2 != a[i]) {
flgs[i] = true;
auto v = divisor(a[i] + 1);
for (auto e : v) {
cnts[e - 1]++;
}
}
}
ll cnt = 0;
vll ans;
rep(i, n) {
if (flgs[i]) {
cnt++;
ans.push_back(i + 1);
}
}
cout << cnt << endl;
rep(i, cnt) {
if (i)
cout << " ";
cout << ans[i];
}
if (cnt)
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll ngcd(vector<ll> a) {
ll res = a[0];
for (ll i = 1; i < a.size() && res != 1; i++)
res = gcd(a[i], res);
return res;
}
ll nlcm(vector<ll> a) {
ll res = a[0];
for (ll i = 1; i < a.size(); i++)
res = lcm(a[i], res);
return res;
}
bool is_prime(ll n) {
if (n < 2)
return false;
for (ll i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
ll digsum(ll n) {
ll res = 0;
while (n)
res += n % 10, n /= 10;
return res;
}
ll digcnt(ll n) {
ll res = 0;
while (n)
res++, n /= 10;
return res;
}
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
sort(res.begin(), res.end());
return res;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0)
++res[i], n /= i;
}
if (n != 1)
res[n] = 1;
return res;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
vll cnts(n);
vb flgs(n);
rrep(i, n) {
if (cnts[i] % 2 != a[i]) {
flgs[i] = true;
auto v = divisor(i + 1);
for (auto e : v) {
cnts[e - 1]++;
}
}
}
ll cnt = 0;
vll ans;
rep(i, n) {
if (flgs[i]) {
cnt++;
ans.push_back(i + 1);
}
}
cout << cnt << endl;
rep(i, cnt) {
if (i)
cout << " ";
cout << ans[i];
}
if (cnt)
cout << endl;
} | [
"call.arguments.change"
] | 776,982 | 776,983 | u530107518 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
const int INF = 1e9 + 100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
#define FIN \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
int main() {
FIN;
ll n;
cin >> n;
vector<int> a(n + 1, 0);
rep(i, 1, n + 1) cin >> a[i];
vector<int> ans(n + 1, 0);
ll m = 0;
for (ll i = n; i >= 1; i--) {
ll k = i;
ll flag = 0;
while (k <= n) {
flag += ans[k];
k += k;
}
flag = flag % 2;
if (flag != a[i]) {
ans[i] = 1;
m++;
}
}
cout << m << endl;
rep(i, 1, n + 1) {
if (ans[i] > 0)
cout << i << " ";
}
cout << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
const int INF = 1e9 + 100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
#define FIN \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
int main() {
FIN;
ll n;
cin >> n;
vector<int> a(n + 1, 0);
rep(i, 1, n + 1) cin >> a[i];
vector<int> ans(n + 1, 0);
ll m = 0;
for (ll i = n; i >= 1; i--) {
ll k = i;
ll flag = 0;
while (k <= n) {
flag += ans[k];
k += i;
}
flag = flag % 2;
if (flag != a[i]) {
ans[i] = 1;
m++;
}
}
cout << m << endl;
rep(i, 1, n + 1) {
if (ans[i] > 0)
cout << i << " ";
}
cout << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 776,992 | 776,993 | u756784272 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inv(n, a) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LINF 1e15
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 'a' = 97 'z' = 122 => 'a' = 0 'z' = 25
int main() {
int n;
cin >> n;
vector<int> a(n);
bool allzero = true;
rep(i, n) {
cin >> a[i];
if (a[i] == 1)
allzero = false;
}
if (allzero) {
cout << 0 << endl;
return 0;
}
vector<int> b(n);
int M = 0;
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
int m = 1;
while ((i + 1) * m < n) {
sum += b[(i + 1) * m - 1];
m++;
}
if (sum % 2 != a[i])
b[i] = 1;
M += b[i];
}
cout << M << endl;
rep(i, n) {
if (b[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inv(n, a) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LINF 1e15
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 'a' = 97 'z' = 122 => 'a' = 0 'z' = 25
int main() {
int n;
cin >> n;
vector<int> a(n);
bool allzero = true;
rep(i, n) {
cin >> a[i];
if (a[i] == 1)
allzero = false;
}
if (allzero) {
cout << 0 << endl;
return 0;
}
vector<int> b(n);
int M = 0;
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
int m = 1;
while (((i + 1) * m) - 1 < n) {
sum += b[(i + 1) * m - 1];
m++;
}
if (sum % 2 != a[i])
b[i] = 1;
M += b[i];
}
cout << M << endl;
rep(i, n) {
if (b[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
}
| [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 776,994 | 776,995 | u532086793 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) { cin >> a[i + 1]; }
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int num = 0;
for (int j = 2 * i; j <= n; j += i) {
num += ans[j];
}
if ((num % 2) != a[i])
ans[i] = 1;
}
int sum = 0;
rep(i, n) { sum += ans[i + 1]; }
cout << sum << endl;
rep(i, n) {
if (a[i + 1] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) { cin >> a[i + 1]; }
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int num = 0;
for (int j = 2 * i; j <= n; j += i) {
num += ans[j];
}
if ((num % 2) != a[i])
ans[i] = 1;
}
int sum = 0;
rep(i, n) { sum += ans[i + 1]; }
cout << sum << endl;
rep(i, n) {
if (ans[i + 1] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 776,996 | 776,997 | u488493347 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) { cin >> a[i + 1]; }
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int num = 0;
for (int j = 2 * i; j <= n; j += i) {
num += ans[j];
}
if (num % 2 != a[i])
ans[i] = 1;
}
int sum = 0;
rep(i, n) { sum += ans[i + 1]; }
cout << sum << endl;
rep(i, n) {
if (a[i + 1] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) { cin >> a[i + 1]; }
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int num = 0;
for (int j = 2 * i; j <= n; j += i) {
num += ans[j];
}
if ((num % 2) != a[i])
ans[i] = 1;
}
int sum = 0;
rep(i, n) { sum += ans[i + 1]; }
cout << sum << endl;
rep(i, n) {
if (ans[i + 1] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 776,998 | 776,997 | u488493347 | cpp |
p02972 | #include <bits/stdc++.h>
#define ff first
#define ss second
#define len(x) (int)(x.size())
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define MAXN 200010
int vs[MAXN];
int balls[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &vs[i]);
int w = 0;
for (int i = n; i > 0; --i) {
int x = 0;
for (int j = i + i; j < n; j += i)
x += balls[j];
if (x % 2 != vs[i])
balls[i] = 1, ++w;
}
cout << w << endl;
for (int i = 1; i <= n; ++i) {
if (balls[i])
cout << i << (--w == 0 ? '\n' : ' ');
}
}
| #include <bits/stdc++.h>
#define ff first
#define ss second
#define len(x) (int)(x.size())
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define MAXN 200010
int vs[MAXN];
int balls[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &vs[i]);
int w = 0;
for (int i = n; i > 0; --i) {
int x = 0;
for (int j = i + i; j <= n; j += i)
x += balls[j];
if (x % 2 != vs[i])
balls[i] = 1, ++w;
}
cout << w << endl;
for (int i = 1; i <= n; ++i) {
if (balls[i])
cout << i << (--w == 0 ? '\n' : ' ');
}
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 776,999 | 777,000 | u808092084 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i;
sum = 0;
while (j + i <= n) {
j += i;
sum += vec[j];
}
if (sum % 2 != a[i]) {
vec[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = ans.size(); i >= 0; i--)
cout << ans[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i;
sum = 0;
while (j + i <= n) {
j += i;
sum += vec[j];
}
if (sum % 2 != a[i]) {
vec[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = ans.size() - 1; i >= 0; i--)
cout << ans[i] << endl;
} | [
"control_flow.loop.for.initializer.change"
] | 777,003 | 777,004 | u070779615 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<bool> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i;
sum = 0;
while (j + i <= n) {
j += i;
sum += vec[j];
}
if (sum % 2 != a[i]) {
vec[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = ans.size() - 1; i >= 0; i--)
cout << ans[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i;
sum = 0;
while (j + i <= n) {
j += i;
sum += vec[j];
}
if (sum % 2 != a[i]) {
vec[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = ans.size() - 1; i >= 0; i--)
cout << ans[i] << endl;
} | [
"variable_declaration.type.primitive.change"
] | 777,005 | 777,004 | u070779615 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<bool> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i;
sum = 0;
while (j + i <= n) {
j += i;
sum += vec[j];
}
if (sum % 2 != a[i]) {
vec[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = ans.size(); i > 0; i--)
cout << ans[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i;
sum = 0;
while (j + i <= n) {
j += i;
sum += vec[j];
}
if (sum % 2 != a[i]) {
vec[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = ans.size() - 1; i >= 0; i--)
cout << ans[i] << endl;
} | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,006 | 777,004 | u070779615 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<bool> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i;
sum = 0;
while (j + i <= n) {
j += i;
sum += vec[j];
}
if (sum % 2 != a[i]) {
vec[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i;
sum = 0;
while (j + i <= n) {
j += i;
sum += vec[j];
}
if (sum % 2 != a[i]) {
vec[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << endl;
} | [
"variable_declaration.type.primitive.change"
] | 777,007 | 777,008 | u070779615 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<bool> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i;
sum = 0;
while (j + i <= n) {
j += i;
sum += vec[j];
}
if (sum % 2 != a[i]) {
vec[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i--)
cout << ans[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i;
sum = 0;
while (j + i <= n) {
j += i;
sum += vec[j];
}
if (sum % 2 != a[i]) {
vec[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << endl;
} | [
"variable_declaration.type.primitive.change"
] | 777,009 | 777,008 | u070779615 | cpp |
p02972 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << b[i] << " ";
}
cout << endl;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << i << " ";
}
cout << endl;
return 0;
}
| [] | 777,021 | 777,022 | u075296067 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0), ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i]) {
ans.push_back(1);
b[i] = 1;
// cout << i << endl;
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0), ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i]) {
ans.push_back(i);
b[i] = 1;
// cout << i << endl;
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 777,025 | 777,026 | u831873811 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0), ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i]) {
ans.push_back(1);
b[i] = 1;
// cout << i << endl;
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0), ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i]) {
ans.push_back(i);
b[i] = 1;
// cout << i << endl;
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 777,027 | 777,026 | u831873811 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i > 0; i--) {
int t = 0;
for (int j = i; j <= n; j += i) {
t += b[j];
}
if (a[i] != (t % 2))
b[i + 1] = 1;
}
vector<int> ans;
rep(i, n + 1) if (b[i + 1]) ans.push_back(i);
cout << ans.size() << endl;
rep(i, ans.size()) {
if (i > 0)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i > 0; i--) {
int t = 0;
for (int j = i; j <= n; j += i) {
t += b[j];
}
if (a[i] != (t % 2))
b[i] = 1;
}
vector<int> ans;
rep(i, n) if (b[i + 1]) ans.push_back(i + 1);
cout << ans.size() << endl;
rep(i, ans.size()) {
if (i > 0)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 777,028 | 777,029 | u831873811 | cpp |
p02972 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
vector<int> bitSearch(int bit, int N) {
vector<int> S;
rep(i, N) if (bit & (1 << i)) S.push_back(i);
return S;
}
int main() {
int n;
cin >> n;
VEC(int, a, n);
vector<int> b(n + 1, 0);
for (int i = n; i >= 1; i--) {
int j = 1;
int cnt = 0;
while (i * j <= n) {
cnt += b[i * j];
j++;
}
cnt %= 2;
if (cnt != a[i - 1])
b[i]++;
}
vector<int> c;
int m = 0;
rep(i, n) {
m += b[i];
if (b[i])
c.push_back(i);
}
cout << m << endl;
for (auto d : c)
cout << d << " ";
}
| #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
vector<int> bitSearch(int bit, int N) {
vector<int> S;
rep(i, N) if (bit & (1 << i)) S.push_back(i);
return S;
}
int main() {
int n;
cin >> n;
VEC(int, a, n);
vector<int> b(n + 1, 0);
for (int i = n; i >= 1; i--) {
int j = 1;
int cnt = 0;
while (i * j <= n) {
cnt += b[i * j];
j++;
}
cnt %= 2;
if (cnt != a[i - 1])
b[i]++;
}
vector<int> c;
int m = 0;
rep(i, n + 1) {
m += b[i];
if (b[i])
c.push_back(i);
}
cout << m << endl;
for (auto d : c)
cout << d << " ";
}
| [
"expression.operation.binary.add"
] | 777,039 | 777,040 | u516525290 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define input(v, n) \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 100010;
ll a, b, c, d, e, f, x, y, z, k, m, n, l, h, w, t, p, q, ans = 0;
vl v, kosuu(300000, 0), aa;
string s1, s2;
ll solve() {
for (ll i = n; i > 0; i--) {
if (v[i - 1] != kosuu[i]) {
aa.push_back(i);
for (ll j = 1; j < sqrt(n) + 0.01; j++) {
if (i % j == 0) {
if (j * j == i) {
kosuu[j] = 1 - kosuu[j];
} else {
kosuu[j] = 1 - kosuu[j];
kosuu[i / j] = 1 - kosuu[i / j];
}
}
}
}
}
cout << aa.size() << endl;
rep(i, aa.size()) {
cout << aa[i];
if (i != aa.size() - 1)
cout << " ";
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
input(v, n);
solve();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define input(v, n) \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 100010;
ll a, b, c, d, e, f, x, y, z, k, m, n, l, h, w, t, p, q, ans = 0;
vl v, kosuu(300000, 0), aa;
string s1, s2;
ll solve() {
for (ll i = n; i > 0; i--) {
if (v[i - 1] != kosuu[i]) {
aa.push_back(i);
for (ll j = 1; j < sqrt(i) + 0.01; j++) {
if (i % j == 0) {
if (j * j == i) {
kosuu[j] = 1 - kosuu[j];
} else {
kosuu[j] = 1 - kosuu[j];
kosuu[i / j] = 1 - kosuu[i / j];
}
}
}
}
}
cout << aa.size() << endl;
rep(i, aa.size()) {
cout << aa[i];
if (i != aa.size() - 1)
cout << " ";
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
input(v, n);
solve();
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,041 | 777,042 | u268571052 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int n, a[202020];
int ans[202020];
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int acnt = 0;
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = 2; j * i <= n; j++) {
cnt += ans[j];
}
ans[i] = (cnt % 2) ^ a[i];
if (ans[i])
acnt++;
}
cout << acnt << endl;
for (int i = 1; i <= n; i++) {
if (ans[i])
cout << i << " ";
}
cout << endl;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int n, a[202020];
int ans[202020];
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int acnt = 0;
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = 2; j * i <= n; j++) {
cnt += ans[j * i];
}
ans[i] = (cnt % 2) ^ a[i];
if (ans[i])
acnt++;
}
cout << acnt << endl;
for (int i = 1; i <= n; i++) {
if (ans[i])
cout << i << " ";
}
cout << endl;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
| [
"assignment.change"
] | 777,045 | 777,046 | u414947284 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a); i > int(b); --i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
#define ITR(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
constexpr ll mod = 1000000007;
const double eps = pow(10, -9);
P bisearch(ll l, ll r, function<bool(ll)> f) {
while ((l + 1) < r) {
ll m = (l + r) / 2;
if (f(m))
r = m;
else
l = m;
}
return P(l, r);
}
ll SQRT(ll n) {
return bisearch(0, n, [n](ll x) { return x * x > n; }).first;
}
bool square(ll a) {
ll n = SQRT(a);
return a == n * n;
}
ll mpow(ll x,
ll n) { // x^n(mod) โๆฎ้ใซpow(x,n)ใงใฏๆบขใใฆใใพใใใ๏ผ้ๆmod่จ็ฎ
// 2ๅ็ดฏไนๆณใ ใใๆฉใ
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
ll inv_mod(ll a) { return mpow(a, mod - 2); }
int digitsum(ll N, int a) {
if (N == 0)
return 0;
int ret = 0;
ret += digitsum(N / a, a) + N % a;
return ret;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }; // xใจyใฎๆๅคงๅ
ฌ็ดๆฐ
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } // xใจyใฎๆๅฐๅ
ฌๅๆฐ
void YN(bool flg) { cout << (flg ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << endl; }
vector<ll> splitint(string n, int a) {
int Len = n.length();
if (a < 0 || Len < a)
return {-1, -1};
string left, right;
if (a != 0)
left = n.substr(0, a);
if (a != Len)
right = n.substr(a);
return {stoll(left), stoll(right)};
}
class Ruiseki {
private:
vector<ll> LEFT, RIGHT;
function<ll(ll, ll)> F;
int N;
public:
Ruiseki(ll INI, vector<ll> a, function<ll(ll, ll)> f) {
N = a.size();
F = f;
LEFT.resize(N + 1);
RIGHT.resize(N + 1);
LEFT[0] = RIGHT[0] = INI;
REP(i, N) {
LEFT[i + 1] = F(LEFT[i], a[i]);
RIGHT[i + 1] = F(RIGHT[i], a[N - i - 1]);
}
}
ll out(int l, int r) { //[l,r)ใฎๅคใฎ็ดฏ็ฉ
return F(LEFT[l], RIGHT[N - r]);
}
};
class mint {
private:
ll _num, _mod;
mint set(ll num) {
_num = num;
if (_num >= 0)
_num %= _mod;
else
_num += (1 - (_num + 1) / _mod) * _mod;
return *this;
}
ll imod(ll n) { return mpow(n, _mod - 2); }
public:
mint() {
_num = 0;
_mod = mod;
}
mint(ll num) {
_mod = mod;
_num = num % mod;
}
mint(ll num, ll M) {
_mod = M;
set(num);
}
mint(const mint &cp) {
_num = cp._num;
_mod = cp._mod;
}
mint operator=(ll x) { return set(x); }
mint operator+(ll x) { return mint(_num + (x % _mod), _mod); }
mint operator-(ll x) { return mint(_num - (x % _mod), _mod); }
mint operator*(ll x) { return mint(_num * (x % _mod), _mod); }
mint operator/(ll x) { return mint(_num * imod(x), _mod); }
mint operator+=(ll x) { return set(_num + (x % _mod)); }
mint operator-=(ll x) { return set(_num - (x % _mod)); }
mint operator*=(ll x) { return set(_num * (x % _mod)); }
mint operator/=(ll x) { return set(_num * imod(x)); }
mint operator+(mint x) { return mint(_num + x._num, _mod); }
mint operator-(mint x) { return mint(_num - x._num, _mod); }
mint operator*(mint x) { return mint(_num * x._num, _mod); }
mint operator/(mint x) { return mint(_num * imod(x._num), _mod); }
mint operator+=(mint x) { return set(_num + x._num); }
mint operator-=(mint x) { return set(_num - x._num); }
mint operator*=(mint x) { return set(_num * x._num); }
mint operator/=(mint x) { return set(_num * imod(x._num)); }
friend mint operator+(ll x, mint m) {
return mint(m._num + (x % m._mod), m._mod);
}
friend mint operator-(ll x, mint m) {
return mint(m._num - (x % m._mod), m._mod);
}
friend mint operator*(ll x, mint m) {
return mint(m._num * (x % m._mod), m._mod);
}
friend mint operator/(ll x, mint m) {
return mint(m.imod(m._num) * x, m._mod);
}
explicit operator ll() { return _num; }
explicit operator int() { return _num; }
friend ostream &operator<<(ostream &os, const mint &x) {
os << x._num;
return os;
}
friend istream &operator>>(istream &is, mint &x) {
ll val;
is >> val;
x.set(val);
return is;
}
};
template <typename T> class MAT {
private:
int row, col;
vector<vector<T>> _A;
MAT set(vector<vector<T>> A) {
_A = A;
return *this;
}
public:
MAT() {}
MAT(int n, int m) {
if (n < 1 || m < 0) {
cout << "err Matrix::Matrix" << endl;
exit(1);
}
row = n;
col = m ? m : n; // m=0ใฎใจใๅไฝ่กๅใไฝใ
REP(i, row) {
vector<T> a(col);
_A.push_back(a);
REP(j, col) _A[i][j] = 0;
}
// ๅคใฎๅๆๅ
if (m == 0)
REP(i, n) _A[i][i] = 1.0;
}
MAT(const MAT &cp) {
_A = cp._A;
row = cp.row;
col = cp.col;
}
T *operator[](int i) { return _A[i].data(); }
MAT operator=(vector<vector<T>> x) { return set(x); }
MAT operator+(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator+" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] + x[i][j];
return r;
}
MAT operator-(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator-" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] - x[i][j];
return r;
}
MAT operator*(MAT x) {
if (col != x.row) {
cout << "err Matrix::operator*" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, x.col);
REP(i, row) REP(j, x.col) REP(k, col) r[i][j] += _A[i][k] * x[k][j];
return r;
}
MAT operator/(T a) {
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] / a;
return r;
}
MAT operator^(ll n) {
if (row != col) {
cout << "err Matrix::operator^" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, 0), A = *this;
while (n) {
if (n & 1)
r *= A;
A *= A;
n >>= 1;
}
return r;
}
MAT operator+=(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator+=" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] + x[i][j];
return set(r._A);
}
MAT operator-=(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator-=" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] - x[i][j];
return set(r._A);
}
MAT operator*=(MAT x) {
if (col != x.row) {
cout << "err Matrix::operator*" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, x.col);
REP(i, row) REP(j, x.col) REP(k, col) r[i][j] += _A[i][k] * x[k][j];
return set(r._A);
}
MAT operator/=(T a) {
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] / a;
return r;
}
friend MAT operator*(T n, MAT x) {
MAT r(x.row, x.col);
REP(i, x.row) REP(j, x.col) r[i][j] = n * x[i][j];
return r;
}
friend MAT operator*(MAT x, T n) {
MAT r(x.row, x.col);
REP(i, x.row) REP(j, x.col) r[i][j] = n * x[i][j];
return r;
}
explicit operator vector<vector<T>>() { return _A; }
friend ostream &operator<<(ostream &os, const MAT &x) {
REP(i, x.row) REP(j, x.col) os << x._A[i][j] << " \n"[j == x.col - 1];
return os;
}
int size_row() { return row; }
int size_col() { return col; }
MAT transpose() {
MAT r(col, row);
REP(i, col) REP(j, row) r[i][j] = _A[j][i];
return r;
}
MAT inverse() {
double buf;
MAT<double> inv_a(row, 0);
MAT<double> a = _A;
//ๆใๅบใๆณ
REP(i, row) {
buf = 1 / a[i][i];
REP(j, row) {
a[i][j] *= buf;
inv_a[i][j] *= buf;
}
REP(j, row) {
if (i != j) {
buf = a[j][i];
REP(k, row) {
a[j][k] -= a[i][k] * buf;
inv_a[j][k] -= inv_a[i][k] * buf;
}
}
}
}
return inv_a;
}
// O( n^3 ).
int rank() {
MAT A = _A;
const int n = row, m = col;
int r = 0;
for (int i = 0; r < n && i < m; ++i) {
int pivot = r;
for (int j = r + 1; j < n; ++j)
if (abs(A[j][i]) > abs(A[pivot][i]))
pivot = j;
swap(A[pivot], A[r]);
if (abs(A[r][i]) < eps)
continue;
for (int k = m - 1; k >= i; --k)
A[r][k] /= A[r][i];
rep(j, r + 1, n) rep(k, i, m) A[j][k] -= A[r][k] * A[j][i];
++r;
}
return r;
}
};
class UnionFind { // UnionFindๆจ
private:
vector<int> Parent;
public:
UnionFind(int N) {
Parent.resize(N);
REP(i, N) Parent[i] = -1;
}
int root(int A) {
if (Parent[A] < 0)
return A;
else
return Parent[A] = root(Parent[A]);
}
int size(int A) { return -Parent[root(A)]; }
bool connect(int A, int B) {
A = root(A);
B = root(B);
if (A == B)
return false;
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
class Factorial { //้ไนใจใใฎ้ๅ
ใๆฑใใฆ่จ็ฎใซๅฉ็จใใใฏใฉใน
private:
vector<ll> fac;
vector<ll> ifac;
public:
Factorial(ll N) {
fac.push_back(1);
REP(i, N) fac.push_back(fac[i] * (i + 1) % mod);
ifac.resize(N + 1);
ifac[N] = inv_mod(fac[N]);
REP(i, N) ifac[N - 1 - i] = (ifac[N - i] * (N - i)) % mod;
}
ll fact(ll a) { return fac[a]; }
ll ifact(ll a) { return ifac[a]; }
ll cmb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
ll tmp = ifact(a - b) * ifact(b) % mod;
return tmp * fac[a] % mod;
}
ll per(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
return fac[a] * ifac[a - b] % mod;
}
};
class SOSU {
private:
vector<ll> Prime_Number;
public:
SOSU(int N) {
set<ll> arr;
REP(i, N - 1) arr.insert(i + 2);
while (int n = *arr.begin()) {
if (n > sqrt(N))
break;
Prime_Number.push_back(n);
rep(i, 1, N / n + 1) arr.erase(n * i);
}
ITR(itr, arr) Prime_Number.push_back(*itr);
}
ll operator[](int i) { return Prime_Number[i]; }
int count() { return Prime_Number.size(); }
bool isPrime(int q) { return binary_search(All(Prime_Number), q); }
};
struct Solutions {
ll napsack(int kinds, int MAX_W, const vl weight, const vl cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll unlimited_napsack(int kinds, int MAX_W, const vl weight, const vl cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i + 1][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll Partition_Func(int n, int k) {
vector<vector<ll>> dp(k + 1, vector<ll>(n + 1, 0));
dp[0][0] = 1;
rep(i, 1, k + 1) REP(j, n + 1) {
if (j - i >= 0)
dp[i][j] = (dp[i][j - i] + dp[i - 1][j]);
else
dp[i][j] = dp[i - 1][j];
}
return dp[k][n];
}
int LCS(string s, string t) {
int n = s.length(), m = s.length();
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
REP(i, n) REP(j, m) {
if (s[i] == t[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
return dp[n][m];
}
int LIS(const vector<ll> a) {
int n = a.size();
ll INF = 1 << 28;
vector<ll> dp(n + 1, INF);
REP(i, n) * lower_bound(All(dp), a[i]) = a[i];
int k = lower_bound(All(dp), INF) - dp.begin();
return k;
}
};
struct edge {
int from;
int to;
ll cost;
void push(int a, int b, int c) {
from = a;
to = b;
cost = c;
}
bool operator<(const edge &y) const {
if (cost != y.cost)
return cost < y.cost;
else if (to != y.to)
return to < y.to;
else
return from < y.from;
}
bool operator>(const edge &y) const {
if (cost != y.cost)
return cost > y.cost;
else if (to != y.to)
return to > y.to;
else
return from > y.from;
}
bool operator==(const edge &y) const { return *this == y; }
};
class lca {
public:
const int n = 0;
const int log2_n = 0;
std::vector<std::vector<int>> parent;
std::vector<int> depth;
lca() {}
lca(const Graph &g, int root)
: n(g.size()), log2_n(log2(n) + 1), parent(log2_n, std::vector<int>(n)),
depth(n) {
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < log2_n; k++) {
for (int v = 0; v < (int)g.size(); v++) {
if (parent[k][v] < 0)
parent[k + 1][v] = -1;
else
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
void dfs(const Graph &g, int v, int p, int d) {
parent[0][v] = p;
depth[v] = d;
REP(j, g[v].size()) {
if (g[v][j] != p)
dfs(g, g[v][j], v, d + 1);
}
}
int get(int u, int v) {
if (depth[u] > depth[v])
std::swap(u, v);
for (int k = 0; k < log2_n; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if (u == v)
return u;
for (int k = log2_n - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
};
template <typename T, typename E> // SegmentTree((่ฆ็ด ๆฐ) int n_,(ๆผ็ฎ) F
// f,(ๆดๆฐ) G g,(ๅๆๅค) T d1)
struct SegmentTree {
typedef function<T(T, T)> F;
typedef function<T(T, E)> G;
int n;
F f;
G g;
T d1;
E d0;
vector<T> dat;
SegmentTree(){};
SegmentTree(int n_, F f, G g, T d1, vector<T> v = vector<T>())
: f(f), g(g), d1(d1) {
init(n_);
if (n_ == (int)v.size())
build(n_, v);
}
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.clear();
dat.resize(2 * n - 1, d1);
}
void build(int n_, vector<T> v) {
for (int i = 0; i < n_; i++)
dat[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]);
}
void update(int k, E a) {
k += n - 1;
dat[k] = g(dat[k], a);
while (k > 0) {
k = (k - 1) / 2;
dat[k] = f(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
inline T query(int a, int b) {
T vl = d1, vr = d1;
for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {
if (l & 1)
vl = f(vl, dat[(l++) - 1]);
if (r & 1)
vr = f(dat[(--r) - 1], vr);
}
return f(vl, vr);
}
};
int main() {
int N;
cin >> N;
vector<int> a(N);
REP(i, N) cin >> a[i];
vector<int> b(N, 0);
int M = 0;
RREP(i, N) {
for (int j = 2 * i; j < N; j += i) {
b[i - 1] += b[j];
}
b[i - 1] += a[i - 1];
b[i - 1] %= 2;
if (b[i - 1])
M++;
}
cout << M << endl;
REP(i, N) if (b[i]) cout << i + 1 << " ";
cout << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a); i > int(b); --i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
#define ITR(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
constexpr ll mod = 1000000007;
const double eps = pow(10, -9);
P bisearch(ll l, ll r, function<bool(ll)> f) {
while ((l + 1) < r) {
ll m = (l + r) / 2;
if (f(m))
r = m;
else
l = m;
}
return P(l, r);
}
ll SQRT(ll n) {
return bisearch(0, n, [n](ll x) { return x * x > n; }).first;
}
bool square(ll a) {
ll n = SQRT(a);
return a == n * n;
}
ll mpow(ll x,
ll n) { // x^n(mod) โๆฎ้ใซpow(x,n)ใงใฏๆบขใใฆใใพใใใ๏ผ้ๆmod่จ็ฎ
// 2ๅ็ดฏไนๆณใ ใใๆฉใ
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
ll inv_mod(ll a) { return mpow(a, mod - 2); }
int digitsum(ll N, int a) {
if (N == 0)
return 0;
int ret = 0;
ret += digitsum(N / a, a) + N % a;
return ret;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }; // xใจyใฎๆๅคงๅ
ฌ็ดๆฐ
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } // xใจyใฎๆๅฐๅ
ฌๅๆฐ
void YN(bool flg) { cout << (flg ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << endl; }
vector<ll> splitint(string n, int a) {
int Len = n.length();
if (a < 0 || Len < a)
return {-1, -1};
string left, right;
if (a != 0)
left = n.substr(0, a);
if (a != Len)
right = n.substr(a);
return {stoll(left), stoll(right)};
}
class Ruiseki {
private:
vector<ll> LEFT, RIGHT;
function<ll(ll, ll)> F;
int N;
public:
Ruiseki(ll INI, vector<ll> a, function<ll(ll, ll)> f) {
N = a.size();
F = f;
LEFT.resize(N + 1);
RIGHT.resize(N + 1);
LEFT[0] = RIGHT[0] = INI;
REP(i, N) {
LEFT[i + 1] = F(LEFT[i], a[i]);
RIGHT[i + 1] = F(RIGHT[i], a[N - i - 1]);
}
}
ll out(int l, int r) { //[l,r)ใฎๅคใฎ็ดฏ็ฉ
return F(LEFT[l], RIGHT[N - r]);
}
};
class mint {
private:
ll _num, _mod;
mint set(ll num) {
_num = num;
if (_num >= 0)
_num %= _mod;
else
_num += (1 - (_num + 1) / _mod) * _mod;
return *this;
}
ll imod(ll n) { return mpow(n, _mod - 2); }
public:
mint() {
_num = 0;
_mod = mod;
}
mint(ll num) {
_mod = mod;
_num = num % mod;
}
mint(ll num, ll M) {
_mod = M;
set(num);
}
mint(const mint &cp) {
_num = cp._num;
_mod = cp._mod;
}
mint operator=(ll x) { return set(x); }
mint operator+(ll x) { return mint(_num + (x % _mod), _mod); }
mint operator-(ll x) { return mint(_num - (x % _mod), _mod); }
mint operator*(ll x) { return mint(_num * (x % _mod), _mod); }
mint operator/(ll x) { return mint(_num * imod(x), _mod); }
mint operator+=(ll x) { return set(_num + (x % _mod)); }
mint operator-=(ll x) { return set(_num - (x % _mod)); }
mint operator*=(ll x) { return set(_num * (x % _mod)); }
mint operator/=(ll x) { return set(_num * imod(x)); }
mint operator+(mint x) { return mint(_num + x._num, _mod); }
mint operator-(mint x) { return mint(_num - x._num, _mod); }
mint operator*(mint x) { return mint(_num * x._num, _mod); }
mint operator/(mint x) { return mint(_num * imod(x._num), _mod); }
mint operator+=(mint x) { return set(_num + x._num); }
mint operator-=(mint x) { return set(_num - x._num); }
mint operator*=(mint x) { return set(_num * x._num); }
mint operator/=(mint x) { return set(_num * imod(x._num)); }
friend mint operator+(ll x, mint m) {
return mint(m._num + (x % m._mod), m._mod);
}
friend mint operator-(ll x, mint m) {
return mint(m._num - (x % m._mod), m._mod);
}
friend mint operator*(ll x, mint m) {
return mint(m._num * (x % m._mod), m._mod);
}
friend mint operator/(ll x, mint m) {
return mint(m.imod(m._num) * x, m._mod);
}
explicit operator ll() { return _num; }
explicit operator int() { return _num; }
friend ostream &operator<<(ostream &os, const mint &x) {
os << x._num;
return os;
}
friend istream &operator>>(istream &is, mint &x) {
ll val;
is >> val;
x.set(val);
return is;
}
};
template <typename T> class MAT {
private:
int row, col;
vector<vector<T>> _A;
MAT set(vector<vector<T>> A) {
_A = A;
return *this;
}
public:
MAT() {}
MAT(int n, int m) {
if (n < 1 || m < 0) {
cout << "err Matrix::Matrix" << endl;
exit(1);
}
row = n;
col = m ? m : n; // m=0ใฎใจใๅไฝ่กๅใไฝใ
REP(i, row) {
vector<T> a(col);
_A.push_back(a);
REP(j, col) _A[i][j] = 0;
}
// ๅคใฎๅๆๅ
if (m == 0)
REP(i, n) _A[i][i] = 1.0;
}
MAT(const MAT &cp) {
_A = cp._A;
row = cp.row;
col = cp.col;
}
T *operator[](int i) { return _A[i].data(); }
MAT operator=(vector<vector<T>> x) { return set(x); }
MAT operator+(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator+" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] + x[i][j];
return r;
}
MAT operator-(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator-" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] - x[i][j];
return r;
}
MAT operator*(MAT x) {
if (col != x.row) {
cout << "err Matrix::operator*" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, x.col);
REP(i, row) REP(j, x.col) REP(k, col) r[i][j] += _A[i][k] * x[k][j];
return r;
}
MAT operator/(T a) {
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] / a;
return r;
}
MAT operator^(ll n) {
if (row != col) {
cout << "err Matrix::operator^" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, 0), A = *this;
while (n) {
if (n & 1)
r *= A;
A *= A;
n >>= 1;
}
return r;
}
MAT operator+=(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator+=" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] + x[i][j];
return set(r._A);
}
MAT operator-=(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator-=" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] - x[i][j];
return set(r._A);
}
MAT operator*=(MAT x) {
if (col != x.row) {
cout << "err Matrix::operator*" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, x.col);
REP(i, row) REP(j, x.col) REP(k, col) r[i][j] += _A[i][k] * x[k][j];
return set(r._A);
}
MAT operator/=(T a) {
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] / a;
return r;
}
friend MAT operator*(T n, MAT x) {
MAT r(x.row, x.col);
REP(i, x.row) REP(j, x.col) r[i][j] = n * x[i][j];
return r;
}
friend MAT operator*(MAT x, T n) {
MAT r(x.row, x.col);
REP(i, x.row) REP(j, x.col) r[i][j] = n * x[i][j];
return r;
}
explicit operator vector<vector<T>>() { return _A; }
friend ostream &operator<<(ostream &os, const MAT &x) {
REP(i, x.row) REP(j, x.col) os << x._A[i][j] << " \n"[j == x.col - 1];
return os;
}
int size_row() { return row; }
int size_col() { return col; }
MAT transpose() {
MAT r(col, row);
REP(i, col) REP(j, row) r[i][j] = _A[j][i];
return r;
}
MAT inverse() {
double buf;
MAT<double> inv_a(row, 0);
MAT<double> a = _A;
//ๆใๅบใๆณ
REP(i, row) {
buf = 1 / a[i][i];
REP(j, row) {
a[i][j] *= buf;
inv_a[i][j] *= buf;
}
REP(j, row) {
if (i != j) {
buf = a[j][i];
REP(k, row) {
a[j][k] -= a[i][k] * buf;
inv_a[j][k] -= inv_a[i][k] * buf;
}
}
}
}
return inv_a;
}
// O( n^3 ).
int rank() {
MAT A = _A;
const int n = row, m = col;
int r = 0;
for (int i = 0; r < n && i < m; ++i) {
int pivot = r;
for (int j = r + 1; j < n; ++j)
if (abs(A[j][i]) > abs(A[pivot][i]))
pivot = j;
swap(A[pivot], A[r]);
if (abs(A[r][i]) < eps)
continue;
for (int k = m - 1; k >= i; --k)
A[r][k] /= A[r][i];
rep(j, r + 1, n) rep(k, i, m) A[j][k] -= A[r][k] * A[j][i];
++r;
}
return r;
}
};
class UnionFind { // UnionFindๆจ
private:
vector<int> Parent;
public:
UnionFind(int N) {
Parent.resize(N);
REP(i, N) Parent[i] = -1;
}
int root(int A) {
if (Parent[A] < 0)
return A;
else
return Parent[A] = root(Parent[A]);
}
int size(int A) { return -Parent[root(A)]; }
bool connect(int A, int B) {
A = root(A);
B = root(B);
if (A == B)
return false;
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
class Factorial { //้ไนใจใใฎ้ๅ
ใๆฑใใฆ่จ็ฎใซๅฉ็จใใใฏใฉใน
private:
vector<ll> fac;
vector<ll> ifac;
public:
Factorial(ll N) {
fac.push_back(1);
REP(i, N) fac.push_back(fac[i] * (i + 1) % mod);
ifac.resize(N + 1);
ifac[N] = inv_mod(fac[N]);
REP(i, N) ifac[N - 1 - i] = (ifac[N - i] * (N - i)) % mod;
}
ll fact(ll a) { return fac[a]; }
ll ifact(ll a) { return ifac[a]; }
ll cmb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
ll tmp = ifact(a - b) * ifact(b) % mod;
return tmp * fac[a] % mod;
}
ll per(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
return fac[a] * ifac[a - b] % mod;
}
};
class SOSU {
private:
vector<ll> Prime_Number;
public:
SOSU(int N) {
set<ll> arr;
REP(i, N - 1) arr.insert(i + 2);
while (int n = *arr.begin()) {
if (n > sqrt(N))
break;
Prime_Number.push_back(n);
rep(i, 1, N / n + 1) arr.erase(n * i);
}
ITR(itr, arr) Prime_Number.push_back(*itr);
}
ll operator[](int i) { return Prime_Number[i]; }
int count() { return Prime_Number.size(); }
bool isPrime(int q) { return binary_search(All(Prime_Number), q); }
};
struct Solutions {
ll napsack(int kinds, int MAX_W, const vl weight, const vl cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll unlimited_napsack(int kinds, int MAX_W, const vl weight, const vl cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i + 1][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll Partition_Func(int n, int k) {
vector<vector<ll>> dp(k + 1, vector<ll>(n + 1, 0));
dp[0][0] = 1;
rep(i, 1, k + 1) REP(j, n + 1) {
if (j - i >= 0)
dp[i][j] = (dp[i][j - i] + dp[i - 1][j]);
else
dp[i][j] = dp[i - 1][j];
}
return dp[k][n];
}
int LCS(string s, string t) {
int n = s.length(), m = s.length();
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
REP(i, n) REP(j, m) {
if (s[i] == t[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
return dp[n][m];
}
int LIS(const vector<ll> a) {
int n = a.size();
ll INF = 1 << 28;
vector<ll> dp(n + 1, INF);
REP(i, n) * lower_bound(All(dp), a[i]) = a[i];
int k = lower_bound(All(dp), INF) - dp.begin();
return k;
}
};
struct edge {
int from;
int to;
ll cost;
void push(int a, int b, int c) {
from = a;
to = b;
cost = c;
}
bool operator<(const edge &y) const {
if (cost != y.cost)
return cost < y.cost;
else if (to != y.to)
return to < y.to;
else
return from < y.from;
}
bool operator>(const edge &y) const {
if (cost != y.cost)
return cost > y.cost;
else if (to != y.to)
return to > y.to;
else
return from > y.from;
}
bool operator==(const edge &y) const { return *this == y; }
};
class lca {
public:
const int n = 0;
const int log2_n = 0;
std::vector<std::vector<int>> parent;
std::vector<int> depth;
lca() {}
lca(const Graph &g, int root)
: n(g.size()), log2_n(log2(n) + 1), parent(log2_n, std::vector<int>(n)),
depth(n) {
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < log2_n; k++) {
for (int v = 0; v < (int)g.size(); v++) {
if (parent[k][v] < 0)
parent[k + 1][v] = -1;
else
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
void dfs(const Graph &g, int v, int p, int d) {
parent[0][v] = p;
depth[v] = d;
REP(j, g[v].size()) {
if (g[v][j] != p)
dfs(g, g[v][j], v, d + 1);
}
}
int get(int u, int v) {
if (depth[u] > depth[v])
std::swap(u, v);
for (int k = 0; k < log2_n; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if (u == v)
return u;
for (int k = log2_n - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
};
template <typename T, typename E> // SegmentTree((่ฆ็ด ๆฐ) int n_,(ๆผ็ฎ) F
// f,(ๆดๆฐ) G g,(ๅๆๅค) T d1)
struct SegmentTree {
typedef function<T(T, T)> F;
typedef function<T(T, E)> G;
int n;
F f;
G g;
T d1;
E d0;
vector<T> dat;
SegmentTree(){};
SegmentTree(int n_, F f, G g, T d1, vector<T> v = vector<T>())
: f(f), g(g), d1(d1) {
init(n_);
if (n_ == (int)v.size())
build(n_, v);
}
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.clear();
dat.resize(2 * n - 1, d1);
}
void build(int n_, vector<T> v) {
for (int i = 0; i < n_; i++)
dat[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]);
}
void update(int k, E a) {
k += n - 1;
dat[k] = g(dat[k], a);
while (k > 0) {
k = (k - 1) / 2;
dat[k] = f(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
inline T query(int a, int b) {
T vl = d1, vr = d1;
for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {
if (l & 1)
vl = f(vl, dat[(l++) - 1]);
if (r & 1)
vr = f(dat[(--r) - 1], vr);
}
return f(vl, vr);
}
};
int main() {
int N;
cin >> N;
vector<int> a(N);
REP(i, N) cin >> a[i];
vector<int> b(N, 0);
int M = 0;
RREP(i, N) {
for (int j = 2 * i; j <= N; j += i) {
b[i - 1] += b[j - 1];
}
b[i - 1] += a[i - 1];
b[i - 1] %= 2;
if (b[i - 1])
M++;
}
cout << M << endl;
REP(i, N) if (b[i]) cout << i + 1 << " ";
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 777,047 | 777,048 | u203033720 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int n, a[202020], balls[202020];
int main() {
cin >> n;
rep(i, n) cin >> a[i + 1];
vector<int> res(0);
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i; j <= n; j += j) {
cnt += balls[j];
}
if (cnt % 2 == a[i]) {
balls[i] = 0;
} else {
balls[i] = 1;
res.push_back(i);
}
}
// for(int i = 1; i <= n; i++) cout << balls[i] << endl;
cout << res.size() << endl;
for (int x : res) {
cout << x << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int n, a[202020], balls[202020];
int main() {
cin >> n;
rep(i, n) cin >> a[i + 1];
vector<int> res(0);
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
cnt += balls[j];
}
if (cnt % 2 == a[i]) {
balls[i] = 0;
} else {
balls[i] = 1;
res.push_back(i);
}
}
// for(int i = 1; i <= n; i++) cout << balls[i] << " ";cout << endl;
cout << res.size() << endl;
for (int x : res) {
cout << x << endl;
}
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 777,049 | 777,050 | u389007679 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = (i + 1) * 2; j < N; j += (i + 1)) {
sum += B.at(j - 1);
}
if ((B.at(i) + sum) % 2 != A.at(i)) {
B.at(i)++;
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans.at(i) << " ";
cout << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = (i + 1) * 2; j <= N; j += (i + 1)) {
sum += B.at(j - 1);
}
if ((B.at(i) + sum) % 2 != A.at(i)) {
B.at(i)++;
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans.at(i) << " ";
cout << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,051 | 777,052 | u385617244 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = (i + 1) * 2; j < N; j += (i + 1)) {
sum += A.at(j - 1);
}
if ((A.at(i) + sum) % 2 != B.at(i)) {
B.at(i)++;
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans.at(i) << " ";
cout << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = (i + 1) * 2; j <= N; j += (i + 1)) {
sum += B.at(j - 1);
}
if ((B.at(i) + sum) % 2 != A.at(i)) {
B.at(i)++;
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans.at(i) << " ";
cout << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,053 | 777,052 | u385617244 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = (i + 1) * 2; j < N; j += (i + 1)) {
sum += B.at(j - 1);
}
if ((A.at(i) + sum) % 2 != B.at(i)) {
B.at(i)++;
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans.at(i) << " ";
cout << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = (i + 1) * 2; j <= N; j += (i + 1)) {
sum += B.at(j - 1);
}
if ((B.at(i) + sum) % 2 != A.at(i)) {
B.at(i)++;
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans.at(i) << " ";
cout << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,054 | 777,052 | u385617244 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = (i + 1) * 2; j < N; j += (i + 1)) {
sum += B.at(j - 1);
}
if ((B.at(i) + sum) % 2 == A.at(i)) {
B.at(i)++;
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans.at(i) << " ";
cout << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = (i + 1) * 2; j <= N; j += (i + 1)) {
sum += B.at(j - 1);
}
if ((B.at(i) + sum) % 2 != A.at(i)) {
B.at(i)++;
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans.at(i) << " ";
cout << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 777,055 | 777,052 | u385617244 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = (i + 1) * 2; j < N; j += (i + 1)) {
sum += B.at(j - 1);
}
if (A.at(i) != sum % 2) {
B.at(i)++;
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans.at(i) << " ";
cout << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> B(N);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int sum = 0;
for (int j = (i + 1) * 2; j <= N; j += (i + 1)) {
sum += B.at(j - 1);
}
if (A.at(i) != sum % 2) {
B.at(i)++;
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans.at(i) << " ";
cout << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,056 | 777,057 | u521652313 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
std::vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
std::vector<int> ans(n + 1, 0);
for (int i = n; i > 0; i--) {
int cnt = 0, j = i + i;
while (j <= n) {
cnt += a[j];
j += i;
}
if (cnt % 2 != a[i]) {
ans[i] = 1;
ans[0]++;
}
}
printf("%d\n", ans[0]);
for (int i = 1; i <= n; i++) {
if (ans[i])
printf("%d ", i);
}
return 0;
}
| #include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
std::vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
std::vector<int> ans(n + 1, 0);
for (int i = n; i > 0; i--) {
int cnt = 0, j = i + i;
while (j <= n) {
cnt += ans[j];
j += i;
}
if (cnt % 2 != a[i]) {
ans[i] = 1;
ans[0]++;
}
}
printf("%d\n", ans[0]);
for (int i = 1; i <= n; i++) {
if (ans[i])
printf("%d\n", i);
}
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 777,062 | 777,063 | u242031676 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
std::vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
std::vector<int> ans(n + 1, 0);
for (int i = n; i > 0; i--) {
int cnt = 0, j = i + i;
while (j <= n) {
cnt += a[j];
j += i;
}
if (cnt % 2 != a[i]) {
ans[i] = 1;
ans[0]++;
}
}
printf("%d\n", ans[0]);
for (int i = 1; i <= n; i++) {
if (ans[i])
printf("%d\n", i);
}
return 0;
} | #include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
std::vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
std::vector<int> ans(n + 1, 0);
for (int i = n; i > 0; i--) {
int cnt = 0, j = i + i;
while (j <= n) {
cnt += ans[j];
j += i;
}
if (cnt % 2 != a[i]) {
ans[i] = 1;
ans[0]++;
}
}
printf("%d\n", ans[0]);
for (int i = 1; i <= n; i++) {
if (ans[i])
printf("%d\n", i);
}
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 777,064 | 777,063 | u242031676 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, last, sum;
bool a[200001], b[200001] = {0};
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = N; i >= 1; i--) {
last = N / i;
sum = 0;
for (int j = last; j >= 2; j--)
sum += a[j * i];
b[i] = sum % 2 != a[i];
}
sum = 0;
for (int i = 1; i <= N; i++)
sum += b[i];
cout << sum << endl;
for (int i = 1; i <= N; i++)
if (b[i])
cout << i << " ";
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, last, sum;
bool a[200001], b[200001] = {0};
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = N; i >= 1; i--) {
last = N / i;
sum = 0;
for (int j = last; j >= 2; j--)
sum += b[j * i];
b[i] = sum % 2 != a[i];
}
sum = 0;
for (int i = 1; i <= N; i++)
sum += b[i];
cout << sum << endl;
for (int i = 1; i <= N; i++)
if (b[i])
cout << i << " ";
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 777,065 | 777,066 | u168293447 | cpp |
p02972 | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1e9 + 7;
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> ans(N + 1, 0);
for (int i = N; i >= 1; --i) {
int cnt = 0;
for (int j = i + i; j <= N; j += i) {
cnt += ans[j];
}
if (cnt % 2 == a[i])
continue;
else {
while (cnt % 2 != a[i]) {
cnt++;
ans[i]++;
}
}
}
int sum = 0;
for (int i = 1; i <= N; ++i) {
if (ans[i] != 0)
sum += ans[i];
}
cout << sum << endl;
for (int i = 1; i <= N; ++i) {
if (ans[i] != 0)
cout << ans[i] << " ";
}
} | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1e9 + 7;
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> ans(N + 1, 0);
for (int i = N; i >= 1; --i) {
int cnt = 0;
for (int j = i + i; j <= N; j += i) {
cnt += ans[j];
}
if (cnt % 2 == a[i])
continue;
else {
while (cnt % 2 != a[i]) {
cnt++;
ans[i]++;
}
}
}
int sum = 0;
for (int i = 1; i <= N; ++i) {
if (ans[i] != 0)
sum += ans[i];
}
cout << sum << endl;
for (int i = 1; i <= N; ++i) {
if (ans[i] != 0)
cout << i << " ";
}
} | [] | 777,067 | 777,068 | u635358463 | cpp |
p02972 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const long long LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> b(n, 0);
for (int i = n - 1; i >= 0; i--) {
// sum := iใฎๅๆฐใฎใใผใซใฎๆฐใฎๅ
int sum = 0;
for (int j = i; j < n; j += (i + 1)) {
sum += b[j];
}
b[i] = (sum + a[i]) % 2;
}
int m = count(b.begin(), b.end(), 1);
cout << m << endl;
if (m != 0) {
rep(i, n) {
if (b[i])
cout << b[i] << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const long long LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> b(n, 0);
for (int i = n - 1; i >= 0; i--) {
// sum := iใฎๅๆฐใฎใใผใซใฎๆฐใฎๅ
int sum = 0;
for (int j = i; j < n; j += (i + 1)) {
sum += b[j];
}
b[i] = (sum + a[i]) % 2;
}
int m = count(b.begin(), b.end(), 1);
cout << m << endl;
if (m != 0) {
rep(i, n) {
if (b[i])
cout << i + 1 << endl;
}
}
return 0;
} | [
"io.output.change"
] | 777,075 | 777,076 | u813098295 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
int main() {
ll n;
cin >> n;
vector<int> a(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (ll i = n; i >= 1; i--) {
ll tmp = i;
int sum = 0;
while (tmp <= n) {
tmp += i;
sum += ans[tmp];
}
if (sum % 2 != a[i]) {
ans[i] = 1;
}
}
int size = 0;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
size++;
}
}
cout << size << endl;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
cout << i << ' ';
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
int main() {
ll n;
cin >> n;
vector<int> a(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (ll i = n; i >= 1; i--) {
ll tmp = i;
int sum = 0;
while (tmp + i <= n) {
tmp += i;
sum += ans[tmp];
}
if (sum % 2 != a[i]) {
ans[i] = 1;
}
}
int size = 0;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
size++;
}
}
cout << size << endl;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
cout << i << ' ';
}
}
return 0;
} | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 777,077 | 777,078 | u770009793 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
int main() {
ll n;
cin >> n;
vector<int> a(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
// (n+0.5)/2 ~ n ใพใง
// for(ll i=n; i>n/2; i--){
// if(a[i]){
// ans[i]=1;
// }
// }
for (ll i = n; i >= 1; i--) {
ll tmp = i;
int sum = 0;
while (tmp <= n) {
tmp += i;
sum += ans[tmp];
}
if (sum % 2 != a[i]) {
ans[i] = 1;
}
}
int size = 0;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
size++;
}
}
cout << size << endl;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
cout << i << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
int main() {
ll n;
cin >> n;
vector<int> a(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (ll i = n; i >= 1; i--) {
ll tmp = i;
int sum = 0;
while (tmp + i <= n) {
tmp += i;
sum += ans[tmp];
}
if (sum % 2 != a[i]) {
ans[i] = 1;
}
}
int size = 0;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
size++;
}
}
cout << size << endl;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
cout << i << ' ';
}
}
return 0;
} | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 777,079 | 777,078 | u770009793 | 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 <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
const long long MOD = 2;
/*
3
1 0 0 ...
1 1 1, 1;
0 1 0 0
0 0 1 0
0 0 0 0 0
0
1 1 0
*/
int table[501010];
void make_table(int N) {
REP(i, N + 10) table[i] = 0;
table[1] = 1;
for (int i = 2; i <= N; i++) {
for (int j = 1; j <= sqrt(i); j++) {
if (i % j == 0)
table[i]++;
}
table[i]++;
}
return;
}
void solve(long long N, std::vector<long long> a) {}
int a[202020];
int b[202020];
int main() {
int N;
cin >> N;
REP(i, N) cin >> a[i + 1];
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = 2; i * j <= N; j++) {
cnt += b[j];
}
if (cnt % 2 != a[i])
b[i] = 1;
}
VI ans;
for (int i = 1; i <= N; i++) {
if (b[i] == 1)
ans.PB(i);
}
cout << ans.size() << endl;
for (auto i : ans)
cout << i << " ";
cout << endl;
return 0;
}
| #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 <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
const long long MOD = 2;
/*
3
1 0 0 ...
1 1 1, 1;
0 1 0 0
0 0 1 0
0 0 0 0 0
0
1 1 0
*/
int table[501010];
void make_table(int N) {
REP(i, N + 10) table[i] = 0;
table[1] = 1;
for (int i = 2; i <= N; i++) {
for (int j = 1; j <= sqrt(i); j++) {
if (i % j == 0)
table[i]++;
}
table[i]++;
}
return;
}
void solve(long long N, std::vector<long long> a) {}
int a[202020];
int b[202020];
int main() {
int N;
cin >> N;
REP(i, N) cin >> a[i + 1];
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = 2; i * j <= N; j++) {
cnt += b[i * j];
}
if (cnt % 2 != a[i])
b[i] = 1;
}
VI ans;
for (int i = 1; i <= N; i++) {
if (b[i] == 1)
ans.PB(i);
}
cout << ans.size() << endl;
for (auto i : ans)
cout << i << " ";
cout << endl;
return 0;
}
| [
"assignment.change"
] | 777,094 | 777,095 | u978109511 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, 0, N) cin >> A[i];
vector<int> B;
int multiples[N + 1] = {};
for (int i = N - 1; i >= 0; i--) {
if (A[i] == multiples[i + 1] % 2)
continue;
B.push_back(i + 1);
for (int j = 1; j * j <= i + 1; j++) {
if ((i + 1) % j != 0)
continue;
multiples[j]++;
if (j != i + 1)
multiples[(i + 1) / j]++;
}
}
cout << B.size() << endl;
if (B.size() > 0) {
for (int i = B.size() - 1; i >= 0; i--) {
cout << B[i];
if (i != 0)
cout << " ";
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, 0, N) cin >> A[i];
vector<int> B;
int multiples[N + 1] = {};
for (int i = N - 1; i >= 0; i--) {
if (A[i] == multiples[i + 1] % 2)
continue;
B.push_back(i + 1);
for (int j = 1; j * j <= i + 1; j++) {
if ((i + 1) % j != 0)
continue;
multiples[j]++;
if (j * j != i + 1)
multiples[(i + 1) / j]++;
}
}
cout << B.size() << endl;
if (B.size() > 0) {
for (int i = B.size() - 1; i >= 0; i--) {
cout << B[i];
if (i != 0)
cout << " ";
}
cout << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,099 | 777,100 | u483992368 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
int a[N + 1];
a[0] = -1;
for (int i = 1; i < N + 1; i++)
cin >> a[i];
vector<int> box(N + 1);
box[0] = -1;
for (int i = 1; i < N + 1; i++)
box[i] = 0;
int count = 0;
for (int i = N; i > 0; i--) {
int sum = 0;
// n/2ไปฅไธใฎiใฏๅๆฐใ่ช่บซใฎใฟ
for (int j = 1; i * j < N; j++) {
sum += box[i * j];
}
if (sum % 2 != a[i]) {
box[i]++;
count++;
}
}
cout << count << endl;
for (int i = 1; i < N + 1; i++) {
if (box[i])
cout << box[i] << " ";
}
cout << endl;
return 0;
}
// cout << setprecision(13);
// next_permutation(v.begin(), v.end());
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
int a[N + 1];
a[0] = -1;
for (int i = 1; i < N + 1; i++)
cin >> a[i];
vector<int> box(N + 1);
box[0] = -1;
for (int i = 1; i < N + 1; i++)
box[i] = 0;
ll count = 0;
for (int i = N; i > 0; i--) {
int sum = 0;
// n/2ไปฅไธใฎiใฏๅๆฐใ่ช่บซใฎใฟ
for (int j = 1; i * j < N + 1; j++) {
sum += box[i * j];
}
if (sum % 2 != a[i]) {
box[i]++;
count++;
}
}
cout << count << endl;
for (int i = 1; i < N + 1; i++) {
if (box[i])
cout << i << " ";
}
cout << endl;
return 0;
}
// cout << setprecision(13);
// next_permutation(v.begin(), v.end());
| [
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 777,103 | 777,104 | u005906204 | cpp |
p02972 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1 << 30;
#define vec2(a, y, x) vector<vector<int>> a(y, vector<int>(x, 0))
#define vec1(a, n) \
vector<int> a(n); \
rep(i, n) cin >> a[i]
using P = pair<int, int>;
vector<int> dx = {0, 1, -1, 0};
vector<int> dy = {1, 0, 0, -1};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vec1(a, n);
vector<int> r(n, 0);
queue<int> q;
for (int i = n; i > 0; i--) {
if (i > n / 2) {
r[i - 1] = a[i - 1];
continue;
}
int cnt = 0;
for (int j = 2; j * i <= n; j++) {
cnt += r[j * i - 1];
}
if (a[i - 1] != cnt)
r[i - 1] = 1;
}
int cnt = 0;
rep(i, n) if (r[i]) {
cnt++;
q.push(i);
}
cout << cnt << endl;
while (q.size()) {
cout << q.front() << " ";
q.pop();
}
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1 << 30;
#define vec2(a, y, x) vector<vector<int>> a(y, vector<int>(x, 0))
#define vec1(a, n) \
vector<int> a(n); \
rep(i, n) cin >> a[i]
using P = pair<int, int>;
vector<int> dx = {0, 1, -1, 0};
vector<int> dy = {1, 0, 0, -1};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vec1(a, n);
vector<int> r(n, 0);
queue<int> q;
for (int i = n; i > 0; i--) {
if (i > n / 2) {
r[i - 1] = a[i - 1];
continue;
}
int cnt = 0;
for (int j = 2; j * i <= n; j++) {
cnt += r[j * i - 1];
}
if (a[i - 1] != (cnt % 2))
r[i - 1] = 1;
}
int cnt = 0;
rep(i, n) if (r[i]) {
cnt++;
q.push(i + 1);
}
cout << cnt << endl;
while (q.size()) {
cout << q.front() << " ";
q.pop();
}
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,107 | 777,106 | u424602097 | cpp |
p02972 | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b, c) for (int i = (a); (i) <= (b); (i) += (c))
#define ll long long
#define mp map<int, int>
using namespace std;
int a[200005];
ll ans = 0;
bool pd[200005];
int main() {
int n;
cin >> n;
rep(i, 1, n, 1) cin >> a[i];
ford(i, n, 1) {
ll t = 0;
rep(j, 1, n, i) if (pd[j]) t++;
if (t % 2 != a[i])
pd[i] = 1, ans++;
}
cout << ans << "\n";
rep(i, 1, n, 1) if (pd[i]) cout << i << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b, c) for (int i = (a); (i) <= (b); (i) += (c))
#define ll long long
#define mp map<int, int>
using namespace std;
int a[200005];
ll ans = 0;
bool pd[200005];
int main() {
int n;
cin >> n;
rep(i, 1, n, 1) cin >> a[i];
ford(i, n, 1) {
ll t = 0;
rep(j, i, n, i) if (pd[j]) t++;
if (t % 2 != a[i])
pd[i] = 1, ans++;
}
cout << ans << "\n";
rep(i, 1, n, 1) if (pd[i]) cout << i << "\n";
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 777,110 | 777,111 | u796123030 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> b(n);
vector<int> ans;
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
if (b[j - 1]) {
cnt++;
}
}
if (a[i - 1] % 2 == 0) {
if (cnt % 2 != 0) {
b[i - 1] = 1;
ans.push_back(i + 1);
m++;
}
} else {
if (cnt % 2 == 0) {
b[i - 1] = 1;
ans.push_back(i + 1);
m++;
}
}
}
cout << m << endl;
rep(i, m) { cout << ans[i] << endl; }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> b(n);
vector<int> ans;
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
if (b[j - 1]) {
cnt++;
}
}
if (a[i - 1] % 2 == 0) {
if (cnt % 2 != 0) {
b[i - 1] = 1;
ans.push_back(i);
m++;
}
} else {
if (cnt % 2 == 0) {
b[i - 1] = 1;
ans.push_back(i);
m++;
}
}
}
cout << m << endl;
rep(i, m) { cout << ans[i] << endl; }
return 0;
} | [
"expression.operation.binary.remove"
] | 777,112 | 777,113 | u561143568 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> b(n);
vector<int> ans;
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
if (b[j - 1]) {
cnt++;
}
}
if (a[i - 1] % 2 == 0) {
if (cnt % 2 != 0) {
b[i - 1] = 1;
ans.push_back(i + 1);
m++;
}
} else {
if (cnt % 2 == 0) {
b[i - 1] = 1;
ans.push_back(i + 1);
m++;
}
}
}
cout << m << endl;
rep(i, m) { cout << b[i] << endl; }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> b(n);
vector<int> ans;
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
if (b[j - 1]) {
cnt++;
}
}
if (a[i - 1] % 2 == 0) {
if (cnt % 2 != 0) {
b[i - 1] = 1;
ans.push_back(i);
m++;
}
} else {
if (cnt % 2 == 0) {
b[i - 1] = 1;
ans.push_back(i);
m++;
}
}
}
cout << m << endl;
rep(i, m) { cout << ans[i] << endl; }
return 0;
} | [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 777,114 | 777,113 | u561143568 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long long
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) \
sort(v.begin(), v.end()); \
reverse(v.begin(), v.end())
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
#define mod (ll)(1e9 + 7)
#define INF LLONG_MAX
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vll a(n + 1);
REP(i, n + 1) { cin >> a[i]; }
vll ans(n + 1);
for (int i = n; i >= 1; i--) {
ll sum = 0;
for (int j = i * 2; j <= n; j++) {
sum += ans[j];
}
sum %= 2;
ans[i] = sum ^ a[i];
}
cout << accumulate(all(ans), 0ll) << endl;
REP(i, n + 1) {
if (ans[i]) {
cout << i << " ";
}
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long long
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) \
sort(v.begin(), v.end()); \
reverse(v.begin(), v.end())
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
#define mod (ll)(1e9 + 7)
#define INF LLONG_MAX
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vll a(n + 1);
REP(i, n + 1) { cin >> a[i]; }
vll ans(n + 1);
for (int i = n; i >= 1; i--) {
ll sum = 0;
for (int j = i * 2; j <= n; j += i) {
sum += ans[j];
}
sum %= 2;
ans[i] = sum ^ a[i];
}
cout << accumulate(all(ans), 0ll) << endl;
REP(i, n + 1) {
if (ans[i]) {
cout << i << " ";
}
}
cout << endl;
return 0;
}
| [] | 777,119 | 777,120 | u324825702 | cpp |
p02972 | //#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 100;
int n, m, tot;
int a[N], b[N];
int ans[N];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i >= 1; --i) {
int s = 0;
for (int j = i + i; j <= n; j += i)
s += b[i];
if (s % 2 != a[i])
b[i] = 1, ans[tot++] = i;
}
if (!tot) {
puts("0");
return 0;
}
printf("%d\n", tot);
printf("%d", ans[0]);
for (int i = 1; i < tot; ++i)
printf(" %d", ans[i]);
puts("");
return 0;
} | //#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 100;
int n, m, tot;
int a[N], b[N];
int ans[N];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i >= 1; --i) {
int s = 0;
for (int j = i + i; j <= n; j += i)
s += b[j];
if (s % 2 != a[i])
b[i] = 1, ans[tot++] = i;
}
if (!tot) {
puts("0");
return 0;
}
printf("%d\n", tot);
printf("%d", ans[0]);
for (int i = 1; i < tot; ++i)
printf(" %d", ans[i]);
puts("");
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,123 | 777,124 | u186902062 | cpp |
p02972 | #include <bits/stdc++.h>
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++) {
cin >> a[i];
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int t = a[i];
for (int j = i; j < n; j += i) {
t ^= b[j];
}
b[i] = t;
if (t)
ans.push_back(i);
}
cout << (int)ans.size() << endl;
for (int i = 0; i < (int)ans.size(); i++)
cout << ans[i] << " ";
}
| #include <bits/stdc++.h>
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++) {
cin >> a[i];
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int t = a[i];
for (int j = i; j <= n; j += i) {
t ^= b[j];
}
b[i] = t;
if (t)
ans.push_back(i);
}
cout << (int)ans.size() << endl;
for (int i = 0; i < (int)ans.size(); i++)
cout << ans[i] << " ";
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,125 | 777,126 | u607728868 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll inf = INT64_MAX / 4;
constexpr ll mod = 1000000007;
constexpr int maxn = 200000;
int n, a[maxn + 1], c[maxn + 1], r[maxn + 1];
set<int> prime;
map<int, int> fac_p(int m) {
int k = m;
map<int, int> s;
for (auto e : prime) {
while (k % e == 0) {
k = k / e;
s[e]++;
}
}
if (k != 1)
s[k]++;
return s;
}
set<int> divisor(int m) {
auto t = fac_p(m);
set<int> s[2];
s[1].insert(1);
int i = 0;
for (auto e : t) {
for (auto f : s[(i + 1) % 2]) {
for (int j = 0; j <= e.second; j++) {
s[i % 2].insert(f * pow(e.first, j));
}
}
s[(i + 1) % 2].clear();
i++;
}
return s[(i + 1) % 2];
}
int main() {
for (int i = 2; i * i <= maxn; i++) {
bool flag = true;
for (auto e : prime) {
if (i % e == 0) {
flag = false;
break;
}
}
if (flag)
prime.insert(i);
}
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i > 0; i--) {
if (c[i] != a[i]) {
r[i] = 1;
for (auto e : divisor(i)) {
c[i] = (c[i] + 1) % 2;
}
}
}
set<int> v;
for (int i = 1; i <= n; i++)
if (r[i])
v.insert(i);
cout << v.size() << endl;
for (auto e : v)
cout << e << " ";
cout << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll inf = INT64_MAX / 4;
constexpr ll mod = 1000000007;
constexpr int maxn = 200000;
int n, a[maxn + 1], c[maxn + 1], r[maxn + 1];
set<int> prime;
map<int, int> fac_p(int m) {
int k = m;
map<int, int> s;
for (auto e : prime) {
while (k % e == 0) {
k = k / e;
s[e]++;
}
}
if (k != 1)
s[k]++;
return s;
}
set<int> divisor(int m) {
auto t = fac_p(m);
set<int> s[2];
s[1].insert(1);
int i = 0;
for (auto e : t) {
for (auto f : s[(i + 1) % 2]) {
for (int j = 0; j <= e.second; j++) {
s[i % 2].insert(f * pow(e.first, j));
}
}
s[(i + 1) % 2].clear();
i++;
}
return s[(i + 1) % 2];
}
int main() {
for (int i = 2; i * i <= maxn; i++) {
bool flag = true;
for (auto e : prime) {
if (i % e == 0) {
flag = false;
break;
}
}
if (flag)
prime.insert(i);
}
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i > 0; i--) {
if (c[i] != a[i]) {
r[i] = 1;
for (auto e : divisor(i)) {
c[e] = (c[e] + 1) % 2;
}
}
}
set<int> v;
for (int i = 1; i <= n; i++)
if (r[i])
v.insert(i);
cout << v.size() << endl;
for (auto e : v)
cout << e << " ";
cout << endl;
} | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 777,127 | 777,128 | u751537640 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define P pair<ll, ll>
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, pos, p, sum;
cin >> n;
lvector A(n, 0), B(n, 0), checked(n, 0);
rep(i, n) cin >> A[i];
bool isok = true;
rep(i, n) {
pos = n - 1 - i, p = pos + 1, sum = 0;
while (pos < n) {
sum += B[pos];
pos += p;
}
pos = n - 1 - i;
if (sum % 2 == 0 && A[pos] == 1 || sum % 2 == 1 && A[pos] == 0)
B[pos] = 1;
else if (sum % 2 == 0 && A[pos] == 0 || sum % 2 == 1 && A[pos] == 1)
continue;
else {
isok = false;
break;
}
}
if (isok) {
ll m = accumulate(B.begin(), B.end(), 0);
print(m);
if (m > 0) {
rep(i, n - 1) if (B[i] != 0) cout << i + 1 << ' ';
cout << endl;
}
} else
print(-1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define P pair<ll, ll>
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, pos, p, sum;
cin >> n;
lvector A(n, 0), B(n, 0), checked(n, 0);
rep(i, n) cin >> A[i];
bool isok = true;
rep(i, n) {
pos = n - 1 - i, p = pos + 1, sum = 0;
while (pos < n) {
sum += B[pos];
pos += p;
}
pos = n - 1 - i;
if (sum % 2 == 0 && A[pos] == 1 || sum % 2 == 1 && A[pos] == 0)
B[pos] = 1;
else if (sum % 2 == 0 && A[pos] == 0 || sum % 2 == 1 && A[pos] == 1)
continue;
else {
isok = false;
break;
}
}
if (isok) {
ll m = accumulate(B.begin(), B.end(), 0);
print(m);
if (m > 0) {
rep(i, n) if (B[i] != 0) cout << i + 1 << ' ';
cout << endl;
}
} else
print(-1);
return 0;
}
| [
"expression.operation.binary.remove"
] | 777,129 | 777,130 | u894339989 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<unsigned int> a(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
vector<unsigned int> b(n + 1);
for (int i = n; i >= 1; --i) {
unsigned int t = 0; // b[2i],b[3i],...ใซๅ่จไฝๅๅ
ฅใใใ
for (int j = 2; i * j <= n; ++j) {
t ^= b[i]; //ๅถๆฐใๅฅๆฐใใใใใใฐๅๅ
}
b[i] = t ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; ++i) {
if (b[i])
ans.emplace_back(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); ++i) {
cout << ans[i] << ((i == ans.size()) ? "\n" : " ");
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<unsigned int> a(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
vector<unsigned int> b(n + 1);
for (int i = n; i >= 1; --i) {
unsigned int t = 0; // b[2i],b[3i],...ใซๅ่จไฝๅๅ
ฅใใใ
for (int j = 2; i * j <= n; ++j) {
t ^= b[i * j]; //ๅถๆฐใๅฅๆฐใใใใใใฐๅๅ
}
b[i] = t ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; ++i) {
if (b[i])
ans.emplace_back(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); ++i) {
cout << ans[i] << ((i == ans.size()) ? "\n" : " ");
}
return 0;
} | [
"assignment.change"
] | 777,131 | 777,132 | u519194615 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
vector<int> ans;
const int N = 2e5;
int arr1[N + 100], arr2[N + 100];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &arr1[i]);
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i + i; j <= n; j += i) {
cnt = (cnt + arr2[i]) % 2;
}
if (cnt == arr1[i]) {
arr2[i] = 0;
} else {
arr2[i] = 1;
}
}
for (int i = 1; i <= n; i++) {
if (arr2[i]) {
ans.push_back(i);
}
}
printf("%d\n", (int)ans.size());
for (auto it : ans) {
printf("%d ", it);
}
printf("\n");
}
| #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
vector<int> ans;
const int N = 2e5;
int arr1[N + 100], arr2[N + 100];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &arr1[i]);
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i + i; j <= n; j += i) {
cnt = (cnt + arr2[j]) % 2;
}
if (cnt == arr1[i]) {
arr2[i] = 0;
} else {
arr2[i] = 1;
}
}
for (int i = 1; i <= n; i++) {
if (arr2[i]) {
ans.push_back(i);
}
}
printf("%d\n", (int)ans.size());
for (auto it : ans) {
printf("%d ", it);
}
printf("\n");
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 777,133 | 777,134 | u116018262 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
using namespace std;
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> m(N + 1, 0);
vector<int> ans;
for (int i = 1; i < N + 1; i++)
cin >> A[i];
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = i; j <= N; j += i) {
if (i % j == 0 && m[j] == 1)
cnt++;
}
if (cnt % 2 != A[i]) {
m[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i];
if (i != ans.size() - 1)
cout << " ";
else
cout << endl;
}
}
| #include <bits/stdc++.h>
int main() {
using namespace std;
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> m(N + 1, 0);
vector<int> ans;
for (int i = 1; i < N + 1; i++)
cin >> A[i];
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = i; j <= N; j += i) {
if (j % i == 0 && m[j] == 1)
cnt++;
}
if (cnt % 2 != A[i]) {
m[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i];
if (i != ans.size() - 1)
cout << " ";
else
cout << endl;
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 777,138 | 777,139 | u777258731 | cpp |
p02972 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int j = 1;
int sum = 0;
while (i * j <= n) {
sum += b[i * j];
j++;
}
sum %= 2;
b[i] = sum;
}
int m = 0;
vector<int> ans(0);
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
m++;
ans.push_back(i);
}
}
cout << m << endl;
rep(i, ans.size()) {
if (i == ans.size() - 1) {
cout << ans[i] << endl;
continue;
}
cout << ans[i] << " ";
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int j = 2;
int sum = a[i];
while (i * j <= n) {
sum += b[i * j];
j++;
}
sum %= 2;
b[i] = sum;
}
int m = 0;
vector<int> ans(0);
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
m++;
ans.push_back(i);
}
}
cout << m << endl;
rep(i, ans.size()) {
if (i == ans.size() - 1) {
cout << ans[i] << endl;
continue;
}
cout << ans[i] << " ";
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 777,140 | 777,141 | u136342563 | cpp |
p02972 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int j = 2;
int sum = a[i];
while (i * j <= n) {
sum += a[i * j];
j++;
}
sum %= 2;
b[i] = sum;
}
int m = 0;
vector<int> ans(0);
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
m++;
ans.push_back(i);
}
}
cout << m << endl;
rep(i, ans.size()) {
if (i == ans.size() - 1) {
cout << ans[i] << endl;
continue;
}
cout << ans[i] << " ";
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int j = 2;
int sum = a[i];
while (i * j <= n) {
sum += b[i * j];
j++;
}
sum %= 2;
b[i] = sum;
}
int m = 0;
vector<int> ans(0);
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
m++;
ans.push_back(i);
}
}
cout << m << endl;
rep(i, ans.size()) {
if (i == ans.size() - 1) {
cout << ans[i] << endl;
continue;
}
cout << ans[i] << " ";
}
} | [
"assignment.value.change",
"identifier.change"
] | 777,142 | 777,141 | u136342563 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.