Submission #6461614

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;

int main(){
  int N;
  cin >> N;
  int a[N + 1];
  for(int i = 1; i <= N; i++) cin >> a[i];

  int cnt[N + 1];
  fill(cnt, cnt + N + 1, 0);
  vector<int> ans;

  for(int i = N; i >= 1; i--){
    //cout << "cnt" << i << " " << cnt[i] << endl;
    cnt[i] %= 2;
    if(cnt[i] != a[i]){
      ans.push_back(i);
      for(int j = 1; j * j <= i; j++){
        if(i % j == 0){
          if(j != i / j){
            cnt[j]++;
            cnt[i / j]++;
          } else {
            cnt[j]++;
          }
        }
      }
    }
  }

  cout << ans.size() << endl;
  for(int i = 0; i < ans.size(); i++){
    cout << ans[i] << " ";
  }
  cout << endl;
  return 0;
}

Submission Info

Judge Result