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 <iostream>
#include <vector>
using namespace std;
int main() {
int N, count, num, num_boll = 0;
cin >> N;
vector<int> array(N + 1), bolls(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> array.at(i);
}
for (int i = N; i > 0; i--) {
count = 2;
num = 0;
for (int j = i * count; j < N + 1; ++count, j = i * count) {
num += array.at(j);
}
bolls.at(i) = !(num % 2 == array.at(i));
num_boll += !(num % 2 == array.at(i));
}
count = 0;
cout << num_boll << endl;
for (int i = 1; i < N + 1; i++) {
if (count)
cout << " ";
if (bolls.at(i)) {
cout << i;
++count;
}
}
if (count)
cout << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, count, num, num_boll = 0;
cin >> N;
vector<int> array(N + 1), bolls(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> array.at(i);
}
for (int i = N; i > 0; i--) {
count = 2;
num = 0;
for (int j = i * count; j < N + 1; ++count, j = i * count) {
num += bolls.at(j);
}
bolls.at(i) = !(num % 2 == array.at(i));
num_boll += !(num % 2 == array.at(i));
}
count = 0;
cout << num_boll << endl;
for (int i = 1; i < N + 1; i++) {
if (count)
cout << " ";
if (bolls.at(i)) {
cout << i;
++count;
}
}
if (count)
cout << endl;
}
| [
"assignment.value.change",
"identifier.change"
] | 778,279 | 778,280 | u247407965 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, count, num, num_boll = 0;
cin >> N;
vector<int> array(N + 1), bolls(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> array.at(i);
}
for (int i = N; i > 0; i--) {
count = 2;
num = 0;
for (int j = i * count; j < N + 1; ++count, j = i * count) {
num += array.at(j);
}
bolls.at(i) = !(num % 2 == array.at(i));
num_boll = !(num % 2 == array.at(i));
}
count = 0;
cout << num_boll << endl;
for (int i = 1; i < N + 1; i++) {
if (count)
cout << " ";
if (bolls.at(i)) {
cout << i;
++count;
}
}
if (count)
cout << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, count, num, num_boll = 0;
cin >> N;
vector<int> array(N + 1), bolls(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> array.at(i);
}
for (int i = N; i > 0; i--) {
count = 2;
num = 0;
for (int j = i * count; j < N + 1; ++count, j = i * count) {
num += bolls.at(j);
}
bolls.at(i) = !(num % 2 == array.at(i));
num_boll += !(num % 2 == array.at(i));
}
count = 0;
cout << num_boll << endl;
for (int i = 1; i < N + 1; i++) {
if (count)
cout << " ";
if (bolls.at(i)) {
cout << i;
++count;
}
}
if (count)
cout << endl;
}
| [
"assignment.value.change",
"identifier.change"
] | 778,281 | 778,280 | u247407965 | cpp |
p02972 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
typedef long long int ll;
using namespace std;
int n;
int main() {
cin >> n;
vector<int> a(n + 1);
vector<int> ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
for (int j = i + i; j < n; j += i) {
a[i] += a[j];
}
a[i] %= 2;
if (a[i])
ans.pb(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i];
if (i + 1 < ans.size())
cout << " ";
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
typedef long long int ll;
using namespace std;
int n;
int main() {
cin >> n;
vector<int> a(n + 1);
vector<int> ans;
for (int i = 0; i < n; i++)
cin >> a[i + 1];
for (int i = n; i >= 1; i--) {
for (int j = i + i; j <= n; j += i) {
a[i] += a[j];
}
a[i] %= 2;
if (a[i])
ans.pb(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i];
if (i + 1 < ans.size())
cout << " ";
}
cout << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,282 | 778,283 | u628262476 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int n;
Int a[200005], b[200005];
cin >> n;
for (Int i = 1; i <= n; i++) {
cin >> a[i];
b[i] = 0;
}
Int m = 0;
for (Int i = n; i >= 1; i--) {
Int tmp = 0;
for (Int j = 2; j <= n / i; j++) {
tmp += b[i * j];
}
tmp += a[i];
if (tmp % 2 != a[i]) {
b[i] = a[i] == 0 ? 1 : 0;
} else {
b[i] = a[i];
}
m += b[i];
}
cout << m << endl;
for (Int i = 1; i < n; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int n;
Int a[200005], b[200005];
cin >> n;
for (Int i = 1; i <= n; i++) {
cin >> a[i];
b[i] = 0;
}
Int m = 0;
for (Int i = n; i >= 1; i--) {
Int tmp = 0;
for (Int j = 2; j <= n / i; j++) {
tmp += b[i * j];
}
tmp += a[i];
if (tmp % 2 != a[i]) {
b[i] = a[i] == 0 ? 1 : 0;
} else {
b[i] = a[i];
}
m += b[i];
}
cout << m << endl;
for (Int i = 1; i <= n; i++) {
if (b[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"
] | 778,287 | 778,288 | u026620445 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m) for (ll i = 0; i < m; i++)
#define FOR(i, n, m) for (ll i = n; i < m; i++)
#define INF 1000000007
#define INFL (1LL << 60)
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define pb push_back
#define ll long long int
#define P pair<ll, ll>
int main() {
int n;
cin >> n;
int a[n];
REP(i, n) cin >> a[i];
int ans[n];
REP(i, n) {
int x = n - i;
int count = 0, cp = 2;
while (cp * x < n) {
count += ans[cp * x];
cp++;
}
if (count % 2 == a[x - 1])
ans[x - 1] = 0;
else
ans[x - 1] = 1;
}
vector<int> b;
REP(i, n) if (ans[i] == 1) b.pb(i + 1);
cout << b.size() << endl;
REP(i, b.size()) {
cout << b[i];
if (i == b.size() - 1)
cout << endl;
else
cout << " ";
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m) for (ll i = 0; i < m; i++)
#define FOR(i, n, m) for (ll i = n; i < m; i++)
#define INF 1000000007
#define INFL (1LL << 60)
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define pb push_back
#define ll long long int
#define P pair<ll, ll>
int main() {
int n;
cin >> n;
int a[n];
REP(i, n) cin >> a[i];
int ans[n];
REP(i, n) {
int x = n - i;
int count = 0, cp = 2;
while (cp * x - 1 < n) {
count += ans[cp * x - 1];
cp++;
}
if (count % 2 == a[x - 1])
ans[x - 1] = 0;
else
ans[x - 1] = 1;
}
vector<int> b;
REP(i, n) if (ans[i] == 1) b.pb(i + 1);
cout << b.size() << endl;
REP(i, b.size()) {
cout << b[i];
if (i == b.size() - 1)
cout << endl;
else
cout << " ";
}
} | [
"control_flow.loop.condition.change",
"assignment.change"
] | 778,293 | 778,294 | u773548422 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define inputInt(a) \
int a; \
cin >> a;
#define inputInt2(a, b) \
int a; \
int b; \
cin >> a >> b;
#define inputInt3(a, b, c) \
int a; \
int b; \
int c; \
cin >> a >> b >> c;
#define inputLong(a) \
long a; \
cin >> a;
#define inputIntArray(a, N) \
int a[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i]; \
}
#define inputIntArray2(a, b, N) \
int a[N]; \
int b[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i] >> b[i]; \
}
#define output(answer) cout << answer << endl;
#define fN(i, N) for (int i = 0; i < N; i++)
#define fSE(i, s, e) for (int i = s; i <= e; i++)
int main() {
// input
inputInt(N);
inputIntArray(a, N);
// main
int total = 0;
vector<int> ans(N, 0);
for (int i = N; i > 0; i--) {
int counter = 0;
for (int j = 2; i * j <= N; j++) {
counter += ans[i * j - 1];
}
if (counter % 2 == a[i - 1]) {
ans[i - 1] = 0;
} else {
ans[i - 1] = 1;
total++;
}
}
// 出力
output(total);
fN(i, N) if (a[i] == 1) cout << i + 1 << " ";
// cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define inputInt(a) \
int a; \
cin >> a;
#define inputInt2(a, b) \
int a; \
int b; \
cin >> a >> b;
#define inputInt3(a, b, c) \
int a; \
int b; \
int c; \
cin >> a >> b >> c;
#define inputLong(a) \
long a; \
cin >> a;
#define inputIntArray(a, N) \
int a[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i]; \
}
#define inputIntArray2(a, b, N) \
int a[N]; \
int b[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i] >> b[i]; \
}
#define output(answer) cout << answer << endl;
#define fN(i, N) for (int i = 0; i < N; i++)
#define fSE(i, s, e) for (int i = s; i <= e; i++)
int main() {
// input
inputInt(N);
inputIntArray(a, N);
// main
int total = 0;
vector<int> ans(N, 0);
for (int i = N; i > 0; i--) {
int counter = 0;
for (int j = 2; i * j <= N; j++) {
counter += ans[i * j - 1];
}
if (counter % 2 == a[i - 1]) {
ans[i - 1] = 0;
} else {
ans[i - 1] = 1;
total++;
}
}
// 出力
output(total);
fN(i, N) if (ans[i] == 1) cout << i + 1 << " ";
cout << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,297 | 778,298 | u135358384 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
static int A[200010], X[200010] = {};
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = N; i >= 1; i--) {
int COUNT = 0;
for (int j = 2; i * j <= N; j++) {
COUNT += X[j];
}
if (COUNT % 2 == A[i])
X[i] = 0;
else
X[i] = 1;
}
int SUM = 0;
for (int i = 1; i <= N; i++)
SUM += X[i];
cout << SUM << endl;
for (int i = 1; i <= N; i++) {
if (X[i] == 1) {
cout << i;
SUM--;
if (SUM != 0)
cout << " ";
else
cout << endl;
}
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
static int A[200010], X[200010] = {};
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = N; i >= 1; i--) {
int COUNT = 0;
for (int j = 2; i * j <= N; j++) {
COUNT += X[i * j];
}
if (COUNT % 2 == A[i])
X[i] = 0;
else
X[i] = 1;
}
int SUM = 0;
for (int i = 1; i <= N; i++)
SUM += X[i];
cout << SUM << endl;
for (int i = 1; i <= N; i++) {
if (X[i] == 1) {
cout << i;
SUM--;
if (SUM != 0)
cout << " ";
else
cout << endl;
}
}
} | [
"assignment.change"
] | 778,305 | 778,306 | u454087021 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, from, to) for (int i = (from); i < (int)(to); i++)
#define repr(i, n) for (int i = (n - 1); 1 <= i; i--)
#define repr2(i, from, to) for (int i = (from - 1); (int)(to) <= i; i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define LLPair pair<ll, ll>
typedef long long ll;
using namespace std;
struct Point {
int x, y;
};
struct Edge {
int to, cost;
};
struct gNode {
int from, to, cost;
};
struct tNode {
int value;
int parent;
vector<int> child;
};
int dx[] = {-1, 0, 0, 1};
int dy[] = {0, -1, 1, 0};
int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int extgcd(int a, int b, int &x, int &y) {
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll mod_pow(ll x, ll n) {
if (n == 0)
return 1;
ll res = mod_pow(x * x % MOD, n / 2);
if (n & 1)
res = res * x % MOD;
return res;
}
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
int ans = 0;
bool flag = false;
vector<int> b(n + 1);
for (int i = n; i > 0; i--) {
int count = 0;
for (int j = i; j < n; j += i) {
if (b[j] == 1)
count++;
}
if (a[i] == 1) {
if (count % 2 == 0) {
// cout << i << endl;
b[i] = 1;
ans++;
}
} else {
if (count % 2 == 1) {
// cout << i << endl;
b[i] = 1;
ans++;
}
}
}
if (flag)
cout << -1 << endl;
else {
cout << ans << endl;
rep2(i, 1, n + 1) {
if (b[i] == 1)
cout << i << " ";
}
cout << endl;
}
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, from, to) for (int i = (from); i < (int)(to); i++)
#define repr(i, n) for (int i = (n - 1); 1 <= i; i--)
#define repr2(i, from, to) for (int i = (from - 1); (int)(to) <= i; i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define LLPair pair<ll, ll>
typedef long long ll;
using namespace std;
struct Point {
int x, y;
};
struct Edge {
int to, cost;
};
struct gNode {
int from, to, cost;
};
struct tNode {
int value;
int parent;
vector<int> child;
};
int dx[] = {-1, 0, 0, 1};
int dy[] = {0, -1, 1, 0};
int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int extgcd(int a, int b, int &x, int &y) {
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll mod_pow(ll x, ll n) {
if (n == 0)
return 1;
ll res = mod_pow(x * x % MOD, n / 2);
if (n & 1)
res = res * x % MOD;
return res;
}
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
int ans = 0;
bool flag = false;
vector<int> b(n + 1);
for (int i = n; i > 0; i--) {
int count = 0;
for (int j = i; j <= n; j += i) {
if (b[j] == 1)
count++;
}
if (a[i] == 1) {
if (count % 2 == 0) {
b[i] = 1;
ans++;
}
} else {
if (count % 2 == 1) {
b[i] = 1;
ans++;
}
}
}
if (flag)
cout << -1 << endl;
else {
cout << ans << endl;
rep2(i, 1, n + 1) {
if (b[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"
] | 778,307 | 778,308 | u117734686 | cpp |
p02972 | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, M = 0;
ll i, j;
ll tmp;
cin >> N;
ll a[N + 1], b[N + 1];
for (i = 1; i <= N; i++) {
cin >> a[i];
b[i] = 0;
}
for (i = N; i > 0; i--) {
tmp = 0;
j = i;
while (tmp <= N) {
tmp = (tmp + b[j]) % 2;
j += i;
}
b[i] = (tmp + a[i]) % 2;
if (b[i] == 1)
M++;
}
cout << M << endl;
for (i = 1; i <= N; i++) {
if (b[i] == 1)
cout << i << " ";
}
return 0;
} | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, M = 0;
ll i, j;
ll tmp;
cin >> N;
ll a[N + 1], b[N + 1];
for (i = 1; i <= N; i++) {
cin >> a[i];
b[i] = 0;
}
for (i = N; i > 0; i--) {
tmp = 0;
j = i;
while (j <= N) {
tmp = (tmp + b[j]) % 2;
j += i;
}
b[i] = (tmp + a[i]) % 2;
if (b[i] == 1)
M++;
}
cout << M << endl;
for (i = 1; i <= N; i++) {
if (b[i] == 1)
cout << i << " ";
}
return 0;
} | [
"identifier.change",
"control_flow.loop.condition.change"
] | 778,309 | 778,310 | u770161743 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) { cin >> a[i + 1]; }
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 ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; ++i) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
if (ans.size() == 0)
return 0;
rep(i, ans.size()) {
if (i != 0)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) { cin >> a[i + 1]; }
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];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; ++i) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
if (ans.size() == 0)
return 0;
rep(i, ans.size()) {
if (i != 0)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 778,311 | 778,312 | u292106243 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define loop(i, n) rep(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
rep(i, 1, 1 + n) cin >> a[i];
int cnt = 0;
for (int i = n; i > 0; --i) {
int tmp = a[i];
int j = 2 * i;
while (j < n) {
tmp ^= a[j];
j += i;
}
b[i] = tmp;
cnt += tmp;
}
cout << cnt << endl;
rep(i, 1, 1 + n) if (b[i] > 0) cout << i << " ";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define loop(i, n) rep(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
rep(i, 1, 1 + n) cin >> a[i];
int cnt = 0;
for (int i = n; i > 0; --i) {
int tmp = a[i];
int j = 2 * i;
while (j <= n) {
tmp ^= b[j];
j += i;
}
b[i] = tmp;
cnt += tmp;
}
cout << cnt << endl;
rep(i, 1, 1 + n) if (b[i] > 0) cout << i << " ";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change"
] | 778,313 | 778,314 | u350561621 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define loop(i, n) rep(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
rep(i, 1, 1 + n) cin >> a[i];
int cnt = 0;
for (int i = n; i > 0; --i) {
int tmp = a[i];
int j = 2 * i;
while (j < n) {
tmp ^= b[j];
j += i;
}
b[i] = tmp;
cnt += tmp;
}
cout << cnt << endl;
rep(i, 1, 1 + n) if (b[i] > 0) cout << i << " ";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define loop(i, n) rep(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1, 0);
rep(i, 1, 1 + n) cin >> a[i];
int cnt = 0;
for (int i = n; i > 0; --i) {
int tmp = a[i];
int j = 2 * i;
while (j <= n) {
tmp ^= b[j];
j += i;
}
b[i] = tmp;
cnt += tmp;
}
cout << cnt << endl;
rep(i, 1, 1 + n) if (b[i] > 0) cout << i << " ";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 778,315 | 778,314 | u350561621 | cpp |
p02972 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define irep1(i, a, n) for (int i = a; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(X, x) for (auto &&X : x)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "../../Lib/cout_container.hpp"
#define debug(x) cerr << #x " => " << x << endl
#else
#define debug(x) 0
#endif
using lint = long long;
constexpr int INF = 1 << 30;
constexpr lint INFL = 1LL << 62;
constexpr int MOD = (int)1e9 + 7;
constexpr double EPS = 1e-9;
using namespace std;
namespace {
struct INIT {
INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} INIT;
} // namespace
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1), ans(n + 1, -1);
rep1(i, n) cin >> a[i];
rrep1(i, n) {
bool sum = false;
for (int j = 2; j < n / i; ++j)
sum ^= ans[i * j];
ans[i] = a[i] ^ sum;
}
cout << count(all(ans), 1) << endl;
bool b = true;
rep1(i, n) {
if (ans[i] == 1) {
cout << (b ? "" : " ") << i;
b = false;
}
}
return 0;
} | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define irep1(i, a, n) for (int i = a; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(X, x) for (auto &&X : x)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "../../Lib/cout_container.hpp"
#define debug(x) cerr << #x " => " << x << endl
#else
#define debug(x) 0
#endif
using lint = long long;
constexpr int INF = 1 << 30;
constexpr lint INFL = 1LL << 62;
constexpr int MOD = (int)1e9 + 7;
constexpr double EPS = 1e-9;
using namespace std;
namespace {
struct INIT {
INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} INIT;
} // namespace
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1), ans(n + 1, -1);
rep1(i, n) cin >> a[i];
rrep1(i, n) {
bool sum = false;
for (int j = 2; j <= n / i; ++j)
sum ^= ans[i * j];
ans[i] = a[i] ^ sum;
}
cout << count(all(ans), 1) << endl;
bool b = true;
rep1(i, n) {
if (ans[i] == 1) {
cout << (b ? "" : " ") << i;
b = false;
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,318 | 778,319 | u020746846 | cpp |
p02972 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define irep1(i, a, n) for (int i = a; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(X, x) for (auto &&X : x)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "../../Lib/cout_container.hpp"
#define debug(x) cerr << #x " => " << x << endl
#else
#define debug(x) 0
#endif
using lint = long long;
constexpr int INF = 1 << 30;
constexpr lint INFL = 1LL << 62;
constexpr int MOD = (int)1e9 + 7;
constexpr double EPS = 1e-9;
using namespace std;
namespace {
struct INIT {
INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} INIT;
} // namespace
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1), ans(n + 1, -1);
rep1(i, n) cin >> a[i];
rrep1(i, n) {
bool sum = false;
for (int j = 2; j < n / i; ++j)
sum ^= ans[i * j];
ans[i] = a[i] ^ sum;
}
cout << count(all(ans), 1) << endl;
bool b = true;
rep1(i, n) {
if (ans[i] == 1)
cout << (b ? "" : " ") << i;
b = false;
}
return 0;
} | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define irep1(i, a, n) for (int i = a; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(X, x) for (auto &&X : x)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "../../Lib/cout_container.hpp"
#define debug(x) cerr << #x " => " << x << endl
#else
#define debug(x) 0
#endif
using lint = long long;
constexpr int INF = 1 << 30;
constexpr lint INFL = 1LL << 62;
constexpr int MOD = (int)1e9 + 7;
constexpr double EPS = 1e-9;
using namespace std;
namespace {
struct INIT {
INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} INIT;
} // namespace
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1), ans(n + 1, -1);
rep1(i, n) cin >> a[i];
rrep1(i, n) {
bool sum = false;
for (int j = 2; j <= n / i; ++j)
sum ^= ans[i * j];
ans[i] = a[i] ^ sum;
}
cout << count(all(ans), 1) << endl;
bool b = true;
rep1(i, n) {
if (ans[i] == 1) {
cout << (b ? "" : " ") << i;
b = false;
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,320 | 778,319 | u020746846 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n; i > 0; i--)
#define arep(a, i, n) for (int i = (a); i < (n); i++)
#define SORT(v) sort((v).begin(), (v).end())
#define TEMP(type, x, y) \
do { \
temp temp = x, x = y, y = temp \
} while (0)
const ll INF = (1LL << 50);
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
REP(i, N) cin >> a[i + 1];
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]; // 1が偶数個のとき0となる
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= N; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
REP(i, ans.size()) {
if (i < ans.size() - 1)
cout << ans[i] << " ";
else
cout << ans[i] << endl;
}
return 0;
} | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n; i > 0; i--)
#define arep(a, i, n) for (int i = (a); i < (n); i++)
#define SORT(v) sort((v).begin(), (v).end())
#define TEMP(type, x, y) \
do { \
temp temp = x, x = y, y = temp \
} while (0)
const ll INF = (1LL << 50);
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
REP(i, N) cin >> a[i + 1];
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];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= N; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
REP(i, ans.size()) {
if (i < ans.size() - 1)
cout << ans[i] << " ";
else
cout << ans[i] << endl;
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 778,321 | 778,322 | u169580012 | cpp |
p02972 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n; i > 0; i--)
#define arep(a, i, n) for (int i = (a); i < (n); i++)
#define SORT(v) sort((v).begin(), (v).end())
#define TEMP(type, x, y) \
do { \
temp temp = x, x = y, y = temp \
} while (0)
const ll INF = (1LL << 50);
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
REP(i, N) cin >> a[i + 1];
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]; // 1が偶数個のとき0となる
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= N; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
REP(i, ans.size()) {
if (i < N - 1)
cout << ans[i] << " ";
else
cout << ans[i] << endl;
}
return 0;
} | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n; i > 0; i--)
#define arep(a, i, n) for (int i = (a); i < (n); i++)
#define SORT(v) sort((v).begin(), (v).end())
#define TEMP(type, x, y) \
do { \
temp temp = x, x = y, y = temp \
} while (0)
const ll INF = (1LL << 50);
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
REP(i, N) cin >> a[i + 1];
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];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= N; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
REP(i, ans.size()) {
if (i < ans.size() - 1)
cout << ans[i] << " ";
else
cout << ans[i] << endl;
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 778,323 | 778,322 | u169580012 | cpp |
p02972 | #include <cstdio>
#include <iostream>
#define N 200005
using namespace std;
int n, c, s, a[N], ans[N];
int main() {
int i, j;
cin >> n;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = n; i >= 1; i--) {
s = 0;
for (j = 2; i * j <= n; j++)
s += ans[j];
ans[i] = s % 2 != a[i];
c += ans[i];
}
cout << c << endl;
for (i = 1; i <= n; i++)
if (ans[i])
printf("%d ", i);
return 0;
} | #include <cstdio>
#include <iostream>
#define N 200005
using namespace std;
int n, c, s, a[N], ans[N];
int main() {
int i, j;
cin >> n;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = n; i >= 1; i--) {
s = 0;
for (j = 2; i * j <= n; j++)
s += ans[i * j];
ans[i] = s % 2 != a[i];
c += ans[i];
}
cout << c << endl;
for (i = 1; i <= n; i++)
if (ans[i])
printf("%d ", i);
return 0;
} | [
"assignment.change"
] | 778,330 | 778,331 | u230265105 | cpp |
p02972 | #include <cstdio>
#include <iostream>
#define N 200005
using namespace std;
int n, c, s, a[N], ans[N];
int main() {
int i, j;
cin >> n;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = n; i >= 1; i--) {
for (j = 2; i * j <= n; j++)
s += ans[j];
ans[i] = s % 2 != a[i];
c += ans[i];
}
cout << c << endl;
for (i = 1; i <= n; i++)
if (ans[i])
printf("%d ", i);
return 0;
} | #include <cstdio>
#include <iostream>
#define N 200005
using namespace std;
int n, c, s, a[N], ans[N];
int main() {
int i, j;
cin >> n;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = n; i >= 1; i--) {
s = 0;
for (j = 2; i * j <= n; j++)
s += ans[i * j];
ans[i] = s % 2 != a[i];
c += ans[i];
}
cout << c << endl;
for (i = 1; i <= n; i++)
if (ans[i])
printf("%d ", i);
return 0;
} | [
"assignment.add",
"assignment.change"
] | 778,332 | 778,331 | u230265105 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n);
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2; (i + 1) * j <= n; j++) {
sum ^= a[(i + 1) * j - 1];
}
if (b[i] = (a[i] ^ sum))
ans++;
}
cout << ans << endl;
rep(i, n) if (b[i]) cout << i + 1 << " ";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n);
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2; (i + 1) * j <= n; j++) {
sum ^= b[(i + 1) * j - 1];
}
if (b[i] = (a[i] ^ sum))
ans++;
}
cout << ans << endl;
rep(i, n) if (b[i]) cout << i + 1 << " ";
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 778,337 | 778,338 | u129667379 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n);
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2; (i + 1) * j <= n; j++) {
sum ^= a[(i + 1) * j - 1];
}
if (b[i] = a[i] ^ sum)
ans++;
}
cout << ans << endl;
rep(i, n) if (a[i]) cout << i + 1 << " ";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n);
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2; (i + 1) * j <= n; j++) {
sum ^= b[(i + 1) * j - 1];
}
if (b[i] = (a[i] ^ sum))
ans++;
}
cout << ans << endl;
rep(i, n) if (b[i]) cout << i + 1 << " ";
return 0;
} | [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,339 | 778,338 | u129667379 | cpp |
p02972 | #include <iostream>
using namespace std;
int main() {
int N, a[200001], k[200001];
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
int m = 0;
for (int i = N; i > 0; i--) {
int j = 0, n = 0;
while (j <= N) {
n += k[j];
j += i;
}
if (n % 2 != a[i]) {
k[i] = 1;
m += 1;
}
}
cout << m << endl;
for (int i = 0; i < N; i++) {
if (k[i] == 1)
cout << "1 ";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, a[200001], k[200001];
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
int m = 0;
for (int i = N; i > 0; i--) {
int j = 0, n = 0;
while (j <= N) {
n += k[j];
j += i;
}
if (n % 2 != a[i]) {
k[i] = 1;
m += 1;
}
}
cout << m << endl;
for (int i = 0; i <= N; i++) {
if (k[i] == 1)
cout << i << " ";
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change",
"literal.string.change"
] | 778,349 | 778,350 | u204523044 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
int *a;
a = new int[n + 1];
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
/*for (int i = 1; i < n+1; i++)
{
cout << a[i] << endl;
}*/
int *b;
b = new int[n + 1];
for (int i = 1; i < n + 1; i++) {
b[i] = 0;
}
int temp;
int index;
int sum = 0;
for (int i = n; i > 0; i--) {
temp = n / i;
for (int j = 1; j < temp + 1; j++) {
index = i * j;
sum += b[index];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
sum = 0;
}
int flag = 0;
int counter = 0;
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1) {
counter++;
}
}
if (counter != 0) {
cout << counter << endl;
}
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1) {
cout << b[i] << " ";
flag = 1;
}
}
if (flag == 0) {
cout << 0 << endl;
} else {
cout << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
int *a;
a = new int[n + 1];
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
/*for (int i = 1; i < n+1; i++)
{
cout << a[i] << endl;
}*/
int *b;
b = new int[n + 1];
for (int i = 1; i < n + 1; i++) {
b[i] = 0;
}
int temp;
int index;
int sum = 0;
for (int i = n; i > 0; i--) {
temp = n / i;
for (int j = 1; j < temp + 1; j++) {
index = i * j;
sum += b[index];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
sum = 0;
}
int flag = 0;
int counter = 0;
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1) {
counter++;
}
}
if (counter != 0) {
cout << counter << endl;
}
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1) {
cout << i << " ";
flag = 1;
}
}
if (flag == 0) {
cout << 0 << endl;
} else {
cout << endl;
}
} | [] | 778,356 | 778,357 | u397070717 | cpp |
p02972 | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; 1LL * j * j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;
for (int i = N; i >= 1; --i) {
if (count_up(i) != A[i]) {
B[i] = 1;
++M;
}
}
printf("%d\n", M);
for (int i = 1; i <= N; ++i) {
if (B[i])
printf("%d ", i);
}
putchar('\n');
return 0;
} | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;
for (int i = N; i >= 1; --i) {
if (count_up(i) != A[i]) {
B[i] = 1;
++M;
}
}
printf("%d\n", M);
for (int i = 1; i <= N; ++i) {
if (B[i])
printf("%d ", i);
}
putchar('\n');
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 778,368 | 778,369 | u801608329 | cpp |
p02972 | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; j * j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;
for (int i = N; i >= 1; --i) {
if (count_up(i) != A[i]) {
B[i] = 1;
++M;
}
}
printf("%d\n", M);
for (int i = 1; i <= N; ++i) {
if (B[i])
printf("%d ", i);
}
putchar('\n');
return 0;
} | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;
for (int i = N; i >= 1; --i) {
if (count_up(i) != A[i]) {
B[i] = 1;
++M;
}
}
printf("%d\n", M);
for (int i = 1; i <= N; ++i) {
if (B[i])
printf("%d ", i);
}
putchar('\n');
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 778,370 | 778,369 | u801608329 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int q = n / i;
int s = a[i];
int c = 0;
for (int m = q; m >= 1; m--) {
if (m == 1) {
ans[i] = (s + c) % 2;
} else {
c += a[i * m];
c %= 2;
}
}
}
vector<int> out;
for (int i = 1; i <= n; i++) {
if (ans[i] % 2 != 0) {
out.push_back(i);
}
}
cout << out.size() << endl;
if (out.size()) {
for (int i = 0; i < out.size(); i++) {
if (i == 0)
cout << out[i];
else
cout << " " << out[i];
}
cout << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int q = n / i;
int s = a[i];
int c = 0;
for (int m = q; m >= 1; m--) {
if (m == 1) {
ans[i] = (s + c) % 2;
} else {
c += ans[i * m];
c %= 2;
}
}
}
vector<int> out;
for (int i = 1; i <= n; i++) {
if (ans[i] % 2 != 0) {
out.push_back(i);
}
}
cout << out.size() << endl;
if (out.size()) {
for (int i = 0; i < out.size(); i++) {
if (i == 0)
cout << out[i];
else
cout << " " << out[i];
}
cout << endl;
}
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 778,375 | 778,376 | u007567244 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; ++i)
cin >> A[i];
int box[N];
for (int i = 0; i < N; ++i)
box[i] = 0;
int ball = 0;
for (int i = N - 1; i >= N / 2; --i) {
if (A[i] != 0) {
box[i] = 1;
++ball;
}
}
for (int i = N / 2 - 1; i >= 0; --i) {
int cnt = 0;
for (int j = i; j < N; j += i + 1) {
if (box[i] != 0)
++cnt;
}
if (cnt % 2 != A[i]) {
box[i] = 1;
++ball;
}
}
cout << ball << endl;
bool flag = false;
for (int i = 0; i < N; ++i) {
if (box[i] != 0) {
cout << i + 1 << " ";
flag = true;
}
}
if (flag)
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; ++i)
cin >> A[i];
int box[N];
for (int i = 0; i < N; ++i)
box[i] = 0;
int ball = 0;
for (int i = N - 1; i >= N / 2; --i) {
if (A[i] != 0) {
box[i] = 1;
++ball;
}
}
for (int i = N / 2 - 1; i >= 0; --i) {
int cnt = 0;
for (int j = i; j < N; j += i + 1) {
if (box[j] != 0)
++cnt;
}
if (cnt % 2 != A[i]) {
box[i] = 1;
++ball;
}
}
cout << ball << endl;
bool flag = false;
for (int i = 0; i < N; ++i) {
if (box[i] != 0) {
cout << i + 1 << " ";
flag = true;
}
}
if (flag)
cout << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 778,377 | 778,378 | u816645498 | cpp |
p02972 | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
int main(int argc, char *argv[]) {
int n;
scanf("%d", &n);
vector<int> a(n + 1);
int i;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int cnt = 0;
vector<int> b(n + 1);
for (i = n; i >= 1; i--) {
int sum = 0;
int k;
for (k = i + i; k < n; k += i) {
sum += b[k];
}
b[i] = (sum % 2 == 0 ? a[i] : 1 - a[i]);
if (b[i])
cnt++;
}
printf("%d\n", cnt);
for (i = 1; i <= n; i++) {
if (b[i])
printf("%d ", i);
}
printf("\n");
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
int main(int argc, char *argv[]) {
int n;
scanf("%d", &n);
vector<int> a(n + 1);
int i;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int cnt = 0;
vector<int> b(n + 1);
for (i = n; i >= 1; i--) {
int sum = 0;
int k;
for (k = i + i; k <= n; k += i) {
sum += b[k];
}
b[i] = (sum % 2 == 0 ? a[i] : 1 - a[i]);
if (b[i])
cnt++;
}
printf("%d\n", cnt);
for (i = 1; i <= n; i++) {
if (b[i])
printf("%d ", i);
}
printf("\n");
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,379 | 778,380 | u209713918 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, ansnum = 0;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans(n + 1, 0);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
ll sum = 0;
for (ll j = i; j < n; j += i) {
sum += ans[j];
}
if (sum % 2 != a[i]) {
ans[i] = 1;
ansnum++;
}
}
cout << ansnum << endl;
for (ll i = 1; i <= n; i++) {
if (ans[i] == 1)
cout << i << ' ';
}
}
| #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, ansnum = 0;
cin >> n;
vector<int> a(n + 1, 0);
vector<int> ans(n + 1, 0);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
for (ll i = n; i >= 1; i--) {
ll sum = 0;
for (ll j = 2 * i; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 != a[i]) {
ans[i] = 1;
ansnum++;
}
}
cout << ansnum << endl;
for (ll i = 1; i <= n; i++) {
if (ans[i] == 1)
cout << i << ' ';
}
}
| [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,385 | 778,384 | u778738287 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
REP(i, N) cin >> a[i + 1];
vector<int> b(N + 1);
for (int i = N; i >= 1; i--) {
int tmp = 0;
for (int j = i + i; j <= N; j += i) {
tmp += b[j];
}
if (tmp % 2 == a[i] % 2) {
b[i] = 0;
} else {
b[i] = 1;
}
}
vector<int> ans;
for (int i = 1; i <= N; i++) {
if (a[i])
ans.push_back(i);
}
cout << ans.size() << endl;
REP(i, ans.size()) {
printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' ');
}
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
REP(i, N) cin >> a[i + 1];
vector<int> b(N + 1);
for (int i = N; i >= 1; i--) {
int tmp = 0;
for (int j = i + i; j <= N; j += i) {
tmp += b[j];
}
if (tmp % 2 == a[i] % 2) {
b[i] = 0;
} else {
b[i] = 1;
}
}
vector<int> ans;
for (int i = 1; i <= N; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
REP(i, ans.size()) {
printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' ');
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,386 | 778,387 | u689844566 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int A[N + 1];
for (int i = 1; i <= N; i++)
cin >> A[i];
int B[N + 1];
for (int i = N / 2 + 1; i <= N; i++) {
B[i] = A[i];
}
for (int i = N / 2; i >= 1; i--) {
int k = 2 * i;
int flag = 0;
while (k <= N) {
if (B[k]) {
flag += 1;
flag %= 2;
}
k += i;
}
if (flag == A[i])
B[i] = 0;
else
B[i] = 1;
}
int cnt = 0;
for (int i = 1; i <= N; i++)
cnt += B[i];
cout << cnt << endl;
for (int i = 1; i <= N; i++)
if (B[i])
cout << B[i] << " ";
if (cnt)
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int A[N + 1];
for (int i = 1; i <= N; i++)
cin >> A[i];
int B[N + 1];
for (int i = N / 2 + 1; i <= N; i++) {
B[i] = A[i];
}
for (int i = N / 2; i >= 1; i--) {
int k = 2 * i;
int flag = 0;
while (k <= N) {
if (B[k]) {
flag += 1;
flag %= 2;
}
k += i;
}
if (flag == A[i])
B[i] = 0;
else
B[i] = 1;
}
int cnt = 0;
for (int i = 1; i <= N; i++)
cnt += B[i];
cout << cnt << endl;
for (int i = 1; i <= N; i++)
if (B[i])
cout << i << " ";
if (cnt)
cout << endl;
} | [] | 778,388 | 778,389 | u138486156 | cpp |
p02972 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))
typedef long long LL;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
} // C++14
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t,
const V &v) {
t = v;
}
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t,
const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(tail) != 0) {
std::cout << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void print(std::vector<T> &v) {
for (auto &a : v) {
std::cout << a;
if (&a != &v.back()) {
std::cout << " ";
}
}
std::cout << std::endl;
}
template <class T> void print(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
inline bool inside(long long y, long long x, long long H, long long W) {
return 0 <= y and y < H and 0 <= x and x < W;
}
template <class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) {
return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
template <class T> inline std::vector<T> unique(std::vector<T> v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
return n * (2 * s + (n - 1) * d) / 2;
}
// 2のべき乗数かどうか
bool is_power_of_two(long long x) { return !(x & (x - 1)); }
// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
long long ans = v[0];
for (int i = 1; i < (int)v.size(); ++i) {
ans = gcd(ans, v[i]);
}
return ans;
}
// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0}; // 右，下
const std::vector<int> dy4 = {0, 1, 0, -1},
dx4 = {1, 0, -1, 0}; // 右，下，左，上
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1},
dx8 = {1, 0, -1, 0, 1, 1, -1, -1};
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL N;
cin >> N;
auto A = make_v<int>(N + 1);
FOR(i, 0, N) { cin >> A[i + 1]; }
int num_one = 0;
auto ans = make_v<int>(N + 1);
for (int i = N; i > 0; --i) {
int num = 0;
int count = 1;
while (i * count <= N) {
num += ans[i * count];
count++;
}
if (num % 2 != A[i]) {
ans[i] = 1;
num_one++;
}
}
print(num_one);
FOR(i, 1, N + 1) {
if (ans[i] == 1) {
cout << ans[i] << " ";
}
}
cout << endl;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))
typedef long long LL;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
} // C++14
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t,
const V &v) {
t = v;
}
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t,
const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(tail) != 0) {
std::cout << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void print(std::vector<T> &v) {
for (auto &a : v) {
std::cout << a;
if (&a != &v.back()) {
std::cout << " ";
}
}
std::cout << std::endl;
}
template <class T> void print(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
inline bool inside(long long y, long long x, long long H, long long W) {
return 0 <= y and y < H and 0 <= x and x < W;
}
template <class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) {
return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
template <class T> inline std::vector<T> unique(std::vector<T> v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
return n * (2 * s + (n - 1) * d) / 2;
}
// 2のべき乗数かどうか
bool is_power_of_two(long long x) { return !(x & (x - 1)); }
// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
long long ans = v[0];
for (int i = 1; i < (int)v.size(); ++i) {
ans = gcd(ans, v[i]);
}
return ans;
}
// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0}; // 右，下
const std::vector<int> dy4 = {0, 1, 0, -1},
dx4 = {1, 0, -1, 0}; // 右，下，左，上
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1},
dx8 = {1, 0, -1, 0, 1, 1, -1, -1};
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL N;
cin >> N;
auto A = make_v<int>(N + 1);
FOR(i, 0, N) { cin >> A[i + 1]; }
int num_one = 0;
auto ans = make_v<int>(N + 1);
for (int i = N; i > 0; --i) {
int num = 0;
int count = 1;
while (i * count <= N) {
num += ans[i * count];
count++;
}
if (num % 2 != A[i]) {
ans[i] = 1;
num_one++;
}
}
print(num_one);
FOR(i, 1, N + 1) {
if (ans[i] == 1) {
cout << i << " ";
}
}
cout << endl;
return 0;
} | [] | 778,394 | 778,395 | u596276291 | cpp |
p02972 | #include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
const int N = 2e5 + 5, mod = 1e9 + 7;
int val[N];
int main() {
int n;
cin >> n;
int a[n + 1];
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i > 0; i--) {
int sum = 0;
for (ll j = i * 2; j < n; j += i)
sum += val[j];
if (sum != a[i])
vec.push_back(i), val[i] = 1;
else
val[i] = 0;
}
cout << vec.size() << endl;
for (auto i : vec)
cout << i << " ";
cout << endl;
} | #include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
const int N = 2e5 + 5, mod = 1e9 + 7;
int val[N];
int main() {
int n;
cin >> n;
int a[n + 1];
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i > 0; i--) {
int sum = 0;
for (ll j = i * 2; j <= n; j += i)
sum += val[j];
if (sum % 2 != a[i])
vec.push_back(i), val[i] = 1;
else
val[i] = 0;
}
cout << vec.size() << endl;
for (auto i : vec)
cout << i << " ";
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 778,400 | 778,399 | u951561009 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (ll i = (begin)-1; i >= (end); i--)
#define IREP(i, n) IFOR(i, n, 0)
#define SORT(a) sort(a.begin(), a.end())
#define ISORT(a) sort(a.begin(), a.end(), greater<ll>())
#define REVERSE(a) reverse(a.begin(), a.end())
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=(" << v[0]; \
FOR(i_debug, 1, v.size()) { cout << "," << v[i_debug]; } \
cout << ")" << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
}
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define ll long long
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define INF 1000000000000000000
using vec = vector<ll>;
using mat = vector<vec>;
using Pii = pair<ll, ll>;
using PiP = pair<ll, Pii>;
using PPi = pair<Pii, ll>;
using bvec = vector<bool>;
using Pvec = vector<Pii>;
template <typename T> void readv(vector<T> &a) { REP(i, a.size()) cin >> a[i]; }
void readv_m1(vector<int> &a) {
REP(i, a.size()) {
cin >> a[i];
a[i]--;
}
}
ll mod = 1000000007;
int main() {
ll N;
cin >> N;
vec a(N + 1);
REP(i, N) { cin >> a[i + 1]; }
vec ans(N + 1, -1);
IFOR(i, N + 1, 1) {
ll sum = a[i];
for (ll j = i; j <= N; j += i) {
if (ans[j] != -1)
sum += ans[j] % 2;
}
sum %= 2;
ans[i] = sum % 2;
}
ll M = 0;
vec b(0);
FOR(i, 1, N + 1) {
if (ans[i])
M++;
b.emplace_back(i);
// cout << ans[i] << endl;
}
cout << M << endl;
REP(i, M - 1) { cout << b[i] << " "; }
if (M > 0)
cout << b[M - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (ll i = (begin)-1; i >= (end); i--)
#define IREP(i, n) IFOR(i, n, 0)
#define SORT(a) sort(a.begin(), a.end())
#define ISORT(a) sort(a.begin(), a.end(), greater<ll>())
#define REVERSE(a) reverse(a.begin(), a.end())
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=(" << v[0]; \
FOR(i_debug, 1, v.size()) { cout << "," << v[i_debug]; } \
cout << ")" << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
}
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define ll long long
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define INF 1000000000000000000
using vec = vector<ll>;
using mat = vector<vec>;
using Pii = pair<ll, ll>;
using PiP = pair<ll, Pii>;
using PPi = pair<Pii, ll>;
using bvec = vector<bool>;
using Pvec = vector<Pii>;
template <typename T> void readv(vector<T> &a) { REP(i, a.size()) cin >> a[i]; }
void readv_m1(vector<int> &a) {
REP(i, a.size()) {
cin >> a[i];
a[i]--;
}
}
ll mod = 1000000007;
int main() {
ll N;
cin >> N;
vec a(N + 1);
REP(i, N) { cin >> a[i + 1]; }
vec ans(N + 1, -1);
IFOR(i, N + 1, 1) {
ll sum = a[i];
for (ll j = i; j <= N; j += i) {
if (ans[j] != -1)
sum += ans[j] % 2;
}
sum %= 2;
// debug(sum);
ans[i] = sum % 2;
// vdebug(ans);
}
ll M = 0;
vec b(0);
FOR(i, 1, N + 1) {
if (ans[i]) {
M++;
b.emplace_back(i);
}
// cout << ans[i] << endl;
}
cout << M << endl;
REP(i, M - 1) { cout << b[i] << " "; }
if (M > 0)
cout << b[M - 1] << endl;
return 0;
} | [] | 778,417 | 778,418 | u973797979 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
REP(i, n) scanf("%d", &a[i]);
int box[n] = {};
int cnt = 0;
REPR(i, n - 1) {
int sum = 0;
for (int j = 2 * (i + 1); j < n; j += (i + 1))
sum += box[j - 1];
if (sum % 2 != a[i]) {
box[i]++;
cnt++;
}
}
printf("%d\n", cnt);
REP(i, n) if (box[i]) printf("%d ", i + 1);
printf("\n");
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
REP(i, n) scanf("%d", &a[i]);
int box[n] = {};
int cnt = 0;
REPR(i, n - 1) {
int sum = 0;
for (int j = 2 * (i + 1); j < n + 1; j += (i + 1))
sum += box[j - 1];
if (sum % 2 != a[i]) {
box[i]++;
cnt++;
}
}
printf("%d\n", cnt);
REP(i, n) if (box[i]) printf("%d ", i + 1);
printf("\n");
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 778,419 | 778,420 | u283907492 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
REP(i, n) scanf("%d", &a[i]);
int box[n] = {};
int cnt = 0;
REPR(i, n) {
int sum = 0;
for (int j = 2 * (i + 1); j < n; j += (i + 1))
sum += box[j - 1];
if (sum % 2 != a[i]) {
box[i]++;
cnt++;
}
}
printf("%d\n", cnt);
REP(i, n) if (box[i] > 0) printf("%d ", i + 1);
printf("\n");
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
REP(i, n) scanf("%d", &a[i]);
int box[n] = {};
int cnt = 0;
REPR(i, n - 1) {
int sum = 0;
for (int j = 2 * (i + 1); j < n + 1; j += (i + 1))
sum += box[j - 1];
if (sum % 2 != a[i]) {
box[i]++;
cnt++;
}
}
printf("%d\n", cnt);
REP(i, n) if (box[i]) printf("%d ", i + 1);
printf("\n");
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 778,421 | 778,420 | u283907492 | cpp |
p02972 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
vector<int> res;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1];
a[0] = 0;
b[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
b[i + 1] = 0;
}
int sum;
for (int i = n; i > 0; i--) {
sum = 0;
for (int j = i + i; j <= n; j += i) {
sum = sum ^ a[j];
}
b[i] = sum ^ a[i];
}
for (int i = 1; i <= n; i++) {
if (b[i]) {
res.push_back(i);
}
}
cout << res.size() << endl;
for (int i = 0; i < res.size(); i++) {
cout << res[i] << " ";
}
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
vector<int> res;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1];
a[0] = 0;
b[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
b[i + 1] = 0;
}
int sum;
for (int i = n; i > 0; i--) {
sum = 0;
for (int j = i + i; j <= n; j += i) {
sum = sum ^ b[j];
}
b[i] = sum ^ a[i];
}
for (int i = 1; i <= n; i++) {
if (b[i]) {
res.push_back(i);
}
}
cout << res.size() << endl;
for (int i = 0; i < res.size(); i++) {
cout << res[i] << " ";
}
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 778,429 | 778,428 | u767785562 | cpp |
p02972 | #include <bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> ans(N + 1, 0);
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = 2 * i; j <= N; j += i) {
cnt += ans[j];
}
ans[i] = abs(cnt % 2 - a[i]);
}
int ball = 0;
for (int i = 1; i <= N; i++)
ball += ans[i];
cout << ball << endl;
for (int i = 1; i <= N; i++)
if (ans[i])
cout << ans[i] << endl;
} | #include <bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> ans(N + 1, 0);
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = 2 * i; j <= N; j += i) {
cnt += ans[j];
}
ans[i] = abs(cnt % 2 - a[i]);
}
int ball = 0;
for (int i = 1; i <= N; i++)
ball += ans[i];
cout << ball << endl;
for (int i = 1; i <= N; i++)
if (ans[i])
cout << i << endl;
} | [] | 778,432 | 778,433 | u149468221 | cpp |
p02972 | #include <cstdio>
#include <iostream>
using namespace std;
int n, cnt;
int a[200005];
int b[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = n; i >= 1; i--) {
bool v = a[i];
for (int j = i * 2; j <= n; j++) {
v ^= b[j];
}
b[i] = v;
if (b[i])
cnt++;
}
printf("%d\n", cnt);
for (int i = 1; i <= n; i++) {
if (b[i])
printf("%d ", i);
}
return 0;
}
| #include <cstdio>
#include <iostream>
using namespace std;
int n, cnt;
int a[200005];
int b[200005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = n; i >= 1; i--) {
bool v = a[i];
for (int j = i * 2; j <= n; j += i) {
v ^= b[j];
}
b[i] = v;
if (b[i])
cnt++;
}
printf("%d\n", cnt);
for (int i = 1; i <= n; i++) {
if (b[i])
printf("%d ", i);
}
return 0;
}
| [] | 778,434 | 778,435 | u307227472 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> ans(n + 1);
vector<int> ret;
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 == a[i - 1]) {
ans[i] = 1;
} else {
ans[i] = 0;
ret.push_back(i);
}
}
sort(ret.begin(), ret.end());
cout << ret.size() << endl;
for (int i = 0; i < ret.size(); ++i) {
if (i == (ret.size() - 1)) {
cout << ret[i] << endl;
break;
}
cout << ret[i] << " ";
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> ans(n + 1);
vector<int> ret;
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 == a[i - 1]) {
ans[i] = 0;
} else {
ans[i] = 1;
ret.push_back(i);
}
}
sort(ret.begin(), ret.end());
cout << ret.size() << endl;
for (int i = 0; i < ret.size(); ++i) {
if (i == (ret.size() - 1)) {
cout << ret[i] << endl;
break;
}
cout << ret[i] << " ";
}
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 778,438 | 778,439 | u110336920 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> ans(n + 1);
vector<int> ret;
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = 2 * i; i <= n; j += i) {
sum += ans[j];
}
if (sum % 2 == a[i - 1]) {
ans[i] = 1;
} else {
ans[i] = 0;
ret.push_back(i);
}
}
sort(ret.begin(), ret.end());
cout << ret.size() << endl;
for (int i = 0; i < ret.size(); ++i) {
if (i == (ret.size() - 1)) {
cout << ret[i] << endl;
break;
}
cout << ret[i] << " ";
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> ans(n + 1);
vector<int> ret;
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = 2 * i; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 == a[i - 1]) {
ans[i] = 0;
} else {
ans[i] = 1;
ret.push_back(i);
}
}
sort(ret.begin(), ret.end());
cout << ret.size() << endl;
for (int i = 0; i < ret.size(); ++i) {
if (i == (ret.size() - 1)) {
cout << ret[i] << endl;
break;
}
cout << ret[i] << " ";
}
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.value.change"
] | 778,440 | 778,439 | u110336920 | cpp |
p02972 | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<int> a(N + 1), ans(N + 1, 0);
int ans_cnt = 0;
for (size_t i = 1; i <= N; i++) {
scanf("%d", &a[i]);
}
for (int i = N; i >= 1; i--) {
int sum = 0;
for (size_t m = 2 * i; m <= N; m += i) {
sum += ans[m];
}
if (sum % 2 != a[i]) {
ans[i] = 1;
ans_cnt++;
}
}
cout << ans_cnt << endl;
for (size_t i = 1; i <= N; i++) {
if (ans[i] == 1) {
cout << 1 << " ";
}
}
cout << endl;
return 0;
}
| #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<int> a(N + 1), ans(N + 1, 0);
int ans_cnt = 0;
for (size_t i = 1; i <= N; i++) {
scanf("%d", &a[i]);
}
for (int i = N; i >= 1; i--) {
int sum = 0;
for (size_t m = 2 * i; m <= N; m += i) {
sum += ans[m];
}
if (sum % 2 != a[i]) {
ans[i] = 1;
ans_cnt++;
}
}
cout << ans_cnt << endl;
for (size_t i = 1; i <= N; i++) {
if (ans[i] == 1) {
cout << i << " ";
}
}
cout << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 778,441 | 778,442 | u115259771 | cpp |
p02972 | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<int> a(N + 1), ans(N + 1, 0);
int ans_cnt = 0;
for (size_t i = 1; i <= N; i++) {
scanf("%d", &a[i]);
}
for (int i = N; i >= 1; i--) {
int sum = 0;
for (size_t m = 2 * i; m < N; m += i) {
sum += ans[m];
}
if (sum % 2 != a[i]) {
ans[i] = 1;
ans_cnt++;
}
}
cout << ans_cnt << endl;
for (size_t i = 1; i <= N; i++) {
if (ans[i] == 1) {
cout << 1 << " ";
}
}
cout << endl;
return 0;
}
| #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<int> a(N + 1), ans(N + 1, 0);
int ans_cnt = 0;
for (size_t i = 1; i <= N; i++) {
scanf("%d", &a[i]);
}
for (int i = N; i >= 1; i--) {
int sum = 0;
for (size_t m = 2 * i; m <= N; m += i) {
sum += ans[m];
}
if (sum % 2 != a[i]) {
ans[i] = 1;
ans_cnt++;
}
}
cout << ans_cnt << endl;
for (size_t i = 1; i <= N; i++) {
if (ans[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",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 778,443 | 778,442 | u115259771 | cpp |
p02972 | // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
// b[i] = a[i] + a[2 i] + a[3 i] + ...
vector<int> ans;
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int t = 0;
for (int j = i + i; j < n; j += i) {
t ^= b[j];
}
if (a[i] != t) {
b[i] = 1;
ans.emplace_back(i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << " \n"[i + 1 == ans.size()];
return 0;
}
| // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
// b[i] = a[i] + a[2 i] + a[3 i] + ...
vector<int> ans;
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int t = 0;
for (int j = i + i; j <= n; j += i) {
t ^= b[j];
}
if (a[i] != t) {
b[i] = 1;
ans.emplace_back(i);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << " \n"[i + 1 == ans.size()];
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,444 | 778,445 | u884379688 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n), ans(n);
for (int i = 0; i < n; i++) {
cin >> va[i];
ans[i] = 0;
}
for (int i = n; i > 0; i--) {
int cnt;
for (int j = i * 2; j <= n; j += i) {
cnt += ans[j - 1];
}
if (cnt % 2 != va[i - 1])
ans[i - 1] = 1;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (ans[i] == 1) {
cnt++;
}
}
cout << cnt << "\n";
for (int i = 0; i < n; i++) {
if (ans[i] == 1) {
cout << i + 1 << " ";
}
}
cout << "\n";
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n), ans(n);
for (int i = 0; i < n; i++) {
cin >> va[i];
ans[i] = 0;
}
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
cnt += ans[j - 1];
}
if (cnt % 2 != va[i - 1])
ans[i - 1] = 1;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (ans[i] == 1) {
cnt++;
}
}
cout << cnt << "\n";
for (int i = 0; i < n; i++) {
if (ans[i] == 1) {
cout << i + 1 << " ";
}
}
cout << "\n";
} | [
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 778,448 | 778,449 | u023540496 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n), ans(n);
for (int i = 0; i < n; i++) {
cin >> va[i];
ans[i] = 0;
}
for (int i = n; i > 0; i--) {
int cnt;
for (int j = i; j <= n; j += i) {
cnt += ans[j - 1];
}
if (cnt % 2 != va[i - 1])
ans[i - 1] = 1;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (ans[i] == 1) {
cnt++;
}
}
cout << cnt << "\n";
for (int i = 0; i < n; i++) {
if (ans[i] == 1) {
cout << i + 1 << " ";
}
}
cout << "\n";
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n), ans(n);
for (int i = 0; i < n; i++) {
cin >> va[i];
ans[i] = 0;
}
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
cnt += ans[j - 1];
}
if (cnt % 2 != va[i - 1])
ans[i - 1] = 1;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (ans[i] == 1) {
cnt++;
}
}
cout << cnt << "\n";
for (int i = 0; i < n; i++) {
if (ans[i] == 1) {
cout << i + 1 << " ";
}
}
cout << "\n";
} | [
"variable_declaration.value.change"
] | 778,450 | 778,449 | u023540496 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), ans(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = (n + 2) / 2; i <= n; i++) {
ans[i] = a[i];
}
for (int i = (n + 2) / 2 - 1; i >= 1; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j++)
sum += ans[j];
ans[i] = sum % 2 != a[i];
}
int t = 0;
for (int i = 1; i <= n; i++)
t += ans[i];
cout << t << '\n';
for (int i = 1; i <= n; i++) {
if (ans[i])
cout << i << ' ';
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), ans(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = (n + 2) / 2; i <= n; i++) {
ans[i] = a[i];
}
for (int i = (n + 2) / 2 - 1; i >= 1; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i)
sum += ans[j];
ans[i] = sum % 2 != a[i];
}
int t = 0;
for (int i = 1; i <= n; i++)
t += ans[i];
cout << t << '\n';
for (int i = 1; i <= n; i++) {
if (ans[i])
cout << i << ' ';
}
} | [] | 778,456 | 778,457 | u332519995 | cpp |
p02972 | /*
ID: Aman Raj
LANG: C++
TASK: subset
*/
#include <iostream>
#include <stdio.h>
//#include<iostream>
#include <algorithm>
#include <vector>
using namespace std;
#include <math.h>
typedef long long int ll;
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// setbase - cout << setbase (16); cout << 100 << endl; Prints 64
// setfill - cout << setfill ('x') << setw (5); cout << 77 << endl; prints
// xxx77 setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
// cout.precision(x) cout<<fixed<<val; // prints x digits after decimal in val
// hr
using namespace std;
using namespace __gnu_pbds;
// hy
#define f(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) f(i, 0, n)
#define fd(i, a, b) for (i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<ll>
#define ss second
#define ff first
//#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(a) a.size()
#define inf (1000 * 1000 * 1000 + 5)
#define all(a) a.begin(), a.end()
#define tri pair<int, pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define mod (1000 * 1000 * 1000 + 7)
#define pqueue priority_queue<int>
#define pdqueue priority_queue<int, vi, greater<int>>
//#define flush fflush(stdout)
#define primeDEN 727999983
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#include <fstream>
// find_by_order() // order_of_key
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
//# define mod 1e9+7
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
// kj
int main() {
ll n;
cin >> n;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
vector<ll> vballs(n + 1, 0);
ll m = 0;
for (ll i = n; i >= 1; i--) {
ll a = v[i - 1];
ll j = i + i;
ll balls = 0;
while (j <= n) {
if (v[j] == 1)
balls++;
j += i;
}
if (a == 1 && balls % 2 == 0) {
vballs[i] = 1;
m++;
} else if (a == 0 && balls % 2 == 1) {
vballs[i] = 1;
m++;
}
}
cout << m << endl;
for (ll i = 1; i <= n; i++)
if (vballs[i] > 0)
cout << i << " ";
return 0;
}
| /*
ID: Aman Raj
LANG: C++
TASK: subset
*/
#include <iostream>
#include <stdio.h>
//#include<iostream>
#include <algorithm>
#include <vector>
using namespace std;
#include <math.h>
typedef long long int ll;
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// setbase - cout << setbase (16); cout << 100 << endl; Prints 64
// setfill - cout << setfill ('x') << setw (5); cout << 77 << endl; prints
// xxx77 setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
// cout.precision(x) cout<<fixed<<val; // prints x digits after decimal in val
// hr
using namespace std;
using namespace __gnu_pbds;
// hy
#define f(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) f(i, 0, n)
#define fd(i, a, b) for (i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<ll>
#define ss second
#define ff first
//#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(a) a.size()
#define inf (1000 * 1000 * 1000 + 5)
#define all(a) a.begin(), a.end()
#define tri pair<int, pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define mod (1000 * 1000 * 1000 + 7)
#define pqueue priority_queue<int>
#define pdqueue priority_queue<int, vi, greater<int>>
//#define flush fflush(stdout)
#define primeDEN 727999983
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#include <fstream>
// find_by_order() // order_of_key
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
//# define mod 1e9+7
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
// kj
int main() {
ll n;
cin >> n;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
vector<ll> vballs(n + 1, 0);
ll m = 0;
for (ll i = n; i >= 1; i--) {
ll a = v[i - 1];
ll j = i + i;
ll balls = 0;
while (j <= n) {
if (vballs[j] == 1)
balls++;
j += i;
}
if (a == 1 && balls % 2 == 0) {
vballs[i] = 1;
m++;
} else if (a == 0 && balls % 2 == 1) {
vballs[i] = 1;
m++;
}
}
cout << m << endl;
for (ll i = 1; i <= n; i++)
if (vballs[i] > 0)
cout << i << " ";
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,458 | 778,459 | u756289568 | cpp |
p02972 | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define ALL(a) (a).begin(), (a).end()
#define sort_v(a) sort(a.begin(), a.end())
#define fi first
#define se second
void print(bool c) {
if (c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
ll gcdll(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (b == 0)
break;
a %= b;
}
return a;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
bool cmp(const pii &a, const pii &b) {
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
int main() {
int n;
cin >> n;
vi a(n), ans(n);
rep(i, 0, n) cin >> a[i];
int cnt = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
rep(j, 1, n / i) {
if (ans[i * j - 1] == 1) {
sum ^= 1;
}
}
// cout << sum << endl;
if (sum == a[i - 1])
ans[i - 1] = 0;
else {
ans[i - 1] = 1;
cnt++;
}
}
/* rep(i, 0, n)
{
cout << ans[i] << " ";
}
cout << endl;
*/
cout << cnt << endl;
int out = 0;
rep(i, 0, n) {
if (ans[i] == 1) {
if (out != cnt - 1) {
cout << i + 1 << " ";
out++;
} else {
cout << i + 1 << endl;
}
}
}
}
| #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define ALL(a) (a).begin(), (a).end()
#define sort_v(a) sort(a.begin(), a.end())
#define fi first
#define se second
void print(bool c) {
if (c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
ll gcdll(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (b == 0)
break;
a %= b;
}
return a;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
bool cmp(const pii &a, const pii &b) {
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
int main() {
int n;
cin >> n;
vi a(n), ans(n);
rep(i, 0, n) cin >> a[i];
int cnt = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
rep(j, 1, n / i) {
if (ans[i * (j + 1) - 1] == 1) {
sum ^= 1;
}
}
// cout << i << " " << sum << endl;
if (sum == a[i - 1])
ans[i - 1] = 0;
else {
ans[i - 1] = 1;
cnt++;
}
}
/* rep(i, 0, n)
{
cout << ans[i] << " ";
}
cout << endl;*/
cout << cnt << endl;
int out = 0;
rep(i, 0, n) {
if (ans[i] == 1) {
if (out != cnt - 1) {
cout << i + 1 << " ";
out++;
} else {
cout << i + 1 << endl;
}
}
}
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 778,465 | 778,466 | u705296057 | cpp |
p02972 | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( \
int i = (a); i >= (b); \
--i) // 終端を0じゃなくて、1まですることによってn回。感覚的に1以上にしておいた。
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 1)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define WHITE 1 //（未訪問）
#define GRAY \
2 //（訪問）未だに訪問していない頂点への辺を持っている。スタックに退避。
#define BLACK 3 //（訪問完了）未訪問への頂点への辺を持たない
#define N 100
#define INFTY (1 << 21) // 10^21
#define INF (1 << 9)
int M[N][N]; // 隣接行列(頂点と頂点が繋がってる、もしくは重みの値)
int color[N]; // その頂点の探索具合
const int TABLEMAX = 510000;
const int MOD = 1000000007;
//二項係数用の各階乗の値とその逆元を記録するための配列．
long long fac[TABLEMAX], finv[TABLEMAX], inv[TABLEMAX];
// 1個上から時計周り
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//上右下左
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> Vector;
typedef vector<Vector> DVector;
typedef vector<pair<ll, ll>> Vec_map;
//因数分解で使う。firstは数。secondは指数。
vector<pair<ll, ll>> prime_factor;
//因数の一覧を取得で使う
Vector factor_list;
ll n;
template <class X> void printArray(X *array, ll);
template <class X> void printVector(vector<X> &v);
template <class X> void printDimention(vector<X, vector<X>> &dv);
template <class X> void printMap(X);
template <class X> void printVecPair(vector<X> &v);
// 何個2がかかっているか
int factor2(int);
// nCr方式で組み合わせの数を求める
ll combination(int, int);
// nPrで階乗を求める
int factorial(int, int);
//桁数を返す
int find_digits(int);
// 各桁の和を計算する関数
int findSumOfDigits(int);
//次数を得る
int degree(int);
//四捨五入
int shishagonyu(double);
//切り上げ
int roundUp(double);
//切り捨て
int roundDown(double);
//四捨五入
int roundOff(double);
//最大公約数(Greatest Common Divisor)
int gcd(int, int);
//最小公倍数(Least Common Multiple)
ll lcm(ll, ll);
//素因数分解
void prime_factorization(ll);
//エラトステネスの篩
int Eratosthenes(int);
//偶奇判定。奇数ならtrue。
bool odd_even(int);
// aのmod mにおける逆元を計算する
long long modinv(long long, long long);
// a^n mod を計算する（二分累乗）
long long modpow(long long, long long, long long);
//テーブルを作る前処理
void COMinit();
//二項係数計算 nCk, 1 <= k <= n <= 10^7
long long COM(int, int);
// longlong型で絶対値を帰す。
long long abs_ll(ll);
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll, ll);
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string, vector<X> &v);
// 因数の一覧を取得する
void get_factor_list(ll);
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
ll a[n];
ll b[n];
rep(i, n) { cin >> a[i]; }
ll mag;
Vector res;
FOR_RE(i, n - 1, 0) {
ll sub = i + 1;
mag = n / sub;
if (mag == 1) {
b[i] = a[i];
} else if (mag == 2) {
b[i] = b[i] ^ b[sub * 2 - 1];
} else {
b[i] = b[sub * 2 - 1] ^ b[sub * 3 - 1];
FOR_EQ(j, 4, mag) { b[i] ^= b[sub * j - 1]; }
b[i] ^= a[i];
}
/*
else{
FOR_EQ(j, 2, mag){
ll sum = 0;
sum +=
}
}
*/
if (b[i])
res.push_back(sub);
}
reverse(res.begin(), res.end());
cout << res.size() << endl;
if (res.size()) {
printVector(res);
}
return 0;
}
template <class X> void printArray(X array[], ll n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
template <class X> void printVector(vector<X> &v) {
rep(i, (int)v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
//二次元配列の表示
template <class X> void printDimention(vector<X, vector<X>> &dv) {
rep(i, (ll)dv.size()) {
rep(j, (ll)dv[i].size()) {
if (j)
cout << " ";
cout << dv[i][j];
}
cout << endl;
}
}
// mapの表示
template <class X> void printMap(X mp) {
for (auto it : mp) {
cout << it.first << " " << it.second << endl;
}
}
// 内部にpairを内包したvectorの表示
template <class X> void printVecPair(vector<X> &v) {
rep(i, (int)v.size()) { cout << v[i].first << " " << v[i].second << endl; }
cout << endl;
}
// numの中に何個2がかかってるか
int factor2(int num) {
int cnt = 0;
while (num % 2 == 0) {
num /= 2;
cnt++;
}
return cnt;
}
// nCr方式で組み合わせの数を求める
ll combination(int n, int r) {
ll up = 1, down = 1;
// 以下2行はお試し
ll half = n / 2;
if (r >= half)
r = n - r;
ll up_tmp = n, down_tmp = r;
if (r == 0)
return 1;
rep(i, r) {
up *= up_tmp;
up_tmp--;
down *= down_tmp;
down_tmp--;
}
return up / down;
}
// nPr方式で階乗を求める
int factorial(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
} else {
int res = 1;
while (r) {
r--;
res *= n;
n--;
}
return res;
}
}
//桁数を返す
int find_digits(int n) {
int digit = 0;
while (n) {
n /= 10;
digit++;
}
return digit;
}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
//次数を得る
int degree(int n) {
int count = 0;
while (1) {
if (count <= 0)
break;
count /= 2;
count++;
}
return count;
}
//四捨五入
int shishagonyu(double x) { return (int)(x < 0.0 ? x - 0.5 : x + 0.5); }
//切り上げ
int roundUp(double n) {
if (n >= 0) {
return (int)n + 1;
} else {
return (int)n - 1;
}
}
//切り捨て
int roundDown(double n) { return (int)n; }
//四捨五入
int roundOff(double n) {
double decimal = 0;
decimal = n - (int)n;
if (decimal >= 0.5 || decimal <= -0.5) {
return roundUp(n);
} else {
return roundDown(n);
}
}
//最大公約数(Greatest Common Divisor)
int gcd(int m, int n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
//ユークリッドの互除法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
//最小公倍数(Least Common Multiple)
ll lcm(ll m, ll n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
// lcm = m * n / gcd(m, n)
return ((m / gcd(m, n)) * n);
}
//素因数分解 firstは数。secondは指数。
void prime_factorization(ll n) {
int a = 2, res;
bool flg = false;
if (n < 2) {
cout << "Error" << endl;
return;
}
while (n >= a * a) {
if (n % a == 0) {
res = a;
// resをグローバルな配列に代入すれば記録できる。
if (flg) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(0, 1));
prime_factor[prime_factor.size() - 1].first = res;
}
n /= a;
flg = true;
} else {
a++;
flg = false;
}
}
//ラス1の素因数
res = n;
if (prime_factor[prime_factor.size() - 1].first == res) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(res, 1));
}
}
//エラトステネスの篩
int Eratosthenes(int n) {
bool prime[n];
// prime[0]が1、prime[n - 1]がn。
rep(i, n) prime[i] = true;
for (int i = 2; i < sqrt(n); i++) {
if (prime[i]) {
for (int j = 0; i * (j + 2) < n; j++) {
prime[i * (j + 2)] = false;
}
}
}
int cnt = 0;
for (int i = 2; i < n; i++) {
if (prime[i]) {
cnt++;
}
}
return cnt;
}
//偶奇判定。奇数ならtrue。
bool odd_even(int num) {
bool judge;
if (num % 2) {
judge = true;
} else {
judge = false;
}
return judge;
}
// aのmod mにおける逆元を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// main関数内でCOMinitを呼んだ後，COMを呼ぶ．
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < TABLEMAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算 nCk, nCrのcombinationでも使える
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long abs_ll(ll a) {
if (a >= 0) {
return a;
} else {
return -a;
}
}
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll res, ll div) {
// res 割られる数、div 割る数
return (res + div - 1) / div;
}
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string str, vector<X> &v) {
ll num = stoll(str);
ll it = str.size() - 1;
// 桁を逆にしたい時、下をon
// ll it = 0;
v.resize(str.size());
while (num) {
v[it] = num % 10;
num /= 10;
it--;
// it++;
if (it < 0) {
cout << "reference error" << endl;
break;
}
}
}
// nに数を入れるとその約数の一覧をfactor_listに格納する
void get_factor_list(ll n) {
int a = 1, res;
while (n >= a * a) {
if (n % a == 0) {
res = a;
ll tmp = n / res;
factor_list.push_back(res);
factor_list.push_back(tmp);
a++;
} else {
a++;
}
}
sort(factor_list.begin(), factor_list.end());
} | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( \
int i = (a); i >= (b); \
--i) // 終端を0じゃなくて、1まですることによってn回。感覚的に1以上にしておいた。
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 1)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define WHITE 1 //（未訪問）
#define GRAY \
2 //（訪問）未だに訪問していない頂点への辺を持っている。スタックに退避。
#define BLACK 3 //（訪問完了）未訪問への頂点への辺を持たない
#define N 100
#define INFTY (1 << 21) // 10^21
#define INF (1 << 9)
int M[N][N]; // 隣接行列(頂点と頂点が繋がってる、もしくは重みの値)
int color[N]; // その頂点の探索具合
const int TABLEMAX = 510000;
const int MOD = 1000000007;
//二項係数用の各階乗の値とその逆元を記録するための配列．
long long fac[TABLEMAX], finv[TABLEMAX], inv[TABLEMAX];
// 1個上から時計周り
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//上右下左
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> Vector;
typedef vector<Vector> DVector;
typedef vector<pair<ll, ll>> Vec_map;
//因数分解で使う。firstは数。secondは指数。
vector<pair<ll, ll>> prime_factor;
//因数の一覧を取得で使う
Vector factor_list;
ll n;
template <class X> void printArray(X *array, ll);
template <class X> void printVector(vector<X> &v);
template <class X> void printDimention(vector<X, vector<X>> &dv);
template <class X> void printMap(X);
template <class X> void printVecPair(vector<X> &v);
// 何個2がかかっているか
int factor2(int);
// nCr方式で組み合わせの数を求める
ll combination(int, int);
// nPrで階乗を求める
int factorial(int, int);
//桁数を返す
int find_digits(int);
// 各桁の和を計算する関数
int findSumOfDigits(int);
//次数を得る
int degree(int);
//四捨五入
int shishagonyu(double);
//切り上げ
int roundUp(double);
//切り捨て
int roundDown(double);
//四捨五入
int roundOff(double);
//最大公約数(Greatest Common Divisor)
int gcd(int, int);
//最小公倍数(Least Common Multiple)
ll lcm(ll, ll);
//素因数分解
void prime_factorization(ll);
//エラトステネスの篩
int Eratosthenes(int);
//偶奇判定。奇数ならtrue。
bool odd_even(int);
// aのmod mにおける逆元を計算する
long long modinv(long long, long long);
// a^n mod を計算する（二分累乗）
long long modpow(long long, long long, long long);
//テーブルを作る前処理
void COMinit();
//二項係数計算 nCk, 1 <= k <= n <= 10^7
long long COM(int, int);
// longlong型で絶対値を帰す。
long long abs_ll(ll);
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll, ll);
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string, vector<X> &v);
// 因数の一覧を取得する
void get_factor_list(ll);
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
ll a[n];
ll b[n];
rep(i, n) { cin >> a[i]; }
ll mag;
Vector res;
FOR_RE(i, n - 1, 0) {
ll sub = i + 1;
mag = n / sub;
if (mag == 1) {
b[i] = a[i];
} else if (mag == 2) {
b[i] = a[i] ^ b[sub * 2 - 1];
} else {
b[i] = b[sub * 2 - 1] ^ b[sub * 3 - 1];
FOR_EQ(j, 4, mag) { b[i] ^= b[sub * j - 1]; }
b[i] ^= a[i];
}
/*
else{
FOR_EQ(j, 2, mag){
ll sum = 0;
sum +=
}
}
*/
if (b[i])
res.push_back(sub);
}
reverse(res.begin(), res.end());
cout << res.size() << endl;
if (res.size()) {
printVector(res);
}
return 0;
}
template <class X> void printArray(X array[], ll n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
template <class X> void printVector(vector<X> &v) {
rep(i, (int)v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
//二次元配列の表示
template <class X> void printDimention(vector<X, vector<X>> &dv) {
rep(i, (ll)dv.size()) {
rep(j, (ll)dv[i].size()) {
if (j)
cout << " ";
cout << dv[i][j];
}
cout << endl;
}
}
// mapの表示
template <class X> void printMap(X mp) {
for (auto it : mp) {
cout << it.first << " " << it.second << endl;
}
}
// 内部にpairを内包したvectorの表示
template <class X> void printVecPair(vector<X> &v) {
rep(i, (int)v.size()) { cout << v[i].first << " " << v[i].second << endl; }
cout << endl;
}
// numの中に何個2がかかってるか
int factor2(int num) {
int cnt = 0;
while (num % 2 == 0) {
num /= 2;
cnt++;
}
return cnt;
}
// nCr方式で組み合わせの数を求める
ll combination(int n, int r) {
ll up = 1, down = 1;
// 以下2行はお試し
ll half = n / 2;
if (r >= half)
r = n - r;
ll up_tmp = n, down_tmp = r;
if (r == 0)
return 1;
rep(i, r) {
up *= up_tmp;
up_tmp--;
down *= down_tmp;
down_tmp--;
}
return up / down;
}
// nPr方式で階乗を求める
int factorial(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
} else {
int res = 1;
while (r) {
r--;
res *= n;
n--;
}
return res;
}
}
//桁数を返す
int find_digits(int n) {
int digit = 0;
while (n) {
n /= 10;
digit++;
}
return digit;
}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
//次数を得る
int degree(int n) {
int count = 0;
while (1) {
if (count <= 0)
break;
count /= 2;
count++;
}
return count;
}
//四捨五入
int shishagonyu(double x) { return (int)(x < 0.0 ? x - 0.5 : x + 0.5); }
//切り上げ
int roundUp(double n) {
if (n >= 0) {
return (int)n + 1;
} else {
return (int)n - 1;
}
}
//切り捨て
int roundDown(double n) { return (int)n; }
//四捨五入
int roundOff(double n) {
double decimal = 0;
decimal = n - (int)n;
if (decimal >= 0.5 || decimal <= -0.5) {
return roundUp(n);
} else {
return roundDown(n);
}
}
//最大公約数(Greatest Common Divisor)
int gcd(int m, int n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
//ユークリッドの互除法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
//最小公倍数(Least Common Multiple)
ll lcm(ll m, ll n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
// lcm = m * n / gcd(m, n)
return ((m / gcd(m, n)) * n);
}
//素因数分解 firstは数。secondは指数。
void prime_factorization(ll n) {
int a = 2, res;
bool flg = false;
if (n < 2) {
cout << "Error" << endl;
return;
}
while (n >= a * a) {
if (n % a == 0) {
res = a;
// resをグローバルな配列に代入すれば記録できる。
if (flg) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(0, 1));
prime_factor[prime_factor.size() - 1].first = res;
}
n /= a;
flg = true;
} else {
a++;
flg = false;
}
}
//ラス1の素因数
res = n;
if (prime_factor[prime_factor.size() - 1].first == res) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(res, 1));
}
}
//エラトステネスの篩
int Eratosthenes(int n) {
bool prime[n];
// prime[0]が1、prime[n - 1]がn。
rep(i, n) prime[i] = true;
for (int i = 2; i < sqrt(n); i++) {
if (prime[i]) {
for (int j = 0; i * (j + 2) < n; j++) {
prime[i * (j + 2)] = false;
}
}
}
int cnt = 0;
for (int i = 2; i < n; i++) {
if (prime[i]) {
cnt++;
}
}
return cnt;
}
//偶奇判定。奇数ならtrue。
bool odd_even(int num) {
bool judge;
if (num % 2) {
judge = true;
} else {
judge = false;
}
return judge;
}
// aのmod mにおける逆元を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// main関数内でCOMinitを呼んだ後，COMを呼ぶ．
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < TABLEMAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算 nCk, nCrのcombinationでも使える
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long abs_ll(ll a) {
if (a >= 0) {
return a;
} else {
return -a;
}
}
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll res, ll div) {
// res 割られる数、div 割る数
return (res + div - 1) / div;
}
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string str, vector<X> &v) {
ll num = stoll(str);
ll it = str.size() - 1;
// 桁を逆にしたい時、下をon
// ll it = 0;
v.resize(str.size());
while (num) {
v[it] = num % 10;
num /= 10;
it--;
// it++;
if (it < 0) {
cout << "reference error" << endl;
break;
}
}
}
// nに数を入れるとその約数の一覧をfactor_listに格納する
void get_factor_list(ll n) {
int a = 1, res;
while (n >= a * a) {
if (n % a == 0) {
res = a;
ll tmp = n / res;
factor_list.push_back(res);
factor_list.push_back(tmp);
a++;
} else {
a++;
}
}
sort(factor_list.begin(), factor_list.end());
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 778,467 | 778,468 | u669551866 | cpp |
p02972 | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( \
int i = (a); i >= (b); \
--i) // 終端を0じゃなくて、1まですることによってn回。感覚的に1以上にしておいた。
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 1)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define WHITE 1 //（未訪問）
#define GRAY \
2 //（訪問）未だに訪問していない頂点への辺を持っている。スタックに退避。
#define BLACK 3 //（訪問完了）未訪問への頂点への辺を持たない
#define N 100
#define INFTY (1 << 21) // 10^21
#define INF (1 << 9)
int M[N][N]; // 隣接行列(頂点と頂点が繋がってる、もしくは重みの値)
int color[N]; // その頂点の探索具合
const int TABLEMAX = 510000;
const int MOD = 1000000007;
//二項係数用の各階乗の値とその逆元を記録するための配列．
long long fac[TABLEMAX], finv[TABLEMAX], inv[TABLEMAX];
// 1個上から時計周り
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//上右下左
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> Vector;
typedef vector<Vector> DVector;
typedef vector<pair<ll, ll>> Vec_map;
//因数分解で使う。firstは数。secondは指数。
vector<pair<ll, ll>> prime_factor;
//因数の一覧を取得で使う
Vector factor_list;
ll n;
template <class X> void printArray(X *array, ll);
template <class X> void printVector(vector<X> &v);
template <class X> void printDimention(vector<X, vector<X>> &dv);
template <class X> void printMap(X);
template <class X> void printVecPair(vector<X> &v);
// 何個2がかかっているか
int factor2(int);
// nCr方式で組み合わせの数を求める
ll combination(int, int);
// nPrで階乗を求める
int factorial(int, int);
//桁数を返す
int find_digits(int);
// 各桁の和を計算する関数
int findSumOfDigits(int);
//次数を得る
int degree(int);
//四捨五入
int shishagonyu(double);
//切り上げ
int roundUp(double);
//切り捨て
int roundDown(double);
//四捨五入
int roundOff(double);
//最大公約数(Greatest Common Divisor)
int gcd(int, int);
//最小公倍数(Least Common Multiple)
ll lcm(ll, ll);
//素因数分解
void prime_factorization(ll);
//エラトステネスの篩
int Eratosthenes(int);
//偶奇判定。奇数ならtrue。
bool odd_even(int);
// aのmod mにおける逆元を計算する
long long modinv(long long, long long);
// a^n mod を計算する（二分累乗）
long long modpow(long long, long long, long long);
//テーブルを作る前処理
void COMinit();
//二項係数計算 nCk, 1 <= k <= n <= 10^7
long long COM(int, int);
// longlong型で絶対値を帰す。
long long abs_ll(ll);
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll, ll);
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string, vector<X> &v);
// 因数の一覧を取得する
void get_factor_list(ll);
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
ll a[n];
ll b[n];
rep(i, n) { cin >> a[i]; }
ll mag;
Vector res;
FOR_RE(i, n - 1, 0) {
ll sub = i + 1;
mag = n / sub;
if (mag == 1) {
b[i] = a[i];
} else if (mag == 2) {
b[i] = a[i] * a[sub * 2 - 1];
} else {
b[i] = a[sub * 2 - 1] ^ a[sub * 3 - 1];
FOR_EQ(j, 4, mag) { b[i] ^= a[sub * j - 1]; }
b[i] ^= a[i];
}
if (b[i])
res.push_back(sub);
}
reverse(res.begin(), res.end());
cout << res.size() << endl;
if (res.size()) {
printVector(res);
}
return 0;
}
template <class X> void printArray(X array[], ll n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
template <class X> void printVector(vector<X> &v) {
rep(i, (int)v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
//二次元配列の表示
template <class X> void printDimention(vector<X, vector<X>> &dv) {
rep(i, (ll)dv.size()) {
rep(j, (ll)dv[i].size()) {
if (j)
cout << " ";
cout << dv[i][j];
}
cout << endl;
}
}
// mapの表示
template <class X> void printMap(X mp) {
for (auto it : mp) {
cout << it.first << " " << it.second << endl;
}
}
// 内部にpairを内包したvectorの表示
template <class X> void printVecPair(vector<X> &v) {
rep(i, (int)v.size()) { cout << v[i].first << " " << v[i].second << endl; }
cout << endl;
}
// numの中に何個2がかかってるか
int factor2(int num) {
int cnt = 0;
while (num % 2 == 0) {
num /= 2;
cnt++;
}
return cnt;
}
// nCr方式で組み合わせの数を求める
ll combination(int n, int r) {
ll up = 1, down = 1;
// 以下2行はお試し
ll half = n / 2;
if (r >= half)
r = n - r;
ll up_tmp = n, down_tmp = r;
if (r == 0)
return 1;
rep(i, r) {
up *= up_tmp;
up_tmp--;
down *= down_tmp;
down_tmp--;
}
return up / down;
}
// nPr方式で階乗を求める
int factorial(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
} else {
int res = 1;
while (r) {
r--;
res *= n;
n--;
}
return res;
}
}
//桁数を返す
int find_digits(int n) {
int digit = 0;
while (n) {
n /= 10;
digit++;
}
return digit;
}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
//次数を得る
int degree(int n) {
int count = 0;
while (1) {
if (count <= 0)
break;
count /= 2;
count++;
}
return count;
}
//四捨五入
int shishagonyu(double x) { return (int)(x < 0.0 ? x - 0.5 : x + 0.5); }
//切り上げ
int roundUp(double n) {
if (n >= 0) {
return (int)n + 1;
} else {
return (int)n - 1;
}
}
//切り捨て
int roundDown(double n) { return (int)n; }
//四捨五入
int roundOff(double n) {
double decimal = 0;
decimal = n - (int)n;
if (decimal >= 0.5 || decimal <= -0.5) {
return roundUp(n);
} else {
return roundDown(n);
}
}
//最大公約数(Greatest Common Divisor)
int gcd(int m, int n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
//ユークリッドの互除法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
//最小公倍数(Least Common Multiple)
ll lcm(ll m, ll n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
// lcm = m * n / gcd(m, n)
return ((m / gcd(m, n)) * n);
}
//素因数分解 firstは数。secondは指数。
void prime_factorization(ll n) {
int a = 2, res;
bool flg = false;
if (n < 2) {
cout << "Error" << endl;
return;
}
while (n >= a * a) {
if (n % a == 0) {
res = a;
// resをグローバルな配列に代入すれば記録できる。
if (flg) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(0, 1));
prime_factor[prime_factor.size() - 1].first = res;
}
n /= a;
flg = true;
} else {
a++;
flg = false;
}
}
//ラス1の素因数
res = n;
if (prime_factor[prime_factor.size() - 1].first == res) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(res, 1));
}
}
//エラトステネスの篩
int Eratosthenes(int n) {
bool prime[n];
// prime[0]が1、prime[n - 1]がn。
rep(i, n) prime[i] = true;
for (int i = 2; i < sqrt(n); i++) {
if (prime[i]) {
for (int j = 0; i * (j + 2) < n; j++) {
prime[i * (j + 2)] = false;
}
}
}
int cnt = 0;
for (int i = 2; i < n; i++) {
if (prime[i]) {
cnt++;
}
}
return cnt;
}
//偶奇判定。奇数ならtrue。
bool odd_even(int num) {
bool judge;
if (num % 2) {
judge = true;
} else {
judge = false;
}
return judge;
}
// aのmod mにおける逆元を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// main関数内でCOMinitを呼んだ後，COMを呼ぶ．
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < TABLEMAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算 nCk, nCrのcombinationでも使える
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long abs_ll(ll a) {
if (a >= 0) {
return a;
} else {
return -a;
}
}
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll res, ll div) {
// res 割られる数、div 割る数
return (res + div - 1) / div;
}
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string str, vector<X> &v) {
ll num = stoll(str);
ll it = str.size() - 1;
// 桁を逆にしたい時、下をon
// ll it = 0;
v.resize(str.size());
while (num) {
v[it] = num % 10;
num /= 10;
it--;
// it++;
if (it < 0) {
cout << "reference error" << endl;
break;
}
}
}
// nに数を入れるとその約数の一覧をfactor_listに格納する
void get_factor_list(ll n) {
int a = 1, res;
while (n >= a * a) {
if (n % a == 0) {
res = a;
ll tmp = n / res;
factor_list.push_back(res);
factor_list.push_back(tmp);
a++;
} else {
a++;
}
}
sort(factor_list.begin(), factor_list.end());
} | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( \
int i = (a); i >= (b); \
--i) // 終端を0じゃなくて、1まですることによってn回。感覚的に1以上にしておいた。
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 1)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define WHITE 1 //（未訪問）
#define GRAY \
2 //（訪問）未だに訪問していない頂点への辺を持っている。スタックに退避。
#define BLACK 3 //（訪問完了）未訪問への頂点への辺を持たない
#define N 100
#define INFTY (1 << 21) // 10^21
#define INF (1 << 9)
int M[N][N]; // 隣接行列(頂点と頂点が繋がってる、もしくは重みの値)
int color[N]; // その頂点の探索具合
const int TABLEMAX = 510000;
const int MOD = 1000000007;
//二項係数用の各階乗の値とその逆元を記録するための配列．
long long fac[TABLEMAX], finv[TABLEMAX], inv[TABLEMAX];
// 1個上から時計周り
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//上右下左
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> Vector;
typedef vector<Vector> DVector;
typedef vector<pair<ll, ll>> Vec_map;
//因数分解で使う。firstは数。secondは指数。
vector<pair<ll, ll>> prime_factor;
//因数の一覧を取得で使う
Vector factor_list;
ll n;
template <class X> void printArray(X *array, ll);
template <class X> void printVector(vector<X> &v);
template <class X> void printDimention(vector<X, vector<X>> &dv);
template <class X> void printMap(X);
template <class X> void printVecPair(vector<X> &v);
// 何個2がかかっているか
int factor2(int);
// nCr方式で組み合わせの数を求める
ll combination(int, int);
// nPrで階乗を求める
int factorial(int, int);
//桁数を返す
int find_digits(int);
// 各桁の和を計算する関数
int findSumOfDigits(int);
//次数を得る
int degree(int);
//四捨五入
int shishagonyu(double);
//切り上げ
int roundUp(double);
//切り捨て
int roundDown(double);
//四捨五入
int roundOff(double);
//最大公約数(Greatest Common Divisor)
int gcd(int, int);
//最小公倍数(Least Common Multiple)
ll lcm(ll, ll);
//素因数分解
void prime_factorization(ll);
//エラトステネスの篩
int Eratosthenes(int);
//偶奇判定。奇数ならtrue。
bool odd_even(int);
// aのmod mにおける逆元を計算する
long long modinv(long long, long long);
// a^n mod を計算する（二分累乗）
long long modpow(long long, long long, long long);
//テーブルを作る前処理
void COMinit();
//二項係数計算 nCk, 1 <= k <= n <= 10^7
long long COM(int, int);
// longlong型で絶対値を帰す。
long long abs_ll(ll);
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll, ll);
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string, vector<X> &v);
// 因数の一覧を取得する
void get_factor_list(ll);
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
ll a[n];
ll b[n];
rep(i, n) { cin >> a[i]; }
ll mag;
Vector res;
FOR_RE(i, n - 1, 0) {
ll sub = i + 1;
mag = n / sub;
if (mag == 1) {
b[i] = a[i];
} else if (mag == 2) {
b[i] = a[i] ^ b[sub * 2 - 1];
} else {
b[i] = b[sub * 2 - 1] ^ b[sub * 3 - 1];
FOR_EQ(j, 4, mag) { b[i] ^= b[sub * j - 1]; }
b[i] ^= a[i];
}
/*
else{
FOR_EQ(j, 2, mag){
ll sum = 0;
sum +=
}
}
*/
if (b[i])
res.push_back(sub);
}
reverse(res.begin(), res.end());
cout << res.size() << endl;
if (res.size()) {
printVector(res);
}
return 0;
}
template <class X> void printArray(X array[], ll n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
template <class X> void printVector(vector<X> &v) {
rep(i, (int)v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
//二次元配列の表示
template <class X> void printDimention(vector<X, vector<X>> &dv) {
rep(i, (ll)dv.size()) {
rep(j, (ll)dv[i].size()) {
if (j)
cout << " ";
cout << dv[i][j];
}
cout << endl;
}
}
// mapの表示
template <class X> void printMap(X mp) {
for (auto it : mp) {
cout << it.first << " " << it.second << endl;
}
}
// 内部にpairを内包したvectorの表示
template <class X> void printVecPair(vector<X> &v) {
rep(i, (int)v.size()) { cout << v[i].first << " " << v[i].second << endl; }
cout << endl;
}
// numの中に何個2がかかってるか
int factor2(int num) {
int cnt = 0;
while (num % 2 == 0) {
num /= 2;
cnt++;
}
return cnt;
}
// nCr方式で組み合わせの数を求める
ll combination(int n, int r) {
ll up = 1, down = 1;
// 以下2行はお試し
ll half = n / 2;
if (r >= half)
r = n - r;
ll up_tmp = n, down_tmp = r;
if (r == 0)
return 1;
rep(i, r) {
up *= up_tmp;
up_tmp--;
down *= down_tmp;
down_tmp--;
}
return up / down;
}
// nPr方式で階乗を求める
int factorial(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
} else {
int res = 1;
while (r) {
r--;
res *= n;
n--;
}
return res;
}
}
//桁数を返す
int find_digits(int n) {
int digit = 0;
while (n) {
n /= 10;
digit++;
}
return digit;
}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
//次数を得る
int degree(int n) {
int count = 0;
while (1) {
if (count <= 0)
break;
count /= 2;
count++;
}
return count;
}
//四捨五入
int shishagonyu(double x) { return (int)(x < 0.0 ? x - 0.5 : x + 0.5); }
//切り上げ
int roundUp(double n) {
if (n >= 0) {
return (int)n + 1;
} else {
return (int)n - 1;
}
}
//切り捨て
int roundDown(double n) { return (int)n; }
//四捨五入
int roundOff(double n) {
double decimal = 0;
decimal = n - (int)n;
if (decimal >= 0.5 || decimal <= -0.5) {
return roundUp(n);
} else {
return roundDown(n);
}
}
//最大公約数(Greatest Common Divisor)
int gcd(int m, int n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
//ユークリッドの互除法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
//最小公倍数(Least Common Multiple)
ll lcm(ll m, ll n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
// lcm = m * n / gcd(m, n)
return ((m / gcd(m, n)) * n);
}
//素因数分解 firstは数。secondは指数。
void prime_factorization(ll n) {
int a = 2, res;
bool flg = false;
if (n < 2) {
cout << "Error" << endl;
return;
}
while (n >= a * a) {
if (n % a == 0) {
res = a;
// resをグローバルな配列に代入すれば記録できる。
if (flg) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(0, 1));
prime_factor[prime_factor.size() - 1].first = res;
}
n /= a;
flg = true;
} else {
a++;
flg = false;
}
}
//ラス1の素因数
res = n;
if (prime_factor[prime_factor.size() - 1].first == res) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(res, 1));
}
}
//エラトステネスの篩
int Eratosthenes(int n) {
bool prime[n];
// prime[0]が1、prime[n - 1]がn。
rep(i, n) prime[i] = true;
for (int i = 2; i < sqrt(n); i++) {
if (prime[i]) {
for (int j = 0; i * (j + 2) < n; j++) {
prime[i * (j + 2)] = false;
}
}
}
int cnt = 0;
for (int i = 2; i < n; i++) {
if (prime[i]) {
cnt++;
}
}
return cnt;
}
//偶奇判定。奇数ならtrue。
bool odd_even(int num) {
bool judge;
if (num % 2) {
judge = true;
} else {
judge = false;
}
return judge;
}
// aのmod mにおける逆元を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// main関数内でCOMinitを呼んだ後，COMを呼ぶ．
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < TABLEMAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算 nCk, nCrのcombinationでも使える
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long abs_ll(ll a) {
if (a >= 0) {
return a;
} else {
return -a;
}
}
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll res, ll div) {
// res 割られる数、div 割る数
return (res + div - 1) / div;
}
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string str, vector<X> &v) {
ll num = stoll(str);
ll it = str.size() - 1;
// 桁を逆にしたい時、下をon
// ll it = 0;
v.resize(str.size());
while (num) {
v[it] = num % 10;
num /= 10;
it--;
// it++;
if (it < 0) {
cout << "reference error" << endl;
break;
}
}
}
// nに数を入れるとその約数の一覧をfactor_listに格納する
void get_factor_list(ll n) {
int a = 1, res;
while (n >= a * a) {
if (n % a == 0) {
res = a;
ll tmp = n / res;
factor_list.push_back(res);
factor_list.push_back(tmp);
a++;
} else {
a++;
}
}
sort(factor_list.begin(), factor_list.end());
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 778,470 | 778,468 | u669551866 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int a[210000];
int b[210000];
vector<int> x;
int c = 0;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i > 0; i--) {
int z = 2;
int sum = 0;
while (z * i <= N) {
sum += b[z * i];
z++;
}
if (sum % 2 == a[i])
b[i] = 0;
else {
b[i] = 1;
x.push_back(b[i]);
c++;
}
}
cout << c << endl;
for (int i = 0; i < c; i++) {
cout << x[i] << " ";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int a[210000];
int b[210000];
vector<int> x;
int c = 0;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i > 0; i--) {
int z = 2;
int sum = 0;
while (z * i <= N) {
sum += b[z * i];
z++;
}
if (sum % 2 == a[i])
b[i] = 0;
else {
b[i] = 1;
x.push_back(i);
c++;
}
}
cout << c << endl;
for (int i = 0; i < c; i++) {
cout << x[i] << " ";
}
} | [
"call.arguments.change"
] | 778,480 | 778,479 | u126833093 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n + 2);
for (int i = 1; i <= n; i++)
cin >> p[i];
vector<int> b(n + 2);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i + i; j <= n; j += i)
s += p[j];
if (s % 2 && !p[i])
b[i] = 1;
if (s % 2 == 0 && p[i])
b[i] = 1;
}
vector<int> a;
for (int i = 1; i <= n; i++)
if (b[i])
a.push_back(i);
cout << a.size() << endl;
for (int i = 0; i < a.size(); i++) {
if (i)
cout << " ";
cout << a[i];
if (i == n - 1)
cout << endl;
}
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n + 2);
for (int i = 1; i <= n; i++)
cin >> p[i];
vector<int> b(n + 2);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i + i; j <= n; j += i)
s += b[j];
if (s % 2 && !p[i])
b[i] = 1;
if (s % 2 == 0 && p[i])
b[i] = 1;
}
vector<int> a;
for (int i = 1; i <= n; i++)
if (b[i])
a.push_back(i);
cout << a.size() << endl;
for (int i = 0; i < a.size(); i++) {
if (i)
cout << " ";
cout << a[i];
if (i == n - 1)
cout << endl;
}
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 778,487 | 778,488 | u098844816 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n + 2);
for (int i = 1; i <= n; i++)
cin >> p[i];
vector<int> b(n + 2);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i + i; j <= n; j += i)
s += p[i];
if (s % 2 && !p[i])
b[i] = 1;
if (s % 2 == 0 && p[i])
b[i] = 1;
}
vector<int> a;
for (int i = 1; i <= n; i++)
if (b[i])
a.push_back(i);
cout << a.size() << endl;
for (int i = 0; i < a.size(); i++) {
if (i)
cout << " ";
cout << a[i];
if (i == n - 1)
cout << endl;
}
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n + 2);
for (int i = 1; i <= n; i++)
cin >> p[i];
vector<int> b(n + 2);
for (int i = n; i >= 1; i--) {
int s = 0;
for (int j = i + i; j <= n; j += i)
s += b[j];
if (s % 2 && !p[i])
b[i] = 1;
if (s % 2 == 0 && p[i])
b[i] = 1;
}
vector<int> a;
for (int i = 1; i <= n; i++)
if (b[i])
a.push_back(i);
cout << a.size() << endl;
for (int i = 0; i < a.size(); i++) {
if (i)
cout << " ";
cout << a[i];
if (i == n - 1)
cout << endl;
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,489 | 778,488 | u098844816 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int m = 0;
for (int j = 2; i * j <= n; j++) {
m += a[i * j];
}
if (m % 2 != a[i])
ans[i] = 1;
}
cout << accumulate(begin(ans), end(ans), 0) << endl;
for (int i = 1; i <= n; i++) {
if (ans[i])
cout << i << " ";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int m = 0;
for (int j = 2; i * j <= n; j++)
m += ans[i * j];
if (m % 2 != a[i])
ans[i] = 1;
}
cout << accumulate(begin(ans), end(ans), 0) << endl;
for (int i = 1; i <= n; i++)
if (ans[i])
cout << i << " ";
}
| [
"assignment.value.change",
"identifier.change"
] | 778,498 | 778,499 | u820225607 | cpp |
p02972 | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Author: z0marlin
Title: D.cpp
Time: 16-08-2019T22:36:50+0530
I suck at CP T_T
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#if DEBUG
#define dprintf(...) printf(__VA_ARGS__)
#else
#define dprintf(...)
#endif
#define FOR(i, a, n) for (int i = a; i < n; ++i)
#define FORE(a, v) for (auto a : v)
#define MAX(a, b) ((a > b) ? a : b)
#define MIN(a, b) ((a < b) ? a : b)
#define mp(i, j) make_pair(i, j)
#define pb(a) push_back(a)
#define ppb(a) pop_back(a)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> pii_t;
typedef pair<ll, ll> pll_t;
typedef vector<int> vi_t;
typedef vector<ll> vll_t;
const int MAX_SZ = 1e6 + 2;
const int MOD = 1e9 + 7;
int t = 1, n, m, q, ql, qr;
char ch;
vi_t inp, res, cal;
int solve() {
cal.resize(n + 1);
int sum = 0;
for (int i = n; i > 0; i--) {
sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += cal[i];
}
if ((sum + inp[i - 1]) & 1) {
cal[i] = 1;
res.pb(i);
} else
cal[i] = 0;
}
printf("%d\n", res.size());
FORE(i, res) { printf("%d ", i); }
printf("\n");
return 0;
}
int main() {
// scanf("%d", &t);
while (t--) {
scanf("%d", &n);
inp.resize(n);
FOR(i, 0, n) { scanf("%d", &inp[i]); }
solve();
}
} | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Author: z0marlin
Title: D.cpp
Time: 16-08-2019T22:36:50+0530
I suck at CP T_T
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#if DEBUG
#define dprintf(...) printf(__VA_ARGS__)
#else
#define dprintf(...)
#endif
#define FOR(i, a, n) for (int i = a; i < n; ++i)
#define FORE(a, v) for (auto a : v)
#define MAX(a, b) ((a > b) ? a : b)
#define MIN(a, b) ((a < b) ? a : b)
#define mp(i, j) make_pair(i, j)
#define pb(a) push_back(a)
#define ppb(a) pop_back(a)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> pii_t;
typedef pair<ll, ll> pll_t;
typedef vector<int> vi_t;
typedef vector<ll> vll_t;
const int MAX_SZ = 1e6 + 2;
const int MOD = 1e9 + 7;
int t = 1, n, m, q, ql, qr;
char ch;
vi_t inp, res, cal;
int solve() {
cal.resize(n + 1);
int sum = 0;
for (int i = n; i > 0; i--) {
sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += cal[j];
}
if ((sum + inp[i - 1]) & 1) {
cal[i] = 1;
res.pb(i);
} else
cal[i] = 0;
}
printf("%d\n", res.size());
FORE(i, res) { printf("%d ", i); }
printf("\n");
return 0;
}
int main() {
// scanf("%d", &t);
while (t--) {
scanf("%d", &n);
inp.resize(n);
FOR(i, 0, n) { scanf("%d", &inp[i]); }
solve();
}
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,500 | 778,501 | u472496155 | cpp |
p02972 | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Author: z0marlin
Title: D.cpp
Time: 16-08-2019T22:36:50+0530
I suck at CP T_T
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#if DEBUG
#define dprintf(...) printf(__VA_ARGS__)
#else
#define dprintf(...)
#endif
#define FOR(i, a, n) for (int i = a; i < n; ++i)
#define FORE(a, v) for (auto a : v)
#define MAX(a, b) ((a > b) ? a : b)
#define MIN(a, b) ((a < b) ? a : b)
#define mp(i, j) make_pair(i, j)
#define pb(a) push_back(a)
#define ppb(a) pop_back(a)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> pii_t;
typedef pair<ll, ll> pll_t;
typedef vector<int> vi_t;
typedef vector<ll> vll_t;
const int MAX_SZ = 1e6 + 2;
const int MOD = 1e9 + 7;
int t = 1, n, m, q, ql, qr;
char ch;
vi_t inp, res, cal;
int solve() {
cal.resize(n + 1);
int sum = 0;
for (int i = n; i > 0; i--) {
for (int j = i + i; j <= n; j += i) {
sum += cal[i];
}
if ((sum + inp[i - 1]) & 1) {
cal[i] = 1;
res.pb(i);
} else
cal[i] = 0;
}
printf("%d\n", res.size());
FORE(i, res) { printf("%d ", i); }
printf("\n");
return 0;
}
int main() {
// scanf("%d", &t);
while (t--) {
scanf("%d", &n);
inp.resize(n);
FOR(i, 0, n) { scanf("%d", &inp[i]); }
solve();
}
} | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Author: z0marlin
Title: D.cpp
Time: 16-08-2019T22:36:50+0530
I suck at CP T_T
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#if DEBUG
#define dprintf(...) printf(__VA_ARGS__)
#else
#define dprintf(...)
#endif
#define FOR(i, a, n) for (int i = a; i < n; ++i)
#define FORE(a, v) for (auto a : v)
#define MAX(a, b) ((a > b) ? a : b)
#define MIN(a, b) ((a < b) ? a : b)
#define mp(i, j) make_pair(i, j)
#define pb(a) push_back(a)
#define ppb(a) pop_back(a)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> pii_t;
typedef pair<ll, ll> pll_t;
typedef vector<int> vi_t;
typedef vector<ll> vll_t;
const int MAX_SZ = 1e6 + 2;
const int MOD = 1e9 + 7;
int t = 1, n, m, q, ql, qr;
char ch;
vi_t inp, res, cal;
int solve() {
cal.resize(n + 1);
int sum = 0;
for (int i = n; i > 0; i--) {
sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += cal[j];
}
if ((sum + inp[i - 1]) & 1) {
cal[i] = 1;
res.pb(i);
} else
cal[i] = 0;
}
printf("%d\n", res.size());
FORE(i, res) { printf("%d ", i); }
printf("\n");
return 0;
}
int main() {
// scanf("%d", &t);
while (t--) {
scanf("%d", &n);
inp.resize(n);
FOR(i, 0, n) { scanf("%d", &inp[i]); }
solve();
}
} | [
"assignment.add",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,502 | 778,501 | u472496155 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
cin.ignore();
vector<ll> a;
ll tmp = 0;
bool allzero = true;
for (ll i = 0; i < n; i++) {
cin >> tmp;
if (tmp != 0) {
allzero = false;
}
a.push_back(tmp);
}
ll b[n] = {0};
for (ll i = 0; i < n / 2; i++) {
b[i] = 0;
}
for (ll i = n / 2; i < n; i++) {
b[i] = a[i];
}
if (allzero == true) {
cout << 0 << endl;
return 0;
}
// 後ろからあてはめていく
ll sufi, sufj;
ll sum;
for (ll i = n / 2; i >= 1; i--) {
sufi = i - 1;
sum = 0;
for (ll j = i * 2; j <= n; j += i) {
sufj = j - 1;
sum += b[sufj];
}
sum = sum % 2;
if (a[sufi] != sum) {
// cout << i << endl;
b[sufi] = 1;
} else {
b[sufi] = a[sufi];
}
}
// ここから変数の意味が変わる
sum = 0;
for (ll i = 0; i < n; i++) {
if (b[i] == 1)
++sum;
}
cout << sum << endl;
for (ll i = 0; i < n; i++) {
if (b[i] == 1) {
cout << (i + 1) << " " << flush;
}
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
cin.ignore();
vector<ll> a;
ll tmp = 0;
bool allzero = true;
for (ll i = 0; i < n; i++) {
cin >> tmp;
if (tmp != 0) {
allzero = false;
}
a.push_back(tmp);
}
ll b[n] = {0};
for (ll i = 0; i < n / 2; i++) {
b[i] = 0;
}
for (ll i = n / 2; i < n; i++) {
b[i] = a[i];
}
if (allzero == true) {
cout << 0 << endl;
return 0;
}
// 後ろからあてはめていく
ll sufi, sufj;
ll sum;
for (ll i = n / 2; i >= 1; i--) {
sufi = i - 1;
sum = 0;
for (ll j = i * 2; j <= n; j += i) {
sufj = j - 1;
sum += b[sufj];
}
sum = sum % 2;
if (a[sufi] != sum) {
// cout << i << endl;
b[sufi] = 1;
} else {
b[sufi] = 0;
}
}
// ここから変数の意味が変わる
sum = 0;
for (ll i = 0; i < n; i++) {
if (b[i] == 1)
++sum;
}
cout << sum << endl;
for (ll i = 0; i < n; i++) {
if (b[i] == 1) {
cout << (i + 1) << " " << flush;
}
}
cout << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 778,507 | 778,508 | u042605975 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> rest(n + 1, 0);
vector<int> ans(n + 1, 0);
vector<int> res;
for (int i = n; i > 0; i--) {
ans[i] = (abs(rest[i] - a[i])) % 2;
if (ans[i] == 1) {
res.push_back(i);
for (int j = 1; j * j <= n; j++) {
if (i % j == 0) {
if (j * j == n)
rest[j]++;
else {
rest[j]++;
rest[i / j]++;
}
}
}
}
}
int m = res.size();
cout << m << endl;
for (int i = 0; i < m; i++) {
cout << res[i];
if (i == m - 1)
cout << endl;
else
cout << " ";
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> rest(n + 1, 0);
vector<int> ans(n + 1, 0);
vector<int> res;
for (int i = n; i > 0; i--) {
ans[i] = (abs(rest[i] - a[i])) % 2;
if (ans[i] == 1) {
res.push_back(i);
for (int j = 1; j * j <= i; j++) {
if (i % j == 0) {
if (j * j == i)
rest[j]++;
else {
rest[j]++;
rest[i / j]++;
}
}
}
}
}
int m = res.size();
cout << m << endl;
for (int i = 0; i < m; i++) {
cout << res[i];
if (i == m - 1)
cout << endl;
else
cout << " ";
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,511 | 778,512 | u487641373 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int N, a[210000], ans[210000];
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
int count = 0, countA = 0;
for (int i = N; i >= 1; i--, count = 0) {
if (i * 2 > N)
ans[i] = a[i];
else {
int temp = i * 2;
while (temp <= N) {
count += a[temp];
temp += i;
}
if (count % 2 != a[i])
ans[i] = 1;
}
if (ans[i] == 1)
countA++;
}
cout << countA << endl;
int hantei = 0;
if (countA != 0) {
for (int i = 1; i <= N; i++) {
if (ans[i] == 1) {
if (hantei == 0) {
cout << i;
hantei++;
} else
cout << " " << i;
}
}
cout << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int N, a[210000], ans[210000];
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
int count = 0, countA = 0;
for (int i = N; i >= 1; i--, count = 0) {
if (i * 2 > N)
ans[i] = a[i];
else {
int temp = i * 2;
while (temp <= N) {
count += ans[temp];
temp += i;
}
if (count % 2 != a[i])
ans[i] = 1;
}
if (ans[i] == 1)
countA++;
}
cout << countA << endl;
int hantei = 0;
if (countA != 0) {
for (int i = 1; i <= N; i++) {
if (ans[i] == 1) {
if (hantei == 0) {
cout << i;
hantei++;
} else
cout << " " << i;
}
}
cout << endl;
}
}
| [
"assignment.value.change",
"identifier.change"
] | 778,513 | 778,514 | u591914971 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MAX_N = 2e5 + 10;
int arr[MAX_N];
void Eratosthenes(ll n) {
for (ll i = 0; i < n; i++) {
arr[i] = 1;
}
for (ll i = 2; i < sqrt(n); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) < n; j++) {
arr[i * (j + 2)] = 0;
}
}
}
}
int main(int argc, char const *argv[]) {
ll n;
int a[MAX_N] = {0}, x[MAX_N] = {0};
cin >> n;
for (ll i = 1; i <= n; ++i) {
cin >> a[i];
}
Eratosthenes(n);
vector<ll> vec;
vector<vector<ll>> multi(n);
bool tf = true;
for (ll i = n; i > 0 && tf; --i) {
if (i * 2 > n) {
x[i] = a[i];
} else {
int sum = 0;
for (int j = 2; j <= n / i; ++j) {
// if (!arr[j]) continue;
sum += a[j * i];
sum %= 2;
}
if ((sum + 1) % 2 == a[i]) {
x[i] = 1;
} else
x[i] = 0;
}
}
for (ll i = 1; i <= n; ++i) {
if (x[i] == 1) {
vec.emplace_back(i);
}
}
if (tf) {
cout << vec.size() << endl;
for (int i = 0; i < vec.size(); ++i) {
printf("%lld\n", vec[i]);
}
} else
cout << -1 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MAX_N = 2e5 + 10;
int arr[MAX_N];
void Eratosthenes(ll n) {
for (ll i = 0; i < n; i++) {
arr[i] = 1;
}
for (ll i = 2; i < sqrt(n); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) < n; j++) {
arr[i * (j + 2)] = 0;
}
}
}
}
int main(int argc, char const *argv[]) {
ll n;
int a[MAX_N] = {0}, x[MAX_N] = {0};
cin >> n;
for (ll i = 1; i <= n; ++i) {
cin >> a[i];
}
Eratosthenes(n);
vector<ll> vec;
vector<vector<ll>> multi(n);
bool tf = true;
for (ll i = n; i > 0 && tf; --i) {
if (i * 2 > n) {
x[i] = a[i];
} else {
int sum = 0;
for (int j = 2; j <= n / i; ++j) {
// if (!arr[j]) continue;
sum += x[j * i];
sum %= 2;
}
if ((sum + 1) % 2 == a[i]) {
x[i] = 1;
} else
x[i] = 0;
}
}
for (ll i = 1; i <= n; ++i) {
if (x[i] == 1) {
vec.emplace_back(i);
}
}
if (tf) {
cout << vec.size() << endl;
for (int i = 0; i < vec.size(); ++i) {
printf("%lld\n", vec[i]);
}
} else
cout << -1 << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 778,518 | 778,519 | u391752022 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("in.txt", "r",stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int A[n + 1], memo[n + 1];
memset(memo, 0, sizeof(memo));
for (int i = 1; i <= n; ++i)
cin >> A[i];
for (int i = n; i >= 1; i--) {
if (i > n / 2) {
memo[i] = A[i];
} else {
int cnt = 0;
int toAdd = 0;
for (int j = n / i; j >= 1; --j) {
int m = i * j;
if (memo[m] == 1)
cnt++;
else if (m <= n / 2)
toAdd = m;
}
if ((cnt % 2 == 0 && A[i] % 2 != 0) || (cnt % 2 != 0 && A[i] % 2 == 0))
memo[toAdd] = 1;
}
}
int cnt = 0;
for (int i = 1; i <= n; ++i)
if (memo[i] == 1)
cnt++;
cout << cnt << endl;
bool solution = false;
for (int i = 1; i <= n; ++i)
if (memo[i] == 1) {
solution = true;
cout << i << " ";
}
if (!solution)
cout << "0";
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("in.txt", "r",stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int A[n + 1], memo[n + 1];
memset(memo, 0, sizeof(memo));
for (int i = 1; i <= n; ++i)
cin >> A[i];
for (int i = n; i >= 1; i--) {
if (i > n / 2) {
memo[i] = A[i];
} else {
int cnt = 0;
int toAdd = 0;
for (int j = n / i; j >= 1; --j) {
int m = i * j;
if (memo[m] == 1)
cnt++;
else if (m <= n / 2)
toAdd = m;
}
if ((cnt % 2 == 0 && A[i] % 2 != 0) || (cnt % 2 != 0 && A[i] % 2 == 0))
memo[toAdd] = 1;
}
}
int cnt = 0;
for (int i = 1; i <= n; ++i)
if (memo[i] == 1)
cnt++;
if (cnt > 0)
cout << cnt << endl;
bool solution = false;
for (int i = 1; i <= n; ++i)
if (memo[i] == 1) {
solution = true;
cout << i << " ";
}
if (!solution)
cout << "0";
cout << endl;
return 0;
} | [
"control_flow.branch.if.add"
] | 778,520 | 778,521 | u781659997 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
sizeは(int)とキャストしよう
ごちゃごちゃ場合分けを考える前に全探索は考えましたか？
*/
// void chmod(ll &M){
// if(M >= mod) M %= mod;
// else if(M < 0){
// M += (abs(M)/mod + 1)*mod;
// M %= mod;
// }
// }
const ll mod = 1e9 + 7;
int main() {
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];
int sum = 0;
vector<int> ans(n + 1, 0);
for (int i = n; i > 0; --i) {
int cnt = 0;
for (int j = 2 * i; j <= n; j += i)
cnt += ans[j];
if (cnt % 2 == 0 && a[i] == 0)
ans[i] = 0;
if (cnt % 2 == 0 && a[i] == 1)
ans[i] = 1;
if (cnt % 2 == 1 && a[i] == 0)
ans[i] = 1;
if (cnt % 2 == 1 && a[i] == 1)
ans[i] = 0;
if (ans[i])
++sum;
}
cout << sum << endl;
bool flg = true;
if (sum) {
for (int i = 1; i <= n; ++i) {
if (ans[i] && flg) {
cout << 1;
flg = false;
} else if (ans[i] && !flg) {
cout << ' ';
cout << 1;
}
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
sizeは(int)とキャストしよう
ごちゃごちゃ場合分けを考える前に全探索は考えましたか？
*/
// void chmod(ll &M){
// if(M >= mod) M %= mod;
// else if(M < 0){
// M += (abs(M)/mod + 1)*mod;
// M %= mod;
// }
// }
const ll mod = 1e9 + 7;
int main() {
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];
int sum = 0;
vector<int> ans(n + 1, 0);
for (int i = n; i > 0; --i) {
int cnt = 0;
for (int j = 2 * i; j <= n; j += i)
cnt += ans[j];
if (cnt % 2 == 0 && a[i] == 0)
ans[i] = 0;
if (cnt % 2 == 0 && a[i] == 1)
ans[i] = 1;
if (cnt % 2 == 1 && a[i] == 0)
ans[i] = 1;
if (cnt % 2 == 1 && a[i] == 1)
ans[i] = 0;
if (ans[i])
++sum;
}
cout << sum << endl;
bool flg = true;
if (sum) {
for (int i = 1; i <= n; ++i) {
if (ans[i] && flg) {
cout << i;
flg = false;
} else if (ans[i] && !flg) {
cout << ' ';
cout << i;
}
}
cout << endl;
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 778,524 | 778,525 | u052332717 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
ll N;
cin >> N;
ll A[N + 10];
ll B[N + 10];
rep1(i, N) { cin >> A[i]; }
ll ori = N / 2 + 1;
ll count = 0;
for (int i = ori; i <= N; i++) {
if (A[i] == 1) {
count++;
B[i] = 1;
} else
B[i] = 0;
}
if (N >= 2) {
for (int i = N / 2; i > 0; i--) {
ll ad = 0;
for (int j = 2; j <= N / i; j++) {
ll k = i * j;
ad += A[k];
ad %= 2;
}
if (A[i] == ad)
B[i] = 0;
else {
B[i] = 1;
count++;
}
}
}
cout << count << endl;
if (count != 0) {
rep1(i, N) {
if (B[i] == 1) {
cout << i << " ";
} else
continue;
}
}
}
| #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
ll N;
cin >> N;
ll A[N + 10];
ll B[N + 10];
rep1(i, N) { cin >> A[i]; }
ll ori = N / 2 + 1;
ll count = 0;
for (int i = ori; i <= N; i++) {
if (A[i] == 1) {
count++;
B[i] = 1;
} else
B[i] = 0;
}
if (N >= 2) {
for (int i = N / 2; i > 0; i--) {
ll ad = 0;
for (int j = 2; j <= N / i; j++) {
ll k = i * j;
ad += B[k];
ad %= 2;
}
if (A[i] == ad)
B[i] = 0;
else {
B[i] = 1;
count++;
}
}
}
cout << count << endl;
if (count != 0) {
rep1(i, N) {
if (B[i] == 1) {
cout << i << " ";
} else
continue;
}
}
}
| [
"assignment.value.change",
"identifier.change"
] | 778,530 | 778,531 | u726501606 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define ALL(A) (A).begin(), (A).end()
#define ll long long
const ll mod = 1e9 + 7;
const ll INF = 2 * 1e18;
const int inf = 1e9 + 7;
int a[200005];
int b[200005];
int main(void) {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = N; i >= 1; i--) {
int c = 0; //今までの箱に入っているボールの合計数
int t = i; // tは現在見ている番号
while (t <= N) {
c += b[t];
t *= 2;
}
if (c % 2 == a[i])
b[i] = 0;
else {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= N; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(A) (A).begin(), (A).end()
#define ll long long
const ll mod = 1e9 + 7;
const ll INF = 2 * 1e18;
const int inf = 1e9 + 7;
int a[200005];
int b[200005];
int main(void) {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = N; i >= 1; i--) {
int c = 0; //今までの箱に入っているボールの合計数
int t = i; // tは現在見ている番号
while (t <= N) {
c += b[t];
t += i;
}
if (c % 2 == a[i])
b[i] = 0;
else {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= N; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
} | [
"assignment.change"
] | 778,534 | 778,535 | u168774513 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef int64_t ll;
typedef long double ld;
const int INF = 1e9;
const ld EPS = 1e-8;
void solve(const vector<int> &a) {
int N = a.size();
vector<int> cnt(N + 1, 0);
vector<int> b(N + 1, 0);
for (int i = N; i >= 1; i--) {
if (cnt[i] % 2 != a[i - 1]) {
b[i] = 1;
for (int j = 1; j * j <= i; j++) {
if (i % j)
continue;
cnt[j]++;
if (j * j != i)
cnt[i / j]++;
}
}
}
int M = accumulate(ALL(b), 0);
cout << M << endl;
if (M) {
bool flag = false;
REP(i, N) {
if (b[i + 1] == 0)
continue;
if (flag)
cout << " ";
flag = true;
cout << b[i + 1];
}
cout << endl;
}
}
int main() {
int N;
cin >> N;
vector<int> a(N);
REP(i, N) cin >> a[i];
solve(a);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef int64_t ll;
typedef long double ld;
const int INF = 1e9;
const ld EPS = 1e-8;
void solve(const vector<int> &a) {
int N = a.size();
vector<int> cnt(N + 1, 0);
vector<int> b(N + 1, 0);
for (int i = N; i >= 1; i--) {
if (cnt[i] % 2 != a[i - 1]) {
b[i] = 1;
for (int j = 1; j * j <= i; j++) {
if (i % j)
continue;
cnt[j]++;
if (j * j != i)
cnt[i / j]++;
}
}
}
int M = accumulate(ALL(b), 0);
cout << M << endl;
if (M) {
bool flag = false;
REP(i, N) {
if (b[i + 1] == 0)
continue;
if (flag)
cout << " ";
flag = true;
cout << (i + 1);
}
cout << endl;
}
}
int main() {
int N;
cin >> N;
vector<int> a(N);
REP(i, N) cin >> a[i];
solve(a);
return 0;
}
| [
"io.output.change"
] | 778,540 | 778,541 | u886956383 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
void dump(vector<int> &data, string name) {
cout << name << "= {";
for (int i = 0; i < data.size(); i++)
cout << data[i] << " ";
cout << "} " << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) cin >> a[i + 1];
for (int i = n / 2 + 1; i < n + 1; i++)
b[i] = a[i];
// dump(a,"a");
// dump(b,"b");
for (int i = n / 2; i > 0; i--) {
int cnt = 0;
for (int j = 2; i * j < n; j++) {
cnt += a[i * j];
}
if (cnt % 2 == a[i])
b[i] = 0;
else
b[i] = 1;
// dump(b,"b");
}
int sum = 0;
for (int i = 1; i < n + 1; i++)
sum += b[i];
cout << sum << endl;
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1) {
if (i != n + 1)
cout << i << " ";
else
cout << i;
}
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
void dump(vector<int> &data, string name) {
cout << name << "= {";
for (int i = 0; i < data.size(); i++)
cout << data[i] << " ";
cout << "} " << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) cin >> a[i + 1];
for (int i = n / 2 + 1; i < n + 1; i++)
b[i] = a[i];
// dump(a,"a");
// dump(b,"b");
for (int i = n / 2; i > 0; i--) {
int cnt = 0;
for (int j = 2; i * j < n + 1; j++) {
cnt += b[i * j];
// cout << i *j << " = " << a[i*j] << " ";
}
if (cnt % 2 == a[i])
b[i] = 0;
else
b[i] = 1;
// cout << "cnt%2 = " << cnt%2 << endl;
// cout << "a[" << i << "] = " << a[i] << endl;
// dump(a,"a");
// dump(b,"b");
// cout << endl;
}
int sum = 0;
for (int i = 1; i < n + 1; i++)
sum += b[i];
cout << sum << endl;
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1) {
if (i != n + 1)
cout << i << " ";
else
cout << i;
}
}
cout << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.value.change",
"identifier.change"
] | 778,544 | 778,545 | u341388158 | cpp |
p02972 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
int n, a[200001], box[200001];
int main(void) {
int i, mul = 1, sum = 0, balls = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = n; i >= 1; i--) {
mul = i * 2;
sum = 0;
while (mul <= n) {
sum += box[mul];
mul += i;
}
if ((a[i] == 0 && (sum % 2) == 1) || (a[i] == 1 && (sum % 2) == 0)) {
box[i]++;
balls++;
}
}
cout << balls << endl;
for (i = 1; i < n; i++) {
if (box[i] == 1)
cout << i << " ";
}
if (balls > 0)
cout << endl;
return 0;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
int n, a[200001], box[200001];
int main(void) {
int i, mul = 1, sum = 0, balls = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = n; i >= 1; i--) {
mul = i * 2;
sum = 0;
while (mul <= n) {
sum += box[mul];
mul += i;
}
if ((a[i] == 0 && (sum % 2) == 1) || (a[i] == 1 && (sum % 2) == 0)) {
box[i]++;
balls++;
}
}
cout << balls << endl;
for (i = 1; i <= n; i++) {
if (box[i] == 1)
cout << i << " ";
}
if (balls > 0)
cout << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,546 | 778,547 | u940654002 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define ARR(array) for (int i = 0; i < array.size(); i++)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 1000000007
#define SIZE 10005
#define PI 3.14159265358979323846
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最小公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最大公倍数
ll input() {
ll a;
cin >> a;
return a;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll a[300000];
REP(i, n) cin >> a[i + 1];
bool x[300000] = {false};
vector<ll> v;
FORR(i, n + 1, 1) {
int sum = 0;
for (int j = i; j < n; j += i)
if (x[j])
sum++;
if (a[i] != sum % 2) {
x[i] = true;
v.push_back(i);
}
}
cout << v.size() << endl;
REP(i, v.size()) cout << v[i] << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define ARR(array) for (int i = 0; i < array.size(); i++)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 1000000007
#define SIZE 10005
#define PI 3.14159265358979323846
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最小公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最大公倍数
ll input() {
ll a;
cin >> a;
return a;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll a[300000];
REP(i, n) cin >> a[i + 1];
bool x[300000] = {false};
vector<ll> v;
FORR(i, n + 1, 1) {
int sum = 0;
for (int j = i; j <= n; j += i)
if (x[j])
sum++;
if (a[i] != sum % 2) {
x[i] = true;
v.push_back(i);
}
}
cout << v.size() << endl;
REP(i, v.size()) cout << v[i] << " ";
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,550 | 778,551 | u288432959 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
vector<int> ans(n + 1);
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 != v[i])
ans[i]++;
}
int m = 0;
for (int i = 1; i <= n; ++i) {
m += ans[i];
}
cout << m << endl;
for (int i = 1; i <= n; ++i) {
if (ans[i] == 1)
cout << ans[i] << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
vector<int> ans(n + 1);
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 != v[i])
ans[i]++;
}
int m = 0;
for (int i = 1; i <= n; ++i) {
m += ans[i];
}
cout << m << endl;
for (int i = 1; i <= n; ++i) {
if (ans[i] == 1)
cout << i << " ";
}
cout << endl;
return 0;
} | [] | 778,552 | 778,553 | u754651673 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
// rep(i, n) cin >> v[i];
for (int i = 1; i <= n; i++)
cin >> v[i];
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j *= 2) {
sum += ans[j];
}
if (sum % 2 != v[i])
ans[i]++;
}
int cnt = 0;
for (int i = 1; i <= n; i++)
cnt += ans[i];
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] == 1)
cout << i << " ";
}
cout << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i];
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 != v[i])
ans[i]++;
}
int cnt = 0;
for (int i = 1; i <= n; i++)
cnt += ans[i];
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] == 1)
cout << i << " ";
}
cout << endl;
} | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 778,556 | 778,555 | u754651673 | cpp |
p02972 |
//#pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <vector>
#ifdef _MSC_VER
#include <intrin.h>
#define popcnt __popcnt64
//# define __builtin_popcount __popcnt
#else
#define popcnt __builtin_popcountll
#endif
//#include "boost/variant.hpp"
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
#define rep(i, N, M) for (ll i = N, i##_len = (M); i < i##_len; ++i)
#define rep_skip(i, N, M, ...) \
for (ll i = N, i##_len = (M); i < i##_len; i += (skip))
#define rrep(i, N, M) for (ll i = (M)-1, i##_len = (N - 1); i > i##_len; --i)
#define pb push_back
#define fir first
#define sec second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define perm(c) \
sort(all(c)); \
for (bool c##perm = 1; c##perm; \
c##perm = next_permutation( \
all(c))) // perm(c){write(c)} writes all permutation of c
typedef pair<double, double> pd;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
template <typename T>
using pq_greater = priority_queue<T, vector<T>, greater<T>>;
struct Point {
ll x;
ll y;
};
using vpt = vector<Point>;
template <int n> struct tll_impl {
using type = decltype(tuple_cat(tuple<ll>(),
declval<typename tll_impl<n - 1>::type>()));
};
template <> struct tll_impl<1> { using type = tuple<ll>; };
template <int n> using tll = typename tll_impl<n>::type;
template <class T> constexpr ll SZ(T &v) { return static_cast<ll>(v.size()); };
template <int n, typename T> struct vec_t_impl {
using type = vector<typename vec_t_impl<n - 1, T>::type>;
};
template <typename T> struct vec_t_impl<1, T> { using type = vector<T>; };
template <int n, typename T> using vec_t = typename vec_t_impl<n, T>::type;
// check
static_assert(is_same<vec_t<3, ll>, vector<vector<vector<ll>>>>::value, "");
// decompose vector into basetype and dimension.
template <typename T> struct vec_dec {
static constexpr int dim = 0;
using type = T;
};
template <typename T> struct vec_dec<vector<T>> {
static constexpr int dim = vec_dec<T>::dim + 1;
using type = typename vec_dec<T>::type;
};
static_assert(is_same<typename vec_dec<vec_t<3, ll>>::type, ll>::value, "");
static_assert(vec_dec<vec_t<3, ll>>::dim == 3, "");
template <typename T = ll> vector<T> makev(size_t a) { return vector<T>(a); }
template <typename T = ll, typename... Ts> auto makev(size_t a, Ts... ts) {
return vector<decltype(makev<T>(ts...))>(a, makev<T>(ts...));
}
// ex: auto dp = makev<ll>(4,5) => vector<vector<ll>> dp(4,vector<ll>(5));
// check if T is vector
template <typename T> struct is_vector : std::false_type {};
template <typename T> struct is_vector<vector<T>> : std::true_type {};
static_assert(is_vector<vector<ll>>::value == true &&
is_vector<ll>::value == false,
"");
// check if T is vector
template <typename T> struct is_pair : std::false_type {};
template <typename T, typename S>
struct is_pair<pair<T, S>> : std::true_type {};
static_assert(is_pair<pll>::value == true && is_pair<ll>::value == false, "");
template <typename T, typename V,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
for (auto &&x : t)
fill_v(x, v);
}
// ex: fill_v(dp, INF);
template <typename T,
typename enable_if<!is_vector<T>::value && !is_pair<T>::value,
nullptr_t>::type = nullptr>
void read(T &x) {
cin >> x;
}
template <typename T,
typename enable_if<is_pair<T>::value, nullptr_t>::type = nullptr>
void read(T &x) {
read(x.first);
read(x.second);
}
template <typename T,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void read(T &x) {
rep(i, 0, x.size()) read(x[i]);
}
template <> void read(Point &p) { cin >> p.x >> p.y; }
template <typename T, typename Delim_t = string,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void write(T &x, Delim_t delim = " ") {
cout << x << delim;
}
template <typename T, typename Delim_t = string,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void write(T &x, Delim_t delim = " ") {
rep(i, 0, x.size()) write(x[i], (i == (x.size() - 1) ? "" : delim));
cout << '\n';
}
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
vll seq(ll i, ll j) {
vll res(j - i);
rep(k, i, j) res[k] = i + k;
return res;
}
constexpr ll POW_0(ll x, ll y) {
if (y == 0)
return 1;
if (y == 1)
return x;
if (y == 2)
return x * x;
if (y % 2 == 0)
return POW_0(POW_0(x, y / 2), 2LL);
return ((POW_0(POW_0(x, y / 2), 2LL)) * (x));
}
constexpr ll POW(ll x, ll y, ll mod = 0) {
if (mod == 0)
return POW_0(x, y);
if (y == 0)
return 1;
if (y == 1)
return x % mod;
if (y == 2)
return x * x % mod;
if (y % 2 == 0)
return POW(POW(x, y / 2, mod), 2LL, mod) % mod;
return ((POW(POW(x, y / 2, mod), 2LL, mod)) * (x % mod)) % mod;
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void sort_by(Inputs &inputs, Functor f) {
std::sort(std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void stable_sort_by(Inputs &inputs, Functor f) {
std::stable_sort(
std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
template <typename Inputs> void sort_uniq(Inputs &inputs) {
sort(all(inputs));
inputs.erase(unique(all(inputs)), inputs.end());
}
vector<string> split(const string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
return elems;
}
ll div_ferm(ll val, ll b, ll mod) { return (val * POW(b, mod - 2, mod)) % mod; }
// === Modint ===
// static uint_fast64_t runtime_modulus = MOD;
template <ll modulus = MOD> class modint {
public:
ll val;
constexpr modint() : val(0) {}
constexpr modint(ll x) : val((x %= mod()) < 0 ? x + mod() : x) {}
constexpr modint(ll x, ll modulus_) {
set_modulo(modulus_);
val = (x %= mod()) < 0 ? x + mod() : x;
}
template <class Ret = ll &>
static auto modulo() -> std::enable_if_t<(modulus <= 0), Ret> {
static ll runtime_modulus = numeric_limits<ll>::max();
return runtime_modulus; // singleton technique
}
template <class Ret = const ll>
static auto mod() -> std::enable_if_t<(modulus <= 0), Ret> {
return modulo();
}
template <class Ret = const ll>
static constexpr auto mod() -> std::enable_if_t<(modulus > 0), Ret> {
return modulus;
}
template <ll modulus_ = modulus,
enable_if_t<(modulus_ <= 0), nullptr_t> = nullptr>
static void set_modulo(ll mod) {
modulo() = mod;
}
void reset_modulo(ll modulus_) {
modulo() = modulus_;
val %= mod();
}
constexpr modint inv() { return pow(mod() - 2); }
constexpr ll value() const noexcept { return val; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
modint &operator+=(const modint rhs) noexcept {
val += rhs.val;
if (val >= mod()) {
val -= mod();
}
return *this;
}
modint &operator-=(const modint rhs) noexcept {
if (val < rhs.val) {
val += mod();
}
val -= rhs.val;
return *this;
}
modint &operator*=(const modint rhs) noexcept {
val = val * rhs.val % mod();
return *this;
}
modint &operator/=(modint rhs) noexcept {
ll exp = mod() - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
modint &operator++() noexcept { return *this += modint(1); }
modint &operator++(int) noexcept {
auto t = *this;
*this += modint(1);
return t;
}
modint &operator--() noexcept { return *this -= modint(1); }
modint &operator--(int) noexcept {
auto t = *this;
*this -= modint(1);
return t;
}
constexpr modint operator-() { return val ? mod() - val : val; }
constexpr bool operator==(const modint rhs) const noexcept {
return val == rhs.value();
}
constexpr bool operator!=(const modint rhs) const noexcept {
return val != rhs.value();
}
constexpr bool operator<(const modint rhs) const noexcept {
return val < rhs.value();
}
static constexpr modint zero() { return modint(0); }
static constexpr modint unit() { return modint(1); }
modint pow(long long k) const {
modint v = *this;
modint res(1), tmp(v);
while (k) {
if (k & 1)
res *= tmp;
tmp *= tmp;
k >>= 1;
}
return res;
}
ll log(modint b) {
modint val = *this;
const ll sq = 40000;
map<modint, ll> dp;
// dp.reserve(sq);
modint res(1);
for (ll r = 0; r < sq; r++) {
if (!dp.count(res))
dp[res] = r;
res *= val;
}
modint p = val.inv().pow(sq);
res = b;
for (ll q = 0; q <= mod() / sq + 1; q++) {
if (dp.count(res)) {
ll idx = q * sq + dp[res];
if (idx > 0)
return idx;
}
res *= p;
}
return INF;
}
friend ostream &operator<<(ostream &o, const modint<modulus> &t) {
o << t.value();
return o;
}
friend istream &operator>>(istream &in, modint<modulus> &t) {
ll x;
in >> x;
t = modint<modulus>(x);
return in;
}
friend modint<modulus> POW(modint<modulus> x, ll n) {
return modint<modulus>(POW(x.value(), n, mod()));
}
};
// user defined literal
modint<MOD> operator"" _mod(unsigned long long x) { return modint<MOD>(x); }
class Combination {
// this calculates combination (nCk).
// Constructor runs in O(MAX).
// get(n,k) returns nCk in O(1).
ll N_MAX, mod;
vll fac;
vll finv;
vll inv;
public:
Combination(ll mod = MOD, ll N_MAX = 210000)
: mod(mod), N_MAX(max(N_MAX, 2LL)), fac(vll(N_MAX + 1)),
finv(vll(N_MAX + 1)), inv(vll(N_MAX + 1)) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
pre_process(2LL, N_MAX + 1);
}
ll operator()(ll n, ll k) {
// choose k from n
if (N_MAX < n)
pre_process(N_MAX + 1, n + 1);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll H(ll n, ll k) {
// 1) 区間[0, k) を（空を許して）n個に分割する場合の数
// 2) n個の中からk個を重複を許して選ぶ
return (n == 0 && k == 0) ? 1 : operator()(n + k - 1, k);
}
ll P(ll n, ll k) {
// n (n-1) ... (n-k+1)
return (n < k || n < 0) ? 0 : fac[n] * finv[n - k];
}
private:
void pre_process(ll m, ll n) {
if (N_MAX < n) {
fac.resize(n);
inv.resize(n);
finv.resize(n);
}
rep(i, m, n) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
};
ll choose(int n, int r) { // O(r) for small n
ll acc = 1;
rep(i, 0, r) acc = acc * (n - i) / (i + 1);
return acc;
}
ll gcd(ll val, ll b) {
if (val % b == 0)
return b;
else
return gcd(b, val % b);
}
vll getDivisors(ll n) {
vll res;
ll i = 1;
for (; i * i < n; i++) {
if (n % i == 0) {
res.push_back(i);
res.push_back(n / i);
}
}
if (i * i == n)
res.push_back(i);
sort(res.begin(), res.end());
return res;
}
vll getDivisors(ll n, ll m) {
// O(sqrt(min(n,m)))
if (n > m)
swap(n, m);
vll res;
ll i = 1;
for (; i * i < n; i++) {
if (n % i == 0) {
if (m % i == 0)
res.push_back(i);
if (m % (n / i) == 0)
res.push_back(n / i);
}
}
if (i * i == n)
if (m % i == 0)
res.push_back(i);
sort(res.begin(), res.end());
return res;
}
vector<pll> prime_factorize(ll n) {
vector<pll> res;
for (ll p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
ll num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back({p, num});
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// ============================ Header =================================
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
ll n;
cin >> n;
vll a(n);
read(a);
vll b(n + 1);
rrep(i, 1, n + 1) {
auto divs = getDivisors(i);
b[i] = a[i - 1];
for (auto div : divs) {
if (div != i)
b[div] ^= b[i];
}
}
ll m = count(all(b), 1);
cout << m << endl;
vll c;
rep(i, 1, n + 1) {
if (b[i])
c.push_back(i);
}
if (m)
write(c, " ");
}
|
//#pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <vector>
#ifdef _MSC_VER
#include <intrin.h>
#define popcnt __popcnt64
//# define __builtin_popcount __popcnt
#else
#define popcnt __builtin_popcountll
#endif
//#include "boost/variant.hpp"
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
#define rep(i, N, M) for (ll i = N, i##_len = (M); i < i##_len; ++i)
#define rep_skip(i, N, M, ...) \
for (ll i = N, i##_len = (M); i < i##_len; i += (skip))
#define rrep(i, N, M) for (ll i = (M)-1, i##_len = (N - 1); i > i##_len; --i)
#define pb push_back
#define fir first
#define sec second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define perm(c) \
sort(all(c)); \
for (bool c##perm = 1; c##perm; \
c##perm = next_permutation( \
all(c))) // perm(c){write(c)} writes all permutation of c
typedef pair<double, double> pd;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
template <typename T>
using pq_greater = priority_queue<T, vector<T>, greater<T>>;
struct Point {
ll x;
ll y;
};
using vpt = vector<Point>;
template <int n> struct tll_impl {
using type = decltype(tuple_cat(tuple<ll>(),
declval<typename tll_impl<n - 1>::type>()));
};
template <> struct tll_impl<1> { using type = tuple<ll>; };
template <int n> using tll = typename tll_impl<n>::type;
template <class T> constexpr ll SZ(T &v) { return static_cast<ll>(v.size()); };
template <int n, typename T> struct vec_t_impl {
using type = vector<typename vec_t_impl<n - 1, T>::type>;
};
template <typename T> struct vec_t_impl<1, T> { using type = vector<T>; };
template <int n, typename T> using vec_t = typename vec_t_impl<n, T>::type;
// check
static_assert(is_same<vec_t<3, ll>, vector<vector<vector<ll>>>>::value, "");
// decompose vector into basetype and dimension.
template <typename T> struct vec_dec {
static constexpr int dim = 0;
using type = T;
};
template <typename T> struct vec_dec<vector<T>> {
static constexpr int dim = vec_dec<T>::dim + 1;
using type = typename vec_dec<T>::type;
};
static_assert(is_same<typename vec_dec<vec_t<3, ll>>::type, ll>::value, "");
static_assert(vec_dec<vec_t<3, ll>>::dim == 3, "");
template <typename T = ll> vector<T> makev(size_t a) { return vector<T>(a); }
template <typename T = ll, typename... Ts> auto makev(size_t a, Ts... ts) {
return vector<decltype(makev<T>(ts...))>(a, makev<T>(ts...));
}
// ex: auto dp = makev<ll>(4,5) => vector<vector<ll>> dp(4,vector<ll>(5));
// check if T is vector
template <typename T> struct is_vector : std::false_type {};
template <typename T> struct is_vector<vector<T>> : std::true_type {};
static_assert(is_vector<vector<ll>>::value == true &&
is_vector<ll>::value == false,
"");
// check if T is vector
template <typename T> struct is_pair : std::false_type {};
template <typename T, typename S>
struct is_pair<pair<T, S>> : std::true_type {};
static_assert(is_pair<pll>::value == true && is_pair<ll>::value == false, "");
template <typename T, typename V,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
for (auto &&x : t)
fill_v(x, v);
}
// ex: fill_v(dp, INF);
template <typename T,
typename enable_if<!is_vector<T>::value && !is_pair<T>::value,
nullptr_t>::type = nullptr>
void read(T &x) {
cin >> x;
}
template <typename T,
typename enable_if<is_pair<T>::value, nullptr_t>::type = nullptr>
void read(T &x) {
read(x.first);
read(x.second);
}
template <typename T,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void read(T &x) {
rep(i, 0, x.size()) read(x[i]);
}
template <> void read(Point &p) { cin >> p.x >> p.y; }
template <typename T, typename Delim_t = string,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void write(T &x, Delim_t delim = " ") {
cout << x << delim;
}
template <typename T, typename Delim_t = string,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void write(T &x, Delim_t delim = " ") {
rep(i, 0, x.size()) write(x[i], (i == (x.size() - 1) ? "" : delim));
cout << '\n';
}
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
vll seq(ll i, ll j) {
vll res(j - i);
rep(k, i, j) res[k] = i + k;
return res;
}
constexpr ll POW_0(ll x, ll y) {
if (y == 0)
return 1;
if (y == 1)
return x;
if (y == 2)
return x * x;
if (y % 2 == 0)
return POW_0(POW_0(x, y / 2), 2LL);
return ((POW_0(POW_0(x, y / 2), 2LL)) * (x));
}
constexpr ll POW(ll x, ll y, ll mod = 0) {
if (mod == 0)
return POW_0(x, y);
if (y == 0)
return 1;
if (y == 1)
return x % mod;
if (y == 2)
return x * x % mod;
if (y % 2 == 0)
return POW(POW(x, y / 2, mod), 2LL, mod) % mod;
return ((POW(POW(x, y / 2, mod), 2LL, mod)) * (x % mod)) % mod;
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void sort_by(Inputs &inputs, Functor f) {
std::sort(std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void stable_sort_by(Inputs &inputs, Functor f) {
std::stable_sort(
std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
template <typename Inputs> void sort_uniq(Inputs &inputs) {
sort(all(inputs));
inputs.erase(unique(all(inputs)), inputs.end());
}
vector<string> split(const string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
return elems;
}
ll div_ferm(ll val, ll b, ll mod) { return (val * POW(b, mod - 2, mod)) % mod; }
// === Modint ===
// static uint_fast64_t runtime_modulus = MOD;
template <ll modulus = MOD> class modint {
public:
ll val;
constexpr modint() : val(0) {}
constexpr modint(ll x) : val((x %= mod()) < 0 ? x + mod() : x) {}
constexpr modint(ll x, ll modulus_) {
set_modulo(modulus_);
val = (x %= mod()) < 0 ? x + mod() : x;
}
template <class Ret = ll &>
static auto modulo() -> std::enable_if_t<(modulus <= 0), Ret> {
static ll runtime_modulus = numeric_limits<ll>::max();
return runtime_modulus; // singleton technique
}
template <class Ret = const ll>
static auto mod() -> std::enable_if_t<(modulus <= 0), Ret> {
return modulo();
}
template <class Ret = const ll>
static constexpr auto mod() -> std::enable_if_t<(modulus > 0), Ret> {
return modulus;
}
template <ll modulus_ = modulus,
enable_if_t<(modulus_ <= 0), nullptr_t> = nullptr>
static void set_modulo(ll mod) {
modulo() = mod;
}
void reset_modulo(ll modulus_) {
modulo() = modulus_;
val %= mod();
}
constexpr modint inv() { return pow(mod() - 2); }
constexpr ll value() const noexcept { return val; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
modint &operator+=(const modint rhs) noexcept {
val += rhs.val;
if (val >= mod()) {
val -= mod();
}
return *this;
}
modint &operator-=(const modint rhs) noexcept {
if (val < rhs.val) {
val += mod();
}
val -= rhs.val;
return *this;
}
modint &operator*=(const modint rhs) noexcept {
val = val * rhs.val % mod();
return *this;
}
modint &operator/=(modint rhs) noexcept {
ll exp = mod() - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
modint &operator++() noexcept { return *this += modint(1); }
modint &operator++(int) noexcept {
auto t = *this;
*this += modint(1);
return t;
}
modint &operator--() noexcept { return *this -= modint(1); }
modint &operator--(int) noexcept {
auto t = *this;
*this -= modint(1);
return t;
}
constexpr modint operator-() { return val ? mod() - val : val; }
constexpr bool operator==(const modint rhs) const noexcept {
return val == rhs.value();
}
constexpr bool operator!=(const modint rhs) const noexcept {
return val != rhs.value();
}
constexpr bool operator<(const modint rhs) const noexcept {
return val < rhs.value();
}
static constexpr modint zero() { return modint(0); }
static constexpr modint unit() { return modint(1); }
modint pow(long long k) const {
modint v = *this;
modint res(1), tmp(v);
while (k) {
if (k & 1)
res *= tmp;
tmp *= tmp;
k >>= 1;
}
return res;
}
ll log(modint b) {
modint val = *this;
const ll sq = 40000;
map<modint, ll> dp;
// dp.reserve(sq);
modint res(1);
for (ll r = 0; r < sq; r++) {
if (!dp.count(res))
dp[res] = r;
res *= val;
}
modint p = val.inv().pow(sq);
res = b;
for (ll q = 0; q <= mod() / sq + 1; q++) {
if (dp.count(res)) {
ll idx = q * sq + dp[res];
if (idx > 0)
return idx;
}
res *= p;
}
return INF;
}
friend ostream &operator<<(ostream &o, const modint<modulus> &t) {
o << t.value();
return o;
}
friend istream &operator>>(istream &in, modint<modulus> &t) {
ll x;
in >> x;
t = modint<modulus>(x);
return in;
}
friend modint<modulus> POW(modint<modulus> x, ll n) {
return modint<modulus>(POW(x.value(), n, mod()));
}
};
// user defined literal
modint<MOD> operator"" _mod(unsigned long long x) { return modint<MOD>(x); }
class Combination {
// this calculates combination (nCk).
// Constructor runs in O(MAX).
// get(n,k) returns nCk in O(1).
ll N_MAX, mod;
vll fac;
vll finv;
vll inv;
public:
Combination(ll mod = MOD, ll N_MAX = 210000)
: mod(mod), N_MAX(max(N_MAX, 2LL)), fac(vll(N_MAX + 1)),
finv(vll(N_MAX + 1)), inv(vll(N_MAX + 1)) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
pre_process(2LL, N_MAX + 1);
}
ll operator()(ll n, ll k) {
// choose k from n
if (N_MAX < n)
pre_process(N_MAX + 1, n + 1);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll H(ll n, ll k) {
// 1) 区間[0, k) を（空を許して）n個に分割する場合の数
// 2) n個の中からk個を重複を許して選ぶ
return (n == 0 && k == 0) ? 1 : operator()(n + k - 1, k);
}
ll P(ll n, ll k) {
// n (n-1) ... (n-k+1)
return (n < k || n < 0) ? 0 : fac[n] * finv[n - k];
}
private:
void pre_process(ll m, ll n) {
if (N_MAX < n) {
fac.resize(n);
inv.resize(n);
finv.resize(n);
}
rep(i, m, n) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
};
ll choose(int n, int r) { // O(r) for small n
ll acc = 1;
rep(i, 0, r) acc = acc * (n - i) / (i + 1);
return acc;
}
ll gcd(ll val, ll b) {
if (val % b == 0)
return b;
else
return gcd(b, val % b);
}
vll getDivisors(ll n) {
vll res;
ll i = 1;
for (; i * i < n; i++) {
if (n % i == 0) {
res.push_back(i);
res.push_back(n / i);
}
}
if (i * i == n)
res.push_back(i);
sort(res.begin(), res.end());
return res;
}
vll getDivisors(ll n, ll m) {
// O(sqrt(min(n,m)))
if (n > m)
swap(n, m);
vll res;
ll i = 1;
for (; i * i < n; i++) {
if (n % i == 0) {
if (m % i == 0)
res.push_back(i);
if (m % (n / i) == 0)
res.push_back(n / i);
}
}
if (i * i == n)
if (m % i == 0)
res.push_back(i);
sort(res.begin(), res.end());
return res;
}
vector<pll> prime_factorize(ll n) {
vector<pll> res;
for (ll p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
ll num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back({p, num});
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// ============================ Header =================================
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
ll n;
cin >> n;
vll a(n);
read(a);
vll b(n + 1);
rrep(i, 1, n + 1) {
auto divs = getDivisors(i);
b[i] ^= a[i - 1];
for (auto div : divs) {
if (div != i)
b[div] ^= b[i];
}
}
ll m = count(all(b), 1);
cout << m << endl;
vll c;
rep(i, 1, n + 1) {
if (b[i])
c.push_back(i);
}
if (m)
write(c, " ");
}
| [
"assignment.value.change"
] | 778,563 | 778,564 | u304121198 | cpp |
p02972 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
int m = 0;
for (int i = n; i > 0; i--) {
int tmp = 0;
for (int j = i; j <= n; j += i) {
tmp += a[j];
}
if (tmp % 2 != 0) {
ans[i]++;
}
}
for (int i = 1; i <= n; i++) {
if (ans[i] != 0) {
m++;
}
}
cout << m << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] != 0) {
cout << i << " ";
}
}
cout << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
int m = 0;
for (int i = n; i > 0; i--) {
int tmp = 0;
for (int j = i; j <= n; j += i) {
tmp += ans[j];
}
if (tmp % 2 != a[i]) {
ans[i]++;
}
}
for (int i = 1; i <= n; i++) {
if (ans[i] != 0) {
m++;
}
}
cout << m << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] != 0) {
cout << i << " ";
}
}
cout << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 778,576 | 778,577 | u992134985 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, t;
cin >> n;
vector<int> a(n + 1);
vector<int> k(n + 1);
vector<int> b;
for (i = 1; i < n + 1; i = i + 1) {
cin >> a.at(i);
}
for (i = n; 0 < i; i = i - 1) {
t = 0;
for (j = 2 * i; j < n + 1; j = j + i) {
if (a.at(j) == 1)
t += 1;
}
if (t % 2 != a.at(i))
k.at(i) += 1;
}
for (i = 1; i < n + 1; i = i + 1) {
if (k.at(i) == 1)
b.push_back(i);
}
cout << b.size() << endl;
for (i = 0; i < b.size(); i = i + 1) {
cout << b.at(i);
if (i < b.size() - 1)
cout << " ";
else
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, t;
cin >> n;
vector<int> a(n + 1);
vector<int> k(n + 1);
vector<int> b;
for (i = 1; i < n + 1; i = i + 1) {
cin >> a.at(i);
}
for (i = n; 0 < i; i = i - 1) {
t = 0;
for (j = 2 * i; j < n + 1; j = j + i) {
if (k.at(j) == 1)
t += 1;
}
if ((t % 2) != a.at(i))
k.at(i) += 1;
}
for (i = 1; i < n + 1; i = i + 1) {
if (k.at(i) == 1)
b.push_back(i);
}
cout << b.size() << endl;
for (i = 0; i < b.size(); i = i + 1) {
cout << b.at(i);
if (i < b.size() - 1)
cout << " ";
else
cout << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 778,580 | 778,581 | u854243627 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> ans(N + 1);
int cnt = 0;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
int tmp = 0;
for (int j = i; j <= N; j += i) {
tmp += ans[j];
tmp %= 2;
}
if (a[i] != tmp) {
ans[i] = 1;
cnt++;
}
}
cout << cnt << endl;
int cnt2 = 0;
for (int i = 1; i <= N; i++) {
if (ans[i]) {
cout << ans[i];
cnt2++;
if (cnt2 != cnt) {
cout << " ";
} else {
cout << endl;
}
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> ans(N + 1);
int cnt = 0;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
int tmp = 0;
for (int j = i; j <= N; j += i) {
tmp += ans[j];
tmp %= 2;
}
if (a[i] != tmp) {
ans[i] = 1;
cnt++;
}
}
cout << cnt << endl;
int cnt2 = 0;
for (int i = 1; i <= N; i++) {
if (ans[i]) {
cout << i;
cnt2++;
if (cnt2 != cnt) {
cout << " ";
} else {
cout << endl;
}
}
}
return 0;
} | [] | 778,584 | 778,585 | u870092796 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, end) rep2(i, 0, (end))
#define rep2(i, beg, end) for (int i = (beg); i < (end); i++)
#define all(cont) begin(cont), end(cont)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> pii;
typedef pair<ll, string> pis;
typedef pair<string, ll> psi;
string gets(bool skipnewline);
vi get_n_array(int n);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a = get_n_array(n);
vi b(n, 0);
ll cnt = 0;
for (int i = n; i >= 1; i--) {
ll s = 0;
for (int mul = 2; i * mul <= n; mul++) {
s += b[(i * mul) - 1];
}
int x;
if (s % 2 == 0) { // even
x = a[i - 1];
} else { // odd
x = 1 - a[i - 1];
}
if (x) {
b[i - 1] = x;
cnt++;
}
}
cout << cnt << endl;
if (cnt > 0) {
for (int i = 0; i < n; i++) {
if (b[i] != 0) {
cout << i + 1 + " ";
}
}
cout << endl;
}
return 0;
}
string gets(bool skipToNextline) {
if (skipToNextline)
gets(false);
const int LINE_MAX = 1024;
char buf[LINE_MAX];
cin.getline(buf, sizeof(buf));
return buf;
}
vi get_n_array(int n) {
vi v;
while (n-- > 0) {
int x;
cin >> x;
v.push_back(x);
}
return v;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, end) rep2(i, 0, (end))
#define rep2(i, beg, end) for (int i = (beg); i < (end); i++)
#define all(cont) begin(cont), end(cont)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> pii;
typedef pair<ll, string> pis;
typedef pair<string, ll> psi;
string gets(bool skipnewline);
vi get_n_array(int n);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a = get_n_array(n);
vi b(n, 0);
ll cnt = 0;
for (int i = n; i >= 1; i--) {
ll s = 0;
for (int mul = 2; i * mul <= n; mul++) {
s += b[(i * mul) - 1];
}
int x;
if (s % 2 == 0) { // even
x = a[i - 1];
} else { // odd
x = 1 - a[i - 1];
}
if (x) {
b[i - 1] = x;
cnt++;
}
}
cout << cnt << endl;
if (cnt > 0) {
for (int i = 0; i < n; i++) {
if (b[i]) {
cout << i + 1 << " ";
}
}
cout << endl;
}
return 0;
}
string gets(bool skipToNextline) {
if (skipToNextline)
gets(false);
const int LINE_MAX = 1024;
char buf[LINE_MAX];
cin.getline(buf, sizeof(buf));
return buf;
}
vi get_n_array(int n) {
vi v;
while (n-- > 0) {
int x;
cin >> x;
v.push_back(x);
}
return v;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"io.output.change"
] | 778,591 | 778,592 | u857252938 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[n], b[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
b[i] = 0;
}
for (ll i = n - 1; i >= 0; i--) {
ll temp = 0;
for (ll j = i + 1; j <= n; j += (i + 1)) {
if (b[j] == 1)
temp++;
}
if (temp % 2 == 0 && a[i] == 1)
b[i] = 1;
else if (temp % 2 == 0 && a[i] == 0)
b[i] = 0;
else if (temp % 2 == 1 && a[i] == 1)
b[i] = 0;
else if (temp % 2 == 1 && a[i] == 0)
b[i] = 1;
}
ll res = 0;
vector<ll> ans;
for (ll i = 0; i < n; i++)
if (b[i] == 1) {
res++;
ans.push_back(i + 1);
}
cout << res << endl;
for (ll i = 0; i < ans.size(); i++)
cout << ans[i] << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[n], b[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
b[i] = 0;
}
for (ll i = n - 1; i >= 0; i--) {
ll temp = 0;
for (ll j = i + 1; j <= n; j += (i + 1)) {
if (b[j - 1] == 1)
temp++;
}
if (temp % 2 == 0 && a[i] == 1)
b[i] = 1;
else if (temp % 2 == 0 && a[i] == 0)
b[i] = 0;
else if (temp % 2 == 1 && a[i] == 1)
b[i] = 0;
else if (temp % 2 == 1 && a[i] == 0)
b[i] = 1;
}
ll res = 0;
vector<ll> ans;
for (ll i = 0; i < n; i++)
if (b[i] == 1) {
res++;
ans.push_back(i + 1);
}
cout << res << endl;
for (ll i = 0; i < ans.size(); i++)
cout << ans[i] << " ";
cout << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 778,593 | 778,594 | u513726585 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define LL long long
#define MOD 1000000007
ll N, M, K, H, W, mi1, mi2, sum;
string s;
int main() {
cin >> N;
vector<LL> A(N + 1), ans(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = N; i > 0; i--) {
M = 0;
if (N / i > 1) {
for (int j = 2 * i; j <= N; j += i) {
M += A[j];
}
M = M % 2;
if (A[i] == 1) {
if (M == 1) {
ans[i] = 0;
} else {
ans[i] = 1;
}
} else {
if (M == 1) {
ans[i] = 1;
} else {
ans[i] = 0;
}
}
} else {
ans[i] = A[i];
}
}
K = 0;
for (int i = 1; i <= N; i++) {
if (ans[i] == 1)
K++;
}
cout << K << endl;
for (int i = 1; i <= N; i++) {
if (ans[i] == 1)
cout << i << " ";
}
cout << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define LL long long
#define MOD 1000000007
ll N, M, K, H, W, mi1, mi2, sum;
string s;
int main() {
cin >> N;
vector<LL> A(N + 1), ans(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = N; i > 0; i--) {
M = 0;
if (N / i > 1) {
for (int j = 2 * i; j <= N; j += i) {
M += ans[j];
}
M = M % 2;
if (A[i] == 1) {
if (M == 1) {
ans[i] = 0;
} else {
ans[i] = 1;
}
} else {
if (M == 1) {
ans[i] = 1;
} else {
ans[i] = 0;
}
}
} else {
ans[i] = A[i];
}
}
K = 0;
for (int i = 1; i <= N; i++) {
if (ans[i] == 1)
K++;
}
cout << K << endl;
for (int i = 1; i <= N; i++) {
if (ans[i] == 1)
cout << i << " ";
}
cout << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 778,622 | 778,623 | u568682546 | cpp |
p02972 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) long long((x).size())
#define OUT(x) cout << (x) << endl
typedef long long ll;
typedef vector<ll> V;
typedef vector<vector<ll>> VV;
typedef pair<ll, ll> P;
typedef map<string, ll> M;
typedef unordered_map<ll, ll> HM;
typedef set<ll> S;
typedef multiset<ll> MS;
typedef queue<ll> Q;
int main() {
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll m = 0;
ll b[n];
for (ll i = n - 1; i >= 0; i--) {
if ((i + 1) * 2 > n)
b[i] = a[i];
else {
ll cnt = 0;
for (ll j = (i + 1) * 2 - 1; j < n; j = (j + 1) + (i + 1) - 1) {
if (b[j])
cnt++;
}
b[i] = (a[i] != (ll)cnt % 2);
}
}
for (ll i = 0; i < n; i++)
if (b[i])
m++;
OUT(m);
for (ll i = 0; i < n; i++)
if (b[i])
cout << 1 << " ";
cout << endl;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) long long((x).size())
#define OUT(x) cout << (x) << endl
typedef long long ll;
typedef vector<ll> V;
typedef vector<vector<ll>> VV;
typedef pair<ll, ll> P;
typedef map<string, ll> M;
typedef unordered_map<ll, ll> HM;
typedef set<ll> S;
typedef multiset<ll> MS;
typedef queue<ll> Q;
int main() {
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll m = 0;
ll b[n];
for (ll i = n - 1; i >= 0; i--) {
if ((i + 1) * 2 > n)
b[i] = a[i];
else {
ll cnt = 0;
for (ll j = (i + 1) * 2 - 1; j < n; j = (j + 1) + (i + 1) - 1) {
if (b[j])
cnt++;
}
b[i] = (a[i] != (ll)cnt % 2);
}
}
for (ll i = 0; i < n; i++)
if (b[i])
m++;
OUT(m);
for (ll i = 0; i < n; i++)
if (b[i])
cout << i + 1 << " ";
cout << endl;
} | [
"expression.operation.binary.add"
] | 778,624 | 778,625 | u901615543 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int sum;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); ++i) {
printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' ');
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); ++i) {
printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' ');
}
}
| [
"variable_declaration.value.change"
] | 778,630 | 778,631 | u331991493 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll MOD = 1e9 + 7;
int A[200100];
int B[200100];
int main() {
int N;
cin >> N;
REP(i, N) {
int a;
cin >> a;
A[i + 1] = a;
}
int M = 0;
for (ll i = N; i >= 1; i--) {
int m = 2;
int tmp = 0;
while (i * m <= N) {
tmp += A[i * m];
m++;
}
tmp += A[i];
B[i] = tmp % 2;
if (B[i] == 1)
M++;
}
cout << M << endl;
REP(i, N) {
if (B[i + 1])
cout << i + 1 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll MOD = 1e9 + 7;
int A[200100];
int B[200100];
int main() {
int N;
cin >> N;
REP(i, N) {
int a;
cin >> a;
A[i + 1] = a;
}
int M = 0;
for (ll i = N; i >= 1; i--) {
int m = 2;
int tmp = 0;
while (i * m <= N) {
tmp += B[i * m];
m++;
}
tmp += A[i];
B[i] = tmp % 2;
if (B[i] == 1)
M++;
}
cout << M << endl;
REP(i, N) {
if (B[i + 1])
cout << i + 1 << endl;
}
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 778,632 | 778,633 | u666394517 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define int ll
const ll mod = 1000000007;
int n;
int a[200010];
int b[200010];
vector<int> ans;
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
for (int j = 1; j * i < n; j++) {
b[i] ^= b[i * j];
}
b[i] ^= a[i];
if (b[i] == 1)
ans.push_back(i);
}
cout << ans.size() << endl;
for (auto &it : ans)
cout << it << " " << endl;
}
// logのテイラー展開
// 倍数のみの処理
// XOR(bit) 最適解の構成 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define int ll
const ll mod = 1000000007;
int n;
int a[200010];
int b[200010];
vector<int> ans;
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
for (int j = 1; j * i <= n; j++) {
b[i] ^= b[i * j];
}
b[i] ^= a[i];
if (b[i] == 1)
ans.push_back(i);
}
cout << ans.size() << endl;
for (auto &it : ans)
cout << it << " " << endl;
}
// logのテイラー展開
// 倍数のみの処理
// XOR(bit) 最適解の構成 | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 778,634 | 778,635 | u263858205 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a;
vector<int> s;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
a.push_back(A);
s.push_back(0);
}
int hung = N / 2;
for (int i = N - 1; i >= hung; i--) {
if (a[i] == 0) {
s[i] = 0;
} else if (a[i] == 1) {
s[i] = 1;
}
}
for (int i = hung - 1; i >= 0; i--) {
int sum = 0;
int num = N / (i + 1);
for (int n = 1; n <= num; n++) {
sum = sum + s[i * n];
}
if (a[i] == 1) {
if (sum % 2 == 0) {
s[i] = 1;
} else if (sum % 2 == 1) {
s[i] = 0;
}
} else if (a[i] == 0) {
if (sum % 2 == 0) {
s[i] = 0;
} else if (sum % 2 == 1) {
s[i] = 1;
}
}
}
int sum = 0;
vector<int> w;
for (int i = 0; i < N; i++) {
sum = sum + s[i];
if (s[i] == 1) {
w.push_back(i + 1);
}
}
cout << sum << endl;
for (int i = 0; i < w.size(); i++) {
cout << w[i];
cout << " ";
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a;
vector<int> s;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
a.push_back(A);
s.push_back(0);
}
int hung = N / 2;
for (int i = N - 1; i >= hung; i--) {
if (a[i] == 0) {
s[i] = 0;
} else if (a[i] == 1) {
s[i] = 1;
}
}
for (int i = hung - 1; i >= 0; i--) {
int sum = 0;
int num = N / (i + 1);
for (int n = 1; n <= num; n++) {
sum = sum + s[(i + 1) * n - 1];
}
if (a[i] == 1) {
if (sum % 2 == 0) {
s[i] = 1;
} else if (sum % 2 == 1) {
s[i] = 0;
}
} else if (a[i] == 0) {
if (sum % 2 == 0) {
s[i] = 0;
} else if (sum % 2 == 1) {
s[i] = 1;
}
}
}
int sum = 0;
vector<int> w;
for (int i = 0; i < N; i++) {
sum = sum + s[i];
if (s[i] == 1) {
w.push_back(i + 1);
}
}
cout << sum << endl;
for (int i = 0; i < w.size(); i++) {
cout << w[i];
cout << " ";
}
return 0;
}
| [
"assignment.change"
] | 778,638 | 778,639 | u711816529 | cpp |
p02972 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
for (int i = 0; i < N; i++)
cin >> a[i];
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 1; j * i <= N; j++)
sum += a[j * i - 1];
b[i - 1] = (a[i - 1] + sum) % 2;
M += b[i - 1];
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (b[i] == 1)
cout << i + 1 << " ";
}
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
for (int i = 0; i < N; i++)
cin >> a[i];
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2; j * i <= N; j++)
sum += b[j * i - 1];
b[i - 1] = (a[i - 1] + sum) % 2;
M += b[i - 1];
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (b[i] == 1)
cout << i + 1 << " ";
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change"
] | 778,644 | 778,645 | u119477929 | cpp |
p02972 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
for (int i = 0; i < N; i++)
cin >> a[i];
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 1; j * i > N; j++)
sum += a[j * i - 1];
b[i - 1] = (a[i - 1] + sum) % 2;
M += b[i - 1];
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (b[i] == 1)
cout << i + 1 << " ";
}
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N, 0);
vector<int> b(N, 0);
for (int i = 0; i < N; i++)
cin >> a[i];
int M = 0;
for (int i = N; i >= 1; i--) {
int sum = 0;
for (int j = 2; j * i <= N; j++)
sum += b[j * i - 1];
b[i - 1] = (a[i - 1] + sum) % 2;
M += b[i - 1];
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (b[i] == 1)
cout << i + 1 << " ";
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 778,646 | 778,645 | u119477929 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
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 ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
rep(i, ans.size()) {
printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' ');
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
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];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
rep(i, ans.size()) {
printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' ');
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 778,647 | 778,648 | u822037230 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
bitset<N> vet, tem;
int main() {
int n;
scanf("%d", &n);
int x;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
vet[i] = x;
tem[i] = 0;
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int qtd = 0;
for (int j = i + i; j <= i; j += i) {
qtd += tem[j];
}
if (qtd % 2 != vet[i]) {
tem[i] = 1;
ans.push_back(i);
}
}
printf("%d", (int)ans.size());
for (int i = 0; i < ans.size(); i++) {
if (i)
printf(" ");
else
printf("\n");
printf("%d", ans[i]);
}
puts("");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
bitset<N> vet, tem;
int main() {
int n;
scanf("%d", &n);
int x;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
vet[i] = x;
tem[i] = 0;
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int qtd = 0;
for (int j = i + i; j <= n; j += i) {
qtd += tem[j];
}
if (qtd % 2 != vet[i]) {
tem[i] = 1;
ans.push_back(i);
}
}
printf("%d", (int)ans.size());
for (int i = 0; i < ans.size(); i++) {
if (i)
printf(" ");
else
printf("\n");
printf("%d", ans[i]);
}
puts("");
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 778,659 | 778,660 | u100131109 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
bitset<N> vet, tem;
int main() {
int n;
scanf("%d", &n);
int x;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
vet[i] = x;
tem[i] = 0;
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int qtd = 0;
for (int j = i + i; j <= i; j += i) {
qtd += tem[i];
}
if (qtd % 2 != vet[i]) {
tem[i] = 1;
ans.push_back(i);
}
}
printf("%d", (int)ans.size());
for (int i = 0; i < ans.size(); i++) {
if (i)
printf(" ");
else
printf("\n");
printf("%d", ans[i]);
}
puts("");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
bitset<N> vet, tem;
int main() {
int n;
scanf("%d", &n);
int x;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
vet[i] = x;
tem[i] = 0;
}
vector<int> ans;
for (int i = n; i > 0; i--) {
int qtd = 0;
for (int j = i + i; j <= n; j += i) {
qtd += tem[j];
}
if (qtd % 2 != vet[i]) {
tem[i] = 1;
ans.push_back(i);
}
}
printf("%d", (int)ans.size());
for (int i = 0; i < ans.size(); i++) {
if (i)
printf(" ");
else
printf("\n");
printf("%d", ans[i]);
}
puts("");
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 778,661 | 778,660 | u100131109 | cpp |
p02972 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
using namespace std;
int main() {
int M;
vector<int> B(200005, 0);
vector<bool> exist(200005, false);
vector<int> ans;
cin >> M;
rep1(i, M) {
int b;
cin >> b;
B[i] = b;
}
for (int i = M; i > 0; i--) {
int b = B[i];
int cnt = 0;
int mul = i * 2;
while (mul <= M) {
if (exist[mul])
cnt += 1;
mul += i;
}
if ((cnt % 2) != b) {
exist[b] = true;
ans.push_back(b);
}
}
int a_len = ans.size();
cout << a_len << endl;
if (a_len != 0) {
rep(i, a_len - 1) { cout << ans[i] << " "; }
cout << ans[a_len - 1] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
using namespace std;
int main() {
int M;
vector<int> B(200005, 0);
vector<bool> exist(200005, false);
vector<int> ans;
cin >> M;
rep1(i, M) {
int b;
cin >> b;
B[i] = b;
}
for (int i = M; i > 0; i--) {
int b = B[i];
int cnt = 0;
int mul = i * 2;
while (mul <= M) {
if (exist[mul])
cnt += 1;
mul += i;
}
if ((cnt % 2) != b) {
exist[i] = true;
ans.push_back(i);
}
}
int a_len = ans.size();
cout << a_len << endl;
if (a_len != 0) {
rep(i, a_len - 1) { cout << ans[i] << " "; }
cout << ans[a_len - 1] << endl;
}
return 0;
}
| [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 778,662 | 778,663 | u778614444 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
typedef long long ll;
/* --- INFの値が適切か確認する --- */
// const int INF = 1 << 30;
// const ll INF = 1LL << 60;
// const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
rep(i, N) cin >> a[i + 1];
vector<int> cnt(N + 1, 0), b(N + 1, 0);
for (int i = N; i > 0; i--) {
if (a[i] != (cnt[i] % 2)) {
b[i] = 1;
for (int j = 1; j * j <= N; j++) {
if (N % j == 0) {
cnt[j]++;
if (N / j != j)
cnt[N / j]++;
}
}
}
}
vector<int> ans;
rep(i, N) if (b[i + 1]) ans.eb(i + 1);
cout << ans.size() << endl;
rep(i, ans.size()) {
if (i != 0)
cout << ' ';
cout << ans[i];
}
if (ans.size() > 0)
cout << endl;
}
| #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
typedef long long ll;
/* --- INFの値が適切か確認する --- */
// const int INF = 1 << 30;
// const ll INF = 1LL << 60;
// const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
rep(i, N) cin >> a[i + 1];
vector<int> cnt(N + 1, 0), b(N + 1, 0);
for (int i = N; i > 0; i--) {
if (a[i] != (cnt[i] % 2)) {
b[i] = 1;
for (int j = 1; j * j <= i; j++) {
if (i % j == 0) {
cnt[j]++;
if (i / j != j)
cnt[i / j]++;
}
}
}
}
vector<int> ans;
rep(i, N) if (b[i + 1]) ans.eb(i + 1);
cout << ans.size() << endl;
rep(i, ans.size()) {
if (i != 0)
cout << ' ';
cout << ans[i];
}
if (ans.size() > 0)
cout << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 778,664 | 778,665 | u267022560 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M = 0;
cin >> N;
vector<int> a(N + 1), b(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
for (int j = 2; j * i <= N; j++) {
b[i] += b[j];
}
if (b[i] % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
M += b[i];
}
cout << M << endl;
for (int i = 1; i <= N; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M = 0;
cin >> N;
vector<int> a(N + 1), b(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
for (int j = 2; j * i <= N; j++) {
b[i] += b[i * j];
}
if (b[i] % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
M += b[i];
}
cout << M << endl;
for (int i = 1; i <= N; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
} | [
"assignment.change"
] | 778,666 | 778,667 | u656368720 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M = 0;
cin >> N;
vector<int> a(N + 1), b(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
for (int j = 2; j * i <= N; j++) {
b[i] += a[j];
}
if (b[i] % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
M += b[i];
}
cout << M << endl;
for (int i = 1; i <= N; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M = 0;
cin >> N;
vector<int> a(N + 1), b(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
for (int j = 2; j * i <= N; j++) {
b[i] += b[i * j];
}
if (b[i] % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
M += b[i];
}
cout << M << endl;
for (int i = 1; i <= N; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
} | [
"assignment.value.change",
"identifier.change",
"assignment.change"
] | 778,668 | 778,667 | u656368720 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp, long long mod = MOD) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * base % mod;
base = base * base % mod;
}
return tot;
}
long long slow_mult(long long base, long long exp, long long mod = MOD) {
long long tot = 0;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = (tot + base) % mod;
base = base * 2 % mod;
}
return tot;
}
int arr[200005], out[200005];
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, ree = 0;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> arr[i];
for (int i = n; i; --i) {
int tot = 0;
for (int j = i; j <= n; j += i)
tot += out[i] % 2;
if (tot % 2 != arr[i])
out[i] = ++ree ? 1 : 0;
}
cout << ree << "\n";
for (int i = 1; i <= n; ++i)
if (out[i])
cout << i << " ";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp, long long mod = MOD) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * base % mod;
base = base * base % mod;
}
return tot;
}
long long slow_mult(long long base, long long exp, long long mod = MOD) {
long long tot = 0;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = (tot + base) % mod;
base = base * 2 % mod;
}
return tot;
}
int arr[200005], out[200005];
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, ree = 0;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> arr[i];
for (int i = n; i; --i) {
int tot = 0;
for (int j = i; j <= n; j += i)
tot += out[j] % 2;
if (tot % 2 != arr[i])
out[i] = ++ree ? 1 : 0;
}
cout << ree << "\n";
for (int i = 1; i <= n; ++i)
if (out[i])
cout << i << " ";
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 778,672 | 778,673 | u276568758 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
#define INF 1e9 + 1
#define PI 3.1415926535897932846
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<pii, pii> piiii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<piii> viii;
typedef vector<piiii> viiii;
typedef vector<pll> vll;
typedef vector<pld> vld;
const int MAXN = 200100;
const ll MOD = 1e9 + 7;
int n;
int a[MAXN];
int placed[MAXN];
int main() {
FAST_IO;
cin >> n;
FOR(i, 1, n) cin >> a[i];
// bool ok = true;
vi pos;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i)
sum += placed[j];
if (sum % 2 != a[i] % 2) {
placed[i] = 1;
// pos.pb(i);
}
}
FOR(i, 1, n) if (placed[i]) pos.pb(i);
cout << pos.size() << "\n";
for (int i : placed)
cout << i << " ";
cout << "";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
#define INF 1e9 + 1
#define PI 3.1415926535897932846
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<pii, pii> piiii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<piii> viii;
typedef vector<piiii> viiii;
typedef vector<pll> vll;
typedef vector<pld> vld;
const int MAXN = 200100;
const ll MOD = 1e9 + 7;
int n;
int a[MAXN];
int placed[MAXN];
int main() {
FAST_IO;
cin >> n;
FOR(i, 1, n) cin >> a[i];
// bool ok = true;
vi pos;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i)
sum += placed[j];
if (sum % 2 != a[i] % 2) {
placed[i] = 1;
// pos.pb(i);
}
}
FOR(i, 1, n) if (placed[i]) pos.pb(i);
cout << pos.size() << "\n";
for (int i : pos)
cout << i << " ";
cout << "";
return 0;
}
| [
"identifier.change"
] | 778,676 | 778,677 | u157886944 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
#define INF 1e9 + 1
#define PI 3.1415926535897932846
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<pii, pii> piiii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<piii> viii;
typedef vector<piiii> viiii;
typedef vector<pll> vll;
typedef vector<pld> vld;
const int MAXN = 100100;
const ll MOD = 1e9 + 7;
int n;
int a[MAXN];
int placed[MAXN];
int main() {
FAST_IO;
cin >> n;
FOR(i, 1, n) cin >> a[i];
// bool ok = true;
vi pos;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i)
sum += placed[j];
if (sum % 2 != a[i] % 2) {
placed[i] = 1;
// pos.pb(i);
}
}
FOR(i, 1, n) if (placed[i]) pos.pb(i);
cout << pos.size() << "\n";
for (int i : placed)
cout << i << " ";
cout << "";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
#define INF 1e9 + 1
#define PI 3.1415926535897932846
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<pii, pii> piiii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<piii> viii;
typedef vector<piiii> viiii;
typedef vector<pll> vll;
typedef vector<pld> vld;
const int MAXN = 200100;
const ll MOD = 1e9 + 7;
int n;
int a[MAXN];
int placed[MAXN];
int main() {
FAST_IO;
cin >> n;
FOR(i, 1, n) cin >> a[i];
// bool ok = true;
vi pos;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i)
sum += placed[j];
if (sum % 2 != a[i] % 2) {
placed[i] = 1;
// pos.pb(i);
}
}
FOR(i, 1, n) if (placed[i]) pos.pb(i);
cout << pos.size() << "\n";
for (int i : pos)
cout << i << " ";
cout << "";
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change"
] | 778,678 | 778,677 | u157886944 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 212345;
int a[MAXN], b[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
for (int i = n; i > 0; --i) {
int sum = 0;
for (int j = i + i; j <= n; j += i)
sum += a[i];
if (sum % 2 != a[i])
b[i] = 1;
}
vector<int> v;
for (int i = 1; i <= n; ++i) {
if (b[i] == 1) {
v.emplace_back(i);
}
}
printf("%d\n", (int)v.size());
for (int i : v) {
printf("%d ", i);
}
if ((int)v.size())
puts("");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MAXN = 212345;
int a[MAXN], b[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
for (int i = n; i > 0; --i) {
int sum = 0;
for (int j = i + i; j <= n; j += i)
sum += b[j];
if (sum % 2 != a[i])
b[i] = 1;
}
vector<int> v;
for (int i = 1; i <= n; ++i) {
if (b[i] == 1) {
v.emplace_back(i);
}
}
printf("%d\n", (int)v.size());
for (int i : v) {
printf("%d ", i);
}
if ((int)v.size())
puts("");
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,679 | 778,680 | u578509549 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, -1);
int k, sum;
for (int i = n - 1; i >= 0; i--) {
k = n / (i + 1);
if (k == 1)
b[i] = a[i];
else {
sum = 0;
for (int j = 1; j < k; j++) {
sum += b[i + (i + 1) * j];
}
sum += a[i];
b[i] = sum % 2;
}
}
// rep(i,n)cout<<b[i]<<",";cout<<endl;
int cnt = 0;
rep(i, n) {
if (b[i] == 1)
cnt++;
}
cout << cnt << endl;
rep(i, n) {
if (b[i] == 1) {
cout << i << " ";
}
}
if (cnt != 0)
cout << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, -1);
int k, sum;
for (int i = n - 1; i >= 0; i--) {
k = n / (i + 1);
if (k == 1)
b[i] = a[i];
else {
sum = 0;
for (int j = 1; j < k; j++) {
sum += b[i + (i + 1) * j];
}
sum += a[i];
b[i] = sum % 2;
}
}
// rep(i,n)cout<<b[i]<<",";cout<<endl;
int cnt = 0;
rep(i, n) {
if (b[i] == 1)
cnt++;
}
cout << cnt << endl;
rep(i, n) {
if (b[i] == 1) {
cout << i + 1 << " ";
}
}
if (cnt != 0)
cout << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 778,681 | 778,682 | u732502311 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, -1);
int k, sum;
for (int i = n - 1; i >= 0; i--) {
k = n / (i + 1);
if (k == 1)
b[i] = a[i];
else {
sum = 0;
for (int j = 1; j < k; j++) {
sum += b[i + (i + 1) * j];
}
sum += a[i];
b[i] = sum % 2;
}
}
int cnt = 0;
rep(i, n) {
if (b[i] == 1)
cnt++;
}
cout << cnt << endl;
rep(i, n) {
if (b[i] == 1) {
cout << b[i] << " ";
}
}
if (cnt != 0)
cout << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, -1);
int k, sum;
for (int i = n - 1; i >= 0; i--) {
k = n / (i + 1);
if (k == 1)
b[i] = a[i];
else {
sum = 0;
for (int j = 1; j < k; j++) {
sum += b[i + (i + 1) * j];
}
sum += a[i];
b[i] = sum % 2;
}
}
// rep(i,n)cout<<b[i]<<",";cout<<endl;
int cnt = 0;
rep(i, n) {
if (b[i] == 1)
cnt++;
}
cout << cnt << endl;
rep(i, n) {
if (b[i] == 1) {
cout << i + 1 << " ";
}
}
if (cnt != 0)
cout << endl;
return 0;
} | [
"io.output.change"
] | 778,683 | 778,682 | u732502311 | cpp |
p02972 | #include <iostream>
#include <vector>
#define range(i, n) for (i = 0; i < n; ++i)
using namespace std;
int i, j;
int main(void) {
int N, bin, num = 0;
cin >> N;
vector<int> A(N), result(N);
range(i, N) { cin >> A[i]; }
for (i = N - 1; i >= 0; --i) {
bin = 0;
for (j = 2 * i + 1; j < N; j += i + 1) {
bin += A[j];
}
if (A[i] != bin % 2) {
result[i] = 1;
num += 1;
} else {
result[i] = 0;
}
}
cout << num << endl;
range(i, N) {
if (result[i] == 1) {
num -= 1;
cout << i + 1;
if (num != 0) {
cout << " ";
}
}
}
cout << endl;
return 0;
}
| #include <iostream>
#include <vector>
#define range(i, n) for (i = 0; i < n; ++i)
using namespace std;
int i, j;
int main(void) {
int N, bin, num = 0;
cin >> N;
vector<int> A(N), result(N);
range(i, N) { cin >> A[i]; }
for (i = N - 1; i >= 0; --i) {
bin = 0;
for (j = 2 * i + 1; j < N; j += i + 1) {
bin += result[j];
}
if (A[i] != bin % 2) {
result[i] = 1;
num += 1;
} else {
result[i] = 0;
}
}
cout << num << endl;
range(i, N) {
if (result[i] == 1) {
num -= 1;
cout << i + 1;
if (num != 0) {
cout << " ";
}
}
}
cout << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 778,686 | 778,687 | u517447467 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pu push
#define pp pop_back
#define in insert
#define ld long double
#define endl '\n'
#define debug cout << "Hold right there sparky.....\n";
#define forn(low, high, i) for (i = low; i < high; i++)
#define forrev(high, low, i) for (i = high; i >= low; i--)
#define trace(x) cerr << #x << ": " << x << " " << endl;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const ll mod = 1e9 + 7;
const ll maxn = 100000;
int main() {
IOS ll n;
cin >> n;
ll a[n + 1], b[n + 1];
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
memset(b, 0, sizeof(b));
for (ll i = n; i >= 1; i--) {
ll count = 0;
for (ll j = 2 * i; j <= n; j += i) {
count += b[i];
}
if ((count % 2) == a[i]) {
b[i] = 0;
} else
b[i] = 1;
}
ll m = 0;
for (ll i = 1; i <= n; i++)
if (b[i] == 1)
m++;
cout << m << endl;
for (ll i = 1; i <= n; i++)
if (b[i] == 1)
cout << i << " ";
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pu push
#define pp pop_back
#define in insert
#define ld long double
#define endl '\n'
#define debug cout << "Hold right there sparky.....\n";
#define forn(low, high, i) for (i = low; i < high; i++)
#define forrev(high, low, i) for (i = high; i >= low; i--)
#define trace(x) cerr << #x << ": " << x << " " << endl;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const ll mod = 1e9 + 7;
const ll maxn = 100000;
int main() {
IOS ll n;
cin >> n;
ll a[n + 1], b[n + 1];
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
memset(b, 0, sizeof(b));
for (ll i = n; i >= 1; i--) {
ll count = 0;
for (ll j = 2 * i; j <= n; j += i) {
count += b[j];
}
if ((count % 2) == a[i]) {
b[i] = 0;
} else
b[i] = 1;
}
ll m = 0;
for (ll i = 1; i <= n; i++)
if (b[i] == 1)
m++;
cout << m << endl;
for (ll i = 1; i <= n; i++)
if (b[i] == 1)
cout << i << " ";
cout << endl;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 778,695 | 778,696 | u859541564 | cpp |
p02972 | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
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;
vector<int> ans;
for (int i = N; i >= 1; i--) {
// ballの個数を数える
int ball = 0;
int now = 2 * i;
while (now <= N) {
ball += b[now];
now += i;
}
//偶奇が違ったら追加
if (ball % 2 != a[i]) {
b[i] = 1;
cnt++;
ans.push_back(i);
}
}
cout << cnt << endl;
for (int i = 0; i < b.size(); i++)
cout << ans[i] << " ";
}
| #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
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;
vector<int> ans;
for (int i = N; i >= 1; i--) {
// ballの個数を数える
int ball = 0;
int now = 2 * i;
while (now <= N) {
ball += b[now];
now += i;
}
//偶奇が違ったら追加
if (ball % 2 != a[i]) {
b[i] = 1;
cnt++;
ans.push_back(i);
}
}
cout << cnt << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << " ";
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 778,697 | 778,698 | u230414490 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.