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

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <typename T, typename U> T pow_(T a, U b) {
  return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
ll modpow(ll a, ll b, ll _mod) {
  return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.F << " " << p.S;
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  rep(i, sz(vec)) {
    if (i)
      os << " ";
    os << vec[i];
  }
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &s) {
  for (auto e : s)
    os << e;
  return os;
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &v) {
  rep(j, sz(v)) is >> v[j];
  return is;
}
template <class T, class T2> inline void add(T &a, T2 b) {
  (a += b % mod) %= mod;
  if (a < 0)
    a += mod;
}
template <class T> void operator+=(vector<T> &v, vector<T> v2) {
  rep(i, sz(v2)) v.eb(v2[i]);
}

void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(12); // debuged
  int T;
  T = 1;
  while (T--)
    solve();
}

void solve() {
  int n;
  cin >> n;
  string s;
  cin >> s;

  int cnt = 0;
  rep(i, n) if (s[i] == '1') cnt++;
  // cerr << "cnt " << cnt << endl;
  if (cnt == 1) {
    rep(i, n) {
      if (s[i] == '1') {
        cout << 0 << endl;
        continue;
      }
      if (s[i] == '0')
        s[i] = '1';
      else
        s[i] = '0';

      if (s[n - 1] == '0')
        cout << 1 << endl;
      else
        cout << 2 << endl;

      if (s[i] == '0')
        s[i] = '1';
      else
        s[i] = '0';
    }
    return;
  }

  vector<int> t(2);
  for (int i = n - 1; i >= 0; --i) {
    if (s[i] == '1')
      (t[0] += modpow(2, n - 1 - i, cnt - 1)) %= (cnt - 1);
  }
  for (int i = n - 1; i >= 0; --i) {
    if (s[i] == '1')
      (t[1] += modpow(2, n - 1 - i, cnt + 1)) %= (cnt + 1);
  }
  // cerr << "t " << t[0] << " " << t[1] << endl;

  rep(i, n) {
    int x;
    if (s[i] == '1') {
      x = t[0];
      x = x - modpow(2, n - 1 - i, cnt - 1);
      (x += cnt - 1) %= (cnt - 1);
    } else {
      x = t[1];
      x = x + modpow(2, n - 1 - i, cnt + 1);
      (x += cnt + 1) %= (cnt + 1);
    }
    int ans = 1;
    while (x) {
      x = x % __builtin_popcount(x);
      ans++;
    }
    cout << ans << endl;
  }
}


Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <typename T, typename U> T pow_(T a, U b) {
  return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
ll modpow(ll a, ll b, ll _mod) {
  return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.F << " " << p.S;
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  rep(i, sz(vec)) {
    if (i)
      os << " ";
    os << vec[i];
  }
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &s) {
  for (auto e : s)
    os << e;
  return os;
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &v) {
  rep(j, sz(v)) is >> v[j];
  return is;
}
template <class T, class T2> inline void add(T &a, T2 b) {
  (a += b % mod) %= mod;
  if (a < 0)
    a += mod;
}
template <class T> void operator+=(vector<T> &v, vector<T> v2) {
  rep(i, sz(v2)) v.eb(v2[i]);
}

void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(12); // debuged
  int T;
  T = 1;
  while (T--)
    solve();
}

void solve() {
  int n;
  cin >> n;
  string s;
  cin >> s;

  int cnt = 0;
  rep(i, n) if (s[i] == '1') cnt++;
  // cerr << "cnt " << cnt << endl;

  vector<int> t(2);
  for (int i = n - 1; i >= 0; --i) {
    if (s[i] == '1')
      (t[0] += modpow(2, n - 1 - i, cnt - 1)) %= (cnt - 1);
  }
  for (int i = n - 1; i >= 0; --i) {
    if (s[i] == '1')
      (t[1] += modpow(2, n - 1 - i, cnt + 1)) %= (cnt + 1);
  }
  // cerr << "t " << t[0] << " " << t[1] << endl;

  rep(i, n) {
    int x;
    if (s[i] == '1') {
      x = t[0];
      x = x - modpow(2, n - 1 - i, cnt - 1);
      (x += cnt - 1) %= (cnt - 1);
    } else {
      x = t[1];
      x = x + modpow(2, n - 1 - i, cnt + 1);
      (x += cnt + 1) %= (cnt + 1);
    }
    // cerr << i << " " << x << endl;
    if (x == 0 && cnt == 1 && s[i] == '1') {
      cout << 0 << endl;
      continue;
    }
    int ans = 1;
    while (x) {
      x = x % __builtin_popcount(x);
      ans++;
    }
    cout << ans << endl;
  }
}