Submission #9967523

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <tuple>
#include <list>
#include <deque>
#include <stack>
#include <complex>
#include <functional>
#include <regex>
#include <map>
#include <numeric>

using namespace std;

#define REP(i,a,b) for(int i=(a); i<(b); ++(i))
#define rep(i,n) REP(i,0,n)

const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

using ll = long long;
using ld = long double;
using ull = unsigned long long;

int main(void) {
  int N; cin >> N;
  vector<int> A(N + 1), B(N + 1, 0);
  rep(i, N) cin >> A[i + 1];

  for (int i = N; i > N / 2; i--)
    B[i] = A[i];

  int M = 0;
  for (int i = N / 2; i >= 1; i--) {
    int sum = 0;
    for (int j = i * 2; j <= N; j += i)
      sum += A[j];
    if (A[i] == 0 && sum % 2 == 1) {
      B[i] = 1;
      M++;
    } else if (A[i] == 1 && sum % 2 == 0) {
      B[i] = 1;
      M++;
    }
  }

  cout << M << endl;
  bool first = true;
  REP(i, 1, N + 1) {
    if (B[i] == 0) continue;
    if (!first) cout << " ";
    first = false;
    cout << i;
  }
  if (!first)
    cout << endl;
  return 0;
}

Submission Info

Judge Result