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

#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
const int INF = 1 << 30;
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 mod_pow(ll x, ll n, ll p) {
  ll res = 1;
  while (n > 0) {
    if (n & 1) {
      res = res * x % p;
    }
    x = x * x % p;
    n >>= 1;
  }
  return res;
}

int main() {
  ll n;
  cin >> n;
  string x;
  cin >> x;
  ll bit = 0;
  for (ll i = 0; i < n; i++) {
    if (x[i] == '1') {
      bit++;
    }
  }
  vector<ll> pow1(n + 1, 1);
  vector<ll> pow2(n + 1, 1);
  if (x[n - 1] == '0') {
    pow1[0] = 0;
    pow2[0] = 0;
  }
  for (ll i = 1; i < n; i++) {
    if (x[n - 1 - i] == '1') {
      pow1[i] = (mod_pow(2, i, bit + 1) + pow1[i - 1]) % (bit + 1);
      if (bit - 1 != 0) {
        pow2[i] = (mod_pow(2, i, bit - 1) + pow2[i - 1]) % (bit - 1);
      } else {
        pow2[i] = 0;
      }
    } else {
      pow1[i] = pow1[i - 1];
      pow2[i] = pow2[i - 1];
    }
  }
  // for(int i = 0; i < n; i++) {
  // 	cout << pow1[i] << endl;
  // }
  // cout << "bit" << bit << endl;
  for (ll i = 0; i < n; i++) {
    if (x[i] == '1') {
      if (bit - 1 == 0) {
        cout << 0 << endl;
      } else {
        ll tmp = (pow2[n - 1] - (mod_pow(2, n - 1 - i, bit - 1))) % (bit - 1);
        ll ans = 1;
        if (tmp < 0) {
          tmp += (bit - 1);
        }
        // cout << "tmp" << tmp << endl;
        while (tmp != 0) {
          ans++;
          ll div = __builtin_popcount(tmp);
          // cout << "div" << div << endl;
          // cout << "tmp" << tmp << endl;
          tmp %= div;
        }
        cout << ans << endl;
      }

    } else {
      ll tmp = (pow1[n - 1] + (mod_pow(2, n - 1 - i, bit + 1))) % (bit + 1);
      ll ans = 1;
      // cout << "tmp" << tmp << endl;
      while (tmp != 0) {
        ans++;
        ll div = __builtin_popcount(tmp);
        // cout << "div" << div << endl;
        // cout << "tmp" << tmp << endl;
        tmp %= div;
      }
      cout << ans << endl;
    }
  }
  return 0;
}

Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
const int INF = 1 << 30;
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 mod_pow(ll x, ll n, ll p) {
  ll res = 1;
  while (n > 0) {
    if (n & 1) {
      res = res * x % p;
    }
    x = x * x % p;
    n >>= 1;
  }
  return res;
}

int main() {
  ll n;
  cin >> n;
  string x;
  cin >> x;
  ll bit = 0;
  for (ll i = 0; i < n; i++) {
    if (x[i] == '1') {
      bit++;
    }
  }
  vector<ll> pow1(n + 1, 1);
  vector<ll> pow2(n + 1, 1);
  if (x[n - 1] == '0') {
    pow1[0] = 0;
    pow2[0] = 0;
  }
  for (ll i = 1; i < n; i++) {
    if (x[n - 1 - i] == '1') {
      pow1[i] = (mod_pow(2, i, bit + 1) + pow1[i - 1]) % (bit + 1);
      pow2[i] = (mod_pow(2, i, bit - 1) + pow2[i - 1]) % (bit - 1);
    } else {
      pow1[i] = pow1[i - 1];
      pow2[i] = pow2[i - 1];
    }
  }
  // for(int i = 0; i < n; i++) {
  // 	cout << pow1[i] << endl;
  // }
  // cout << "bit" << bit << endl;
  for (ll i = 0; i < n; i++) {
    if (x[i] == '1') {
      ll tmp = (pow2[n - 1] - (mod_pow(2, n - 1 - i, bit - 1))) % (bit - 1);
      ll ans = 1;
      if (tmp < 0) {
        tmp += (bit - 1);
      }
      // cout << "tmp" << tmp << endl;
      while (tmp != 0) {
        ans++;
        ll div = __builtin_popcount(tmp);
        // cout << "div" << div << endl;
        // cout << "tmp" << tmp << endl;
        tmp %= div;
      }
      cout << ans << endl;
    } else {
      ll tmp = (pow1[n - 1] + (mod_pow(2, n - 1 - i, bit + 1))) % (bit + 1);
      ll ans = 1;
      // cout << "tmp" << tmp << endl;
      while (tmp != 0) {
        ans++;
        ll div = __builtin_popcount(tmp);
        // cout << "div" << div << endl;
        // cout << "tmp" << tmp << endl;
        tmp %= div;
      }
      cout << ans << endl;
    }
  }
  return 0;
}