problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
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[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>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
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[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,159 | 777,160 | u601384736 | 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;
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(b[i]);
}
int s = ans.size();
cout << s << endl;
rep(i, s) { printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' '); }
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int 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);
}
int s = ans.size();
cout << s << endl;
rep(i, s) { printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' '); }
}
| [
"call.arguments.change"
] | 777,163 | 777,164 | u147556624 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans(n);
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 < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
b[i] = sum ^ a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(i);
}
cout << ans.size() << endl;
rep(i, ans.size()) {
printf("%d%c", ans[i], i + 1 == ans.size() ? '\n' : ' ');
}
}
| [] | 777,165 | 777,166 | u147556624 | cpp |
p02972 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL << 60
const double PI = 3.14159265358979323846;
int A[200009];
int check[200009]; // -1:未定 0:0個 1:1個
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
check[N] = A[N] % 2;
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = 2; i * j <= N; j++)
cnt += check[i * j];
cnt %= 2;
check[i] = abs(A[i] - check[i]);
}
int M = 0;
for (int i = 1; i <= N; i++)
if (check[i] == 1)
M++;
cout << M << endl;
if (M > 0) {
for (int i = 1; i <= N; i++)
if (check[i] == 1)
cout << i << " ";
cout << endl;
}
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL << 60
const double PI = 3.14159265358979323846;
int A[200009];
int check[200009]; // -1:未定 0:0個 1:1個
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
check[N] = A[N] % 2;
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = 2; i * j <= N; j++)
cnt += check[i * j];
cnt %= 2;
check[i] = abs(A[i] - cnt);
}
int M = 0;
for (int i = 1; i <= N; i++)
if (check[i] == 1)
M++;
cout << M << endl;
if (M > 0) {
for (int i = 1; i <= N; i++)
if (check[i] == 1)
cout << i << " ";
cout << endl;
}
return 0;
} | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 777,170 | 777,171 | u774652316 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> b(n, 0);
for (int i = n - 1; i >= n / 2; --i) {
b[i] = a[i];
}
for (int i = n / 2 - 1; i >= 0; --i) {
int sum = 0;
for (int j = i + 1; j < n; j += i + 1) {
sum += b[j - 1];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
}
int sum = 0;
for (int i = 0; i < n; ++i) {
if (b[i] == 1) {
++sum;
}
}
cout << sum << endl;
for (int i = 0; i < n; ++i) {
if (b[i] == 1) {
cout << i + 1 << ' ';
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> b(n, 0);
for (int i = n - 1; i >= n / 2; --i) {
b[i] = a[i];
}
for (int i = n / 2 - 1; i >= 0; --i) {
int sum = 0;
for (int j = i + 1; j <= n; j += i + 1) {
sum += b[j - 1];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
}
int sum = 0;
for (int i = 0; i < n; ++i) {
if (b[i] == 1) {
++sum;
}
}
cout << sum << endl;
for (int i = 0; i < n; ++i) {
if (b[i] == 1) {
cout << i + 1 << ' ';
}
}
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,172 | 777,173 | u701556979 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> b(n, 0);
for (int i = n - 1; i >= n / 2; --i) {
b[i] = a[i];
}
for (int i = n / 2 - 1; i >= 0; --i) {
int sum = 0;
for (int j = i + 1; j < n; j += j) {
sum += b[j - 1];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
}
int sum = 0;
for (int i = 0; i < n; ++i) {
if (b[i] == 1) {
++sum;
}
}
cout << sum << endl;
for (int i = 0; i < n; ++i) {
if (b[i] == 1) {
cout << i + 1 << ' ';
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> b(n, 0);
for (int i = n - 1; i >= n / 2; --i) {
b[i] = a[i];
}
for (int i = n / 2 - 1; i >= 0; --i) {
int sum = 0;
for (int j = i + 1; j <= n; j += i + 1) {
sum += b[j - 1];
}
if (sum % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
}
int sum = 0;
for (int i = 0; i < n; ++i) {
if (b[i] == 1) {
++sum;
}
}
cout << sum << endl;
for (int i = 0; i < n; ++i) {
if (b[i] == 1) {
cout << i + 1 << ' ';
}
}
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"control_flow.loop.for.update.change",
"assignment.change"
] | 777,174 | 777,173 | u701556979 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
typedef long long ll;
int a[maxn * 2];
int b[maxn * 2];
int ans[maxn];
int cnt = 0;
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j++) {
sum += b[j];
}
if (sum % 2 != a[i]) {
b[i] = 1;
ans[cnt++] = i;
}
}
printf("%d\n", cnt);
for (int i = 0; i < cnt; i++)
printf("%d%c", ans[i], i == cnt - 1 ? '\n' : ' ');
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
typedef long long ll;
int a[maxn * 2];
int b[maxn * 2];
int ans[maxn];
int cnt = 0;
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i]) {
b[i] = 1;
ans[cnt++] = i;
}
}
printf("%d\n", cnt);
for (int i = 0; i < cnt; i++)
printf("%d%c", ans[i], i == cnt - 1 ? '\n' : ' ');
return 0;
} | [] | 777,177 | 777,178 | u131573212 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define MAX 200005
#define INF 1001001001
using namespace std;
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
rep(i, n) { cin >> a[i]; }
int m = 0;
for (int i = n - 1; i >= 0; i--) {
int sumi = 0;
int ki = (i + 1) * 2;
while (ki <= n) {
sumi ^= a[ki - 1];
ki += i + 1;
}
ans[i] = a[i] ^ sumi;
m += ans[i];
}
cout << m << endl;
rep(i, n) {
if (ans[i]) {
cout << i + 1 << " ";
}
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define MAX 200005
#define INF 1001001001
using namespace std;
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
rep(i, n) { cin >> a[i]; }
int m = 0;
for (int i = n - 1; i >= 0; i--) {
int sumi = 0;
int ki = (i + 1) * 2;
while (ki <= n) {
sumi ^= ans[ki - 1];
ki += i + 1;
}
ans[i] = a[i] ^ sumi;
m += ans[i];
}
cout << m << endl;
rep(i, n) {
if (ans[i]) {
cout << i + 1 << " ";
}
}
cout << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 777,179 | 777,180 | u930997891 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define show(a, n) \
rep(i, n) { cout << a[i] << ' '; } \
cout << endl;
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<long long, long long> pll;
const int INF = 1 << 30;
const long long INFL = 1LL << 62;
const int MOD = 1000000007;
const int MAX = 100000;
const int N = 200000;
int main() {
int n;
cin >> n;
int a[N + 1];
rep1(i, n) cin >> a[i];
bool ans[N + 1];
rep1(i, n) ans[i] = false;
for (int i = n; i >= 1; i--) {
int count = 0;
for (int j = i; j <= n; j += i) {
if (ans[i])
count++;
}
if (a[i] != count % 2) {
ans[i] = true;
}
}
int m = 0;
vi v;
rep1(i, n) {
if (ans[i]) {
m++;
v.push_back(i);
}
}
cout << m << endl;
if (m == 0)
return 0;
rep(i, v.size() - 1) cout << v[i] << ' ';
cout << v[v.size() - 1] << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define show(a, n) \
rep(i, n) { cout << a[i] << ' '; } \
cout << endl;
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<long long, long long> pll;
const int INF = 1 << 30;
const long long INFL = 1LL << 62;
const int MOD = 1000000007;
const int MAX = 100000;
const int N = 200000;
int main() {
int n;
cin >> n;
int a[N + 1];
rep1(i, n) cin >> a[i];
bool ans[N + 1];
rep1(i, n) ans[i] = false;
for (int i = n; i >= 1; i--) {
int count = 0;
for (int j = i; j <= n; j += i) {
if (ans[j])
count++;
}
if (a[i] != count % 2) {
ans[i] = true;
}
}
int m = 0;
vi v;
rep1(i, n) {
if (ans[i]) {
m++;
v.push_back(i);
}
}
cout << m << endl;
if (m == 0)
return 0;
rep(i, v.size() - 1) cout << v[i] << ' ';
cout << v[v.size() - 1] << endl;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 777,190 | 777,191 | u489108157 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
bool is_prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return 0;
}
return true;
}
vector<bool> prime_table(int n) {
vector<bool> prime(n + 1, 1);
prime[0] = 0;
prime[1] = 0;
for (int i = 2; i * i <= n; i++) {
if (!prime[i])
continue;
for (int j = i * i; j <= n; j++)
prime[j] = 0;
}
return prime;
}
map<int, int> prime_factor(int n) {
map<int, int> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n]++;
return res;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) { return modpow(a, mod - 2, mod); }
vector<int> divisor(int x) {
vector<int> res;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0) {
res.emplace_back(i);
if (i * i != x)
res.emplace_back(x / i);
}
}
return res;
}
int main() {
int n;
cin >> n;
vector<bool> a(n);
REP(i, n) {
int b;
cin >> b;
a[i] = b ? 1 : 0;
}
vector<bool> ans(n, 0);
int v = 0;
REP(i, n) {
if (a[n - 1 - i]) {
v++;
ans[n - 1 - i] = 1;
vector<int> f = divisor(n - 1 - i);
for (auto p : f)
a[p] = (!a[p]);
}
}
cout << v << endl;
bool f = 0;
REP(i, n) {
if (ans[i]) {
if (f)
cout << " ";
f = 1;
cout << i + 1;
}
}
if (v != 0)
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
bool is_prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return 0;
}
return true;
}
vector<bool> prime_table(int n) {
vector<bool> prime(n + 1, 1);
prime[0] = 0;
prime[1] = 0;
for (int i = 2; i * i <= n; i++) {
if (!prime[i])
continue;
for (int j = i * i; j <= n; j++)
prime[j] = 0;
}
return prime;
}
map<int, int> prime_factor(int n) {
map<int, int> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n]++;
return res;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) { return modpow(a, mod - 2, mod); }
vector<int> divisor(int x) {
vector<int> res;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0) {
res.emplace_back(i);
if (i * i != x)
res.emplace_back(x / i);
}
}
return res;
}
int main() {
int n;
cin >> n;
vector<bool> a(n);
REP(i, n) {
int b;
cin >> b;
a[i] = b ? 1 : 0;
}
vector<bool> ans(n, 0);
int v = 0;
REP(i, n) {
if (a[n - 1 - i]) {
v++;
ans[n - 1 - i] = 1;
vector<int> f = divisor(n - i);
for (auto p : f)
a[p - 1] = (!a[p - 1]);
}
}
cout << v << endl;
bool f = 0;
REP(i, n) {
if (ans[i]) {
if (f)
cout << " ";
f = 1;
cout << i + 1;
}
}
if (v != 0)
cout << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 777,192 | 777,193 | u291873788 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
void solve(const vector<int> &v) {
int N = v.size() - 1;
vector<int> ret(v.size(), 0);
REP(i, N / 2 + 1, N + 1) { ret[i] = v[i]; }
for (int i = N / 2; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= N; j += i) {
sum += ret[i];
}
if ((sum % 2 == 0 && v[i] == 1) || (sum % 2 == 1 && v[i] == 0)) {
ret[i] = 1;
}
}
vector<int> w;
REP(i, 1, ret.size()) if (ret[i] == 1) w.push_back(i);
cout << w.size() << endl;
rep(i, w.size()) {
if (i > 0)
cout << " ";
cout << w[i];
}
if (w.size() > 0)
cout << endl;
}
int main() {
int N;
cin >> N;
vector<int> v;
v.push_back(0);
rep(i, N) {
int a;
cin >> a;
v.push_back(a);
}
solve(v);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
void solve(const vector<int> &v) {
int N = v.size() - 1;
vector<int> ret(v.size(), 0);
REP(i, N / 2 + 1, N + 1) { ret[i] = v[i]; }
for (int i = N / 2; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= N; j += i) {
sum += ret[j];
}
// cerr << i << "\t" << sum << "\t" << v[i] << endl;
if ((sum % 2 == 0 && v[i] == 1) || (sum % 2 == 1 && v[i] == 0)) {
ret[i] = 1;
}
}
vector<int> w;
REP(i, 1, ret.size()) if (ret[i] == 1) w.push_back(i);
cout << w.size() << endl;
rep(i, w.size()) {
if (i > 0)
cout << " ";
cout << w[i];
}
if (w.size() > 0)
cout << endl;
}
int main() {
int N;
cin >> N;
vector<int> v;
v.push_back(0);
rep(i, N) {
int a;
cin >> a;
v.push_back(a);
}
solve(v);
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,198 | 777,199 | u624678037 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
set<ll> ans;
vector<ll> b(n);
for (ll i = n; i > 0; i--) {
ll c = 0;
for (ll j = i * 2; i <= n; j += i) {
c += b[j - 1];
}
b[i - 1] = c % 2 == a[i - 1];
if (b[i - 1])
ans.insert(i);
}
cout << ans.size() << endl;
for (auto p : ans) {
if (*ans.begin() != p) {
cout << " ";
}
cout << p;
}
if (ans.size()) {
cout << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
set<ll> ans;
vector<ll> b(n);
for (ll i = n; i > 0; i--) {
ll c = 0;
for (ll j = i * 2; j <= n; j += i) {
c += b[j - 1];
}
b[i - 1] = c % 2 != a[i - 1];
if (b[i - 1])
ans.insert(i);
}
cout << ans.size() << endl;
for (auto p : ans) {
if (*ans.begin() != p) {
cout << " ";
}
cout << p;
}
if (ans.size()) {
cout << endl;
}
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change"
] | 777,202 | 777,203 | u718758485 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#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) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>; // P.first, P.second
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N;
cin >> N;
// 1-indexed
vector<int> a(N + 1);
rep1(i, N + 1) cin >> a[i];
// print(a);
vector<int> ans(N + 1, 0);
// v[i]:iの約数の列挙（そんなに多くない）
vector<vector<int>> v(N + 1);
for (int i = 1; i <= N; ++i) {
for (int x = 1; x * x <= N; ++x) {
if (i % x == 0) {
v[i].push_back(x);
if (x * x != i) {
v[i].push_back(i / x);
}
}
}
}
/* for (int i = 1; i <= N; ++i){
print(v[i]);
}*/
// iの倍数で何個入れたか
map<int, int> map;
for (int i = N; i >= 1; --i) {
if (map[i] % 2 != a[i]) {
ans[i] = 1;
}
if (ans[i]) {
int NN = v[i].size();
for (int j = 0; j < NN; ++j) {
map[v[i][j]]++;
}
}
}
/* for (int i = 1; i <= N; ++i){
cerr<<i<<": "<<map[i]<<endl;
}*/
// print(ans);
int M = 0;
for (int i = 1; i <= N; ++i) {
if (ans[i])
M++;
}
cout << M << endl;
for (int i = 1; i <= N; ++i) {
if (ans[i]) {
cout << i;
if (i == N)
cout << endl;
else {
cout << " ";
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
#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) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>; // P.first, P.second
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N;
cin >> N;
// 1-indexed
vector<int> a(N + 1);
rep1(i, N + 1) cin >> a[i];
// print(a);
vector<int> ans(N + 1, 0);
// v[i]:iの約数の列挙（そんなに多くない）
vector<vector<int>> v(N + 1);
for (int i = 1; i <= N; ++i) {
for (int x = 1; x * x <= i; ++x) {
if (i % x == 0) {
v[i].push_back(x);
if (x * x != i) {
v[i].push_back(i / x);
}
}
}
}
/* for (int i = 1; i <= N; ++i){
print(v[i]);
}*/
// iの倍数で何個入れたか
map<int, int> map;
for (int i = N; i >= 1; --i) {
if (map[i] % 2 != a[i]) {
ans[i] = 1;
}
if (ans[i]) {
int NN = v[i].size();
for (int j = 0; j < NN; ++j) {
map[v[i][j]]++;
}
}
} /*
for (int i = 1; i <= N; ++i){
cerr<<i<<": "<<map[i]<<endl;
}*/
/*print(ans);*/
int M = 0;
for (int i = 1; i <= N; ++i) {
if (ans[i])
M++;
}
cout << M << endl;
for (int i = 1; i <= N; ++i) {
if (ans[i]) {
cout << i;
if (i == N)
cout << endl;
else {
cout << " ";
}
}
}
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,205 | 777,206 | u106297876 | cpp |
p02972 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int n;
cin >> n;
vector<int> vec(n + 1);
for (int i = 1; i <= n; i++) {
cin >> vec[i];
}
vector<int> ans;
vector<int> build(n + 1);
for (int i = n; i >= 1; i--) {
int sum = build[i];
for (int j = i + i; j <= n; j += i) {
sum += build[j];
}
if (sum % 2 != vec[i]) {
build[i] += 1;
ans.push_back(i);
}
}
bool exist = true;
for (int i = 1; i <= n && exist == true; i++) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += vec[j];
}
exist &= (sum % 2 == vec[i]);
}
if (exist == false) {
cout << "-1" << endl;
} else {
cout << ans.size() << endl;
for (int a : ans) {
cout << a << " ";
}
}
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int n;
cin >> n;
vector<int> vec(n + 1);
for (int i = 1; i <= n; i++) {
cin >> vec[i];
}
vector<int> ans;
vector<int> build(n + 1);
for (int i = n; i >= 1; i--) {
int sum = build[i];
for (int j = i + i; j <= n; j += i) {
sum += build[j];
}
if (sum % 2 != vec[i]) {
build[i] += 1;
ans.push_back(i);
}
}
bool exist = true;
for (int i = 1; i <= n && exist == true; i++) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += build[j];
}
exist &= (sum % 2 == vec[i]);
}
if (exist == false) {
cout << "-1" << endl;
} else {
cout << ans.size() << endl;
for (int a : ans) {
cout << a << " ";
}
}
} | [
"assignment.value.change",
"identifier.change"
] | 777,207 | 777,208 | u251058942 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[1000000];
int ret[1000000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += ret[j];
if ((sum % 2) != a[i]) {
ret[i] = 1;
vec.push_back(i);
}
}
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += ret[i];
if ((sum % 2) != a[i]) {
cout << -1 << endl;
return 0;
}
}
cout << vec.size() << endl;
for (auto x : vec)
cout << x << ' ';
} | #include <bits/stdc++.h>
using namespace std;
int a[1000000];
int ret[1000000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += ret[j];
if ((sum % 2) != a[i]) {
ret[i] = 1;
vec.push_back(i);
}
}
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += ret[j];
if ((sum % 2) != a[i]) {
cout << -1 << endl;
return 0;
}
}
cout << vec.size() << endl;
for (auto x : vec)
cout << x << ' ';
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,209 | 777,210 | u109635851 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int a[1000000];
int ret[1000000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += ret[i];
if ((sum % 2) != a[i]) {
ret[i] = 1;
vec.push_back(i);
}
}
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += ret[i];
if ((sum % 2) != a[i]) {
cout << -1 << endl;
return 0;
}
}
cout << vec.size() << endl;
for (auto x : vec)
cout << x << ' ';
} | #include <bits/stdc++.h>
using namespace std;
int a[1000000];
int ret[1000000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> vec;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += ret[j];
if ((sum % 2) != a[i]) {
ret[i] = 1;
vec.push_back(i);
}
}
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += ret[j];
if ((sum % 2) != a[i]) {
cout << -1 << endl;
return 0;
}
}
cout << vec.size() << endl;
for (auto x : vec)
cout << x << ' ';
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,211 | 777,210 | u109635851 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> b(N + 1);
vector<int> res;
FOR(i, 1, N + 1) cin >> a[i];
for (int i = N; i >= 1; i--) {
int k = 2, sum = 0;
while (i * k <= N) {
if (b[i])
sum++;
k++;
}
if (sum % 2 == 0 && a[i] == 1) {
res.push_back(i);
b[i]++;
} else if (sum % 2 == 1 && a[i] == 0) {
res.push_back(i);
b[i]++;
}
}
cout << res.size() << endl;
rep(i, res.size()) cout << res[i] << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> b(N + 1, 0);
vector<int> res;
FOR(i, 1, N + 1) cin >> a[i];
for (int i = N; i >= 1; i--) {
int k = 2, sum = 0;
while (i * k <= N) {
if (b[i * k])
sum++;
k++;
}
if (sum % 2 == 0 && a[i] == 1) {
res.push_back(i);
b[i]++;
} else if (sum % 2 == 1 && a[i] == 0) {
res.push_back(i);
b[i]++;
}
}
cout << res.size() << endl;
rep(i, res.size()) cout << res[i] << endl;
return 0;
} | [
"call.arguments.add",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,222 | 777,223 | u917282863 | cpp |
p02972 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define pb(n) push_back(n)
#define endl '\n'
#define debug(x) cout << #x << " = " << (x) << endl
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int ii = 0; ii < (V).size(); ii++) { \
cin >> (V).at(ii); \
}
#define OUT(n) cout << n << endl
#define OUT2(n1, n2) cout << n1 << " " << n2 << endl
#define OUT3(n1, n2, n3) cout << n << " " << n2 << " " << n3 << endl
#define VOUT(V) \
REP(ii, (V).size()) { cout << (V)[ii] << " "; } \
cout << endl;
#define VOUT2(V) \
REP(jj, (V).size()) { VOUT(V[jj]) }
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pair<ll, ll>> vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;
typedef pair<ll, ll> P;
const long long INF = numeric_limits<ll>::max();
const long long MOD = 1000000007;
const long double PI = 3.1415926;
template <class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
ll n, m, k, ans, sum, cnt = 0;
string s;
char c;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n);
vi a(n);
VIN(a);
vi countar(n + 1);
FOR(i, 0, n + 1) countar[i] = 0;
vi ansv;
RFOR(i, 1, n + 1) {
cnt = 0;
FOR(j, 1, n / i + 1) {
// OUT3(i,j, countar[j]);
if (countar[j] == 1)
cnt++;
}
if (cnt % 2 == a[i - 1]) {
// nothing
} else {
countar[i] = 1;
ansv.pb(i);
}
// VOUT(countar);
}
OUT(ansv.size());
VOUT(ansv);
}
| #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define pb(n) push_back(n)
#define endl '\n'
#define debug(x) cout << #x << " = " << (x) << endl
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int ii = 0; ii < (V).size(); ii++) { \
cin >> (V).at(ii); \
}
#define OUT(n) cout << n << endl
#define OUT2(n1, n2) cout << n1 << " " << n2 << endl
#define OUT3(n1, n2, n3) cout << n1 << " " << n2 << " " << n3 << endl
#define VOUT(V) \
REP(ii, (V).size()) { cout << (V)[ii] << " "; } \
cout << endl;
#define VOUT2(V) \
REP(jj, (V).size()) { VOUT(V[jj]) }
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pair<ll, ll>> vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;
typedef pair<ll, ll> P;
const long long INF = numeric_limits<ll>::max();
const long long MOD = 1000000007;
const long double PI = 3.1415926;
template <class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
ll n, m, k, ans, sum, cnt = 0;
string s;
char c;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n);
vi a(n);
VIN(a);
vi countar(n + 1);
FOR(i, 0, n + 1) countar[i] = 0;
vi ansv;
RFOR(i, 1, n + 1) {
cnt = 0;
FOR(j, 1, n / i + 1) {
// OUT3(i, j, countar[j]);
if (countar[j * i] == 1)
cnt++;
}
if (cnt % 2 == a[i - 1]) {
// nothing
} else {
countar[i] = 1;
ansv.pb(i);
}
// VOUT(countar);
}
OUT(ansv.size());
VOUT(ansv);
}
| [
"preprocessor.define.value.change",
"control_flow.branch.if.condition.change"
] | 777,224 | 777,225 | u524019694 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
if (b[k] == 1) {
sumBall++;
}
}
if (sumBall % 2 != a[i]) {
b[i] = 1;
}
}
std::vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(b[i]);
}
std::cout << ans.size() << std::endl;
for (int i = 0; i < ans.size(); i++) {
printf("%d%c", ans[i], ans.size() == i + 1 ? '\n' : ' ');
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
if (b[k] == 1) {
sumBall++;
}
}
if (sumBall % 2 != a[i]) {
b[i] = 1;
}
}
std::vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.emplace_back(i);
}
std::cout << ans.size() << std::endl;
for (int i = 0; i < ans.size(); i++) {
printf("%d%c", ans[i], ans.size() == i + 1 ? '\n' : ' ');
}
return 0;
}
| [
"call.function.change",
"call.arguments.change"
] | 777,226 | 777,227 | u782785740 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
if (b[k] == 1) {
sumBall++;
}
}
if (sumBall % 2 != a[i]) {
b[i] = 1;
}
}
std::vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.emplace_back(b[i]);
}
std::cout << ans.size() << std::endl;
for (int i = 0; i < ans.size(); i++) {
printf("%d%c", ans[i], ans.size() == i + 1 ? '\n' : ' ');
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
if (b[k] == 1) {
sumBall++;
}
}
if (sumBall % 2 != a[i]) {
b[i] = 1;
}
}
std::vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.emplace_back(i);
}
std::cout << ans.size() << std::endl;
for (int i = 0; i < ans.size(); i++) {
printf("%d%c", ans[i], ans.size() == i + 1 ? '\n' : ' ');
}
return 0;
}
| [
"call.arguments.change"
] | 777,228 | 777,227 | u782785740 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
if (b[k] == 1) {
sumBall++;
}
}
if (sumBall % 2 != a[i]) {
b[i] = 1;
}
}
std::vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.push_back(b[i]);
}
std::cout << ans.size() << std::endl;
for (int i = 0; i < ans.size(); i++) {
printf("%d%c", ans[i], ans.size() == i + 1 ? '\n' : ' ');
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
if (b[k] == 1) {
sumBall++;
}
}
if (sumBall % 2 != a[i]) {
b[i] = 1;
}
}
std::vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.emplace_back(i);
}
std::cout << ans.size() << std::endl;
for (int i = 0; i < ans.size(); i++) {
printf("%d%c", ans[i], ans.size() == i + 1 ? '\n' : ' ');
}
return 0;
} | [
"call.function.change",
"call.arguments.change"
] | 777,226 | 777,229 | u782785740 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
if (b[k] == 1) {
sumBall++;
}
}
if (sumBall % 2 != a[i]) {
b[i] = 1;
}
}
std::vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.emplace_back(b[i]);
}
std::cout << ans.size() << std::endl;
for (int i = 0; i < ans.size(); i++) {
printf("%d%c", ans[i], ans.size() == i + 1 ? '\n' : ' ');
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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];
}
for (int i = n; i > 0; i--) {
int sumBall = 0;
for (int k = i * 2; k <= n; k += i) {
if (b[k] == 1) {
sumBall++;
}
}
if (sumBall % 2 != a[i]) {
b[i] = 1;
}
}
std::vector<int> ans;
for (int i = 1; i <= n; i++) {
if (b[i])
ans.emplace_back(i);
}
std::cout << ans.size() << std::endl;
for (int i = 0; i < ans.size(); i++) {
printf("%d%c", ans[i], ans.size() == i + 1 ? '\n' : ' ');
}
return 0;
} | [
"call.arguments.change"
] | 777,228 | 777,229 | u782785740 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP2(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define RREP(i, s, e) for (int i = (int)(s); i >= (int)(e); --i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(), ie = (c).end(); i != ie; ++i)
#define ALL(c) (c).begin(), (c).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >> a[i]; }
vector<int> v(n, 0);
int cnt = 0;
RREP(i, n, 1) {
if (i * 2 > n) {
v[i - 1] = a[i - 1];
} else {
int sum = 0;
int j = i;
while (j + i <= n) {
j += i;
sum += a[j - 1];
}
v[i - 1] = a[i - 1] - sum % 2;
}
cnt += v[i - 1];
}
std::cout << cnt << '\n';
REP(i, n) {
if (v[i]) {
std::cout << i + 1 << ' ';
}
}
if (cnt > 0) {
std::cout << '\n';
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP2(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define RREP(i, s, e) for (int i = (int)(s); i >= (int)(e); --i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(), ie = (c).end(); i != ie; ++i)
#define ALL(c) (c).begin(), (c).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >> a[i]; }
vector<int> v(n, 0);
int cnt = 0;
RREP(i, n, 1) {
if (i * 2 > n) {
v[i - 1] = a[i - 1];
} else {
int sum = 0;
int j = i;
while (j + i <= n) {
j += i;
sum += v[j - 1];
}
v[i - 1] = abs(a[i - 1] - sum % 2);
}
cnt += v[i - 1];
}
std::cout << cnt << '\n';
REP(i, n) {
if (v[i]) {
std::cout << i + 1 << ' ';
}
}
if (cnt > 0) {
std::cout << '\n';
}
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.add",
"call.arguments.change"
] | 777,230 | 777,231 | u868099754 | 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 = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
using namespace std;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() {
cout << "Yes" << '\n';
exit(0);
}
inline void no() {
cout << "No" << '\n';
exit(0);
}
inline i64 gcd(i64 a, i64 b) {
if (min(a, b) == 0)
return max(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() {
static u64 x = 88172645463325252ull;
x = x ^ (x << 7);
return x = x ^ (x >> 9);
}
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(16);
solve();
return 0;
}
template <typename T>
class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T>
class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) {
if (x < y)
x = y;
}
template <typename T> inline void amin(T &x, T y) {
if (x > y)
x = y;
}
template <typename T> inline T power(T x, i64 n, T e = 1) {
T r = e;
while (n > 0) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
each(x, v) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
rep(i, v.size()) {
if (i)
os << ' ';
os << v[i];
}
return os;
}
template <typename T, typename S>
istream &operator>>(istream &is, pair<T, S> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> &p) {
os << p.first << ' ' << p.second;
return os;
}
void solve() {
int n;
cin >> n;
vi32 a(n);
cin >> a;
vector<bool> b(n);
rrep(i, n) {
int sum = 0;
int di = i + 1;
for (int j = di; j <= n; j += di) {
sum += a[j - 1];
sum %= 2;
}
if (sum == 1)
b[i] = true;
}
vi32 ans;
rep(i, n) if (b[i]) ans.push_back(i + 1);
cout << ans.size() << '\n';
if (ans.size() > 0)
cout << ans << '\n';
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
using namespace std;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() {
cout << "Yes" << '\n';
exit(0);
}
inline void no() {
cout << "No" << '\n';
exit(0);
}
inline i64 gcd(i64 a, i64 b) {
if (min(a, b) == 0)
return max(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() {
static u64 x = 88172645463325252ull;
x = x ^ (x << 7);
return x = x ^ (x >> 9);
}
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(16);
solve();
return 0;
}
template <typename T>
class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T>
class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) {
if (x < y)
x = y;
}
template <typename T> inline void amin(T &x, T y) {
if (x > y)
x = y;
}
template <typename T> inline T power(T x, i64 n, T e = 1) {
T r = e;
while (n > 0) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
each(x, v) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
rep(i, v.size()) {
if (i)
os << ' ';
os << v[i];
}
return os;
}
template <typename T, typename S>
istream &operator>>(istream &is, pair<T, S> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> &p) {
os << p.first << ' ' << p.second;
return os;
}
void solve() {
int n;
cin >> n;
vi32 a(n);
cin >> a;
vector<bool> b(n);
rrep(i, n) {
int sum = 0;
int di = i + 1;
for (int j = di; j <= n; j += di) {
sum += b[j - 1];
sum %= 2;
}
if (sum != a[i])
b[i] = true;
}
vi32 ans;
rep(i, n) if (b[i]) ans.push_back(i + 1);
cout << ans.size() << '\n';
if (ans.size() > 0)
cout << ans << '\n';
}
| [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,232 | 777,233 | u908318580 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SIZE(obj) (int)(obj).sizeT()
#define YESNO(cond, yes, no) \
{ cout << ((cond) ? (yes) : (no)) << endl; }
#define SORT(list) sort(ALL((list)));
#define RSORT(list) sort((list).rbegin(), (list).rend())
#define ASSERT(cond, mes) assert(cond &&mes)
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'050'000'000;
template <typename T> T round_up(const T &a, const T &b) {
return (a + (b - 1)) / b;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << p.first << p.second;
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
REP(i, (int)v.size())
is >> v[i];
return is;
}
template <typename T> T clamp(T &n, T a, T b) {
if (n < a)
n = a;
if (n > b)
n = b;
return n;
}
template <typename T> static T GCD(T u, T v) {
T r;
while (v != 0) {
r = u % v;
u = v;
v = r;
}
return u;
}
template <typename T> static T LCM(T u, T v) { return u / GCD(u, v) * v; }
std::vector<ll> enum_div(ll n) {
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
struct ToUpper {
char operator()(char c) { return toupper(c); }
};
struct ToLower {
char operator()(char c) { return tolower(c); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N;
cin >> N;
vector<int> A(N);
cin >> A;
vector<bool> balls(N, false);
FORR(i, N, 0) {
int cnt = 0;
for (int j = i + 1; j < N; j += (i + 1)) {
if (balls[j])
cnt++;
}
if (cnt % 2 != A[i])
balls[i] = true;
}
cout << count(ALL(balls), true) << endl;
REP(i, N) {
if (balls[i]) {
cout << i + 1 << " ";
}
}
cout << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SIZE(obj) (int)(obj).sizeT()
#define YESNO(cond, yes, no) \
{ cout << ((cond) ? (yes) : (no)) << endl; }
#define SORT(list) sort(ALL((list)));
#define RSORT(list) sort((list).rbegin(), (list).rend())
#define ASSERT(cond, mes) assert(cond &&mes)
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'050'000'000;
template <typename T> T round_up(const T &a, const T &b) {
return (a + (b - 1)) / b;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << p.first << p.second;
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
REP(i, (int)v.size())
is >> v[i];
return is;
}
template <typename T> T clamp(T &n, T a, T b) {
if (n < a)
n = a;
if (n > b)
n = b;
return n;
}
template <typename T> static T GCD(T u, T v) {
T r;
while (v != 0) {
r = u % v;
u = v;
v = r;
}
return u;
}
template <typename T> static T LCM(T u, T v) { return u / GCD(u, v) * v; }
std::vector<ll> enum_div(ll n) {
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
struct ToUpper {
char operator()(char c) { return toupper(c); }
};
struct ToLower {
char operator()(char c) { return tolower(c); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N;
cin >> N;
vector<int> A(N);
cin >> A;
vector<bool> balls(N, false);
FORR(i, N, 0) {
int cnt = 0;
for (int j = i; j < N; j += (i + 1)) {
if (balls[j])
cnt++;
}
if (cnt % 2 != A[i])
balls[i] = true;
}
cout << count(ALL(balls), true) << endl;
REP(i, N) {
if (balls[i]) {
cout << i + 1 << " ";
}
}
cout << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 777,243 | 777,244 | u303039933 | cpp |
p02972 | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define pll pair<ll, ll>
#define all(x) x.begin(), x.end()
#define vll vector<ll>
const ll inf = (ll)(1e17 + 17);
const ll mod = (ll)(1e9 + 7);
int main() {
IOS
#ifdef SHAN
freopen("input.txt", "r", stdin);
#endif
ll n;
cin >> n;
vll a(n + 1);
vll ball(n + 1, 0);
for (ll i = 1; i <= n; i++)
cin >> a[i];
vll ans;
for (ll i = n; i >= 1; i--) {
ll x = 0;
for (ll j = i * 2; j <= n; j += i) {
x += ball[j];
}
if (x % 2 == a[i])
continue;
else {
ball[i] = 1;
ans.pb(a[i]);
}
}
// for(ll i = 1; i <= n; i++) cout << ball[i] << " ";
for (ll i = n; i >= 1; i--) {
ll x = 0;
for (ll j = i; j <= n; j += i) {
x += ball[j];
}
// cout << x << " ";
if (x % 2 == a[i])
continue;
else {
cout << -1;
return 0;
}
}
cout << ans.size() << endl;
for (auto it : ans)
cout << it << " ";
return 0;
} // good night. | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define pll pair<ll, ll>
#define all(x) x.begin(), x.end()
#define vll vector<ll>
const ll inf = (ll)(1e17 + 17);
const ll mod = (ll)(1e9 + 7);
int main() {
IOS
#ifdef SHAN
freopen("input.txt", "r", stdin);
#endif
ll n;
cin >> n;
vll a(n + 1);
vll ball(n + 1, 0);
for (ll i = 1; i <= n; i++)
cin >> a[i];
vll ans;
for (ll i = n; i >= 1; i--) {
ll x = 0;
for (ll j = i * 2; j <= n; j += i) {
x += ball[j];
}
if (x % 2 == a[i])
continue;
else {
ball[i] = 1;
ans.pb(i);
}
}
for (ll i = n; i >= 1; i--) {
ll x = 0;
for (ll j = i; j <= n; j += i) {
x += ball[j];
}
// cout << x << " ";
if (x % 2 == a[i])
continue;
else {
cout << -1;
return 0;
}
}
cout << ans.size() << endl;
for (auto it : ans)
cout << it << " ";
return 0;
} // good night. | [
"call.arguments.change"
] | 777,247 | 777,248 | u032226420 | cpp |
p02972 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
void solve() {
ll N;
cin >> N;
vector<ll> a(N);
for (ll i = 0; i < N; i++) {
cin >> a.at(i);
}
// i = 1から順に調べる
vector<ll> box(N, 0);
vector<ll> b;
for (ll i = N; i >= 1; i--) {
// 倍数全部調べてボールの数を確認
ll jballcount = 0;
for (ll j = 1; i * j <= N; j++) {
jballcount += box.at(j - 1);
}
// ボール数が条件を満たしてない場合 満たすようにボール入れる
if (jballcount % 2 != a.at(i - 1)) {
box.at(i - 1) = 1;
b.push_back(i);
}
}
ll M = b.size();
cout << M << endl;
if (M != 0) {
cout << b.at(0);
for (ll xx = 1; xx < M; xx++) {
cout << " " << b.at(xx);
}
cout << endl;
}
return;
}
int main() {
solve();
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
void solve() {
ll N;
cin >> N;
vector<ll> a(N);
for (ll i = 0; i < N; i++) {
cin >> a.at(i);
}
// i = 1から順に調べる
vector<ll> box(N, 0);
vector<ll> b;
for (ll i = N; i >= 1; i--) {
// 倍数全部調べてボールの数を確認
ll jballcount = 0;
for (ll j = 1; j * i <= N; j++) {
jballcount += box.at(j * i - 1);
}
// ボール数が条件を満たしてない場合 満たすようにボール入れる
if (jballcount % 2 != a.at(i - 1)) {
box.at(i - 1) = 1;
b.push_back(i);
}
}
ll M = b.size();
cout << M << endl;
if (M != 0) {
cout << b.at(0);
for (ll xx = 1; xx < M; xx++) {
cout << " " << b.at(xx);
}
cout << endl;
}
return;
}
int main() {
solve();
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 777,249 | 777,250 | u941251324 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
// cout << a.at(i) << " ";
}
vector<int> b(N);
int j, sum;
for (int i = N; i > 0; i--) {
sum = 0;
j = 2 * i;
while (j <= N) {
sum += a.at(j - 1);
j += i;
}
if (a.at(i - 1) != sum % 2)
b.at(i - 1) = 1;
else
b.at(i - 1) = 0;
}
int M = 0;
for (int i = 0; i < N; i++) {
M += b.at(i);
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (b.at(i))
cout << i + 1 << " ";
}
cout << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
vector<int> b(N);
int j, sum;
for (int i = N; i > 0; i--) {
sum = 0;
j = 2 * i;
while (j <= N) {
sum += b.at(j - 1);
j += i;
}
if (a.at(i - 1) != sum % 2)
b.at(i - 1) = 1;
else
b.at(i - 1) = 0;
}
int M = 0;
for (int i = 0; i < N; i++) {
M += b.at(i);
}
cout << M << endl;
for (int i = 0; i < N; i++) {
if (b.at(i))
cout << i + 1 << " ";
}
cout << endl;
return (0);
}
| [
"assignment.value.change",
"identifier.change"
] | 777,253 | 777,254 | u616090453 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define repn(i, x) for (int i = 1; i <= (int)(x); i++)
#define repr(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define reprn(i, x) for (int i = ((int)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
typedef long long int64;
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1 << 29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
//逆元を求める関数
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
//組み合わせ
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) { cin >> a[i + 1]; }
for (int i = n; 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;
repn(i, n) {
if (b[i]) {
ans.emplace_back(b[i]);
}
}
cout << ans.size() << endl;
rep(i, ans.size()) { cout << ans[i] << endl; }
return;
}
int main() {
solve();
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define repn(i, x) for (int i = 1; i <= (int)(x); i++)
#define repr(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define reprn(i, x) for (int i = ((int)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
typedef long long int64;
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1 << 29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
//逆元を求める関数
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
//組み合わせ
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) { cin >> a[i + 1]; }
for (int i = n; i >= 1; --i) {
int sum = 0;
// i以外の倍数について配置数の偶奇をチェックする
for (int j = i + i; j <= n; j += i) {
sum ^= b[j];
}
// a[i]と偶奇が一致しない場合はボールを配置する
//偶奇が一致する場合はa[i]より多い個数を配置してしまうのでボールを置かない
b[i] = sum ^ a[i];
}
vector<int> ans;
//ボールを配置した場所の数値を出力する
repn(i, n) {
if (b[i]) {
ans.emplace_back(i);
}
}
cout << ans.size() << endl;
rep(i, ans.size()) { cout << ans[i] << endl; }
return;
}
int main() {
solve();
return 0;
}
| [
"call.arguments.change"
] | 777,266 | 777,267 | u781381862 | cpp |
p02972 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define repn(i, x) for (int i = 1; i <= (int)(x); i++)
#define repr(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define reprn(i, x) for (int i = ((int)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
typedef long long int64;
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1 << 29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
//逆元を求める関数
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
//組み合わせ
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) { cin >> a[i + 1]; }
for (int i = n; 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;
repn(i, n) {
if (b[i]) {
ans.emplace_back(b[i]);
}
}
cout << ans.size() << endl;
rep(i, ans.size()) { cout << ans[i] << endl; }
return;
}
int main() {
solve();
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define repn(i, x) for (int i = 1; i <= (int)(x); i++)
#define repr(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define reprn(i, x) for (int i = ((int)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
typedef long long int64;
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1 << 29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
//逆元を求める関数
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
//組み合わせ
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) { cin >> a[i + 1]; }
for (int i = n; 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;
repn(i, n) {
if (b[i]) {
ans.emplace_back(i);
}
}
cout << ans.size() << endl;
rep(i, ans.size()) { cout << ans[i] << endl; }
return;
}
int main() {
solve();
return 0;
}
| [
"call.arguments.change"
] | 777,266 | 777,269 | u781381862 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
int m = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool goodIn = true;
for (int i = n - 1; i >= 0; i--) {
int cnt = 0;
for (int j = 2 * (i + 1) - 1; j < n; j += (i + 1)) {
cnt += b[j];
}
if (cnt % 2 != a[i]) {
b[i] = 1;
m++;
}
}
if (goodIn) {
cout << m << endl;
for (int i = 0; i < b.size(); i++) {
if (b[i] != 0) {
cout << b[i] << " ";
}
}
} else {
cout << -1;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
int m = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool goodIn = true;
for (int i = n - 1; i >= 0; i--) {
int cnt = 0;
for (int j = 2 * (i + 1) - 1; j < n; j += (i + 1)) {
cnt += b[j];
}
if (cnt % 2 != a[i]) {
b[i] = 1;
m++;
}
}
if (goodIn) {
cout << m << endl;
for (int i = 0; i < b.size(); i++) {
if (b[i] != 0) {
cout << i + 1 << " ";
}
}
} else {
cout << -1;
}
} | [
"io.output.change"
] | 777,270 | 777,271 | u156778176 | cpp |
p02972 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
ll fac(ll a) { return a > 1 ? fac(a - 1) * a : 1; }
int main() {
// ios::sync_with_stdio(false);cin.tie(nullptr);
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
vector<int> ans(n, 0);
for (int i = n; i > 0; i--) {
int count = n / i;
int j = i - 1;
int tmp = 0;
REP(k, 1, count + 1) { tmp += ans[i * count - 1]; }
if (tmp % 2 != v[j])
ans[j] = 1;
}
int t = 0;
rep(i, n) {
if (ans[i] == 1)
t++;
}
cout << t << endl;
rep(i, n) {
if (ans[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
ll fac(ll a) { return a > 1 ? fac(a - 1) * a : 1; }
int main() {
// ios::sync_with_stdio(false);cin.tie(nullptr);
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
vector<int> ans(n, 0);
for (int i = n; i > 0; i--) {
int count = n / i;
int j = i - 1;
int tmp = 0;
REP(k, 1, count + 1) { tmp += ans[i * k - 1]; }
if (tmp % 2 != v[j])
ans[j] = 1;
}
int t = 0;
rep(i, n) {
if (ans[i] == 1)
t++;
}
cout << t << endl;
rep(i, n) {
if (ans[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 777,277 | 777,278 | u820341516 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
int main() {
ll N, M = 0;
cin >> N;
vll a(N + 1), b(N + 1), ans;
rep(i, N) { cin >> a[i + 1]; }
for (ll i = N; i > 0; i--) {
ll tmp = 0;
for (ll j = 2; j * i <= N; j++) {
tmp += b[j * i];
}
if ((tmp % 2) != a[i]) {
b[i] = 1;
M++;
}
}
cout << M << endl;
for (ll i = 0; i < N; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
int main() {
ll N, M = 0;
cin >> N;
vll a(N + 1), b(N + 1), ans;
rep(i, N) { cin >> a[i + 1]; }
for (ll i = N; i > 0; i--) {
ll tmp = 0;
for (ll j = 2; j * i <= N; j++) {
tmp += b[j * i];
}
if ((tmp % 2) != a[i]) {
b[i] = 1;
M++;
}
}
cout << M << endl;
for (ll i = 0; i <= N; i++) {
if (b[i] == 1) {
cout << i << " ";
}
}
cout << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,281 | 777,282 | u987913144 | cpp |
p02972 | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1];
memset(b, 0, sizeof(b));
a[0] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int num = 0;
for (int x = 2 * i; x <= n; x += i) {
num += b[x];
}
if (num % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
}
int sum = 0;
for (int i = 1; i <= n; i++)
sum += b[i];
if (b[1] == sum % 2) {
cout << sum << endl;
if (sum != 0) {
bool first = true;
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
if (!first) {
cout << " ";
} else {
first = false;
}
cout << i;
}
}
if (!first) {
cout << endl;
}
}
} else {
cout << "-1" << endl;
}
} | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1];
memset(b, 0, sizeof(b));
a[0] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--) {
int num = 0;
for (int x = 2 * i; x <= n; x += i) {
num += b[x];
}
if (num % 2 == a[i]) {
b[i] = 0;
} else {
b[i] = 1;
}
}
int sum = 0;
for (int i = 1; i <= n; i++)
sum += b[i];
// cout << "debug: ";
// for (int i=1; i<=n; i++) {
// if (i != 1)
// cout << " ";
// cout << b[i];
//}
// cout << endl;
if (a[1] == sum % 2) {
cout << sum << endl;
if (sum != 0) {
bool first = true;
for (int i = 1; i <= n; i++) {
if (b[i] == 1) {
if (!first) {
cout << " ";
} else {
first = false;
}
cout << i;
}
}
if (!first) {
cout << endl;
}
}
} else {
cout << "-1" << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,283 | 777,284 | u542474460 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<int> ans(N);
for (int i = 0; i < N; i++)
ans[i] = 0;
for (int i = N; i > 0; i--) {
int sum = 0;
for (int j = i; j < N; j += j) {
sum += ans[j - 1];
}
if (sum % 2 != a[i - 1])
ans[i - 1] = 1;
}
int M = 0;
for (int i = 0; i < N; i++)
if (ans[i] == 1)
M++;
cout << M << endl;
for (int i = 0; i < N; i++)
if (ans[i] == 1)
cout << i + 1 << " ";
}
| #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<int> ans(N);
for (int i = 0; i < N; i++)
ans[i] = 0;
for (int i = N; i > 0; i--) {
int sum = 0;
for (int j = i; j <= N; j += i) {
sum += ans[j - 1];
}
if (sum % 2 != a[i - 1])
ans[i - 1] = 1;
}
int M = 0;
for (int i = 0; i < N; i++)
if (ans[i] == 1)
M++;
cout << M << endl;
for (int i = 0; i < N; i++)
if (ans[i] == 1)
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,289 | 777,290 | u407539638 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int i, j;
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> boxes(n);
int tmp;
for (i = n; i > 0; i--) {
tmp = 0;
for (j = 2 * i; j < n; j += i) {
if (boxes[j - 1] == 1)
tmp++;
}
if (tmp % 2 == a[i - 1])
boxes[i - 1] = 0;
else
boxes[i - 1] = 1;
}
tmp = 0;
for (i = 0; i < n; i++) {
if (boxes[i] == 1)
tmp++;
}
cout << tmp << endl;
for (i = 0; i < n; i++) {
if (boxes[i] == 1)
cout << i + 1 << " ";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int i, j;
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> boxes(n);
int tmp;
for (i = n; i > 0; i--) {
tmp = 0;
for (j = 2 * i; j <= n; j += i) {
if (boxes[j - 1] == 1)
tmp++;
}
if (tmp % 2 == a[i - 1])
boxes[i - 1] = 0;
else
boxes[i - 1] = 1;
}
tmp = 0;
for (i = 0; i < n; i++) {
if (boxes[i] == 1)
tmp++;
}
cout << tmp << endl;
for (i = 0; i < n; i++) {
if (boxes[i] == 1)
cout << i + 1 << " ";
}
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,293 | 777,294 | u523698212 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int ball = 0;
for (int i = n; 0 < i; i--) {
if (0 == a.at(i - 1)) {
int total = 0;
for (int j = i * 2; j <= n; j += i) {
if (ans.at(j - 1) == 1)
total++;
}
if (total % 2 == 0) {
ans.at(i - 1) = 0;
} else {
ans.at(i - 1) = 1;
ball++;
}
} else {
int total = 0;
for (int j = i * 2; j <= n; j += i) {
if (ans.at(j - 1) == 1)
total++;
}
if (total % 2 == 0) {
ans.at(i - 1) = 1;
ball++;
} else
ans.at(i - 1) = 0;
}
}
if (ball == 0) {
cout << 0 << endl;
} else {
cout << ball << endl;
for (int i = 0; i < n; i++) {
if (a.at(i) == 1)
cout << i + 1 << ' ';
}
cout << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int ball = 0;
for (int i = n; 0 < i; i--) {
if (0 == a.at(i - 1)) {
int total = 0;
for (int j = i * 2; j <= n; j += i) {
if (ans.at(j - 1) == 1)
total++;
}
if (total % 2 == 0) {
ans.at(i - 1) = 0;
} else {
ans.at(i - 1) = 1;
ball++;
}
} else {
// cout << i << endl;
int total = 0;
for (int j = i * 2; j <= n; j += i) {
// cout << " " << j << endl;
if (ans.at(j - 1) == 1)
total++;
}
if (total % 2 == 0) {
ans.at(i - 1) = 1;
ball++;
} else
ans.at(i - 1) = 0;
}
}
if (ball == 0) {
cout << 0 << endl;
} else {
cout << ball << endl;
for (int i = 0; i < n; i++) {
if (ans.at(i) == 1)
cout << i + 1 << ' ';
}
cout << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,305 | 777,306 | u091552241 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], s[n + 1], sum[n + 1];
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = 0;
}
for (int i = n; i >= 1; i--) {
if (a[i] != sum[i] % 2) {
v.push_back(i);
for (int j = 1; j <= ceil(sqrt(i)); j++) {
if (i % j == 0) {
sum[j]++;
if (j * j != i) {
sum[i / j]++;
}
}
}
}
}
cout << v.size() << endl;
for (int i = 0; i < v.size(); i++) {
if (i)
cout << " ";
cout << v[i];
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], s[n + 1], sum[n + 1];
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = 0;
}
for (int i = n; i >= 1; i--) {
if (a[i] != sum[i] % 2) {
v.push_back(i);
for (int j = 1; j <= floor(sqrt(i)); j++) {
if (i % j == 0) {
sum[j]++;
if (j * j != i) {
sum[i / j]++;
}
}
}
}
}
cout << v.size() << endl;
for (int i = 0; i < v.size(); i++) {
if (i)
cout << " ";
cout << v[i];
}
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 777,325 | 777,326 | u142234618 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], s[n + 1], sum[n + 1];
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = 0;
}
for (int i = n; i >= 1; i--) {
if (a[i] != sum[i] % 2) {
v.push_back(i);
for (int j = 1; j <= ceil(sqrt(i)); j++) {
if (i % j == 0) {
sum[j]++;
if (j * j != i) {
sum[i / j]++;
}
}
}
}
}
cout << v.size() << endl;
for (int i = 0; i < v.size(); i++) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], s[n + 1], sum[n + 1];
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = 0;
}
for (int i = n; i >= 1; i--) {
if (a[i] != sum[i] % 2) {
v.push_back(i);
for (int j = 1; j <= floor(sqrt(i)); j++) {
if (i % j == 0) {
sum[j]++;
if (j * j != i) {
sum[i / j]++;
}
}
}
}
}
cout << v.size() << endl;
for (int i = 0; i < v.size(); i++) {
if (i)
cout << " ";
cout << v[i];
}
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 777,327 | 777,326 | u142234618 | cpp |
p02972 | //
// main.cpp
// test130
//
// Created by on 2019/06/16.
// Copyright © 2 All rights reserved.
//
//
// main.cpp
// new
//
// Created on 2019/06/09.
// Copyright All rights reserved.
//
// C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.
// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
// <http://www.gnu.org/licenses/>.
/** @file stdc++.h
* This is an implementation file for a precompiled header.
*/
// 17.4.1.2 Headers
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
using namespace std;
string x;
int n, m;
bool a[200004], box[200004];
vector<int> ans;
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int bai = 2, ave = 0;
while (1) {
if (bai * i > n) {
break;
}
if (a[bai * i])
ave++;
bai++;
}
if (ave % 2 != a[i]) {
box[i] = 1;
} else {
box[i] = 0;
}
}
for (int i = 1; i <= n; i++) {
if (box[i]) {
m++;
ans.push_back(i);
}
}
cout << m << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << ' ';
}
cout << endl;
}
| //
// main.cpp
// test130
//
// Created by on 2019/06/16.
// Copyright © 2 All rights reserved.
//
//
// main.cpp
// new
//
// Created on 2019/06/09.
// Copyright All rights reserved.
//
// C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.
// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
// <http://www.gnu.org/licenses/>.
/** @file stdc++.h
* This is an implementation file for a precompiled header.
*/
// 17.4.1.2 Headers
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
using namespace std;
string x;
int n, m;
bool a[200004], box[200004];
vector<int> ans;
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int bai = 2, ave = 0;
while (1) {
if (bai * i > n) {
break;
}
if (box[bai * i])
ave++;
bai++;
}
// cout<<ave<<endl;
if ((ave % 2) != a[i]) {
box[i] = 1;
} else {
box[i] = 0;
}
}
for (int i = 1; i <= n; i++) {
if (box[i]) {
m++;
ans.push_back(i);
}
}
cout << m << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << ' ';
}
cout << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,328 | 777,329 | u943070796 | cpp |
p02972 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int ans[n + 1];
int M = 0;
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i > 0; i--) {
int k = 2 * i;
int s = 0;
while (k <= n) {
s = s + ans[k];
k = k + i;
}
if (s % 2 == a[i]) {
ans[i] = 0;
} else {
ans[i] == 1;
M++;
v.push_back(i);
}
}
cout << M << endl;
for (int i = 1; i < v.size(); i++) {
cout << v[i] << ' ';
}
if (!v.empty()) {
cout << v[0] << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int ans[n + 1];
int M = 0;
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i > 0; i--) {
int k = 2 * i;
int s = 0;
while (k <= n) {
s = s + ans[k];
k = k + i;
}
if (s % 2 == a[i]) {
ans[i] = 0;
} else {
ans[i] = 1;
M++;
v.push_back(i);
}
}
cout << M << endl;
for (int i = 1; i < v.size(); i++) {
cout << v[i] << ' ';
}
if (!v.empty()) {
cout << v[0] << endl;
}
return 0;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 777,330 | 777,331 | u992779443 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int a[200001];
for (int i = 1; i <= n; i++)
cin >> a[i];
int b[200001];
for (int i = 1; i <= n; i++)
b[i] = 0;
int m = 0;
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += (a[j] == 1 ? 1 : 0);
b[i] += (cnt % 2 == a[i] ? 0 : 1);
m += (cnt % 2 == a[i] ? 0 : 1);
}
cout << m << endl;
for (int i = 1; i <= n; i++) {
if (b[i])
cout << i << " ";
}
if (m > 0)
cout << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int a[200001];
for (int i = 1; i <= n; i++)
cin >> a[i];
int b[200001];
for (int i = 1; i <= n; i++)
b[i] = 0;
int m = 0;
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i * 2; j <= n; j += i)
cnt += (b[j] == 1 ? 1 : 0);
b[i] += (cnt % 2 == a[i] ? 0 : 1);
m += (cnt % 2 == a[i] ? 0 : 1);
}
cout << m << endl;
for (int i = 1; i <= n; i++) {
if (b[i])
cout << i << " ";
}
if (m > 0)
cout << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,336 | 777,337 | u790614328 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j;
ll cnt = 0;
int n;
cin >> n;
int a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
int c[n];
for (i = n; i >= 1; i--) {
if (a[i] != 0) {
c[cnt++] = i;
int p = (int)round(sqrt(i));
if (p * p == i)
a[p] = 1 - a[p];
for (j = 1; j < p; j++) {
if (i % j == 0) {
a[j] = 1 - a[j];
a[i / j] = 1 - a[i / j];
}
}
}
}
cout << cnt << endl;
for (i = 0; i < cnt; i++)
cout << c[i] << " ";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j;
ll cnt = 0;
int n;
cin >> n;
int a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
int c[n];
for (i = n; i >= 1; i--) {
if (a[i] != 0) {
c[cnt++] = i;
int p = (int)round(sqrt(i));
if (p * p == i)
a[p] = 1 - a[p];
for (j = 1; j <= p; j++) {
if (i % j == 0) {
a[j] = 1 - a[j];
a[i / j] = 1 - a[i / j];
}
}
}
}
cout << cnt << endl;
for (i = 0; i < cnt; i++)
cout << c[i] << " ";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 777,346 | 777,347 | u952130512 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
void Main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
int ans[n];
memset(ans, 0, sizeof(ans));
for (int i = n; i > 0; i--) {
int tmp = 0;
for (int j = i + i; j < n; j += i) {
tmp += ans[j];
}
if (a[i] == tmp % 2) {
ans[i] = 0;
} else {
ans[i] = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (ans[i])
cout << i << endl;
}
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
void Main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
int ans[n];
memset(ans, 0, sizeof(ans));
for (int i = n; i > 0; i--) {
int tmp = 0;
for (int j = i + i; j <= n; j += i) {
tmp += ans[j];
}
if (a[i] == tmp % 2) {
ans[i] = 0;
} else {
ans[i] = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
if (ans[i])
cout << i << endl;
}
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,350 | 777,351 | u931698099 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), ball(n, 0), ans(0);
int cnt = 0;
for (int i = 0; i < n; i++)
cin >> a.at(i);
if (n % 2 == 0)
for (int i = 0; i < n / 2; i++) {
ball.at(n - 1 - i) = a.at(n - 1 - i);
if (ball.at(n - 1 - i) == 1)
ans.push_back(n - i);
}
else
for (int i = 0; i < n / 2 + 1; i++) {
ball.at(n - 1 - i) = a.at(n - 1 - i);
if (ball.at(n - 1 - i) == 1)
ans.push_back(n - i);
}
int sum;
for (int i = n / 2 - 1; i >= 0; i--) {
sum = 0;
for (int j = i; j < n; j += i + 1)
sum += ball.at(j);
if (sum % 2 != a.at(i)) {
ball.at(i) = 1;
ans.push_back(i + 1);
}
}
if (ans.size() == 0) {
cout << 0 << endl << 0 << endl;
return 0;
}
cout << ans.size() << endl;
sort(ans.begin(), ans.end());
for (int i = 0; i < ans.size() - 1; i++)
cout << ans.at(i) << " ";
cout << ans.at(ans.size() - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), ball(n, 0), ans(0);
int cnt = 0;
for (int i = 0; i < n; i++)
cin >> a.at(i);
if (n % 2 == 0)
for (int i = 0; i < n / 2; i++) {
ball.at(n - 1 - i) = a.at(n - 1 - i);
if (ball.at(n - 1 - i) == 1)
ans.push_back(n - i);
}
else
for (int i = 0; i < n / 2 + 1; i++) {
ball.at(n - 1 - i) = a.at(n - 1 - i);
if (ball.at(n - 1 - i) == 1)
ans.push_back(n - i);
}
int sum;
for (int i = n / 2 - 1; i >= 0; i--) {
sum = 0;
for (int j = i; j < n; j += i + 1)
sum += ball.at(j);
if (sum % 2 != a.at(i)) {
ball.at(i) = 1;
ans.push_back(i + 1);
}
}
if (ans.size() == 0) {
cout << 0 << endl;
return 0;
}
cout << ans.size() << endl;
sort(ans.begin(), ans.end());
for (int i = 0; i < ans.size() - 1; i++)
cout << ans.at(i) << " ";
cout << ans.at(ans.size() - 1) << endl;
} | [
"expression.operation.binary.remove"
] | 777,355 | 777,356 | u071019032 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[200010], c[200010];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
c[i] = 0;
}
vector<int> v;
for (int i = n; i >= 1; i++) {
for (int j = i * 2; j <= n; j += i) {
a[i] ^= c[j];
}
c[i] = a[i];
if (c[i])
v.push_back(i);
}
cout << v.size() << endl;
for (auto t : v)
cout << t << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[200010], c[200010];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
c[i] = 0;
}
vector<int> v;
for (int i = n; i >= 1; i--) {
for (int j = i * 2; j <= n; j += i) {
a[i] ^= c[j];
}
c[i] = a[i];
if (c[i])
v.push_back(i);
}
cout << v.size() << endl;
for (auto t : v)
cout << t << endl;
return 0;
}
| [] | 777,357 | 777,358 | u924885571 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
using namespace std;
/*******-c++14 don't include-*******/
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
void printArr(int *a, int len) {
for (int i = 0; i < len; i++) {
if (i)
cout << " ";
cout << a[i];
}
cout << endl;
}
/*******---------------------*******/
static const int INTINF = (2147483647);
static const ll LLINF = (9223372036854775807);
static const int MAX = 200001;
//--global--//
//----------//
const int maxn = 200000;
int n;
bool a[maxn + 1];
bool ans[maxn + 1];
int c = 0;
int main(int argc, const char *argv[]) {
//提出時、消す----//
//--------------//cin >> n;
rep(i, n) cin >> a[i + 1]; // 1-indexed
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
if (ans[j])
cnt++;
}
if ((cnt % 2 == 0 && a[i] == 1) || (cnt % 2 == 1 && a[i] == 0)) {
ans[i] = 1;
c++;
}
}
cout << c << endl;
rep(i, n) {
if (ans[i + 1] == 1)
cout << i + 1 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
using namespace std;
/*******-c++14 don't include-*******/
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
void printArr(int *a, int len) {
for (int i = 0; i < len; i++) {
if (i)
cout << " ";
cout << a[i];
}
cout << endl;
}
/*******---------------------*******/
static const int INTINF = (2147483647);
static const ll LLINF = (9223372036854775807);
static const int MAX = 200001;
//--global--//
//----------//
const int maxn = 200000;
int n;
bool a[maxn + 1];
bool ans[maxn + 1];
int c = 0;
int main(int argc, const char *argv[]) {
//提出時、消す----//
//--------------//cin >> n;
cin >> n;
rep(i, n) cin >> a[i + 1]; // 1-indexed
for (int i = n; i >= 1; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
if (ans[j])
cnt++;
}
if ((cnt % 2 == 0 && a[i] == 1) || (cnt % 2 == 1 && a[i] == 0)) {
ans[i] = 1;
c++;
}
}
cout << c << endl;
rep(i, n) {
if (ans[i + 1] == 1)
cout << i + 1 << endl;
}
return 0;
}
| [] | 777,365 | 777,366 | u895382169 | cpp |
p02972 | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long int x, long long int y) {
return (x + y - 1) / y;
}
/*最大公約数*/
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1) {
m = number2;
n = number1;
}
long long int s = -1;
while (s != 0) {
s = m % n;
m = n;
n = s;
}
return m;
}
/*最大公倍数*/
long long int gcd(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
return m / lcm(m, n) * n;
}
int dp[200020] = {};
int s[200020] = {};
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
s[i] = a;
}
for (int i = n; i >= 1; i--) {
int thissum = 0;
for (int j = i + i; j <= n; j = j + i) {
thissum = thissum + s[j];
}
if (thissum % 2 != s[i]) {
dp[i] = 1;
}
}
int sum = 0;
for (int i = 1; i <= n; i++) {
sum = sum + dp[i];
}
cout << sum << endl;
for (int i = 1; i <= n; i++) {
if (dp[i] == 1) {
cout << i << " ";
}
}
} | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long int x, long long int y) {
return (x + y - 1) / y;
}
/*最大公約数*/
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1) {
m = number2;
n = number1;
}
long long int s = -1;
while (s != 0) {
s = m % n;
m = n;
n = s;
}
return m;
}
/*最大公倍数*/
long long int gcd(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
return m / lcm(m, n) * n;
}
int dp[200020] = {};
int s[200020] = {};
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
s[i] = a;
}
for (int i = n; i >= 1; i--) {
int thissum = 0;
for (int j = i + i; j <= n; j = j + i) {
thissum = thissum + dp[j];
}
if (thissum % 2 != s[i]) {
dp[i] = 1;
}
}
int sum = 0;
for (int i = 1; i <= n; i++) {
sum = sum + dp[i];
}
cout << sum << endl;
for (int i = 1; i <= n; i++) {
if (dp[i] == 1) {
cout << i << " ";
}
}
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 777,367 | 777,368 | u473116917 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, m = 0;
cin >> n;
vector<ll> a(n), b(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = n - 1; i >= 0; i--) {
ll t;
for (ll j = i; j < n; j += i + 1) {
t += b[j];
}
if (t % 2 == 0 && a[i] == 1 || t % 2 == 1 && a[i] == 0) {
b[i]++;
m++;
}
}
cout << m << "\n";
for (ll i = 0; i < n; i++) {
if (b[i] != 0) {
cout << i + 1 << " ";
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, m = 0;
cin >> n;
vector<ll> a(n), b(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = n - 1; i >= 0; i--) {
ll t = 0;
for (ll j = i; j < n; j += i + 1) {
t += b[j];
}
if (t % 2 == 0 && a[i] == 1 || t % 2 == 1 && a[i] == 0) {
b[i]++;
m++;
}
}
cout << m << "\n";
for (ll i = 0; i < n; i++) {
if (b[i] != 0) {
cout << i + 1 << " ";
}
}
return 0;
} | [
"variable_declaration.value.change"
] | 777,369 | 777,370 | u125051909 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#define RANGE(a, b, c) \
(a).begin() + b, (a).begin() + c // コンテナ a の 要素 b から c へのイテレータ
#define MOD 1000000007
#define INF 1000000000
typedef pair<int64_t, int64_t> PII;
typedef vector<int64_t> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI a(N);
rep(i, 0, N) cin >> a[i];
if (*max_element(ALL(a)) == 0) {
cout << "0\n";
return 0;
}
vector<bool> b(N + 1, false);
Rrep(i, N, 1) {
int f = 0;
for (int j = 1; i * j <= N; ++j)
if (b[i * j])
++f;
if (a[i - 1])
if (f % 2 == 0)
b[i] = true;
else {
if (f % 2)
b[i] = true;
}
}
cout << accumulate(ALL(b), 0) << endl;
rep(i, 1, N + 1) if (b[i]) cout << i << ' ';
cout << endl;
}
// 境界，出力文字列 チェック
// 可読性優先．高速化次点．
// まずは全探索，分割統治，次にDP
// 制限を見る
// 偶奇，逆から，ソート，出現回数，出現位置，DP， 余事象，包除
// データ構造． 問題の特徴量．単調性，二分探索
// 存在判定：構成方法，入力の特徴
// gcd, lcm ,素因数分解．
// 例外を十分に含む一般化．想像力の限界
// 小さい系から例示
// 始めは過剰に例示・場合分けしてもいい．各場合を確実に対処．
// 自明な例から処理，除外．
// 小数のときは，精度の設定する．doubel 変数に数値を入力するときは 123. とする．
// テストケース作成は数表あり
| #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#define RANGE(a, b, c) \
(a).begin() + b, (a).begin() + c // コンテナ a の 要素 b から c へのイテレータ
#define MOD 1000000007
#define INF 1000000000
typedef pair<int64_t, int64_t> PII;
typedef vector<int64_t> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI a(N);
rep(i, 0, N) cin >> a[i];
if (*max_element(ALL(a)) == 0) {
cout << "0\n";
return 0;
}
vector<bool> b(N + 1, false);
Rrep(i, N, 1) {
int f = 0;
for (int j = 1; i * j <= N; ++j)
if (b[i * j])
++f;
if (a[i - 1]) {
if (f % 2 == 0)
b[i] = true;
} else {
if (f % 2)
b[i] = true;
}
}
cout << accumulate(ALL(b), 0) << endl;
rep(i, 1, N + 1) if (b[i]) cout << i << ' ';
cout << endl;
}
// 境界，出力文字列 チェック
// 可読性優先．高速化次点．
// まずは全探索，分割統治，次にDP
// 制限を見る
// 偶奇，逆から，ソート，出現回数，出現位置，DP， 余事象，包除
// データ構造． 問題の特徴量．単調性，二分探索
// 存在判定：構成方法，入力の特徴
// gcd, lcm ,素因数分解．
// 例外を十分に含む一般化．想像力の限界
// 小さい系から例示
// 始めは過剰に例示・場合分けしてもいい．各場合を確実に対処．
// 自明な例から処理，除外．
// 小数のときは，精度の設定する．doubel 変数に数値を入力するときは 123. とする．
// テストケース作成は数表あり
| [] | 777,371 | 777,372 | u421426760 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#define RANGE(a, b, c) \
(a).begin() + b, (a).begin() + c // コンテナ a の 要素 b から c へのイテレータ
#define MOD 1000000007
#define INF 1000000000
typedef pair<int64_t, int64_t> PII;
typedef vector<int64_t> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI a(N);
rep(i, 0, N) cin >> a[i];
if (*max_element(ALL(a)) == 0) {
cout << "0\n";
return 0;
}
vector<bool> b(N + 1, false);
Rrep(i, N, 1) {
int f = 0;
for (int j = 1; i * j <= N; ++j)
if (b[i * j])
++f;
if (a[i - 1])
if (f % 2 == 0)
b[i] = true;
else if (f % 2)
b[i] = true;
}
cout << accumulate(ALL(b), 0) << endl;
rep(i, 1, N + 1) if (b[i]) cout << i << ' ';
cout << endl;
}
// 境界，出力文字列 チェック
// 可読性優先．高速化次点．
// まずは全探索，分割統治，次にDP
// 制限を見る
// 偶奇，逆から，ソート，出現回数，出現位置，DP， 余事象，包除
// データ構造． 問題の特徴量．単調性，二分探索
// 存在判定：構成方法，入力の特徴
// gcd, lcm ,素因数分解．
// 例外を十分に含む一般化．想像力の限界
// 小さい系から例示
// 始めは過剰に例示・場合分けしてもいい．各場合を確実に対処．
// 自明な例から処理，除外．
// 小数のときは，精度の設定する．doubel 変数に数値を入力するときは 123. とする．
// テストケース作成は数表あり
| #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#define RANGE(a, b, c) \
(a).begin() + b, (a).begin() + c // コンテナ a の 要素 b から c へのイテレータ
#define MOD 1000000007
#define INF 1000000000
typedef pair<int64_t, int64_t> PII;
typedef vector<int64_t> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI a(N);
rep(i, 0, N) cin >> a[i];
if (*max_element(ALL(a)) == 0) {
cout << "0\n";
return 0;
}
vector<bool> b(N + 1, false);
Rrep(i, N, 1) {
int f = 0;
for (int j = 1; i * j <= N; ++j)
if (b[i * j])
++f;
if (a[i - 1]) {
if (f % 2 == 0)
b[i] = true;
} else {
if (f % 2)
b[i] = true;
}
}
cout << accumulate(ALL(b), 0) << endl;
rep(i, 1, N + 1) if (b[i]) cout << i << ' ';
cout << endl;
}
// 境界，出力文字列 チェック
// 可読性優先．高速化次点．
// まずは全探索，分割統治，次にDP
// 制限を見る
// 偶奇，逆から，ソート，出現回数，出現位置，DP， 余事象，包除
// データ構造． 問題の特徴量．単調性，二分探索
// 存在判定：構成方法，入力の特徴
// gcd, lcm ,素因数分解．
// 例外を十分に含む一般化．想像力の限界
// 小さい系から例示
// 始めは過剰に例示・場合分けしてもいい．各場合を確実に対処．
// 自明な例から処理，除外．
// 小数のときは，精度の設定する．doubel 変数に数値を入力するときは 123. とする．
// テストケース作成は数表あり
| [] | 777,373 | 777,372 | u421426760 | cpp |
p02972 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#define RANGE(a, b, c) \
(a).begin() + b, (a).begin() + c // コンテナ a の 要素 b から c へのイテレータ
#define MOD 1000000007
#define INF 1000000000
typedef pair<int64_t, int64_t> PII;
typedef vector<int64_t> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI a(N);
rep(i, 0, N) cin >> a[i];
if (*max_element(ALL(a)) == 0) {
cout << "0\n";
return 0;
}
vector<bool> b(N + 1, false);
Rrep(i, N, 1) {
int f = 0;
for (int j = 1; i * j <= N; ++j)
if (b[j])
++f;
if (a[i - 1]) {
if (f % 2 == 0)
b[i] = true;
} else {
if (f % 2)
b[i] = true;
}
}
cout << accumulate(ALL(b), 0) << endl;
rep(i, 1, N + 1) if (b[i]) cout << i << ' ';
cout << endl;
}
// 境界，出力文字列 チェック
// 可読性優先．高速化次点．
// まずは全探索，分割統治，次にDP
// 制限を見る
// 偶奇，逆から，ソート，出現回数，出現位置，DP， 余事象，包除
// データ構造． 問題の特徴量．単調性，二分探索
// 存在判定：構成方法，入力の特徴
// gcd, lcm ,素因数分解．
// 例外を十分に含む一般化．想像力の限界
// 小さい系から例示
// 始めは過剰に例示・場合分けしてもいい．各場合を確実に対処．
// 自明な例から処理，除外．
// 小数のときは，精度の設定する．doubel 変数に数値を入力するときは 123. とする．
// テストケース作成は数表あり
| #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#define RANGE(a, b, c) \
(a).begin() + b, (a).begin() + c // コンテナ a の 要素 b から c へのイテレータ
#define MOD 1000000007
#define INF 1000000000
typedef pair<int64_t, int64_t> PII;
typedef vector<int64_t> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI a(N);
rep(i, 0, N) cin >> a[i];
if (*max_element(ALL(a)) == 0) {
cout << "0\n";
return 0;
}
vector<bool> b(N + 1, false);
Rrep(i, N, 1) {
int f = 0;
for (int j = 1; i * j <= N; ++j)
if (b[i * j])
++f;
if (a[i - 1]) {
if (f % 2 == 0)
b[i] = true;
} else {
if (f % 2)
b[i] = true;
}
}
cout << accumulate(ALL(b), 0) << endl;
rep(i, 1, N + 1) if (b[i]) cout << i << ' ';
cout << endl;
}
// 境界，出力文字列 チェック
// 可読性優先．高速化次点．
// まずは全探索，分割統治，次にDP
// 制限を見る
// 偶奇，逆から，ソート，出現回数，出現位置，DP， 余事象，包除
// データ構造． 問題の特徴量．単調性，二分探索
// 存在判定：構成方法，入力の特徴
// gcd, lcm ,素因数分解．
// 例外を十分に含む一般化．想像力の限界
// 小さい系から例示
// 始めは過剰に例示・場合分けしてもいい．各場合を確実に対処．
// 自明な例から処理，除外．
// 小数のときは，精度の設定する．doubel 変数に数値を入力するときは 123. とする．
// テストケース作成は数表あり
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,374 | 777,372 | u421426760 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
// vector <int> xor_sum(n + 1);
rep(i, n + 1) {
if (i == 0)
continue;
cin >> a.at(i);
// xor_sum.at(i) = a.at(i);
// if (i == 1) continue;
// xor_sum.at(i) ^= xor_sum.at(i - 1);
}
vector<int> ball_cnt(n + 1);
int M = 0;
for (int i = n; i >= 1; i--) {
int sum_ball = 0;
for (int j = i; j + i < n + 1; j += i) {
sum_ball += ball_cnt.at(j);
}
if (sum_ball % 2 == a.at(i))
continue;
else {
ball_cnt.at(i) = 1;
M += 1;
}
}
cout << M << endl;
for (int i = 1; i < n + 1; i++) {
if (ball_cnt.at(i) == 0)
continue;
cout << i << " ";
}
if (M != 0)
cout << endl;
// bool ok = true;
// for (int i = 2; i < n + 1; i ++){
// for (int j = i; j + i < n + 1; j += i){
// int xor_range = xor_sum.at(j + i) ^ xor_sum.at(j);
// if (a.at(j) ^ a.at(j + i) != xor_range) ok = false;
// }
// }
// if (!ok){
// cout << -1 << endl;
// }
// else{
// long long ball_cnt = 0;
// deque <long long> ans;
// reverse(a.begin(), a.end());
// //for (auto _a :a) cout << _a << " " << endl;
// if (a.at(0) == 1){
// ball_cnt += 1;
// ans.push_front(1);
// }
// for (int i = 1; i < n; i ++){
// if (a.at(i) ^ a.at(i - 1) == 0) ball_cnt += 0;
// else ball_cnt += 1;
// if (ball_cnt == 0) continue;
// ans.push_front(ball_cnt);
// }
// cout << ans.size() << endl;
// int s = ans.size();
// rep(i, s){
// cout << ans.front() << " ";
// ans.pop_front();
// }
// cout << endl;
// }
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
// vector <int> xor_sum(n + 1);
rep(i, n + 1) {
if (i == 0)
continue;
cin >> a.at(i);
// xor_sum.at(i) = a.at(i);
// if (i == 1) continue;
// xor_sum.at(i) ^= xor_sum.at(i - 1);
}
vector<int> ball_cnt(n + 1);
int M = 0;
for (int i = n; i >= 1; i--) {
int sum_ball = 0;
for (int j = i; j < n + 1; j += i) {
sum_ball += ball_cnt.at(j);
}
if (sum_ball % 2 == a.at(i))
continue;
else {
ball_cnt.at(i) = 1;
M += 1;
}
}
cout << M << endl;
for (int i = 1; i < n + 1; i++) {
if (ball_cnt.at(i) == 0)
continue;
cout << i << " ";
}
if (M != 0)
cout << endl;
// bool ok = true;
// for (int i = 2; i < n + 1; i ++){
// for (int j = i; j + i < n + 1; j += i){
// int xor_range = xor_sum.at(j + i) ^ xor_sum.at(j);
// if (a.at(j) ^ a.at(j + i) != xor_range) ok = false;
// }
// }
// if (!ok){
// cout << -1 << endl;
// }
// else{
// long long ball_cnt = 0;
// deque <long long> ans;
// reverse(a.begin(), a.end());
// //for (auto _a :a) cout << _a << " " << endl;
// if (a.at(0) == 1){
// ball_cnt += 1;
// ans.push_front(1);
// }
// for (int i = 1; i < n; i ++){
// if (a.at(i) ^ a.at(i - 1) == 0) ball_cnt += 0;
// else ball_cnt += 1;
// if (ball_cnt == 0) continue;
// ans.push_front(ball_cnt);
// }
// cout << ans.size() << endl;
// int s = ans.size();
// rep(i, s){
// cout << ans.front() << " ";
// ans.pop_front();
// }
// cout << endl;
// }
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 777,378 | 777,379 | u619557935 | cpp |
p02972 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1e18;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n, 0);
rep(i, n) cin >> a[i];
ll cnt = 0;
for (ll i = n - 1; i >= 0; i--) {
ll now = i;
ll s = 0;
while (now <= n - 1) {
s += b[now];
now++;
}
if ((s + a[i]) % 2 == 1) {
b[i] = 1;
cnt++;
}
}
cout << cnt << endl;
rep(i, n) {
if (b[i] == 1) {
cout << i + 1 << endl;
}
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1e18;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n, 0);
rep(i, n) cin >> a[i];
ll cnt = 0;
for (ll i = n - 1; i >= 0; i--) {
ll now = i;
ll s = 0;
while (now <= n - 1) {
s += b[now];
now += (i + 1);
}
if ((s + a[i]) % 2 == 1) {
b[i] = 1;
cnt++;
}
}
cout << cnt << endl;
rep(i, n) {
if (b[i] == 1) {
cout << i + 1 << endl;
}
}
}
| [] | 777,380 | 777,381 | u289381123 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, 0);
int m = 0;
for (int i = n - 1; i >= 0; i--) {
int tmp = 0;
for (int j = i + 1; j < n; j += i + 1) {
if (b[j] == 1)
tmp++;
}
if (a[i] == 0 && tmp % 2 == 1) {
m++;
b[i] = 1;
} else if (a[i] == 1 && tmp % 2 == 0) {
m++;
b[i] = 1;
}
}
cout << m << endl;
if (m == 0)
return 0;
rep(i, n) {
if (b[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, 0);
int m = 0;
for (int i = n - 1; i >= 0; i--) {
int tmp = 0;
for (int j = 2 * i + 1; j < n; j += i + 1) {
if (b[j] == 1)
tmp++;
}
if (a[i] == 0 && tmp % 2 == 1) {
m++;
b[i] = 1;
} else if (a[i] == 1 && tmp % 2 == 0) {
m++;
b[i] = 1;
}
}
cout << m << endl;
if (m == 0)
return 0;
rep(i, n) {
if (b[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
}
| [
"control_flow.loop.for.initializer.change"
] | 777,382 | 777,383 | u633967774 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, 0);
int m = 0;
for (int i = n - 1; i >= 0; i--) {
int tmp = 0;
for (int j = i + 1; j < n; j += i + 1) {
if (b[j] == 1)
tmp++;
}
if (a[i] == 0 && tmp % 2 == 1) {
m++;
b[i] = 1;
} else if (a[i] == 1 && tmp % 2 == 0) {
m++;
b[i] = 1;
}
}
cout << m << endl;
if (m == 0)
return 0;
rep(i, n) {
if (b[i] == 1)
cout << b[i] << " ";
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n, 0);
int m = 0;
for (int i = n - 1; i >= 0; i--) {
int tmp = 0;
for (int j = 2 * i + 1; j < n; j += i + 1) {
if (b[j] == 1)
tmp++;
}
if (a[i] == 0 && tmp % 2 == 1) {
m++;
b[i] = 1;
} else if (a[i] == 1 && tmp % 2 == 0) {
m++;
b[i] = 1;
}
}
cout << m << endl;
if (m == 0)
return 0;
rep(i, n) {
if (b[i] == 1)
cout << i + 1 << " ";
}
cout << endl;
}
| [
"control_flow.loop.for.initializer.change",
"io.output.change"
] | 777,384 | 777,383 | u633967774 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int ans[n];
for (int i = n - 1; i >= 0; i--) {
int tmp = 0;
for (int j = i + i + 1; j < n; j++) {
tmp += ans[j];
}
if (a[i] == 0) {
if (tmp % 2 == 0)
ans[i] = 0;
else
ans[i] = 1;
} else {
if (tmp % 2 == 0)
ans[i] = 1;
else
ans[i] = 0;
}
}
vector<int> res;
rep(i, n) {
if (ans[i] == 1)
res.push_back(i + 1);
}
cout << res.size() << endl;
rep(i, res.size()) { cout << res[i] << endl; }
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int ans[n];
for (int i = n - 1; i >= 0; i--) {
int tmp = 0;
for (int j = i + i + 1; j < n; j += i + 1) {
tmp += ans[j];
}
if (a[i] == 0) {
if (tmp % 2 == 0)
ans[i] = 0;
else
ans[i] = 1;
} else {
if (tmp % 2 == 0)
ans[i] = 1;
else
ans[i] = 0;
}
}
vector<int> res;
rep(i, n) {
if (ans[i] == 1)
res.push_back(i + 1);
}
cout << res.size() << endl;
rep(i, res.size()) { cout << res[i] << endl; }
}
| [
"control_flow.loop.for.update.change",
"assignment.change"
] | 777,385 | 777,386 | u633967774 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N), ans(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = N; i >= 1; i--) {
for (int j = i; j <= N; j += i) {
sum += ans[j - 1];
}
if (sum % 2 == a[i - 1]) {
ans[i - 1] = 0;
} else
ans[i - 1] = 1;
}
int m = 0;
for (int i = 0; i < N; i++) {
if (ans[i] == 1)
m++;
}
cout << m << endl;
for (int i = 0; i < N; i++) {
if (ans[i] == 1)
cout << i + 1 << " ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N), ans(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = N; i >= 1; i--) {
sum = 0;
for (int j = i; j <= N; j += i) {
sum += ans[j - 1];
}
if (sum % 2 == a[i - 1]) {
ans[i - 1] = 0;
} else
ans[i - 1] = 1;
}
int m = 0;
for (int i = 0; i < N; i++) {
if (ans[i] == 1)
m++;
}
cout << m << endl;
for (int i = 0; i < N; i++) {
if (ans[i] == 1)
cout << i + 1 << " ";
}
return 0;
} | [
"assignment.add"
] | 777,395 | 777,396 | u109191542 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 10, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> putted(n + 10, 0);
for (int i = n; i >= 1; i--) {
int sum_temp = 0;
for (int j = i + i; j <= n; j += i)
sum_temp += putted[j];
putted[i] = (a[i] + sum_temp) % 2;
}
int m = count(a.begin(), a.end(), 1);
if (m == 0) {
cout << 0 << endl;
return 0;
}
vector<int> ans;
cout << m << endl;
for (int i = 1; i <= n; i++)
if (putted[i])
ans.push_back(i);
for (int i = 0; i < ans.size(); i++) {
cout << ans[i];
if (i < ans.size() - 1)
cout << ' ';
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 10, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> putted(n + 10, 0);
for (int i = n; i >= 1; i--) {
int sum_temp = 0;
for (int j = i + i; j <= n; j += i)
sum_temp += putted[j];
putted[i] = (a[i] + sum_temp) % 2;
}
int m = count(putted.begin(), putted.end(), 1);
if (m == 0) {
cout << 0 << endl;
return 0;
}
vector<int> ans;
cout << m << endl;
for (int i = 1; i <= n; i++)
if (putted[i])
ans.push_back(i);
for (int i = 0; i < ans.size(); i++) {
cout << ans[i];
if (i < ans.size() - 1)
cout << ' ';
}
cout << endl;
return 0;
} | [
"identifier.change",
"call.arguments.change"
] | 777,397 | 777,398 | u833963136 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <set>
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) { cin >> a[i + 1]; }
int ans;
for (int i = n; i > 0; --i) {
int cnt(0);
for (int j = i * 2; j <= n; j += i) {
cnt += b[i];
}
if (cnt % 2 != a[i]) {
b[i]++;
}
}
ans = 0;
rep(i, n + 1) { ans += b[i]; }
cout << ans << endl;
for (int i = 1; i <= n; ++i) {
if (!b[i])
continue;
cout << i << " ";
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <set>
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) { cin >> a[i + 1]; }
int ans;
for (int i = n; i > 0; --i) {
int cnt(0);
for (int j = i * 2; j <= n; j += i) {
cnt += b[j];
}
// cout << cnt << " ";
if (cnt % 2 != a[i]) {
b[i]++;
}
}
ans = 0;
rep(i, n + 1) { ans += b[i]; }
cout << ans << endl;
for (int i = 1; i <= n; ++i) {
if (!b[i])
continue;
cout << i << " ";
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,399 | 777,400 | u872982453 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <set>
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) { cin >> a[i + 1]; }
int ans;
for (int i = n; i > 0; --i) {
int cnt(0);
for (int j = i * 2; j <= n; j += i) {
cnt += b[i];
}
if (cnt % 2 != a[i]) {
b[i]++;
}
}
ans = 0;
rep(i, n + 1) { ans += b[i]; }
cout << ans << endl;
for (int i = 1; i <= n; ++i) {
if (!b[i])
continue;
cout << i << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <set>
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n) { cin >> a[i + 1]; }
int ans;
for (int i = n; i > 0; --i) {
int cnt(0);
for (int j = i * 2; j <= n; j += i) {
cnt += b[j];
}
// cout << cnt << " ";
if (cnt % 2 != a[i]) {
b[i]++;
}
}
ans = 0;
rep(i, n + 1) { ans += b[i]; }
cout << ans << endl;
for (int i = 1; i <= n; ++i) {
if (!b[i])
continue;
cout << i << " ";
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 777,401 | 777,400 | u872982453 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
using P = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1), ans;
rep(i, n) cin >> a[i + 1];
for (int i = n; i > 0; i--) {
ll sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[i];
}
if (sum % 2 != a[i]) {
b[i]++;
ans.push_back(i);
}
}
int sz = ans.size();
reverse(all(ans));
cout << sz << endl;
for (int i = 0; i < sz; i++) {
printf("%d%c", ans[i], i == sz - 1 ? '\n' : ' ');
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
using P = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1), ans;
rep(i, n) cin >> a[i + 1];
for (int i = n; i > 0; i--) {
ll sum = 0;
for (int j = i; j <= n; j += i)
sum += b[j];
if (sum % 2 != a[i]) {
b[i]++;
ans.push_back(i);
}
}
int sz = ans.size();
reverse(all(ans));
cout << sz << endl;
for (int i = 0; i < sz; i++) {
printf("%d%c", ans[i], i == sz - 1 ? '\n' : ' ');
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,402 | 777,403 | u084949493 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
typedef long long int lli;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
int ans = 0;
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[i];
}
if (sum % 2 != a[i]) {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << i << " ";
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
typedef long long int lli;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
int ans = 0;
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i]) {
b[i] = 1;
ans++;
}
}
cout << ans << endl;
for (int i = 1; i <= n; i++) {
if (b[i] == 1)
cout << i << " ";
}
cout << endl;
} | [
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,404 | 777,405 | u084949493 | cpp |
p02972 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> memo(n);
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i) {
sum += a[j - 1];
}
bool flag1 = sum % 2 == 0;
bool flag2 = a[i - 1] == 0;
if (flag1 ^ flag2) {
memo[i - 1] = 1;
m++;
}
}
cout << m << endl;
for (int i = 0; i < n; i++) {
if (memo[i] == 0)
continue;
cout << i + 1 << " ";
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> memo(n);
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += memo[j - 1];
}
bool flag1 = sum % 2 == 0;
bool flag2 = a[i - 1] == 0;
if (flag1 ^ flag2) {
memo[i - 1] = 1;
m++;
}
}
cout << m << endl;
for (int i = 0; i < n; i++) {
if (memo[i] == 0)
continue;
cout << i + 1 << " ";
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change"
] | 777,406 | 777,407 | u476027087 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
// iの書かれた箱に入れるボールの個数（0 or 1）
vector<int> b(N + 1, 0);
for (int i = 1; i < N + 1; i++)
cin >> a[i];
for (int i = N; i >= 1; i--) {
// iの倍数の箱に入っているボールの総数
int sum = 0;
//自分(i)より大きなiの倍数が存在するならば、それらの箱に入っているボールの総数を見る
for (int j = i + i; j <= N; j++) {
sum ^= b[j];
}
// sum = 0, a[i] = 1の場合にb[i] = 1が格納される。
// sum = 1, a[i] = 0の場合は問題設定的に考えられない
// sum = 1 && a[i] = 1 または、sum = 0, a[i] = 0の時にb[i] = 0が格納される
b[i] = sum ^ a[i];
}
vector<int> ans;
// b[i]に1が入っている場合は、その箱の番号(i)を答えを出力するための配列ansに格納
for (int i = 1; i < N + 1; i++) {
if (b[i])
ans.push_back(i);
}
//答えを出力
cout << ans.size() << endl;
rep(i, ans.size()) cout << ans[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
// iの書かれた箱に入れるボールの個数（0 or 1）
vector<int> b(N + 1, 0);
for (int i = 1; i < N + 1; i++)
cin >> a[i];
for (int i = N; i >= 1; i--) {
// iの倍数の箱に入っているボールの総数
int sum = 0;
//自分(i)より大きなiの倍数が存在するならば、それらの箱に入っているボールの総数を見る
for (int j = i + i; j <= N; j += i) {
sum ^= b[j];
}
// sum = 0, a[i] = 1の場合にb[i] = 1が格納される。
// sum = 1, a[i] = 0の場合は問題設定的に考えられない
// sum = 1 && a[i] = 1 または、sum = 0, a[i] = 0の時にb[i] = 0が格納される
b[i] = sum ^ a[i];
}
vector<int> ans;
// b[i]に1が入っている場合は、その箱の番号(i)を答えを出力するための配列ansに格納
for (int i = 1; i < N + 1; i++) {
if (b[i])
ans.push_back(i);
}
//答えを出力
cout << ans.size() << endl;
rep(i, ans.size()) cout << ans[i] << endl;
return 0;
} | [] | 777,408 | 777,409 | u224794697 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() { printf("yes\n"); }
void no() { printf("no\n"); }
void Yes() { printf("Yes\n"); }
void No() { printf("No\n"); }
void YES() { printf("YES\n"); }
void NO() { printf("NO\n"); }
int N, A[int(2e5 + 5)], now[int(2e5 + 5)];
vector<int> ans;
int main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = N; i >= 1; i--) {
if (now[i] % 2 == A[i])
continue;
ans.push_back(i);
for (int j = 1; j * j <= N; j++) {
if (N % j != 0)
continue;
now[j]++;
if (j * j != N)
now[N / j]++;
}
}
if (now[1] % 2 != A[1]) {
cout << -1 << endl;
return 0;
}
int M = ans.size();
cout << M << endl;
if (M > 0) {
cout << ans[0];
for (int i = 1; i < M; i++)
cout << " " << ans[i];
cout << 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<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() { printf("yes\n"); }
void no() { printf("no\n"); }
void Yes() { printf("Yes\n"); }
void No() { printf("No\n"); }
void YES() { printf("YES\n"); }
void NO() { printf("NO\n"); }
int N, A[int(2e5 + 5)], now[int(2e5 + 5)];
vector<int> ans;
int main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = N; i >= 1; i--) {
if (now[i] % 2 == A[i])
continue;
ans.push_back(i);
for (int j = 1; j * j <= i; j++) {
if (i % j != 0)
continue;
now[j]++;
if (j * j != i)
now[i / j]++;
}
}
if (now[1] % 2 != A[1]) {
cout << -1 << endl;
return 0;
}
int M = ans.size();
cout << M << endl;
if (M > 0) {
cout << ans[0];
for (int i = 1; i < M; i++)
cout << " " << ans[i];
cout << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 777,410 | 777,411 | u280096880 | cpp |
p02972 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define repi(i, x) \
for (auto i = (x).begin(), i##_fin = (x).end(); i != i##_fin; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int, int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long, long long> P;
typedef vector<P> VP;
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;
}
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, v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
rep(i, v.size()) { is >> v[i]; }
return is;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
vector<int> a(n);
cin >> a;
for (int i = n - 1; i >= 0; i--) {
for (int j = i * 2 + 1; j < n; j += i + 1) {
a[i] = (a[i] + a[j]) % 2;
}
}
// clog << a << endl;
Vi ans;
rep(i, n) {
if (a[i]) {
ans.pb(i);
}
}
cout << ans.size() << endl;
rep(i, ans.size()) {
cout << ans[i];
if (i != ans.size() - 1) {
cout << " ";
}
}
cout << endl;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define repi(i, x) \
for (auto i = (x).begin(), i##_fin = (x).end(); i != i##_fin; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int, int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long, long long> P;
typedef vector<P> VP;
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;
}
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, v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
rep(i, v.size()) { is >> v[i]; }
return is;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
vector<int> a(n);
cin >> a;
for (int i = n - 1; i >= 0; i--) {
for (int j = i * 2 + 1; j < n; j += i + 1) {
a[i] = (a[i] + a[j]) % 2;
}
}
// clog << a << endl;
Vi ans;
rep(i, n) {
if (a[i]) {
ans.pb(i);
}
}
cout << ans.size() << endl;
rep(i, ans.size()) {
cout << ans[i] + 1;
if (i != ans.size() - 1) {
cout << " ";
}
}
cout << endl;
} | [
"expression.operation.binary.add"
] | 777,416 | 777,417 | u179778090 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a.at(i);
vector<int> v(n + 1, 0);
vector<int> ans;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
cnt += v.at(i);
}
if (cnt % 2 != a.at(i)) {
v.at(i) = 1;
ans.emplace_back(i);
}
}
cout << ans.size() << "\n"s;
if (ans.size()) {
cout << ans.back();
for (auto i = ans.rbegin() + 1; i != ans.rend(); ++i) {
cout << " "s << *i;
}
cout << "\n"s;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a.at(i);
vector<int> v(n + 1, 0);
vector<int> ans;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i + i; j <= n; j += i) {
cnt += v.at(j);
}
if (cnt % 2 != a.at(i)) {
v.at(i) = 1;
ans.emplace_back(i);
}
}
cout << ans.size() << "\n"s;
if (ans.size()) {
cout << ans.front();
for (auto i = ans.begin() + 1; i != ans.end(); ++i) {
cout << " "s << *i;
}
cout << "\n"s;
}
} | [
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"call.function.change",
"io.output.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 777,418 | 777,419 | u104613587 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a.at(i);
vector<int> v(n + 1, 0);
vector<int> ans;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
cnt += v.at(i);
}
if (cnt % 2 != a.at(i)) {
v.at(i) = 1;
ans.emplace_back(i);
}
}
cout << ans.size() << "\n"s;
if (ans.size()) {
cout << ans.front();
for (auto i = ans.begin() + 1; i != ans.end(); ++i) {
cout << " "s << *i;
}
cout << "\n"s;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a.at(i);
vector<int> v(n + 1, 0);
vector<int> ans;
for (int i = n; i >= 1; --i) {
int cnt = 0;
for (int j = i + i; j <= n; j += i) {
cnt += v.at(j);
}
if (cnt % 2 != a.at(i)) {
v.at(i) = 1;
ans.emplace_back(i);
}
}
cout << ans.size() << "\n"s;
if (ans.size()) {
cout << ans.front();
for (auto i = ans.begin() + 1; i != ans.end(); ++i) {
cout << " "s << *i;
}
cout << "\n"s;
}
} | [
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 777,420 | 777,419 | u104613587 | cpp |
p02972 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1, 0);
REP(i, n) cin >> a[i + 1];
vector<int> b(n + 1, 0), res(n + 1, 0);
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i)
sum += b[j];
if (sum % 2 != a[i]) {
b[i] = 1;
res[++m] = i % 2;
}
}
cout << m << '\n';
for (int i = 1; i <= m; i++)
cout << res[i] << " ";
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1, 0);
REP(i, n) cin >> a[i + 1];
vector<int> b(n + 1, 0), res(n + 1, 0);
int m = 0;
for (int i = n; i > 0; i--) {
int sum = 0;
for (int j = i * 2; j <= n; j += i)
sum += b[j];
if (sum % 2 != a[i]) {
b[i] = 1;
res[++m] = i;
}
}
cout << m << '\n';
for (int i = 1; i <= m; i++)
cout << res[i] << " ";
return 0;
} | [
"expression.operation.binary.remove"
] | 777,421 | 777,422 | u596385287 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
int main() {
constexpr int Nmax = 200'000;
constexpr int Nbit = Nmax + 1;
int N;
cin >> N;
vector<int> mod2(N + 1);
for (int d = 1; d <= N; d++) {
cin >> mod2.at(d);
}
bitset<Nbit> bs;
for (int d = N; d >= 1; d--) {
int cnt_mul = 0;
for (int m = 2 * d; m <= N; m++) {
if (bs.test(m)) {
cnt_mul++;
}
}
cnt_mul %= 2;
if (mod2.at(d) == 0) {
if (cnt_mul == 1) {
bs.set(d);
}
} else {
if (cnt_mul == 0) {
bs.set(d);
}
}
}
cout << bs.count() << endl;
for (int d = 1; d <= N; d++) {
if (bs.test(d)) {
cout << d << " ";
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
constexpr int Nmax = 200'000;
constexpr int Nbit = Nmax + 1;
int N;
cin >> N;
vector<int> mod2(N + 1);
for (int d = 1; d <= N; d++) {
cin >> mod2.at(d);
}
bitset<Nbit> bs;
for (int d = N; d >= 1; d--) {
int cnt_mul = 0;
for (int m = 2 * d; m <= N; m += d) {
if (bs.test(m)) {
cnt_mul++;
}
}
cnt_mul %= 2;
if (mod2.at(d) == 0) {
if (cnt_mul == 1) {
bs.set(d);
}
} else {
if (cnt_mul == 0) {
bs.set(d);
}
}
}
cout << bs.count() << endl;
for (int d = 1; d <= N; d++) {
if (bs.test(d)) {
cout << d << " ";
}
}
} | [] | 777,423 | 777,424 | u068765697 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main() {
int n;
const int max_n = 2 * 1e5;
int a[max_n + 1];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
bool ball[max_n + 1] = {};
int cnt = 0;
for (int i = n; i >= 1; i--) {
int sum = 0;
int now = 2 * i;
while (now <= n) {
sum += ball[now - 1];
now += i;
}
if (sum % 2 - a[i - 1] != 0) {
ball[i - 1] = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 0; i < n; i++) {
if (ball[i] == 0)
continue;
if (i == n - 1)
cout << i << endl;
else
cout << i << " ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main() {
int n;
const int max_n = 2 * 1e5;
int a[max_n + 1];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
bool ball[max_n + 1] = {};
int cnt = 0;
for (int i = n; i >= 1; i--) {
int sum = 0;
int now = 2 * i;
while (now <= n) {
sum += ball[now - 1];
now += i;
}
if (sum % 2 - a[i - 1] != 0) {
ball[i - 1] = 1;
cnt++;
}
}
cout << cnt << endl;
for (int i = 0; i < n; i++) {
if (ball[i] == 0)
continue;
if (i == n - 1)
cout << i + 1 << endl;
else
cout << i + 1 << " ";
}
return 0;
} | [
"expression.operation.binary.add"
] | 777,427 | 777,428 | u906832993 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> cnt(n, 0);
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = i * 2 + 1; j > n; j += (i + 1)) {
if (j > n)
break;
sum += cnt[j];
}
if (sum % 2 == 0 && a[i] == 0)
cnt[i] = 0;
else if (sum % 2 == 0 && a[i] == 1)
cnt[i] = 1;
else if (sum % 2 == 1 && a[i] == 0)
cnt[i] = 1;
else if (sum % 2 == 1 && a[i] == 1)
cnt[i] = 0;
}
int m = 0;
vector<int> ans;
rep(i, n) {
if (cnt[i] == 1) {
m++;
ans.push_back(i + 1);
}
}
cout << m << endl;
for (auto x : ans) {
cout << x << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> cnt(n, 0);
for (int i = n - 1; i >= 0; i--) {
int sum = 0;
for (int j = i * 2 + 1; j < n; j += (i + 1)) {
// cout << j << endl;
if (j > n)
break;
sum += cnt[j];
}
if (sum % 2 == 0 && a[i] == 0)
cnt[i] = 0;
else if (sum % 2 == 0 && a[i] == 1)
cnt[i] = 1;
else if (sum % 2 == 1 && a[i] == 0)
cnt[i] = 1;
else if (sum % 2 == 1 && a[i] == 1)
cnt[i] = 0;
}
int m = 0;
vector<int> ans;
rep(i, n) {
if (cnt[i] == 1) {
m++;
ans.push_back(i + 1);
}
}
cout << m << endl;
for (auto x : ans) {
cout << x << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 777,429 | 777,430 | u502312544 | cpp |
p02972 | #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
std::vector<int> a(N);
for (int i = 0; i < N; i++) {
std::cin >> a[i];
}
std::vector<int> boxes(N, 0);
int M = 0;
for (int i = N - 1; i >= 0; i--) {
int count = 0;
for (int j = N / (i + 1); j > 1; j--) {
count += boxes[j * i - 1];
}
if (count % 2 != a[i]) {
boxes[i] = 1;
M++;
}
}
std::cout << M << std::endl;
for (int i = 0; i < N; i++) {
if (boxes[i] == 1) {
std::cout << i + 1;
M--;
if (M > 0) {
std::cout << " ";
}
}
}
std::cout << std::endl;
}
| #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
std::vector<int> a(N);
for (int i = 0; i < N; i++) {
std::cin >> a[i];
}
std::vector<int> boxes(N, 0);
int M = 0;
for (int i = N - 1; i >= 0; i--) {
int count = 0;
for (int j = N / (i + 1); j > 1; j--) {
count += boxes[j * (i + 1) - 1];
}
if (count % 2 != a[i]) {
boxes[i] = 1;
M++;
}
}
std::cout << M << std::endl;
for (int i = 0; i < N; i++) {
if (boxes[i] == 1) {
std::cout << i + 1;
M--;
if (M > 0) {
std::cout << " ";
}
}
}
std::cout << std::endl;
}
| [] | 777,431 | 777,432 | u136968995 | cpp |
p02972 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned 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;
}
//�G���g�X�e�l�X���
vector<int> estora(vector<int> num) {
int sel = 0;
while (sel < num.size()) {
int d = num[sel];
for (int i = 0; i < num.size(); i++) {
if (num[i] % d == 0 && num[i] != d && d != 1) {
num.erase(num.begin() + i);
i--;
}
}
sel++;
}
return num;
}
/*���C�u�����ő����*/
//���[�O���b�h�̌ݏ��@
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
}
/*�f��������*/
//���색�C�u����
// i����ɑf���ɂ��Ă����Ȃ��Ƃ��܂��ł��Ȃ�&&�v�Z�ʃ��o�C
//�G�X�g���l�X��⿂őf����U����Ă����K�v�������肻��
vector<ll> fac(ll n, vector<ll> num) {
ll kazu = n;
for (int i = 2; i <= n; i++) {
while (1) {
if (kazu % i != 0)
break;
kazu /= i;
num[i]++;
}
}
if (kazu == n && n != 1)
num[n]++;
return num;
int ans = 0;
if (kazu != 1)
ans++;
for (int i = 2; i <= sqrt(n); i++) {
for (int j = 1; j <= num[i]; j++) {
num[i] -= j;
ans++;
}
}
return num;
}
const int INF = 1001001001;
// mint�p�̒萔 (10��9�� + 7)
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
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; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<int>> yaku(n, vector<int>(1, 1));
srep(i, 2, n + 1) {
int num = i;
while (num <= n) {
yaku[num - 1].emplace_back(i);
num += i;
}
}
vector<int> ans(0);
for (int i = n - 1; i >= 0; i--) {
if (a[i] == 1) {
ans.insert(ans.begin(), i + 1);
rep(j, yaku[i].size()) { a[yaku[i][j]] ^= 1; }
}
}
cout << ans.size() << endl;
rep(i, ans.size()) { printf("%d ", ans[i]); }
return 0;
} | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned 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;
}
//�G���g�X�e�l�X���
vector<int> estora(vector<int> num) {
int sel = 0;
while (sel < num.size()) {
int d = num[sel];
for (int i = 0; i < num.size(); i++) {
if (num[i] % d == 0 && num[i] != d && d != 1) {
num.erase(num.begin() + i);
i--;
}
}
sel++;
}
return num;
}
/*���C�u�����ő����*/
//���[�O���b�h�̌ݏ��@
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
}
/*�f��������*/
//���색�C�u����
// i����ɑf���ɂ��Ă����Ȃ��Ƃ��܂��ł��Ȃ�&&�v�Z�ʃ��o�C
//�G�X�g���l�X��⿂őf����U����Ă����K�v�������肻��
vector<ll> fac(ll n, vector<ll> num) {
ll kazu = n;
for (int i = 2; i <= n; i++) {
while (1) {
if (kazu % i != 0)
break;
kazu /= i;
num[i]++;
}
}
if (kazu == n && n != 1)
num[n]++;
return num;
int ans = 0;
if (kazu != 1)
ans++;
for (int i = 2; i <= sqrt(n); i++) {
for (int j = 1; j <= num[i]; j++) {
num[i] -= j;
ans++;
}
}
return num;
}
const int INF = 1001001001;
// mint�p�̒萔 (10��9�� + 7)
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
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; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<int>> yaku(n, vector<int>(1, 1));
srep(i, 2, n + 1) {
int num = i;
while (num <= n) {
yaku[num - 1].emplace_back(i);
num += i;
}
}
vector<int> ans(0);
for (int i = n - 1; i >= 0; i--) {
if (a[i] == 1) {
ans.insert(ans.begin(), i + 1);
rep(j, yaku[i].size()) { a[yaku[i][j] - 1] ^= 1; }
}
}
cout << ans.size() << endl;
rep(i, ans.size()) { printf("%d ", ans[i]); }
return 0;
} | [
"assignment.change"
] | 777,437 | 777,438 | u616794313 | cpp |
p02972 | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; ++i)
#define loop(i, a, b) for (int i = a; i < b; ++i)
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define gcd(a, b) __gcd((a), (b))
#define fill(a, value) memset(a, value, sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout << (x) << endl;
#define sum(v) +x accumulate(v.begin(), v.end(), x);
typedef pair<int, int> pii;
typedef vector<int> vi;
signed main() {
fastio;
cout << fixed << setprecision(12);
int n;
cin >> n;
int A[202020];
int B[202020];
f(i, n) cin >> A[i + 1];
vi ans;
for (int i = n; i >= 1; i--) {
int cur = 0;
for (int j = i; j <= n; j++) {
cur += B[j];
}
cur %= 2;
if (cur != A[i]) {
ans.pb(i);
B[i] = 1;
}
}
reverse(all(ans));
print(ans.size()) for (auto p : ans) { cout << p << " "; }
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; ++i)
#define loop(i, a, b) for (int i = a; i < b; ++i)
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define gcd(a, b) __gcd((a), (b))
#define fill(a, value) memset(a, value, sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout << (x) << endl;
#define sum(v) +x accumulate(v.begin(), v.end(), x);
typedef pair<int, int> pii;
typedef vector<int> vi;
signed main() {
fastio;
cout << fixed << setprecision(12);
int n;
cin >> n;
int A[202020];
int B[202020];
f(i, n) cin >> A[i + 1];
vi ans;
for (int i = n; i >= 1; i--) {
int cur = 0;
for (int j = i; j <= n; j += i) {
cur += B[j];
}
cur %= 2;
if (cur != A[i]) {
ans.pb(i);
B[i] = 1;
}
}
reverse(all(ans));
print(ans.size()) for (auto p : ans) { cout << p << " "; }
return 0;
} | [] | 777,443 | 777,444 | u858929490 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; i++)
cin >> a[i];
vector<int> ko(N + 1, 0);
int cnt = 0;
for (int i = N; i > 0; i--) {
int t = 0;
for (int j = i; j <= N; j += i) {
t += ko[i];
}
if (t % 2 != a[i]) {
ko[i]++;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= N; i++) {
if (ko[i] == 1) {
cout << i << endl;
}
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; i++)
cin >> a[i];
vector<int> ko(N + 1, 0);
int cnt = 0;
for (int i = N; i > 0; i--) {
int t = 0;
for (int j = i; j <= N; j += i) {
t += ko[j];
}
if (t % 2 != a[i]) {
ko[i]++;
cnt++;
}
}
cout << cnt << endl;
for (int i = 1; i <= N; i++) {
if (ko[i] == 1) {
cout << i << endl;
}
}
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 777,450 | 777,451 | u503221936 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
vector<long long> divisor(long long n) { // nの約数列挙
vector<long long> res;
for (long long i = 1; 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() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; i++)
cin >> a[i];
vector<int> sum(N + 1, 0);
vector<int> ko(N + 1, 0);
int cnt = 0;
for (int i = N; i > 0; i--) {
if (sum[i] % 2 != a[i]) {
ko[i]++;
sum[i]++;
cnt++;
vector<long long> d = divisor(N - i);
for (int j = 0; j < d.size(); j++) {
if (d[j] != N - i) {
sum[d[j]]++;
}
}
}
}
cout << cnt << endl;
for (int i = 1; i <= N; i++) {
if (ko[i] == 1) {
cout << i << endl;
}
}
} | #include <iostream>
#include <vector>
using namespace std;
vector<long long> divisor(long long n) { // nの約数列挙
vector<long long> res;
for (long long i = 1; 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() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; i++)
cin >> a[i];
vector<int> sum(N + 1, 0);
vector<int> ko(N + 1, 0);
int cnt = 0;
for (int i = N; i > 0; i--) {
if (sum[i] % 2 != a[i]) {
ko[i]++;
sum[i]++;
cnt++;
vector<long long> d = divisor(i);
for (int j = 0; j < d.size(); j++) {
if (d[j] != i) {
sum[d[j]]++;
}
}
}
}
cout << cnt << endl;
for (int i = 1; i <= N; i++) {
if (ko[i] == 1) {
cout << i << endl;
}
}
} | [
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 777,452 | 777,453 | u503221936 | cpp |
p02972 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
typedef pair<ll, ll> p;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const long long mod = 1e9 + 7;
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
vector<int> to[200005];
vector<int> ans;
ll gcd(ll a, ll b);
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
ll sum = 0;
for (int i = n; i > 0; i--) {
ll j = n / i, tot = 0;
while (j != 1) {
tot += b[j * i];
j--;
}
if (tot % 2 != a[i]) {
b[i] = 1;
sum++;
}
}
if (sum == 0)
cout << 0;
else {
cout << sum << endl;
repl(i, 1, n + 1) {
if (b[i] == 1)
cout << 1 << " ";
}
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); } | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
typedef pair<ll, ll> p;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const long long mod = 1e9 + 7;
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
vector<int> to[200005];
vector<int> ans;
ll gcd(ll a, ll b);
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
ll sum = 0;
for (int i = n; i > 0; i--) {
ll j = n / i, tot = 0;
while (j != 1) {
tot += b[j * i];
j--;
}
if (tot % 2 != a[i]) {
b[i] = 1;
sum++;
}
}
if (sum == 0)
cout << 0;
else {
cout << sum << endl;
repl(i, 1, n + 1) {
if (b[i] == 1)
cout << i << " ";
}
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); } | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 777,454 | 777,455 | u401139594 | cpp |
p02972 | #include <bits/stdc++.h>
#include <float.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
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;
}
// 多次元 vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> counter(N + 1, 0);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int count = 0;
int now = i + 1;
while (now <= N) {
count += counter[now];
now += now;
}
if (count % 2 != a[i]) {
counter[i + 1]++;
ans.push_back(i + 1);
}
}
int size = ans.size();
cout << size << endl;
if (size > 0) {
rep(i, size) { cout << ans[i] << endl; }
}
} | #include <bits/stdc++.h>
#include <float.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
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;
}
// 多次元 vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> counter(N + 1, 0);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int count = 0;
int now = i + 1;
while (now <= N) {
count += counter[now];
now += i + 1;
}
if (count % 2 != a[i]) {
counter[i + 1]++;
ans.push_back(i + 1);
}
}
/*
rep(i,counter.size()){
cout << i << " " << counter[i] << endl;
}
*/
int size = ans.size();
cout << size << endl;
if (size > 0) {
rep(i, size) { cout << ans[i] << endl; }
}
} | [
"assignment.value.change",
"assignment.change"
] | 777,458 | 777,459 | u622045059 | cpp |
p02972 | #include <bits/stdc++.h>
#include <float.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
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;
}
// 多次元 vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> counter(N + 1, 0);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int count = 0;
int now = i + 1;
while (now > N) {
count += counter[now];
now += now;
}
if (count % 2 != a[i]) {
counter[i + 1]++;
ans.push_back(i + 1);
}
}
int size = ans.size();
cout << size << endl;
if (size > 0) {
rep(i, size) { cout << ans[i] << endl; }
}
} | #include <bits/stdc++.h>
#include <float.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
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;
}
// 多次元 vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> counter(N + 1, 0);
vector<int> ans;
for (int i = N - 1; i >= 0; i--) {
int count = 0;
int now = i + 1;
while (now <= N) {
count += counter[now];
now += i + 1;
}
if (count % 2 != a[i]) {
counter[i + 1]++;
ans.push_back(i + 1);
}
}
/*
rep(i,counter.size()){
cout << i << " " << counter[i] << endl;
}
*/
int size = ans.size();
cout << size << endl;
if (size > 0) {
rep(i, size) { cout << ans[i] << endl; }
}
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"assignment.change"
] | 777,460 | 777,459 | u622045059 | cpp |
p02972 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
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 Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
rep(i, N + 1) {
if (i == 0)
continue;
cin >> a[i];
}
vector<int> counter(N + 1, 0);
for (int i = N; i >= 1; i--) {
int cnt = 0;
int multiple = 2;
while (i * multiple <= N) {
cnt += a[i * multiple];
multiple++;
}
if (cnt % 2 != a[i]) {
counter[i]++;
}
}
vector<int> ans;
rep(i, N + 1) {
if (counter[i] == 1) {
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (auto a : ans) {
cout << a << endl;
}
} | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
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 Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
rep(i, N + 1) {
if (i == 0)
continue;
cin >> a[i];
}
vector<int> counter(N + 1, 0);
for (int i = N; i >= 1; i--) {
int cnt = 0;
int multiple = 2;
while (i * multiple <= N) {
cnt += counter[i * multiple];
multiple++;
}
if ((cnt % 2) != a[i]) {
counter[i]++;
}
}
vector<int> ans;
rep(i, N + 1) {
if (counter[i] == 1) {
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (auto a : ans) {
cout << a << endl;
}
} | [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 777,461 | 777,462 | u622045059 | cpp |
p02972 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
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 Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
rep(i, N + 1) {
if (i == 0)
continue;
cin >> a[i];
}
vector<int> counter(N + 1, 0);
for (int i = N; i >= 1; i--) {
int cnt = 0;
int multiple = 2;
while (i * multiple <= N) {
cnt += a[i];
multiple++;
}
if (cnt % 2 != a[i]) {
counter[i]++;
}
}
vector<int> ans;
rep(i, N + 1) {
if (counter[i] == 1) {
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (auto a : ans) {
cout << a << endl;
}
} | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
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 Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<int> a(N + 1, 0);
rep(i, N + 1) {
if (i == 0)
continue;
cin >> a[i];
}
vector<int> counter(N + 1, 0);
for (int i = N; i >= 1; i--) {
int cnt = 0;
int multiple = 2;
while (i * multiple <= N) {
cnt += counter[i * multiple];
multiple++;
}
if ((cnt % 2) != a[i]) {
counter[i]++;
}
}
vector<int> ans;
rep(i, N + 1) {
if (counter[i] == 1) {
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (auto a : ans) {
cout << a << endl;
}
} | [
"assignment.value.change",
"identifier.change",
"assignment.change",
"control_flow.branch.if.condition.change"
] | 777,463 | 777,462 | u622045059 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using DoP = pair<double, double>;
using edge = struct {
int to;
ll cost;
};
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1e9 + 100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
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 {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
vector<int> ans;
rep(i, n) { cin >> a[i + 1]; }
for (int i = n; i > 0; --i) {
int t = 0;
for (int j = 2; i * j <= n; ++j) {
t += b[i * j - 1];
}
if (a[i] != t % 2) {
b[i] = 1;
ans.push_back(i);
} else
b[i] = 0;
}
cout << ans.size() << endl;
if (ans.size()) {
for (auto x : ans) {
cout << x << " ";
}
cout << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using DoP = pair<double, double>;
using edge = struct {
int to;
ll cost;
};
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1e9 + 100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
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 {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
vector<int> ans;
rep(i, n) { cin >> a[i + 1]; }
for (int i = n; i > 0; --i) {
int t = 0;
for (int j = 2; i * j <= n; ++j) {
t += b[i * j];
}
if (a[i] != t % 2) {
b[i] = 1;
ans.push_back(i);
} else
b[i] = 0;
}
cout << ans.size() << endl;
if (ans.size()) {
for (auto x : ans) {
cout << x << " ";
}
cout << endl;
}
}
| [
"expression.operation.binary.remove"
] | 777,471 | 777,472 | u740054550 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using DoP = pair<double, double>;
using edge = struct {
int to;
ll cost;
};
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1e9 + 100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
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 {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
vector<int> ans;
rep(i, n) { cin >> a[i + 1]; }
for (int i = n; i > 0; --i) {
int t = 0;
for (int j = 2; i * j <= n; ++j) {
t += b[i * j - 1];
}
if (a[i] != t) {
b[i] = 1;
ans.push_back(i);
} else
b[i] = 0;
}
cout << ans.size() << endl;
if (ans.size()) {
for (auto x : ans) {
cout << x << " ";
}
cout << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using DoP = pair<double, double>;
using edge = struct {
int to;
ll cost;
};
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1e9 + 100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
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 {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
vector<int> ans;
rep(i, n) { cin >> a[i + 1]; }
for (int i = n; i > 0; --i) {
int t = 0;
for (int j = 2; i * j <= n; ++j) {
t += b[i * j];
}
if (a[i] != t % 2) {
b[i] = 1;
ans.push_back(i);
} else
b[i] = 0;
}
cout << ans.size() << endl;
if (ans.size()) {
for (auto x : ans) {
cout << x << " ";
}
cout << endl;
}
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 777,473 | 777,472 | u740054550 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[n], b[200010] = {}, ans = 0;
rep(i, n) cin >> a[i];
for (int j = n; j > 0; j--) {
int tmp = j, cnt = 0;
while (tmp <= n) {
cnt += b[tmp];
tmp += j;
}
b[j] = (a[j - 1] + tmp) % 2;
if (b[j] != 0)
ans++;
}
cout << ans << endl;
if (ans == 0)
return 0;
rep(i, n + 1) if (b[i] == 1) cout << i << " ";
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[n], b[200010] = {}, ans = 0;
rep(i, n) cin >> a[i];
for (int j = n; j > 0; j--) {
int tmp = j, cnt = 0;
while (tmp <= n) {
cnt += b[tmp];
tmp += j;
}
b[j] = (a[j - 1] + cnt) % 2;
if (b[j] != 0)
ans++;
}
cout << ans << endl;
if (ans == 0)
return 0;
rep(i, n + 1) if (b[i] == 1) cout << i << " ";
cout << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 777,486 | 777,487 | u501163846 | cpp |
p02972 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[n], b[200010] = {}, ans = 0;
rep(i, n) cin >> a[i];
for (int j = n; j > 0; j--) {
int tmp = 0, cnt = 0;
while (tmp <= n) {
cnt += b[tmp];
tmp += j;
}
b[j] = (a[j - 1] + tmp) % 2;
if (b[j] != 0)
ans++;
}
cout << ans << endl;
if (ans == 0)
return 0;
rep(i, n) if (b[i] == 1) cout << i << " ";
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[n], b[200010] = {}, ans = 0;
rep(i, n) cin >> a[i];
for (int j = n; j > 0; j--) {
int tmp = j, cnt = 0;
while (tmp <= n) {
cnt += b[tmp];
tmp += j;
}
b[j] = (a[j - 1] + cnt) % 2;
if (b[j] != 0)
ans++;
}
cout << ans << endl;
if (ans == 0)
return 0;
rep(i, n + 1) if (b[i] == 1) cout << i << " ";
cout << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 777,488 | 777,487 | u501163846 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto itr : vec)
cout << itr << ' ';
cout << '\n';
}
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> ans(n + 1);
FOR(i, 1, n + 1) cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += a[j];
}
if (a[i] == 0) {
if (sum % 2 == 0)
ans[i] = 0;
else
ans[i] = 1;
} else {
if (sum % 2 == 0)
ans[i] = 1;
else
ans[i] = 0;
}
}
int cnt = 0;
FOR(i, 1, n + 1) if (ans[i]) cnt++;
cout << cnt << endl;
FOR(i, 1, n + 1) if (ans[i]) cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto itr : vec)
cout << itr << ' ';
cout << '\n';
}
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> ans(n + 1);
FOR(i, 1, n + 1) cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += ans[j];
}
if (a[i] == 0) {
if (sum % 2 == 0)
ans[i] = 0;
else
ans[i] = 1;
} else {
if (sum % 2 == 0)
ans[i] = 1;
else
ans[i] = 0;
}
}
int cnt = 0;
FOR(i, 1, n + 1) if (ans[i]) cnt++;
cout << cnt << endl;
FOR(i, 1, n + 1) if (ans[i]) cout << i << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 777,491 | 777,492 | u340010271 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto itr : vec)
cout << itr << ' ';
cout << '\n';
}
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> ans(n + 1);
FOR(i, 1, n + 1) cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += a[j];
}
if (a[i] == 0) {
if (sum % 2 == 0)
ans[i] = 0;
else
ans[i] = 1;
} else {
if (sum % 2 == 0)
ans[i] = 1;
else
ans[i] = 0;
}
}
int cnt = 0;
FOR(i, 1, n + 1) if (ans[i]) cnt++;
cout << cnt << endl;
FOR(i, 1, n + 1) if (ans[i]) cout << ans[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto itr : vec)
cout << itr << ' ';
cout << '\n';
}
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> ans(n + 1);
FOR(i, 1, n + 1) cin >> a[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += ans[j];
}
if (a[i] == 0) {
if (sum % 2 == 0)
ans[i] = 0;
else
ans[i] = 1;
} else {
if (sum % 2 == 0)
ans[i] = 1;
else
ans[i] = 0;
}
}
int cnt = 0;
FOR(i, 1, n + 1) if (ans[i]) cnt++;
cout << cnt << endl;
FOR(i, 1, n + 1) if (ans[i]) cout << i << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 777,493 | 777,492 | u340010271 | cpp |
p02972 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1, 0);
rep(i, n) cin >> a[i + 1];
vector<bool> in(n + 1, false);
vector<int> ans;
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j < n; j += i) {
if (in[j])
cnt++;
}
if (cnt % 2 != a[i]) {
in[i] = true;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (auto p : ans) {
cout << p << " ";
}
cout << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1, 0);
rep(i, n) cin >> a[i + 1];
vector<bool> in(n + 1, false);
vector<int> ans;
for (int i = n; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= n; j += i) {
if (in[j])
cnt++;
}
if (cnt % 2 != a[i]) {
in[i] = true;
ans.push_back(i);
}
}
cout << ans.size() << endl;
for (auto p : ans) {
cout << p << " ";
}
cout << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,494 | 777,495 | u415325136 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Khela \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define llu long long unsigned int
#define pf printf
#define sf scanf
#define f first
#define s second
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define PII pair<ll, ll>
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
const int max = 1e9 + 100;
const ll MAX = 1e18 + 500;
const int sz = 2e5 + 100;
int mark[sz];
vector<int> test;
int main() {
Khela int a, b, c, i, j, k, q, p, x, y, ct, ct1, m, l, r, x1, y1, mn, h, sum1,
in, z, mid, n, mx;
char ch;
double d;
string str1, str2, str;
bool bl, bl1;
int t, cs = 1;
while (cin >> n) {
test.clear();
memset(mark, 0, sizeof mark);
int ara[n + 2];
for (i = 1; i <= n; i++)
cin >> ara[i];
int ct = 0;
for (i = n; i >= 1; i--) {
p = mark[i];
x = 0;
if (p % 2 != ara[i])
++x, ++ct, test.pb(i);
if (x > 0) {
int sq = sqrt(i) + 1;
for (j = 1; j <= sq; j++) {
if (i % j == 0) {
++mark[j];
if (j * j != n)
++mark[i / j];
}
}
}
}
reverse(test.begin(), test.end());
cout << ct << endl;
if (test.size() > 0) {
for (auto xx : test)
cout << xx << " ";
cout << endl;
}
}
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Khela \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define llu long long unsigned int
#define pf printf
#define sf scanf
#define f first
#define s second
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define PII pair<ll, ll>
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
const int max = 1e9 + 100;
const ll MAX = 1e18 + 500;
const int sz = 2e5 + 100;
int mark[sz];
vector<int> test;
int main() {
Khela int a, b, c, i, j, k, q, p, x, y, ct, ct1, m, l, r, x1, y1, mn, h, sum1,
in, z, mid, n, mx;
char ch;
double d;
string str1, str2, str;
bool bl, bl1;
int t, cs = 1;
while (cin >> n) {
test.clear();
memset(mark, 0, sizeof mark);
int ara[n + 2];
for (i = 1; i <= n; i++)
cin >> ara[i];
int ct = 0;
for (i = n; i >= 1; i--) {
p = mark[i];
x = 0;
if (p % 2 != ara[i])
++x, ++ct, test.pb(i);
if (x > 0) {
int sq = sqrt(i);
for (j = 1; j <= sq; j++) {
if (i % j == 0) {
++mark[j];
if (j * j != i)
++mark[i / j];
}
}
}
}
reverse(test.begin(), test.end());
cout << ct << endl;
if (test.size() > 0) {
for (auto xx : test)
cout << xx << " ";
cout << endl;
}
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 777,500 | 777,501 | u863370423 | cpp |
p02972 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Khela \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define llu long long unsigned int
#define pf printf
#define sf scanf
#define f first
#define s second
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define PII pair<ll, ll>
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
const int max = 1e9 + 100;
const ll MAX = 1e18 + 500;
const int sz = 2e5 + 100;
int mark[sz];
vector<int> test;
int main() {
Khela int a, b, c, i, j, k, q, p, x, y, ct, ct1, m, l, r, x1, y1, mn, h, sum1,
in, z, mid, n, mx;
char ch;
double d;
string str1, str2, str;
bool bl, bl1;
int t, cs = 1;
while (cin >> n) {
test.clear();
memset(mark, 0, sizeof mark);
int ara[n + 2];
for (i = 1; i <= n; i++)
cin >> ara[i];
int ct = 0;
for (i = n; i >= 1; i--) {
p = mark[i];
x = 0;
if (p % 2 != ara[i])
++x, ++ct, test.pb(i);
if (x > 0) {
int sq = sqrt(i);
for (j = 1; j <= sq; j++) {
if (i % j == 0) {
++mark[j];
if (j * j != n)
++mark[i / j];
}
}
}
}
reverse(test.begin(), test.end());
cout << ct << endl;
if (test.size() > 0) {
for (auto xx : test)
cout << xx << " ";
cout << endl;
}
}
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Khela \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define llu long long unsigned int
#define pf printf
#define sf scanf
#define f first
#define s second
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define PII pair<ll, ll>
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
const int max = 1e9 + 100;
const ll MAX = 1e18 + 500;
const int sz = 2e5 + 100;
int mark[sz];
vector<int> test;
int main() {
Khela int a, b, c, i, j, k, q, p, x, y, ct, ct1, m, l, r, x1, y1, mn, h, sum1,
in, z, mid, n, mx;
char ch;
double d;
string str1, str2, str;
bool bl, bl1;
int t, cs = 1;
while (cin >> n) {
test.clear();
memset(mark, 0, sizeof mark);
int ara[n + 2];
for (i = 1; i <= n; i++)
cin >> ara[i];
int ct = 0;
for (i = n; i >= 1; i--) {
p = mark[i];
x = 0;
if (p % 2 != ara[i])
++x, ++ct, test.pb(i);
if (x > 0) {
int sq = sqrt(i);
for (j = 1; j <= sq; j++) {
if (i % j == 0) {
++mark[j];
if (j * j != i)
++mark[i / j];
}
}
}
}
reverse(test.begin(), test.end());
cout << ct << endl;
if (test.size() > 0) {
for (auto xx : test)
cout << xx << " ";
cout << endl;
}
}
} | [
"control_flow.branch.if.condition.change"
] | 777,502 | 777,501 | u863370423 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
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() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n + 1, 0);
for (ll i = 1; i < n + 1; i++)
cin >> a[i];
for (ll i = n; i > 0; i--) {
ll tmp = 0;
for (ll j = 2 * i; j < n + 1; j += i)
tmp += a[j];
if (tmp % 2 == a[i])
b[i] = 0;
else
b[i] = 1;
}
cout << count(b.begin(), b.end(), 1) << endl;
vector<ll> ans;
for (ll i = 1; i < n + 1; i++)
if (b[i])
ans.push_back(i);
for (ll i = 0; i < ans.size(); i++)
cout << ans[i] << " \n"[i == ans.size() - 1];
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
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() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n + 1, 0);
for (ll i = 1; i < n + 1; i++)
cin >> a[i];
for (ll i = n; i > 0; i--) {
ll tmp = 0;
for (ll j = 2 * i; j < n + 1; j += i)
tmp += b[j];
if (tmp % 2 == a[i])
b[i] = 0;
else
b[i] = 1;
}
cout << count(b.begin(), b.end(), 1) << endl;
vector<ll> ans;
for (ll i = 1; i < n + 1; i++)
if (b[i])
ans.push_back(i);
for (ll i = 0; i < ans.size(); i++)
cout << ans[i] << " \n"[i == ans.size() - 1];
} | [
"assignment.value.change",
"identifier.change"
] | 777,508 | 777,509 | u371051907 | cpp |
p02972 |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
while (b != 0) {
ll tmp = b;
b = a % b;
a = tmp;
}
return a;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> NUM(N + 1);
loop(1, N + 1, i) { cin >> A[i]; }
int cnt = 0;
for (int i = N; i >= 1; i--) {
int k = 0;
for (int j = i; j <= N; j += i) {
if (NUM[j] == 1) {
k++;
}
}
if (k % 2 != A[i]) {
NUM[i] = 1;
cnt++;
}
}
if (cnt == 0) {
print(0);
return 0;
}
print(cnt);
bool flag = true;
for (int i = 1; i < N; i++) {
if (NUM[i] == 1) {
if (flag) {
cout << i;
flag = false;
} else {
cout << " " << i;
}
}
}
cout << "\n";
return 9;
} |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
while (b != 0) {
ll tmp = b;
b = a % b;
a = tmp;
}
return a;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> NUM(N + 1);
loop(1, N + 1, i) { cin >> A[i]; }
int cnt = 0;
for (int i = N; i >= 1; i--) {
int k = 0;
for (int j = i; j <= N; j += i) {
if (NUM[j] == 1) {
k++;
}
}
if (k % 2 != A[i]) {
NUM[i] = 1;
cnt++;
}
}
if (cnt == 0) {
print(0);
return 0;
}
print(cnt);
bool flag = true;
for (int i = 1; i <= N; i++) {
if (NUM[i] == 1) {
if (flag) {
cout << i;
flag = false;
} else {
cout << " " << i;
}
}
}
cout << "\n";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"function.return_value.change"
] | 777,514 | 777,515 | u111653921 | cpp |
p02972 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += ans[j];
}
sum %= 2;
if (sum != a[i])
ans[i] = 1;
else
ans[i] = 0;
}
int m = 0;
for (int i = 1; i <= n; i++) {
if (ans[i] == 1)
m++;
}
cout << m << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] == 1)
cout << 1 << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += ans[j];
}
sum %= 2;
if (sum != a[i])
ans[i] = 1;
else
ans[i] = 0;
}
int m = 0;
for (int i = 1; i <= n; i++) {
if (ans[i] == 1)
m++;
}
cout << m << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] == 1)
cout << i << endl;
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 777,517 | 777,518 | u308012928 | cpp |
p02972 | // https://atcoder.jp/contests/abc134/tasks/abc134_d
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define LEN(x) (sizeof(x) / sizeof(*(x)))
// ll gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
// ll lcm(long a, long b) { return a * b / gcd(a, b); }
inline int read() {
int out = 0, fh = 1;
char jp = getchar();
while ((jp > '9' || jp < '0') && jp != '-')
jp = getchar();
if (jp == '-')
fh = -1, jp = getchar();
while (jp >= '0' && jp <= '9')
out = out * 10 + jp - '0', jp = getchar();
return out * fh;
}
int a[200001];
bool b[200001];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int x = a[i];
for (int j = i << 1; j <= n; j += i) {
x ^= b[j];
}
b[i] = x;
if (x)
ans++;
}
cout << ans << '\n';
for (int i = 1; i <= n; i++) {
if (b[i])
cout << "i ";
}
return 0;
}
| // https://atcoder.jp/contests/abc134/tasks/abc134_d
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define LEN(x) (sizeof(x) / sizeof(*(x)))
// ll gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
// ll lcm(long a, long b) { return a * b / gcd(a, b); }
inline int read() {
int out = 0, fh = 1;
char jp = getchar();
while ((jp > '9' || jp < '0') && jp != '-')
jp = getchar();
if (jp == '-')
fh = -1, jp = getchar();
while (jp >= '0' && jp <= '9')
out = out * 10 + jp - '0', jp = getchar();
return out * fh;
}
int a[200001];
bool b[200001];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int x = a[i];
for (int j = i << 1; j <= n; j += i) {
x ^= b[j];
}
b[i] = x;
if (x)
ans++;
}
cout << ans << '\n';
for (int i = 1; i <= n; i++) {
if (b[i])
cout << i << " ";
}
return 0;
}
| [
"io.output.change",
"literal.string.change"
] | 777,519 | 777,520 | u858107870 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin, end) for (ll i = begin; end < i; i--) // repeat reverse
#endif
class ABC134D {
public:
ABC134D() {
cin >> n;
a.resize(n + 1);
rep(i, 1, n + 1) cin >> a[i];
}
void Run(void) {
vector<ll> ans(n + 1);
repr(i, n, 0) {
if (n < i * 2)
ans[i] = a[i];
else
ans[i] = (SumAns(i, ans) % 2 == a[i]) ? 0 : 1;
}
cout << count(all(ans), 1) << endl;
rep(i, 1, n + 1) {
if (ans[i] == 1)
cout << i << " ";
}
}
private:
ll SumAns(ll s, vector<ll> &ans) {
ll count = 0;
ll i = s * 2;
while (i < n) {
count += ans[i];
i += s;
}
return count;
}
ll n;
vector<ll> a;
};
int main(void) {
ABC134D abc134d;
abc134d.Run();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin, end) for (ll i = begin; end < i; i--) // repeat reverse
#endif
class ABC134D {
public:
ABC134D() {
cin >> n;
a.resize(n + 1);
rep(i, 1, n + 1) cin >> a[i];
}
void Run(void) {
vector<ll> ans(n + 1);
repr(i, n, 0) {
if (n < i * 2)
ans[i] = a[i];
else
ans[i] = (SumAns(i, ans) % 2 == a[i]) ? 0 : 1;
}
cout << count(all(ans), 1) << endl;
rep(i, 1, n + 1) {
if (ans[i] == 1)
cout << i << " ";
}
}
private:
ll SumAns(ll s, vector<ll> &ans) {
ll count = 0;
ll i = s * 2;
while (i <= n) {
count += ans[i];
i += s;
}
return count;
}
ll n;
vector<ll> a;
};
int main(void) {
ABC134D abc134d;
abc134d.Run();
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 777,524 | 777,525 | u153390822 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin, end) for (ll i = begin; end < i; i--) // repeat reverse
#endif
class ABC134D {
public:
ABC134D() {
cin >> n;
a.resize(n + 1);
rep(i, 1, n + 1) cin >> a[i];
}
void Run(void) {
vector<ll> ans(n + 1);
repr(i, n, 0) {
if (n < i * 2)
ans[i] = a[i];
else
ans[i] = (SumAns(i, ans) % 2 == a[i]) ? 0 : 1;
}
cout << count(all(ans), 1) << endl;
rep(i, 1, n + 1) {
if (ans[i] == 1)
cout << i << " ";
}
}
private:
ll SumAns(ll s, vector<ll> &ans) {
ll count = 0;
ll i = s * 2;
while (n < i) {
count += ans[i];
i += s;
}
return count;
}
ll n;
vector<ll> a;
};
int main(void) {
ABC134D abc134d;
abc134d.Run();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin, end) for (ll i = begin; end < i; i--) // repeat reverse
#endif
class ABC134D {
public:
ABC134D() {
cin >> n;
a.resize(n + 1);
rep(i, 1, n + 1) cin >> a[i];
}
void Run(void) {
vector<ll> ans(n + 1);
repr(i, n, 0) {
if (n < i * 2)
ans[i] = a[i];
else
ans[i] = (SumAns(i, ans) % 2 == a[i]) ? 0 : 1;
}
cout << count(all(ans), 1) << endl;
rep(i, 1, n + 1) {
if (ans[i] == 1)
cout << i << " ";
}
}
private:
ll SumAns(ll s, vector<ll> &ans) {
ll count = 0;
ll i = s * 2;
while (i <= n) {
count += ans[i];
i += s;
}
return count;
}
ll n;
vector<ll> a;
};
int main(void) {
ABC134D abc134d;
abc134d.Run();
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.loop.condition.change"
] | 777,526 | 777,525 | u153390822 | cpp |
p02972 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin, end) for (ll i = begin; end < i; i--) // repeat reverse
#endif
class ABC134D {
public:
ABC134D() {
cin >> n;
a.resize(n + 1);
rep(i, 1, n + 1) cin >> a[i];
}
void Run(void) {
vector<ll> ans(n + 1);
repr(i, n, 0) {
if (n < i * 2)
ans[i] = a[i];
else
ans[i] = (SumAns(i, ans) % 2 == a[i]) ? 0 : 1;
}
cout << count(all(ans), 1) << endl;
rep(i, 1, n + 1) {
if (ans[i] == 1)
cout << i << " ";
}
}
private:
ll SumAns(ll s, vector<ll> ans) {
ll count = 0;
ll i = s * 2;
while (n < i) {
count += ans[i];
i += s;
}
return count;
}
ll n;
vector<ll> a;
};
int main(void) {
ABC134D abc134d;
abc134d.Run();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin, end) for (ll i = begin; end < i; i--) // repeat reverse
#endif
class ABC134D {
public:
ABC134D() {
cin >> n;
a.resize(n + 1);
rep(i, 1, n + 1) cin >> a[i];
}
void Run(void) {
vector<ll> ans(n + 1);
repr(i, n, 0) {
if (n < i * 2)
ans[i] = a[i];
else
ans[i] = (SumAns(i, ans) % 2 == a[i]) ? 0 : 1;
}
cout << count(all(ans), 1) << endl;
rep(i, 1, n + 1) {
if (ans[i] == 1)
cout << i << " ";
}
}
private:
ll SumAns(ll s, vector<ll> &ans) {
ll count = 0;
ll i = s * 2;
while (i <= n) {
count += ans[i];
i += s;
}
return count;
}
ll n;
vector<ll> a;
};
int main(void) {
ABC134D abc134d;
abc134d.Run();
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.loop.condition.change"
] | 777,527 | 777,525 | u153390822 | cpp |
p02972 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(), a.end()
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
#define S 21
llfor;
const ll mod = 1000000007;
/*pi*/ const double pi = acos(-1);
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗*/ ll llpow(ll x, ll n) {
ll ans = 1;
rep(i, 0, n) { ans *= x; }
return ans;
}
/*階乗*/ ll fact(ll x) {
ll ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) * fact(n - r) / fact(r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
/*Fibonacci数列*/ ll fib(ll x) {
ll fibo[x + 10];
fibo[0] = 1;
fibo[1] = 1;
fibo[2] = 1;
rep(i, 3, x + 1) fibo[i] = fibo[i - 1] + fibo[i - 2];
return fibo[x];
}
/*桁数*/ ll dig(ll n) {
ll d = 1, tmp = n;
while (tmp / 10 > 0) {
tmp /= 10;
d++;
}
return d;
}
/*行列のコピー*/ void matcpy(ll a[S][S], ll b[S][S]) {
ll t = i;
rep(i, 0, S) rep(j, 0, S) b[i][j] = a[i][j]; /*(aをbに)*/
i = t;
}
/*行列のリセット*/ void matrst(ll a[S][S]) {
ll t = i;
rep(i, 0, S) rep(j, 0, S) a[i][j] = 0;
i = t;
}
/*行列の2乗*/ void matpow(ll a[S][S]) {
ll ans[S][S];
matrst(ans);
ll t = i, k;
rep(i, 0, S) rep(j, 0, S) rep(k, 0, S) ans[i][j] += a[i][k] * a[k][j];
matcpy(ans, a);
i = t;
}
/*行列の乗算*/ void matmul(ll a[S][S], ll b[S][S], ll as[S][S]) {
ll t = i, k;
matrst(as);
rep(i, 0, S) rep(j, 0, S) rep(k, 0, S) as[i][j] += a[i][k] * b[k][j];
i = t;
}
// ll ans=0;
////////////////////////////////////////////////////////////
int main() {
ll n;
cin >> n;
bool a[n + 10];
rep(i, 1, n + 1) sc(a[i]);
ll box[n + 10] = {0}, c, sum = 0;
rrp(i, n + 1, 1) {
c = 0;
for (j = 2; j * i < n; j++)
c += box[j * i];
if (c % 2 != a[i]) {
box[i] = 1;
sum++;
}
}
pr(sum);
rep(i, 1, n + 1) {
if (box[i] != 0)
cout << i << " ";
}
pnn;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(), a.end()
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
#define S 21
llfor;
const ll mod = 1000000007;
/*pi*/ const double pi = acos(-1);
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗*/ ll llpow(ll x, ll n) {
ll ans = 1;
rep(i, 0, n) { ans *= x; }
return ans;
}
/*階乗*/ ll fact(ll x) {
ll ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) * fact(n - r) / fact(r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
/*Fibonacci数列*/ ll fib(ll x) {
ll fibo[x + 10];
fibo[0] = 1;
fibo[1] = 1;
fibo[2] = 1;
rep(i, 3, x + 1) fibo[i] = fibo[i - 1] + fibo[i - 2];
return fibo[x];
}
/*桁数*/ ll dig(ll n) {
ll d = 1, tmp = n;
while (tmp / 10 > 0) {
tmp /= 10;
d++;
}
return d;
}
/*行列のコピー*/ void matcpy(ll a[S][S], ll b[S][S]) {
ll t = i;
rep(i, 0, S) rep(j, 0, S) b[i][j] = a[i][j]; /*(aをbに)*/
i = t;
}
/*行列のリセット*/ void matrst(ll a[S][S]) {
ll t = i;
rep(i, 0, S) rep(j, 0, S) a[i][j] = 0;
i = t;
}
/*行列の2乗*/ void matpow(ll a[S][S]) {
ll ans[S][S];
matrst(ans);
ll t = i, k;
rep(i, 0, S) rep(j, 0, S) rep(k, 0, S) ans[i][j] += a[i][k] * a[k][j];
matcpy(ans, a);
i = t;
}
/*行列の乗算*/ void matmul(ll a[S][S], ll b[S][S], ll as[S][S]) {
ll t = i, k;
matrst(as);
rep(i, 0, S) rep(j, 0, S) rep(k, 0, S) as[i][j] += a[i][k] * b[k][j];
i = t;
}
// ll ans=0;
////////////////////////////////////////////////////////////
int main() {
ll n;
cin >> n;
bool a[n + 10];
rep(i, 1, n + 1) sc(a[i]);
ll box[n + 10] = {0}, c, sum = 0;
rrp(i, n + 1, 1) {
c = 0;
for (j = 2; j * i <= n; j++)
c += box[j * i];
if (c % 2 != a[i]) {
box[i] = 1;
sum++;
}
}
pr(sum);
rep(i, 1, n + 1) {
if (box[i] != 0)
cout << i << " ";
}
pnn;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 777,528 | 777,529 | u006717664 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.