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 <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
constexpr int kMod = 1000000007;
typedef long long LL;
int main() {
int N;
std::cin >> N;
std::vector<int> a(N + 1), b(N + 1);
for (int i = 1; i <= N; ++i) {
std::cin >> a[i];
}
int cnt = 0;
for (int i = N; i > 0; --i) {
int x = 0;
for (int j = 2; i * j <= N; ++j) {
x += b[j];
}
if (x % 2 != a[i])
b[i] = 1;
else
b[i] = 0;
if (b[i] > 0)
++cnt;
}
if (cnt == 0) {
std::cout << 0 << std::endl;
return 0;
}
std::cout << cnt << std::endl;
for (int i = 1; i <= N; ++i) {
if (b[i] > 0)
std::cout << i << " ";
}
std::cout << std::endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
constexpr int kMod = 1000000007;
typedef long long LL;
int main() {
int N;
std::cin >> N;
std::vector<int> a(N + 1), b(N + 1);
for (int i = 1; i <= N; ++i) {
std::cin >> a[i];
}
int cnt = 0;
for (int i = N; i > 0; --i) {
int x = 0;
for (int j = 2; i * j <= N; ++j) {
x += b[i * j];
}
if (x % 2 != a[i]) {
b[i] = 1;
} else {
b[i] = 0;
}
if (b[i] > 0)
++cnt;
}
if (cnt == 0) {
std::cout << 0 << std::endl;
return 0;
}
std::cout << cnt << std::endl;
for (int i = 1; i <= N; ++i) {
if (b[i] > 0)
std::cout << i << " ";
}
std::cout << std::endl;
}
| [
"assignment.change"
] | 777,530 | 777,531 | u116523315 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
vector<int> ball(200005, 0);
void putball(int n) {
for (int i = 1; i < sqrt(n) + 1; i++) {
if (n % i == 0) {
ball.at(i)++;
if (i != n / i)
ball.at(n / i)++;
}
}
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
int ballcount = 0;
vector<int> b;
rep(i, n) {
int j = n - i;
if ((ball.at(j) % 2) != a.at(j - 1)) {
putball(j);
b.push_back(j);
ballcount++;
}
}
if ((ball.at(1) % 2) == a.at(0)) {
cout << ballcount << endl;
rep(i, b.size()) cout << b.at(i) << " ";
} else {
cout << "-1";
}
} | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
vector<int> ball(200005, 0);
void putball(int n) {
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
ball.at(i)++;
if (i != n / i)
ball.at(n / i)++;
// cout << "putball " << i << endl;
}
}
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
int ballcount = 0;
vector<int> b;
rep(i, n) {
int j = n - i;
if ((ball.at(j) % 2) != a.at(j - 1)) {
putball(j);
b.push_back(j);
ballcount++;
// cout << "putball " << j << endl;
}
}
if ((ball.at(1) % 2) == a.at(0)) {
cout << ballcount << endl;
rep(i, b.size()) cout << b.at(i) << " ";
} else {
cout << "-1";
}
// cout << "hoge";
// rep(i,n) cout << ball.at(i+1) << " ";
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 777,534 | 777,535 | u748819456 | cpp |
p02972 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> arr(n + 1);
for (ll i = 1; i <= n; i++)
cin >> arr[i];
vector<ll> ans(n + 1);
for (ll i = n; i; i--) {
ll sum = 0;
for (ll j = 2 * i; j <= n; j++)
if (ans[j])
sum++;
if (arr[i] % 2 != sum % 2)
ans[i] = 1;
}
vector<ll> fin;
for (ll i = 1; i <= n; i++)
if (ans[i])
fin.push_back(i);
cout << fin.size() << endl;
for (auto i : fin)
cout << i << " ";
cout << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> arr(n + 1);
for (ll i = 1; i <= n; i++)
cin >> arr[i];
vector<ll> ans(n + 1);
for (ll i = n; i; i--) {
ll sum = 0;
for (ll j = 2 * i; j <= n; j += i)
if (ans[j])
sum++;
if (arr[i] % 2 != sum % 2)
ans[i] = 1;
}
vector<ll> fin;
for (ll i = 1; i <= n; i++)
if (ans[i])
fin.push_back(i);
cout << fin.size() << endl;
for (auto i : fin)
cout << i << " ";
cout << endl;
return 0;
} | [] | 777,538 | 777,539 | u897552198 | cpp |
p02972 | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
int main() {
int N, i, j;
scanf("%d", &N);
int a[N + 1], ans[N + 1], sum;
for (i = 1; i <= N; i++)
scanf("%d", &a[i]);
for (i = N; i >= 1; i--) {
sum = 0;
for (j = i + i; j <= N; j++)
sum += ans[j];
ans[i] = sum ^ a[i];
}
printf("%d\n", accumulate(ans + 1, ans + N + 1, 0));
for (i = 1; i <= N; i++) {
if (ans[i])
printf("%d ", i);
}
printf("\n");
} | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
int main() {
int N, i, j;
scanf("%d", &N);
int a[N + 1], ans[N + 1], sum;
for (i = 1; i <= N; i++)
scanf("%d", &a[i]);
for (i = N; i >= 1; i--) {
sum = 0;
for (j = i + i; j <= N; j += i)
sum ^= ans[j];
ans[i] = sum ^ a[i];
}
printf("%d\n", accumulate(ans + 1, ans + N + 1, 0));
for (i = 1; i <= N; i++) {
if (ans[i])
printf("%d ", i);
}
printf("\n");
}
| [
"expression.operator.change"
] | 777,544 | 777,543 | u881116515 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(i, n) (i), (i + n)
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, -1, 0, 1};
int dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
int dx9[9] = {0, 1, 0, -1, 1, -1, 1, 0, -1};
int dy9[9] = {0, 1, 1, 1, 0, 0, -1, -1, -1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6 + 1;
const ll mod = 1000000007;
// << fixed << setprecision
// --------------------------------------
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vector<int> a(n + 1);
REP(i, n) cin >> a[i + 1];
vector<int> t(n + 1, 0);
vector<int> ans;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i) {
sum += t[j];
}
sum %= 2;
if (a[i] ^ sum) {
ans.push_back(i);
a[i] = 1;
}
}
cout << ans.size() << endl;
REP(i, ans.size()) cout << ans[i] << " ";
cout << endl;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(i, n) (i), (i + n)
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, -1, 0, 1};
int dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
int dx9[9] = {0, 1, 0, -1, 1, -1, 1, 0, -1};
int dy9[9] = {0, 1, 1, 1, 0, 0, -1, -1, -1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6 + 1;
const ll mod = 1000000007;
// << fixed << setprecision
// --------------------------------------
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vector<int> a(n + 1);
REP(i, n) cin >> a[i + 1];
vector<int> t(n + 1, 0);
vector<int> ans;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i) {
sum += t[j];
}
sum %= 2;
if (a[i] ^ sum) {
ans.push_back(i);
t[i] = 1;
}
}
cout << ans.size() << endl;
REP(i, ans.size()) cout << ans[i] << " ";
cout << endl;
}
| [
"assignment.variable.change",
"identifier.change"
] | 777,545 | 777,546 | u502772848 | 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];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i >= 1; i--) {
int cnt = 2;
int sum = 0;
while (i * cnt <= n) {
sum += ans[i * cnt];
cnt++;
}
if (sum % 2 == a[i])
a[i] = 0;
else {
a[i] = 1;
total++;
}
}
cout << total << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] == 0)
continue;
cout << i << endl;
}
} | #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];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i >= 1; i--) {
int cnt = 2;
int sum = 0;
while (i * cnt <= n) {
sum += ans[i * cnt];
cnt++;
}
if (sum % 2 == a[i])
a[i] = 0;
else {
ans[i] = 1;
total++;
}
}
cout << total << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] == 0)
continue;
cout << i << endl;
}
} | [
"assignment.variable.change",
"identifier.change"
] | 777,549 | 777,550 | u948698924 | 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];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i >= 1; i--) {
int cnt = 2;
int sum = 0;
while (i * cnt <= n) {
sum += ans[i * cnt];
cnt++;
}
if (sum % 2 == a[i])
a[i] = 0;
else {
a[i] = 1;
total++;
}
}
cout << total << endl;
for (int i = 1; i <= n; i++) {
if (a[i] == 0)
continue;
cout << i << endl;
}
} | #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];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i >= 1; i--) {
int cnt = 2;
int sum = 0;
while (i * cnt <= n) {
sum += ans[i * cnt];
cnt++;
}
if (sum % 2 == a[i])
a[i] = 0;
else {
ans[i] = 1;
total++;
}
}
cout << total << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] == 0)
continue;
cout << i << endl;
}
} | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,551 | 777,550 | u948698924 | 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];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i >= 1; i--) {
int cnt = 2;
int sum = 0;
while (i * cnt <= n) {
sum += ans[i * cnt];
cnt++;
}
if (sum % 2 == a[i])
a[i] = 0;
else {
a[i] = 1;
total++;
}
}
cout << total << endl;
for (int i = 1; i <= n; i++) {
if (a[i] == 0)
continue;
cout << a[i] << endl;
}
} | #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];
int total = 0;
vector<int> ans(n + 1);
for (int i = n / 2 + 1; i <= n; i++) {
ans[i] = a[i];
if (ans[i] == 1)
total++;
}
for (int i = n / 2; i >= 1; i--) {
int cnt = 2;
int sum = 0;
while (i * cnt <= n) {
sum += ans[i * cnt];
cnt++;
}
if (sum % 2 == a[i])
a[i] = 0;
else {
ans[i] = 1;
total++;
}
}
cout << total << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] == 0)
continue;
cout << i << endl;
}
} | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,552 | 777,550 | u948698924 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll ch[200010], ans[200010];
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
ll now;
cin >> now;
ch[i] = now;
}
ll ANS = 0;
for (ll i = n; i >= 1; i--) {
ll cnt = 0;
ll now = 1;
while (now * i <= n) {
cnt += ans[i * now];
now++;
}
if (cnt % 2 != ch[i]) {
ans[i] = 1;
ANS++;
}
}
cout << ANS << endl;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
cout << ans[i] << endl;
}
}
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll ch[200010], ans[200010];
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
ll now;
cin >> now;
ch[i] = now;
}
ll ANS = 0;
for (ll i = n; i >= 1; i--) {
ll cnt = 0;
ll now = 1;
while (now * i <= n) {
cnt += ans[i * now];
now++;
}
if (cnt % 2 != ch[i]) {
ans[i] = 1;
ANS++;
}
}
cout << ANS << endl;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
cout << i << endl;
}
}
// your code goes here
return 0;
} | [] | 777,557 | 777,558 | u166378830 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll ch[200010], ans[200010];
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
ll now;
cin >> now;
ch[i] = now;
}
ll ANS = 0;
for (ll i = n; i >= 1; i--) {
ll cnt = 0;
ll now = 1;
while (now <= n) {
cnt += ans[i * now];
now++;
}
if (cnt % 2 != ch[i]) {
ans[i] = 1;
ANS++;
}
}
cout << ANS << endl;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
cout << ans[i] << endl;
}
}
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll ch[200010], ans[200010];
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
ll now;
cin >> now;
ch[i] = now;
}
ll ANS = 0;
for (ll i = n; i >= 1; i--) {
ll cnt = 0;
ll now = 1;
while (now * i <= n) {
cnt += ans[i * now];
now++;
}
if (cnt % 2 != ch[i]) {
ans[i] = 1;
ANS++;
}
}
cout << ANS << endl;
for (ll i = 1; i <= n; i++) {
if (ans[i]) {
cout << i << endl;
}
}
// your code goes here
return 0;
} | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 777,559 | 777,558 | u166378830 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[200010], b[200010];
int main() {
ll n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = n; i >= 1; i--) {
ll sum = 0;
for (int j = 2; j * i < n; j++) {
ll now = j * i;
sum += b[now];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[200010], b[200010];
int main() {
ll n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = n; i >= 1; i--) {
ll sum = 0;
for (int j = 2; j * i <= n; j++) {
ll now = j * i;
sum += b[now];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
// your code goes here
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,560 | 777,561 | u166378830 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a.at(i + 1);
vector<int> b(n + 1, 0);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += b.at(j);
}
if (a.at(i) == 1) {
if (sum % 2 == 1) {
b.at(i) = 0;
} else {
b.at(i) = 1;
}
} else {
if (sum % 2 == 1) {
b.at(i) = 1;
} else {
b.at(i) = 0;
}
}
}
vector<int> res;
for (int i = 1; i <= n; i++) {
if (b.at(i) == 1) {
res.push_back(a.at(i));
}
}
cout << res.size() << endl;
rep(i, res.size()) {
if (i != 0) {
cout << " ";
}
cout << res.at(i);
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a.at(i + 1);
vector<int> b(n + 1, 0);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += b.at(j);
}
if (a.at(i) == 1) {
if (sum % 2 == 1) {
b.at(i) = 0;
} else {
b.at(i) = 1;
}
} else {
if (sum % 2 == 1) {
b.at(i) = 1;
} else {
b.at(i) = 0;
}
}
}
vector<int> res;
for (int i = 1; i <= n; i++) {
if (b.at(i) == 1) {
res.push_back(i);
}
}
cout << res.size() << endl;
rep(i, res.size()) {
if (i != 0) {
cout << " ";
}
cout << res.at(i);
}
cout << endl;
return 0;
}
| [
"call.remove",
"call.arguments.change"
] | 777,566 | 777,567 | u011438316 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int NMAX = 2e5 + 5;
int n, a[NMAX], b[NMAX], nr;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
b[n] = a[n] % 2;
nr = b[n];
for (int i = n - 1; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i] % 2) {
b[i] = 1;
}
nr += b[i];
}
cout << nr << '\n';
for (int i = 1; i <= n; i++) {
if (a[i] == 1) {
cout << i << ' ';
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int NMAX = 2e5 + 5;
int n, a[NMAX], b[NMAX], nr;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
b[n] = a[n] % 2;
nr = b[n];
for (int i = n - 1; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i] % 2) {
b[i] = 1;
}
nr += b[i];
}
cout << nr << '\n';
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
cout << i << ' ';
}
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,572 | 777,573 | u644497121 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int n = 0; n < N; ++n) {
cin >> A[n + 1];
}
vector<int> B(N + 1);
for (int n = N; n >= 1; --n) {
int sum = 0;
for (int m = n + n; m <= N; m += n) {
sum += B[n];
}
if (A[n] == sum % 2) {
B[n] = 0;
} else {
B[n] = 1;
}
}
vector<int> Ans;
for (int n = 0; n < N; ++n) {
if (0 != B[n + 1]) {
Ans.push_back(n + 1);
}
}
cout << Ans.size() << endl;
for (int n = 0; n < Ans.size(); ++n) {
if (0 != n) {
cout << " ";
}
cout << Ans[n];
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int n = 0; n < N; ++n) {
cin >> A[n + 1];
}
vector<int> B(N + 1);
for (int n = N; n >= 1; --n) {
int sum = 0;
for (int m = n + n; m <= N; m += n) {
sum += B[m];
}
if (A[n] == sum % 2) {
B[n] = 0;
} else {
B[n] = 1;
}
}
vector<int> Ans;
for (int n = 0; n < N; ++n) {
if (0 != B[n + 1]) {
Ans.push_back(n + 1);
}
}
cout << Ans.size() << endl;
for (int n = 0; n < Ans.size(); ++n) {
if (0 != n) {
cout << " ";
}
cout << Ans[n];
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,574 | 777,575 | u835523614 | cpp |
p02972 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int p[1000001];
int mod = 100000007;
int main() {
int n;
cin >> n;
int a[n + 1] = {};
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
int b[n + 1] = {};
int tmp = 0;
int res = 0;
for (int i = n; i > 0; i--) {
tmp = 0;
for (int j = 2; j <= n; j++) {
if (i * j <= n && b[i * j] == 1) {
tmp++;
} else {
break;
}
}
if ((a[i] == 0 && tmp % 2 == 1) || (a[i] == 1 && tmp % 2 == 0)) {
b[i] = 1;
// cout << a[i] << tmp<< << endl;
res++;
}
}
cout << res << endl;
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int p[1000001];
int mod = 100000007;
int main() {
int n;
cin >> n;
int a[n + 1] = {};
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
int b[n + 1] = {};
int tmp = 0;
int res = 0;
for (int i = n; i > 0; i--) {
tmp = 0;
for (int j = 2; j <= n; j++) {
if (i * j <= n) {
if (b[i * j] == 1) {
tmp++;
}
} else {
break;
}
}
if ((a[i] == 0 && tmp % 2 == 1) || (a[i] == 1 && tmp % 2 == 0)) {
b[i] = 1;
// cout << a[i] << tmp<< << endl;
res++;
}
}
cout << res << endl;
for (int i = 1; i < n + 1; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
} | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 777,576 | 777,577 | u891945807 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (i) <= (n); i++)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll INF = 1e+18;
int iINF = 1e9;
int MAXI = 1e8 + 1;
using vec = vector<int>;
int main() {
int N;
cin >> N;
vec arr(N + 1);
repe(i, 1, N) cin >> arr[i];
vec ball(N + 1, 0);
int num = 0;
for (int i = N; i >= 1; --i) {
int val = i;
int cnt = 0;
while (true) {
val *= 2;
if (val > N)
break;
if (ball[val] == 1)
++cnt;
}
if (arr[i] != (cnt % 2))
ball[i] = 1, ++num;
}
cout << num << endl;
rep(i, 1, N + 1) {
if (ball[i] == 1)
cout << i << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (i) <= (n); i++)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll INF = 1e+18;
int iINF = 1e9;
int MAXI = 1e8 + 1;
using vec = vector<int>;
int main() {
int N;
cin >> N;
vec arr(N + 1);
repe(i, 1, N) cin >> arr[i];
vec ball(N + 1, 0);
int num = 0;
for (int i = N; i >= 1; --i) {
int val = i;
int cnt = 0;
while (true) {
val += i;
if (val > N)
break;
if (ball[val] == 1)
++cnt;
}
if (arr[i] != (cnt % 2))
ball[i] = 1, ++num;
}
cout << num << endl;
rep(i, 1, N + 1) {
if (ball[i] == 1)
cout << i << " ";
}
}
| [
"assignment.change",
"io.output.change"
] | 777,578 | 777,579 | u873269440 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100;
int a[N], b[N];
vector<int> ve;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
if ((b[i] & 1) ^ a[i]) {
ve.push_back(i);
for (int j = 1; j * j <= n; j++) {
if (i % j == 0) {
if (j * j == n)
b[i]++;
else
b[i]++, b[i / j]++;
}
}
}
}
cout << ve.size() << endl;
for (auto v : ve) {
cout << v << " ";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100;
int a[N], b[N];
vector<int> ve;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
if ((b[i] & 1) ^ a[i]) {
ve.push_back(i);
for (int j = 1; j * j <= i; j++) {
if (i % j == 0) {
if (j * j == i)
b[j]++;
else
b[j]++, b[i / j]++;
}
}
}
}
cout << ve.size() << endl;
for (auto v : ve) {
cout << v << " ";
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 777,580 | 777,581 | u722928342 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100;
int a[N], b[N];
vector<int> ve;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
if ((b[i] & 1) ^ a[i]) {
ve.push_back(i);
for (int j = 1; j * j <= n; j++) {
if (i % j == 0) {
if (j * j == n)
b[i]++;
else
b[i]++, b[i % j]++;
}
}
}
}
cout << ve.size() << endl;
for (auto v : ve) {
cout << v << " ";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100;
int a[N], b[N];
vector<int> ve;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
if ((b[i] & 1) ^ a[i]) {
ve.push_back(i);
for (int j = 1; j * j <= i; j++) {
if (i % j == 0) {
if (j * j == i)
b[j]++;
else
b[j]++, b[i / j]++;
}
}
}
}
cout << ve.size() << endl;
for (auto v : ve) {
cout << v << " ";
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"expression.operator.arithmetic.change"
] | 777,582 | 777,581 | u722928342 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define printVec(v) \
printf("{"); \
for (const auto &i : v) { \
std::cout << i << ", "; \
} \
printf("}\n");
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using P = pair<int, int>;
using ll = long long;
const ll INF = 1LL << 60;
const double PI = 3.1415926535897932;
const int MOD = 1e9 + 7;
// cin.tie(0);ios::sync_with_stdio(false);
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> ball(n + 1);
for (int i = n; i >= 1; i--) {
// printf("i = %d\n", i);
int tmp = i;
int cnt = 0;
while (tmp * 2 <= n) {
cnt += ball[tmp * 2];
tmp *= 2;
}
if (a[i] == 0 && cnt % 2 != 0) {
ball[i] = 1;
} else if (a[i] == 1 && cnt % 2 != 1) {
ball[i] = 1;
}
}
ll sum = accumulate(a.begin(), a.end(), 0);
if (sum == 0) {
cout << 0 << endl;
return 0;
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (ball[i] == 1) {
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (auto v : ans)
cout << v << " ";
if (ans.size() != 0)
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define printVec(v) \
printf("{"); \
for (const auto &i : v) { \
std::cout << i << ", "; \
} \
printf("}\n");
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using P = pair<int, int>;
using ll = long long;
const ll INF = 1LL << 60;
const double PI = 3.1415926535897932;
const int MOD = 1e9 + 7;
// cin.tie(0);ios::sync_with_stdio(false);
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> ball(n + 1);
for (int i = n; i >= 1; i--) {
// printf("i = %d\n", i);
int tmp = i;
int cnt = 0;
while (tmp + i <= n) {
cnt += ball[tmp + i];
tmp += i;
}
if (a[i] == 0 && cnt % 2 != 0) {
ball[i] = 1;
} else if (a[i] == 1 && cnt % 2 != 1) {
ball[i] = 1;
}
}
ll sum = accumulate(a.begin(), a.end(), 0);
if (sum == 0) {
cout << 0 << endl;
return 0;
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (ball[i] == 1) {
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (auto v : ans)
cout << v << " ";
if (ans.size() != 0)
cout << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"assignment.change"
] | 777,583 | 777,584 | u945554850 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n, 0);
for (auto i = 0; i < n; i++)
cin >> a[i];
for (auto i = n - 1; i >= n / 2; i--)
if (a[i] == 1)
b[i]++;
for (auto i = n / 2 - 1; i >= 0; i--) {
int cnt = 0, mul = 2;
while (true) {
auto j = (i + 1) * mul++;
if (j >= n)
break;
cnt += b[i];
}
if (cnt % 2 != a[i])
b[i]++;
}
cout << count(b.begin(), b.end(), 1) << endl;
for (auto i = 0; i < n; i++)
if (b[i])
cout << i + 1 << " ";
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n, 0);
for (auto i = 0; i < n; i++)
cin >> a[i];
for (auto i = n - 1; i >= n / 2; i--)
if (a[i] == 1)
b[i]++;
for (auto i = n / 2 - 1; i >= 0; i--) {
int cnt = 0, mul = 2;
while (true) {
auto j = (i + 1) * mul++;
if (j > n)
break;
cnt += b[j - 1];
}
if (cnt % 2 != a[i])
b[i]++;
// cout << i << " " << cnt << " " << a[i] << " " << b[i] << endl;
}
cout << count(b.begin(), b.end(), 1) << endl;
for (auto i = 0; i < n; i++)
if (b[i])
cout << i + 1 << " ";
cout << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"assignment.change"
] | 777,595 | 777,596 | u666049605 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i, idx, cnt;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (i = 0; i < n; ++i) {
cin >> a.at(i);
if (i >= n / 2)
ans.at(i) = a.at(i);
}
for (i = n / 2 - 1; i >= 0; --i) {
cnt = 0;
idx = 2 * i + 1;
while (idx < n) {
cnt += ans.at(idx);
idx += i + 1;
}
if (cnt % 2 == 0)
ans.at(i) = a.at(i);
else
ans.at(i) = (a.at(i) + 1) % 2;
}
cout << cnt + ans.at(0) << endl;
for (i = 0; i < n; ++i)
if (ans.at(i) == 1)
cout << ans.at(i) << " ";
cout << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i, idx, cnt;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (i = 0; i < n; ++i) {
cin >> a.at(i);
if (i >= n / 2)
ans.at(i) = a.at(i);
}
for (i = n / 2 - 1; i >= 0; --i) {
cnt = 0;
idx = 2 * i + 1;
while (idx < n) {
cnt += ans.at(idx);
idx += i + 1;
}
if (cnt % 2 == 0)
ans.at(i) = a.at(i);
else
ans.at(i) = (a.at(i) + 1) % 2;
}
cout << cnt + ans.at(0) << endl;
for (i = 0; i < n; ++i)
if (ans.at(i) == 1)
cout << i + 1 << " ";
cout << endl;
return 0;
} | [
"call.remove",
"io.output.change"
] | 777,606 | 777,607 | u714732628 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg, (x).ed
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (ll i = (n); i >= 1; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
const ll MOD = 1000000007;
const ll INF = 1000000000000000;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll maxx(ll x, ll y, ll z) { return max(max(x, y), z); }
ll minn(ll x, ll y, ll z) { return min(min(x, y), z); }
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x * (y / gcd(x, y)); }
ll digsz(ll x) {
if (x == 0)
return 1;
else {
ll ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
}
ll digsum(ll x) {
ll sum = 0;
while (x) {
sum += x % 10;
x /= 10;
}
return sum;
}
vector<ll> pw2(62, 1);
vector<ll> pw10(19, 1);
int main() {
{ rep1(i, 61) pw2[i] = 2 * pw2[i - 1]; }
{ rep1(i, 18) pw10[i] = 10 * pw10[i - 1]; }
ll N;
cin >> N;
vector<ll> A(N + 1, 0);
rep1(i, N) cin >> A[i];
vector<ll> ans(N + 1, 0);
rrep1(i, N) {
if (i >= N / 2 + 1)
ans[i] = A[i];
else {
ll tmp = 0;
for (ll j = 2 * i; j <= N; j += i) {
tmp += ans[j];
}
tmp %= 2;
ans[i] = tmp ^ A[i];
}
}
ll M = 0;
rep1(i, N) {
if (ans[i] == 1)
M++;
}
cout << M << endl;
rep(i, N) {
if (ans[i] == 1)
cout << i << " ";
}
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg, (x).ed
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (ll i = (n); i >= 1; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
const ll MOD = 1000000007;
const ll INF = 1000000000000000;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll maxx(ll x, ll y, ll z) { return max(max(x, y), z); }
ll minn(ll x, ll y, ll z) { return min(min(x, y), z); }
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x * (y / gcd(x, y)); }
ll digsz(ll x) {
if (x == 0)
return 1;
else {
ll ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
}
ll digsum(ll x) {
ll sum = 0;
while (x) {
sum += x % 10;
x /= 10;
}
return sum;
}
vector<ll> pw2(62, 1);
vector<ll> pw10(19, 1);
int main() {
{ rep1(i, 61) pw2[i] = 2 * pw2[i - 1]; }
{ rep1(i, 18) pw10[i] = 10 * pw10[i - 1]; }
ll N;
cin >> N;
vector<ll> A(N + 1, 0);
rep1(i, N) cin >> A[i];
vector<ll> ans(N + 1, 0);
rrep1(i, N) {
if (i >= N / 2 + 1)
ans[i] = A[i];
else {
ll tmp = 0;
for (ll j = 2 * i; j <= N; j += i) {
tmp += ans[j];
}
tmp %= 2;
ans[i] = tmp ^ A[i];
}
}
ll M = 0;
rep1(i, N) {
if (ans[i] == 1)
M++;
}
cout << M << endl;
rep1(i, N) {
if (ans[i] == 1)
cout << i << " ";
}
}
| [
"identifier.change"
] | 777,608 | 777,609 | u527058497 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
const int mxN = 1e9 + 7;
char s[100005];
long long dp[100005][13];
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> b(n);
set<int> s;
for (int i = n - 1; i >= 0; i--) {
int cnt = 0;
for (int j = i; j < n; j++) {
cnt += b[j];
}
if (cnt % 2 != a[i]) {
b[i] = 1;
s.insert(i + 1);
}
}
bool ok = true;
for (int i = n - 1; i >= 0; i--) {
int cnt = 0;
for (int j = i; j < n; j++) {
cnt += b[j];
}
if (cnt % 2 != a[i])
ok = false;
}
if (ok) {
cout << s.size() << "\n";
for (auto x : s)
cout << x << " ";
} else {
cout << -1;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
const int mxN = 1e9 + 7;
char s[100005];
long long dp[100005][13];
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> b(n);
set<int> s;
for (int i = n - 1; i >= 0; i--) {
int cnt = 0;
for (int j = i; j < n; j += i + 1) {
cnt += b[j];
}
if (cnt % 2 != a[i]) {
b[i] = 1;
s.insert(i + 1);
}
}
bool ok = true;
for (int i = n - 1; i >= 0; i--) {
int cnt = 0;
for (int j = i; j < n; j += i + 1) {
cnt += b[j];
}
if (cnt % 2 != a[i])
ok = false;
}
if (ok) {
cout << s.size() << "\n";
for (auto x : s)
cout << x << " ";
} else {
cout << -1;
}
return 0;
} | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 777,611 | 777,612 | u221780420 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).size())
#define all(x) (x).begin(), (x).end()
#define each(a, x) for (auto &&a : (x))
#define _overload3(_1, _2, _3, name, ...) name
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) for (ll i = (a); i < (n); ++i)
#define rep(...) _overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
const int INF = 1e9;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
template <class T> inline void print(const T &x) { cout << x << "\n"; }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
struct Init {
Init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}
} init;
int main() {
ll n;
cin >> n;
vi a(n + 1, 0), b(n + 1, 0);
rep(i, 1, n + 1) cin >> a[i];
for (ll i = n; i > 0; --i) {
ll s = 0;
for (ll j = i; j <= n; j += i) {
s += b[j];
}
if (s % 2 != a[i])
++b[i];
}
ll m = 0;
each(x, b) m += x;
print(m);
if (m)
rep(i, 1, n + 1) if (b[i]) cout << a[i] << " ";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).size())
#define all(x) (x).begin(), (x).end()
#define each(a, x) for (auto &&a : (x))
#define _overload3(_1, _2, _3, name, ...) name
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) for (ll i = (a); i < (n); ++i)
#define rep(...) _overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
const int INF = 1e9;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
template <class T> inline void print(const T &x) { cout << x << "\n"; }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
struct Init {
Init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}
} init;
int main() {
ll n;
cin >> n;
vi a(n + 1, 0), b(n + 1, 0);
rep(i, 1, n + 1) cin >> a[i];
for (ll i = n; i > 0; --i) {
ll s = 0;
for (ll j = i; j <= n; j += i)
s += b[j];
if (s % 2 != a[i])
++b[i];
}
ll m = 0;
each(x, b) m += x;
print(m);
if (m)
rep(i, 1, n + 1) if (b[i]) cout << i << " ";
} | [] | 777,613 | 777,614 | u073139376 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).size())
#define all(x) (x).begin(), (x).end()
#define each(a, x) for (auto &&a : (x))
#define _overload3(_1, _2, _3, name, ...) name
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) for (ll i = (a); i < (n); ++i)
#define rep(...) _overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
const int INF = 1e9;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
template <class T> inline void print(const T &x) { cout << x << "\n"; }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
struct Init {
Init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}
} init;
int main() {
ll n;
cin >> n;
vi a(n + 1, 0), b(n + 1, 0);
rep(i, 1, n + 1) cin >> a[i];
for (ll i = n; i > 0; --i) {
ll s = 0;
for (ll j = i; j <= n; j += i) {
s += b[j];
if (s % 2 != a[i])
++b[i];
}
ll m = 0;
each(x, b) m += x;
print(m);
if (m)
rep(i, 1, n + 1) if (b[i]) cout << a[i] << " ";
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).size())
#define all(x) (x).begin(), (x).end()
#define each(a, x) for (auto &&a : (x))
#define _overload3(_1, _2, _3, name, ...) name
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) for (ll i = (a); i < (n); ++i)
#define rep(...) _overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
const int INF = 1e9;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
template <class T> inline void print(const T &x) { cout << x << "\n"; }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
struct Init {
Init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}
} init;
int main() {
ll n;
cin >> n;
vi a(n + 1, 0), b(n + 1, 0);
rep(i, 1, n + 1) cin >> a[i];
for (ll i = n; i > 0; --i) {
ll s = 0;
for (ll j = i; j <= n; j += i)
s += b[j];
if (s % 2 != a[i])
++b[i];
}
ll m = 0;
each(x, b) m += x;
print(m);
if (m)
rep(i, 1, n + 1) if (b[i]) cout << i << " ";
} | [] | 777,615 | 777,614 | u073139376 | cpp |
p02972 | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
// const int64_t L = static_cast<int64_t>(T.length());
vector<int64_t> A(N + 1, 0);
for (int64_t i = 1; i <= N; ++i) {
cin >> A[i];
}
vector<int64_t> result;
vector<int64_t> B(N + 1, 0);
for (int64_t i = N; i >= 1; --i) {
int64_t temp = 0;
for (int64_t j = 2 * i; j < N; j += i) {
temp += B[j];
temp %= 2;
}
if (temp != A[i]) {
B[i] = 1;
result.emplace_back(i);
}
}
cout << result.size() << endl;
for (int64_t i = 0; i < static_cast<int64_t>(result.size()); ++i) {
if (i != 0) {
cout << " " << endl;
}
cout << result[i];
}
cout << endl;
return 0;
}
| /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
// const int64_t L = static_cast<int64_t>(T.length());
vector<int64_t> A(N + 1, 0);
for (int64_t i = 1; i <= N; ++i) {
cin >> A[i];
}
vector<int64_t> result;
vector<int64_t> B(N + 1, 0);
for (int64_t i = N; i >= 1; --i) {
int64_t temp = 0;
for (int64_t j = 2 * i; j <= N; j += i) {
temp += B[j];
temp %= 2;
}
if (temp != A[i]) {
B[i] = 1;
result.emplace_back(i);
}
}
cout << result.size() << endl;
for (int64_t i = 0; i < static_cast<int64_t>(result.size()); ++i) {
if (i != 0) {
cout << " " << endl;
}
cout << result[i];
}
cout << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,616 | 777,617 | u394961950 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define reps(i, n) for (ll i = 1; i <= (n); ++i)
using ll = long long;
constexpr ll INF = (1LL << 60);
constexpr ll MOD = (1e9 + 7);
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
inline void dump() { cout << endl; }
template <class Head, class... Tail>
inline void dump(Head &&head, Tail &&...tail) {
cout << head << ", ";
dump(forward<Tail>(tail)...);
}
template <typename T> inline istream &operator>>(istream &input, vector<T> &v) {
for (auto &elemnt : v)
input >> elemnt;
return input;
}
template <class T> vector<T> make_vector(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vector(size_t a, Ts... ts) {
return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));
}
main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
reps(i, n) cin >> a[i];
vector<ll> res(n + 1);
for (ll i = n; i > 0; --i) {
ll t = 0;
ll x = i;
while (x < n) {
t ^= res[x];
x += i;
}
if (t == a[i])
res[i] = 0;
else
res[i] = 1;
}
vector<ll> ans;
reps(i, n) if (res[i]) ans.emplace_back(i);
cout << ans.size() << endl;
for (auto x : ans)
cout << x << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define reps(i, n) for (ll i = 1; i <= (n); ++i)
using ll = long long;
constexpr ll INF = (1LL << 60);
constexpr ll MOD = (1e9 + 7);
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
inline void dump() { cout << endl; }
template <class Head, class... Tail>
inline void dump(Head &&head, Tail &&...tail) {
cout << head << ", ";
dump(forward<Tail>(tail)...);
}
template <typename T> inline istream &operator>>(istream &input, vector<T> &v) {
for (auto &elemnt : v)
input >> elemnt;
return input;
}
template <class T> vector<T> make_vector(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vector(size_t a, Ts... ts) {
return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));
}
main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
reps(i, n) cin >> a[i];
vector<ll> res(n + 1);
for (ll i = n; i > 0; --i) {
ll t = 0;
ll x = i;
while (x <= n) {
t ^= res[x];
x += i;
}
if (t == a[i])
res[i] = 0;
else
res[i] = 1;
}
vector<ll> ans;
reps(i, n) if (res[i]) ans.emplace_back(i);
cout << ans.size() << endl;
for (auto x : ans)
cout << x << " ";
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 777,618 | 777,619 | u423624748 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<ll> b(n + 1, 0);
for (ll i = n; i > 0; --i) {
ll t = 0, idx = i;
if (idx + i <= n) {
idx += i;
t += b[idx];
}
t %= 2;
if (a[i] == t)
b[i] = 0;
else
b[i] = 1;
}
vector<ll> ans;
rep(i, n) if (b[i + 1]) ans.push_back(i + 1);
cout << ans.size() << endl;
if (ans.empty())
return 0;
for (auto x : ans)
cout << x << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<ll> b(n + 1, 0);
for (ll i = n; i > 0; --i) {
ll t = 0, idx = i;
while (idx + i <= n) {
idx += i;
t += b[idx];
}
t %= 2;
if (a[i] == t)
b[i] = 0;
else
b[i] = 1;
}
vector<ll> ans;
rep(i, n) if (b[i + 1]) ans.push_back(i + 1);
cout << ans.size() << endl;
if (ans.empty())
return 0;
for (auto x : ans)
cout << x << " ";
cout << endl;
} | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 777,620 | 777,621 | u423624748 | cpp |
p02972 | // 解説を見た
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<bool>> vvb;
typedef vector<vector<int>> vvi;
typedef map<int, bool> mib;
typedef long long ll;
typedef vector<long long> vl;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vpll;
typedef vector<string> vs;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPD(i, n) for (int i = (n - 1); i >= 0; --i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define FORED(i, s, n) for (int i = (s); i >= (int)(n); i--)
#define debug(x) cerr << #x << ": " << x << '\n'
#define debug2(x, y) cerr << #x << ": " << x << ", " << #y << ": " << y << '\n'
#define debug3(x, y, z) \
cerr << #x << ": " << x << ", " << #y << ": " << y << ", " << #z << ": " \
<< z << '\n'
#define debugs(s) cerr << s << "\n"
#define hyphen() cerr << "--\n"
#define ALL(vec) (vec).begin(), (vec).end()
#define REVALL(vec) (vec).rbegin(), (vec).rend()
static const int dy[4] = {0, 1, 0, -1}, dx[4] = {1, 0, -1, 0};
#define fst first
#define snd second
#define pb push_back
#define mk(x, y) make_pair((x), (y))
// http://ehafib.hatenablog.com/entry/2015/12/23/164137
int qp(int a, ll b) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a;
a = 1ll * a * a;
} while (b >>= 1);
return ans;
}
int qpm(int a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
// gcd : O(logN)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
#define sz(v) int(v.size())
// x1, x2ライブラリとの被りを避ける
#define x1 x192837465
#define x2 x123456789
#define y1 y192837465
#define y2 y123456789
// typo
#define itn int
#define reutrn return
#define reutnr return
#define retrun return
#define srting string
#define stirng string
#define stirung string
#define cosnt const
#define make(type, x) \
type x; \
cin >> x;
#define make2(type, x, y) \
type x, y; \
cin >> x >> y;
#define make3(type, x, y, z) \
type x, y, z; \
cin >> x >> y >> z;
#define make4(type, x, y, z, t) \
type x, y, z, t; \
cin >> x >> y >> z >> t;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
#define uniq(v) (v).erase(unique(ALL((v))), (v).end());
std::string replaceOtherStr(std::string &replacedStr, std::string from,
std::string to) {
const int pos = replacedStr.find(from);
const int len = from.length();
if (pos == std::string::npos || from.empty()) {
return replacedStr;
}
return replacedStr.replace(pos, len, to);
}
std::string replaceAll(std::string &replacedStr, std::string from,
std::string to) {
int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos) {
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
// area of (0, 0)(a, b)(c, d)
double area(double a, double b, double c, double d) {
return abs(a * d - b * c) / 2.0;
}
const int PREC = 10;
#define coutf(val) cout << fixed << setprecision(PREC) << (val) << endl;
const int MOD = (int)1e9 + 7;
const int INF = numeric_limits<int>::max();
signed main() {
make(int, N);
int no = -1;
int M = 0;
vector<int> As(N);
vector<int> Bs(N, 0);
REP(i, N) {
make(int, A);
As.at(i) = A;
}
FORED(i, N, 1) {
// debug(i);
int n = 0;
for (int k = i; k <= N; k += i) {
// debug(k);
n += Bs.at(k - 1);
}
if (n % 2 != As.at(i - 1)) {
// debug2(n, As.at(i-1));
Bs.at(i - 1) = 1;
M++;
}
}
cout << M << endl;
REPD(i, N) {
if (Bs.at(i) == 1) {
cout << Bs.at(i) << endl;
}
}
}
| // 解説を見た
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<bool>> vvb;
typedef vector<vector<int>> vvi;
typedef map<int, bool> mib;
typedef long long ll;
typedef vector<long long> vl;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vpll;
typedef vector<string> vs;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPD(i, n) for (int i = (n - 1); i >= 0; --i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define FORED(i, s, n) for (int i = (s); i >= (int)(n); i--)
#define debug(x) cerr << #x << ": " << x << '\n'
#define debug2(x, y) cerr << #x << ": " << x << ", " << #y << ": " << y << '\n'
#define debug3(x, y, z) \
cerr << #x << ": " << x << ", " << #y << ": " << y << ", " << #z << ": " \
<< z << '\n'
#define debugs(s) cerr << s << "\n"
#define hyphen() cerr << "--\n"
#define ALL(vec) (vec).begin(), (vec).end()
#define REVALL(vec) (vec).rbegin(), (vec).rend()
static const int dy[4] = {0, 1, 0, -1}, dx[4] = {1, 0, -1, 0};
#define fst first
#define snd second
#define pb push_back
#define mk(x, y) make_pair((x), (y))
// http://ehafib.hatenablog.com/entry/2015/12/23/164137
int qp(int a, ll b) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a;
a = 1ll * a * a;
} while (b >>= 1);
return ans;
}
int qpm(int a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
// gcd : O(logN)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
#define sz(v) int(v.size())
// x1, x2ライブラリとの被りを避ける
#define x1 x192837465
#define x2 x123456789
#define y1 y192837465
#define y2 y123456789
// typo
#define itn int
#define reutrn return
#define reutnr return
#define retrun return
#define srting string
#define stirng string
#define stirung string
#define cosnt const
#define make(type, x) \
type x; \
cin >> x;
#define make2(type, x, y) \
type x, y; \
cin >> x >> y;
#define make3(type, x, y, z) \
type x, y, z; \
cin >> x >> y >> z;
#define make4(type, x, y, z, t) \
type x, y, z, t; \
cin >> x >> y >> z >> t;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
#define uniq(v) (v).erase(unique(ALL((v))), (v).end());
std::string replaceOtherStr(std::string &replacedStr, std::string from,
std::string to) {
const int pos = replacedStr.find(from);
const int len = from.length();
if (pos == std::string::npos || from.empty()) {
return replacedStr;
}
return replacedStr.replace(pos, len, to);
}
std::string replaceAll(std::string &replacedStr, std::string from,
std::string to) {
int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos) {
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
// area of (0, 0)(a, b)(c, d)
double area(double a, double b, double c, double d) {
return abs(a * d - b * c) / 2.0;
}
const int PREC = 10;
#define coutf(val) cout << fixed << setprecision(PREC) << (val) << endl;
const int MOD = (int)1e9 + 7;
const int INF = numeric_limits<int>::max();
signed main() {
make(int, N);
int no = -1;
int M = 0;
vector<int> As(N);
vector<int> Bs(N, 0);
REP(i, N) {
make(int, A);
As.at(i) = A;
}
FORED(i, N, 1) {
// debug(i);
int n = 0;
for (int k = i; k <= N; k += i) {
// debug(k);
n += Bs.at(k - 1);
}
if (n % 2 != As.at(i - 1)) {
// debug2(n, As.at(i-1));
Bs.at(i - 1) = 1;
M++;
}
}
cout << M << endl;
REP(i, N) {
if (Bs.at(i) == 1) {
cout << (i + 1) << endl;
}
}
}
| [
"identifier.change"
] | 777,622 | 777,623 | u558528117 | cpp |
p02972 | #include <algorithm>
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD = 1000000007;
int modpow(int a, int x) {
if (a < 0)
a += MOD;
int ans = 1;
while (x > 0) {
if (x & 1)
ans = ans * a % MOD;
a = a * a % MOD;
x >>= 1;
}
return ans;
}
int gyaku(int n) { return modpow(n, MOD - 2); }
signed main() {
int n;
int ans = 0;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ball(n);
for (int i = n - 1; i >= 0; i--) {
int p = i + 1;
int count = 0;
while (p <= n) {
if (ball[p - 1])
count++;
p += p;
}
ball[i] = abs((count % 2) - a[i]);
if (ball[i])
ans++;
}
cout << ans << endl;
rep(i, n) {
if (ball[i])
cout << i + 1 << endl;
}
}
| #include <algorithm>
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD = 1000000007;
int modpow(int a, int x) {
if (a < 0)
a += MOD;
int ans = 1;
while (x > 0) {
if (x & 1)
ans = ans * a % MOD;
a = a * a % MOD;
x >>= 1;
}
return ans;
}
int gyaku(int n) { return modpow(n, MOD - 2); }
signed main() {
int n;
int ans = 0;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ball(n);
for (int i = n - 1; i >= 0; i--) {
int p = i + 1;
int count = 0;
while (p <= n) {
if (ball[p - 1])
count++;
p += i + 1;
}
ball[i] = abs((count % 2) - a[i]);
if (ball[i])
ans++;
}
cout << ans << endl;
rep(i, n) {
if (ball[i])
cout << i + 1 << endl;
}
}
| [
"assignment.value.change",
"assignment.change"
] | 777,627 | 777,628 | u532514769 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int> A(N), B(N, 0), C(0);
for (int &i : A)
cin >> i;
for (int i = N; i > 0; i--) {
int cnt = 0;
for (int j = 2; i * j <= N; j++)
cnt += A[i * j - 1];
B[i - 1] = (A[i - 1] + cnt) % 2;
}
for (int i = 0; i < N; i++)
if (B[i])
C.push_back(i + 1);
cout << C.size() << endl;
for (int i = 0; i < (int)C.size(); i++) {
cout << C[i];
if (i == C.size() - 1)
cout << endl;
else
cout << ' ';
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int> A(N), B(N, 0), C(0);
for (int &i : A)
cin >> i;
for (int i = N; i > 0; i--) {
int cnt = 0;
for (int j = 2; i * j <= N; j++)
cnt += B[i * j - 1];
B[i - 1] = (A[i - 1] + cnt) % 2;
}
for (int i = 0; i < N; i++)
if (B[i])
C.push_back(i + 1);
cout << C.size() << endl;
for (int i = 0; i < (int)C.size(); i++) {
cout << C[i];
if (i == C.size() - 1)
cout << endl;
else
cout << ' ';
}
} | [
"assignment.value.change",
"identifier.change"
] | 777,633 | 777,634 | u306482197 | cpp |
p02972 | /* Simplicity and Goodness */
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
void my_dbg() { cout << endl; }
template <typename Arg, typename... Args> void my_dbg(Arg A, Args... B) {
cout << ' ' << A;
my_dbg(B...);
}
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld", &n)
#define pri(n) printf("%d ", (int)(n))
#define prin(n) printf("%d\n", (int)(n))
#define lpri(n) printf("%lld ", n)
#define lprin(n) printf("%lld\n", n)
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
const int inf = INT_MAX;
const int ninf = INT_MIN;
const int mod = 1e9 + 7;
const int N = 2e5 + 2;
void solve() {
int n;
scn(n);
vi a(n + 1), ball(n + 1, 0);
rep(i, 1, n + 1) scn(a[i]);
vi res;
for (int i = n; i >= 1; i--) {
int here = 0;
for (int j = i; j <= n; j += i)
here += ball[i];
if ((here & 1) != (a[i] & 1))
res.pb(i), ball[i] = 1;
}
prin(res.size());
for (auto i : res)
pri(i);
}
int main() {
int t = 1;
// scn(t);
while (t--) {
solve();
}
return 0;
} | /* Simplicity and Goodness */
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
void my_dbg() { cout << endl; }
template <typename Arg, typename... Args> void my_dbg(Arg A, Args... B) {
cout << ' ' << A;
my_dbg(B...);
}
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld", &n)
#define pri(n) printf("%d ", (int)(n))
#define prin(n) printf("%d\n", (int)(n))
#define lpri(n) printf("%lld ", n)
#define lprin(n) printf("%lld\n", n)
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
const int inf = INT_MAX;
const int ninf = INT_MIN;
const int mod = 1e9 + 7;
const int N = 2e5 + 2;
void solve() {
int n;
scn(n);
vi a(n + 1), ball(n + 1, 0);
rep(i, 1, n + 1) scn(a[i]);
vi res;
for (int i = n; i >= 1; i--) {
int here = 0;
for (int j = i; j <= n; j += i)
here += ball[j];
if ((here & 1) != (a[i] & 1))
res.pb(i), ball[i] = 1;
}
prin(res.size());
for (auto i : res)
pri(i);
}
int main() {
int t = 1;
// scn(t);
while (t--) {
solve();
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,637 | 777,638 | u777549027 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(), (x).end()
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
using Graph = vector<vector<int>>;
const double pi = acos(-1);
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
mint calc(long long N, long long K) {
mint res = 1;
for (long long n = 0; n < K; ++n) {
res *= (N - n);
res /= (n + 1);
}
return res;
}
int main() {
// cout << fixed << setprecision(12);
ll n;
cin >> n;
ll r;
ll a[n + 1] = {};
ll b[n + 1] = {};
repl(i, 1, n + 1) { cin >> a[i]; }
for (ll i = n; i > 0; i--) {
r = 0;
ll g = i;
while (g <= n) {
r += b[g];
g += i;
}
if (a[i] != r % 2) {
b[i]++;
}
}
r = 0;
repl(i, 1, n + 1) { r += b[i]; }
cout << r << endl;
rep(i, n + 1) {
if (b[i] == 1) {
cout << b[i] << " ";
}
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(), (x).end()
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
using Graph = vector<vector<int>>;
const double pi = acos(-1);
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
mint calc(long long N, long long K) {
mint res = 1;
for (long long n = 0; n < K; ++n) {
res *= (N - n);
res /= (n + 1);
}
return res;
}
int main() {
// cout << fixed << setprecision(12);
ll n;
cin >> n;
ll r;
ll a[n + 1] = {};
ll b[n + 1] = {};
repl(i, 1, n + 1) { cin >> a[i]; }
for (ll i = n; i > 0; i--) {
r = 0;
ll g = i;
while (g <= n) {
r += b[g];
g += i;
}
if (a[i] != r % 2) {
b[i]++;
}
}
r = 0;
repl(i, 1, n + 1) { r += b[i]; }
cout << r << endl;
rep(i, n + 1) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
}
| [] | 777,639 | 777,640 | u722640678 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
vector<ll> w(n, 0);
rep(i, n) cin >> v[i];
for (ll i = n - 1; i >= 0; i--) {
ll tmp = 0;
rep(j, 10 / (i + 1)) {
if (j == 0)
tmp += v[(i + 1) * (j + 1) - 1];
else
tmp += w[(i + 1) * (j + 1) - 1];
}
if (v[i] == 1) {
if (tmp % 2 == 0)
w[i] = 0;
if (tmp % 2 == 1)
w[i] = 1;
} else if (v[i] == 0) {
if (tmp % 2 == 0)
w[i] = 0;
if (tmp % 2 == 1)
w[i] = 1;
}
}
ll ans = 0;
rep(i, n) if (w[i] == 1) ans++;
cout << ans << endl;
rep(i, n) if (w[i] == 1) cout << i + 1 << ' ';
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
vector<ll> w(n, 0);
rep(i, n) cin >> v[i];
for (ll i = n - 1; i >= 0; i--) {
ll tmp = 0;
rep(j, n / (i + 1)) {
if (j == 0)
tmp += v[(i + 1) * (j + 1) - 1];
else
tmp += w[(i + 1) * (j + 1) - 1];
}
if (v[i] == 1) {
if (tmp % 2 == 0)
w[i] = 0;
if (tmp % 2 == 1)
w[i] = 1;
} else if (v[i] == 0) {
if (tmp % 2 == 0)
w[i] = 0;
if (tmp % 2 == 1)
w[i] = 1;
}
}
ll ans = 0;
rep(i, n) if (w[i] == 1) ans++;
cout << ans << endl;
rep(i, n) if (w[i] == 1) cout << i + 1 << ' ';
cout << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 777,643 | 777,644 | u264265458 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 0x7ffffff;
const int mod = 1000000007;
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> p(n);
for (int i = n - 1; i >= 0; --i) {
int tmp = 0;
for (int j = (i + 1) + (i + 1); j < n; j += (i + 1)) {
tmp += p[j];
}
if (tmp % 2 != a[i]) {
p[i] = 1;
}
}
vector<int> res;
int ans = 0;
rep(i, n) {
if (p[i]) {
ans++;
res.emplace_back(i + 1);
}
}
cout << ans << endl;
for (int c : res) {
if (c == res.back()) {
cout << c << endl;
} else {
cout << c << ' ';
}
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 0x7ffffff;
const int mod = 1000000007;
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> p(n);
for (int i = n - 1; i >= 0; --i) {
int tmp = 0;
for (int j = i + (i + 1); j < n; j += (i + 1)) {
tmp += p[j];
}
if (tmp % 2 != a[i]) {
p[i] = 1;
}
}
vector<int> res;
int ans = 0;
rep(i, n) {
if (p[i]) {
ans++;
res.emplace_back(i + 1);
}
}
cout << ans << endl;
for (int c : res) {
if (c == res.back()) {
cout << c << endl;
} else {
cout << c << ' ';
}
}
return 0;
}
| [
"control_flow.loop.for.initializer.change"
] | 777,648 | 777,649 | u274883254 | cpp |
p02972 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#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))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n;
cin >> n;
vll as(n + 1);
rep(i, n) cin >> as[i + 1];
rrepLRE(i, n, 1) {
for (ll j = 2 * i; j <= n; j++) {
as[i] ^= as[j];
}
}
vll bs;
repLRE(i, 1, n) if (as[i]) bs.push_back(i);
cout << bs.size() << endl;
rep(i, (ll)bs.size()) cout << bs[i]
<< ((i == (ll)bs.size() - 1) ? "\n" : " ");
return 0;
}
| #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#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))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n;
cin >> n;
vll as(n + 1);
rep(i, n) cin >> as[i + 1];
rrepLRE(i, n, 1) {
for (ll j = 2 * i; j <= n; j += i) {
as[i] ^= as[j];
}
}
vll bs;
repLRE(i, 1, n) if (as[i]) bs.push_back(i);
cout << bs.size() << endl;
rep(i, (ll)bs.size()) cout << bs[i]
<< ((i == (ll)bs.size() - 1) ? "\n" : " ");
return 0;
}
| [] | 777,650 | 777,651 | u714724786 | cpp |
p02972 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#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))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n;
cin >> n;
vll as(n + 1);
rep(i, n) cin >> as[i + 1];
repLRE(i, n, 1) {
for (ll j = 2 * i; j <= n; j++) {
as[i] ^= as[j];
}
}
vll bs;
repLRE(i, 1, n) if (as[i]) bs.push_back(i);
cout << bs.size() << endl;
rep(i, (ll)bs.size()) cout << bs[i]
<< ((i == (ll)bs.size() - 1) ? "\n" : " ");
return 0;
}
| #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#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))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n;
cin >> n;
vll as(n + 1);
rep(i, n) cin >> as[i + 1];
rrepLRE(i, n, 1) {
for (ll j = 2 * i; j <= n; j += i) {
as[i] ^= as[j];
}
}
vll bs;
repLRE(i, 1, n) if (as[i]) bs.push_back(i);
cout << bs.size() << endl;
rep(i, (ll)bs.size()) cout << bs[i]
<< ((i == (ll)bs.size() - 1) ? "\n" : " ");
return 0;
}
| [
"identifier.change",
"call.function.change"
] | 777,652 | 777,651 | u714724786 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
int a[n + 1];
rep(i, n) cin >> a[i + 1];
vector<int> ans(n + 1);
int cnt = 0;
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = i * 2; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 == a[i])
ans[i] = 0;
else {
ans[i] = 1;
++cnt;
}
}
cout << cnt << endl;
for (int i = 1; i <= n; ++i)
if (ans[i])
printf("%d%c", ans[i], (i == n) ? '\n' : ' ');
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
int a[n + 1];
rep(i, n) cin >> a[i + 1];
vector<int> ans(n + 1);
int cnt = 0;
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = i * 2; j <= n; j += i) {
sum += ans[j];
}
if (sum % 2 == a[i])
ans[i] = 0;
else {
ans[i] = 1;
++cnt;
}
}
cout << cnt << endl;
for (int i = 1; i <= n; ++i)
if (ans[i])
printf("%d%c", i, (i == n) ? '\n' : ' ');
return 0;
}
| [
"call.arguments.change"
] | 777,657 | 777,658 | u075775814 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N, 0);
vector<int> solution(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
int counter = 0;
int j = 0;
for (int i = N - 1; i >= 0; i--) {
counter = 0;
j = 1;
while (j * (i + 1) <= N) {
counter += solution[j * (i + 1) - 1];
j++;
}
counter = counter % 2;
if (counter != vec[i]) {
solution[i] = 1;
}
}
int balls = 0;
for (int i = 0; i < N; i++) {
balls += solution[i];
}
cout << balls << endl;
if (balls != 0) {
for (int i = 0; i < N - 1; i++) {
if (solution[i] == 1) {
cout << i + 1 << " ";
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N, 0);
vector<int> solution(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
int counter = 0;
int j = 0;
for (int i = N - 1; i >= 0; i--) {
counter = 0;
j = 2;
while (j * (i + 1) <= N) {
counter += solution[j * (i + 1) - 1];
j++;
}
counter = counter % 2;
if (counter != vec[i]) {
solution[i] = 1;
}
}
int balls = 0;
for (int i = 0; i < N; i++) {
balls += solution[i];
}
cout << balls << endl;
if (balls != 0) {
for (int i = 0; i < N; i++) {
if (solution[i] == 1) {
cout << i + 1 << " ";
}
}
}
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 777,663 | 777,664 | u636279017 | cpp |
p02972 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998244353;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, 0, n) cin >> a[i];
int cnt = 0;
repp(i, n - 1, 0) {
int num = 0;
for (int j = (i + 1) * 2; j < n; j += i + 1) {
if (b[j - 1] == 1)
num++;
}
if (num % 2 == 1) {
if (a[i] == 0)
b[i] = 1, cnt++;
} else {
if (a[i] == 1)
b[i] = 1, cnt++;
;
}
}
cout << cnt << endl;
rep(i, 0, n) {
if (b[i] == 1)
cout << i + 1 << endl;
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998244353;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, 0, n) cin >> a[i];
int cnt = 0;
repp(i, n - 1, 0) {
int num = 0;
for (int j = (i + 1) * 2; j < n + 1; j += i + 1) {
if (b[j - 1] == 1)
num++;
}
if (num % 2 == 1) {
if (a[i] == 0)
b[i] = 1, cnt++;
} else {
if (a[i] == 1)
b[i] = 1, cnt++;
;
}
}
cout << cnt << endl;
rep(i, 0, n) {
if (b[i] == 1)
cout << i + 1 << endl;
}
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 777,671 | 777,672 | u590825760 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> a;
int main() {
cin >> N;
a.resize(N + 1);
rep(i, N) cin >> a[i + 1];
// 後ろから決めてく
vector<ll> ans(N + 1, -1);
// reverse(a.begin(), a.end());
// 倍数
for (int i = N; i > 0; i--) {
// cout << i << endl;
int loop_cnt = N / i;
if (loop_cnt >= 2) {
// cout << i << " over" << endl;
// iより上は計算されている
ll tmp = 0;
for (int j = i + i; j <= N; j += i) {
tmp += ans[i];
}
tmp = tmp % 2;
ans[i] = tmp ^ a[i];
// cout << tmp << endl;
} else {
// cout << i << " " << a[i] << endl;
// 値固定するしかない
ans[i] = a[i];
}
}
// reverse(ans.begin(), ans.end());
set<ll> st;
for (int i = 1; i <= N; i++) {
if (ans[i] == 1) {
st.insert(i);
};
}
cout << st.size() << endl;
for (auto v : st) {
cout << v << " ";
}
cout << endl;
// for (int i = 0; i <= ans.size() - 1; i++) {
// cout << ans[i] << " ";
// }
// cout << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> a;
int main() {
cin >> N;
a.resize(N + 1);
rep(i, N) cin >> a[i + 1];
// 後ろから決めてく
vector<ll> ans(N + 1, -1);
// reverse(a.begin(), a.end());
// 倍数
for (int i = N; i > 0; i--) {
// cout << i << endl;
int loop_cnt = N / i;
if (loop_cnt >= 2) {
// cout << i << " over" << endl;
// iより上は計算されている
ll tmp = 0;
for (int j = i + i; j <= N; j += i) {
tmp += ans[j];
}
tmp = tmp % 2;
ans[i] = tmp ^ a[i];
// cout << tmp << endl;
} else {
// cout << i << " " << a[i] << endl;
// 値固定するしかない
ans[i] = a[i];
}
}
// reverse(ans.begin(), ans.end());
set<ll> st;
for (int i = 1; i <= N; i++) {
if (ans[i] == 1) {
st.insert(i);
};
}
cout << st.size() << endl;
for (auto v : st) {
cout << v << " ";
}
cout << endl;
// for (int i = 0; i <= ans.size() - 1; i++) {
// cout << ans[i] << " ";
// }
// cout << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,679 | 777,680 | u455366471 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
// REPEAT
// ----------------------------------------
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REPA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) \
;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define COUT(a) cout << (a) << endl;
#define ENDL(a) cout << endl;
#define COUTA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) { \
cout << (a)[i] << " "; \
} \
cout << endl;
// UTIL
// ----------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
// DEBUG
// ----------------------------------------
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
template <typename T> void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) { cout << i << ":" << v[i] << " "; }
cout << endl;
#else
(void)v;
#endif
}
// BIT FLAG
// ----------------------------------------
const unsigned int BIT_FLAG_0 = (1 << 0); // 0000 0000 0000 0001
const unsigned int BIT_FLAG_1 = (1 << 1); // 0000 0000 0000 0010
const unsigned int BIT_FLAG_2 = (1 << 2); // 0000 0000 0000 0100
const unsigned int BIT_FLAG_3 = (1 << 3); // 0000 0000 0000 1000
const unsigned int BIT_FLAG_4 = (1 << 4); // 0000 0000 0001 0000
const unsigned int BIT_FLAG_5 = (1 << 5); // 0000 0000 0010 0000
const unsigned int BIT_FLAG_6 = (1 << 6); // 0000 0000 0100 0000
const unsigned int BIT_FLAG_7 = (1 << 7); // 0000 0000 1000 0000
const unsigned int BIT_FLAG_8 = (1 << 8); // 0000 0001 0000 0000
const unsigned int BIT_FLAG_9 = (1 << 9); // 0000 0010 0000 0000
const unsigned int BIT_FLAG_10 = (1 << 10); // 0000 0100 0000 0000
const unsigned int BIT_FLAG_11 = (1 << 11); // 0000 1000 0000 0000
// CONST
// ----------------------------------------
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.14159265358979323846; // or M_PI
constexpr int MOD = 1000000007;
void Main() {
ll n;
cin >> n;
vll a(n), ans(n, 0);
REP(i, n) { cin >> a[i]; }
REPD(i, n) {
ll total = 0;
ll index = i + 1;
FOR(j, 2, n) {
if (index * j >= n) {
total += ans[index * j - 1];
} else {
break;
}
}
if (total % 2 == 0) {
ans[index - 1] = a[index - 1];
} else {
if (a[index - 1] == 0) {
ans[index - 1] = 1;
} else {
ans[index - 1] = 0;
}
}
}
ll count = 0;
vll ball_list;
REP(i, n) {
if (ans[i] == 1) {
ball_list.pb(i + 1);
count++;
}
}
COUT(count);
if (ball_list.size()) {
COUTA(i, ball_list);
}
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
/*
5 2
3 1 2 5
2 2 3
1 0
*/
| #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
// REPEAT
// ----------------------------------------
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REPA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) \
;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define COUT(a) cout << (a) << endl;
#define ENDL(a) cout << endl;
#define COUTA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) { \
cout << (a)[i] << " "; \
} \
cout << endl;
// UTIL
// ----------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
// DEBUG
// ----------------------------------------
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
template <typename T> void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) { cout << i << ":" << v[i] << " "; }
cout << endl;
#else
(void)v;
#endif
}
// BIT FLAG
// ----------------------------------------
const unsigned int BIT_FLAG_0 = (1 << 0); // 0000 0000 0000 0001
const unsigned int BIT_FLAG_1 = (1 << 1); // 0000 0000 0000 0010
const unsigned int BIT_FLAG_2 = (1 << 2); // 0000 0000 0000 0100
const unsigned int BIT_FLAG_3 = (1 << 3); // 0000 0000 0000 1000
const unsigned int BIT_FLAG_4 = (1 << 4); // 0000 0000 0001 0000
const unsigned int BIT_FLAG_5 = (1 << 5); // 0000 0000 0010 0000
const unsigned int BIT_FLAG_6 = (1 << 6); // 0000 0000 0100 0000
const unsigned int BIT_FLAG_7 = (1 << 7); // 0000 0000 1000 0000
const unsigned int BIT_FLAG_8 = (1 << 8); // 0000 0001 0000 0000
const unsigned int BIT_FLAG_9 = (1 << 9); // 0000 0010 0000 0000
const unsigned int BIT_FLAG_10 = (1 << 10); // 0000 0100 0000 0000
const unsigned int BIT_FLAG_11 = (1 << 11); // 0000 1000 0000 0000
// CONST
// ----------------------------------------
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.14159265358979323846; // or M_PI
constexpr int MOD = 1000000007;
void Main() {
ll n;
cin >> n;
vll a(n), ans(n, 0);
REP(i, n) { cin >> a[i]; }
REPD(i, n) {
ll total = 0;
ll index = i + 1; // 3, 2, 1
FOR(j, 2, n) {
if (index * j <= n) {
total += ans[index * j - 1];
} else {
break;
}
}
if (total % 2 == 0) {
ans[index - 1] = a[index - 1];
} else {
if (a[index - 1] == 0) {
ans[index - 1] = 1;
} else {
ans[index - 1] = 0;
}
}
}
ll count = 0;
vll ball_list;
REP(i, n) {
if (ans[i] == 1) {
ball_list.pb(i + 1);
count++;
}
}
COUT(count);
if (ball_list.size()) {
COUTA(i, ball_list);
}
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
/*
5 2
3 1 2 5
2 2 3
1 0
*/
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 777,686 | 777,687 | u644224332 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i <= (int)(n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
// Mod int
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x;
mint() : x(0) {}
mint(ll x) : x((x % mod + mod) % mod) {}
// mint(ll x):x(x){}
mint &fix() {
x = (x % mod + mod) % mod;
return *this;
}
mint operator-() const { return mint(0) - *this; }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const { return mint(*this) += a; }
mint operator-(const mint &a) const { return mint(*this) -= a; }
mint operator*(const mint &a) const { return mint(*this) *= a; }
bool operator<(const mint &a) const { return x < a.x; }
bool operator==(const mint &a) const { return x == a.x; }
};
istream &operator>>(istream &i, mint &a) {
i >> a.x;
return i;
}
ostream &operator<<(ostream &o, const mint &a) {
o << a.x;
return o;
}
//
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 < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i <= (int)(n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
// Mod int
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x;
mint() : x(0) {}
mint(ll x) : x((x % mod + mod) % mod) {}
// mint(ll x):x(x){}
mint &fix() {
x = (x % mod + mod) % mod;
return *this;
}
mint operator-() const { return mint(0) - *this; }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const { return mint(*this) += a; }
mint operator-(const mint &a) const { return mint(*this) -= a; }
mint operator*(const mint &a) const { return mint(*this) *= a; }
bool operator<(const mint &a) const { return x < a.x; }
bool operator==(const mint &a) const { return x == a.x; }
};
istream &operator>>(istream &i, mint &a) {
i >> a.x;
return i;
}
ostream &operator<<(ostream &o, const mint &a) {
o << a.x;
return o;
}
//
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"
] | 777,696 | 777,697 | u263000123 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i <= (int)(n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
// Mod int
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x;
mint() : x(0) {}
mint(ll x) : x((x % mod + mod) % mod) {}
// mint(ll x):x(x){}
mint &fix() {
x = (x % mod + mod) % mod;
return *this;
}
mint operator-() const { return mint(0) - *this; }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const { return mint(*this) += a; }
mint operator-(const mint &a) const { return mint(*this) -= a; }
mint operator*(const mint &a) const { return mint(*this) *= a; }
bool operator<(const mint &a) const { return x < a.x; }
bool operator==(const mint &a) const { return x == a.x; }
};
istream &operator>>(istream &i, mint &a) {
i >> a.x;
return i;
}
ostream &operator<<(ostream &o, const mint &a) {
o << a.x;
return o;
}
//
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' : ' ');
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i <= (int)(n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
// Mod int
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x;
mint() : x(0) {}
mint(ll x) : x((x % mod + mod) % mod) {}
// mint(ll x):x(x){}
mint &fix() {
x = (x % mod + mod) % mod;
return *this;
}
mint operator-() const { return mint(0) - *this; }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const { return mint(*this) += a; }
mint operator-(const mint &a) const { return mint(*this) -= a; }
mint operator*(const mint &a) const { return mint(*this) *= a; }
bool operator<(const mint &a) const { return x < a.x; }
bool operator==(const mint &a) const { return x == a.x; }
};
istream &operator>>(istream &i, mint &a) {
i >> a.x;
return i;
}
ostream &operator<<(ostream &o, const mint &a) {
o << a.x;
return o;
}
//
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",
"control_flow.return.add",
"control_flow.return.0.add"
] | 777,698 | 777,697 | u263000123 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<int, vector<int>, greater<int>>
spqint; //小さい順に取り出し
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll; //小さい順に取り出し
typedef priority_queue<int, vector<int>, less<int>> bpqint; //大きい順に取り出し
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll; //大きい順に取り出し
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); i++)
#define FI first
#define SE second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define TS to_string
#define BS binary_search
#define LB lower_bound
#define UB upper_bound
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) (ll) x.size()
#define SP(x) setprecision((ll)x)
int INF = 1e9;
int NIL = -1;
ll MOD = 1000000007;
ll LINF = 1e18;
double EPS = 1e-9;
double PI = M_PI;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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; } //最小公倍数
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
//-----------------------------------------
vector<long long> factor_array(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n) {
res.push_back(n / i);
}
}
}
sort(res.begin(), res.end());
return res;
}
//-----------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::chrono::system_clock::time_point start, end;
start = std::chrono::system_clock::now();
int n;
cin >> n;
vint a(n + 1);
REP(i, n) { cin >> a[i + 1]; }
vint cnt(n + 1, 0);
set<int> ans;
for (int i = n; i > 0; i--) {
if (cnt[i] % 2 != a[i]) {
ans.insert(i);
vll b = factor_array(a[i]);
REP(j, SZ(b)) { cnt[b[j]]++; }
}
}
cout << SZ(ans) << endl;
IREP(i, ans) { cout << (*i) << " "; }
cout << endl;
end = std::chrono::system_clock::now();
auto elapsed =
std::chrono::duration_cast<std::chrono::milliseconds>(end - start)
.count();
// std::cout << elapsed <<"ms"<< std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<int, vector<int>, greater<int>>
spqint; //小さい順に取り出し
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll; //小さい順に取り出し
typedef priority_queue<int, vector<int>, less<int>> bpqint; //大きい順に取り出し
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll; //大きい順に取り出し
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); i++)
#define FI first
#define SE second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define TS to_string
#define BS binary_search
#define LB lower_bound
#define UB upper_bound
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) (ll) x.size()
#define SP(x) setprecision((ll)x)
int INF = 1e9;
int NIL = -1;
ll MOD = 1000000007;
ll LINF = 1e18;
double EPS = 1e-9;
double PI = M_PI;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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; } //最小公倍数
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
//-----------------------------------------
vector<long long> factor_array(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n) {
res.push_back(n / i);
}
}
}
sort(res.begin(), res.end());
return res;
}
//-----------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::chrono::system_clock::time_point start, end;
start = std::chrono::system_clock::now();
int n;
cin >> n;
vint a(n + 1);
REP(i, n) { cin >> a[i + 1]; }
vint cnt(n + 1, 0);
set<int> ans;
for (int i = n; i > 0; i--) {
if (cnt[i] % 2 != a[i]) {
ans.insert(i);
vll b = factor_array(i);
REP(j, SZ(b)) { cnt[b[j]]++; }
}
}
cout << SZ(ans) << endl;
IREP(i, ans) { cout << (*i) << " "; }
cout << endl;
end = std::chrono::system_clock::now();
auto elapsed =
std::chrono::duration_cast<std::chrono::milliseconds>(end - start)
.count();
// std::cout << elapsed <<"ms"<< std::endl;
return 0;
}
| [
"call.arguments.change"
] | 777,703 | 777,704 | u852449189 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<int, vector<int>, greater<int>>
spqint; //小さい順に取り出し
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll; //小さい順に取り出し
typedef priority_queue<int, vector<int>, less<int>> bpqint; //大きい順に取り出し
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll; //大きい順に取り出し
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); i++)
#define FI first
#define SE second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define TS to_string
#define BS binary_search
#define LB lower_bound
#define UB upper_bound
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) (ll) x.size()
#define SP(x) setprecision((ll)x)
int INF = 1e9;
int NIL = -1;
ll MOD = 1000000007;
ll LINF = 1e18;
double EPS = 1e-9;
double PI = M_PI;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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; } //最小公倍数
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
//-----------------------------------------
vector<long long> factor_array(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n) {
res.push_back(n / i);
}
}
}
sort(res.begin(), res.end());
return res;
}
//-----------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::chrono::system_clock::time_point start, end;
start = std::chrono::system_clock::now();
int n;
cin >> n;
vint a(n + 1);
REP(i, n) { cin >> a[i + 1]; }
vint cnt(n + 1, 0);
set<int> ans;
for (int i = n; i > 0; i--) {
if (cnt[i] % 2 != a[i]) {
ans.insert(a[i]);
vll b = factor_array(a[i]);
REP(j, SZ(b)) { cnt[b[j]]++; }
}
}
cout << SZ(ans) << endl;
IREP(i, ans) { cout << (*i) << " "; }
cout << endl;
end = std::chrono::system_clock::now();
auto elapsed =
std::chrono::duration_cast<std::chrono::milliseconds>(end - start)
.count();
// std::cout << elapsed <<"ms"<< std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<int, vector<int>, greater<int>>
spqint; //小さい順に取り出し
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll; //小さい順に取り出し
typedef priority_queue<int, vector<int>, less<int>> bpqint; //大きい順に取り出し
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll; //大きい順に取り出し
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); i++)
#define FI first
#define SE second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define TS to_string
#define BS binary_search
#define LB lower_bound
#define UB upper_bound
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) (ll) x.size()
#define SP(x) setprecision((ll)x)
int INF = 1e9;
int NIL = -1;
ll MOD = 1000000007;
ll LINF = 1e18;
double EPS = 1e-9;
double PI = M_PI;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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; } //最小公倍数
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
//-----------------------------------------
vector<long long> factor_array(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n) {
res.push_back(n / i);
}
}
}
sort(res.begin(), res.end());
return res;
}
//-----------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::chrono::system_clock::time_point start, end;
start = std::chrono::system_clock::now();
int n;
cin >> n;
vint a(n + 1);
REP(i, n) { cin >> a[i + 1]; }
vint cnt(n + 1, 0);
set<int> ans;
for (int i = n; i > 0; i--) {
if (cnt[i] % 2 != a[i]) {
ans.insert(i);
vll b = factor_array(i);
REP(j, SZ(b)) { cnt[b[j]]++; }
}
}
cout << SZ(ans) << endl;
IREP(i, ans) { cout << (*i) << " "; }
cout << endl;
end = std::chrono::system_clock::now();
auto elapsed =
std::chrono::duration_cast<std::chrono::milliseconds>(end - start)
.count();
// std::cout << elapsed <<"ms"<< std::endl;
return 0;
}
| [
"call.arguments.change"
] | 777,705 | 777,704 | u852449189 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<bool> ball(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int m = 0;
vector<int> b;
for (int i = n; i >= 1; i--) {
int j = 2;
int now = 0;
while (i * j <= n) {
if (ball[i * j])
now++;
j++;
}
if (now % 2 != a[i]) {
m++;
b.push_back(a[i]);
}
}
cout << m << endl;
for (int i = 0; i < m; i++)
cout << b[i] << " ";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<bool> ball(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int m = 0;
vector<int> b;
for (int i = n; i >= 1; i--) {
int j = 2;
int now = 0;
while (i * j <= n) {
if (ball[i * j])
now++;
j++;
}
if (now % 2 != a[i]) {
m++;
b.push_back(i);
ball[i] = true;
}
}
cout << m << endl;
for (int i = 0; i < m; i++)
cout << b[i] << " ";
}
| [
"call.arguments.change",
"call.add"
] | 777,706 | 777,707 | u105533331 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
ll num[200010] = {0};
int main(void) {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n + 1), c;
for (ll i = 0; i < n; i++)
cin >> a[i + 1];
for (ll i = n; i >= 1; i--) {
if (num[i] % 2 == 0) {
if (a[i] == 0)
b[i] = 0;
else {
b[i] = 1;
for (ll j = 1; j <= (ll)sqrt(i); j++) {
if (i % j == 0) {
num[j]++;
if (j == i / j)
continue;
num[i / j]++;
}
}
}
} else {
if (a[i] == 1)
b[i] = 0;
else {
b[i] = 1;
for (ll j = 1; j <= (ll)sqrt(i); j++) {
if (i % j == 0) {
num[j]++;
if (j == i / j)
continue;
num[i / j]++;
}
}
}
}
}
for (ll i = 1; i <= n; i++) {
if (b[i])
c.push_back(b[i]);
}
if ((ll)c.size() == 0) {
cout << 0 << endl;
return 0;
}
cout << (ll)c.size() << endl;
for (ll i = 0; i < (ll)c.size(); i++) {
if (i == (ll)c.size() - 1)
cout << c[i] << endl;
else
cout << c[i] << " ";
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
ll num[200010] = {0};
int main(void) {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n + 1), c;
for (ll i = 0; i < n; i++)
cin >> a[i + 1];
for (ll i = n; i >= 1; i--) {
if (num[i] % 2 == 0) {
if (a[i] == 0)
b[i] = 0;
else {
b[i] = 1;
for (ll j = 1; j <= (ll)sqrt(i); j++) {
if (i % j == 0) {
num[j]++;
if (j == i / j)
continue;
num[i / j]++;
}
}
}
} else {
if (a[i] == 1)
b[i] = 0;
else {
b[i] = 1;
for (ll j = 1; j <= (ll)sqrt(i); j++) {
if (i % j == 0) {
num[j]++;
if (j == i / j)
continue;
num[i / j]++;
}
}
}
}
}
for (ll i = 1; i <= n; i++) {
if (b[i])
c.push_back(i);
}
if ((ll)c.size() == 0) {
cout << 0 << endl;
return 0;
}
cout << (ll)c.size() << endl;
for (ll i = 0; i < (ll)c.size(); i++) {
if (i == (ll)c.size() - 1)
cout << c[i] << endl;
else
cout << c[i] << " ";
}
return 0;
} | [
"call.arguments.change"
] | 777,719 | 777,720 | u744305661 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll N;
cin >> N;
vll a(N + 1);
rep(i, N) cin >> a[i + 1];
vll ans(N + 1, 0);
ll cnt = 0;
for (ll i = N; i >= 1; i--) {
ll sum = 0;
for (ll k = N / i; k > 1; k--)
sum += ans[i * k];
if (sum % 2 == a[i])
ans[i] = 0;
else
ans[i] = 1, cnt++;
}
if (cnt == 0) {
cout << 0 << endl;
return 0;
}
cout << cnt << endl;
rep(i, N) if (a[i + 1] == 1) cout << i + 1 << " ";
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll N;
cin >> N;
vll a(N + 1);
rep(i, N) cin >> a[i + 1];
vll ans(N + 1, 0);
ll cnt = 0;
for (ll i = N; i >= 1; i--) {
ll sum = 0;
for (ll k = N / i; k > 1; k--)
sum += ans[i * k];
if (sum % 2 == a[i])
ans[i] = 0;
else
ans[i] = 1, cnt++;
}
if (cnt == 0) {
cout << 0 << endl;
return 0;
}
cout << cnt << endl;
rep(i, N) if (ans[i + 1] == 1) cout << i + 1 << " ";
cout << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,721 | 777,722 | u318785595 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m = 0;
cin >> n;
vector<ll> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<ll> b(n + 1);
for (int i = n; i >= 1; i--) {
ll count = 0;
for (int j = i; j <= n; j += i) {
count += b[j];
}
if (count % 2 != a[i])
b[i] = 1;
}
for (int i = 1; i <= n; i++)
m += a[i];
cout << m << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << i << " ";
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m = 0;
cin >> n;
vector<ll> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<ll> b(n + 1);
for (int i = n; i >= 1; i--) {
ll count = 0;
for (int j = i; j <= n; j += i) {
count += b[j];
}
if (count % 2 != a[i])
b[i] = 1;
}
for (int i = 1; i <= n; i++)
m += b[i];
cout << m << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << i << " ";
}
}
| [
"assignment.value.change",
"identifier.change"
] | 777,725 | 777,726 | u028906014 | cpp |
p02972 | // #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <cstring>
// #include <algorithm>
// #include <string>
// #include <sstream>
// #include <complex>
// #include <vector>
// #include <list>
// #include <queue>
// #include <deque>
// #include <stack>
// #include <map>
// #include <set>
// #include <functional>
// #include <iomanip>
// #include <limits>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^18
typedef unsigned long ul;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
#define WALL '#'
//#define and &&
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (int i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (int i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (int i = m; i < n; i++) // from m to n
#define FORR(i, m, n) for (int i = m; i >= n; i--) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
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;
}
vector<ll> dy = {0, 0, -1, 1, 0};
vector<ll> dx = {-1, 1, 0, 0, 0};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
vector<ll> INV(ll n) {
vector<ll> v(n);
REP(i, n)
cin >> v[i];
return v;
}
// n個のデータをvectorで取得
vector<vector<ll>> INV2(ll n, ll m) {
vector<vector<ll>> v(n, vector<ll>(m));
REP(i, n) {
REP(j, m) { cin >> v[i][j]; }
}
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
ll bs(vector<ll> &v, ll key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 素数判定
bool is_prime(ll n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
vector<ll> prime_factorization(ll n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
// 迷路のマップ情報をベクトル化する
// 通れるところを0に、壁を-1にする
// スタート地点からの距離を格納するときなどに使う
vector<vector<ll>> map_vec(vector<string> &str) {
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str), vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))]),
(int)INF));
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
v[i][j] = -1;
// else v[i][j] = INF; // if (str[i][j] == '.')
}
}
return v;
}
// str中のWALL='#'の数を数える
ll cnt_wall(vector<string> str) {
ll cnt = 0;
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
cnt++;
}
}
return cnt;
}
// 迷路用幅優先探索
// フィールドの広さと壁の位置を受け取り、ゴールへの最短距離を返す
ll bfs_maze(vector<string> &str, ll s_y, ll s_x, ll g_y, ll g_x) {
struct Corr {
ll y;
ll x;
ll depth;
};
queue<Corr> que;
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str),
vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))])));
v = map_vec(str);
que.push({s_y, s_x, 1});
while (!que.empty()) {
Corr now = que.front();
que.pop();
if (now.y == g_y && now.x == g_x)
break;
REP(i, 4) {
Corr next = {now.y + dy[i], now.x + dx[i], now.depth + 1};
// SZ(v[0] = SZ(v[distance(v.begin(), max_element(ALL(v)))])
if (0 <= (int)next.y && (int)next.y < SZ(v) && 0 <= (int)next.x &&
(int)next.x < SZ(v[distance(v.begin(), max_element(ALL(v)))]) &&
v[(int)next.y][(int)next.x] == INF) {
v[(int)next.y][(int)next.x] = next.depth;
que.push(next);
}
}
}
return v[(int)g_y][(int)g_x];
}
// 累積和
vector<ll> cumulative_sum(vector<ll> a) {
vector<ll> v(SZ(a) + 1);
v[0] = 0;
REP(i, SZ(a)) { v[i + 1] = v[i] + a[i]; }
return v;
}
// 文字列を連続した文字ごとに分解
vector<pair<char, ll>> decompose_str(string s) {
vector<pair<char, ll>> moji_cnt;
moji_cnt.pb(mp(s[0], 0));
REP(i, SZ(s)) {
if (moji_cnt.back().first == s[i]) {
moji_cnt.back().second++;
} else {
moji_cnt.pb(mp(s[i], 1));
}
}
return moji_cnt;
}
// 解答のベクトル出力(空白区切り)
void ans_vec(vector<ll> ans) {
REP(i, SZ(ans)) { cout << ans[i] << " "; }
}
//
void dinamic_programming(void) {}
// 総和の公式：Σk
ll totalSumFirst(ll x, ll y) {
x = x - 1;
return (y * (y + 1) - x * (x + 1)) / 2;
}
// 総和の公式：Σk^2
ll totalSumSecond(ll x, ll y) {
x = x - 1;
return (y * (y + 1) * (2 * y + 1) - x * (x + 1) * (2 * x + 1)) / 6;
}
// 総和の公式：Σk^3
ll totalSumThird(ll x, ll y) { return pow(totalSumFirst(x, y), 2); }
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
ll n;
cin >> n;
// 変数（vector）取得
vector<ll> a(n);
a = INV(n);
////m=2;
// vector<vector<ll>> vec(n, vector<ll>(m));
// vec = INV2(n, m);
// vector<vector<ll>> a(3);
// REP(i, a)
// {
// ll tmp;
// cin >> tmp;
// a[0].pb(tmp);
// }
// REP(i, b)
// {
// ll tmp;
// cin >> tmp;
// a[1].pb(tmp);
// }
// REP(i, c)
// {
// ll tmp;
// cin >> tmp;
// a[2].pb(tmp);
// }
// 文字列取得
// string s;
// cin >> s;
// 文字列（vector）取得
// vector<string> str((int)a);
// REP(i, a) {
// cin >> str[i];
//}
//
// 実装部分
//
ll m;
vector<ll> ans(n);
for (ll i = n; i > 0; i--) {
ll j = 1;
ll count = 0;
while (i * j < n) {
count += a[i * j];
j++;
}
if (count % 2 == a[i - 1]) {
ans[i - 1] = 0;
} else {
ans[i - 1] = 1;
}
}
m = accumulate(ALL(ans), 0);
cout << m << endl;
REP(i, n) {
if (ans[i] == 1) {
cout << i + 1 << " ";
}
}
cout << endl;
//
// 実装部分おわり
//
// 解答出力
// cout << fixed << setprecision(15);
// MSG(m);
// ans_vec(ans);
return 0;
}
| // #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <cstring>
// #include <algorithm>
// #include <string>
// #include <sstream>
// #include <complex>
// #include <vector>
// #include <list>
// #include <queue>
// #include <deque>
// #include <stack>
// #include <map>
// #include <set>
// #include <functional>
// #include <iomanip>
// #include <limits>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^18
typedef unsigned long ul;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
#define WALL '#'
//#define and &&
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (int i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (int i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (int i = m; i < n; i++) // from m to n
#define FORR(i, m, n) for (int i = m; i >= n; i--) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
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;
}
vector<ll> dy = {0, 0, -1, 1, 0};
vector<ll> dx = {-1, 1, 0, 0, 0};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
vector<ll> INV(ll n) {
vector<ll> v(n);
REP(i, n)
cin >> v[i];
return v;
}
// n個のデータをvectorで取得
vector<vector<ll>> INV2(ll n, ll m) {
vector<vector<ll>> v(n, vector<ll>(m));
REP(i, n) {
REP(j, m) { cin >> v[i][j]; }
}
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
ll bs(vector<ll> &v, ll key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 素数判定
bool is_prime(ll n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
vector<ll> prime_factorization(ll n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
// 迷路のマップ情報をベクトル化する
// 通れるところを0に、壁を-1にする
// スタート地点からの距離を格納するときなどに使う
vector<vector<ll>> map_vec(vector<string> &str) {
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str), vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))]),
(int)INF));
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
v[i][j] = -1;
// else v[i][j] = INF; // if (str[i][j] == '.')
}
}
return v;
}
// str中のWALL='#'の数を数える
ll cnt_wall(vector<string> str) {
ll cnt = 0;
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
cnt++;
}
}
return cnt;
}
// 迷路用幅優先探索
// フィールドの広さと壁の位置を受け取り、ゴールへの最短距離を返す
ll bfs_maze(vector<string> &str, ll s_y, ll s_x, ll g_y, ll g_x) {
struct Corr {
ll y;
ll x;
ll depth;
};
queue<Corr> que;
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str),
vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))])));
v = map_vec(str);
que.push({s_y, s_x, 1});
while (!que.empty()) {
Corr now = que.front();
que.pop();
if (now.y == g_y && now.x == g_x)
break;
REP(i, 4) {
Corr next = {now.y + dy[i], now.x + dx[i], now.depth + 1};
// SZ(v[0] = SZ(v[distance(v.begin(), max_element(ALL(v)))])
if (0 <= (int)next.y && (int)next.y < SZ(v) && 0 <= (int)next.x &&
(int)next.x < SZ(v[distance(v.begin(), max_element(ALL(v)))]) &&
v[(int)next.y][(int)next.x] == INF) {
v[(int)next.y][(int)next.x] = next.depth;
que.push(next);
}
}
}
return v[(int)g_y][(int)g_x];
}
// 累積和
vector<ll> cumulative_sum(vector<ll> a) {
vector<ll> v(SZ(a) + 1);
v[0] = 0;
REP(i, SZ(a)) { v[i + 1] = v[i] + a[i]; }
return v;
}
// 文字列を連続した文字ごとに分解
vector<pair<char, ll>> decompose_str(string s) {
vector<pair<char, ll>> moji_cnt;
moji_cnt.pb(mp(s[0], 0));
REP(i, SZ(s)) {
if (moji_cnt.back().first == s[i]) {
moji_cnt.back().second++;
} else {
moji_cnt.pb(mp(s[i], 1));
}
}
return moji_cnt;
}
// 解答のベクトル出力(空白区切り)
void ans_vec(vector<ll> ans) {
REP(i, SZ(ans)) { cout << ans[i] << " "; }
}
//
void dinamic_programming(void) {}
// 総和の公式：Σk
ll totalSumFirst(ll x, ll y) {
x = x - 1;
return (y * (y + 1) - x * (x + 1)) / 2;
}
// 総和の公式：Σk^2
ll totalSumSecond(ll x, ll y) {
x = x - 1;
return (y * (y + 1) * (2 * y + 1) - x * (x + 1) * (2 * x + 1)) / 6;
}
// 総和の公式：Σk^3
ll totalSumThird(ll x, ll y) { return pow(totalSumFirst(x, y), 2); }
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
ll n;
cin >> n;
// 変数（vector）取得
vector<ll> a(n);
a = INV(n);
////m=2;
// vector<vector<ll>> vec(n, vector<ll>(m));
// vec = INV2(n, m);
// vector<vector<ll>> a(3);
// REP(i, a)
// {
// ll tmp;
// cin >> tmp;
// a[0].pb(tmp);
// }
// REP(i, b)
// {
// ll tmp;
// cin >> tmp;
// a[1].pb(tmp);
// }
// REP(i, c)
// {
// ll tmp;
// cin >> tmp;
// a[2].pb(tmp);
// }
// 文字列取得
// string s;
// cin >> s;
// 文字列（vector）取得
// vector<string> str((int)a);
// REP(i, a) {
// cin >> str[i];
//}
//
// 実装部分
//
ll m;
vector<ll> ans(n);
for (ll i = n; i > 0; i--) {
ll j = 2;
ll count = 0;
while (i * j <= n) {
count += ans[i * j - 1];
j++;
}
if (count % 2 == a[i - 1]) {
ans[i - 1] = 0;
} else {
ans[i - 1] = 1;
}
}
m = accumulate(ALL(ans), 0);
cout << m << endl;
REP(i, n) {
if (ans[i] == 1) {
cout << i + 1 << " ";
}
}
cout << endl;
//
// 実装部分おわり
//
// 解答出力
// cout << fixed << setprecision(15);
// MSG(m);
// ans_vec(ans);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change",
"assignment.change"
] | 777,727 | 777,728 | u337845373 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll count = 0;
for (ll j = 1; j < N / i; j++) {
if (i * j <= N)
count += balls[i * j - 1];
}
if (count % 2 != a[i - 1]) {
balls[i - 1] = 1;
good.push_back(i);
}
}
cout << good.size() << endl;
for (auto &i : good)
cout << i << ' ';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll count = 0;
for (ll j = 1; j < N / i + 1; j++) {
if (i * j <= N)
count += balls[i * j - 1];
}
if (count % 2 != a[i - 1]) {
balls[i - 1] = 1;
good.push_back(i);
}
}
cout << good.size() << endl;
for (auto &i : good)
cout << i << ' ';
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 777,731 | 777,732 | u196953553 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll count = 0;
for (ll j = 1; j < N / i; j++) {
if (j <= N)
count += balls[i * j - 1];
}
if (count % 2 != a[i - 1]) {
balls[i - 1] = 1;
good.push_back(i);
}
}
cout << good.size() << endl;
for (auto &i : good)
cout << i << ' ';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll count = 0;
for (ll j = 1; j < N / i + 1; j++) {
if (i * j <= N)
count += balls[i * j - 1];
}
if (count % 2 != a[i - 1]) {
balls[i - 1] = 1;
good.push_back(i);
}
}
cout << good.size() << endl;
for (auto &i : good)
cout << i << ' ';
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 777,733 | 777,732 | u196953553 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll count = 0;
for (ll j = 1; j < N / i + 1; j++) {
if (j <= N)
count += balls[j - 1];
}
if (count % 2 != a[i - 1]) {
balls[i - 1] = 1;
good.push_back(i);
}
}
cout << good.size() << endl;
for (auto &i : good)
cout << i << ' ';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll count = 0;
for (ll j = 1; j < N / i + 1; j++) {
if (i * j <= N)
count += balls[i * j - 1];
}
if (count % 2 != a[i - 1]) {
balls[i - 1] = 1;
good.push_back(i);
}
}
cout << good.size() << endl;
for (auto &i : good)
cout << i << ' ';
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 777,734 | 777,732 | u196953553 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll count = 0;
for (ll j = 1; j < N / i; j++) {
if (j <= N)
count += balls[j - 1];
}
if (count % 2 != a[i - 1]) {
balls[i - 1] = 1;
good.push_back(i);
}
}
cout << good.size() << endl;
for (auto &i : good)
cout << i << ' ';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N;
vector<ll> a;
vector<ll> good;
vector<ll> balls;
cin >> N;
a.resize(N);
balls.resize(N, 0);
for (ll i = 0; i < N; i++)
cin >> a[i];
for (ll i = N; i >= 1; i--) {
ll count = 0;
for (ll j = 1; j < N / i + 1; j++) {
if (i * j <= N)
count += balls[i * j - 1];
}
if (count % 2 != a[i - 1]) {
balls[i - 1] = 1;
good.push_back(i);
}
}
cout << good.size() << endl;
for (auto &i : good)
cout << i << ' ';
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 777,735 | 777,732 | u196953553 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long long;
using P = pair<ll, ll>;
using Pl = pair<ll, ll>;
using vi = vector<ll>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
using vb = vector<bool>;
using vc = vector<char>;
using vcc = vector<vc>;
const ll dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const ll dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll &a, const ll &b) { return ((a) + (b)-1) / b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
vi ans(n);
ll m = 0;
for (ll i = n - 1; i >= 0; i--) {
ll sum = 0;
for (ll j = 2; (i + 1) * j < n; j++) {
sum += ans[(i + 1) * j - 1];
}
sum %= 2;
if (sum != a[i]) {
m++;
ans[i]++;
}
}
cout << m << endl;
rep(i, n) {
if (ans[i])
cout << i + 1 << ' ';
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long long;
using P = pair<ll, ll>;
using Pl = pair<ll, ll>;
using vi = vector<ll>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
using vb = vector<bool>;
using vc = vector<char>;
using vcc = vector<vc>;
const ll dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const ll dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll &a, const ll &b) { return ((a) + (b)-1) / b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
vi ans(n);
ll m = 0;
for (ll i = n - 1; i >= 0; i--) {
ll sum = 0;
for (ll j = 2; (i + 1) * j <= n; j++) {
sum += ans[(i + 1) * j - 1];
}
sum %= 2;
if (sum != a[i]) {
m++;
ans[i]++;
}
}
cout << m << endl;
rep(i, n) {
if (ans[i])
cout << i + 1 << ' ';
}
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,736 | 777,737 | u363936720 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long long;
using P = pair<ll, ll>;
using Pl = pair<ll, ll>;
using vi = vector<ll>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
using vb = vector<bool>;
using vc = vector<char>;
using vcc = vector<vc>;
const ll dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const ll dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll &a, const ll &b) { return ((a) + (b)-1) / b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
vi ans(n);
ll m = 0;
for (ll i = n - 1; i >= 0; i--) {
ll sum = 0;
for (ll j = 2; (i + 1) * j < n; j++) {
sum += a[(i + 1) * j - 1];
}
sum %= 2;
if (sum != a[i]) {
m++;
ans[i]++;
}
}
cout << m << endl;
rep(i, n) {
if (ans[i])
cout << i + 1 << ' ';
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long long;
using P = pair<ll, ll>;
using Pl = pair<ll, ll>;
using vi = vector<ll>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
using vb = vector<bool>;
using vc = vector<char>;
using vcc = vector<vc>;
const ll dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const ll dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll &a, const ll &b) { return ((a) + (b)-1) / b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
vi ans(n);
ll m = 0;
for (ll i = n - 1; i >= 0; i--) {
ll sum = 0;
for (ll j = 2; (i + 1) * j <= n; j++) {
sum += ans[(i + 1) * j - 1];
}
sum %= 2;
if (sum != a[i]) {
m++;
ans[i]++;
}
}
cout << m << endl;
rep(i, n) {
if (ans[i])
cout << i + 1 << ' ';
}
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 777,738 | 777,737 | u363936720 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long long;
using P = pair<ll, ll>;
using Pl = pair<ll, ll>;
using vi = vector<ll>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
using vb = vector<bool>;
using vc = vector<char>;
using vcc = vector<vc>;
const ll dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const ll dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll &a, const ll &b) { return ((a) + (b)-1) / b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
vi ans(n);
ll m = 0;
for (ll i = n - 1; i >= 0; i--) {
ll sum = 0;
for (int j = 2; (i + 1) * j < n; j++) {
sum += a[(i + 1) * j - 1];
}
sum %= 2;
if (sum != a[i]) {
m++;
ans[i]++;
}
}
cout << m << endl;
rep(i, n) {
if (ans[i])
cout << i + 1 << ' ';
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
using ll = long long;
using P = pair<ll, ll>;
using Pl = pair<ll, ll>;
using vi = vector<ll>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
using vb = vector<bool>;
using vc = vector<char>;
using vcc = vector<vc>;
const ll dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const ll dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll &a, const ll &b) { return ((a) + (b)-1) / b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
vi ans(n);
ll m = 0;
for (ll i = n - 1; i >= 0; i--) {
ll sum = 0;
for (ll j = 2; (i + 1) * j <= n; j++) {
sum += ans[(i + 1) * j - 1];
}
sum %= 2;
if (sum != a[i]) {
m++;
ans[i]++;
}
}
cout << m << endl;
rep(i, n) {
if (ans[i])
cout << i + 1 << ' ';
}
} | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 777,739 | 777,737 | u363936720 | cpp |
p02972 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
typedef long long ll;
template <typename T> void print(const T &v);
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
rep(i, N) cin >> a[i + 1];
vector<int> b = a;
for (int i = N / 2; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= N; j += i) {
if (b[j] == 1) {
cnt++;
}
}
if (cnt % 2 == a[i]) {
b[i] = a[i];
} else {
a[i] = (a[i] + 1) % 2;
}
}
int m = 0;
vector<int> ans;
for (int i = 1; i <= N; i++) {
if (b[i]) {
ans.emplace_back(i);
m++;
}
}
cout << m << endl;
print(ans);
return 0;
}
// Use For Debug
template <typename T> void print(T const &v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
typedef long long ll;
template <typename T> void print(const T &v);
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
rep(i, N) cin >> a[i + 1];
vector<int> b = a;
for (int i = N / 2; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= N; j += i) {
if (b[j] == 1) {
cnt++;
}
}
if (cnt % 2 == a[i]) {
b[i] = a[i];
} else {
b[i] = (a[i] + 1) % 2;
}
}
int m = 0;
vector<int> ans;
for (int i = 1; i <= N; i++) {
if (b[i]) {
ans.emplace_back(i);
m++;
}
}
cout << m << endl;
print(ans);
return 0;
}
// Use For Debug
template <typename T> void print(T const &v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
| [
"assignment.variable.change",
"identifier.change"
] | 777,742 | 777,743 | u286623856 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >> a[i]; }
int ans = 0;
int z = 0;
vector<int> m(n + 1);
IFOR(i, 1, n + 1) {
int mod = a[i - 1];
int x = i + i;
while (x < n + 1) {
mod ^= m[x];
x += i;
}
m[i] = mod;
// cout << i<<" "<<mod << "\n";
z = m[i];
}
cout << z << "\n";
FOR(i, 1, n + 1)
if (m[i]) {
cout << m[i] << " ";
cout << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >> a[i]; }
int ans = 0;
int z = 0;
vector<int> m(n + 1);
IFOR(i, 1, n + 1) {
int mod = a[i - 1];
int x = i + i;
while (x < n + 1) {
mod ^= m[x];
x += i;
}
m[i] = mod;
// cout << i<<" "<<mod << "\n";
z += m[i];
}
cout << z << "\n";
FOR(i, 1, n + 1)
if (m[i]) {
cout << i << " ";
cout << "\n";
}
return 0;
} | [
"assignment.value.change"
] | 777,744 | 777,745 | u517411077 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007; //出力は (ans % mod + mod) % mod (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60; // INF = 1152921504606846976
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int ans[n];
for (int i = n; i > 0; i--) {
int tmp = i;
int cnt = 0;
if (i > n / 2) {
ans[i - 1] = a[i - 1];
} else {
while (tmp <= n) {
tmp += i;
if (tmp <= n)
cnt += ans[tmp - 1];
}
// if(i == 3) cout << cnt << endl;
}
ans[i - 1] = (cnt - a[i - 1] + 2) % 2;
}
int k = 0;
rep(i, n) if (a[i]) k++;
cout << k << endl;
rep(i, n) if (a[i]) cout << i + 1 << ' ';
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007; //出力は (ans % mod + mod) % mod (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60; // INF = 1152921504606846976
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int ans[n];
for (int i = n; i > 0; i--) {
int tmp = i;
int cnt = 0;
if (i > n / 2) {
ans[i - 1] = a[i - 1];
} else {
while (tmp <= n) {
tmp += i;
if (tmp <= n)
cnt += ans[tmp - 1];
}
// if(i == 3) cout << cnt << endl;
}
ans[i - 1] = (cnt - a[i - 1] + 2) % 2;
}
int k = 0;
rep(i, n) if (ans[i]) k++;
cout << k << endl;
rep(i, n) if (ans[i]) cout << i + 1 << ' ';
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,752 | 777,753 | u883323885 | cpp |
p02972 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int inf = 1 << 20;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1];
int cnt = 0;
for (int i = 1; i < n + 1; 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[i];
}
b[i] = a[i] - sum;
if (b[i] != 0) {
b[i] = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (b[i] > 0)
cout << i << ' ';
}
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int inf = 1 << 20;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1];
int cnt = 0;
for (int i = 1; i < n + 1; 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];
}
sum %= 2;
b[i] = a[i] - sum;
if (b[i] != 0) {
b[i] = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (b[i] > 0)
cout << i << ' ';
}
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.add"
] | 777,756 | 777,755 | u883323885 | cpp |
p02972 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9 + 1;
const ll INFll = 2e18 + 1;
ll MOD = 1e9 + 7;
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 cnt(0);
for (int i(N); i >= 1; i--) {
int tmp(i);
int tmpi(0);
while (N >= tmp) {
tmpi += ans[tmp];
tmp *= 2;
}
// cout << tmpi << endl;
if (A[i] != tmpi % 2) {
ans[i] = 1;
cnt++;
} else
ans[i] = 0;
}
cout << cnt << endl;
for (int i(1); i <= N; i++) {
if (ans[i])
cout << i << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9 + 1;
const ll INFll = 2e18 + 1;
ll MOD = 1e9 + 7;
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 cnt(0);
for (int i(N); i >= 1; i--) {
int tmp(i);
int tmpi(0);
while (N >= tmp) {
tmpi += ans[tmp];
tmp += i;
}
// cout << tmpi << endl;
if (A[i] != tmpi % 2) {
ans[i] = 1;
cnt++;
} else
ans[i] = 0;
}
cout << cnt << endl;
for (int i(1); i <= N; i++) {
if (ans[i])
cout << i << " ";
}
cout << endl;
return 0;
} | [
"assignment.change"
] | 777,757 | 777,758 | u991846372 | cpp |
p02972 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
int main() {
int N;
ll a[200001];
ll b[200001];
int cnt(0);
cin >> N;
for (int i(1); i <= N; i++)
cin >> b[i];
for (int i(N / 2 + 1); i <= N; i++) {
a[i] = b[i];
if (a[i] == 1)
cnt += 1;
}
for (int i(N / 2); i > 0; i--) {
// a[i] is needed
int sum(0);
for (int j(2); j * i <= N; j += i) {
sum += a[j];
}
// cout <<sum << " " << b[i] << endl;
if (sum % 2 == b[i])
a[i] = 0;
else {
a[i] = 1;
cnt += 1;
}
}
cout << cnt << endl;
for (int i(1); i <= N; i++) {
if (a[i] == 1) {
cout << i << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
int main() {
int N;
ll a[300001];
ll b[300001];
int cnt(0);
cin >> N;
for (int i(1); i <= N; i++)
cin >> b[i];
for (int i(N / 2 + 1); i <= N; i++) {
a[i] = b[i];
if (a[i] == 1)
cnt += 1;
}
for (int i(N / 2); i > 0; i--) {
// a[i] is needed
int sum(0);
for (int j(i * 2); j <= N; j += i) {
sum += a[j];
}
// cout <<sum << " " << b[i] << endl;
if (sum % 2 == b[i])
a[i] = 0;
else {
a[i] = 1;
cnt += 1;
}
}
cout << cnt << endl;
for (int i(1); i <= N; i++) {
if (a[i] == 1) {
cout << i << endl;
}
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 777,759 | 777,760 | u991846372 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1000000007;
const ll mod = 1000000007;
const double PI = 3.14159265358979323846;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
// ll memo[2020][2020];
// int pascal_triangle(){
// for(int i = 0; i < 1000; i++){
// for(int j = 0; j < i+1; j++){
// if(j == 0 || j == i) memo[i][j] = 1;
// else{
// memo[i][j] = (memo[i-1][j-1]+memo[i-1][j])%mod;
// }
// }
// }
// return 0;
// }
// int factorial(int n){
// if(n == 0) return 1;
// return n*factorial(n-1);
// }
// int divisor(int a){
// int cnt = 0;
// for(int i=1; i <= a; i++) if(a%i == 0) cnt++;
// return cnt;
// }
// int comb(int n, int k){
// pascal_triangle();
// return memo[n][k];
// }
int cans(bool f) {
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
//二項係数(mod剰余)----------------------------
// const int MAX = 3000010;
// const int M = 1000000007;
// vector<ll> fac(MAX); //n!(mod M)
// //a,bの範囲的にこれだけ配列を用意していけば十分
// vector<ll> ifac(MAX); //k!^{M-2} (mod M)
// ll mpow(ll x, ll n){ //x^n(mod M)
// ←普通にpow(x,n)では溢れてしまうため，随時mod計算
// ll ans = 1;
// while(n != 0){
// if(n&1) ans = ans*x % M;
// x = x*x % M;
// n = n >> 1;
// }
// return ans;
// }
// ll COMinit(){
// //大した量ではないので，先にfax[i]とifax[i]を全て計算しておく
// fac[0] = 1;
// ifac[0] = 1;
// for(ll i = 0; i<MAX; i++){
// fac[i+1] = fac[i]*(i+1) % M; // n!(mod M)
// ifac[i+1] = ifac[i]*mpow(i+1, M-2) % M; // k!^{M-2} (mod M)
// ←累乗にmpowを採用
// }
// return 0;
// }
// ll COM(ll a, ll b){ //aCbをmod計算
// if(a == 0 && b == 0)return 1;
// if(a < b || a < 0)return 0;
// ll tmp = ifac[a-b]* ifac[b] % M;
// return tmp * fac[a] % M;
// }
//-----------------------------------------
int b[1000000];
int main() {
int N;
cin >> N;
int a[N + 1];
rep(i, N) cin >> a[i + 1];
for (int i = N; i > 0; i--) {
int cnt = N / i;
int sum = 0;
rep(j, cnt) {
sum += b[(j + 1) * i];
sum %= 2;
}
if (sum == a[i])
b[i] = 0;
else
b[i] = 1;
}
vector<int> v;
int ans = 0;
rep(i, N) if (b[i]) {
ans++;
v.push_back(i);
}
cout << ans << endl;
if (ans) {
rep(i, N) {
if (b[i + 1])
cout << i + 1 << " ";
}
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1000000007;
const ll mod = 1000000007;
const double PI = 3.14159265358979323846;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
// ll memo[2020][2020];
// int pascal_triangle(){
// for(int i = 0; i < 1000; i++){
// for(int j = 0; j < i+1; j++){
// if(j == 0 || j == i) memo[i][j] = 1;
// else{
// memo[i][j] = (memo[i-1][j-1]+memo[i-1][j])%mod;
// }
// }
// }
// return 0;
// }
// int factorial(int n){
// if(n == 0) return 1;
// return n*factorial(n-1);
// }
// int divisor(int a){
// int cnt = 0;
// for(int i=1; i <= a; i++) if(a%i == 0) cnt++;
// return cnt;
// }
// int comb(int n, int k){
// pascal_triangle();
// return memo[n][k];
// }
int cans(bool f) {
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
//二項係数(mod剰余)----------------------------
// const int MAX = 3000010;
// const int M = 1000000007;
// vector<ll> fac(MAX); //n!(mod M)
// //a,bの範囲的にこれだけ配列を用意していけば十分
// vector<ll> ifac(MAX); //k!^{M-2} (mod M)
// ll mpow(ll x, ll n){ //x^n(mod M)
// ←普通にpow(x,n)では溢れてしまうため，随時mod計算
// ll ans = 1;
// while(n != 0){
// if(n&1) ans = ans*x % M;
// x = x*x % M;
// n = n >> 1;
// }
// return ans;
// }
// ll COMinit(){
// //大した量ではないので，先にfax[i]とifax[i]を全て計算しておく
// fac[0] = 1;
// ifac[0] = 1;
// for(ll i = 0; i<MAX; i++){
// fac[i+1] = fac[i]*(i+1) % M; // n!(mod M)
// ifac[i+1] = ifac[i]*mpow(i+1, M-2) % M; // k!^{M-2} (mod M)
// ←累乗にmpowを採用
// }
// return 0;
// }
// ll COM(ll a, ll b){ //aCbをmod計算
// if(a == 0 && b == 0)return 1;
// if(a < b || a < 0)return 0;
// ll tmp = ifac[a-b]* ifac[b] % M;
// return tmp * fac[a] % M;
// }
//-----------------------------------------
int b[1000000];
int main() {
int N;
cin >> N;
int a[N + 1];
rep(i, N) cin >> a[i + 1];
for (int i = N; i > 0; i--) {
int cnt = N / i;
int sum = 0;
rep(j, cnt) {
sum += b[(j + 1) * i];
sum %= 2;
}
if (sum == a[i])
b[i] = 0;
else
b[i] = 1;
}
vector<int> v;
int ans = 0;
rep(i, N + 1) if (b[i]) {
ans++;
v.push_back(i);
}
cout << ans << endl;
if (ans) {
rep(i, N) {
if (b[i + 1])
cout << i + 1 << " ";
}
}
return 0;
}
| [
"expression.operation.binary.add"
] | 777,763 | 777,764 | u950174376 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
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;
}
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 200005;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (auto &i : a)
cin >> i;
vector<int> box(N);
repr(i, N) {
int X = 1;
bool res = 0;
for (int j = 1; j * X <= N; ++j) {
res ^= box[j * X - 1];
}
if (a[i] != res)
box[i] = 1;
}
vector<int> ans;
rep(i, N) {
if (box[i])
ans.push_back(i + 1);
}
cout << ans.size() << endl;
for (auto &i : ans)
cout << i << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
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;
}
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 200005;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (auto &i : a)
cin >> i;
vector<int> box(N);
repr(i, N) {
int X = i + 1;
bool res = 0;
for (int j = 2; j * X <= N; ++j) {
res ^= box[j * X - 1];
}
if (a[i] != res)
box[i] = 1;
}
vector<int> ans;
rep(i, N) {
if (box[i])
ans.push_back(i + 1);
}
cout << ans.size() << endl;
for (auto &i : ans)
cout << i << " ";
cout << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 777,767 | 777,768 | u992875223 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
vector<ll> ans(n + 1);
ll m = 0;
for (ll i = n; i > 0; i--) {
ll j = 2 * i;
ll c = 0;
while (j <= n) {
c += ans[j];
j += i;
}
if (c % 2 != a[i]) {
ans[i] = 1;
} else {
ans[i] = 0;
}
if (ans[i] > 0)
m++;
}
cout << m << endl;
rep(i, 1, n + 1) {
if (ans[i] > 0)
cout << ans[i] << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
vector<ll> ans(n + 1);
ll m = 0;
for (ll i = n; i > 0; i--) {
ll j = 2 * i;
ll c = 0;
while (j <= n) {
c += ans[j];
j += i;
}
if (c % 2 != a[i]) {
ans[i] = 1;
} else {
ans[i] = 0;
}
if (ans[i] > 0)
m++;
}
cout << m << endl;
rep(i, 1, n + 1) {
if (ans[i] > 0)
cout << i << " ";
}
cout << endl;
return 0;
} | [] | 777,771 | 777,772 | u893584578 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
vl factor(ll n) {
vl res;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
ll n;
cin >> n;
vi a(n + 1);
rep(i, n) cin >> a[i + 1];
vl ans;
for (ll i = n; i >= 1; i--) {
if (a[i] == 0)
continue;
ans.push_back(i);
auto f = factor(i);
for (auto v : f)
a[v] = !a[v];
}
sort(all(ans));
cout << ans.size() << endl;
rep(i, ans.size()) cout << ans[i] << (i == ans.size() - 1 ? '\n' : ' ');
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
vl factor(ll n) {
vl res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n && i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
ll n;
cin >> n;
vi a(n + 1);
rep(i, n) cin >> a[i + 1];
vl ans;
for (ll i = n; i >= 1; i--) {
if (a[i] == 0)
continue;
ans.push_back(i);
auto f = factor(i);
for (auto v : f)
a[v] = !a[v];
}
sort(all(ans));
cout << ans.size() << endl;
rep(i, ans.size()) cout << ans[i] << (i == ans.size() - 1 ? '\n' : ' ');
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,777 | 777,778 | u134678977 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i >= 0; i--) {
int cnt = 0;
for (int j = i + 1; j <= n; j += (i + 1)) {
if (b[j - 1] == 1) {
cnt++;
}
if (cnt % 2 != a[i]) {
b[i] = 1;
}
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
ans++;
}
}
cout << ans << '\n';
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
cout << i + 1 << " ";
}
}
if (ans > 0) {
cout << '\n';
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i >= 0; i--) {
int cnt = 0;
for (int j = i + 1; j <= n; j += (i + 1)) {
if (b[j - 1] == 1) {
cnt++;
}
}
if (cnt % 2 != a[i]) {
b[i] = 1;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
ans++;
}
}
cout << ans << '\n';
for (int i = 0; i < n; i++) {
if (b[i] == 1) {
cout << i + 1 << " ";
}
}
if (ans > 0) {
cout << '\n';
}
return 0;
} | [] | 777,785 | 777,786 | u199184624 | cpp |
p02972 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
int n;
std::cin >> n;
vi a(n + 1);
rrep(i, n) std::cin >> a[i];
vi aa(n + 1), ans;
ddrep(i, n) {
int sum = 0;
for (int j = i + i; j < n; j += i)
sum += aa[j];
if (sum % 2 != a[i])
aa[i] = 1, ans.pb(i);
}
std::cout << ans.size() << "\n";
rep(i, ans.size()) std::cout << (i != 0 ? " " : "") << ans[i] << "\n";
}
| #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
int n;
std::cin >> n;
vi a(n + 1);
rrep(i, n) std::cin >> a[i];
vi aa(n + 1), ans;
ddrep(i, n) {
int sum = 0;
for (int j = i + i; j <= n; j += i)
sum += aa[j];
if (sum % 2 != a[i])
aa[i] = 1, ans.pb(i);
}
std::cout << ans.size() << "\n";
rep(i, ans.size()) std::cout << (i != 0 ? " " : "") << ans[i] << "\n";
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,789 | 777,790 | u700484101 | cpp |
p02972 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
const int mod = 1e9 + 7;
signed main() {
int n = read();
vi a(n + 1), b(n + 1);
REP(i, n) { a[i + 1] = read(); }
int m = 0;
for (int i = n; i > 0; i--) {
int j = i + i;
if (j > n) {
b[i] = a[i];
} else {
while (j <= n) {
b[i] += b[j];
j += i;
}
b[i] &= 1;
if (b[i] == a[i])
b[i] = 0;
else
b[i] = 1;
}
m += b[i];
}
print(n);
FOR(i, 1, n + 1) {
if (b[i] == 1)
print(i, 2);
}
}
| #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
const int mod = 1e9 + 7;
signed main() {
int n = read();
vi a(n + 1), b(n + 1);
REP(i, n) { a[i + 1] = read(); }
int m = 0;
for (int i = n; i > 0; i--) {
int j = i + i;
if (j > n) {
b[i] = a[i];
} else {
while (j <= n) {
b[i] += b[j];
j += i;
}
b[i] &= 1;
if (b[i] == a[i])
b[i] = 0;
else
b[i] = 1;
}
m += b[i];
}
print(m);
FOR(i, 1, n + 1) {
if (b[i] == 1)
print(i, 2);
}
}
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 777,791 | 777,792 | u700484101 | cpp |
p02972 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
const int mod = 1e9 + 7;
signed main() {
int n = read();
vi a(n + 1), b(n + 1);
REP(i, n) { a[i + 1] = read(); }
int m = 0;
for (int i = n; i > 0; i--) {
int j = i + i;
if (j > n) {
b[i] = a[i];
} else {
while (j <= n) {
b[i] += b[j];
j += i;
}
b[i] &= 1;
if (b[i] == a[i])
b[i] = 0;
else
b[i] = 1;
}
m += b[i];
}
print(n);
FOR(i, 1, n + 1) {
if (b[i] == 1)
print(i);
}
}
| #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
const int mod = 1e9 + 7;
signed main() {
int n = read();
vi a(n + 1), b(n + 1);
REP(i, n) { a[i + 1] = read(); }
int m = 0;
for (int i = n; i > 0; i--) {
int j = i + i;
if (j > n) {
b[i] = a[i];
} else {
while (j <= n) {
b[i] += b[j];
j += i;
}
b[i] &= 1;
if (b[i] == a[i])
b[i] = 0;
else
b[i] = 1;
}
m += b[i];
}
print(m);
FOR(i, 1, n + 1) {
if (b[i] == 1)
print(i, 2);
}
}
| [
"identifier.change",
"call.arguments.change",
"io.output.change",
"call.arguments.add"
] | 777,793 | 777,792 | u700484101 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int a[200010];
int ans[200010];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
rep(i, N) cin >> a[i + 1];
for (int i = N; i > 0; i--) {
int cnt = 0;
for (int j = i * 2; j <= N; j += i) {
cnt += ans[j];
}
if (cnt % 2 != a[i] % 2) {
ans[i] = 1;
}
}
vector<int> v;
rep(i, N) {
if (ans[i + 1] == 1)
v.push_back(1);
}
cout << v.size() << endl;
if (v.size() == 0)
return 0;
rep(i, v.size()) {
if (i != 0)
cout << " ";
cout << v[i];
}
cout << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int a[200010];
int ans[200010];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
rep(i, N) cin >> a[i + 1];
for (int i = N; i > 0; i--) {
int cnt = 0;
for (int j = i * 2; j <= N; j += i) {
cnt += ans[j];
}
if (cnt % 2 != a[i] % 2) {
ans[i] = 1;
}
}
vector<int> v;
rep(i, N) {
if (ans[i + 1] == 1)
v.push_back(i + 1);
}
cout << v.size() << endl;
if (v.size() == 0)
return 0;
rep(i, v.size()) {
if (i != 0)
cout << " ";
cout << v[i];
}
cout << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 777,798 | 777,799 | u965730380 | cpp |
p02972 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rep1(i, n) for (int i = 1; i <= (int)n; ++i)
#define all(a) begin(a), end(a)
#define fst first
#define scd second
#define PB emplace_back
#define PPB pop_back
using vi = vector<int>;
using pii = pair<int, int>;
bool chmin(int &a, int b) { return a > b ? (a = b, true) : false; }
bool chmax(int &a, int b) { return a < b ? (a = b, true) : false; }
int read() {
int a;
scanf("%lld", &a);
return a;
}
constexpr int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
const int mod = TEN(9) + 7;
bool used[200010];
signed main() {
int N;
cin >> N;
vi a(N + 1);
rep1(i, N) cin >> a[i];
vi ans;
for (int i = N; i >= 1; --i) {
int counter = 0;
for (int j = i; j <= N; j += i) {
if (used[i]) {
counter++;
}
}
if (a[i] != (counter % 2)) {
ans.PB(i);
used[i] = true;
}
}
cout << ans.size() << endl;
for (int &i : ans)
printf("%lld\n", i);
}
| #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rep1(i, n) for (int i = 1; i <= (int)n; ++i)
#define all(a) begin(a), end(a)
#define fst first
#define scd second
#define PB emplace_back
#define PPB pop_back
using vi = vector<int>;
using pii = pair<int, int>;
bool chmin(int &a, int b) { return a > b ? (a = b, true) : false; }
bool chmax(int &a, int b) { return a < b ? (a = b, true) : false; }
int read() {
int a;
scanf("%lld", &a);
return a;
}
constexpr int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
const int mod = TEN(9) + 7;
bool used[200010];
signed main() {
int N;
cin >> N;
vi a(N + 1);
rep1(i, N) cin >> a[i];
vi ans;
for (int i = N; i >= 1; --i) {
int counter = 0;
for (int j = i; j <= N; j += i) {
if (used[j]) {
counter++;
}
}
if (a[i] != (counter % 2)) {
ans.PB(i);
used[i] = true;
}
}
cout << ans.size() << endl;
for (int &i : ans)
printf("%lld\n", i);
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 777,800 | 777,801 | u491256431 | cpp |
p02972 | #include <iomanip>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
repi(i, n, 0) 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;
repi(i, ans.size(), 0) { cout << i + 1 << endl; }
return 0;
} | #include <iomanip>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
repi(i, n, 0) 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;
repi(i, ans.size(), 0) { cout << ans[i] << endl; }
return 0;
} | [
"io.output.change"
] | 777,804 | 777,805 | u187013893 | cpp |
p02972 | #include <algorithm>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> P;
typedef pair<double, double> P_D;
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reprev(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define ALL(a) (a).begin(), (a).end()
#define C_MAX(a, b) ((a) > (b) ? (a) : (b))
#define fi first
#define se second
#define MAX 100100 // 5
#define MAX_N 200100
#define MAX_B 1001001 // 6
#define MAX_S 10010010 // 7
#define SENTINEL 2000000000 // 9
#define NIL -1
#define MOD 1000000007
#define INF 1 << 29
#define INFTY 1000000000000000000LL
#define MAX_INT INT_MAX
int main() {
int n;
cin >> n;
int a[MAX_B];
rep(i, n) cin >> a[i];
bool s[MAX_B];
memset(s, 0, sizeof(s));
for (int i = n - 1; i >= 0; --i) {
int x = i + 1;
bool sum = 0;
for (int j = 2 * x; j < n; j += x) {
sum += a[j - 1];
}
if (sum != a[i])
s[i] = 1;
else
s[i] = 0;
}
int count = 0;
rep(i, n) if (s[i]) count++;
cout << count << endl;
rep(i, n) if (s[i]) cout << i + 1 << " ";
cout << endl;
} | #include <algorithm>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> P;
typedef pair<double, double> P_D;
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reprev(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define ALL(a) (a).begin(), (a).end()
#define C_MAX(a, b) ((a) > (b) ? (a) : (b))
#define fi first
#define se second
#define MAX 100100 // 5
#define MAX_N 200100
#define MAX_B 1001001 // 6
#define MAX_S 10010010 // 7
#define SENTINEL 2000000000 // 9
#define NIL -1
#define MOD 1000000007
#define INF 1 << 29
#define INFTY 1000000000000000000LL
#define MAX_INT INT_MAX
int main() {
int n;
cin >> n;
bool a[MAX_B];
rep(i, n) cin >> a[i];
bool s[MAX_B];
memset(s, 0, sizeof(s));
for (int i = n - 1; i >= 0; --i) {
int x = i + 1;
int sum = 0;
for (int j = 2 * x; j <= n; j += x) {
sum += s[j - 1];
}
if (sum % 2 != a[i])
s[i] = 1;
else
s[i] = 0;
}
int count = 0;
rep(i, n) if (s[i]) count++;
cout << count << endl;
rep(i, n) if (s[i]) cout << i + 1 << " ";
cout << endl;
} | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,810 | 777,811 | u000212387 | cpp |
p02972 | /*
Created by vasu090 on 19 Apr, 2020
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, b) for (auto(i) = a; i < b; i++)
#define list(i, N) for (auto(i) = 0; i < N; i++)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define int ll
#define INF 1e18 + 5
#define mod 1000000007
template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); }
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vi a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
vi b(n + 1);
rep(i, 1, n + 1) b[i] = -1;
// work from the back
for (int i = n; i > 0; i--) {
// i is the multiple we are referring to
// cout << "b[" << i << "] = " << b[i] << '\n';
const int cura = a[i];
/*
* now go through all the numbers in the forward direction
* and find the current sum we've gotten
* if its equal to 'cura', then 0
* else 1
*/
int cursum = 0;
for (int j = i + i; j <= n; j += i)
cursum += b[j];
cursum %= 2;
if (cursum < 0)
cursum += 2;
// cout << "cursum for i : " << i << " is " << cursum << " with cura
// : " << cura << "\n";
b[i] = (int)cursum != cura;
// cout << "b[" << i << "] = " << b[i] << '\n';
}
int cnt = 0;
vi ans;
rep(i, 1, n) {
if (b[i] == 1) {
cnt++;
ans.eb(i);
}
}
cout << cnt << "\n";
for (auto c : ans)
cout << c << " ";
cout << '\n';
// rep(i,1,n+1) cout << b[i] << " ";
return 0;
} | /*
Created by vasu090 on 19 Apr, 2020
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, b) for (auto(i) = a; i < b; i++)
#define list(i, N) for (auto(i) = 0; i < N; i++)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define int ll
#define INF 1e18 + 5
#define mod 1000000007
template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); }
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vi a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
vi b(n + 1);
rep(i, 1, n + 1) b[i] = -1;
// work from the back
for (int i = n; i > 0; i--) {
// i is the multiple we are referring to
// cout << "b[" << i << "] = " << b[i] << '\n';
const int cura = a[i];
/*
* now go through all the numbers in the forward direction
* and find the current sum we've gotten
* if its equal to 'cura', then 0
* else 1
*/
int cursum = 0;
for (int j = i + i; j <= n; j += i)
cursum += b[j];
cursum %= 2;
if (cursum < 0)
cursum += 2;
// cout << "cursum for i : " << i << " is " << cursum << " with cura
// : " << cura << "\n";
b[i] = (int)cursum != cura;
// cout << "b[" << i << "] = " << b[i] << '\n';
}
int cnt = 0;
vi ans;
rep(i, 1, n + 1) {
if (b[i] == 1) {
cnt++;
ans.eb(i);
}
}
cout << cnt << "\n";
for (auto c : ans)
cout << c << " ";
cout << '\n';
// rep(i,1,n+1) cout << b[i] << " ";
return 0;
} | [
"expression.operation.binary.add"
] | 777,812 | 777,813 | u299043628 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 1101010101010101010
#define MOD 1000000007
#define int long long
using P = pair<int, int>;
signed main() {
int n;
cin >> n;
vint NUM(n);
rep(i, n) cin >> NUM[i];
vbool BOAL(n);
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
int count = 0;
int tmp = i;
while (tmp + (i + 1) < n) {
tmp += (i + 1);
if (BOAL[tmp])
count++;
}
if (count % 2 == 0) {
if (NUM[i] == 1) {
BOAL[i] = true;
ans++;
}
} else {
if (NUM[i] == 0) {
BOAL[i] = true;
ans++;
}
}
}
cout << ans << endl;
rep(i, n) {
if (BOAL[i])
cout << NUM[i] << " ";
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 1101010101010101010
#define MOD 1000000007
#define int long long
using P = pair<int, int>;
signed main() {
int n;
cin >> n;
vint NUM(n);
rep(i, n) cin >> NUM[i];
vbool BOAL(n);
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
int count = 0;
int tmp = i;
while (tmp + (i + 1) < n) {
tmp += (i + 1);
if (BOAL[tmp])
count++;
}
if (count % 2 == 0) {
if (NUM[i] == 1) {
BOAL[i] = true;
ans++;
}
} else {
if (NUM[i] == 0) {
BOAL[i] = true;
ans++;
}
}
}
cout << ans << endl;
rep(i, n) {
if (BOAL[i])
cout << i + 1 << " ";
}
} | [
"io.output.change"
] | 777,820 | 777,821 | u613960672 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> box(n), seq(n);
int cnt;
int zerone;
int m = 0;
vector<int> ans;
for (int i = 0; i < n; ++i)
cin >> box[i];
for (int i = n - 1; i >= 0; --i) {
cnt = 0;
for (int j = 1; j * (i + 1) <= n; ++j) {
cnt ^= seq[j * (i + 1)];
}
zerone = box[i] ^ (cnt % 2);
if (zerone) {
m++;
ans.push_back(i + 1);
}
seq[i] = zerone;
}
cout << m << endl;
if (ans.empty())
return 0;
for (int i = 0; i < ans.size(); ++i) {
cout << (i ? " " : "") << ans[i];
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> box(n), seq(n);
int cnt;
int zerone;
int m = 0;
vector<int> ans;
for (int i = 0; i < n; ++i)
cin >> box[i];
for (int i = n - 1; i >= 0; --i) {
cnt = 0;
for (int j = 1; j * (i + 1) <= n; ++j) {
cnt ^= seq[j * (i + 1) - 1];
}
zerone = box[i] ^ cnt;
if (zerone) {
m++;
ans.push_back(i + 1);
}
seq[i] = zerone;
}
cout << m << endl;
if (ans.empty())
return 0;
for (int i = 0; i < ans.size(); ++i) {
cout << (i ? " " : "") << ans[i];
}
cout << endl;
} | [
"assignment.change"
] | 777,822 | 777,823 | u706341784 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long longをllだけにした
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using mii = map<int, int>;
long long divup(long long a, long long b);
long long kaijou(long long i);
long long P(long long n, long long k);
long long C(long long n, long long k);
long long GCD(long long a, long long b);
long long LCM(long long a, long long b);
bool prime(long long N);
double distance(vector<long long> p, vector<long long> q, long long n);
void press(vector<long long> &v);
void ranking(vector<long long> &v);
void erase(vector<long long> &v, long long i);
void unique(vector<long long> &v);
void printv(vector<long long> v);
vector<ll> keta(ll x);
long long modpow(long long a, long long n, long long mod);
long long modinv(long long a, long long mod);
// 20200416
vector<long long> inputv(long long n);
//////////////////////////////////////////////////////
//端数繰りあがり割り算(検証済)
// a÷bの端数繰り上げ
// b!=0のデバグはしてないので分母に0を入れないように
//負数対応
long long divup(long long a, long long b) {
long long x = abs(a);
long long y = abs(b);
long long z = (x + y - 1) / y;
if ((a < 0 && b > 0) || (a > 0 && b < 0))
return -z;
else if (a == 0)
return 0;
else
return z;
}
//階乗
//検証済み
long long kaijou(long long i) {
if (i == 0)
return 1;
long long j = 1;
for (long long k = 1; k <= i; k++) {
j *= k;
}
return j;
}
//順列nPk(完成)
// n個の異なる要素から、取り出す順序を区別してk個取り出す場合の数
// n<kなら0を返す
//敢えて負数時のデバグはしてない
long long P(long long n, long long k) {
if (n < k)
return 0;
long long y = 1;
for (long long i = 0; i < k; i++) {
y *= (n - i);
}
return y;
}
//組み合わせnCk(検証済み)
// P,kaijouと併用
long long C(long long n, long long k) {
if (n < k)
return 0;
return P(n, k) / kaijou(k);
}
// nHk
//区別しないn個の要素を、区別するk個のグループに分ける
// 0個のグループがあっ
//て良い
// C必須
//最大公約数GCD,最小公倍数LCM
// LCMを使うときはGCDをセットで
//検証済み
long long GCD(long long a, long long b) {
if (a < b)
swap(a, b);
long long d = a % b;
if (d == 0) {
return b;
}
return GCD(b, d);
}
long long LCM(long long a, long long b) { return (a / GCD(a, b)) * b; }
//素数判定
//素数ならばtrue、素数以外の整数にはfalse
//負数は全てfalse
//検証済み
bool prime(long long N) {
if (N == 1) {
return false;
}
if (N < 0)
return false;
long long p = sqrt(N);
for (long long i = 2; i <= p; i++) {
if (N % i == 0) {
return false;
}
}
return true;
}
//ユークリッド距離
//検証済み
//位置ベクトル1,位置ベクトル2,ベクトルの次元(2または3が一般的)
double distance(vector<long long> p, vector<long long> q, long long n) {
double x = 0;
for (long long i = 0; i < n; i++) {
x += pow((p.at(i) - q.at(i)), 2);
}
return sqrt(x);
}
//配列圧縮(検証済)
//{1,36,1,3,8,-2,-92}を
//{2, 5,2,3,4, 1, 0}にする
void press(vector<long long> &v) {
long long n = v.size();
vector<long long> w(n);
map<long long, long long> m;
for (auto &p : v) {
m[p] = 0;
}
long long i = 0;
for (auto &p : m) {
p.second = i;
i++;
}
for (long long i = 0; i < n; i++) {
w.at(i) = m[v.at(i)];
}
v = w;
return;
}
//配列のi番目の要素がj番目に小さいとき、j番目の数がiであるベクトルを返す関数
//配列の要素が全て異なるときにしか正常に動作しない
//配列の要素に同じものが含まれても見かけ上動作はするが意味のない値を戻し、
//エラーも起きないので注意
//検証済
//{2,4,1,6,0,3,8,9,5}を
//{4,2,0,5,1,8,3,6,7}にして返す
//"rank"という名前にするとSTLの関数(配列の次元を返す関数)になるので注意
void ranking(vector<long long> &v) {
long long n = v.size();
map<long long, long long> m;
long long i;
for (i = 0; i < n; i++) {
m[v.at(i)] = i;
}
vector<long long> w(n);
i = 0;
for (auto &p : m) {
v.at(i) = p.second;
i++;
}
return;
}
//部分削除(未検証)
//ベクトルのi番目(i=0,1,2,...,n-1)の要素を削除し、
//以降の要素を全て前に1ずらして参照返し
//ベクトル長は1小さくなって返る
// i>n-1の時は変化しない
void erase(vector<long long> &v, long long i) {
long long n = v.size();
if (i > n - 1)
return;
for (long long j = i; j < n - 1; j++) {
v.at(j) = v.at(j + 1);
}
v.pop_back();
return;
}
//重複削除(未完成)
//引数ベクトルに同一要素が複数あるとき、先頭を残し他は削除
//参照返し
//ベクトル長も変化する
// O(logn)くらい
void unique(vector<long long> &v) {
long long n = v.size();
set<long long> s;
long long i = 0;
while (i < n) {
if (s.count(v.at(i))) {
erase(v, i);
n--;
} else {
s.insert(v.at(i));
i++;
}
}
return;
}
//ベクトルの出力(検証済)
// debug用にvectorの中身を出力する
void printv(vector<long long> v) {
cout << "{ ";
for (auto &p : v) {
cout << p << ",";
}
cout << "}" << endl;
}
// 10進法でn桁の整数xに対して、大きい方の位から、その位の1桁の数字を
//収納した長さnのベクトルを返す
// 0に対しては{0}を返す
//検証済み
vector<ll> keta(ll x) {
if (x == 0)
return {0};
ll n = log10(x) + 1; // xの桁数
vll w(n, 0);
for (ll i = 0; i < n; i++) {
ll p;
p = x % 10;
x = x / 10;
w[n - 1 - i] = p;
}
return w;
}
// 20200415
// 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;
}
// a^{-1} mod を計算する
// modとaが互いに素のときのみ有効(数学的に逆元が一意に定まるのがそのときのみ)
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
//整数n個の入力を受け取ってベクトルに突っ込んで返す
//チェック済み
vector<long long> inputv(long long n) {
vector<long long> v(n);
for (long long i = 0; i < n; i++) {
cin >> v[i];
}
return v;
}
//////////////////////////////////////////////////
long long modC(long long n, long long k, long long MOD) {
long long p = 1, q = 1;
for (long long i = 0; i < k; i++) {
p = (n - i) * p % MOD;
q = (i + 1) * q % MOD;
}
return p * modinv(q, MOD) % MOD;
}
int main() {
ll n;
cin >> n;
auto a = inputv(n);
ll cnt = 0;
vll b(n, 0);
for (ll i = n - 1; i >= 0; i--) {
ll p = 0;
for (ll j = 2 * i + 1; j < n; j += i + 1) {
p ^= b[j];
}
b[i] = a[i] ^ p;
cnt += b[i];
}
cout << cnt << endl;
rep(i, n) {
if (b[i])
cout << i << " ";
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long longをllだけにした
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using mii = map<int, int>;
long long divup(long long a, long long b);
long long kaijou(long long i);
long long P(long long n, long long k);
long long C(long long n, long long k);
long long GCD(long long a, long long b);
long long LCM(long long a, long long b);
bool prime(long long N);
double distance(vector<long long> p, vector<long long> q, long long n);
void press(vector<long long> &v);
void ranking(vector<long long> &v);
void erase(vector<long long> &v, long long i);
void unique(vector<long long> &v);
void printv(vector<long long> v);
vector<ll> keta(ll x);
long long modpow(long long a, long long n, long long mod);
long long modinv(long long a, long long mod);
// 20200416
vector<long long> inputv(long long n);
//////////////////////////////////////////////////////
//端数繰りあがり割り算(検証済)
// a÷bの端数繰り上げ
// b!=0のデバグはしてないので分母に0を入れないように
//負数対応
long long divup(long long a, long long b) {
long long x = abs(a);
long long y = abs(b);
long long z = (x + y - 1) / y;
if ((a < 0 && b > 0) || (a > 0 && b < 0))
return -z;
else if (a == 0)
return 0;
else
return z;
}
//階乗
//検証済み
long long kaijou(long long i) {
if (i == 0)
return 1;
long long j = 1;
for (long long k = 1; k <= i; k++) {
j *= k;
}
return j;
}
//順列nPk(完成)
// n個の異なる要素から、取り出す順序を区別してk個取り出す場合の数
// n<kなら0を返す
//敢えて負数時のデバグはしてない
long long P(long long n, long long k) {
if (n < k)
return 0;
long long y = 1;
for (long long i = 0; i < k; i++) {
y *= (n - i);
}
return y;
}
//組み合わせnCk(検証済み)
// P,kaijouと併用
long long C(long long n, long long k) {
if (n < k)
return 0;
return P(n, k) / kaijou(k);
}
// nHk
//区別しないn個の要素を、区別するk個のグループに分ける
// 0個のグループがあっ
//て良い
// C必須
//最大公約数GCD,最小公倍数LCM
// LCMを使うときはGCDをセットで
//検証済み
long long GCD(long long a, long long b) {
if (a < b)
swap(a, b);
long long d = a % b;
if (d == 0) {
return b;
}
return GCD(b, d);
}
long long LCM(long long a, long long b) { return (a / GCD(a, b)) * b; }
//素数判定
//素数ならばtrue、素数以外の整数にはfalse
//負数は全てfalse
//検証済み
bool prime(long long N) {
if (N == 1) {
return false;
}
if (N < 0)
return false;
long long p = sqrt(N);
for (long long i = 2; i <= p; i++) {
if (N % i == 0) {
return false;
}
}
return true;
}
//ユークリッド距離
//検証済み
//位置ベクトル1,位置ベクトル2,ベクトルの次元(2または3が一般的)
double distance(vector<long long> p, vector<long long> q, long long n) {
double x = 0;
for (long long i = 0; i < n; i++) {
x += pow((p.at(i) - q.at(i)), 2);
}
return sqrt(x);
}
//配列圧縮(検証済)
//{1,36,1,3,8,-2,-92}を
//{2, 5,2,3,4, 1, 0}にする
void press(vector<long long> &v) {
long long n = v.size();
vector<long long> w(n);
map<long long, long long> m;
for (auto &p : v) {
m[p] = 0;
}
long long i = 0;
for (auto &p : m) {
p.second = i;
i++;
}
for (long long i = 0; i < n; i++) {
w.at(i) = m[v.at(i)];
}
v = w;
return;
}
//配列のi番目の要素がj番目に小さいとき、j番目の数がiであるベクトルを返す関数
//配列の要素が全て異なるときにしか正常に動作しない
//配列の要素に同じものが含まれても見かけ上動作はするが意味のない値を戻し、
//エラーも起きないので注意
//検証済
//{2,4,1,6,0,3,8,9,5}を
//{4,2,0,5,1,8,3,6,7}にして返す
//"rank"という名前にするとSTLの関数(配列の次元を返す関数)になるので注意
void ranking(vector<long long> &v) {
long long n = v.size();
map<long long, long long> m;
long long i;
for (i = 0; i < n; i++) {
m[v.at(i)] = i;
}
vector<long long> w(n);
i = 0;
for (auto &p : m) {
v.at(i) = p.second;
i++;
}
return;
}
//部分削除(未検証)
//ベクトルのi番目(i=0,1,2,...,n-1)の要素を削除し、
//以降の要素を全て前に1ずらして参照返し
//ベクトル長は1小さくなって返る
// i>n-1の時は変化しない
void erase(vector<long long> &v, long long i) {
long long n = v.size();
if (i > n - 1)
return;
for (long long j = i; j < n - 1; j++) {
v.at(j) = v.at(j + 1);
}
v.pop_back();
return;
}
//重複削除(未完成)
//引数ベクトルに同一要素が複数あるとき、先頭を残し他は削除
//参照返し
//ベクトル長も変化する
// O(logn)くらい
void unique(vector<long long> &v) {
long long n = v.size();
set<long long> s;
long long i = 0;
while (i < n) {
if (s.count(v.at(i))) {
erase(v, i);
n--;
} else {
s.insert(v.at(i));
i++;
}
}
return;
}
//ベクトルの出力(検証済)
// debug用にvectorの中身を出力する
void printv(vector<long long> v) {
cout << "{ ";
for (auto &p : v) {
cout << p << ",";
}
cout << "}" << endl;
}
// 10進法でn桁の整数xに対して、大きい方の位から、その位の1桁の数字を
//収納した長さnのベクトルを返す
// 0に対しては{0}を返す
//検証済み
vector<ll> keta(ll x) {
if (x == 0)
return {0};
ll n = log10(x) + 1; // xの桁数
vll w(n, 0);
for (ll i = 0; i < n; i++) {
ll p;
p = x % 10;
x = x / 10;
w[n - 1 - i] = p;
}
return w;
}
// 20200415
// 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;
}
// a^{-1} mod を計算する
// modとaが互いに素のときのみ有効(数学的に逆元が一意に定まるのがそのときのみ)
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
//整数n個の入力を受け取ってベクトルに突っ込んで返す
//チェック済み
vector<long long> inputv(long long n) {
vector<long long> v(n);
for (long long i = 0; i < n; i++) {
cin >> v[i];
}
return v;
}
//////////////////////////////////////////////////
long long modC(long long n, long long k, long long MOD) {
long long p = 1, q = 1;
for (long long i = 0; i < k; i++) {
p = (n - i) * p % MOD;
q = (i + 1) * q % MOD;
}
return p * modinv(q, MOD) % MOD;
}
int main() {
ll n;
cin >> n;
auto a = inputv(n);
ll cnt = 0;
vll b(n, 0);
for (ll i = n - 1; i >= 0; i--) {
ll p = 0;
for (ll j = 2 * i + 1; j < n; j += i + 1) {
p ^= b[j];
}
b[i] = a[i] ^ p;
cnt += b[i];
}
cout << cnt << endl;
rep(i, n) {
if (b[i])
cout << i + 1 << " ";
}
}
| [
"expression.operation.binary.add"
] | 777,824 | 777,825 | u513211419 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, n, a) for (int i = n; i >= a; i--)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define all(s) s.begin(), s.end()
#define lla(s) s.rbegin(), s.rend()
#define pcnt(b) __builtin_popcount(b)
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll INF = 1e18;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m = 0;
cin >> n;
vi a(n + 1), b(n + 1, 0), ans;
rep(i, 1, n + 1) { cin >> a[i]; }
rrep(i, n + 1, 1) {
int tmp = 0;
for (int j = i; j < n; j += i) {
tmp += b[j];
}
if ((tmp % 2) != a[i]) {
b[i] = 1;
m++;
ans.push_back(i);
}
}
cout << m << '\n';
rep(i, 0, m) {
cout << ans[i];
if (i != m - 1)
cout << ' ';
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, n, a) for (int i = n; i >= a; i--)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define all(s) s.begin(), s.end()
#define lla(s) s.rbegin(), s.rend()
#define pcnt(b) __builtin_popcount(b)
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll INF = 1e18;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m = 0;
cin >> n;
vi a(n + 1), b(n + 1, 0), ans;
rep(i, 1, n + 1) { cin >> a[i]; }
rrep(i, n + 1, 1) {
int tmp = 0;
for (int j = i; j <= n; j += i) {
tmp += b[j];
}
if ((tmp % 2) != a[i]) {
b[i] = 1;
m++;
ans.push_back(i);
}
}
cout << m << '\n';
rep(i, 0, m) {
cout << ans[i];
if (i != m - 1)
cout << ' ';
}
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,826 | 777,827 | u885523920 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
using namespace std;
int main() {
int a;
cin >> a;
vector<int> g(a);
vector<int> d(a);
for (int i = 0; i < a; i++) {
cin >> g.at(i);
}
for (int i = a; i > 0; i--) {
int u = g.at(i - 1);
for (int j = 2; j < a / i; j++) {
if (d.at(j * i - 1) == 1) {
u++;
}
}
d.at(i - 1) = u % 2;
}
int y = 0;
for (int i = 0; i < a; i++) {
y += d.at(i);
}
int s = 0;
cout << y << endl;
for (int i = 0; i < a; i++) {
if (d.at(i) == 1) {
cout << i + 1;
s++;
if (s != y) {
cout << " ";
}
}
}
cout << endl;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
using namespace std;
int main() {
int a;
cin >> a;
vector<int> g(a);
vector<int> d(a);
for (int i = 0; i < a; i++) {
cin >> g.at(i);
}
for (int i = a; i > 0; i--) {
int u = g.at(i - 1);
for (int j = 2; j <= a / i; j++) {
if (d.at(j * i - 1) == 1) {
u++;
}
}
d.at(i - 1) = u % 2;
}
int y = 0;
for (int i = 0; i < a; i++) {
y += d.at(i);
}
int s = 0;
cout << y << endl;
for (int i = 0; i < a; i++) {
if (d.at(i) == 1) {
cout << i + 1;
s++;
if (s != y) {
cout << " ";
}
}
}
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,832 | 777,833 | u577774192 | cpp |
p02972 | //{{{
#include <bits/stdc++.h>
using namespace std;
const string truename = "Yes";
const string falsename = "No";
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecision(12);
};
} ioSetup;
//{{{ rep rrep loop
#define repX(a, b, c, d, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep4, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep4, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; ++i)
#define rep4(i, begin, end, step) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; i += step)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; --i)
#define rrep4(i, begin, end, step) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; i -= step)
//}}}
#define each(x, a) for (auto &x : a)
#define sz(x) ((ll)(x).size())
//{{{ Type
using ull = unsigned long long;
using ll = long long;
using pii = pair<ll, ll>;
using vp = vector<pii>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
#define v(T) vector<T>
#define vv(T) v(v(T))
template <class T> vector<T> Vector(size_t a, T val) {
return vector<T>(a, val);
}
template <class... Tail> auto Vector(size_t a, Tail... tail) {
return vector<decltype(Vector(tail...))>(a, Vector(tail...));
}
//}}}
//{{{ STL overload
template <class T, class Compare> inline void sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void sort(T &a) { sort(a.begin(), a.end()); }
template <class T> inline void rsort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline void rotate(T &a) {
rotate(a.begin(), a.begin() + 1, a.end());
}
template <class T> inline bool next_permutation(T &a) {
return next_permutation(a.begin(), a.end());
}
template <class T, class U> inline bool binary_search(T &a, const U &v) {
return binary_search(a.begin(), a.end(), v);
}
template <class T, class U> inline auto lower_bound(T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v);
}
template <class T, class U> inline auto upper_bound(T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v);
}
//}}}
//{{{ Functions
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
template <class T> inline T Max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T Min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return (b < a) ? (a = b, true) : false;
}
ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
ll ceil(const ll a, const ll b) { return (a + b - 1) / b; }
ll popcount(ll a) {
a -= ((a >> 1) & 0x5555555555555555LL);
a = (a & 0x3333333333333333LL) + ((a >> 2) & 0x3333333333333333LL);
a = (a + (a >> 4)) & 0x0f0f0f0f0f0f0f0fLL;
a += (a >> 8);
a += (a >> 16);
a += (a >> 32);
return a & 0x7f;
}
//}}}
//{{{ in
class in {
int n, m;
public:
in() : n(-1), m(-1) {}
in(int n) : n(n), m(-1){};
in(int n, int m) : n(n), m(m){};
template <class T> operator T() {
assert(n == -1);
assert(m == -1);
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n >= 0);
assert(m == -1);
vector<T> ret(n);
for (ll i = 0; i < (ll)n; ++i)
cin >> ret[i];
return ret;
}
template <class T> operator vector<vector<T>>() {
assert(n >= 0);
assert(m >= 0);
vector<vector<T>> ret(n, vector<T>(m));
for (ll i = 0; i < (ll)n; ++i)
for (ll j = 0; j < (ll)m; ++j)
cin >> ret[i][j];
return ret;
}
};
//}}}
//{{{ << overload
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (ll i = 0; i < (ll)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
//}}}
//{{{ print / out
template <class T> int print(const T &a) {
cout << a;
return 0;
}
inline int out(bool f) {
cout << (f ? truename : falsename) << '\n';
return 0;
}
inline int out() {
cout << '\n';
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
//}}}
//{{{ debug_print / debug_out
#ifdef LOCAL
#if 1 // Colorize
#include "console_color.hpp"
#else
#define setColor(...)
#endif
template <class T> int debug_print(const T &a) {
cerr << a;
return 0;
}
inline int debug_out(bool f) {
cerr << (f ? truename : falsename) << '\n';
return 0;
}
inline int debug_out() {
cerr << '\n';
return 0;
}
template <class T> inline int debug_out(const T &t) {
debug_print(t);
cerr << '\n';
return 0;
}
template <class Head, class... Tail>
inline int debug_out(const Head &head, const Tail &...tail) {
debug_print(head);
cerr << " ";
debug_out(tail...);
return 0;
}
#define debug(...) \
do { \
setColor(COL_WHITE, COL_DARK_BLUE); \
cerr << "[L." << __LINE__ << "] " << #__VA_ARGS__ << ":"; \
setColor(); \
cerr << " "; \
debug_out(__VA_ARGS__); \
} while (0)
#else
#define debug_print(...)
#define debug_out(...)
#define debug(...)
#endif
//}}}
//{{{ Modular
template <std::int_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(std::int_fast64_t x = 0) noexcept
: a(x % Mod + (x < 0 ? Mod : 0)) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
constexpr bool operator!() const noexcept { return (*this).val() == 0; }
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
Modular pow(u64 t) const {
if (!t)
return 1;
Modular<Mod> a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
};
template <std::int_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
//}}}
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
int main() {
ll n = in();
vi a = in(n);
vi cnt(n + 1);
vi ans;
rrep(num, 1, n + 1) {
ll tmp = 0;
for (int i = num; i <= num; i += num) {
tmp ^= cnt[i];
}
if (tmp != a[num - 1]) {
ans.push_back(num);
cnt[num] = 1;
}
}
out(sz(ans));
rep(i, sz(ans)) { printf("%lld%c", ans[i], i == sz(ans) - 1 ? '\n' : ' '); }
}
| //{{{
#include <bits/stdc++.h>
using namespace std;
const string truename = "Yes";
const string falsename = "No";
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecision(12);
};
} ioSetup;
//{{{ rep rrep loop
#define repX(a, b, c, d, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep4, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep4, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; ++i)
#define rep4(i, begin, end, step) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; i += step)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; --i)
#define rrep4(i, begin, end, step) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; i -= step)
//}}}
#define each(x, a) for (auto &x : a)
#define sz(x) ((ll)(x).size())
//{{{ Type
using ull = unsigned long long;
using ll = long long;
using pii = pair<ll, ll>;
using vp = vector<pii>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
#define v(T) vector<T>
#define vv(T) v(v(T))
template <class T> vector<T> Vector(size_t a, T val) {
return vector<T>(a, val);
}
template <class... Tail> auto Vector(size_t a, Tail... tail) {
return vector<decltype(Vector(tail...))>(a, Vector(tail...));
}
//}}}
//{{{ STL overload
template <class T, class Compare> inline void sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void sort(T &a) { sort(a.begin(), a.end()); }
template <class T> inline void rsort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline void rotate(T &a) {
rotate(a.begin(), a.begin() + 1, a.end());
}
template <class T> inline bool next_permutation(T &a) {
return next_permutation(a.begin(), a.end());
}
template <class T, class U> inline bool binary_search(T &a, const U &v) {
return binary_search(a.begin(), a.end(), v);
}
template <class T, class U> inline auto lower_bound(T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v);
}
template <class T, class U> inline auto upper_bound(T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v);
}
//}}}
//{{{ Functions
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
template <class T> inline T Max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T Min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return (b < a) ? (a = b, true) : false;
}
ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
ll ceil(const ll a, const ll b) { return (a + b - 1) / b; }
ll popcount(ll a) {
a -= ((a >> 1) & 0x5555555555555555LL);
a = (a & 0x3333333333333333LL) + ((a >> 2) & 0x3333333333333333LL);
a = (a + (a >> 4)) & 0x0f0f0f0f0f0f0f0fLL;
a += (a >> 8);
a += (a >> 16);
a += (a >> 32);
return a & 0x7f;
}
//}}}
//{{{ in
class in {
int n, m;
public:
in() : n(-1), m(-1) {}
in(int n) : n(n), m(-1){};
in(int n, int m) : n(n), m(m){};
template <class T> operator T() {
assert(n == -1);
assert(m == -1);
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n >= 0);
assert(m == -1);
vector<T> ret(n);
for (ll i = 0; i < (ll)n; ++i)
cin >> ret[i];
return ret;
}
template <class T> operator vector<vector<T>>() {
assert(n >= 0);
assert(m >= 0);
vector<vector<T>> ret(n, vector<T>(m));
for (ll i = 0; i < (ll)n; ++i)
for (ll j = 0; j < (ll)m; ++j)
cin >> ret[i][j];
return ret;
}
};
//}}}
//{{{ << overload
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (ll i = 0; i < (ll)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
//}}}
//{{{ print / out
template <class T> int print(const T &a) {
cout << a;
return 0;
}
inline int out(bool f) {
cout << (f ? truename : falsename) << '\n';
return 0;
}
inline int out() {
cout << '\n';
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
//}}}
//{{{ debug_print / debug_out
#ifdef LOCAL
#if 1 // Colorize
#include "console_color.hpp"
#else
#define setColor(...)
#endif
template <class T> int debug_print(const T &a) {
cerr << a;
return 0;
}
inline int debug_out(bool f) {
cerr << (f ? truename : falsename) << '\n';
return 0;
}
inline int debug_out() {
cerr << '\n';
return 0;
}
template <class T> inline int debug_out(const T &t) {
debug_print(t);
cerr << '\n';
return 0;
}
template <class Head, class... Tail>
inline int debug_out(const Head &head, const Tail &...tail) {
debug_print(head);
cerr << " ";
debug_out(tail...);
return 0;
}
#define debug(...) \
do { \
setColor(COL_WHITE, COL_DARK_BLUE); \
cerr << "[L." << __LINE__ << "] " << #__VA_ARGS__ << ":"; \
setColor(); \
cerr << " "; \
debug_out(__VA_ARGS__); \
} while (0)
#else
#define debug_print(...)
#define debug_out(...)
#define debug(...)
#endif
//}}}
//{{{ Modular
template <std::int_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(std::int_fast64_t x = 0) noexcept
: a(x % Mod + (x < 0 ? Mod : 0)) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
constexpr bool operator!() const noexcept { return (*this).val() == 0; }
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
Modular pow(u64 t) const {
if (!t)
return 1;
Modular<Mod> a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
};
template <std::int_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
//}}}
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
int main() {
ll n = in();
vi a = in(n);
vi cnt(n + 1);
vi ans;
rrep(num, 1, n + 1) {
ll tmp = 0;
for (int i = num; i <= n; i += num) {
tmp ^= cnt[i];
}
if (tmp != a[num - 1]) {
ans.push_back(num);
cnt[num] = 1;
}
}
out(sz(ans));
rep(i, sz(ans)) { printf("%lld%c", ans[i], i == sz(ans) - 1 ? '\n' : ' '); }
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,842 | 777,843 | u899220667 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) >= (ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
#define SQR(x) (x) * (x)
#define CEIL(a, b) ((a) + (b)-1) / (b)
const int INF = 1001001001;
const int MOD = 1000000007;
const int MAX_N = 101010;
// A:array of pair, N:size of array
void sort_second(vector<pair<ll, ll>> &A, int N);
// a^n
ll a_n(ll a, ll n);
// make vector of (n!)%MOD, (n!)^(-1)%MOD to calculate nCk
void factorial_map(vector<ll> &n, vector<ll> &ninv);
// a^(-1) % MOD
ll inv(ll a);
// map of prime factorization
void prime_map(map<ll, ll> &a, ll n);
// list of prime (is_prime.size() = n + 1, primes.size() = 0)
void prime_list(ll n, vector<ll> &primes, vector<bool> &is_prime);
// get gcd from prime map
ll gcd_map(map<ll, ll> a, map<ll, ll> b);
// get lcm from prime map
ll lcm_map(map<ll, ll> a, map<ll, ll> b);
// get gcd
ll my_gcd(ll a, ll b);
// calculate nCk
ll nCk(ll n, ll k);
// get abs
ll my_abs(ll a);
// z-algorithm (s.size() == a.size())
void z_algorithm(string s, vector<int> &a);
class Unionfind {
public:
vector<ll> par, siz, rank;
Unionfind();
ll root(ll x);
void merge(ll x, ll y);
bool issame(ll x, ll y);
ll size(ll x);
};
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<bool> b(n + 1, false);
ll bsum = 0;
frrep(i, 1, n) {
ll tmp = 0;
for (ll j = i * 2; j <= n; j *= 2) {
if (b[j])
tmp++;
}
if ((tmp % 2) == a[i])
continue;
else {
b[i] = true;
bsum++;
}
}
cout << bsum << endl;
rep(i, n) {
if (b[i + 1]) {
cout << i + 1 << ' ';
}
}
return 0;
}
void sort_second(vector<pair<ll, ll>> &A, int N) {
rep(i, N) swap(A.at(i).first, A.at(i).second);
sort(ALL(A));
rep(i, N) swap(A.at(i).first, A.at(i).second);
}
ll a_n(ll a, ll n) {
if (n == 0)
return 1;
ll ret = a, count = 1;
while (count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
}
if (count == n)
return ret;
else
return (ret * a_n(a, n - count)) % MOD;
}
/* calculate a^n with no recursive process (%MOD)
ll a_n(ll a, ll n) {
ll ret = a, count = 1;
int num = 1;
vector<ll> memory(100);
memory.at(0) = a;
while(count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
memory.at(num) = ret;
num++;
}
if(count == n) return ret;
else {
bitset<100> bit = bitset<100>(n-count);
rep(i, 100) {
if(bit.test(i)) ret = (ret * memory.at(i)) % MOD;
}
return ret;
}
}
*/
void factorial_map(vector<ll> &n, vector<ll> &ninv) {
n[0] = 1;
for (ll i = 1; i < n.size(); i++)
n[i] = (n[i - 1] * i) % MOD;
ninv[n.size() - 1] = inv(n[n.size() - 1]);
for (ll i = n.size() - 2; i > -1; i--)
ninv[i] = (ninv[i + 1] * (i + 1)) % MOD;
}
ll inv(ll a) { return a_n(a, MOD - 2); }
void prime_map(map<ll, ll> &a, ll n) {
while ((n % 2) == 0) {
n /= 2;
if (a.count(2))
a.at(2)++;
else
a[2] = 1;
}
for (ll i = 3; i * i <= n; i += 2) {
while ((n % i) == 0) {
n /= i;
if (a.count(i))
a.at(i)++;
else
a[i] = 1;
}
}
if (n != 1)
a[n] = 1;
}
ll gcd_map(map<ll, ll> a, map<ll, ll> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, b.at(key));
else
ret *= a_n(key, value);
}
}
return ret;
}
ll lcm_map(map<ll, ll> a, map<ll, ll> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, value);
else
ret *= a_n(key, b.at(key));
} else {
ret *= a_n(key, value);
}
}
for (auto p : b) {
auto key = p.first;
auto value = p.second;
if (a.count(key)) {
continue;
} else {
ret *= a_n(key, value);
}
}
return ret;
}
ll my_gcd(ll a, ll b) {
if (b == 0)
return a;
return my_gcd(b, a % b);
}
ll nCk(ll n, ll k) {
ll kfac = 1, ret = 1;
for (ll i = 1; i <= k; i++) {
kfac = (kfac * i) % MOD;
}
for (ll i = n; i >= n - k + 1; i--) {
ret = (ret * i) % MOD;
}
ret = (ret * inv(kfac)) % MOD;
return ret;
}
void prime_list(ll n, vector<ll> &primes, vector<bool> &is_prime) {
ll p = 0;
rep(i, n + 1) is_prime[i] = true;
is_prime[0] = false;
is_prime[1] = false;
for (ll i = 2; i <= n; i++) {
if (is_prime[i]) {
primes.push_back(i);
for (ll j = 2 * i; j <= n; j += i)
is_prime[j] = false;
}
}
}
ll my_abs(ll a) {
if (a >= 0)
return a;
else
return -1 * a;
}
Unionfind::Unionfind() {
par.resize(MAX_N);
siz.resize(MAX_N);
rank.resize(MAX_N);
rep(i, MAX_N) {
par[i] = i;
siz[i] = 1;
rank[i] = 0;
}
}
ll Unionfind::root(ll x) {
if (par[x] == x)
return x;
else {
return par[x] = root(par[x]);
}
}
void Unionfind::merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rank[x] == rank[y])
rank[x]++;
}
}
bool Unionfind::issame(ll x, ll y) { return root(x) == root(y); }
ll Unionfind::size(ll x) { return siz[root(x)]; }
void z_algorithm(string s, vector<int> &a) {
a.at(0) = s.size();
int i = 1, j = 0;
while (i < s.size()) {
while ((i + j < s.size()) && (s.at(j) == s.at(i + j)))
j++;
a.at(i) = j;
if (j == 0) {
i++;
continue;
}
int k = 1;
while ((i + k < s.size()) && (k + a.at(k) < j)) {
a.at(i + k) = a.at(k);
k++;
}
i += k;
j -= k;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) >= (ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
#define SQR(x) (x) * (x)
#define CEIL(a, b) ((a) + (b)-1) / (b)
const int INF = 1001001001;
const int MOD = 1000000007;
const int MAX_N = 101010;
// A:array of pair, N:size of array
void sort_second(vector<pair<ll, ll>> &A, int N);
// a^n
ll a_n(ll a, ll n);
// make vector of (n!)%MOD, (n!)^(-1)%MOD to calculate nCk
void factorial_map(vector<ll> &n, vector<ll> &ninv);
// a^(-1) % MOD
ll inv(ll a);
// map of prime factorization
void prime_map(map<ll, ll> &a, ll n);
// list of prime (is_prime.size() = n + 1, primes.size() = 0)
void prime_list(ll n, vector<ll> &primes, vector<bool> &is_prime);
// get gcd from prime map
ll gcd_map(map<ll, ll> a, map<ll, ll> b);
// get lcm from prime map
ll lcm_map(map<ll, ll> a, map<ll, ll> b);
// get gcd
ll my_gcd(ll a, ll b);
// calculate nCk
ll nCk(ll n, ll k);
// get abs
ll my_abs(ll a);
// z-algorithm (s.size() == a.size())
void z_algorithm(string s, vector<int> &a);
class Unionfind {
public:
vector<ll> par, siz, rank;
Unionfind();
ll root(ll x);
void merge(ll x, ll y);
bool issame(ll x, ll y);
ll size(ll x);
};
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<bool> b(n + 1, false);
ll bsum = 0;
frrep(i, 1, n) {
ll tmp = 0;
for (ll j = i * 2; j <= n; j += i) {
if (b[j])
tmp++;
}
if ((tmp % 2) == a[i])
continue;
else {
b[i] = true;
bsum++;
}
}
cout << bsum << endl;
rep(i, n) {
if (b[i + 1]) {
cout << i + 1 << ' ';
}
}
return 0;
}
void sort_second(vector<pair<ll, ll>> &A, int N) {
rep(i, N) swap(A.at(i).first, A.at(i).second);
sort(ALL(A));
rep(i, N) swap(A.at(i).first, A.at(i).second);
}
ll a_n(ll a, ll n) {
if (n == 0)
return 1;
ll ret = a, count = 1;
while (count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
}
if (count == n)
return ret;
else
return (ret * a_n(a, n - count)) % MOD;
}
/* calculate a^n with no recursive process (%MOD)
ll a_n(ll a, ll n) {
ll ret = a, count = 1;
int num = 1;
vector<ll> memory(100);
memory.at(0) = a;
while(count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
memory.at(num) = ret;
num++;
}
if(count == n) return ret;
else {
bitset<100> bit = bitset<100>(n-count);
rep(i, 100) {
if(bit.test(i)) ret = (ret * memory.at(i)) % MOD;
}
return ret;
}
}
*/
void factorial_map(vector<ll> &n, vector<ll> &ninv) {
n[0] = 1;
for (ll i = 1; i < n.size(); i++)
n[i] = (n[i - 1] * i) % MOD;
ninv[n.size() - 1] = inv(n[n.size() - 1]);
for (ll i = n.size() - 2; i > -1; i--)
ninv[i] = (ninv[i + 1] * (i + 1)) % MOD;
}
ll inv(ll a) { return a_n(a, MOD - 2); }
void prime_map(map<ll, ll> &a, ll n) {
while ((n % 2) == 0) {
n /= 2;
if (a.count(2))
a.at(2)++;
else
a[2] = 1;
}
for (ll i = 3; i * i <= n; i += 2) {
while ((n % i) == 0) {
n /= i;
if (a.count(i))
a.at(i)++;
else
a[i] = 1;
}
}
if (n != 1)
a[n] = 1;
}
ll gcd_map(map<ll, ll> a, map<ll, ll> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, b.at(key));
else
ret *= a_n(key, value);
}
}
return ret;
}
ll lcm_map(map<ll, ll> a, map<ll, ll> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, value);
else
ret *= a_n(key, b.at(key));
} else {
ret *= a_n(key, value);
}
}
for (auto p : b) {
auto key = p.first;
auto value = p.second;
if (a.count(key)) {
continue;
} else {
ret *= a_n(key, value);
}
}
return ret;
}
ll my_gcd(ll a, ll b) {
if (b == 0)
return a;
return my_gcd(b, a % b);
}
ll nCk(ll n, ll k) {
ll kfac = 1, ret = 1;
for (ll i = 1; i <= k; i++) {
kfac = (kfac * i) % MOD;
}
for (ll i = n; i >= n - k + 1; i--) {
ret = (ret * i) % MOD;
}
ret = (ret * inv(kfac)) % MOD;
return ret;
}
void prime_list(ll n, vector<ll> &primes, vector<bool> &is_prime) {
ll p = 0;
rep(i, n + 1) is_prime[i] = true;
is_prime[0] = false;
is_prime[1] = false;
for (ll i = 2; i <= n; i++) {
if (is_prime[i]) {
primes.push_back(i);
for (ll j = 2 * i; j <= n; j += i)
is_prime[j] = false;
}
}
}
ll my_abs(ll a) {
if (a >= 0)
return a;
else
return -1 * a;
}
Unionfind::Unionfind() {
par.resize(MAX_N);
siz.resize(MAX_N);
rank.resize(MAX_N);
rep(i, MAX_N) {
par[i] = i;
siz[i] = 1;
rank[i] = 0;
}
}
ll Unionfind::root(ll x) {
if (par[x] == x)
return x;
else {
return par[x] = root(par[x]);
}
}
void Unionfind::merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rank[x] == rank[y])
rank[x]++;
}
}
bool Unionfind::issame(ll x, ll y) { return root(x) == root(y); }
ll Unionfind::size(ll x) { return siz[root(x)]; }
void z_algorithm(string s, vector<int> &a) {
a.at(0) = s.size();
int i = 1, j = 0;
while (i < s.size()) {
while ((i + j < s.size()) && (s.at(j) == s.at(i + j)))
j++;
a.at(i) = j;
if (j == 0) {
i++;
continue;
}
int k = 1;
while ((i + k < s.size()) && (k + a.at(k) < j)) {
a.at(i + k) = a.at(k);
k++;
}
i += k;
j -= k;
}
} | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 777,846 | 777,847 | u014442925 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 5];
int b[n + 5];
int check = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i > n / 2; i--) {
if (a[i] == 1) {
b[i] = 1;
check++;
} else {
b[i] = 0;
}
}
for (int i = n / 2; i >= 1; i--) {
int ch = 0;
for (int j = 2; i * j > n; j++) {
ch += b[i * j];
}
if (a[i] == 1 && ch % 2 == 1) {
b[i] = 0;
} else if (a[i] == 0 && ch % 2 == 1) {
b[i] = 1;
check++;
} else if (a[i] == 1 && ch % 2 == 0) {
b[i] = 1;
check++;
} else if (a[i] == 0 && ch % 2 == 0) {
b[i] = 0;
}
}
cout << check << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << i << " ";
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 5];
int b[n + 5];
int check = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i > (n / 2); i--) {
if (a[i] == 1) {
b[i] = 1;
check++;
} else {
b[i] = 0;
}
}
for (int i = (n / 2); i >= 1; i--) {
int ch = 0;
for (int j = 2; i * j <= n; j++) {
ch += b[i * j];
}
if (a[i] == 1 && ch % 2 == 1) {
b[i] = 0;
} else if (a[i] == 0 && ch % 2 == 1) {
b[i] = 1;
check++;
} else if (a[i] == 1 && ch % 2 == 0) {
b[i] = 1;
check++;
} else if (a[i] == 0 && ch % 2 == 0) {
b[i] = 0;
}
}
cout << check << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << i << " ";
}
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,848 | 777,849 | u861722435 | cpp |
p02972 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N], i;
for (i = 0; i < N; i++) {
cin >> a[i];
}
int b[N], c, s, sum = 0;
for (i = N - 1; i > -1; i--) {
if ((i + 1) > (N / 2)) {
b[i] = a[i];
if (b[i] == 1)
sum += 1;
} else {
c = 2;
s = 0;
while ((i + 1) * c <= N) {
s += a[(i + 1) * c - 1];
c += 1;
}
if (s % 2 == a[i])
b[i] = 0;
else {
b[i] = 1;
sum += 1;
}
}
}
cout << sum << endl;
int count = 1;
for (i = 0; i < N; i++) {
if (b[i] == 1 && count != sum) {
cout << i + 1 << ' ';
count += 1;
} else if (b[i] == 1 && count == sum) {
cout << i + 1 << endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N], i;
for (i = 0; i < N; i++) {
cin >> a[i];
}
int b[N], c, s, sum = 0;
for (i = N - 1; i > -1; i--) {
if ((i + 1) > (N / 2)) {
b[i] = a[i];
if (b[i] == 1)
sum += 1;
} else {
c = 2;
s = 0;
// cout << i << endl;
while ((i + 1) * c <= N) {
s += b[(i + 1) * c - 1];
c += 1;
// cout << s << endl;
}
// cout << endl;
if (s % 2 == a[i])
b[i] = 0;
else {
b[i] = 1;
// cout << i << s << endl;
sum += 1;
}
}
}
cout << sum << endl;
int count = 1;
for (i = 0; i < N; i++) {
if (b[i] == 1 && count != sum) {
cout << i + 1 << ' ';
count += 1;
} else if (b[i] == 1 && count == sum) {
cout << i + 1 << endl;
}
}
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 777,850 | 777,851 | u806657856 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), ball(n);
rep(i, n) cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
ll sum = 0;
for (int j = 1; (i + 1) * j <= n - 1; j++)
sum += ball[(i + 1) * j - 1];
ball[i] = a[i] ^ sum % 2;
}
int m = 0;
rep(i, n) if (ball[i]) m++;
cout << m << endl;
rep(i, n) if (ball[i]) cout << i + 1 << " ";
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), ball(n);
rep(i, n) cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
ll sum = 0;
for (int j = 1; (i + 1) * j - 1 <= n - 1; j++)
sum += ball[(i + 1) * j - 1];
ball[i] = a[i] ^ sum % 2;
}
int m = 0;
rep(i, n) if (ball[i]) m++;
cout << m << endl;
rep(i, n) if (ball[i]) cout << i + 1 << " ";
cout << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 777,853 | 777,854 | u915689660 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <vector>
using namespace std;
using ll = long long int;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
const int MOD = 1000000007;
// const int MOD=998244353;
const int INTMAX = 1001001000;
const ll LLMAX = 1010010010010010000;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
vll a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<bool> ans(N, false);
for (int i = N; i >= 1; i--) {
bool sum = 0;
for (int j = 2; i * j < N; j++) {
if (ans[i * j - 1]) {
if (sum == 0)
sum = 1;
else
sum = 0;
}
}
if (sum == a[i - 1]) {
ans[i - 1] = false;
} else {
ans[i - 1] = true;
}
}
ll sum = 0;
for (int i = 0; i < N; i++)
if (ans[i])
sum++;
cout << sum << endl;
for (int i = 0; i < N; i++)
if (ans[i])
cout << i + 1 << " ";
return 0;
}
| #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <vector>
using namespace std;
using ll = long long int;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
const int MOD = 1000000007;
// const int MOD=998244353;
const int INTMAX = 1001001000;
const ll LLMAX = 1010010010010010000;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
vll a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<bool> ans(N, false);
for (int i = N; i >= 1; i--) {
bool sum = 0;
for (int j = 2; i * j <= N; j++) {
if (ans[i * j - 1]) {
if (sum == 0)
sum = 1;
else
sum = 0;
}
}
if (sum == a[i - 1]) {
ans[i - 1] = false;
} else {
ans[i - 1] = true;
}
}
ll sum = 0;
for (int i = 0; i < N; i++)
if (ans[i])
sum++;
cout << sum << endl;
for (int i = 0; i < N; i++)
if (ans[i])
cout << i + 1 << " ";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,855 | 777,856 | u376578635 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int lint;
typedef pair<int, int> IP;
typedef pair<lint, lint> LLP;
typedef pair<char, char> CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v, hoge) upper_bound(v.begin(), v.end(), hoge)
#define lower(v, hoge) lower_bound(v.begin(), v.end(), hoge)
#define llower(v, hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v, hoge) *upper_bound(v.begin(), v.end(), hoge)
int main() {
lint N;
cin >> N;
vector<lint> A(N);
rep(i, N) { cin >> A[i]; }
vector<lint> B(N);
for (int i = N - 1; i >= 0; i--) {
lint sum = 0;
lint now = i + 1;
while (1) {
sum += B[now - 1];
now += i + 1;
if (now >= N) {
break;
}
}
if (sum % 2 != A[i]) {
B[i]++;
}
}
lint num = 0;
rep(i, N) {
if (B[i] != 0) {
num++;
}
}
cout << num << endl;
rep(i, N) {
if (B[i] != 0) {
cout << i + 1;
}
if (i != N - 1) {
cout << ' ';
} else {
cout << endl;
}
}
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int lint;
typedef pair<int, int> IP;
typedef pair<lint, lint> LLP;
typedef pair<char, char> CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v, hoge) upper_bound(v.begin(), v.end(), hoge)
#define lower(v, hoge) lower_bound(v.begin(), v.end(), hoge)
#define llower(v, hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v, hoge) *upper_bound(v.begin(), v.end(), hoge)
int main() {
lint N;
cin >> N;
vector<lint> A(N);
rep(i, N) { cin >> A[i]; }
vector<lint> B(N);
for (int i = N - 1; i >= 0; i--) {
lint sum = 0;
lint now = i + 1;
while (1) {
sum += B[now - 1];
now += i + 1;
if (now > N) {
break;
}
}
if (sum % 2 != A[i]) {
B[i]++;
}
}
lint num = 0;
rep(i, N) {
if (B[i] != 0) {
num++;
}
}
cout << num << endl;
rep(i, N) {
if (B[i] != 0) {
cout << i + 1;
}
if (i != N - 1) {
cout << ' ';
} else {
cout << endl;
}
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 777,857 | 777,858 | u247679666 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int lint;
typedef pair<int, int> IP;
typedef pair<lint, lint> LLP;
typedef pair<char, char> CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v, hoge) upper_bound(v.begin(), v.end(), hoge)
#define lower(v, hoge) lower_bound(v.begin(), v.end(), hoge)
#define llower(v, hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v, hoge) *upper_bound(v.begin(), v.end(), hoge)
int main() {
lint N;
cin >> N;
vector<lint> A(N);
rep(i, N) { cin >> A[i]; }
vector<lint> B(N);
for (int i = N - 1; i >= 0; i--) {
lint sum = 0;
lint now = i + 1;
while (1) {
sum += B[now - 1];
now += i + 1;
if (now >= N) {
break;
}
}
if (sum % 2 != A[i]) {
B[i]++;
}
}
int num = 0;
rep(i, N) {
if (B[i] != 0) {
num++;
}
}
cout << num << endl;
rep(i, N) {
if (B[i] != 0) {
cout << i + 1;
}
if (i != N - 1) {
cout << ' ';
} else {
cout << endl;
}
}
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int lint;
typedef pair<int, int> IP;
typedef pair<lint, lint> LLP;
typedef pair<char, char> CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v, hoge) upper_bound(v.begin(), v.end(), hoge)
#define lower(v, hoge) lower_bound(v.begin(), v.end(), hoge)
#define llower(v, hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v, hoge) *upper_bound(v.begin(), v.end(), hoge)
int main() {
lint N;
cin >> N;
vector<lint> A(N);
rep(i, N) { cin >> A[i]; }
vector<lint> B(N);
for (int i = N - 1; i >= 0; i--) {
lint sum = 0;
lint now = i + 1;
while (1) {
sum += B[now - 1];
now += i + 1;
if (now > N) {
break;
}
}
if (sum % 2 != A[i]) {
B[i]++;
}
}
lint num = 0;
rep(i, N) {
if (B[i] != 0) {
num++;
}
}
cout << num << endl;
rep(i, N) {
if (B[i] != 0) {
cout << i + 1;
}
if (i != N - 1) {
cout << ' ';
} else {
cout << endl;
}
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.change"
] | 777,859 | 777,858 | u247679666 | cpp |
p02972 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
n++;
V<int> a(n);
int cnt = 0;
for (int i = 1; i < n; i++)
cin >> a[i];
V<int> ans(n, 0);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = 1; i * j < n; j++) {
sum ^= ans[i * j];
}
if (sum != a[i]) {
ans[i] = 1;
cnt++;
}
}
cout << cnt << "\n";
for (int i = 1; i < n; i++)
if (ans[i])
cout << i << " ";
if (cnt)
cout << "\n";
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
n++;
V<int> a(n);
int cnt = 0;
for (int i = 1; i < n; i++)
cin >> a[i];
V<int> ans(n, 0);
for (int i = n - 1; i >= 1; i--) {
int sum = 0;
for (int j = 1; i * j < n; j++) {
sum ^= ans[i * j];
}
if (sum != a[i]) {
ans[i] = 1;
cnt++;
}
}
cout << cnt << "\n";
for (int i = 1; i < n; i++)
if (ans[i])
cout << i << " ";
if (cnt)
cout << "\n";
} | [
"control_flow.loop.for.initializer.change"
] | 777,863 | 777,864 | u822169805 | cpp |
p02972 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
n++;
V<int> a(n);
int cnt = 0;
for (int i = 1; i < n; i++)
cin >> a[i];
V<int> ans(n, 0);
for (int i = n - 1; i >= 1; i--) {
int sum = 0;
for (int j = 1; i * j < n; j++) {
sum ^= ans[j];
}
if (sum != a[i]) {
ans[i] = 1;
cnt++;
}
}
cout << cnt << "\n";
for (int i = 1; i < n; i++)
if (ans[i])
cout << i << " ";
if (cnt)
cout << "\n";
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
n++;
V<int> a(n);
int cnt = 0;
for (int i = 1; i < n; i++)
cin >> a[i];
V<int> ans(n, 0);
for (int i = n - 1; i >= 1; i--) {
int sum = 0;
for (int j = 1; i * j < n; j++) {
sum ^= ans[i * j];
}
if (sum != a[i]) {
ans[i] = 1;
cnt++;
}
}
cout << cnt << "\n";
for (int i = 1; i < n; i++)
if (ans[i])
cout << i << " ";
if (cnt)
cout << "\n";
} | [
"assignment.change"
] | 777,865 | 777,864 | u822169805 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e+9;
typedef pair<ll, ll> P;
#define fi first
#define se second
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), balls(n + 1, 0), ans;
for (int i = 1; i < n + 1; i++)
cin >> a.at(i);
for (int i = n; i > 0; i--) {
int sum = 0, cnt = 1;
while (cnt * i <= n) {
sum ^= balls.at(i);
cnt++;
}
if (sum != a.at(i)) {
balls.at(i) ^= 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = ans.size() - 1; i >= 0; i--)
cout << ans.at(i) << " ";
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e+9;
typedef pair<ll, ll> P;
#define fi first
#define se second
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), balls(n + 1, 0), ans;
for (int i = 1; i < n + 1; i++)
cin >> a.at(i);
for (int i = n; i > 0; i--) {
int sum = 0, cnt = 1;
while (cnt * i <= n) {
sum ^= balls.at(cnt * i);
cnt++;
}
if (sum != a.at(i)) {
balls.at(i) ^= 1;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (int i = ans.size() - 1; i >= 0; i--)
cout << ans.at(i) << " ";
cout << endl;
}
| [
"assignment.change"
] | 777,866 | 777,867 | u822169805 | cpp |
p02972 | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
map<int, int> factorize(int n) {
map<int, int> factors;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++factors[i];
n /= i;
}
}
if (n != 1) {
factors[n] = 1;
}
return factors;
}
void divisors(const map<int, int> &factors, vi &ans, int x, int i) {
if (i == (int)factors.size()) {
ans.push_back(x);
return;
}
pair<int, int> p = *(next(factors.begin(), i));
rep(power, 0, p.second + 1) {
divisors(factors, ans, x * (int)pow(p.first, power), i + 1);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n + 1, 0);
rep(i, 1, n + 1) { cin >> a[i]; }
vi b;
rrep(i, 1, n + 1) {
if (a[i] == 1) {
b.push_back(i);
vi div;
divisors(factorize(a[i]), div, 1, 0);
for (int d : div) {
if (d == i) {
continue;
}
a[d] ^= 1;
}
}
}
cout << b.size() << endl;
rep(i, 0, b.size()) {
cout << b[i];
if (i == (int)b.size() - 1) {
cout << endl;
} else {
cout << " ";
}
}
return 0;
} | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
map<int, int> factorize(int n) {
map<int, int> factors;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++factors[i];
n /= i;
}
}
if (n != 1) {
factors[n] = 1;
}
return factors;
}
void divisors(const map<int, int> &factors, vi &ans, int x, int i) {
if (i == (int)factors.size()) {
ans.push_back(x);
return;
}
pair<int, int> p = *(next(factors.begin(), i));
rep(power, 0, p.second + 1) {
divisors(factors, ans, x * (int)pow(p.first, power), i + 1);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n + 1, 0);
rep(i, 1, n + 1) { cin >> a[i]; }
vi b;
rrep(i, 1, n + 1) {
if (a[i] == 1) {
b.push_back(i);
vi div;
divisors(factorize(i), div, 1, 0);
for (int d : div) {
if (d == i) {
continue;
}
a[d] ^= 1;
}
}
}
cout << b.size() << endl;
rep(i, 0, b.size()) {
cout << b[i];
if (i == (int)b.size() - 1) {
cout << endl;
} else {
cout << " ";
}
}
return 0;
} | [
"call.arguments.change"
] | 777,868 | 777,869 | u955627293 | cpp |
p02972 | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
map<int, int> factorize(int n) {
map<int, int> factors;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++factors[i];
n /= i;
}
}
if (n != 1) {
factors[n] = 1;
}
return factors;
}
void divisors(const map<int, int> &factors, vi &ans, int x, int i) {
if (i == (int)factors.size()) {
ans.push_back(x);
return;
}
pair<int, int> p = *(next(factors.begin(), i));
rep(power, 0, p.second + 1) {
divisors(factors, ans, x * (int)pow(p.first, power), i + 1);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n + 1, 0);
rep(i, 1, n + 1) { cin >> a[i]; }
vi b;
rrep(i, 1, n + 1) {
if (a[i] == 1) {
b.push_back(i);
}
vi div;
divisors(factorize(a[i]), div, 1, 0);
for (int d : div) {
if (d == i) {
continue;
}
a[d] ^= 1;
}
}
cout << b.size() << endl;
rep(i, 0, b.size()) {
cout << b[i];
if (i == (int)b.size() - 1) {
cout << endl;
} else {
cout << " ";
}
}
return 0;
} | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
map<int, int> factorize(int n) {
map<int, int> factors;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++factors[i];
n /= i;
}
}
if (n != 1) {
factors[n] = 1;
}
return factors;
}
void divisors(const map<int, int> &factors, vi &ans, int x, int i) {
if (i == (int)factors.size()) {
ans.push_back(x);
return;
}
pair<int, int> p = *(next(factors.begin(), i));
rep(power, 0, p.second + 1) {
divisors(factors, ans, x * (int)pow(p.first, power), i + 1);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n + 1, 0);
rep(i, 1, n + 1) { cin >> a[i]; }
vi b;
rrep(i, 1, n + 1) {
if (a[i] == 1) {
b.push_back(i);
vi div;
divisors(factorize(i), div, 1, 0);
for (int d : div) {
if (d == i) {
continue;
}
a[d] ^= 1;
}
}
}
cout << b.size() << endl;
rep(i, 0, b.size()) {
cout << b[i];
if (i == (int)b.size() - 1) {
cout << endl;
} else {
cout << " ";
}
}
return 0;
} | [
"call.arguments.change"
] | 777,870 | 777,869 | u955627293 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2; j <= n / (i + 1); ++j) {
sum += a[j * (i + 1) - 1];
}
if (abs(a[i] - sum) % 2 == 0)
b[i] = 0;
else {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
rep(i, n) if (b[i] == 1) cout << i + 1 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
int m = 0;
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2; j <= n / (i + 1); ++j) {
sum += b[j * (i + 1) - 1];
}
if (abs(a[i] - sum) % 2 == 0)
b[i] = 0;
else {
b[i] = 1;
m++;
}
}
cout << m << endl;
rep(i, n) if (b[i] == 1) cout << i + 1 << endl;
} | [
"variable_declaration.name.change",
"identifier.change",
"assignment.value.change",
"io.output.change"
] | 777,871 | 777,872 | u346629192 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2; j < n / (i + 1); ++j) {
sum += a[j * (i + 1) - 1];
}
if (abs(a[i] - sum) % 2 == 0)
b[i] = 0;
else {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
rep(i, n) if (b[i] == 1) cout << i + 1 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
int m = 0;
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = 2; j <= n / (i + 1); ++j) {
sum += b[j * (i + 1) - 1];
}
if (abs(a[i] - sum) % 2 == 0)
b[i] = 0;
else {
b[i] = 1;
m++;
}
}
cout << m << endl;
rep(i, n) if (b[i] == 1) cout << i + 1 << endl;
} | [
"variable_declaration.name.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"io.output.change"
] | 777,873 | 777,872 | u346629192 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll i, j, k;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n, 0);
int num = n;
int flag;
while (num > 0) {
flag = 0;
for (i = num; i <= n; i += num) {
if (b[i - 1]) {
flag++; // numの倍数(numを除く)の個数
}
if ((a[i - 1] && flag % 2 == 0) || (!(a[i - 1]) && flag % 2 == 1)) {
b[num - 1] = 1;
}
}
num--;
}
int sum = 0;
bool allzero = true;
for (i = 0; i < n; i++) {
if (b[i]) {
allzero = false;
sum++;
}
}
if (allzero) {
cout << 0 << endl;
return 0;
}
cout << sum << endl;
for (i = 0; i < n; i++) {
if (b[i]) {
cout << i + 1 << " ";
}
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll i, j, k;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n, 0);
int num = n;
int flag;
while (num > 0) {
flag = 0;
for (i = num; i <= n; i += num) {
if (b[i - 1]) {
flag++; // numの倍数の個数
}
}
if ((a[num - 1] && flag % 2 == 0) || (!(a[num - 1]) && flag % 2 == 1)) {
b[num - 1] = 1;
}
num--;
}
int sum = 0;
bool allzero = true;
for (i = 0; i < n; i++) {
if (b[i]) {
allzero = false;
sum++;
}
}
if (allzero) {
cout << 0 << endl;
return 0;
}
cout << sum << endl;
for (i = 0; i < n; i++) {
if (b[i]) {
cout << i + 1 << " ";
}
}
cout << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 777,880 | 777,881 | u582588783 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define repf(i, m, n) for (int i = (m); 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;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
//////////////////////////////////////////////////
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
repf(i, 1, n + 1) cin >> a[i];
vector<int> b(n + 1);
int m = 0;
for (int i = n; i >= 1; i--) {
int sum = a[i];
for (int j = i + i; j <= n; j += i) {
sum += b[i];
}
b[i] = sum % 2;
if (b[i])
m++;
}
cout << m << endl;
if (m) {
repf(i, 1, n + 1) {
if (b[i])
cout << i << endl;
}
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define repf(i, m, n) for (int i = (m); 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;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
//////////////////////////////////////////////////
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
repf(i, 1, n + 1) cin >> a[i];
vector<int> b(n + 1);
int m = 0;
for (int i = n; i >= 1; i--) {
int sum = a[i];
for (int j = i + i; j <= n; j += i) {
sum += b[j];
}
b[i] = sum % 2;
if (b[i])
m++;
}
cout << m << endl;
if (m) {
repf(i, 1, n + 1) {
if (b[i])
cout << i << endl;
}
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,882 | 777,883 | u374929478 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> a(n + 10, 0);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 10, 0);
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i + i; j <= n; j += j) {
cnt ^= b[j];
}
b[i] = a[i] ^ cnt;
}
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 < (int)ans.size(); i++) {
printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' ');
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> a(n + 10, 0);
for (int i = 0; i < n; i++)
cin >> a[i + 1];
vector<int> b(n + 10, 0);
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i + i; j <= n; j += i) {
cnt ^= b[j];
}
b[i] = a[i] ^ cnt;
}
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 < (int)ans.size(); i++) {
printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' ');
}
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 777,884 | 777,885 | u374929478 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.