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

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VS = vector<string>;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair<int, int>;
using VPII = vector<pair<int, int>>;
template <typename T = int> using VT = vector<T>;
template <typename T = int> using VVT = vector<vector<T>>;
template <typename T = int> using LIM = numeric_limits<T>;
template <typename T = int> using OSI = ostream_iterator<T>;

template <typename T> inline istream &operator>>(istream &s, vector<T> &v) {
  for (T &t : v) {
    s >> t;
  }
  return s;
}
template <typename T>
inline ostream &operator<<(ostream &s, const vector<T> &v) {
  for (int i = 0; i < int(v.size()); ++i) {
    s << (" " + !i) << v[i];
  }
  return s;
}

void in_impl(){};
template <typename T, typename... TS> void in_impl(T &head, TS &...tail) {
  cin >> head;
  in_impl(tail...);
}
#define IN(T, ...)                                                             \\
  T __VA_ARGS__;                                                               \\
  in_impl(__VA_ARGS__);

template <typename T> inline T fromString(const string &s) {
  T res;
  istringstream iss(s);
  iss >> res;
  return res;
}
template <typename T> inline string toString(const T &a) {
  ostringstream oss;
  oss << a;
  return oss.str();
}

#define NUMBERED(name, number) NUMBERED2(name, number)
#define NUMBERED2(name, number) name##_##number
#define REP1(n) REP2(NUMBERED(REP_COUNTER, __LINE__), n)
#define REP2(i, n) REP3(i, 0, n)
#define REP3(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define GET_REP(a, b, c, F, ...) F
#define REP(...) GET_REP(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)
#define FOR(e, c) for (auto &&e : c)
#define ALL(c) begin(c), end(c)
#define AALL(a)                                                                \\
  (remove_all_extents<decltype(a)>::type *)a,                                  \\
      (remove_all_extents<decltype(a)>::type *)a +                             \\
          sizeof(a) / sizeof(remove_all_extents<decltype(a)>::type)

#define SZ(v) ((int)(v).size())
#define EXISTS(c, e) ((c).find(e) != (c).end())

template <typename T> inline bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP(x) cerr << #x << " = " << (x) << endl

//     Λ   Λ＿_
//  ／(*ﾟーﾟ)／＼
// ／| ￣U U￣|＼／
//   |      |／

// a^x を mod で求める
// 反復二乗法
// O( log x )
long long mod_pow(long long a, long long x, long long mod) {
  a %= mod;

  long long res = 1;
  for (; x; x >>= 1, (a *= a) %= mod) {
    if (x & 1) {
      (res *= a) %= mod;
    }
  }
  return res;
}

int solve(int n) {
  int res = 1;
  for (; n; n %= __builtin_popcount(n)) {
    ++res;
  }
  return res;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(12) << fixed;

  IN(int, N);
  IN(string, S);

  const int popcount = count(ALL(S), '1');

  if (popcount == 0) {
    REP(N) { cout << 1 << '\\n'; }
    cout << flush;
    return 0;
  }

  const int mod_m = 1 < popcount ? popcount - 1 : 1;
  const int mod_p = popcount + 1;

  VT<LL> rest_m(N + 1), rest_p(N + 1);
  for (LL i = 0; i < N; ++i) {
    const int D = S[N - 1 - i] - '0';
    rest_m[N - 1 - i] = (rest_m[N - i] + D * mod_pow(2, i, mod_m)) % mod_m;
    rest_p[N - 1 - i] = (rest_p[N - i] + D * mod_pow(2, i, mod_p)) % mod_p;
  }

  LL a = 0, b = 0;
  REP(i, N) {
    const int D = S[i] - '0';

    if (D) {
      if (popcount == 1) {
        cout << 0 << '\\n';
      } else {
        cout << solve((a * mod_pow(2, N - i, mod_m) % mod_m + rest_m[i + 1]) %
                      mod_m)
             << '\\n';
      }
    } else {
      cout << solve((b * mod_pow(2, N - i, mod_p) % mod_p +
                     mod_pow(2, N - 1 - i, mod_p) + rest_p[i + 1]) %
                    mod_p)
           << '\\n';
    }

    (a *= 2) %= mod_m;
    (a += D) %= mod_m;
    (b *= 2) %= mod_p;
    (b += D) %= mod_p;
  }
  cout << flush;

  return 0;
}

Error: 0

Fixed submission:

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VS = vector<string>;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair<int, int>;
using VPII = vector<pair<int, int>>;
template <typename T = int> using VT = vector<T>;
template <typename T = int> using VVT = vector<vector<T>>;
template <typename T = int> using LIM = numeric_limits<T>;
template <typename T = int> using OSI = ostream_iterator<T>;

template <typename T> inline istream &operator>>(istream &s, vector<T> &v) {
  for (T &t : v) {
    s >> t;
  }
  return s;
}
template <typename T>
inline ostream &operator<<(ostream &s, const vector<T> &v) {
  for (int i = 0; i < int(v.size()); ++i) {
    s << (" " + !i) << v[i];
  }
  return s;
}

void in_impl(){};
template <typename T, typename... TS> void in_impl(T &head, TS &...tail) {
  cin >> head;
  in_impl(tail...);
}
#define IN(T, ...)                                                             \\
  T __VA_ARGS__;                                                               \\
  in_impl(__VA_ARGS__);

template <typename T> inline T fromString(const string &s) {
  T res;
  istringstream iss(s);
  iss >> res;
  return res;
}
template <typename T> inline string toString(const T &a) {
  ostringstream oss;
  oss << a;
  return oss.str();
}

#define NUMBERED(name, number) NUMBERED2(name, number)
#define NUMBERED2(name, number) name##_##number
#define REP1(n) REP2(NUMBERED(REP_COUNTER, __LINE__), n)
#define REP2(i, n) REP3(i, 0, n)
#define REP3(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define GET_REP(a, b, c, F, ...) F
#define REP(...) GET_REP(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)
#define FOR(e, c) for (auto &&e : c)
#define ALL(c) begin(c), end(c)
#define AALL(a)                                                                \\
  (remove_all_extents<decltype(a)>::type *)a,                                  \\
      (remove_all_extents<decltype(a)>::type *)a +                             \\
          sizeof(a) / sizeof(remove_all_extents<decltype(a)>::type)

#define SZ(v) ((int)(v).size())
#define EXISTS(c, e) ((c).find(e) != (c).end())

template <typename T> inline bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP(x) cerr << #x << " = " << (x) << endl

//     Λ   Λ＿_
//  ／(*ﾟーﾟ)／＼
// ／| ￣U U￣|＼／
//   |      |／

// a^x を mod で求める
// 反復二乗法
// O( log x )
long long mod_pow(long long a, long long x, long long mod) {
  a %= mod;

  long long res = 1;
  for (; x; x >>= 1, (a *= a) %= mod) {
    if (x & 1) {
      (res *= a) %= mod;
    }
  }
  return res;
}

int solve(int n) {
  int res = 1;
  for (; n; n %= __builtin_popcount(n)) {
    ++res;
  }
  return res;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(12) << fixed;

  IN(int, N);
  IN(string, S);

  const int popcount = count(ALL(S), '1');

  if (popcount == 0) {
    REP(N) { cout << 1 << '\\n'; }
    cout << flush;
    return 0;
  }

  const int mod_m = popcount - 1;
  const int mod_p = popcount + 1;

  VT<LL> rest_m(N + 1), rest_p(N + 1);
  for (LL i = 0; i < N; ++i) {
    const int D = S[N - 1 - i] - '0';
    rest_m[N - 1 - i] = (rest_m[N - i] + D * mod_pow(2, i, mod_m)) % mod_m;
    rest_p[N - 1 - i] = (rest_p[N - i] + D * mod_pow(2, i, mod_p)) % mod_p;
  }

  LL a = 0, b = 0;
  REP(i, N) {
    const int D = S[i] - '0';

    if (D) {
      cout << solve((a * mod_pow(2, N - i, mod_m) % mod_m + rest_m[i + 1]) %
                    mod_m)
           << '\\n';
    } else {
      cout << solve((b * mod_pow(2, N - i, mod_p) % mod_p +
                     mod_pow(2, N - 1 - i, mod_p) + rest_p[i + 1]) %
                    mod_p)
           << '\\n';
    }

    (a *= 2) %= mod_m;
    (a += D) %= mod_m;
    (b *= 2) %= mod_p;
    (b += D) %= mod_p;
  }
  cout << flush;

  return 0;
}