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

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define vi vector<int>
#define vvi vector<vector<int>>
#define pi pair<int, int>
#define ALL(a) (a).begin(), (a).end()
#define BIT(n) (1LL << (n))
#define UNIQUE(v)                                                              \\
  v.erase(unique(v.begin(), v.end()), v.end()) // sortしてからつかうこと
constexpr ll MOD = 1e9 + 7;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;

template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}

class Fp {
public:
  ll val;
  static ll mod;

  Fp() { val = 0; }
  Fp(ll v) : val(v % mod) {
    if (val < 0)
      val += mod;
  }
  Fp operator+=(const Fp &in) {
    val += in.val;
    calc_mod(val);
    return *this;
  }
  Fp operator+(const Fp &in) const { return Fp(*this) += in; }
  Fp &operator-=(const Fp &in) {
    val -= in.val;
    calc_mod(val);
    if (val < 0)
      val += mod;
    return *this;
  }
  Fp operator-(const Fp &in) const { return Fp(*this) -= in; }
  Fp &operator*=(const Fp &in) {
    val = val * in.val % mod;
    return *this;
  }
  Fp operator*(const Fp &in) const { return Fp(*this) *= in; }
  Fp &operator/=(const Fp &in) {
    *this *= in.modpow(mod - 2);
    return *this;
  }
  Fp operator/(const Fp &in) const { return Fp(*this) /= in; }
  bool operator==(const Fp &in) const { return val == in.val; }
  bool operator!=(const Fp &in) const { return val != in.val; }
  Fp modpow(ll n) const {
    if (n == 0)
      return 1;
    if (n & 1) {
      return (*this) * ((*this) * (*this)).modpow(n / 2);
    } else {
      return ((*this) * (*this)).modpow(n / 2);
    }
  }
  friend istream &operator>>(istream &is, Fp &fp) {
    is >> fp.val;
    return is;
  }
  friend ostream &operator<<(ostream &os, Fp &fp) {
    os << fp.val;
    return os;
  }
  friend ostream &operator<<(ostream &os, Fp &&fp) {
    os << fp.val;
    return os;
  }

private:
  void calc_mod(ll &v) {
    if (v >= mod)
      v -= mod;
  }
};

Fp modpow(const Fp &in, const ll n) { return in.modpow(n); }
Fp modpow(const ll a, const ll n) { return Fp(a).modpow(n); }

using mint = Fp;
ll mint::mod = MOD;

class Factorial {
public:
  vector<mint> fact, finv;
  Factorial(ll n) : fact(n + 1, mint(1)), finv(n + 1, mint(1)) {
    for (int i = 2; i <= n; i++) {
      mint tmp(i);
      fact[i] = fact[i - 1] * tmp;
      finv[i] = finv[i - 1] / tmp;
    }
  }
  mint perm(const ll &n, const ll &k) { return fact[n] * finv[n - k]; }
  mint com(const ll &n, const ll &k) {
    if (n < k || n < 0 || k < 0)
      return mint(0);
    return fact[n] * finv[k] * finv[n - k];
  }
};

ll intpow(const int &a, const int &n) {
  if (n == 0)
    return 1;
  else if (n & 1)
    return intpow(a * a, n / 2) * a;
  else
    return intpow(a * a, n / 2);
}

signed main() {
  cin >> N;
  cin >> S;
  int bitN = 0;
  REP(i, N) {
    if (S[i] == '1') {
      bitN++;
    }
  }
  int a[2] = {0};
  if (bitN - 1 > 0) {
    mint::mod = bitN - 1;
    mint x = 0;
    REP(i, N) {
      if (S[i] == '1') {
        x += modpow(2, N - i - 1);
      }
    }
    a[0] = x.val;
  }
  mint::mod = bitN + 1;
  mint x = 0;
  REP(i, N) {
    if (S[i] == '1') {
      x += modpow(2, N - i - 1);
    }
  }
  a[1] = x.val;

  REP(i, N) {
    if (S[i] == '1') {
      if (bitN == 1) {
        cout << 0 << endl;
        continue;
      }
      int res = 1;
      mint::mod = bitN - 1;
      mint ans = a[0];
      ans -= modpow(2, N - 1 - i);
      int x = ans.val;
      while (x > 0) {
        x %= __builtin_popcount(x);
        res++;
      }
      cout << res << endl;
    } else {
      int res = 1;
      mint::mod = bitN + 1;
      mint ans = a[1];
      ans += modpow(2, N - 1 - i);
      int x = ans.val;
      while (x > 0) {
        x %= __builtin_popcount(x);
        res++;
      }
      cout << res << endl;
    }
  }
}

Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define vi vector<int>
#define vvi vector<vector<int>>
#define pi pair<int, int>
#define ALL(a) (a).begin(), (a).end()
#define BIT(n) (1LL << (n))
#define UNIQUE(v)                                                              \\
  v.erase(unique(v.begin(), v.end()), v.end()) // sortしてからつかうこと
constexpr ll MOD = 1e9 + 7;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;

template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}

class Fp {
public:
  ll val;
  static ll mod;

  Fp() { val = 0; }
  Fp(ll v) : val(v % mod) {
    if (val < 0)
      val += mod;
  }
  Fp operator+=(const Fp &in) {
    val += in.val;
    calc_mod(val);
    return *this;
  }
  Fp operator+(const Fp &in) const { return Fp(*this) += in; }
  Fp &operator-=(const Fp &in) {
    val -= in.val;
    calc_mod(val);
    if (val < 0)
      val += mod;
    return *this;
  }
  Fp operator-(const Fp &in) const { return Fp(*this) -= in; }
  Fp &operator*=(const Fp &in) {
    val = val * in.val % mod;
    return *this;
  }
  Fp operator*(const Fp &in) const { return Fp(*this) *= in; }
  Fp &operator/=(const Fp &in) {
    *this *= in.modpow(mod - 2);
    return *this;
  }
  Fp operator/(const Fp &in) const { return Fp(*this) /= in; }
  bool operator==(const Fp &in) const { return val == in.val; }
  bool operator!=(const Fp &in) const { return val != in.val; }
  Fp modpow(ll n) const {
    if (n == 0)
      return 1;
    if (n & 1) {
      return (*this) * ((*this) * (*this)).modpow(n / 2);
    } else {
      return ((*this) * (*this)).modpow(n / 2);
    }
  }
  friend istream &operator>>(istream &is, Fp &fp) {
    is >> fp.val;
    return is;
  }
  friend ostream &operator<<(ostream &os, Fp &fp) {
    os << fp.val;
    return os;
  }
  friend ostream &operator<<(ostream &os, Fp &&fp) {
    os << fp.val;
    return os;
  }

private:
  void calc_mod(ll &v) {
    if (v >= mod)
      v -= mod;
  }
};

Fp modpow(const Fp &in, const ll n) { return in.modpow(n); }
Fp modpow(const ll a, const ll n) { return Fp(a).modpow(n); }

using mint = Fp;
ll mint::mod = MOD;

class Factorial {
public:
  vector<mint> fact, finv;
  Factorial(ll n) : fact(n + 1, mint(1)), finv(n + 1, mint(1)) {
    for (int i = 2; i <= n; i++) {
      mint tmp(i);
      fact[i] = fact[i - 1] * tmp;
      finv[i] = finv[i - 1] / tmp;
    }
  }
  mint perm(const ll &n, const ll &k) { return fact[n] * finv[n - k]; }
  mint com(const ll &n, const ll &k) {
    if (n < k || n < 0 || k < 0)
      return mint(0);
    return fact[n] * finv[k] * finv[n - k];
  }
};

ll intpow(const int &a, const int &n) {
  if (n == 0)
    return 1;
  else if (n & 1)
    return intpow(a * a, n / 2) * a;
  else
    return intpow(a * a, n / 2);
}

signed main() {
  cin >> N;
  cin >> S;
  int bitN = 0;
  REP(i, N) {
    if (S[i] == '1') {
      bitN++;
    }
  }
  int a[2] = {0};
  if (bitN - 1 > 0) {
    mint::mod = bitN - 1;
    mint x = 0;
    int hoge = 0;
    REP(i, N) {
      if (S[i] == '1') {
        x += modpow(2, N - i - 1);
      }
    }
    a[0] = x.val;
  }
  mint::mod = bitN + 1;
  mint x = 0;
  REP(i, N) {
    if (S[i] == '1') {
      x += modpow(2, N - i - 1);
    }
  }
  a[1] = x.val;

  REP(i, N) {
    if (S[i] == '1') {
      int res = 1;
      mint::mod = bitN - 1;
      mint ans = a[0];
      ans -= modpow(2, N - 1 - i);
      int x = ans.val;
      while (x > 0) {
        x %= __builtin_popcount(x);
        res++;
      }
      cout << res << endl;
    } else {
      int res = 1;
      mint::mod = bitN + 1;
      mint ans = a[1];
      ans += modpow(2, N - 1 - i);
      int x = ans.val;
      while (x > 0) {
        x %= __builtin_popcount(x);
        res++;
      }
      cout << res << endl;
    }
  }
}