Problem p02609 (C++) — buggy submission, verdict: Runtime Error

#pragma target("avx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr ll LINF = 1e18;

#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

//------ Believe yourself as a genius!!!!!! ------

int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
ll n, cnt, ans, a, b, c, d, tmp, m, h, w, x, y, sum, k, q;
ll rui1[ohara], rui2[ohara];

int main(void) {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);

  cin >> n >> s;
  ll tatu = 0, be1 = 0, be2 = 0, h1, h2;
  rep(i, n) {
    if (s[i] == '1')
      tatu++;
  }
  rui1[n - 1] = 1;
  rui2[n - 1] = 1;
  rrrep(i, n - 2, 0) {
    if (tatu != 1)
      rui1[i] = rui1[i + 1] * 2;
    rui2[i] = rui2[i + 1] * 2;
    if (tatu != 1)
      rui1[i] %= (tatu - 1);
    rui2[i] %= (tatu + 1);
  }
  rep(i, n) {
    if (s[i] == '1') {
      if (tatu != 1)
        be1 += rui1[i];
      if (tatu != 1)
        be1 %= (tatu - 1);
      be2 += rui2[i];
      be2 %= (tatu + 1);
    }
  }
  h1 = be1;
  h2 = be2;

  rep(i, n) {
    ll curr;
    be1 = h1;
    be2 = h2;
    if (s[i] == '1') {
      if (tatu == 1) {
        Cout(0);
        continue;
      }
      be1 -= rui1[i];
      if (be1 < 0) {
        be1 += (tatu - 1);
        be1 %= (tatu - 1);
      } else
        be1 %= (tatu - 1);
      curr = be1;
    } else {
      be2 += rui2[i];
      be2 %= (tatu + 1);
      curr = be2;
    }
    ans = 0;
    // debug(curr);
    while (1) {
      if (curr == 0)
        break;
      ans++;
      tmp = __builtin_popcount(curr);
      curr = curr % tmp;
    }
    Cout(ans + 1);
  }
  return 0;
}

Error: 0

Fixed submission:

#pragma target("avx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr ll LINF = 1e18;

#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

//------ Believe yourself as a genius!!!!!! ------

int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
ll n, cnt, ans, a, b, c, d, tmp, m, h, w, x, y, sum, k, q;
ll rui1[ohara], rui2[ohara];

int main(void) {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);

  cin >> n >> s;
  ll tatu = 0, be1 = 0, be2 = 0, h1, h2;
  rep(i, n) {
    if (s[i] == '1')
      tatu++;
  }
  rui1[n - 1] = 1;
  rui2[n - 1] = 1;
  rrrep(i, n - 2, 0) {
    rui1[i] = rui1[i + 1] * 2;
    rui2[i] = rui2[i + 1] * 2;
    rui1[i] %= (tatu - 1);
    rui2[i] %= (tatu + 1);
  }
  rep(i, n) {
    if (s[i] == '1') {
      be1 += rui1[i];
      be1 %= (tatu - 1);
      be2 += rui2[i];
      be2 %= (tatu + 1);
    }
  }
  h1 = be1;
  h2 = be2;

  rep(i, n) {
    ll curr;
    be1 = h1;
    be2 = h2;
    if (s[i] == '1') {
      be1 -= rui1[i];
      if (be1 < 0) {
        be1 += (tatu - 1);
        be1 %= (tatu - 1);
      } else
        be1 %= (tatu - 1);
      curr = be1;
    } else {
      be2 += rui2[i];
      be2 %= (tatu + 1);
      curr = be2;
    }
    ans = 0;
    // debug(curr);
    while (1) {
      if (curr == 0)
        break;
      ans++;
      tmp = __builtin_popcount(curr);
      curr = curr % tmp;
    }
    Cout(ans + 1);
  }
  return 0;
}