Problem p02609 (C++)

Buggy submission (status: Runtime Error):
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 1000000000
#define INF 3223372036854775807
#define MOD 1000000007
// #define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo - r(ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
// #define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n, k) ((n >> k) & 1)
// #define leng length()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> Pin;
typedef pair<ll, ll> Pll;
template <class T> using V = vector<T>;
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
ll pom(ll a, ll n, int m) {
  ll x = 1;
  for (a %= m; n; n /= 2)
    n & 1 ? x = x * a % m : 0, a = a * a % m;
  return x;
}
#define invp(a, p) pom(a, p - 2, p)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
ll cmp1(pair<ll, ll> a, pair<ll, ll> b) {
  if (a.fi != b.fi)
    return a.fi < b.fi;
  else
    return a.se > b.se;
}
ll cmp(ll a, ll b) { return abs(a) < abs(b); }
//----------------------------------------------------------------------
ll pop_count(ll n) {
  n = (n & 0x55555555) + (n >> 1 & 0x55555555);
  n = (n & 0x33333333) + (n >> 2 & 0x33333333);
  n = (n & 0x0f0f0f0f) + (n >> 4 & 0x0f0f0f0f);
  n = (n & 0x00ff00ff) + (n >> 8 & 0x00ff00ff);
  n = (n & 0x0000ffff) + (n >> 16 & 0x0000ffff);
  return n;
}
ll modpow(ll a, ll n, ll mod) { // a^n(MOD)を求める
  ll res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod; // 次の準備
    n >>= 1;
  }
  return res;
}
ll solve(ll n) {
  if (n == 0)
    return 0;
  else
    return solve(n % pop_count(n)) + 1;
}
//----------------------------------------------------------------------
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  //-------------------------------
  // ll begin_t=clock();
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
  //------------------------------
  ll n;
  cin >> n;
  string x;
  cin >> x;
  ll cnt = 0;
  for (ll i = 0; i < n; i++) {
    if (x[i] == '1')
      cnt++;
  }
  ll p = cnt;
  ll a1 = 0, a2 = 0;
  for (ll i = 0; i < n; i++) {
    if (x[i] == '1') {
      a1 = (a1 + modpow(2, n - i - 1, p - 1)) % (p - 1);
      a2 = (a2 + modpow(2, n - i - 1, p + 1)) % (p + 1);
    }
  }
  for (ll i = 0; i < n; i++) {
    if (x[i] == '1') {
      if (cnt == 1) {
        cout << 0 << Endl;
      } else {
        ll a11 = (a1 - modpow(2, n - i - 1, p - 1) + p - 1) % (p - 1);
        cout << solve(a11) + 1 << endl;
      }
    } else {
      ll a22 = (a2 + modpow(2, n - i - 1, p + 1)) % (p + 1);
      cout << solve(a22) + 1 << endl;
    }
  }
  //------------------------------
  // fclose(stdin);
  // fclose(stdout);
  // ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<endl;
  //-------------------------------
  return 0;
}
//----------------------------------------------------------------------


Fixed submission:
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 1000000000
#define INF 3223372036854775807
#define MOD 1000000007
// #define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo - r(ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
// #define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n, k) ((n >> k) & 1)
// #define leng length()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> Pin;
typedef pair<ll, ll> Pll;
template <class T> using V = vector<T>;
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
ll pom(ll a, ll n, int m) {
  ll x = 1;
  for (a %= m; n; n /= 2)
    n & 1 ? x = x * a % m : 0, a = a * a % m;
  return x;
}
#define invp(a, p) pom(a, p - 2, p)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
ll cmp1(pair<ll, ll> a, pair<ll, ll> b) {
  if (a.fi != b.fi)
    return a.fi < b.fi;
  else
    return a.se > b.se;
}
ll cmp(ll a, ll b) { return abs(a) < abs(b); }
//----------------------------------------------------------------------
ll pop_count(ll n) {
  n = (n & 0x55555555) + (n >> 1 & 0x55555555);
  n = (n & 0x33333333) + (n >> 2 & 0x33333333);
  n = (n & 0x0f0f0f0f) + (n >> 4 & 0x0f0f0f0f);
  n = (n & 0x00ff00ff) + (n >> 8 & 0x00ff00ff);
  n = (n & 0x0000ffff) + (n >> 16 & 0x0000ffff);
  return n;
}
ll modpow(ll a, ll n, ll mod) { // a^n(MOD)を求める
  ll res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod; // 次の準備
    n >>= 1;
  }
  return res;
}
ll solve(ll n) {
  if (n == 0)
    return 0;
  else
    return solve(n % pop_count(n)) + 1;
}
//----------------------------------------------------------------------
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  //-------------------------------
  // ll begin_t=clock();
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
  //------------------------------
  ll n;
  cin >> n;
  string x;
  cin >> x;
  ll cnt = 0;
  for (ll i = 0; i < n; i++) {
    if (x[i] == '1')
      cnt++;
  }
  ll p = cnt;
  ll a1 = 0, a2 = 0;
  for (ll i = 0; i < n; i++) {
    if (x[i] == '1') {
      if (p == 1)
        a1 = 0;
      else
        a1 = (a1 + modpow(2, n - i - 1, p - 1)) % (p - 1);
      a2 = (a2 + modpow(2, n - i - 1, p + 1)) % (p + 1);
    }
  }
  for (ll i = 0; i < n; i++) {
    if (x[i] == '1') {
      if (cnt == 1) {
        cout << 0 << Endl;
      } else {
        ll a11 = (a1 - modpow(2, n - i - 1, p - 1) + p - 1) % (p - 1);
        cout << solve(a11) + 1 << endl;
      }
    } else {
      ll a22 = (a2 + modpow(2, n - i - 1, p + 1)) % (p + 1);
      cout << solve(a22) + 1 << endl;
    }
  }
  //------------------------------
  // fclose(stdin);
  // fclose(stdout);
  // ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<endl;
  //-------------------------------
  return 0;
}
//----------------------------------------------------------------------