problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p02972 | #include <bits/stdc++.h>
#define SORT(c) sort((c).begin(), (c).end())
#define db(x) cout << #x << "=" << x << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define reprs(i, m, n) for (int i = n; i >= m; i--)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> a(N);
vector<int> b;
int M = 0;
rep(i, N) { cin >> vec[i]; }
repr(i, N) {
int x;
x = vec[i];
int rr = N / (i + 1);
int ct = 0;
reps(j, 2, rr) {
if (a[(j * (i + 1)) - 1] == 1)
ct++;
}
if ((ct % 2) != x) {
b.push_back(i + 1);
a[i] = 1;
M++;
}
}
cout << M << endl;
rep(i, M) {
std::cout << b[i];
if (i != M - 1) {
std::cout << " ";
}
}
return 0;
}
| #include <bits/stdc++.h>
#define SORT(c) sort((c).begin(), (c).end())
#define db(x) cout << #x << "=" << x << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define reprs(i, m, n) for (int i = n; i >= m; i--)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> a(N);
vector<int> b;
int M = 0;
rep(i, N) { cin >> vec[i]; }
repr(i, N - 1) {
int x;
x = vec[i];
int rr = N / (i + 1);
int ct = 0;
reps(j, 2, rr + 1) {
if (a[(j * (i + 1)) - 1] == 1)
ct++;
}
if ((ct % 2) != x) {
b.push_back(i + 1);
a[i] = 1;
M++;
}
}
cout << M << endl;
rep(i, M) {
std::cout << b[i];
if (i != M - 1) {
std::cout << " ";
}
}
return 0;
}
| [
"expression.operation.binary.add"
] | 779,103 | 779,104 | u556276145 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long cc;
cc N, K, i, j, k, a[500000], sub = 0, n = 0;
cc judge = 0, Ans[500000], J[500000];
string S;
int main() {
cin >> N;
for (i = 1; i <= N; i++) {
cin >> a[i];
J[i] = 0;
}
for (i = 0; i < N; i++) {
if (a[N - i] == 1) {
for (j = 2; j <= N; j++) {
if ((N - i) * j > N)
break;
judge += J[(N - i) * j];
}
if (judge % 2 == 0) {
Ans[n] = N - i;
n += 1;
J[N - i] = 1;
}
} else {
for (j = 2; j <= N; j++) {
if ((N - i) * j > N)
break;
judge += J[(N - i) * j];
}
if (judge % 2 == 1) {
Ans[n] = N - i;
n += 1;
J[N - i] = 1;
}
}
}
cout << n << endl;
for (i = 0; i < n; i++)
cout << Ans[i] << " ";
cout << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long cc;
cc N, K, i, j, k, a[500000], sub = 0, n = 0;
cc judge = 0, Ans[500000], J[500000];
string S;
int main() {
cin >> N;
for (i = 1; i <= N; i++) {
cin >> a[i];
J[i] = 0;
}
for (i = 0; i < N; i++) {
if (a[N - i] == 1) {
for (j = 2; j <= N; j++) {
if ((N - i) * j > N)
break;
judge += J[(N - i) * j];
}
if (judge % 2 == 0) {
Ans[n] = N - i;
n += 1;
J[N - i] = 1;
}
} else {
for (j = 2; j <= N; j++) {
if ((N - i) * j > N)
break;
judge += J[(N - i) * j];
}
if (judge % 2 == 1) {
Ans[n] = N - i;
n += 1;
J[N - i] = 1;
}
}
judge = 0;
}
cout << n << endl;
for (i = 0; i < n; i++)
cout << Ans[i] << " ";
cout << endl;
return 0;
}
| [
"assignment.add"
] | 779,105 | 779,106 | u839537391 | cpp |
p02972 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
//#include<windows.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9 + 7;
Int INF = 1e18;
double EPS = 0.00000001;
// Int mod = 1e6+3;
int main() {
int n;
cin >> n;
int a[200003];
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
long long int b[200003];
int c[200003] = {};
int cnt = 0;
for (int i = n + 1; i > 0; i--) {
if (i * 2 > n) {
if (a[i] == 1) {
b[cnt] = i;
c[i] = 1;
cnt++;
}
} else {
int i3 = i;
int cnter = 0;
for (int i2 = 2; i3 * i2 < n; i2++) {
i3 = i3 * i2;
if (c[i3] == 1) {
cnter++;
}
} /*
if (i == 2) {
cout << i3 << " " << i << " " << a[i] << " " << cnter << endl;
}*/
if (cnter % 2 != a[i]) {
b[cnt] = i;
c[i] = 1;
cnt++;
}
}
}
cout << cnt << endl;
if (cnt != 0) {
for (int i = 0; i < cnt; i++) {
cout << b[i] << " ";
}
}
} |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
//#include<windows.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9 + 7;
Int INF = 1e18;
double EPS = 0.00000001;
// Int mod = 1e6+3;
int main() {
int n;
cin >> n;
int a[200003];
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
long long int b[200003];
int c[200003] = {};
int cnt = 0;
for (int i = n + 1; i > 0; i--) {
if (i * 2 > n) {
if (a[i] == 1) {
b[cnt] = i;
c[i] = 1;
cnt++;
}
} else {
int i3 = i;
int cnter = 0;
for (int i2 = 2; i * i2 <= n; i2++) {
i3 = i * i2;
if (c[i3] == 1) {
cnter++;
}
} /*
if (i == 2) {
cout << i3 << " " << i << " " << a[i] << " " << cnter << endl;
}*/
if (cnter % 2 != a[i]) {
b[cnt] = i;
c[i] = 1;
cnt++;
}
}
}
cout << cnt << endl;
if (cnt != 0) {
for (int i = 0; i < cnt; i++) {
cout << b[i] << " ";
}
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 779,107 | 779,108 | u959822889 | cpp |
p02972 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
//#include<windows.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9 + 7;
Int INF = 1e18;
double EPS = 0.00000001;
// Int mod = 1e6+3;
int main() {
int n;
cin >> n;
int a[200003];
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
long long int b[200003];
int c[200003] = {};
int cnt = 0;
for (int i = n + 1; i > 0; i--) {
if (i * 2 > n) {
if (a[i] == 1) {
b[cnt] = i;
c[i] = 1;
cnt++;
}
} else {
int i3 = i;
int cnter = 0;
for (int i2 = 2; i3 * i2 > n; i2++) {
i3 = i3 * i2;
if (c[i3] == 1) {
cnter++;
}
}
if (cnter % 2 != a[i]) {
b[cnt] = i;
c[i] = 1;
cnt++;
}
}
}
cout << cnt << endl;
if (cnt != 0) {
for (int i = 0; i < cnt; i++) {
cout << b[i] << " ";
}
}
} |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
//#include<windows.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9 + 7;
Int INF = 1e18;
double EPS = 0.00000001;
// Int mod = 1e6+3;
int main() {
int n;
cin >> n;
int a[200003];
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
long long int b[200003];
int c[200003] = {};
int cnt = 0;
for (int i = n + 1; i > 0; i--) {
if (i * 2 > n) {
if (a[i] == 1) {
b[cnt] = i;
c[i] = 1;
cnt++;
}
} else {
int i3 = i;
int cnter = 0;
for (int i2 = 2; i * i2 <= n; i2++) {
i3 = i * i2;
if (c[i3] == 1) {
cnter++;
}
} /*
if (i == 2) {
cout << i3 << " " << i << " " << a[i] << " " << cnter << endl;
}*/
if (cnter % 2 != a[i]) {
b[cnt] = i;
c[i] = 1;
cnt++;
}
}
}
cout << cnt << endl;
if (cnt != 0) {
for (int i = 0; i < cnt; i++) {
cout << b[i] << " ";
}
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 779,109 | 779,108 | u959822889 | cpp |
p02972 | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INTMAX = numeric_limits<int>::max();
const int INTMIN = numeric_limits<int>::min();
const ll LLMAX = numeric_limits<long long>::max();
const ll LLMIN = numeric_limits<long long>::min();
const int MOD = 1000000007;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
bool solve() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int ball = 0;
int d = 2;
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]) {
if (b[i] == 0)
b[i] = 1;
else
b[i] = 0;
}
}
for (int i = 1; i <= n; i++)
if (b[i])
ball++;
cout << ball << endl;
for (int i = 1; i <= n; i++) {
if (b[i])
cout << '1' << ' ';
}
return true;
}
signed main() {
solve();
return 0;
} | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INTMAX = numeric_limits<int>::max();
const int INTMIN = numeric_limits<int>::min();
const ll LLMAX = numeric_limits<long long>::max();
const ll LLMIN = numeric_limits<long long>::min();
const int MOD = 1000000007;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
bool solve() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int ball = 0;
int d = 2;
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]) {
if (b[i] == 0)
b[i] = 1;
else
b[i] = 0;
}
}
for (int i = 1; i <= n; i++)
if (b[i])
ball++;
cout << ball << endl;
for (int i = 1; i <= n; i++) {
if (b[i])
cout << i << ' ';
}
return true;
}
signed main() {
solve();
return 0;
} | [
"io.output.change"
] | 779,110 | 779,111 | u713333397 | cpp |
p02972 | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INTMAX = numeric_limits<int>::max();
const int INTMIN = numeric_limits<int>::min();
const ll LLMAX = numeric_limits<long long>::max();
const ll LLMIN = numeric_limits<long long>::min();
const int MOD = 1000000007;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
bool solve() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int ball = 0;
int d = 2;
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[i];
}
if (sum % 2 != a[i]) {
if (b[i] == 0)
b[i] = 1;
else
b[i] = 0;
}
}
for (int i = 1; i <= n; i++)
if (b[i])
ball++;
cout << ball << endl;
for (int i = 1; i <= n; i++) {
if (b[i])
cout << '1' << ' ';
}
return true;
}
signed main() {
solve();
return 0;
} | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INTMAX = numeric_limits<int>::max();
const int INTMIN = numeric_limits<int>::min();
const ll LLMAX = numeric_limits<long long>::max();
const ll LLMIN = numeric_limits<long long>::min();
const int MOD = 1000000007;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
bool solve() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int ball = 0;
int d = 2;
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]) {
if (b[i] == 0)
b[i] = 1;
else
b[i] = 0;
}
}
for (int i = 1; i <= n; i++)
if (b[i])
ball++;
cout << ball << endl;
for (int i = 1; i <= n; i++) {
if (b[i])
cout << i << ' ';
}
return true;
}
signed main() {
solve();
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 779,112 | 779,111 | u713333397 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int a[200010];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[20010];
queue<int> q;
int balls = 0;
for (int i = n - 1; i >= 0; i--) {
int k = n / (i + 1);
int count = 0;
for (int j = 2; j <= k; j++) {
count = (count + b[k * (i + 1) - 1]) % 2;
}
if (count == a[i])
b[i] = 0;
else {
b[i] = 1;
q.push(i + 1);
balls++;
}
}
cout << balls << endl;
for (int i = 0; i < balls; i++) {
cout << q.front() << " ";
q.pop();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int n;
cin >> n;
int a[200010];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[200010];
queue<int> q;
long long int balls = 0;
for (int i = n - 1; i >= 0; i--) {
int k = n / (i + 1);
int count = 0;
for (int j = 2; j <= k; j++) {
count = (count + b[j * (i + 1) - 1]) % 2;
}
if (count == a[i])
b[i] = 0;
else {
b[i] = 1;
q.push(i + 1);
balls++;
}
}
cout << balls << endl;
for (int i = 0; i < balls; i++) {
cout << q.front() << " ";
q.pop();
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 779,119 | 779,116 | u164474813 | cpp |
p02972 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep3(i, a, b) for (int i = a; i >= b; i--)
#define REP(e, v) for (auto e : v)
#define queint queue<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pq priority_queue<int> //大きい順
#define pqg priority_queue<int, vec, greater<int>> //小さい順
#define pb push_back
#define vec vector<int>
#define vecvec vector<vector<int>>
#define vecll vector<ll>
#define vecvecll vector<vector<ll>>
#define bs binary_search
#define All(c) (c).begin(), (c).end()
#define mp make_pair
using namespace std;
int in() {
int x;
scanf("%d", &x);
return x;
}
string stin() {
string s;
cin >> s;
return s;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
ll mod = 1000000007;
int main() {
int n = in();
vec a(n + 1);
rep(i, n) { a[i + 1] = in(); }
vec ans;
vec b(n + 1);
rep3(i, n, 1) {
int tmp = 0;
for (int k = i * 2; k <= n; k += i) {
tmp += b[k];
}
b[i] = (tmp - a[i] + 2) % 2;
if (b[i] == 1)
ans.pb(i);
}
cout << ans.size() << endl;
for (ll i = ans.size() - 1; i >= 0; i--) {
cout << (i + 1) << " ";
}
}
| #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep3(i, a, b) for (int i = a; i >= b; i--)
#define REP(e, v) for (auto e : v)
#define queint queue<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pq priority_queue<int> //大きい順
#define pqg priority_queue<int, vec, greater<int>> //小さい順
#define pb push_back
#define vec vector<int>
#define vecvec vector<vector<int>>
#define vecll vector<ll>
#define vecvecll vector<vector<ll>>
#define bs binary_search
#define All(c) (c).begin(), (c).end()
#define mp make_pair
using namespace std;
int in() {
int x;
scanf("%d", &x);
return x;
}
string stin() {
string s;
cin >> s;
return s;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
ll mod = 1000000007;
int main() {
int n = in();
vec a(n + 1);
rep(i, n) { a[i + 1] = in(); }
vec ans;
vec b(n + 1);
rep3(i, n, 1) {
int tmp = 0;
for (int k = i * 2; k <= n; k += i) {
tmp += b[k];
}
b[i] = (tmp - a[i] + 2) % 2;
if (b[i] == 1)
ans.pb(i);
}
cout << ans.size() << endl;
for (ll i = ans.size() - 1; i >= 0; i--) {
cout << ans[i] << " ";
}
}
| [
"io.output.change"
] | 779,120 | 779,121 | u434662823 | cpp |
p02972 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep3(i, a, b) for (int i = a; i >= b; i--)
#define REP(e, v) for (auto e : v)
#define queint queue<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pq priority_queue<int> //大きい順
#define pqg priority_queue<int, vec, greater<int>> //小さい順
#define pb push_back
#define vec vector<int>
#define vecvec vector<vector<int>>
#define vecll vector<ll>
#define vecvecll vector<vector<ll>>
#define bs binary_search
#define All(c) (c).begin(), (c).end()
#define mp make_pair
using namespace std;
int in() {
int x;
scanf("%d", &x);
return x;
}
string stin() {
string s;
cin >> s;
return s;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
ll mod = 1000000007;
int main() {
int n = in();
vec a(n + 1);
rep(i, n) { a[i + 1] = in(); }
vec ans;
vec b(n + 1);
rep3(i, n, 1) {
int tmp = 0;
for (int k = i * 2; k <= n; k += i) {
tmp += b[k];
}
b[i] = (tmp - a[i] + 2) % 2;
if (b[i] == 1)
ans.pb(i);
}
cout << ans.size() << endl;
for (ll i = ans.size() - 1; i >= 0; i--) {
cout << i << " ";
}
}
| #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep3(i, a, b) for (int i = a; i >= b; i--)
#define REP(e, v) for (auto e : v)
#define queint queue<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pq priority_queue<int> //大きい順
#define pqg priority_queue<int, vec, greater<int>> //小さい順
#define pb push_back
#define vec vector<int>
#define vecvec vector<vector<int>>
#define vecll vector<ll>
#define vecvecll vector<vector<ll>>
#define bs binary_search
#define All(c) (c).begin(), (c).end()
#define mp make_pair
using namespace std;
int in() {
int x;
scanf("%d", &x);
return x;
}
string stin() {
string s;
cin >> s;
return s;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
ll mod = 1000000007;
int main() {
int n = in();
vec a(n + 1);
rep(i, n) { a[i + 1] = in(); }
vec ans;
vec b(n + 1);
rep3(i, n, 1) {
int tmp = 0;
for (int k = i * 2; k <= n; k += i) {
tmp += b[k];
}
b[i] = (tmp - a[i] + 2) % 2;
if (b[i] == 1)
ans.pb(i);
}
cout << ans.size() << endl;
for (ll i = ans.size() - 1; i >= 0; i--) {
cout << ans[i] << " ";
}
}
| [] | 779,122 | 779,121 | u434662823 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
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();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define MP make_pair
#define EACH(i, c) for (auto i : c)
#define SORT(c) sort((c).begin(), (c).end())
#define ALL(a) (a).begin(), (a).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI A(N + 1, 0);
REP(i, N) cin >> A[i + 1];
VI B(N + 1, 0);
for (int i = N; 0 < i; i--) {
int j = N / i;
int k = 0;
while (0 < j) {
k ^= A[i * j];
j--;
}
B[i] = k;
}
int ret = 0;
FOR(i, 1, N + 1) ret += B[i] == 1;
cout << ret << endl;
FOR(i, 1, N + 1) if (B[i]) 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 <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
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();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define MP make_pair
#define EACH(i, c) for (auto i : c)
#define SORT(c) sort((c).begin(), (c).end())
#define ALL(a) (a).begin(), (a).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI A(N + 1, 0);
REP(i, N) cin >> A[i + 1];
VI B(N + 1, 0);
for (int i = N; 0 < i; i--) {
int j = N / i;
int k = 0;
while (0 < j) {
k ^= B[i * j];
j--;
}
B[i] = k ^ A[i];
}
int ret = 0;
FOR(i, 1, N + 1) ret += B[i] == 1;
cout << ret << endl;
FOR(i, 1, N + 1) if (B[i]) cout << i << " ";
cout << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"assignment.change"
] | 779,130 | 779,131 | u543189005 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> result(n + 1, 0);
int sum = 0;
for (int i = n; i > 0; i--) {
int s = 0;
for (int j = i * 2; j <= n; j++) {
s += result[j];
}
result[i] = a[i] ^ (s % 2);
sum += result[i];
}
cout << sum << endl;
for (int i = 1; i <= n; i++) {
if (result[i] == 1) {
cout << i << " ";
}
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> result(n + 1, 0);
int sum = 0;
for (int i = n; i > 0; i--) {
int s = 0;
for (int j = i * 2; j <= n; j += i) {
s += result[j];
}
result[i] = a[i] ^ (s % 2);
sum += result[i];
}
cout << sum << endl;
for (int i = 1; i <= n; i++) {
if (result[i] == 1) {
cout << i << " ";
}
}
return 0;
}
| [] | 779,138 | 779,139 | u403813525 | cpp |
p02972 | #include <cstdlib>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::cin.ignore();
int n = N;
std::vector<int> A;
A.reserve(N);
while (n-- > 0) {
int a;
std::cin >> a;
A.push_back(a);
}
std::vector<int> ans(N, 0);
int m = 0;
for (int i = N - 1; i >= 0; --i) {
int total = 0;
for (int j = 2; j * (i + 1) < N; ++j) {
total += ans[j * (i + 1) - 1];
}
if ((total % 2 == 0 && A[i] == 1) || (total % 2 == 1 && A[i] == 0)) {
m++;
ans[i] = 1;
}
}
std::cout << m << std::endl;
for (int i = 0; i < N - 1; ++i) {
if (ans[i])
std::cout << i + 1 << " ";
}
} | #include <cstdlib>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::cin.ignore();
int n = N;
std::vector<int> A;
A.reserve(N);
while (n-- > 0) {
int a;
std::cin >> a;
A.push_back(a);
}
std::vector<int> ans(N, 0);
int m = 0;
for (int i = N - 1; i >= 0; --i) {
int total = 0;
for (int j = 2; j * (i + 1) <= N; ++j) {
total += ans[j * (i + 1) - 1];
}
if ((total % 2 == 0 && A[i] == 1) || (total % 2 == 1 && A[i] == 0)) {
m++;
ans[i] = 1;
}
}
std::cout << m << std::endl;
for (int i = 0; i < N; ++i) {
if (ans[i])
std::cout << i + 1 << " ";
}
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 779,144 | 779,143 | u317230226 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vi s(n + 1, 0);
vi b(n + 1, 0);
int ans = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = 1; j <= i; j += i) {
sum += b[j];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
// s[i] += 1;
}
// if (s[i] % 2 == a[i]) {
// b[i] = 0;
// } else {
// b[i] = 1;
// ans++;
// // s[i] += 1;
// }
// for (int j = 0; j < i; j++) {
// if ((i + 1) % (j + 1) == 0) {
// s[j] += b[i];
// }
// }
// debug
// printf("i=%d, b: ", i);
// for (int j = 0; j < n; j++) {
// printf("%d ", b[j]);
// }
// printf("\n");
// printf("i=%d, s: ", i);
// for (int j = 0; j < n; j++) {
// printf("%d ", s[j]);
// }
// printf("\n");
}
cout << ans << endl;
if (ans != 0) {
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
printf("%d ", i);
}
}
printf("\n");
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vi s(n + 1, 0);
vi b(n + 1, 0);
int ans = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
// s[i] += 1;
}
// if (s[i] % 2 == a[i]) {
// b[i] = 0;
// } else {
// b[i] = 1;
// ans++;
// // s[i] += 1;
// }
// for (int j = 0; j < i; j++) {
// if ((i + 1) % (j + 1) == 0) {
// s[j] += b[i];
// }
// }
// debug
// printf("i=%d, b: ", i);
// for (int j = 0; j < n; j++) {
// printf("%d ", b[j]);
// }
// printf("\n");
// printf("i=%d, s: ", i);
// for (int j = 0; j < n; j++) {
// printf("%d ", s[j]);
// }
// printf("\n");
}
cout << ans << endl;
if (ans != 0) {
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
printf("%d ", i);
}
}
printf("\n");
}
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 779,145 | 779,146 | u051652188 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
bool boxs[200005];
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; ++i) {
cin >> a[i];
}
string ans;
int cnt = 0;
for (int i = N; i >= 1; --i) {
int sum = 0;
for (int j = N / i; j > 1; --j) {
if (boxs[j])
sum++;
}
boxs[i] = sum % 2 ^ a[i];
if (boxs[i])
cnt++;
}
cout << cnt << endl;
for (int i = 1; i <= N; ++i) {
if (boxs[i]) {
ans += to_string(i) + " ";
}
}
ans = ans.substr(0, ans.size() - 1);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool boxs[200005];
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; ++i) {
cin >> a[i];
}
string ans;
int cnt = 0;
for (int i = N; i >= 1; --i) {
int sum = 0;
for (int j = N / i; j > 1; --j) {
if (boxs[j * i])
sum++;
}
boxs[i] = sum % 2 ^ a[i];
if (boxs[i])
cnt++;
}
cout << cnt << endl;
for (int i = 1; i <= N; ++i) {
if (boxs[i]) {
ans += to_string(i) + " ";
}
}
ans = ans.substr(0, ans.size() - 1);
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 779,160 | 779,161 | u159619403 | cpp |
p02972 | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
int wk;
for (int i = 0; i < n; i++) {
cin >> wk;
a.push_back(wk);
}
vector<int> ans(n);
for (int i = 0; i < n; i++)
ans[i] = 0;
int sum;
int index;
for (int i = n - 1; i >= 0; i--) {
sum = 0;
index = 2 * i + 1;
while (index < n) {
sum += a[index];
index += i + 1;
}
sum %= 2;
if (sum != a[i]) {
ans[i] = 1;
}
}
vector<int> b;
int anscount = 0;
for (int i = 0; i < n; i++) {
if (ans[i] == 1) {
anscount++;
b.push_back(i + 1);
}
}
if (anscount == 0) {
cout << "0" << endl;
} else {
cout << b.size() << endl;
cout << b[0];
for (int i = 1; i < b.size(); i++) {
cout << " " << b[i];
}
cout << endl;
}
return 0;
}
| #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
int wk;
for (int i = 0; i < n; i++) {
cin >> wk;
a.push_back(wk);
}
vector<int> ans(n);
for (int i = 0; i < n; i++)
ans[i] = 0;
int sum;
int index;
for (int i = n - 1; i >= 0; i--) {
sum = 0;
index = 2 * i + 1;
while (index < n) {
sum += ans[index];
index += i + 1;
}
sum %= 2;
if (sum != a[i]) {
ans[i] = 1;
}
}
vector<int> b;
int anscount = 0;
for (int i = 0; i < n; i++) {
if (ans[i] == 1) {
anscount++;
b.push_back(i + 1);
}
}
if (anscount == 0) {
cout << "0" << endl;
} else {
cout << b.size() << endl;
cout << b[0];
for (int i = 1; i < b.size(); i++) {
cout << " " << b[i];
}
cout << endl;
}
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 779,162 | 779,163 | u845284573 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int num, i, j, a, m = 0;
cin >> num;
vector<int> d(num + 1), ans(num + 1, false);
for (i = 1; i <= num >> 1; i++)
scanf("%d", &d[i]);
for (; i <= num; i++) {
scanf("%d", &d[i]);
ans[i] = d[i];
if (ans[i])
m++;
}
for (i = num >> 1; i > 0; i--) {
for (a = 0, j = i << 1; j <= num; j += i) {
a ^= d[j];
}
if (a != d[i]) {
ans[i] = true;
m++;
}
}
printf("%d\n", m);
for (i = 1; i <= num; i++) {
if (ans[i])
printf("%d ", i);
}
printf("\n");
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int num, i, j, a, m = 0;
cin >> num;
vector<int> d(num + 1), ans(num + 1, false);
for (i = 1; i <= num >> 1; i++)
scanf("%d", &d[i]);
for (; i <= num; i++) {
scanf("%d", &d[i]);
ans[i] = d[i];
if (ans[i])
m++;
}
for (i = num >> 1; i > 0; i--) {
for (a = 0, j = i << 1; j <= num; j += i) {
a ^= ans[j];
}
if (a != d[i]) {
ans[i] = true;
m++;
}
}
printf("%d\n", m);
for (i = 1; i <= num; i++) {
if (ans[i])
printf("%d ", i);
}
printf("\n");
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 779,170 | 779,171 | u583354994 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repn(i, n) for (ll i = 0; i <= (ll)(n); i++)
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
const ll INF = 1000000099;
// cin.tie(0);
// ios::sync_with_stdio(false);
signed main() {
ll n, m = 0;
cin >> n;
vector<ll> a(n + 1, 0);
vector<ll> ball(n + 1, 0); //入れる個数
vector<ll> ans(0);
rep(i, n) cin >> a[i + 1];
for (int i = n; 0 < i; i--) {
ll cnt = 1, sum = 0;
while (cnt * i <= n) {
sum ^= ball[i];
cnt++;
}
if (sum != a[i]) {
m++;
ball[i] ^= 1;
ans.pb(i);
}
}
cout << m << endl;
rep(i, m) cout << ans[i] << " ";
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repn(i, n) for (ll i = 0; i <= (ll)(n); i++)
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
const ll INF = 1000000099;
// cin.tie(0);
// ios::sync_with_stdio(false);
signed main() {
ll n, m = 0;
cin >> n;
vector<ll> a(n + 1, 0);
vector<ll> ball(n + 1, 0); //入れる個数
vector<ll> ans(0);
rep(i, n) cin >> a[i + 1];
for (int i = n; 0 < i; i--) {
ll cnt = 1, sum = 0;
while (cnt * i <= n) {
sum ^= ball[i * cnt];
cnt++;
}
if (sum != a[i]) {
m++;
ball[i] ^= 1;
ans.pb(i);
}
}
cout << m << endl;
rep(i, m) cout << ans[i] << " ";
cout << endl;
}
| [
"assignment.change"
] | 779,174 | 779,175 | u317711717 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[200000];
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
for (int j = i + i; j <= n; j += i) {
a[i] ^= a[j];
}
if (a[i]) {
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (a[i]) {
cout << a[i] << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int a[200000];
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
for (int j = i + i; j <= n; j += i) {
a[i] ^= a[j];
}
if (a[i]) {
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (a[i]) {
cout << i << endl;
}
}
} | [] | 779,176 | 779,177 | u335832380 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
int tmp;
cin >> tmp;
A[i] = tmp;
}
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <= N; j += i) {
sum += B[j];
}
if (sum % 2 != A[i]) {
B[i] = 1;
M++;
}
}
cout << M << "\n";
for (int i = 1; i <= N; i++) {
if (B[i] == 1)
cout << B[i] << " ";
}
} | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
int tmp;
cin >> tmp;
A[i] = tmp;
}
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <= N; j += i) {
sum += B[j];
}
if (sum % 2 != A[i]) {
B[i] = 1;
M++;
}
}
cout << M << "\n";
for (int i = 1; i <= N; i++) {
if (B[i] == 1)
cout << i << " ";
}
} | [] | 779,178 | 779,179 | u108648546 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
int tmp;
cin >> tmp;
A[i] = tmp;
}
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= N; j += i) {
sum += B[j];
}
if (sum % 2 != A[i]) {
B[i] = 1;
M++;
}
}
cout << M << "\n";
for (int i = 1; i <= N; i++) {
if (B[i] == 1)
cout << B[i] << "\n";
}
} | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
int tmp;
cin >> tmp;
A[i] = tmp;
}
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2 * i; j <= N; j += i) {
sum += B[j];
}
if (sum % 2 != A[i]) {
B[i] = 1;
M++;
}
}
cout << M << "\n";
for (int i = 1; i <= N; i++) {
if (B[i] == 1)
cout << i << " ";
}
} | [
"control_flow.loop.for.initializer.change",
"literal.string.change",
"io.output.change"
] | 779,180 | 779,179 | u108648546 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using ll = long long;
constexpr long long INF = 1LL << 62;
constexpr int MOD = 1e9 + 7;
constexpr double EPS = 1e-10;
int m[202020];
void pf(ll x) {
for (ll i = 1; i * i <= x; ++i) {
if (x % i == 0) {
++m[i];
if (i != x / i)
++m[x / i];
}
}
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> a(N + 1);
for (int i = 1; i <= N; ++i)
cin >> a[i];
vector<ll> ans;
for (int i = N; i >= 1; --i) {
if (m[i] % 2 != a[i]) {
ans.push_back(1);
pf(i);
}
}
int M = (int)ans.size();
cout << M << '\n';
REP(i, M) cout << ans[i] << (i == M - 1 ? '\n' : ' ');
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using ll = long long;
constexpr long long INF = 1LL << 62;
constexpr int MOD = 1e9 + 7;
constexpr double EPS = 1e-10;
int m[202020];
void pf(ll x) {
for (ll i = 1; i * i <= x; ++i) {
if (x % i == 0) {
++m[i];
if (i != x / i)
++m[x / i];
}
}
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> a(N + 1);
for (int i = 1; i <= N; ++i)
cin >> a[i];
vector<ll> ans;
for (int i = N; i >= 1; --i) {
if (m[i] % 2 != a[i]) {
ans.push_back(i);
pf(i);
}
}
int M = (int)ans.size();
cout << M << '\n';
REP(i, M) cout << ans[i] << (i == M - 1 ? '\n' : ' ');
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 779,181 | 779,182 | u843175622 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
int a[214514];
int b[214514];
int c[214514];
signed main() {
ic(n) rep(0, i, n) cin >> a[i];
for (int i = n - 1; i >= 0; i -= 1) {
rep(0, j, n / (i + 1) + 1) {
if (b[(i + 1) * j] == 1) {
if (a[i] == 1) {
a[i] = 0;
} else {
a[i] = 1;
}
}
}
if (a[i] == 1) {
b[i] = 1;
a[i] = 0;
} else {
b[i] = 0;
}
}
int sum = 0;
rep(0, i, n) {
if (b[i] == 1) {
c[sum] = i;
sum++;
}
}
c(sum) rep(0, i, sum) { cout << c[i] + 1 << " "; }
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
int a[214514];
int b[214514];
int c[214514];
signed main() {
ic(n) rep(0, i, n) cin >> a[i];
for (int i = n - 1; i >= 0; i -= 1) {
rep(0, j, n / (i + 1) + 1) {
if (b[(i + 1) * j - 1] == 1) {
if (a[i] == 1) {
a[i] = 0;
} else {
a[i] = 1;
}
}
}
if (a[i] == 1) {
b[i] = 1;
a[i] = 0;
} else {
b[i] = 0;
}
}
int sum = 0;
rep(0, i, n) {
if (b[i] == 1) {
c[sum] = i;
sum++;
}
}
c(sum) rep(0, i, sum) { cout << c[i] + 1 << " "; }
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 779,183 | 779,184 | u942393279 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
#define MSG(a) cout << #a << " " << a << "\n";
int main() {
int N, tmp = 0, check = 0;
cin >> N;
vint A(N), ans(N);
REP(i, N) {
cin >> A.at(i);
ans.at(i) = 0;
}
for (int i = N - 1; i >= 0; i--) {
tmp = 0;
for (int j = i; j < N; j += i + 1) {
tmp += ans.at(j);
}
if (tmp % 2 != A.at(i)) {
ans.at(i) = 1;
check += 1;
}
}
if (check % 2 != A.at(0))
cout << -1 << "\n";
else {
int M = accumulate(ALL(ans), 0);
cout << M << "\n";
for (int i = 0; i < N; i++) {
if (ans.at(i) == 1)
cout << ans.at(i) << "\n";
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
#define MSG(a) cout << #a << " " << a << "\n";
int main() {
int N, tmp = 0, check = 0;
cin >> N;
vint A(N), ans(N);
REP(i, N) {
cin >> A.at(i);
ans.at(i) = 0;
}
for (int i = N - 1; i >= 0; i--) {
tmp = 0;
for (int j = i; j < N; j += i + 1) {
tmp += ans.at(j);
}
if (tmp % 2 != A.at(i)) {
ans.at(i) = 1;
check += 1;
}
}
if (check % 2 != A.at(0))
cout << -1 << "\n";
else {
int M = accumulate(ALL(ans), 0);
cout << M << "\n";
for (int i = 0; i < N; i++) {
if (ans.at(i) == 1)
cout << i + 1 << "\n";
}
}
} | [
"call.remove",
"io.output.change"
] | 779,190 | 779,191 | u547748135 | cpp |
p02972 | /*
こんにちは。あたしはｶｳｶﾞｰﾙ。
redcoderになるためAtCoderを巡る旅をしてます。
＿_
ヽ|＿_|ノ ﾓｫ
||‘‐‘||ﾚ _)_, ―‐ 、
/(Ｙ (ヽ＿ /・ ヽ ￣ヽ
∠ ＿ ゝ ｀^ヽ ﾉ.::::_(ノヽ
_/ヽ /ヽ￣￣/ヽ
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define rep(i, n) REP(i, 0, n) // 0, 1, ..., n-1
#define REP(i, x, n) for (int i = x; i < n; i++) // x, x + 1, ..., n-1
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define COUT(x) cout << (x) << endl
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 main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1, 0);
int ans = 0;
for (int i = 1; i < n; i++)
cin >> a[i]; // 1-origin
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i)
cnt += b[j];
if (cnt % 2 != a[i]) {
b[i]++;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (b[i])
cout << i << " ";
}
cout << endl;
}
| /*
こんにちは。あたしはｶｳｶﾞｰﾙ。
redcoderになるためAtCoderを巡る旅をしてます。
＿_
ヽ|＿_|ノ ﾓｫ
||‘‐‘||ﾚ _)_, ―‐ 、
/(Ｙ (ヽ＿ /・ ヽ ￣ヽ
∠ ＿ ゝ ｀^ヽ ﾉ.::::_(ノヽ
_/ヽ /ヽ￣￣/ヽ
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define rep(i, n) REP(i, 0, n) // 0, 1, ..., n-1
#define REP(i, x, n) for (int i = x; i < n; i++) // x, x + 1, ..., n-1
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define COUT(x) cout << (x) << endl
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 main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1, 0);
int ans = 0;
for (int i = 1; i <= n; i++)
cin >> a[i]; // 1-origin
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i)
cnt += b[j];
if (cnt % 2 != a[i]) {
b[i]++;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (b[i])
cout << i << " ";
}
cout << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,198 | 779,199 | u038027079 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define th(n) cout << n << endl
#define gc getchar_unlocked
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define n_l '\n'
// make it python
#define gcd __gcd
#define append push_back
#define str to_string
#define upper(s) transform(s.begin(), s.end(), s.begin(), ::toupper)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
#define print(arr) \
for (auto el : arr) \
cout << el << " "; \
cout << endl
// utility functions shortcuts
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define sswap(a, b) \
{ \
a = a ^ b; \
b = a ^ b; \
a = a ^ b; \
}
#define swap(a, b) \
{ \
auto temp = a; \
a = b; \
b = temp; \
}
#define init(dp) memset(dp, -1, sizeof(dp));
#define set0(dp) memset(dp, 0, sizeof(dp));
#define bits(x) __builtin_popcount(x)
#define SORT(v) sort(all(v))
#define endl "\n"
#define forr(i, n) for (ll i = 0; i < n; i++)
#define formatrix(i, n) for (ll i = 0; i < n; i++, cout << "\n")
#define eof (scanf("%d", &n)) != EOF
// declaration shortcuts
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define pll pair<ll, ll>
#define ppl pair<ll, pp>
#define ull unsigned long long
#define ll long long
#define mll map<ll, ll>
#define sll set<ll>
#define uni(v) v.erase(unique(v.begin(), v.end()), v.end());
#define ini(a, v) memset(a, v, sizeof(a))
// Constants
constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
constexpr ll INF = 1999999999999999997;
constexpr int inf = INT_MAX;
constexpr int MAXSIZE = int(1e6) + 5;
constexpr auto PI = 3.14159265358979323846L;
constexpr auto oo = numeric_limits<int>::max() / 2 - 2;
constexpr auto eps = 1e-6;
constexpr auto mod = 1000000007;
constexpr auto MOD = 1000000007;
constexpr auto MOD9 = 1000000009;
constexpr auto maxn = 100006;
// Debugging
// For reference: https://codeforces.com/blog/entry/65311
#define dbg(...) \
cout << "[" << #__VA_ARGS__ << "]: "; \
cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }
template <typename T> int SIZE(const T &t) { return t.size(); }
string to_string(string s, int x1 = 0, int x2 = 1e9) {
return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(char c) { return string({c}); }
template <size_t N> string to_string(bitset<N> &b, int x1 = 0, int x2 = 1e9) {
string t = "";
for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
__iii__ <= __jjj__; ++__iii__) {
t += b[__iii__] + '0';
}
return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B> string to_string(pair<A, B> &p) {
l_v_l_v_l++;
string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
l_v_l_v_l--;
return res;
}
template <typename A, typename... C>
string to_string(A(&v), int x1, int x2, C... coords) {
int rnk = rank<A>::value;
string tab(t_a_b_s, ' ');
string res = "";
bool first = true;
if (l_v_l_v_l == 0)
res += n_l;
res += tab + "[";
x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
auto l = begin(v);
advance(l, x1);
auto r = l;
advance(r, (x2 - x1) + (x2 < SIZE(v)));
for (auto e = l; e != r; e = next(e)) {
if (!first) {
res += ", ";
}
first = false;
l_v_l_v_l++;
if (e != l) {
if (rnk > 1) {
res += n_l;
t_a_b_s = l_v_l_v_l;
};
} else {
t_a_b_s = 0;
}
res += to_string(*e, coords...);
l_v_l_v_l--;
}
res += "]";
if (l_v_l_v_l == 0)
res += n_l;
return res;
}
void dbgs() { ; }
template <typename Heads, typename... Tails> void dbgs(Heads H, Tails... T) {
cout << to_string(H) << " | ";
dbgs(T...);
}
#define dbgm(...) \
cout << "[" << #__VA_ARGS__ << "]: "; \
dbgs(__VA_ARGS__); \
cout << endl;
#define n_l '\n'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
vll v(n + 1, 0);
vll ans(n + 1, 0);
ans[0] = 0;
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int i = n; i > 0; i--) {
ll nxt = 0;
for (int j = 2 * i; j <= n; j += i) {
nxt += ans[j];
}
nxt %= 2;
ans[i] = (nxt != v[i]);
}
cout << accumulate(ans.begin() + 1, ans.begin() + n, 0) << endl;
for (int i = 1; i <= n; i++)
if (ans[i])
cout << i << " ";
}
| #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define th(n) cout << n << endl
#define gc getchar_unlocked
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define n_l '\n'
// make it python
#define gcd __gcd
#define append push_back
#define str to_string
#define upper(s) transform(s.begin(), s.end(), s.begin(), ::toupper)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
#define print(arr) \
for (auto el : arr) \
cout << el << " "; \
cout << endl
// utility functions shortcuts
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define sswap(a, b) \
{ \
a = a ^ b; \
b = a ^ b; \
a = a ^ b; \
}
#define swap(a, b) \
{ \
auto temp = a; \
a = b; \
b = temp; \
}
#define init(dp) memset(dp, -1, sizeof(dp));
#define set0(dp) memset(dp, 0, sizeof(dp));
#define bits(x) __builtin_popcount(x)
#define SORT(v) sort(all(v))
#define endl "\n"
#define forr(i, n) for (ll i = 0; i < n; i++)
#define formatrix(i, n) for (ll i = 0; i < n; i++, cout << "\n")
#define eof (scanf("%d", &n)) != EOF
// declaration shortcuts
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define pll pair<ll, ll>
#define ppl pair<ll, pp>
#define ull unsigned long long
#define ll long long
#define mll map<ll, ll>
#define sll set<ll>
#define uni(v) v.erase(unique(v.begin(), v.end()), v.end());
#define ini(a, v) memset(a, v, sizeof(a))
// Constants
constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
constexpr ll INF = 1999999999999999997;
constexpr int inf = INT_MAX;
constexpr int MAXSIZE = int(1e6) + 5;
constexpr auto PI = 3.14159265358979323846L;
constexpr auto oo = numeric_limits<int>::max() / 2 - 2;
constexpr auto eps = 1e-6;
constexpr auto mod = 1000000007;
constexpr auto MOD = 1000000007;
constexpr auto MOD9 = 1000000009;
constexpr auto maxn = 100006;
// Debugging
// For reference: https://codeforces.com/blog/entry/65311
#define dbg(...) \
cout << "[" << #__VA_ARGS__ << "]: "; \
cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }
template <typename T> int SIZE(const T &t) { return t.size(); }
string to_string(string s, int x1 = 0, int x2 = 1e9) {
return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(char c) { return string({c}); }
template <size_t N> string to_string(bitset<N> &b, int x1 = 0, int x2 = 1e9) {
string t = "";
for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
__iii__ <= __jjj__; ++__iii__) {
t += b[__iii__] + '0';
}
return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B> string to_string(pair<A, B> &p) {
l_v_l_v_l++;
string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
l_v_l_v_l--;
return res;
}
template <typename A, typename... C>
string to_string(A(&v), int x1, int x2, C... coords) {
int rnk = rank<A>::value;
string tab(t_a_b_s, ' ');
string res = "";
bool first = true;
if (l_v_l_v_l == 0)
res += n_l;
res += tab + "[";
x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
auto l = begin(v);
advance(l, x1);
auto r = l;
advance(r, (x2 - x1) + (x2 < SIZE(v)));
for (auto e = l; e != r; e = next(e)) {
if (!first) {
res += ", ";
}
first = false;
l_v_l_v_l++;
if (e != l) {
if (rnk > 1) {
res += n_l;
t_a_b_s = l_v_l_v_l;
};
} else {
t_a_b_s = 0;
}
res += to_string(*e, coords...);
l_v_l_v_l--;
}
res += "]";
if (l_v_l_v_l == 0)
res += n_l;
return res;
}
void dbgs() { ; }
template <typename Heads, typename... Tails> void dbgs(Heads H, Tails... T) {
cout << to_string(H) << " | ";
dbgs(T...);
}
#define dbgm(...) \
cout << "[" << #__VA_ARGS__ << "]: "; \
dbgs(__VA_ARGS__); \
cout << endl;
#define n_l '\n'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
vll v(n + 1, 0);
vll ans(n + 1, 0);
ans[0] = 0;
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int i = n; i > 0; i--) {
ll nxt = 0;
for (int j = 2 * i; j <= n; j += i) {
nxt += ans[j];
}
nxt %= 2;
ans[i] = (nxt != v[i]);
}
cout << accumulate(ans.begin() + 1, ans.end(), 0) << endl;
for (int i = 1; i <= n; i++)
if (ans[i])
cout << i << " ";
}
| [
"call.function.change",
"io.output.change",
"expression.operation.binary.remove"
] | 779,200 | 779,201 | u996003680 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[i];
if (cnt % 2 != a[i])
k[i] = 1, ++m;
}
if (m) {
cout << m << endl;
for (int i = 1; i <= n; ++i)
if (k[i])
cout << i << " ";
cout << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[j];
if (cnt % 2 != a[i])
k[i] = 1, ++m;
}
if (m) {
cout << m << endl;
for (int i = 1; i <= n; ++i)
if (k[i])
cout << i << " ";
cout << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,204 | 779,205 | u032723841 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i; j <= n; j += i)
cnt += k[i];
if (cnt % 2 != a[i])
k[i] = 1, ++m;
}
if (m) {
cout << m << endl;
for (int i = 1; i <= n; ++i)
if (k[i])
cout << i << " ";
cout << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[j];
if (cnt % 2 != a[i])
k[i] = 1, ++m;
}
if (m) {
cout << m << endl;
for (int i = 1; i <= n; ++i)
if (k[i])
cout << i << " ";
cout << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,206 | 779,205 | u032723841 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[i];
if ((cnt & 1) ^ a[i])
k[i] = 1, ++m;
}
if (m) {
cout << m << endl;
for (int i = 1; i <= n; ++i)
if (k[i])
cout << i << " ";
cout << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[j];
if (cnt % 2 != a[i])
k[i] = 1, ++m;
}
if (m) {
cout << m << endl;
for (int i = 1; i <= n; ++i)
if (k[i])
cout << i << " ";
cout << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 779,207 | 779,205 | u032723841 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[i];
if ((cnt % 2) != a[i])
k[i] = 1, ++m;
}
if (m) {
cout << m << endl;
for (int i = 1; i <= n; ++i)
if (k[i])
cout << i << " ";
cout << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n, a[200001], k[200001];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int m = 0;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += k[j];
if (cnt % 2 != a[i])
k[i] = 1, ++m;
}
if (m) {
cout << m << endl;
for (int i = 1; i <= n; ++i)
if (k[i])
cout << i << " ";
cout << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 779,208 | 779,205 | u032723841 | cpp |
p02972 | // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n, c = 0;
cin >> n;
vector<int> arr(n + 1), ans(n + 1);
for (int i = 1; i <= n; i++)
cin >> arr[i];
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j < n; j += i)
cnt += ans[j];
if (cnt % 2 != arr[i])
ans[i] = 1, c++;
}
cout << c << endl;
for (int i = 1; i <= n && c > 0; i++)
if (ans[i])
cout << i << " ";
return 0;
}
| // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n, c = 0;
cin >> n;
vector<int> arr(n + 1), ans(n + 1);
for (int i = 1; i <= n; i++)
cin >> arr[i];
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i)
cnt += ans[j];
if (cnt % 2 != arr[i])
ans[i] = 1, c++;
}
cout << c << endl;
for (int i = 1; i <= n && c > 0; i++)
if (ans[i])
cout << i << " ";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,209 | 779,210 | u692176965 | cpp |
p02972 | // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n, c = 0;
cin >> n;
vector<int> arr(n + 1), ans(n + 1);
for (int i = 1; i <= n; i++)
cin >> arr[i];
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j < n; j += i)
cnt += ans[j];
if (cnt % 2 != arr[i])
ans[i] = 1, c++;
}
cout << c << endl;
for (int i = 1; i <= n && c > 0; i++, c--)
if (ans[i])
cout << i << " ";
return 0;
}
| // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n, c = 0;
cin >> n;
vector<int> arr(n + 1), ans(n + 1);
for (int i = 1; i <= n; i++)
cin >> arr[i];
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i)
cnt += ans[j];
if (cnt % 2 != arr[i])
ans[i] = 1, c++;
}
cout << c << endl;
for (int i = 1; i <= n && c > 0; i++)
if (ans[i])
cout << i << " ";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.update.change"
] | 779,211 | 779,210 | u692176965 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> yakusu(int n) {
vector<int> result;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
result.push_back(i);
if (i != n / i) {
result.push_back(n / i);
}
}
}
sort(result.begin(), result.end());
return result;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
vector<int> b(n + 1, 0);
vector<int> y;
for (int i = n; i > 0; i--) {
b[i] ^= a[i];
y = yakusu(i);
for (int e = 0; e < y.size() - 1; e++) {
b[e] += b[i];
b[e] %= 2;
// cout << e << " " <<b[e] << "\n";
}
}
cout << count(b.begin(), b.end(), 1) << "\n";
string s = "";
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1) {
s += to_string(i) + " ";
}
}
cout << s.substr(0, s.length() - 1);
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> yakusu(int n) {
vector<int> result;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
result.push_back(i);
if (i != n / i) {
result.push_back(n / i);
}
}
}
sort(result.begin(), result.end());
return result;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
vector<int> b(n + 1, 0);
vector<int> y;
for (int i = n; i > 0; i--) {
b[i] ^= a[i];
y = yakusu(i);
for (int e = 0; e < y.size() - 1; e++) {
b[y[e]] += b[i];
b[y[e]] %= 2;
// cout << e << " " <<b[e] << "\n";
}
}
cout << count(b.begin(), b.end(), 1) << "\n";
string s = "";
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1) {
s += to_string(i) + " ";
}
}
cout << s.substr(0, s.length() - 1);
return 0;
} | [] | 779,214 | 779,215 | u626881915 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using v = vector<T>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = unordered_map<T, K>;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll e5 = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto &i : mp)
#define eb emplace_back
#define F first
#define S second
#define all(obj) (obj).begin(), (obj).end()
template <class T> void dump_debug(T list) {
#ifdef MY_DEBUG
each(e, list) cout << e << " ";
printf("\n");
#endif
}
inline ll inl() {
ll x;
cin >> x;
return x;
}
inline string ins() {
string x;
cin >> x;
return x;
}
/* ------------- ANSWER ------------- */
/* ---------------------------------- */
// 素因数分解
map<ll, ll> prime_factor(ll n) {
map<ll, ll> mp;
for (ll i = 2; i * i <= n; ++i) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n != 1)
mp[n]++;
return mp;
}
// 素数判定
bool is_prime(ll n) {
for (int i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return n != 1;
}
// 約数列挙
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.emplace_back(i);
if (i != n / i)
res.emplace_back(n / i);
}
}
return res;
}
int main() {
#ifdef MY_DEBUG
while (true) {
#endif
ll n = inl();
vl a(n);
rep(i, n) { cin >> a[i]; }
vl sums(n);
v<bool> add(n, false);
for (long long i = n - 1; i >= 1; --i) {
vl pri = divisor(i + 1);
if (a[i] == 1) {
if (sums[i] % 2 == 1) {
} else {
add[i] = true;
each(e, pri) { sums[e - 1]++; }
}
} else {
if (sums[i] % 2 == 1) {
add[i] = true;
each(e, pri) { sums[e - 1]++; }
} else {
}
}
}
ll ss = 0;
rep(i, n) ss += sums[i];
ll ans = 0;
vl ansv;
if (a[0] == 1) {
if (ss % 2 == 0) {
ans++;
ansv.eb(1);
for (long long i = 1; i < n; ++i) {
if (add[i]) {
ansv.eb(i + 1);
ans++;
}
}
} else {
for (long long i = 1; i < n; ++i) {
if (add[i]) {
ansv.eb(i + 1);
ans++;
}
}
}
} else {
if (ss % 2 == 0) {
for (long long i = 1; i < n; ++i) {
if (add[i]) {
ansv.eb(i + 1);
ans++;
}
}
} else {
ans++;
ansv.eb(1);
for (long long i = 1; i < n; ++i) {
if (add[i]) {
ansv.eb(i + 1);
ans++;
}
}
}
}
cout << ans << endl;
each(e, ansv) { cout << e << " "; }
#ifdef MY_DEBUG
}
#endif
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using v = vector<T>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = unordered_map<T, K>;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll e5 = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto &i : mp)
#define eb emplace_back
#define F first
#define S second
#define all(obj) (obj).begin(), (obj).end()
template <class T> void dump_debug(T list) {
#ifdef MY_DEBUG
each(e, list) cout << e << " ";
printf("\n");
#endif
}
inline ll inl() {
ll x;
cin >> x;
return x;
}
inline string ins() {
string x;
cin >> x;
return x;
}
/* ------------- ANSWER ------------- */
/* ---------------------------------- */
// 素因数分解
map<ll, ll> prime_factor(ll n) {
map<ll, ll> mp;
for (ll i = 2; i * i <= n; ++i) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n != 1)
mp[n]++;
return mp;
}
// 素数判定
bool is_prime(ll n) {
for (int i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return n != 1;
}
// 約数列挙
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.emplace_back(i);
if (i != n / i)
res.emplace_back(n / i);
}
}
return res;
}
int main() {
#ifdef MY_DEBUG
while (true) {
#endif
ll n = inl();
vl a(n);
rep(i, n) { cin >> a[i]; }
vl sums(n);
v<bool> add(n, false);
for (long long i = n - 1; i >= 1; --i) {
vl pri = divisor(i + 1);
if (a[i] == 1) {
if (sums[i] % 2 == 1) {
} else {
add[i] = true;
each(e, pri) { sums[e - 1]++; }
}
} else {
if (sums[i] % 2 == 1) {
add[i] = true;
each(e, pri) { sums[e - 1]++; }
} else {
}
}
}
ll ss = 0;
rep(i, n) ss += add[i];
ll ans = 0;
vl ansv;
if (a[0] == 1) {
if (ss % 2 == 0) {
ans++;
ansv.eb(1);
for (long long i = 1; i < n; ++i) {
if (add[i]) {
ansv.eb(i + 1);
ans++;
}
}
} else {
for (long long i = 1; i < n; ++i) {
if (add[i]) {
ansv.eb(i + 1);
ans++;
}
}
}
} else {
if (ss % 2 == 0) {
for (long long i = 1; i < n; ++i) {
if (add[i]) {
ansv.eb(i + 1);
ans++;
}
}
} else {
ans++;
ansv.eb(1);
for (long long i = 1; i < n; ++i) {
if (add[i]) {
ansv.eb(i + 1);
ans++;
}
}
}
}
cout << ans << endl;
each(e, ansv) { cout << e << " "; }
#ifdef MY_DEBUG
}
#endif
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 779,222 | 779,223 | u136378781 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int mp[200001] = {};
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int j = n; j >= 1; j--) {
if ((mp[j] + a[j]) % 2 == 1) {
b[j] += 1;
cnt++;
for (long long i = 1; i * i <= j; i++) {
if (j % i == 0) {
mp[i]++;
if (i * i != j)
mp[j / i]++;
}
}
}
}
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << b[i] << " ";
}
} | #include <bits/stdc++.h>
using namespace std;
int mp[200001] = {};
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int j = n; j >= 1; j--) {
if ((mp[j] + a[j]) % 2 == 1) {
b[j] += 1;
cnt++;
for (long long i = 1; i * i <= j; i++) {
if (j % i == 0) {
mp[i]++;
if (i * i != j)
mp[j / i]++;
}
}
}
}
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << i << " ";
}
} | [] | 779,227 | 779,228 | u546943614 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define vec vector
int main(void) {
int n;
cin >> n;
vec<int> a(n + 1), b(n + 1, 0);
rep(i, n) cin >> a[i + 1];
for (int i = n; i > 0; i--) {
int m = n / i;
int sum = 0;
for (int j = 2; j <= m; j++)
sum += b[j];
b[i] = (a[i] == sum) ? 0 : 1;
}
int c = 0;
rep(i, n) {
if (b[i + 1])
c++;
}
cout << c << endl;
rep(i, n) {
if (b[i + 1])
cout << i + 1 << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define vec vector
int main(void) {
int n;
cin >> n;
vec<int> a(n + 1), b(n + 1, 0);
rep(i, n) cin >> a[i + 1];
for (int i = n; i > 0; i--) {
int m = n / i;
int sum = 0;
for (int j = 2; j <= m; j++)
sum += b[i * j];
b[i] = (a[i] == sum % 2) ? 0 : 1;
}
int c = 0;
rep(i, n) {
if (b[i + 1])
c++;
}
cout << c << endl;
rep(i, n) {
if (b[i + 1])
cout << i + 1 << endl;
}
return 0;
}
| [
"assignment.change",
"control_flow.loop.for.condition.change"
] | 779,231 | 779,230 | u433219236 | cpp |
p02972 | #include <cstdio>
#define ran 202202
int n;
int a[ran], b[ran];
int v[ran], lv;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
lv = 0;
for (int i = n; i > 0; i--) {
b[i] = a[i];
for (int j = i + i; j <= n; j += i)
b[i] ^= a[j];
if (b[i] > 0)
v[lv++] = i;
}
printf("%d\n", lv);
for (int i = lv - 1; i >= 0; i--)
printf("%d%c", v[i], i > 0 ? ' ' : '\n');
return 0;
} | #include <cstdio>
#define ran 202202
int n;
int a[ran], b[ran];
int v[ran], lv;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
lv = 0;
for (int i = n; i > 0; i--) {
b[i] = a[i];
for (int j = i + i; j <= n; j += i)
b[i] ^= b[j];
if (b[i] > 0)
v[lv++] = i;
}
printf("%d\n", lv);
for (int i = lv - 1; i >= 0; i--)
printf("%d%c", v[i], i > 0 ? ' ' : '\n');
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 779,232 | 779,233 | u534772498 | cpp |
p02972 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef ULLONG
typedef unsigned long long ULLONG;
#endif
#ifndef LLONG
typedef long long LLONG;
#endif
template <class _T> static _T tp_abs(const _T &a) {
return ((a < 0) ? (a * -1) : a);
}
template <class _T> static _T tp_min(_T a, _T b) { return a < b ? a : b; }
template <class _T> static _T tp_max(_T a, _T b) { return a > b ? a : b; }
template <class _T> static void get1int(_T &a) {
const char *fmt = " %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld";
}
if (scanf(fmt, &a) < 0) {
printf("g1int Error\n");
}
}
template <class _T> static void get2int(_T &a, _T &b) {
const char *fmt = " %d %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld %lld";
}
if (scanf(fmt, &a, &b) < 0) {
printf("g2int Error\n");
}
}
template <class _T> static void get3int(_T &a, _T &b, _T &c) {
const char *fmt = " %d %d %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld %lld %lld";
}
if (scanf(fmt, &a, &b, &c) < 0) {
printf("g3int Error\n");
}
}
static void getstring(char *buff) {
if (scanf(" %s", buff) < 0) {
printf("getstr error!\n");
}
}
static void D_task();
int main() {
D_task();
fflush(stdout);
return 0;
}
class d_data {
public:
int val = 0;
int ball = 0;
};
static void D_task() {
int N;
get1int(N);
auto seqA = new d_data[N + 1];
for (int i = 1; i <= N; i++) {
get1int(seqA[i].val);
}
int putCount = 0;
for (int i = N; i > 0; i--) {
int sum = 0;
for (int j = i; j <= N; j += i) {
sum += seqA[j].ball;
}
if (sum % 2 != seqA[i].val) {
seqA[i].ball = 1;
putCount++;
}
}
printf("%d\n", putCount);
LLONG out = 0;
if (putCount > 0) {
for (int i = 1; i <= N; i++) {
if (seqA[i].ball) {
if (out > 0)
printf(" ");
printf("%d", seqA[i].val);
out++;
}
}
printf("\n");
}
delete[] seqA;
}
|
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef ULLONG
typedef unsigned long long ULLONG;
#endif
#ifndef LLONG
typedef long long LLONG;
#endif
template <class _T> static _T tp_abs(const _T &a) {
return ((a < 0) ? (a * -1) : a);
}
template <class _T> static _T tp_min(_T a, _T b) { return a < b ? a : b; }
template <class _T> static _T tp_max(_T a, _T b) { return a > b ? a : b; }
template <class _T> static void get1int(_T &a) {
const char *fmt = " %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld";
}
if (scanf(fmt, &a) < 0) {
printf("g1int Error\n");
}
}
template <class _T> static void get2int(_T &a, _T &b) {
const char *fmt = " %d %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld %lld";
}
if (scanf(fmt, &a, &b) < 0) {
printf("g2int Error\n");
}
}
template <class _T> static void get3int(_T &a, _T &b, _T &c) {
const char *fmt = " %d %d %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld %lld %lld";
}
if (scanf(fmt, &a, &b, &c) < 0) {
printf("g3int Error\n");
}
}
static void getstring(char *buff) {
if (scanf(" %s", buff) < 0) {
printf("getstr error!\n");
}
}
static void D_task();
int main() {
D_task();
fflush(stdout);
return 0;
}
class d_data {
public:
int val = 0;
int ball = 0;
};
static void D_task() {
int N;
get1int(N);
auto seqA = new d_data[N + 1];
for (int i = 1; i <= N; i++) {
get1int(seqA[i].val);
}
int putCount = 0;
for (int i = N; i > 0; i--) {
int sum = 0;
for (int j = i; j <= N; j += i) {
sum += seqA[j].ball;
}
if (sum % 2 != seqA[i].val) {
seqA[i].ball = 1;
putCount++;
}
}
printf("%d\n", putCount);
LLONG out = 0;
if (putCount > 0) {
for (int i = 1; i <= N; i++) {
if (seqA[i].ball) {
if (out > 0)
printf(" ");
printf("%d", i);
out++;
}
}
printf("\n");
}
delete[] seqA;
}
| [] | 779,239 | 779,240 | u887675488 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> ans(n + 1);
int sum = 0;
for (int i = n; i >= 1; i--) {
int count = 0, j = 2;
while (i * j < n + 1) {
count += ans.at(i * j);
j++;
}
if (count % 2 != a.at(i)) {
ans.at(i) = 1;
sum++;
}
}
cout << sum << endl;
for (int i = 1; i < n + 1; i++) {
if (ans.at(i) == 1)
cout << a.at(i) << " ";
}
cout << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> ans(n + 1);
int sum = 0;
for (int i = n; i >= 1; i--) {
int count = 0, j = 2;
while (i * j < n + 1) {
count += ans.at(i * j);
j++;
}
if (count % 2 != a.at(i)) {
ans.at(i) = 1;
sum++;
}
}
cout << sum << endl;
for (int i = 1; i < n + 1; i++) {
if (ans.at(i) == 1)
cout << i << " ";
}
cout << endl;
return 0;
}
| [
"call.remove",
"call.arguments.change"
] | 779,250 | 779,251 | u324549724 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<int> A(N);
vector<int> C(N, 0);
vector<int> B(0);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int j = N - 1; j > -1; j--) {
int l = j + 1;
int X = N / l;
int Y = 0;
for (int i = X; i > 1; i--)
Y += C[i * (l - 1)];
if (Y % 2 != A[j]) {
B.push_back(j + 1);
C[j] = 1;
}
}
int Z = B.size();
cout << Z << endl;
for (int i = 0; i < Z; i++) {
cout << B[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<int> A(N);
vector<int> C(N, 0);
vector<int> B(0);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int j = N - 1; j > -1; j--) {
int l = j + 1;
int X = N / l;
int Y = 0;
for (int i = X; i > 1; i--)
Y += C[i * l - 1];
if (Y % 2 != A[j]) {
B.push_back(j + 1);
C[j] = 1;
}
}
int Z = B.size();
cout << Z << endl;
for (int i = 0; i < Z; i++) {
cout << B[i] << endl;
}
}
| [] | 779,252 | 779,253 | u618604643 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<int> A(N);
vector<int> C(N, 0);
vector<int> B(0);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int j = N - 1; j > -1; j--) {
int l = j + 1;
int X = N / l;
int Y = 0;
for (int i = X; i > 1; i--)
Y += C[i * l];
if (Y % 2 != A[j]) {
B.push_back(j + 1);
C[j] = 1;
}
}
int Z = B.size();
cout << Z << endl;
for (int i = 0; i < Z; i++) {
cout << B[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<int> A(N);
vector<int> C(N, 0);
vector<int> B(0);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int j = N - 1; j > -1; j--) {
int l = j + 1;
int X = N / l;
int Y = 0;
for (int i = X; i > 1; i--)
Y += C[i * l - 1];
if (Y % 2 != A[j]) {
B.push_back(j + 1);
C[j] = 1;
}
}
int Z = B.size();
cout << Z << endl;
for (int i = 0; i < Z; i++) {
cout << B[i] << endl;
}
}
| [
"assignment.change"
] | 779,255 | 779,253 | u618604643 | cpp |
p02972 | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
ll N;
ll sum = 0;
cin >> N;
vector<ll> arr(N);
for (ll i = 0; i < N; i++) {
cin >> arr[i];
}
vector<ll> ar(N + 1, 0);
for (ll i = N; i >= 1; i--) {
sum = 0;
for (ll j = i; j <= N; j += (i)) {
sum ^= ar[j];
}
if (sum != arr[i - 1]) {
ar[i] = 1;
}
}
vector<ll> r;
for (ll i = 1; i <= N; i++)
if (ar[i])
r.push_back(ar[i]);
cout << r.size() << endl;
for (auto i : r)
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
ll N;
ll sum = 0;
cin >> N;
vector<ll> arr(N);
for (ll i = 0; i < N; i++) {
cin >> arr[i];
}
vector<ll> ar(N + 1, 0);
for (ll i = N; i >= 1; i--) {
sum = 0;
for (ll j = i; j <= N; j += (i)) {
sum += ar[j];
}
if (sum % 2 != arr[i - 1]) {
ar[i] = 1;
}
}
vector<ll> r;
for (ll i = 1; i <= N; i++)
if (ar[i])
r.push_back(i);
cout << r.size() << endl;
for (auto i : r)
cout << i << endl;
return 0;
} | [
"expression.operator.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 779,256 | 779,257 | u267902533 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int c;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
}
for (int i = N; i >= 1; i--) {
c = 0;
for (int j = 2; j <= N / i; j++) {
c += B.at(i * j);
}
if (c / 2 == A.at(i)) {
B.at(i) = 0;
} else {
B.at(i) = 1;
}
}
c = 0;
for (int i = 1; i <= N; i++) {
if (B.at(i) == 1) {
c++;
}
}
if (c > 0) {
cout << c << endl;
for (int i = 1; i <= N; i++) {
if (B.at(i) == 1) {
cout << i << " ";
}
}
}
else {
cout << 0;
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int c;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
}
for (int i = N; i >= 1; i--) {
c = 0;
for (int j = 2; j <= N / i; j++) {
c += B.at(i * j);
}
if (c % 2 == A.at(i)) {
B.at(i) = 0;
} else {
B.at(i) = 1;
}
}
c = 0;
for (int i = 1; i <= N; i++) {
if (B.at(i) == 1) {
c++;
}
}
if (c > 0) {
cout << c << endl;
for (int i = 1; i <= N; i++) {
if (B.at(i) == 1) {
cout << i << " ";
}
}
}
else {
cout << 0;
}
cout << endl;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 779,258 | 779,259 | u072774815 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define M_DEBUG if (0)
int L_MAX = 2 * 100000;
int main() {
int n = 0;
cin >> n;
assert(1 <= n && n <= L_MAX);
vector<int> a_list;
a_list.push_back(-1); // 問題のインデックスと一致させたいので 1 から始める
for (int i = 0; i < n; i++) {
int a;
cin >> a;
assert(a == 0 || a == 1);
a_list.push_back(a);
}
vector<int> box_list(n + 1, -1); // 問題のインデックスと一致させたいので 1
// から始める。そのため一戸余計に確保
int count = 0;
// 尻から決めていく
for (int i = n; i > 0; i--) {
M_DEBUG cout << "i = " << i << endl;
int sum_i = 0;
// box_list[j] = 0/1 で分岐
for (int j = i + i; j < n; j += i) {
M_DEBUG cout << "\tsum[" << i << "] += box_list[" << j
<< "] : " << box_list[j] << endl;
sum_i += box_list[j];
}
if (sum_i % 2 == a_list[i]) { // box_list[j] = 0 と仮定する√
box_list[i] = 0;
} else { // box_list[j] = 1 と仮定する√
box_list[i] = 1;
M_DEBUG cout << "\tsum[" << i << "] += box_list[" << i
<< "] : " << box_list[i] << endl;
sum_i += box_list[i];
count++;
}
M_DEBUG cout << "\tsum[" << i << "] = " << sum_i << endl;
M_DEBUG cout << "\ta_list[" << i << "] = " << a_list[i] << endl;
if (sum_i % 2 != a_list[i]) {
// いい入れ方が存在しない
cout << "-1" << endl;
return 0;
}
}
cout << count << endl;
if (count > 0) {
for (int i = 1; i <= n; i++) {
if (box_list[i] == 1) {
cout << i << " ";
}
}
cout << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define M_DEBUG if (0)
int L_MAX = 2 * 100000;
int main() {
int n = 0;
cin >> n;
assert(1 <= n && n <= L_MAX);
vector<int> a_list;
a_list.push_back(-1); // 問題のインデックスと一致させたいので 1 から始める
for (int i = 0; i < n; i++) {
int a;
cin >> a;
assert(a == 0 || a == 1);
a_list.push_back(a);
}
vector<int> box_list(n + 1, -1); // 問題のインデックスと一致させたいので 1
// から始める。そのため一戸余計に確保
int count = 0;
// 尻から決めていく
for (int i = n; i > 0; i--) {
M_DEBUG cout << "i = " << i << endl;
int sum_i = 0;
// box_list[j] = 0/1 で分岐
for (int j = i + i; j <= n; j += i) {
M_DEBUG cout << "\tsum[" << i << "] += box_list[" << j
<< "] : " << box_list[j] << endl;
sum_i += box_list[j];
}
if (sum_i % 2 == a_list[i]) { // box_list[j] = 0 と仮定する√
box_list[i] = 0;
} else { // box_list[j] = 1 と仮定する√
box_list[i] = 1;
M_DEBUG cout << "\tsum[" << i << "] += box_list[" << i
<< "] : " << box_list[i] << endl;
sum_i += box_list[i];
count++;
}
M_DEBUG cout << "\tsum[" << i << "] = " << sum_i << endl;
M_DEBUG cout << "\ta_list[" << i << "] = " << a_list[i] << endl;
if (sum_i % 2 != a_list[i]) {
// いい入れ方が存在しない
cout << "-1" << endl;
return 0;
}
}
cout << count << endl;
if (count > 0) {
for (int i = 1; i <= n; i++) {
if (box_list[i] == 1) {
cout << i << " ";
}
}
cout << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,280 | 779,281 | u861890385 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
vector<int> c;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int count = 0;
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j < n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
for (int i = 1; i <= n; i++) {
if (b[i])
c.push_back(i);
}
cout << c.size() << endl;
for (int i = 0; i < c.size(); i++) {
printf("%d%c", c[i], i + 1 == c.size() ? '\n' : ' ');
}
cout << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
vector<int> c;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int count = 0;
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
for (int i = 1; i <= n; i++) {
if (b[i])
c.push_back(i);
}
cout << c.size() << endl;
for (int i = 0; i < c.size(); i++) {
printf("%d%c", c[i], i + 1 == c.size() ? '\n' : ' ');
}
cout << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,282 | 779,283 | u125693891 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
vector<int> c;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int count = 0;
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j < n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
for (int i = 1; i <= n; i++) {
if (b[i])
c.push_back(i);
}
cout << c.size() << endl;
for (int i = 0; i < c.size(); i++) {
printf("%d%c", c[i], i == c.size() ? '\n' : ' ');
}
cout << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
vector<int> c;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int count = 0;
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
for (int i = 1; i <= n; i++) {
if (b[i])
c.push_back(i);
}
cout << c.size() << endl;
for (int i = 0; i < c.size(); i++) {
printf("%d%c", c[i], i + 1 == c.size() ? '\n' : ' ');
}
cout << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 779,284 | 779,283 | u125693891 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<bool> ans(N + 1, false);
int num = 0;
bool all_zero = true;
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
if (A.at(i) == 1)
all_zero = false;
}
for (int i = N; i >= 1; i--) {
if (i >= N / 2 + 1) {
if (A.at(N) == 1) {
ans.at(i) = true;
num++;
}
} else {
int m = (N / i) * i, sum = 0;
while (m > i) {
sum += A.at(m);
m -= i;
}
if (sum % 2 != A.at(i)) {
num++;
ans.at(i) = true;
A.at(i) = 1;
} else {
A.at(i) = 0;
}
}
}
if (all_zero) {
cout << 0 << endl;
} else {
if (num == 0) {
cout << -1 << endl;
} else {
cout << num << endl;
}
}
for (int i = 1; i <= N; i++) {
if (ans.at(i))
cout << i << " ";
}
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<bool> ans(N + 1, false);
int num = 0;
bool all_zero = true;
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
if (A.at(i) == 1)
all_zero = false;
}
for (int i = N; i >= 1; i--) {
if (i >= N / 2 + 1) {
if (A.at(i) == 1) {
ans.at(i) = true;
num++;
}
} else {
int m = (N / i) * i, sum = 0;
while (m > i) {
sum += A.at(m);
m -= i;
}
if (sum % 2 != A.at(i)) {
num++;
ans.at(i) = true;
A.at(i) = 1;
} else {
A.at(i) = 0;
}
}
}
if (all_zero) {
cout << 0 << endl;
} else {
if (num == 0) {
cout << -1 << endl;
} else {
cout << num << endl;
}
}
for (int i = 1; i <= N; i++) {
if (ans.at(i))
cout << i << " ";
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,294 | 779,295 | u372299304 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<bool> ans(N + 1, false);
int num = 0;
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
}
for (int i = N; i >= 1; i--) {
if (i >= N / 2 + 1) {
if (A.at(i) == 1) {
ans.at(i) = true;
num++;
}
} else {
int m = (N / i) * i, sum = 0;
while (m > i) {
if (ans.at(i))
sum++;
m -= i;
}
if (sum % 2 != A.at(i)) {
num++;
ans.at(i) = true;
}
}
}
cout << num << endl;
for (int i = 1; i <= N; i++) {
if (ans.at(i))
cout << i << " ";
}
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<bool> ans(N + 1, false);
int num = 0;
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
}
for (int i = N; i >= 1; i--) {
if (i >= N / 2 + 1) {
if (A.at(i) == 1) {
ans.at(i) = true;
num++;
}
} else {
int m = (N / i) * i, sum = 0;
while (m > i) {
if (ans.at(m))
sum++;
m -= i;
}
if (sum % 2 != A.at(i)) {
num++;
ans.at(i) = true;
}
}
}
cout << num << endl;
for (int i = 1; i <= N; i++) {
if (ans.at(i))
cout << i << " ";
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,296 | 779,297 | u372299304 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> p;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> v(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> v[i];
}
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + 1; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ v[i];
}
vector<int> res;
for (int i = 1; i <= n; i++) {
if (b[i])
res.push_back(i);
}
cout << res.size() << endl;
for (auto a : res) {
cout << a << ' ';
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> p;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> v(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> v[i];
}
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
// cout << sum << endl;
b[i] = sum ^ v[i];
}
vector<int> res;
for (int i = 1; i <= n; i++) {
if (b[i])
res.push_back(i);
}
// print(b);
cout << res.size() << endl;
for (auto a : res) {
cout << a << ' ';
}
cout << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 779,298 | 779,299 | u916743460 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
vector<int> A(200001, 0);
void So(int x) {
if (x == 1)
return;
A[0]++;
int y = sqrt(x) + 1;
for (int i = 2; i <= y; i++) {
if (x % i == 0) {
A[i - 1]++;
if (i * i != x)
A[x / i - 1]++;
}
}
}
int main() {
int N, M = 0;
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = N - 1; i >= 0; i--) {
A[i] %= 2;
if (A[i]) {
M++;
So(i + 1);
}
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (A[i])
cout << i + 1 << " ";
}
} | #include <bits/stdc++.h>
using namespace std;
vector<int> A(200001, 0);
void So(int x) {
if (x == 1)
return;
A[0]++;
int y = sqrt(x);
for (int i = 2; i <= y; i++) {
if (x % i == 0) {
A[i - 1]++;
if (i * i != x)
A[x / i - 1]++;
}
}
}
int main() {
int N, M = 0;
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = N - 1; i >= 0; i--) {
A[i] %= 2;
if (A[i]) {
M++;
So(i + 1);
}
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (A[i]) {
cout << i + 1 << " ";
}
}
} | [
"expression.operation.binary.remove"
] | 779,306 | 779,307 | u045811375 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0); // 1 origin
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b(n + 1, 0); // 1 origin
bool flag = true;
for (int i = n; i >= 1; i--) {
if (n / i < 2) {
if (a[i] == 1) {
b[i] = 1;
} else {
b[i] = 0;
}
} else {
int sum = 0;
for (int j = n; j >= i + 1; j -= i) {
sum += b[j];
}
if ((sum + 1) % 2 == a[i])
b[i] = 1;
else if ((sum + 0) % 2 == a[i])
b[i] = 0;
else {
flag = false;
break;
}
}
}
if (flag) {
int m = 0;
for (int i = 1; i <= n; i++)
m += b[i];
cout << m << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << i << ' ';
}
cout << endl;
} else {
cout << -1 << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0); // 1 origin
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> b(n + 1, 0); // 1 origin
bool flag = true;
for (int i = n; i >= 1; i--) {
if (n / i < 2) {
if (a[i] == 1) {
b[i] = 1;
} else {
b[i] = 0;
}
} else {
int sum = 0;
for (int j = n - (n % i); j >= i + 1; j -= i) {
sum += b[j];
}
if ((sum + 1) % 2 == a[i])
b[i] = 1;
else if ((sum + 0) % 2 == a[i])
b[i] = 0;
else {
flag = false;
break;
}
}
}
if (flag) {
int m = 0;
for (int i = 1; i <= n; i++)
m += b[i];
cout << m << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << i << ' ';
}
cout << endl;
} else {
cout << -1 << endl;
}
}
| [
"control_flow.loop.for.initializer.change"
] | 779,310 | 779,311 | u056123277 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
/*int r;
cin >> r;
cout << 3 * r * r;*/
/*int N, D;
cin >> N >> D;
int ans;
ans = N / (2 * D + 1) + 1;
if ( N % (2 * D + 1) == 0)ans = N / (2 * D + 1);
cout << ans;*/
/*int N;
cin >> N;
vector<pair<int, int>>a(N);
rep(i, N) {
cin >> a[i].first;
a[i].second = i;
}
sort(all(a), greater<pair<int, int>>());
int ans;
rep(i, N) {
if (i == a[0].second) {
ans = a[1].first;
}
else {
ans = a[0].first;
}
cout << ans << "\n";
}*/
int N;
cin >> N;
vector<int> a(N + 1), h(N + 1);
rep(i, N) cin >> a[i + 1];
int i, j, M = 0;
;
for (i = N; i > 0; i--) {
j = 2;
h[i] ^= a[i];
while (i * j <= N) {
h[i] ^= h[i * j];
j++;
}
if (h[i] == 1)
M++;
}
cout << M << "\n";
if (M > 0) {
rep(i, N) {
if (h[i] == 1)
cout << i << " ";
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
/*int r;
cin >> r;
cout << 3 * r * r;*/
/*int N, D;
cin >> N >> D;
int ans;
ans = N / (2 * D + 1) + 1;
if ( N % (2 * D + 1) == 0)ans = N / (2 * D + 1);
cout << ans;*/
/*int N;
cin >> N;
vector<pair<int, int>>a(N);
rep(i, N) {
cin >> a[i].first;
a[i].second = i;
}
sort(all(a), greater<pair<int, int>>());
int ans;
rep(i, N) {
if (i == a[0].second) {
ans = a[1].first;
}
else {
ans = a[0].first;
}
cout << ans << "\n";
}*/
int N;
cin >> N;
vector<int> a(N + 1), h(N + 1);
rep(i, N) cin >> a[i + 1];
int i, j, M = 0;
;
for (i = N; i > 0; i--) {
j = 2;
h[i] ^= a[i];
while (i * j <= N) {
h[i] ^= h[i * j];
j++;
}
if (h[i] == 1)
M++;
}
cout << M << "\n";
if (M > 0) {
rep(i, N) {
if (h[i + 1] == 1)
cout << i + 1 << " ";
}
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 779,334 | 779,335 | u556660175 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int n;
cin >> n;
vi a(n + 1);
vi b(n + 1);
a[0] = -1;
b[0] = -1;
int st = n / 2;
int m = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (i > st) {
b[i] = a[i];
if (a[i])
m++;
}
}
for (int i = st; i >= 1; --i) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2) {
if (a[i])
b[i] = 0;
else {
b[i] = 1;
m++;
}
} else {
if (a[i]) {
b[i] = sum;
m++;
} else
b[i] = 0;
}
}
cout << m << endl;
for (int i = 1; i <= n; ++i) {
if (b[i])
cout << i << endl;
}
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int n;
cin >> n;
vi a(n + 1);
vi b(n + 1);
a[0] = -1;
b[0] = -1;
int st = n / 2;
int m = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (i > st) {
b[i] = a[i];
if (a[i])
m++;
}
}
for (int i = st; i >= 1; --i) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2) {
if (a[i])
b[i] = 0;
else {
b[i] = 1;
m++;
}
} else {
if (a[i]) {
b[i] = 1;
m++;
} else
b[i] = 0;
}
}
cout << m << endl;
for (int i = 1; i <= n; ++i) {
if (b[i])
cout << i << endl;
}
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 779,351 | 779,352 | u209767598 | cpp |
p02972 | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
b[i] = a[i];
for (int j = i; j <= n; j += i) {
b[i] ^= b[j];
}
}
int k = 0;
for (int x : b)
k += x;
cout << k << "\n";
for (int i = 1; i <= n; i++) {
if (b[i])
cout << i << "\n";
}
return 0;
} | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
b[i] = a[i];
for (int j = i + i; j <= n; j += i) {
b[i] ^= b[j];
}
}
int k = 0;
for (int x : b)
k += x;
cout << k << "\n";
for (int i = 1; i <= n; i++) {
if (b[i])
cout << i << "\n";
}
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 779,355 | 779,356 | u136509923 | cpp |
p02972 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
#define f(i, n) for (int i = 0; i < n; ++i)
#define pb push_back
void input() {
ll n;
cin >> n;
vector<ll> a(n);
f(i, n) cin >> a[i];
vector<ll> ans(n, 0);
for (ll i = n; i >= 1; --i) {
ll cnt = 0;
for (ll j = i; j <= n; j += i) {
cnt += ans[j - 1];
}
if (cnt % 2 != a[i - 1]) {
ans[i - 1] = 1;
}
}
cout << accumulate(ans.begin(), ans.end(), 0) << endl;
f(i, n) if (ans[i] == 1) cout << ans[i] << " ";
cout << endl;
}
int main() {
input();
return 0;
}
| #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
#define f(i, n) for (int i = 0; i < n; ++i)
#define pb push_back
void input() {
ll n;
cin >> n;
vector<ll> a(n);
f(i, n) cin >> a[i];
vector<ll> ans(n, 0);
for (ll i = n; i >= 1; --i) {
ll cnt = 0;
for (ll j = i; j <= n; j += i) {
cnt += ans[j - 1];
}
if (cnt % 2 != a[i - 1]) {
ans[i - 1] = 1;
}
}
cout << accumulate(ans.begin(), ans.end(), 0) << endl;
f(i, n) if (ans[i] == 1) cout << i + 1 << " ";
cout << endl;
}
int main() {
input();
return 0;
}
| [
"io.output.change"
] | 779,358 | 779,359 | u993121447 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, j;
cin >> N;
vector<int> a(N + 1);
set<int> r;
for (i = 1; i <= N; i++)
cin >> a.at(i);
for (i = N; i >= 1; i--) {
if (i > N / 2) {
if (a.at(i))
r.insert(i);
} else {
int x = 0, j = i * 2;
while (j > N) {
if (r.count(j))
x++;
j += i;
}
if (a.at(i) != x % 2)
r.insert(i);
}
}
cout << r.size() << endl;
for (auto x : r)
cout << x << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, j;
cin >> N;
vector<int> a(N + 1);
set<int> r;
for (i = 1; i <= N; i++)
cin >> a.at(i);
for (i = N; i >= 1; i--) {
if (i > N / 2) {
if (a.at(i))
r.insert(i);
} else {
int x = 0, j = i * 2;
while (j <= N) {
if (r.count(j))
x++;
j += i;
}
if (a.at(i) != x % 2)
r.insert(i);
}
}
cout << r.size() << endl;
for (auto x : r)
cout << x << " ";
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 779,369 | 779,370 | u211109468 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<long long> vl;
signed main() {
int n, m = 0;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vector<int> a(n), b(n, 0);
rep(i, n) { cin >> a[i]; }
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = 2; j * i < n; j++) {
if (b[i * j - 1] == 1)
sum++;
}
if (a[i - 1] != sum % 2) {
b[i - 1]++;
m++;
}
}
cout << m << endl;
rep(i, n) {
if (i != 0)
cout << ' ';
if (b[i] == 1)
cout << i + 1;
}
cout << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<long long> vl;
signed main() {
int n, m = 0;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vector<int> a(n), b(n, 0);
rep(i, n) { cin >> a[i]; }
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = 2; j * i <= n; j++) {
if (b[i * j - 1] == 1)
sum++;
}
if (a[i - 1] != sum % 2) {
b[i - 1]++;
m++;
}
}
cout << m << endl;
rep(i, n) {
if (i != 0)
cout << ' ';
if (b[i] == 1)
cout << i + 1;
}
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,373 | 779,374 | u244583418 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<bool> a(n + 1);
vector<bool> b(n + 1);
vector<ll> out;
for (ll i = 1; i <= n; i++) {
ll x;
cin >> x;
if (x == 0)
a[i] = false;
else
a[i] = true;
}
ll num = n / 2;
for (ll i = num + 1; i <= n; i++) {
b[i] = a[i];
}
for (ll i = num; i >= 1; i--) {
ll cnt = 0;
ll t = 2;
for (ll j = 2 * i; j <= n; t++) {
if (b[j] == true)
cnt++;
j = t * i;
}
if (cnt % 2 == 0) {
if (a[i])
b[i] = true;
else
b[i] = false;
} else {
if (a[i])
b[i] = false;
else
b[i] = true;
}
}
for (int i = 1; i <= n; i++) {
if (b[i])
out.push_back(i);
}
cout << out.size() << endl;
if (out.size() > 0) {
for (int i = 0; i < out.size(); i++) {
if (i != 0)
cout << ' ' << out[i];
else
cout << out[i];
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<bool> a(n + 1);
vector<bool> b(n + 1);
vector<ll> out;
for (ll i = 1; i <= n; i++) {
ll x;
cin >> x;
if (x == 0)
a[i] = false;
else
a[i] = true;
}
ll num = n / 2;
for (ll i = num + 1; i <= n; i++) {
b[i] = a[i];
}
for (ll i = num; i >= 1; i--) {
ll cnt = 0;
ll t = 3;
for (ll j = 2 * i; j <= n; t++) {
if (b[j] == true)
cnt++;
j = t * i;
}
if (cnt % 2 == 0) {
if (a[i])
b[i] = true;
else
b[i] = false;
} else {
if (a[i])
b[i] = false;
else
b[i] = true;
}
}
for (int i = 1; i <= n; i++) {
if (b[i])
out.push_back(i);
}
cout << out.size() << endl;
if (out.size() > 0) {
for (int i = 0; i < out.size(); i++) {
if (i != 0)
cout << ' ' << out[i];
else
cout << out[i];
}
cout << endl;
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 779,375 | 779,376 | u855186748 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
int n;
cin >> n;
int a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
int count = 0;
int b[n + 1];
b[0] = 0;
int tama = 0;
//どこにボールを入れるか・・
bool ireru = false;
for (int i = n; i > 0; i--) {
for (int j = 2; j <= n; j++) { //倍数チェック
if (i * j > n)
break;
count += b[j * i];
}
if (a[i] == 1 && count / 2 == 0)
ireru = true;
if (a[i] == 0 && count / 2 == 1)
ireru = true;
if (ireru) {
b[i] = 1;
tama++;
} else {
b[i] = 0;
}
count = 0;
ireru = false;
}
cout << tama << endl;
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1)
cout << i << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
int n;
cin >> n;
int a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
int count = 0;
int b[n + 1];
b[0] = 0;
int tama = 0;
//どこにボールを入れるか・・
bool ireru = false;
for (int i = n; i > 0; i--) {
for (int j = 2; j <= n; j++) { //倍数チェック
if (i * j > n)
break;
count += b[j * i];
}
if (a[i] == 1 && count % 2 == 0)
ireru = true;
if (a[i] == 0 && count % 2 == 1)
ireru = true;
if (ireru) {
b[i] = 1;
tama++;
} else {
b[i] = 0;
}
count = 0;
ireru = false;
}
cout << tama << endl;
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1)
cout << i << endl;
}
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 779,379 | 779,380 | u110681742 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n, cnt = 0;
cin >> n;
vector<int> as(n), ans(n);
for (int i = 0; i < n; i++)
cin >> as[i];
for (int f = n; f >= 1; f--) {
int res = 0;
for (int j = f * 2; j <= n; j += f) {
res ^= ans[j - 1];
}
if (res ^ as[f - 1]) {
ans[f - 1] = 1;
cnt++;
}
}
cout << cnt << '\n';
for (int i = 0; i < n; i++) {
if (ans[i]) {
cout << ans[i] << ' ';
}
}
cout << '\n';
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n, cnt = 0;
cin >> n;
vector<int> as(n), ans(n);
for (int i = 0; i < n; i++)
cin >> as[i];
for (int f = n; f >= 1; f--) {
int res = 0;
for (int j = f * 2; j <= n; j += f) {
res ^= ans[j - 1];
}
if (res ^ as[f - 1]) {
ans[f - 1] = 1;
cnt++;
}
}
cout << cnt << '\n';
for (int i = 0; i < n; i++) {
if (ans[i]) {
cout << i + 1 << ' ';
}
}
cout << '\n';
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| [
"io.output.change"
] | 779,382 | 779,383 | u344412812 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
//-----------------------------------------------
//------------------------------------------------
int main() {
ll n, count;
cin >> n;
vector<ll> a(n + 1); // a[0],b[0]は考えたくない
vector<ll> b(n + 1); //はいいてたら１、からなら０
vector<ll> c(0);
rep(i, 1, n + 1) { cin >> a.at(i); }
rrep(i, n, 1) {
count = 0;
rep(k, 2, n) {
if (i * k > n)
break;
if (b.at(i * k) == 1)
count += 1;
}
if (a.at(i) == count % 2)
b.at(i) = 0;
if (a.at(i) != count % 2)
b.at(i) = 1;
if (b.at(i) == 1)
c.push_back(i);
}
cout << c.size() << endl;
rep(i, 0, c.size()) cout << c.at(i) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
//-----------------------------------------------
//------------------------------------------------
int main() {
ll n, count;
cin >> n;
vector<ll> a(n + 1); // a[0],b[0]は考えたくない
vector<ll> b(n + 1); //はいいてたら１、からなら０
vector<ll> c(0);
rep(i, 1, n + 1) { cin >> a.at(i); }
rrep(i, n, 1) {
count = 0;
rep(k, 2, n + 1) {
if (i * k > n)
break;
if (b.at(i * k) == 1)
count += 1;
}
if (a.at(i) == count % 2)
b.at(i) = 0;
if (a.at(i) != count % 2)
b.at(i) = 1;
if (b.at(i) == 1)
c.push_back(i);
}
cout << c.size() << endl;
rep(i, 0, c.size()) cout << c.at(i) << endl;
}
| [
"expression.operation.binary.add"
] | 779,386 | 779,387 | u764744362 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
//-----------------------------------------------
//------------------------------------------------
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1); // a[0],b[0]は考えたくない
vector<ll> b(n + 1); //はいいてたら１、からなら０
vector<ll> c(0);
rep(i, 1, n + 1) { cin >> a.at(i); }
rrep(i, n, 1) {
ll count = 0;
rep(k, 2, n) {
if (i * k > n)
break;
if (b.at(i * k) == 1)
count += 1;
}
if (a.at(i) == count % 2)
b.at(i) = 0;
if (a.at(i) != count % 2)
b.at(i) = 1;
if (b.at(i) == 1)
c.push_back(i);
}
cout << c.size() << endl;
rep(i, 0, c.size()) cout << c.at(i) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
//-----------------------------------------------
//------------------------------------------------
int main() {
ll n, count;
cin >> n;
vector<ll> a(n + 1); // a[0],b[0]は考えたくない
vector<ll> b(n + 1); //はいいてたら１、からなら０
vector<ll> c(0);
rep(i, 1, n + 1) { cin >> a.at(i); }
rrep(i, n, 1) {
count = 0;
rep(k, 2, n + 1) {
if (i * k > n)
break;
if (b.at(i * k) == 1)
count += 1;
}
if (a.at(i) == count % 2)
b.at(i) = 0;
if (a.at(i) != count % 2)
b.at(i) = 1;
if (b.at(i) == 1)
c.push_back(i);
}
cout << c.size() << endl;
rep(i, 0, c.size()) cout << c.at(i) << endl;
}
| [
"variable_declaration.add"
] | 779,388 | 779,387 | u764744362 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
int main(void) {
LL n;
cin >> n;
vector<LL> a(n + 1, 0);
vector<LL> ans;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (LL i = n; i >= 1; i--) {
LL count = 0;
for (LL j = i; j < n + 1; j += i) {
if (a[j] >= 1 && j != i) {
count += a[j];
}
}
if (count % 2 != a[i] % 2) {
a[i] += 1;
} else {
a[i] = 0;
}
if (a[i] >= 1) {
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (LL i = 0; i < ans.size(); i++) {
if (i == 0) {
cout << ans[i];
} else if (i == ans.size() - 1) {
cout << " " << ans[i] << endl;
} else {
cout << " " << ans[i];
}
}
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
int main(void) {
LL n;
cin >> n;
vector<LL> a(n + 1, 0);
vector<LL> ans;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (LL i = n; i >= 1; i--) {
LL count = 0;
for (LL j = i; j < n + 1; j += i) {
if (a[j] >= 1 && j != i) {
count += a[j];
}
}
if (count % 2 != a[i] % 2) {
a[i] = 1;
} else {
a[i] = 0;
}
if (a[i] >= 1) {
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (LL i = 0; i < ans.size(); i++) {
if (i == 0) {
cout << ans[i];
} else if (i == ans.size() - 1) {
cout << " " << ans[i] << endl;
} else {
cout << " " << ans[i];
}
}
return 0;
} | [
"assignment.value.change"
] | 779,389 | 779,390 | u501289321 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define rrep(i, a, b) for (ll i = b - 1; i >= a; i--)
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
rrep(i, 1, n + 1) {
for (ll j = i * 2; j <= n; j += i)
a[i] ^= a[j];
}
cout << accumulate(a.begin(), a.end(), 0ll) << endl;
rep(i, 1, n + 1) if (a[i]) cout << a[i] << ' ';
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define rrep(i, a, b) for (ll i = b - 1; i >= a; i--)
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
rrep(i, 1, n + 1) {
for (ll j = i * 2; j <= n; j += i)
a[i] ^= a[j];
}
cout << accumulate(a.begin(), a.end(), 0ll) << endl;
rep(i, 1, n + 1) if (a[i]) cout << i << ' ';
cout << endl;
}
| [] | 779,391 | 779,392 | u874644572 | cpp |
p02972 | #include <bits/stdc++.h>
const int mod = 1e9 + 7;
using LL = long long;
using namespace std;
namespace ndifix {
template <class T> void rsort(T &v) { std::sort(v.rbegin(), v.rend()); }
} // end of namespace ndifix
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> ball(n);
for (int i = n; i >= 1; i--) {
int buf = 0;
for (int j = i + i; j < n; j += i)
buf += ball[j - 1];
if ((buf % 2) != a[i - 1])
ball[i - 1] = 1;
}
vector<int> ans;
for (int i = 0; i < n; i++)
if (ball[i] != 0)
ans.push_back(i + 1);
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
const int mod = 1e9 + 7;
using LL = long long;
using namespace std;
namespace ndifix {
template <class T> void rsort(T &v) { std::sort(v.rbegin(), v.rend()); }
} // end of namespace ndifix
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> ball(n);
for (int i = n; i >= 1; i--) {
int buf = 0;
for (int j = i + i; j <= n; j += i)
buf += ball[j - 1];
if ((buf % 2) != a[i - 1])
ball[i - 1] = 1;
}
vector<int> ans;
for (int i = 0; i < n; i++)
if (ball[i] != 0)
ans.push_back(i + 1);
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,399 | 779,400 | u819160021 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
int b[N + 1];
vector<int> v;
a[0] = 0;
b[0] = 0;
int count = 0;
int tmp = 0;
for (int i = 0; i < N; i++) {
a[i + 1] = 0;
b[i + 1] = 0;
cin >> a[i + 1];
if (i >= N / 2) {
b[i + 1] = a[i + 1];
if (b[i + 1] == 1) {
count++;
v.push_back(i + 1);
}
}
}
for (int i = N / 2; i > 0; i--) {
// cout << a[i];
int total = 0;
int base = 1;
while (base * i <= N) {
total += b[base * i];
base++;
}
b[i] = (total + a[i]) % 2;
if (b[i] == 1)
count++;
v.push_back(i);
}
cout << count << endl;
// for(int i=0;i<N;i++){
// cout << b[i+1];
//}
if (count > 0) {
for (int i = 0; i < count; i++) {
cout << v[i] << " ";
}
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
int b[N + 1];
vector<int> v;
a[0] = 0;
b[0] = 0;
int count = 0;
int tmp = 0;
for (int i = 0; i < N; i++) {
a[i + 1] = 0;
b[i + 1] = 0;
cin >> a[i + 1];
if (i >= N / 2) {
b[i + 1] = a[i + 1];
if (b[i + 1] == 1) {
count++;
v.push_back(i + 1);
}
}
}
for (int i = N / 2; i > 0; i--) {
// cout << a[i];
int total = 0;
int base = 1;
while (base * i <= N) {
total += b[base * i];
base++;
}
b[i] = (total + a[i]) % 2;
if (b[i] == 1) {
count++;
v.push_back(i);
}
}
cout << count << endl;
// for(int i=0;i<N;i++){
// cout << b[i+1];
//}
if (count > 0) {
for (int i = 0; i < count; i++) {
cout << v[i] << " ";
}
}
}
| [] | 779,403 | 779,404 | u899929023 | cpp |
p02972 | // abc134_d.cpp
// Sat Jul 20 20:59:18 2019
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int last = n;
if (n % 2 == 1) {
last = n - 1;
}
int ans = 0;
vector<int> ansbox;
int a[n];
fill(a, a + n, 0);
int ball[n];
fill(ball, ball + n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i >= 0; i--) {
int temp = (i + 1) * 2;
int total = 0;
while (temp <= n) {
total += a[temp - 1];
temp = temp + (i + 1);
}
if (total % 2 != a[i]) {
ans++;
ansbox.push_back(i + 1);
a[i] = 1;
}
// cout << i+1 << " " << total << endl;
}
cout << ans << endl;
if (ans != 0) {
for (int i = 0; i < ansbox.size(); i++) {
cout << ansbox[i] << " ";
}
printf("\n");
}
} | // abc134_d.cpp
// Sat Jul 20 20:59:18 2019
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int last = n;
if (n % 2 == 1) {
last = n - 1;
}
int ans = 0;
vector<int> ansbox;
int a[n];
fill(a, a + n, 0);
int ball[n];
fill(ball, ball + n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i >= 0; i--) {
int temp = (i + 1) * 2;
int total = 0;
while (temp <= n) {
total += ball[temp - 1];
temp = temp + (i + 1);
}
if (total % 2 != a[i]) {
ans++;
ansbox.push_back(i + 1);
ball[i] = 1;
}
// cout << i+1 << " " << total << endl;
}
cout << ans << endl;
if (ans != 0) {
for (int i = 0; i < ansbox.size(); i++) {
cout << ansbox[i] << " ";
}
printf("\n");
}
} | [
"assignment.value.change",
"identifier.change",
"assignment.variable.change"
] | 779,405 | 779,406 | u628871447 | cpp |
p02972 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll;
using namespace std;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
static const int MAX = 100;
static const int INF = (1 << 23);
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
vector<int> v2(n, 0);
rep(i, n) { cin >> v[i]; }
vector<int> ans;
for (int i = n / 2 + 1; i < n; i++) {
if (v[i]) {
ans.push_back(1);
v2[i] = 1;
} else {
v2[i] = 0;
}
}
int k;
for (int i = (n) / 2; i >= 0; i--) {
k = i + 1;
int sum = 0;
for (int j = 2; j * k <= n; j++) {
sum += v2[j * k - 1];
}
if (sum % 2 == 1 && v[i] == 0) {
ans.push_back(1);
v2[i] = 1;
} else if (sum % 2 == 0 && v[i] == 1) {
ans.push_back(1);
v2[i] = 1;
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
return 0;
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll;
using namespace std;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
static const int MAX = 100;
static const int INF = (1 << 23);
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
vector<int> v2(n, 0);
rep(i, n) { cin >> v[i]; }
vector<int> ans;
for (int i = n / 2 + 1; i < n; i++) {
if (v[i]) {
ans.push_back(i + 1);
v2[i] = 1;
} else {
v2[i] = 0;
}
}
int k;
for (int i = (n) / 2; i >= 0; i--) {
k = i + 1;
int sum = 0;
for (int j = 2; j * k <= n; j++) {
sum += v2[j * k - 1];
}
if (sum % 2 == 1 && v[i] == 0) {
ans.push_back(i + 1);
v2[i] = 1;
} else if (sum % 2 == 0 && v[i] == 1) {
ans.push_back(i + 1);
v2[i] = 1;
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
return 0;
}
| [
"expression.operation.binary.add"
] | 779,413 | 779,414 | u031448582 | cpp |
p02972 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
int b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N / 2 + 1; i < N; i++) {
b[i] = a[i];
}
int ex;
for (int i = N / 2; i >= 0; i--) {
ex = 0;
// for(int j=((i+1)*2)-1;j<N;j+=i+1){
for (int j = 2 * i + 1; j < N; j += i + 1) {
ex ^= a[j];
}
b[i] = a[i] ^ ex;
}
int M = 0;
for (int i = 0; i < N; i++) {
M += b[i];
}
cout << M << endl;
if (M == 0)
exit(0);
int bout[M];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (b[i] == 1) {
bout[cnt] = i + 1;
cnt++;
}
}
for (int i = 0; i < M - 1; i++) {
cout << bout[i] << " ";
}
cout << bout[M - 1] << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
int b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = N / 2 + 1; i < N; i++) {
b[i] = a[i];
}
int ex;
for (int i = N / 2; i >= 0; i--) {
ex = 0;
// for(int j=((i+1)*2)-1;j<N;j+=i+1){
for (int j = 2 * i + 1; j < N; j += i + 1) {
ex ^= b[j];
}
b[i] = a[i] ^ ex;
}
int M = 0;
for (int i = 0; i < N; i++) {
M += b[i];
}
cout << M << endl;
if (M == 0)
exit(0);
int bout[M];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (b[i] == 1) {
bout[cnt] = i + 1;
cnt++;
}
}
for (int i = 0; i < M - 1; i++) {
cout << bout[i] << " ";
}
cout << bout[M - 1] << endl;
}
| [
"assignment.value.change",
"identifier.change"
] | 779,417 | 779,418 | u740222581 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 200000 + 5;
int a[N];
int b[N];
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i; --i) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += b[j];
if (ll(sum) * i % 2 != a[i]) {
b[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i : ans) {
printf("%d ", i);
}
return 0;
}
/*
*/
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 200000 + 5;
int a[N];
int b[N];
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i; --i) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += b[j];
if (sum % 2 != a[i]) {
b[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i : ans) {
printf("%d ", i);
}
return 0;
}
/*
*/
| [
"control_flow.loop.for.condition.change",
"call.remove",
"expression.operation.binary.remove"
] | 779,429 | 779,430 | u455472057 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 200000 + 5;
int a[N];
int b[N];
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i; --i) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += b[j];
if (ll(sum) * i % 2 != a[i]) {
b[i] = 1;
ans.push_back(1);
}
}
cout << ans.size() << endl;
for (int i : ans) {
printf("%d ", i);
}
return 0;
}
/*
*/
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 200000 + 5;
int a[N];
int b[N];
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
for (int i = n; i; --i) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += b[j];
if (sum % 2 != a[i]) {
b[i] = 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i : ans) {
printf("%d ", i);
}
return 0;
}
/*
*/
| [
"control_flow.loop.for.condition.change",
"call.remove",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 779,431 | 779,430 | u455472057 | cpp |
p02972 | // Catchharsh
// I Luv Kunj017
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define F first
#define S second
#define pb push_back
#define endl '\n'
const ll MOD = 1e9 + 7;
const ll INF = 1011111111;
const ll LLINF = 1000111000111000111LL;
const ld EPS = 1e-10;
const ld PI = 3.14159265358979323;
using namespace std;
ll power(int x, int n) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return power((x * x), n / 2);
else
return x * power((x * x), (n - 1) / 2);
}
int main() {
IOS;
ll n, m, i, j, k;
cin >> n;
vector<ll> v(n + 1);
vector<ll> ans;
int f = 0;
for (i = 1; i <= n; i++) {
cin >> v[i];
}
for (i = n; i >= 1; i--) {
for (j = i + i; j <= n; j++) {
v[i] = v[i] ^ v[j];
}
}
ll cnt = 0;
for (i = 1; i <= n; i++) {
if (v[i] != 0) {
cnt++;
ans.pb(i);
}
}
cout << cnt << endl;
for (i = 0; i < ans.size(); i++)
cout << ans[i] << " ";
} | // Catchharsh
// I Luv Kunj017
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define F first
#define S second
#define pb push_back
#define endl '\n'
const ll MOD = 1e9 + 7;
const ll INF = 1011111111;
const ll LLINF = 1000111000111000111LL;
const ld EPS = 1e-10;
const ld PI = 3.14159265358979323;
using namespace std;
ll power(int x, int n) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return power((x * x), n / 2);
else
return x * power((x * x), (n - 1) / 2);
}
int main() {
IOS;
ll n, m, i, j, k;
cin >> n;
vector<ll> v(n + 1);
vector<ll> ans;
int f = 0;
for (i = 1; i <= n; i++) {
cin >> v[i];
}
for (i = n; i >= 1; i--) {
for (j = i + i; j <= n; j = j + i) {
v[i] = v[i] ^ v[j];
}
}
ll cnt = 0;
for (i = 1; i <= n; i++) {
if (v[i] != 0) {
cnt++;
ans.pb(i);
}
}
cout << cnt << endl;
for (i = 0; i < ans.size(); i++)
cout << ans[i] << " ";
} | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 779,432 | 779,433 | u992424580 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
vector<int> c(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
b[i] = 0;
c[i] = 0;
}
// cerr << N << endl;
for (int i = N - 1; i >= 0; i--) {
// cerr << i << endl;
c[i] = 0;
if (b[i] != a[i]) {
c[i] = 1;
vector<int> ret;
for (int j = 1; j * j <= i + 1; ++j) {
if ((i + 1) % j == 0) {
ret.push_back(j);
if (j != 1 && j * j != (i + 1)) {
ret.push_back((i + 1) / j);
}
}
}
// cerr << i+1 << ": ";
for (auto j : ret) {
if (j < i)
b[j - 1] = 1 - b[j - 1];
// cerr << j << " ";
}
// cerr << endl;
// for (int j = 0; j < sqrt(i+1)-1; j++)
// {
// if( ((i+1)%(j+1)) == 0 ){
// b[j] = 1 - b[j];
// }
// }
}
// for (int j = 0; j <N ; j++)
// {
// cerr << b[j] << " ";
// }
// cerr << endl;
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (c[i] == 1) {
cnt++;
}
}
cout << cnt << endl;
for (int i = 0; i < N; i++) {
if (c[i] == 1) {
cout << i + 1 << " ";
}
}
cout << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
vector<int> c(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
b[i] = 0;
c[i] = 0;
}
// cerr << N << endl;
for (int i = N - 1; i >= 0; i--) {
// cerr << i << endl;
c[i] = 0;
if (b[i] != a[i]) {
c[i] = 1;
vector<int> ret;
for (int j = 1; j * j <= i + 1; ++j) {
if ((i + 1) % j == 0) {
ret.push_back(j);
if (j != 1 && j * j != (i + 1)) {
ret.push_back((i + 1) / j);
}
}
}
// cerr << i+1 << ": ";
for (auto j : ret) {
if (j < i + 1)
b[j - 1] = 1 - b[j - 1];
// cerr << j << " ";
}
// cerr << endl;
// for (int j = 0; j < sqrt(i+1)-1; j++)
// {
// if( ((i+1)%(j+1)) == 0 ){
// b[j] = 1 - b[j];
// }
// }
}
// for (int j = 0; j <N ; j++)
// {
// cerr << b[j] << " ";
// }
// cerr << endl;
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (c[i] == 1) {
cnt++;
}
}
cout << cnt << endl;
for (int i = 0; i < N; i++) {
if (c[i] == 1) {
cout << i + 1 << " ";
}
}
cout << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 779,436 | 779,437 | u022433269 | cpp |
p02972 | #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define FORQ(i, b, e) for (int i = (b); i <= (e); ++i)
#define FORD(i, b, e) for (int i = (b)-1; i >= (e); --i)
#define REP(x, n) for (int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
#define pii pair<int, int>
#define pll pair<LL, LL>
#define vi vector<int>
#define vii vector<vi>
const double pi = 3.14159265358979323846264;
const int mod = 1000000007;
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// std::cout << std::fixed;
// std::cout << std::setprecision(12);
// std::cout << std::defaultfloat;
int n;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans;
FOR(i, 0, n) { cin >> a[i + 1]; }
FORD(i, n + 1, 1) {
if (a[i] != 0) {
ans.PB(i);
a[i] = 0;
auto v = divisor(a[i]);
for (const auto &x : v) {
if (x == a[i])
continue;
a[x] ^= 1;
}
}
}
cout << ans.size() << endl;
for (const auto &x : ans) {
cout << x << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define FORQ(i, b, e) for (int i = (b); i <= (e); ++i)
#define FORD(i, b, e) for (int i = (b)-1; i >= (e); --i)
#define REP(x, n) for (int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
#define pii pair<int, int>
#define pll pair<LL, LL>
#define vi vector<int>
#define vii vector<vi>
const double pi = 3.14159265358979323846264;
const int mod = 1000000007;
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// std::cout << std::fixed;
// std::cout << std::setprecision(12);
// std::cout << std::defaultfloat;
int n;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans;
FOR(i, 0, n) { cin >> a[i + 1]; }
FORD(i, n + 1, 1) {
if (a[i] != 0) {
ans.PB(i);
a[i] = 0;
auto v = divisor(i);
for (const auto &x : v) {
// cerr<<x<<" ";
if (x == a[i])
continue;
a[x] ^= 1;
}
// cerr<<endl;
}
}
cout << ans.size() << endl;
for (const auto &x : ans) {
cout << x << endl;
}
return 0;
}
| [
"call.arguments.change"
] | 779,438 | 779,439 | u404075706 | cpp |
p02972 | #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define FORQ(i, b, e) for (int i = (b); i <= (e); ++i)
#define FORD(i, b, e) for (int i = (b)-1; i >= (e); --i)
#define REP(x, n) for (int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
#define pii pair<int, int>
#define pll pair<LL, LL>
#define vi vector<int>
#define vii vector<vi>
const double pi = 3.14159265358979323846264;
const int mod = 1000000007;
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// std::cout << std::fixed;
// std::cout << std::setprecision(12);
// std::cout << std::defaultfloat;
int n;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans;
FOR(i, 0, n) { cin >> a[i + 1]; }
FORD(i, n + 1, 1) {
if (a[i] != 0) {
ans.PB(i);
a[i] = 0;
}
auto v = divisor(a[i]);
for (const auto &x : v) {
if (x == a[i])
continue;
a[x] ^= 1;
}
}
cout << ans.size() << endl;
for (const auto &x : ans) {
cout << x << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define FORQ(i, b, e) for (int i = (b); i <= (e); ++i)
#define FORD(i, b, e) for (int i = (b)-1; i >= (e); --i)
#define REP(x, n) for (int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
#define pii pair<int, int>
#define pll pair<LL, LL>
#define vi vector<int>
#define vii vector<vi>
const double pi = 3.14159265358979323846264;
const int mod = 1000000007;
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// std::cout << std::fixed;
// std::cout << std::setprecision(12);
// std::cout << std::defaultfloat;
int n;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans;
FOR(i, 0, n) { cin >> a[i + 1]; }
FORD(i, n + 1, 1) {
if (a[i] != 0) {
ans.PB(i);
a[i] = 0;
auto v = divisor(i);
for (const auto &x : v) {
// cerr<<x<<" ";
if (x == a[i])
continue;
a[x] ^= 1;
}
// cerr<<endl;
}
}
cout << ans.size() << endl;
for (const auto &x : ans) {
cout << x << endl;
}
return 0;
}
| [
"call.arguments.change"
] | 779,440 | 779,439 | u404075706 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pi 3.14159265358979323846264
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<long long>
#define vpii vector<pair<int, int>>
#define ll long long
#define fi first
#define se second
#define FOR(i, x, y) for (int i = x; i <= y; i++)
#define FORI(i, y, x) for (int i = y; i >= x; i--)
#define debug printf("OK\n")
int n, a[200005], c[200005];
vector<int> v;
int main() {
cin >> n;
FOR(i, 1, n) cin >> a[i];
int k = n / 2 + n % 2;
FOR(i, k, n) {
c[i] = a[i];
if (a[i] == 1)
v.pb(i);
}
for (int i = k - 1; i >= 1; i--) {
int cnt = 0;
for (int j = i + i; j <= n; j += i)
cnt += c[i];
cnt %= 2;
if (cnt != a[i]) {
c[i]++;
v.pb(i);
}
}
int size = v.size();
cout << size << endl;
FOR(i, 0, size - 1) printf("%d%c", v[i], i == size - 1 ? '\n' : ' ');
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pi 3.14159265358979323846264
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<long long>
#define vpii vector<pair<int, int>>
#define ll long long
#define fi first
#define se second
#define FOR(i, x, y) for (int i = x; i <= y; i++)
#define FORI(i, y, x) for (int i = y; i >= x; i--)
#define debug printf("OK\n")
int n, a[200005], c[200005];
vector<int> v;
int main() {
cin >> n;
FOR(i, 1, n) cin >> a[i];
int k = n / 2 + 1;
FOR(i, k, n) {
c[i] = a[i];
if (a[i] == 1)
v.pb(i);
}
for (int i = k - 1; i >= 1; i--) {
int cnt = 0;
for (int j = i + i; j <= n; j += i)
cnt += c[j];
// printf("%d %d\n", i, cnt);
cnt %= 2;
if (cnt != a[i]) {
c[i]++;
v.pb(i);
}
}
int size = v.size();
cout << size << endl;
FOR(i, 0, size - 1) printf("%d%c", v[i], i == size - 1 ? '\n' : ' ');
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,445 | 779,444 | u471585927 | cpp |
p02972 | #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) cout << "debug (" #a "):" << endl << (a) << endl;
typedef uint64_t ulint;
typedef int64_t lint;
using namespace std;
template <class T> inline bool chmin(T &a, T b);
template <class T> inline bool chmax(T &a, T b);
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v);
template <class T> lint sum(vector<T> a);
template <class T> double ave(vector<T> a);
lint n, k;
lint h, w;
int main() {
//////////////////////////////////////////////////////
cin >> n;
vector<lint> a(n);
// fpair<lint,lint> p = make_pair(1,2);
// tuple<lint,lint,lint> t = make_tuple(1,2,3);
rep(i, n) { cin >> a[i]; }
//入力自動生成始まり
//入力自動生成終わり
// debug(i);
vector<char> ball(n, 0); // 入れた位置をtrueに
lint ballnum = 0;
// debug(9991);
for (lint k = n; k >= 1; k--) {
// debug(k);
lint sumb = 0;
//倍数の探索
for (lint j = k; j < n; j += k) {
sumb += ball[j];
}
// debug(a[k-1]);
// debug(sumb);
// debug((sumb + a[k-1])%2);
ball[k] = (sumb + a[k - 1]) % 2; //入れたり入れなかったり
ballnum += ball[k];
}
// debug(9992);
cout << ballnum << endl;
rep(i, n) {
if (ball[i + 1] == 1)
cout << i + 1 << " ";
}
if (ballnum > 0)
cout << endl;
// debug(ball);
//昇順ソート
// sort(all(a));
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// DP
// // 無限大の値
// const uint64_t INF = (uint64_t)1 << 60;
// //const int64_t NINF = -1 * ((int64_t)1 << 60 );
// // DP テーブル
// uint64_t dp[100010];
// //DPテーブル初期化（最小化用）
// for (int i = 0; i < 100010; ++i)
// {
// //dp[i] = INF;
// dp[i] = 0;
// }
// // 初期条件
// dp[0] = 0;
// // ループ
// for (int i = 1; i <= n; ++i) {
// //chmin( dp[i], dp[i - 1] + abs( input[i] - input[i - 1] ));
// //if (i < 2)continue;
// //chmin( dp[i], dp[i - 2] + abs( input[i] - input[i - 2] ));
// // chmax ( dp [i] , dp[i - 1]);
// // chmax ( dp [i] , dp[i - 1] + input[i]);
// // cout << "dp[" << i <<"] = " << dp[i] << endl;
// }
// //////////////////////////////////////////////////////
// cout << dp[n] << endl;
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
//最小化用関数
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;
}
// vectorprint用
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << "\t";
}
return s;
}
// //合計
// template<class T> lint sum(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0);
// }
// //平均
// template<class T> double ave(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0.0) / a.size();
// }
| #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) cout << "debug (" #a "):" << endl << (a) << endl;
typedef uint64_t ulint;
typedef int64_t lint;
using namespace std;
template <class T> inline bool chmin(T &a, T b);
template <class T> inline bool chmax(T &a, T b);
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v);
template <class T> lint sum(vector<T> a);
template <class T> double ave(vector<T> a);
lint n, k;
lint h, w;
int main() {
//////////////////////////////////////////////////////
cin >> n;
vector<lint> a(n);
// fpair<lint,lint> p = make_pair(1,2);
// tuple<lint,lint,lint> t = make_tuple(1,2,3);
rep(i, n) { cin >> a[i]; }
//入力自動生成始まり
// n = 10000;
// vector<lint> a(n,1);
//入力自動生成終わり
// debug(i);
vector<char> ball(n + 1, 0); // 入れた位置をtrueに
lint ballnum = 0;
// debug(9991);
for (lint k = n; k >= 1; k--) {
// debug(k);
lint sumb = 0;
//倍数の探索
for (lint j = k; j <= n; j += k) {
sumb += ball[j];
}
// debug(a[k-1]);
// debug(sumb);
// debug((sumb + a[k-1])%2);
// if(k == 5000)
// {
// debug(sumb);
// debug(a[k-1]);
// }
ball[k] = (sumb + a[k - 1]) % 2; //入れたり入れなかったり
ballnum += ball[k];
}
// debug(9992);
cout << ballnum << endl;
rep(i, n) {
if (ball[i + 1] == 1)
cout << i + 1 << " ";
}
if (ballnum > 0)
cout << endl;
// debug(ball);
//昇順ソート
// sort(all(a));
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// DP
// // 無限大の値
// const uint64_t INF = (uint64_t)1 << 60;
// //const int64_t NINF = -1 * ((int64_t)1 << 60 );
// // DP テーブル
// uint64_t dp[100010];
// //DPテーブル初期化（最小化用）
// for (int i = 0; i < 100010; ++i)
// {
// //dp[i] = INF;
// dp[i] = 0;
// }
// // 初期条件
// dp[0] = 0;
// // ループ
// for (int i = 1; i <= n; ++i) {
// //chmin( dp[i], dp[i - 1] + abs( input[i] - input[i - 1] ));
// //if (i < 2)continue;
// //chmin( dp[i], dp[i - 2] + abs( input[i] - input[i - 2] ));
// // chmax ( dp [i] , dp[i - 1]);
// // chmax ( dp [i] , dp[i - 1] + input[i]);
// // cout << "dp[" << i <<"] = " << dp[i] << endl;
// }
// //////////////////////////////////////////////////////
// cout << dp[n] << endl;
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
//最小化用関数
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;
}
// vectorprint用
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << "\t";
}
return s;
}
// //合計
// template<class T> lint sum(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0);
// }
// //平均
// template<class T> double ave(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0.0) / a.size();
// }
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,452 | 779,451 | u561976793 | cpp |
p02972 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long n, a[200001] = {0}, i, cnt[200001] = {0}, b[200001] = {0}, j = 0,
m = 0;
long long f = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
if (cnt[i] % 2 != a[i]) {
m++;
b[i]++;
for (j = 1; j * j <= i; j++) {
if (i % j == 0) {
cnt[i]++;
if (j * j != i)
cnt[i / j]++;
}
}
}
}
cout << m << endl;
for (i = 1; i <= n; i++) {
if (b[i] == 1) {
cout << i << " ";
f = 1;
}
}
if (f == 1)
printf("\n");
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long n, a[200001] = {0}, i, cnt[200001] = {0}, b[200001] = {0}, j = 0,
m = 0;
long long f = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = n; i > 0; i--) {
if (cnt[i] % 2 != a[i]) {
m++;
b[i]++;
for (j = 1; j * j <= i; j++) {
if (i % j == 0) {
cnt[j]++;
if (j * j != i)
cnt[i / j]++;
}
}
}
}
cout << m << endl;
for (i = 1; i <= n; i++) {
if (b[i] == 1) {
cout << i << " ";
f = 1;
}
}
if (f == 1)
printf("\n");
return 0;
}
| [
"identifier.change",
"variable_access.subscript.index.change"
] | 779,453 | 779,454 | u196254124 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball;
vector<int> current(n + 1, 0);
vector<vector<int>> utuwa(n + 1, vector<int>());
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j += i) {
utuwa[i].push_back(j);
}
}
for (int i = n; i > 0; i--) {
if (current[i] % 2 != a[i]) {
ball.push_back(i);
for (int j = 0; j < utuwa[i].size(); j++) {
current[utuwa[i][j]]++;
}
}
}
sort(ball.begin(), ball.end());
printf("%d\n", ball.size());
bool first = true;
for (int i = 0; i < ball.size(); i++) {
if (first) {
first = false;
printf("%d", ball[i]);
} else {
printf(" %d", ball[i]);
}
}
if (ball.size() > 0) {
printf("\n");
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ball;
vector<int> current(n + 1, 0);
vector<vector<int>> utuwa(n + 1, vector<int>());
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j += i) {
utuwa[j].push_back(i);
}
}
for (int i = n; i > 0; i--) {
if (current[i] % 2 != a[i]) {
ball.push_back(i);
for (int j = 0; j < utuwa[i].size(); j++) {
current[utuwa[i][j]]++;
}
}
}
sort(ball.begin(), ball.end());
printf("%d\n", ball.size());
bool first = true;
for (int i = 0; i < ball.size(); i++) {
if (first) {
first = false;
printf("%d", ball[i]);
} else {
printf(" %d", ball[i]);
}
}
if (ball.size() > 0) {
printf("\n");
}
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 779,456 | 779,457 | u553807330 | cpp |
p02972 | #include <algorithm>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int ans = 0;
for (ll j = i; j <= n; j += i) {
ans += b[j];
}
if (ans % 2 != a[i])
b[i] = 1;
}
int cnt = 0;
for (int i = 1; i <= n; i++)
if (b[i] > 0) {
cnt++;
}
cout << cnt << endl;
ll k = 0;
for (ll i = 1; i <= n; i++) {
if (b[i] && k == 0) {
cout << i << endl;
k++;
} else if (b[i]) {
cout << i << endl;
}
}
}
| #include <algorithm>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(2 * n), b(2 * n, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int ans = 0;
for (ll j = i; j <= n; j += i) {
ans += b[j];
}
if (ans % 2 != a[i])
b[i] = 1;
}
int cnt = 0;
for (int i = 1; i <= n; i++)
if (b[i] > 0) {
cnt++;
}
cout << cnt << endl;
ll k = 0;
for (ll i = 1; i <= n; i++) {
if (b[i] && k == 0) {
cout << i << endl;
k++;
} else if (b[i]) {
cout << i << endl;
}
}
}
| [
"assignment.change"
] | 779,462 | 779,463 | u579882657 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define srt(a) sort(a.begin(), a.end())
#define rsrt(a) sort(a.rbegin(), a.rend())
#define lb(a, b) lower_bound(a.begin(), a.end(), b)
#define ub(a, b) upper_bound(a.begin(), a.end(), b)
#define MOD ((int)(1000000007))
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define float long double
#define sqrt sqrtl
#define cbrt cbrtl
typedef vector<int> vi;
typedef vector<float> vf;
typedef pair<float, int> fi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<fi> vfi;
typedef vector<vi> vvi;
typedef vector<vf> vvf;
typedef vector<vii> vvii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef priority_queue<int> pqi;
typedef priority_queue<ii> pqii;
typedef priority_queue<fi> pqfi;
typedef priority_queue<int, vector<int>, greater<int>> rpqi;
typedef priority_queue<ii, vector<ii>, greater<ii>> rpqii;
typedef priority_queue<fi, vector<fi>, greater<fi>> rpqfi;
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define srt(a) sort(a.begin(), a.end())
#define rsrt(a) sort(a.rbegin(), a.rend())
#define lb(a, b) lower_bound(a.begin(), a.end(), b)
#define ub(a, b) upper_bound(a.begin(), a.end(), b)
#define MOD ((int)(1000000007))
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define float long double
#define sqrt sqrtl
#define cbrt cbrtl
typedef vector<int> vi;
typedef vector<float> vf;
typedef pair<float, int> fi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<fi> vfi;
typedef vector<vi> vvi;
typedef vector<vf> vvf;
typedef vector<vii> vvii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef priority_queue<int> pqi;
typedef priority_queue<ii> pqii;
typedef priority_queue<fi> pqfi;
typedef priority_queue<int, vector<int>, greater<int>> rpqi;
typedef priority_queue<ii, vector<ii>, greater<ii>> rpqii;
typedef priority_queue<fi, vector<fi>, greater<fi>> rpqfi;
int32_t main() {
IOS int n;
cin >> n;
vi a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
if (a[i] == 1) {
int cnt = 0;
for (int j = 2; j * i <= n; j++) {
cnt += b[j * i];
}
if (cnt % 2 == 0)
b[i] = 1;
else
b[i] = 0;
} else {
int cnt = 0;
for (int j = 2; j * i <= n; j++) {
cnt += b[j * i];
}
if (cnt % 2 == 0)
b[i] = 0;
else
b[i] = 1;
}
}
map<int, int> M;
for (int i = 1; i <= n; i++) {
if (b[i])
M[b[i]]++;
}
cout << M.size() << endl;
for (auto it : M)
cout << it.first << " ";
cout << endl;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define srt(a) sort(a.begin(), a.end())
#define rsrt(a) sort(a.rbegin(), a.rend())
#define lb(a, b) lower_bound(a.begin(), a.end(), b)
#define ub(a, b) upper_bound(a.begin(), a.end(), b)
#define MOD ((int)(1000000007))
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define float long double
#define sqrt sqrtl
#define cbrt cbrtl
typedef vector<int> vi;
typedef vector<float> vf;
typedef pair<float, int> fi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<fi> vfi;
typedef vector<vi> vvi;
typedef vector<vf> vvf;
typedef vector<vii> vvii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef priority_queue<int> pqi;
typedef priority_queue<ii> pqii;
typedef priority_queue<fi> pqfi;
typedef priority_queue<int, vector<int>, greater<int>> rpqi;
typedef priority_queue<ii, vector<ii>, greater<ii>> rpqii;
typedef priority_queue<fi, vector<fi>, greater<fi>> rpqfi;
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define srt(a) sort(a.begin(), a.end())
#define rsrt(a) sort(a.rbegin(), a.rend())
#define lb(a, b) lower_bound(a.begin(), a.end(), b)
#define ub(a, b) upper_bound(a.begin(), a.end(), b)
#define MOD ((int)(1000000007))
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define float long double
#define sqrt sqrtl
#define cbrt cbrtl
typedef vector<int> vi;
typedef vector<float> vf;
typedef pair<float, int> fi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<fi> vfi;
typedef vector<vi> vvi;
typedef vector<vf> vvf;
typedef vector<vii> vvii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef priority_queue<int> pqi;
typedef priority_queue<ii> pqii;
typedef priority_queue<fi> pqfi;
typedef priority_queue<int, vector<int>, greater<int>> rpqi;
typedef priority_queue<ii, vector<ii>, greater<ii>> rpqii;
typedef priority_queue<fi, vector<fi>, greater<fi>> rpqfi;
int32_t main() {
IOS int n;
cin >> n;
vi a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
if (a[i] == 1) {
int cnt = 0;
for (int j = 2; j * i <= n; j++) {
cnt += b[j * i];
}
if (cnt % 2 == 0)
b[i] = 1;
else
b[i] = 0;
} else {
int cnt = 0;
for (int j = 2; j * i <= n; j++) {
cnt += b[j * i];
}
if (cnt % 2 == 0)
b[i] = 0;
else
b[i] = 1;
}
}
map<int, int> M;
for (int i = 1; i <= n; i++) {
if (b[i])
M[i]++;
}
cout << M.size() << endl;
for (auto it : M)
cout << it.first << " ";
cout << endl;
}
| [] | 779,663 | 779,664 | u392058778 | cpp |
p02972 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
int count = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
sum = 0;
for (int j = 2;; j++) {
if ((i + 1) * j - 1 > n)
break;
sum += a[(i + 1) * j - 1];
}
if (sum % 2 == a[i]) {
a[i] = 0;
} else {
a[i] = 1;
count++;
}
}
int j = 0;
int b[count];
for (int i = 0; i < n; i++) {
if (a[i] == 1) {
b[j] = i + 1;
j++;
}
}
cout << count << endl;
for (int i = 0; i < count; i++) {
cout << b[i] << " ";
}
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
int count = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
sum = 0;
for (int j = 2;; j++) {
if ((i + 1) * j > n)
break;
sum += a[(i + 1) * j - 1];
}
if (sum % 2 == a[i]) {
a[i] = 0;
} else {
a[i] = 1;
count++;
}
}
int j = 0;
int b[count];
for (int i = 0; i < n; i++) {
if (a[i] == 1) {
b[j] = i + 1;
j++;
}
}
cout << count << endl;
for (int i = 0; i < count; i++) {
cout << b[i] << " ";
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 779,665 | 779,666 | u832158848 | cpp |
p02972 | // AtCoder Beginner Contest 134 - D
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n + 1];
bool b[n + 1];
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
bool ok = 1;
for (int i = n; i >= 1; i--) {
if (a[i]) {
b[i] = 1;
for (int j = 1; j * j <= i; j++) {
if (i % j == 0) {
a[j] = !a[j];
if (i != (i / j)) {
a[i / j] = !a[i / j];
}
}
}
}
}
int cnt = 0;
vector<int> yes;
for (int i = 1; i <= n; i++) {
if (b[i]) {
cnt++;
yes.push_back(i);
}
}
printf("%d\n", cnt);
for (int i = 0; i < cnt; i++) {
printf("%d\n", yes[i]);
}
} | // AtCoder Beginner Contest 134 - D
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
scanf("%d", &n);
bool a[n + 1];
bool b[n + 1];
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
bool ok = 1;
for (int i = n; i >= 1; i--) {
if (a[i]) {
b[i] = 1;
for (int j = 1; j * j <= i; j++) {
if (i % j == 0) {
a[j] = !a[j];
if (j != (i / j)) {
a[i / j] = !a[i / j];
}
}
}
}
}
int cnt = 0;
vector<int> yes;
for (int i = 1; i <= n; i++) {
if (b[i]) {
cnt++;
yes.push_back(i);
}
}
printf("%d\n", cnt);
for (int i = 0; i < cnt; i++) {
printf("%d\n", yes[i]);
}
} | [
"variable_declaration.type.primitive.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,668 | 779,669 | u586624341 | cpp |
p02972 | // AtCoder Beginner Contest 134 - D
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n + 1];
bool b[n + 1];
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
bool ok = 1;
for (int i = n; i >= 1; i--) {
if (a[i]) {
b[i] = 1;
for (int j = 1; j * j <= i; j++) {
if (i % j == 0) {
a[i] = !a[i];
if (i != (i / j)) {
a[i / j] = !a[i / j];
}
}
}
}
}
int cnt = 0;
vector<int> yes;
for (int i = 1; i <= n; i++) {
if (b[i]) {
cnt++;
yes.push_back(i);
}
}
printf("%d\n", cnt);
for (int i = 0; i < cnt; i++) {
printf("%d\n", yes[i]);
}
} | // AtCoder Beginner Contest 134 - D
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
scanf("%d", &n);
bool a[n + 1];
bool b[n + 1];
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
bool ok = 1;
for (int i = n; i >= 1; i--) {
if (a[i]) {
b[i] = 1;
for (int j = 1; j * j <= i; j++) {
if (i % j == 0) {
a[j] = !a[j];
if (j != (i / j)) {
a[i / j] = !a[i / j];
}
}
}
}
}
int cnt = 0;
vector<int> yes;
for (int i = 1; i <= n; i++) {
if (b[i]) {
cnt++;
yes.push_back(i);
}
}
printf("%d\n", cnt);
for (int i = 0; i < cnt; i++) {
printf("%d\n", yes[i]);
}
} | [
"variable_declaration.type.primitive.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 779,670 | 779,669 | u586624341 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n, i;
int ans = 0;
cin >> n;
int a[n + 1];
a[0] = 0;
for (i = 1; i < n + 1; i++) {
cin >> a[i];
}
int b[n + 1];
if (n % 2 == 0) {
for (i = (n / 2) + 1; i <= n; i++) {
b[i] = a[i];
if (b[i] == 1) {
ans++;
}
}
for (i = n / 2; i >= 1; i--) {
int k = n / i;
int tmp = 0;
for (int l = 2; l <= k; l++) {
tmp += b[l * i];
}
if (tmp % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
}
}
} else {
for (i = (n - 1) / 2; i <= n; i++) {
b[i] = a[i];
if (b[i] == 1) {
ans++;
}
}
for (i = (n - 1) / 2 - 1; i >= 1; i--) {
int k = n / i;
int tmp = 0;
for (int l = 2; l <= k; l++) {
tmp += b[l * i];
}
if (tmp % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
}
}
}
cout << ans << endl;
for (i = 1; i <= n; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
// for(i = 1; i<=n; i++){
// 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 REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n, i;
int ans = 0;
cin >> n;
int a[n + 1];
a[0] = 0;
for (i = 1; i < n + 1; i++) {
cin >> a[i];
}
int b[n + 1];
if (n % 2 == 0) {
for (i = (n / 2) + 1; i <= n; i++) {
b[i] = a[i];
if (b[i] == 1) {
ans++;
}
}
for (i = n / 2; i >= 1; i--) {
int k = n / i;
int tmp = 0;
for (int l = 2; l <= k; l++) {
tmp += b[l * i];
}
if (tmp % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
}
}
} else {
for (i = (n + 1) / 2; i <= n; i++) {
b[i] = a[i];
if (b[i] == 1) {
ans++;
}
}
for (i = (n + 1) / 2 - 1; i >= 1; i--) {
int k = n / i;
int tmp = 0;
for (int l = 2; l <= k; l++) {
tmp += b[l * i];
}
if (tmp % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
}
}
}
cout << ans << endl;
for (i = 1; i <= n; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
// for(i = 1; i<=n; i++){
// cout<<b[i]<<endl;
// }
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 779,675 | 779,676 | u127768253 | cpp |
p02972 | #include <cstdio>
#include <iostream>
using namespace std;
int n, cnt, a[200010], b[200010];
int main() {
cin >> n;
for (register int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (register int i = n; i >= 1; --i) {
int sum = 0;
for (register int j = i * 2; j <= n; ++j)
sum += b[j];
if (sum % 2 != a[i])
b[i] = 1, ++cnt;
}
cout << cnt << endl;
for (register int i = 1; i <= n; ++i)
if (b[i])
printf("%d ", i);
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int n, cnt, a[200010], b[200010];
int main() {
cin >> n;
for (register int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (register int i = n; i >= 1; --i) {
int sum = 0;
for (register int j = i * 2; j <= n; j += i)
sum += b[j];
if (sum % 2 != a[i])
b[i] = 1, ++cnt;
}
cout << cnt << endl;
for (register int i = 1; i <= n; ++i)
if (b[i])
printf("%d ", i);
return 0;
} | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 779,677 | 779,678 | u557325877 | cpp |
p02972 | #include <iostream>
using namespace std;
int n;
int main() {
cin >> n;
int a[n], box[n], M = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i > n / 2 - 1) {
box[i] = a[i];
if (a[i] == 1)
M++;
} else
box[i] = 0;
}
for (int i = n / 2; i > 0; i--) {
int sum = 0;
for (int j = 2 * i; j < n; j += i) {
sum += box[j - 1];
}
if (sum % 2 != a[i - 1]) {
box[i - 1] = 1;
M++;
}
}
cout << M << endl;
for (int i = 0; i < n; i++) {
if (box[i] == 1)
cout << i + 1;
}
cout << endl;
} | #include <iostream>
using namespace std;
int n;
int main() {
cin >> n;
int a[n], box[n], M = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i > n / 2 - 1) {
box[i] = a[i];
if (a[i] == 1)
M++;
} else
box[i] = 0;
}
for (int i = n / 2; i > 0; i--) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += box[j - 1];
}
if (sum % 2 != a[i - 1]) {
box[i - 1] = 1;
M++;
}
}
cout << M << endl;
for (int i = 0; i < n; i++) {
if (box[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 779,681 | 779,682 | u190679129 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const auto MOD = 1000000007;
const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef vector<int> VI;
typedef vector<long long> VLL;
int n, m;
string s;
bool is_prime[10000 + 1];
vector<int> P;
void Eratosthenes(const int N) {
for (int i = 0; i <= N; i++) {
is_prime[i] = true; //初期化
}
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
}
int main() {
cin >> n;
VI a(n + 1);
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int cnt = 0;
VI ans(n + 1);
for (int i = n; i > 0; i--) {
if (2 * i <= n)
break;
ans[i] = a[i];
if (a[i])
cnt++;
}
// Eratosthenes(n);
for (int i = n / 2; i > 0; i--) {
bool temp = 0;
for (int j = 2; j <= n; j++) {
if (i * j > n)
break;
temp ^= ans[i * j];
}
ans[i] = temp ^ a[i];
if (ans[i])
cnt++;
}
cout << cnt << endl;
for (int i = 0; i < n; i++) {
if (ans[i + 1])
cout << ans[i + 1] << endl;
}
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const auto MOD = 1000000007;
const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef vector<int> VI;
typedef vector<long long> VLL;
int n, m;
string s;
bool is_prime[10000 + 1];
vector<int> P;
void Eratosthenes(const int N) {
for (int i = 0; i <= N; i++) {
is_prime[i] = true; //初期化
}
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
}
int main() {
cin >> n;
VI a(n + 1);
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
}
int cnt = 0;
VI ans(n + 1);
for (int i = n; i > 0; i--) {
if (2 * i <= n)
break;
ans[i] = a[i];
if (a[i])
cnt++;
}
// Eratosthenes(n);
for (int i = n / 2; i > 0; i--) {
bool temp = 0;
for (int j = 2; j <= n; j++) {
if (i * j > n)
break;
temp ^= ans[i * j];
}
ans[i] = temp ^ a[i];
if (ans[i])
cnt++;
}
cout << cnt << endl;
for (int i = 0; i < n; i++) {
if (ans[i + 1])
cout << i + 1 << endl;
}
} | [] | 779,688 | 779,689 | u587724217 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
using namespace __gnu_pbds;
#define st first
#define nd second
void debug_out() { cerr << endl; }
template <class T> ostream &prnt(ostream &out, T v) {
out << v.size() << '\n';
for (auto e : v)
out << e << ' ';
return out;
}
template <class T> ostream &operator<<(ostream &out, vector<T> v) {
return prnt(out, v);
}
template <class T> ostream &operator<<(ostream &out, set<T> v) {
return prnt(out, v);
}
template <class T1, class T2> ostream &operator<<(ostream &out, map<T1, T2> v) {
return prnt(out, v);
}
template <class T1, class T2>
ostream &operator<<(ostream &out, pair<T1, T2> p) {
return out << '(' << p.st << ' ' << p.nd << ')';
}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) \
do { \
cerr << #x "[]: "; \
for (int _ = 0; _ < n; ++_) \
cerr << x[_] << " "; \
cerr << '\n'; \
} while (0)
#define dbg_ok cerr << "OK!\n"
#define MAXN 100
#define MOD 1000000007
#define int long long
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef cc_hash_table<int, int, hash<int>> ht;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> v;
int ans[n + 1] = {0};
for (int i = n / 2 + 1; i <= n; i++) {
ans[n + 1] = a[i];
}
for (int i = n / 2; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 != a[i] % 2)
ans[i]++;
}
for (int i = 1; i <= n; i++) {
if (ans[i]) {
v.push_back(i);
}
}
cout << v.size() << "\n";
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
using namespace __gnu_pbds;
#define st first
#define nd second
void debug_out() { cerr << endl; }
template <class T> ostream &prnt(ostream &out, T v) {
out << v.size() << '\n';
for (auto e : v)
out << e << ' ';
return out;
}
template <class T> ostream &operator<<(ostream &out, vector<T> v) {
return prnt(out, v);
}
template <class T> ostream &operator<<(ostream &out, set<T> v) {
return prnt(out, v);
}
template <class T1, class T2> ostream &operator<<(ostream &out, map<T1, T2> v) {
return prnt(out, v);
}
template <class T1, class T2>
ostream &operator<<(ostream &out, pair<T1, T2> p) {
return out << '(' << p.st << ' ' << p.nd << ')';
}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) \
do { \
cerr << #x "[]: "; \
for (int _ = 0; _ < n; ++_) \
cerr << x[_] << " "; \
cerr << '\n'; \
} while (0)
#define dbg_ok cerr << "OK!\n"
#define MAXN 100
#define MOD 1000000007
#define int long long
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef cc_hash_table<int, int, hash<int>> ht;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> v;
int ans[n + 1] = {0};
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
}
for (int i = n / 2; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 != a[i] % 2)
ans[i]++;
}
for (int i = 1; i <= n; i++) {
if (ans[i]) {
v.push_back(i);
}
}
cout << v.size() << "\n";
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
}
| [
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 779,690 | 779,691 | u454937339 | cpp |
p02972 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const int MOD = (int)1e9 + 7;
const int MAX_N = (int)1e5 + 5;
#define debug(x) cout << #x << ": " << x << endl
template <typename type> vector<type> divisor(type n) {
vector<type> res;
for (type i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
sort(res.begin(), res.end());
return res;
}
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> A(n + 1);
for (int i = 1; i <= n; i++)
cin >> A[i];
vector<int> sum(n + 1, 0), cnt(n + 1, 0);
for (int i = n; i >= 1; i--) {
if (sum[i] % 2 == A[i])
continue;
cnt[i] = 1;
vector<int> divisors = divisor(i);
for (int j = 0; j < divisors.size(); j++) {
sum[divisors[j]]++;
}
}
vector<int> check(n + 1, 0);
for (int i = 1; i <= n; i++) {
check[i] = sum[i] % 2;
}
if (check != sum) {
cout << -1 << endl;
return 0;
}
vector<int> ans;
for (int i = 1; i < cnt.size(); i++) {
if (cnt[i])
ans.push_back(cnt[i]);
}
cout << ans.size() << endl;
if (ans.size() > 0) {
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << " ";
cout << endl;
}
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const int MOD = (int)1e9 + 7;
const int MAX_N = (int)1e5 + 5;
#define debug(x) cout << #x << ": " << x << endl
template <typename type> vector<type> divisor(type n) {
vector<type> res;
for (type i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
sort(res.begin(), res.end());
return res;
}
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> A(n + 1);
for (int i = 1; i <= n; i++)
cin >> A[i];
vector<int> sum(n + 1, 0), cnt(n + 1, 0);
for (int i = n; i >= 1; i--) {
if (sum[i] % 2 == A[i])
continue;
cnt[i] = 1;
vector<int> divisors = divisor(i);
for (int j = 0; j < divisors.size(); j++)
sum[divisors[j]]++;
}
vector<int> check(n + 1, 0);
for (int i = 1; i <= n; i++) {
check[i] = sum[i] % 2;
}
if (check != A) {
cout << -1 << endl;
return 0;
}
vector<int> ans;
for (int i = 1; i < cnt.size(); i++) {
if (cnt[i])
ans.push_back(i);
}
cout << ans.size() << endl;
if (ans.size() > 0) {
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << " ";
cout << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 779,694 | 779,693 | u952094438 | cpp |
p02972 | #include <iostream>
int n, a[200000], m, b[200000], tmp;
int main() {
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int i = n; i >= 1; i--) {
for (int j = i; j <= n / 2; j *= 2) {
tmp += b[j - 1];
}
if ((tmp % 2) != a[i - 1])
b[i - 1] = 1;
tmp = 0;
}
for (int i = 0; i < n; i++) {
if (b[i] == 1)
m++;
}
std::cout << m << std::endl;
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
std::cout << i + 1;
m--;
if (m != 0)
std::cout << ' ';
}
}
std::cout << std::endl;
return 0;
} | #include <iostream>
int n, a[200000], m, b[200000], tmp;
int main() {
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int i = n; i >= 1; i--) {
for (int j = i; j <= n; j += i) {
tmp += b[j - 1];
}
if ((tmp % 2) != a[i - 1])
b[i - 1] = 1;
tmp = 0;
}
for (int i = 0; i < n; i++) {
if (b[i] == 1)
m++;
}
std::cout << m << std::endl;
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
std::cout << i + 1;
m--;
if (m != 0)
std::cout << ' ';
}
}
std::cout << std::endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.update.change",
"assignment.change"
] | 779,699 | 779,700 | u688065650 | cpp |
p02972 | #include <bits/stdc++.h>
#include <math.h>
#include <sstream>
#include <string>
using namespace std;
#define endl "\n"
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
// STANDARD DATA TYPES
#define ll long long
#define llu unsigned long long
#define ld long double
// ADV DATA TYPES
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define ff first
#define ss second
// C 9/++ DS
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pf push_front
#define iter ::iterator
#define all(x) x.begin(), x.end()
// priority_queue < pii, vector < pii >, greater < pii > > pq;
// lower_bound(v.begin(),v.end(),20);//for any sorted container
// CONSTANTS
#define MOD 998244353
#define INF 0x3f3f3f3f
#define MAXN (int)(2e4 + 20)
//#define for(int i=1; i<=n ; i++) for(int i=0; i<n; i++)
#define forl(i, n) for (ll i = 0; i < n; i++)
// MOD OPERATIONS
inline ll fpow(ll n, ll k, int p = MOD) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = r * n % p;
n = n * n % p;
}
return r;
}
inline ll inv(ll a, ll p = MOD) { return fpow(a, p - 2, p); }
inline ll addmod(ll a, ll val, ll p = MOD) {
{
if ((a = (a + val)) >= p)
a -= p;
}
return a;
}
inline ll submod(ll a, ll val, ll p = MOD) {
{
if ((a = (a - val)) < 0)
a += p;
}
return a;
}
inline ll mult(ll a, ll b, ll p = MOD) { return (ll)a * b % p; }
const llu int_max = pow(2, 32) - 1;
bool compare(const pair<int, int> &i, const pair<int, int> &j) {
return i.ff < j.ff;
}
int main() {
fastio
// total - a[i] % 2 == 0
int n;
cin >> n;
bool a[n + 1], val[n + 1] = {0};
// int total[n] = {0} ;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] == 1)
val[i] = 1;
}
for (int i = n / 2; i >= 1; i--) {
int total = 0, ax = i;
for (int j = i; j < n; j += i) {
if (val[j])
total++;
}
if ((total - a[i]) % 2 == 0)
continue;
else {
if (val[i] == 0) {
val[i] = 1;
} else {
val[i] = 0;
}
}
}
int m = 0;
for (int i = 1; i <= n; i++) {
if (val[i])
m++;
}
cout << m << endl;
for (int i = 1; i <= n; i++)
if (val[i])
cout << i << " ";
return 0;
}
| #include <bits/stdc++.h>
#include <math.h>
#include <sstream>
#include <string>
using namespace std;
#define endl "\n"
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
// STANDARD DATA TYPES
#define ll long long
#define llu unsigned long long
#define ld long double
// ADV DATA TYPES
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define ff first
#define ss second
// C 9/++ DS
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pf push_front
#define iter ::iterator
#define all(x) x.begin(), x.end()
// priority_queue < pii, vector < pii >, greater < pii > > pq;
// lower_bound(v.begin(),v.end(),20);//for any sorted container
// CONSTANTS
#define MOD 998244353
#define INF 0x3f3f3f3f
#define MAXN (int)(2e4 + 20)
//#define for(int i=1; i<=n ; i++) for(int i=0; i<n; i++)
#define forl(i, n) for (ll i = 0; i < n; i++)
// MOD OPERATIONS
inline ll fpow(ll n, ll k, int p = MOD) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = r * n % p;
n = n * n % p;
}
return r;
}
inline ll inv(ll a, ll p = MOD) { return fpow(a, p - 2, p); }
inline ll addmod(ll a, ll val, ll p = MOD) {
{
if ((a = (a + val)) >= p)
a -= p;
}
return a;
}
inline ll submod(ll a, ll val, ll p = MOD) {
{
if ((a = (a - val)) < 0)
a += p;
}
return a;
}
inline ll mult(ll a, ll b, ll p = MOD) { return (ll)a * b % p; }
const llu int_max = pow(2, 32) - 1;
bool compare(const pair<int, int> &i, const pair<int, int> &j) {
return i.ff < j.ff;
}
int main() {
fastio
// total - a[i] % 2 == 0
int n;
cin >> n;
bool a[n + 1], val[n + 1] = {0};
// int total[n] = {0} ;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] == 1)
val[i] = 1;
}
for (int i = n / 2; i >= 1; i--) {
int total = 0, ax = i;
for (int j = i; j <= n; j += i) {
if (val[j])
total++;
}
if ((total - a[i]) % 2 == 0)
continue;
else {
if (val[i] == 0) {
val[i] = 1;
} else {
val[i] = 0;
}
}
}
int m = 0;
for (int i = 1; i <= n; i++) {
if (val[i])
m++;
}
cout << m << endl;
for (int i = 1; i <= n; i++)
if (val[i])
cout << i << " ";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 779,703 | 779,704 | u806556718 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, m, t, p = 0;
bool c; // t:0
cin >> n;
m = n / 2;
vector<short> b(n);
vector<short> g(n);
for (int a = 0; a < n; a++) {
cin >> b[a];
if (m < a) {
g[a] = b[a];
p += g[a];
}
}
for (int a = m; a >= 0; a--) {
a++;
t = a;
c = true;
while (true) {
t += a;
if (t >= n) {
break;
}
if (g[t - 1] == 1) {
c = !c;
}
}
a--;
if (c != (b[a] == 0)) {
g[a] = 1;
} else {
g[a] = 0;
}
p += g[a];
}
cout << p << endl;
for (int a = 0; a < n; a++) {
if (g[a] == 1) {
cout << a + 1 << " ";
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, m, t, p = 0;
bool c; // t:0
cin >> n;
m = n / 2;
vector<short> b(n);
vector<short> g(n);
for (int a = 0; a < n; a++) {
cin >> b[a];
if (m < a) {
g[a] = b[a];
p += g[a];
}
}
for (int a = m; a >= 0; a--) {
a++;
t = a;
c = true;
while (true) {
t += a;
if (t > n) {
break;
}
if (g[t - 1] == 1) {
c = !c;
}
}
a--;
if (c != (b[a] == 0)) {
g[a] = 1;
} else {
g[a] = 0;
}
p += g[a];
}
cout << p << endl;
for (int a = 0; a < n; a++) {
if (g[a] == 1) {
cout << a + 1 << " ";
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 779,706 | 779,707 | u468506413 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int M = 0;
vector<int> b(n, 0);
for (int i = n; i >= 1; i--) {
int j = 2;
int cnt = 0;
while (j * i <= n) {
if (b[j * i] == 1)
cnt++;
j++;
}
if (a[i - 1] != (cnt % 2)) {
b[i - 1] = 1;
M++;
}
}
cout << M << endl;
for (int i = 0; i < n; i++) {
if (b[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int M = 0;
vector<int> b(n, 0);
for (int i = n; i >= 1; i--) {
int j = 2;
int cnt = 0;
while (j * i <= n) {
if (b[j * i - 1] == 1)
cnt++;
j++;
}
if (a[i - 1] != (cnt % 2)) {
b[i - 1] = 1;
M++;
}
}
cout << M << endl;
for (int i = 0; i < n; i++) {
if (b[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 779,715 | 779,716 | u115306811 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> ans(n + 1);
vector<int> out;
for (int i = n; i >= 1; i--) {
int x = 0;
for (int j = i * 2; j <= n; j += i) {
x ^= ans[j];
}
ans[i] = x ^ a[i];
if (ans[i] != 0) {
out.push_back(ans[i]);
}
}
cout << out.size() << endl;
rep(i, out.size()) cout << out[i] << '\n';
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> ans(n + 1);
vector<int> out;
for (int i = n; i >= 1; i--) {
int x = 0;
for (int j = i * 2; j <= n; j += i) {
x ^= ans[j];
}
ans[i] = x ^ a[i];
if (ans[i] != 0) {
out.push_back(i);
}
}
cout << out.size() << endl;
rep(i, out.size()) cout << out[i] << '\n';
} | [
"call.arguments.change"
] | 779,731 | 779,732 | u006493569 | cpp |
p02972 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int index(int numToFind, std::vector<int> vectorToFindIn) {
int len = vectorToFindIn.size();
for (int i = 0; i < len; i++) {
if (vectorToFindIn[i] == numToFind) {
return i;
}
}
return -1;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, cur, cnt;
cin >> n;
int a[n + 1];
int ans[n + 1];
cnt = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = n; i > 0; --i) {
cur = 0;
for (int j = 2; j * i <= n; ++j) {
cur += ans[i * j];
}
if (cur % 2 == a[i] % 2) {
ans[i] = 0;
} else {
ans[i] = 1;
++cnt;
}
}
cout << cnt << "\n";
for (int i = 1; i <= n; ++i) {
if (a[i] == 1) {
cout << i << " ";
}
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int index(int numToFind, std::vector<int> vectorToFindIn) {
int len = vectorToFindIn.size();
for (int i = 0; i < len; i++) {
if (vectorToFindIn[i] == numToFind) {
return i;
}
}
return -1;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, cur, cnt;
cin >> n;
int a[n + 1];
int ans[n + 1];
cnt = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = n; i > 0; --i) {
cur = 0;
for (int j = 2; j * i <= n; ++j) {
cur += ans[i * j];
}
if (cur % 2 == a[i] % 2) {
ans[i] = 0;
} else {
ans[i] = 1;
++cnt;
}
}
cout << cnt << "\n";
for (int i = 1; i <= n; ++i) {
if (ans[i] == 1) {
cout << i << " ";
}
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 779,733 | 779,734 | u674114383 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
int main() {
int N;
cin >> N;
vector<int> a(N + 1, -1); // a[0]=-1, a[1]から始まるとして考える
rep(i, N) { cin >> a[i + 1]; }
vector<int> b(N + 1, -1);
for (int i = N; i > N / 2; i--) {
b[i] = a[i];
}
int tmp_sum;
for (int i = N / 2; i > 0; i--) {
tmp_sum = 0;
for (int k = 2; k <= N / i; k++) {
tmp_sum += a[i * k] % 2;
}
b[i] = (tmp_sum + a[i]) % 2;
}
int cnt = 0;
rep1(i, N + 1) {
if (b[i] == 1) {
cnt++;
}
}
cout << cnt << endl;
rep1(i, N + 1) {
if (b[i] == 1) {
cout << i << " ";
}
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
int main() {
int N;
cin >> N;
vector<int> a(N + 1, -1); // a[0]=-1, a[1]から始まるとして考える
rep(i, N) { cin >> a[i + 1]; }
vector<int> b(N + 1, -1);
for (int i = N; i > N / 2; i--) {
b[i] = a[i];
}
int tmp_sum;
for (int i = N / 2; i > 0; i--) {
tmp_sum = 0;
for (int k = 2; k <= N / i; k++) {
tmp_sum += b[i * k] % 2;
}
b[i] = (tmp_sum + a[i]) % 2;
}
int cnt = 0;
rep1(i, N + 1) {
if (b[i] == 1) {
cnt++;
}
}
cout << cnt << endl;
rep1(i, N + 1) {
if (b[i] == 1) {
cout << i << " ";
}
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 779,735 | 779,736 | u730476362 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
int main() {
int N;
cin >> N;
vector<int> a(N + 1, -1); // a[0]=-1, a[1]から始まるとして考える
rep(i, N) { cin >> a[i + 1]; }
vector<int> b(N + 1, -1);
for (int i = N; i > N / 2; i--) {
b[i] = a[i];
}
int tmp_sum;
for (int i = N / 2; i > 0; i--) {
tmp_sum = 0;
for (int k = 2; k < N / i; k++) {
tmp_sum += a[i * k] % 2;
}
b[i] = (tmp_sum + a[i]) % 2;
}
int cnt = 0;
rep1(i, N + 1) {
if (b[i] == 1) {
cnt++;
}
}
cout << cnt << endl;
rep1(i, N + 1) {
if (b[i] == 1) {
cout << i << " ";
}
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
int main() {
int N;
cin >> N;
vector<int> a(N + 1, -1); // a[0]=-1, a[1]から始まるとして考える
rep(i, N) { cin >> a[i + 1]; }
vector<int> b(N + 1, -1);
for (int i = N; i > N / 2; i--) {
b[i] = a[i];
}
int tmp_sum;
for (int i = N / 2; i > 0; i--) {
tmp_sum = 0;
for (int k = 2; k <= N / i; k++) {
tmp_sum += b[i * k] % 2;
}
b[i] = (tmp_sum + a[i]) % 2;
}
int cnt = 0;
rep1(i, N + 1) {
if (b[i] == 1) {
cnt++;
}
}
cout << cnt << endl;
rep1(i, N + 1) {
if (b[i] == 1) {
cout << i << " ";
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 779,737 | 779,736 | u730476362 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
int main() {
int N;
cin >> N;
vector<int> a(N + 1, -1); // a[0]=-1, a[1]から始まるとして考える
rep(i, N) { cin >> a[i + 1]; }
vector<int> b(N + 1, -1);
for (int i = N; i > N / 2; i--) {
b[i] = a[i];
}
int tmp_sum;
for (int i = N / 2; i > 0; i--) {
tmp_sum = 0;
for (int k = 2; k < N / i; k++) {
tmp_sum += a[i * k] % 2;
}
b[i] = (tmp_sum + a[i]) % 2;
}
int cnt = 0;
rep1(i, N + 1) {
if (b[i] == 1) {
cnt++;
}
}
cout << cnt << endl;
rep1(i, N + 1) {
if (b[i] == 1) {
cout << b[i] << " ";
}
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
int main() {
int N;
cin >> N;
vector<int> a(N + 1, -1); // a[0]=-1, a[1]から始まるとして考える
rep(i, N) { cin >> a[i + 1]; }
vector<int> b(N + 1, -1);
for (int i = N; i > N / 2; i--) {
b[i] = a[i];
}
int tmp_sum;
for (int i = N / 2; i > 0; i--) {
tmp_sum = 0;
for (int k = 2; k <= N / i; k++) {
tmp_sum += b[i * k] % 2;
}
b[i] = (tmp_sum + a[i]) % 2;
}
int cnt = 0;
rep1(i, N + 1) {
if (b[i] == 1) {
cnt++;
}
}
cout << cnt << endl;
rep1(i, N + 1) {
if (b[i] == 1) {
cout << i << " ";
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 779,738 | 779,736 | u730476362 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
// Repetitions
#define FOR(i, a, n) for (ll i = ((ll)a); i < ((ll)n); ++i)
#define FORR(i, s, g) for (ll i = ((ll)s - 1); i >= ((ll)g); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
// Container Utils
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SORTALL(v) sort(ALL(v))
#define SZ(a) int((a).size())
#define CLR(a) memset((a), 0, sizeof(a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
// For Debug
#define DMP(x) cerr << #x << " = " << (x) << endl
#define DBG(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl
// Aliases
#define PB push_back
#define MP make_pair
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
// I/O Asynchronizing
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
#define MAX_N 200000
bitset<MAX_N> b(0);
void print_b(const int n) {
REP(i, n) { cerr << b[i]; }
cerr << "\n";
}
int main() {
int n;
cin >> n;
vi a(n);
int cnt = 0;
REP(i, n) { cin >> a[i]; }
REPR(i, n) {
bool cnd = a[i];
// print_b(n);
FOR(j, 2, n / (i + 1)) { cnd ^= b[j * (i + 1) - 1]; }
if (cnd) {
b.set(i);
cnt++;
} else
b.reset(i);
}
cout << cnt << "\n";
bool out_flg = false;
if (cnt > 0) {
REP(i, n) {
if (b[i] && !out_flg) {
cout << i + 1;
out_flg = true;
} else if (b[i])
cout << " " << i + 1;
}
cout << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// Repetitions
#define FOR(i, a, n) for (ll i = ((ll)a); i < ((ll)n); ++i)
#define FORR(i, s, g) for (ll i = ((ll)s - 1); i >= ((ll)g); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
// Container Utils
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SORTALL(v) sort(ALL(v))
#define SZ(a) int((a).size())
#define CLR(a) memset((a), 0, sizeof(a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
// For Debug
#define DMP(x) cerr << #x << " = " << (x) << endl
#define DBG(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl
// Aliases
#define PB push_back
#define MP make_pair
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
// I/O Asynchronizing
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
#define MAX_N 200000
bitset<MAX_N> b(0);
void print_b(const int n) {
REP(i, n) { cerr << b[i]; }
cerr << "\n";
}
int main() {
int n;
cin >> n;
vi a(n);
int cnt = 0;
REP(i, n) { cin >> a[i]; }
REPR(i, n) {
bool cnd = a[i];
// print_b(n);
FOR(j, 2, n / (i + 1) + 1) {
// DBG(j * (i + 1));
// DBG(cnd);
cnd ^= b[j * (i + 1) - 1];
}
// DBG(i);
// DBG(cnd);
if (cnd) {
b.set(i);
cnt++;
} else
b.reset(i);
}
cout << cnt << "\n";
bool out_flg = false;
if (cnt > 0) {
REP(i, n) {
if (b[i] && !out_flg) {
cout << i + 1;
out_flg = true;
} else if (b[i])
cout << " " << i + 1;
}
cout << "\n";
}
return 0;
}
| [
"expression.operation.binary.add"
] | 779,745 | 779,746 | u203062059 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
vector<int> div(int N) {
vector<int> ret;
for (int i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N)
ret.push_back(N / i);
}
}
return (ret);
}
signed main() {
int N;
cin >> N;
int a[N];
bool zero = true;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] == 1) {
zero = false;
}
}
reverse(a, a + N);
vector<int> ans;
vector<int> count(200005, 0);
for (int i = 0; i < N; i++) {
if (count[a[i]] % 2 == a[i]) {
} else {
vector<int> yakusu = div(N - i);
for (int j = 0; j < yakusu.size(); j++) {
count[a[j]]++;
}
ans.push_back(N - i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
} | #include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
vector<int> div(int N) {
vector<int> ret;
for (int i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N)
ret.push_back(N / i);
}
}
return (ret);
}
signed main() {
int N;
cin >> N;
int a[N];
bool zero = true;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] == 1) {
zero = false;
}
}
reverse(a, a + N);
vector<int> ans;
vector<int> count(200005, 0);
for (int i = 0; i < N; i++) {
if (count[N - i] % 2 == a[i]) {
} else {
vector<int> yakusu = div(N - i);
for (int j = 0; j < yakusu.size(); j++) {
count[yakusu[j]]++;
}
ans.push_back(N - i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
} | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 779,747 | 779,748 | u840810569 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.