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

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template <typename T> using V = vector<T>;
template <typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, a, n) for (ll i = a; i < (ll)(n); ++i)
#define repr(i, a, n) for (ll i = n - 1; (ll)a <= i; --i)
#define ENDL '\\n'
typedef pair<int, int> Pi;
typedef pair<ll, ll> PL;
constexpr ll mod = 1000000007;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 + 99);
const vector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};
template <typename T, typename U> inline bool chmin(T &t, const U &u) {
  if (t > u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T, typename U> inline bool chmax(T &t, const U &u) {
  if (t < u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

template <typename T, typename Y> inline T mpow(T a, Y n) {
  T res = 1;
  for (; n; n >>= 1) {
    if (n & 1)
      res = res * a;
    a = a * a;
  }
  return res;
}

template <typename T, typename Y>
ostream &operator<<(ostream &os, const pair<T, Y> &p) {
  return os << "{" << p.fs << "," << p.sc << "}";
}
template <typename T> ostream &operator<<(ostream &os, const V<T> &v) {
  os << "{";
  for (auto e : v)
    os << e << ",";
  return os << "}";
}
template <typename... Args> void debug(Args &...args) {
  for (auto const &x : {args...}) {
    cerr << x << ' ';
  }
  cerr << ENDL;
}

long long modpow(long long a, long long n, long long MOD) { // a^n(MOD)を求める
  long long res = 1 % MOD;
  while (n > 0) {
    if (n & 1)
      res = res * a % MOD;
    a = a * a % MOD; // 次の準備
    n >>= 1;
  }
  return res;
}

signed main() {
  cin.tie(0);
  cerr.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll n, scnt = 0;
  cin >> n;
  string s;
  cin >> s;
  rep(i, 0, n) {
    if (s[i] == '1')
      ++scnt;
  }

  ll plsn = 0, mnsn = 0;
  rep(i, 0, n) {
    plsn <<= 1ll;
    if (scnt > 1)
      mnsn <<= 1ll;
    if (s[i] == '1') {
      plsn++;
      if (scnt > 1)
        mnsn++;
    }

    plsn %= scnt + 1;
    if (scnt > 1)
      mnsn %= scnt - 1;
  }

  ll ans = 1, now;
  rep(i, 0, n) {
    ans = 1;

    if (s[i] == '1') {
      if (scnt == 1) {
        cout << 0 << ENDL;
        continue;
      }

      now = mnsn;
      now += scnt - 1 - (modpow(2, n - 1 - i, scnt - 1));
      now %= scnt - 1;
    } else {
      now = plsn;
      now += (modpow(2, n - 1 - i, scnt + 1));
      now %= scnt + 1;
    }

    while (now > 0) {
      now = now % __builtin_popcountll(now);
      ++ans;
    }
    cout << ans << ENDL;
  }
}
//! ( . _ . ) !
// CHECK overflow,vector_size,what to output?

Error: 0

Fixed submission:

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template <typename T> using V = vector<T>;
template <typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, a, n) for (ll i = a; i < (ll)(n); ++i)
#define repr(i, a, n) for (ll i = n - 1; (ll)a <= i; --i)
#define ENDL '\\n'
typedef pair<int, int> Pi;
typedef pair<ll, ll> PL;
constexpr ll mod = 1000000007;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 + 99);
const vector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};
template <typename T, typename U> inline bool chmin(T &t, const U &u) {
  if (t > u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T, typename U> inline bool chmax(T &t, const U &u) {
  if (t < u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

template <typename T, typename Y> inline T mpow(T a, Y n) {
  T res = 1;
  for (; n; n >>= 1) {
    if (n & 1)
      res = res * a;
    a = a * a;
  }
  return res;
}

template <typename T, typename Y>
ostream &operator<<(ostream &os, const pair<T, Y> &p) {
  return os << "{" << p.fs << "," << p.sc << "}";
}
template <typename T> ostream &operator<<(ostream &os, const V<T> &v) {
  os << "{";
  for (auto e : v)
    os << e << ",";
  return os << "}";
}
template <typename... Args> void debug(Args &...args) {
  for (auto const &x : {args...}) {
    cerr << x << ' ';
  }
  cerr << ENDL;
}

long long modpow(long long a, long long n, long long MOD) { // a^n(MOD)を求める
  long long res = 1 % MOD;
  while (n > 0) {
    if (n & 1)
      res = res * a % MOD;
    a = a * a % MOD; // 次の準備
    n >>= 1;
  }
  return res;
}

signed main() {
  cin.tie(0);
  cerr.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll n, scnt = 0;
  cin >> n;
  string s;
  cin >> s;
  rep(i, 0, n) {
    if (s[i] == '1')
      ++scnt;
  }

  ll plsn = 0, mnsn = 0;
  rep(i, 0, n) {
    plsn <<= 1ll;
    mnsn <<= 1ll;
    if (s[i] == '1') {
      plsn++;
      mnsn++;
    }

    plsn %= scnt + 1;
    mnsn %= scnt - 1;
  }

  ll ans = 1, now;
  rep(i, 0, n) {
    ans = 1;

    if (s[i] == '1') {
      now = mnsn;
      now += scnt - 1 - (modpow(2, n - 1 - i, scnt - 1));
      now %= scnt - 1;
    } else {
      now = plsn;
      now += (modpow(2, n - 1 - i, scnt + 1));
      now %= scnt + 1;
    }

    while (now > 0) {
      now = now % __builtin_popcountll(now);
      ++ans;
    }
    cout << ans << ENDL;
  }
}
//! ( . _ . ) !
// CHECK overflow,vector_size,what to output?