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

#include <bits/stdc++.h>
using namespace std;

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == n - 1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

// Debug
#define debug(...)                                                             \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                         \\
    for (auto &&X : {__VA_ARGS__})                                             \\
      cerr << "[" << X << "] ";                                                \\
    cerr << rt;                                                                \\
  }

#define dump(a, h, w)                                                          \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #a << " = [" << rt;                            \\
    rep(_i, h) {                                                               \\
      rep(_j, w) {                                                             \\
        if (abs(a[_i][_j]) >= INF / 2 and a[_i][_j] <= -INF / 2)               \\
          cerr << '-';                                                         \\
        if (abs(a[_i][_j]) >= INF / 2)                                         \\
          cerr << "∞" << sp;                                                   \\
        else                                                                   \\
          cerr << a[_i][_j] << sp;                                             \\
      }                                                                        \\
      cerr << rt;                                                              \\
    }                                                                          \\
    cerr << "]" << rt;                                                         \\
  }

#define vdump(a, n)                                                            \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #a << " = [";                                  \\
    rep(_i, n) {                                                               \\
      if (_i)                                                                  \\
        cerr << sp;                                                            \\
      if (abs(a[_i]) >= INF / 2 and a[_i] <= -INF / 2)                         \\
        cerr << '-';                                                           \\
      if (abs(a[_i]) >= INF / 2)                                               \\
        cerr << "∞" << sp;                                                     \\
      else                                                                     \\
        cerr << a[_i];                                                         \\
    }                                                                          \\
    cerr << "]" << rt;                                                         \\
  }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
  io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
  return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
  ll k = n % m;
  return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
  n %= m;
  return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
  ll r = 1;
  rep(i, 64) {
    if (n & (1LL << i))
      r *= a;
    chmod(r, m);
    a *= a;
    chmod(a, m);
  }
  return r;
}
inline ll inv(const ll n, const ll m = MOD) {
  ll a = n, b = m, x = 1, y = 0;
  while (b) {
    ll t = a / b;
    a -= t * b;
    swap(a, b);
    x -= t * y;
    swap(x, y);
  }
  return modulo(x, m);
}

signed main() {
  ll N;
  cin >> N;
  string S;
  cin >> S;
  ll cnt = count(all(S), '1');
  if (cnt == 0) {
    rep(i, N) cout << 1 << rt;
    return 0;
  }
  if (cnt == 1) {
    ll sum1 = 0;
    rep(i, N) {
      sum1 *= 2;
      if (S[i] == '1') {
        sum1++;
      }
      sum1 %= cnt + 1;
    }

    rep(i, N) {
      ll ct = 1;
      if (S[i] == '1') {
        ct = 0;
      } else {
        ll num = (sum1 + mpow(2, N - i - 1, cnt + 1)) % (cnt + 1);
        num += cnt + 1, num %= cnt + 1;
        while (num) {
          ll n = num, c = 0;
          while (n)
            c += n & 1, n >>= 1;
          num = num % c;
          ct++;
        }
      }
      cout << ct << rt;
    }
    return 0;
  }

  ll sum1 = 0, sum2 = 0;
  rep(i, N) {
    sum1 *= 2;
    sum2 *= 2;
    if (S[i] == '1') {
      sum1++;
      sum2++;
    }
    sum1 %= cnt + 1;
    sum2 %= cnt - 1;
  }

  rep(i, N) {
    ll ct = 1;
    if (S[i] == '1') {
      ll num = (sum2 - mpow(2, N - i - 1, cnt - 1)) % (cnt - 1);
      num += cnt - 1, num %= cnt - 1;
      while (num) {
        ll n = num, c = 0;
        while (n)
          c += n & 1, n >>= 1;
        num = num % c;
        ct++;
      }
    } else {
      ll num = (sum1 + mpow(2, N - i - 1, cnt + 1)) % (cnt + 1);
      num += cnt + 1, num %= cnt + 1;
      while (num) {
        ll n = num, c = 0;
        while (n)
          c += n & 1, n >>= 1;
        num = num % c;
        ct++;
      }
    }
    cout << ct << rt;
  }
}


Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == n - 1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

// Debug
#define debug(...)                                                             \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                         \\
    for (auto &&X : {__VA_ARGS__})                                             \\
      cerr << "[" << X << "] ";                                                \\
    cerr << rt;                                                                \\
  }

#define dump(a, h, w)                                                          \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #a << " = [" << rt;                            \\
    rep(_i, h) {                                                               \\
      rep(_j, w) {                                                             \\
        if (abs(a[_i][_j]) >= INF / 2 and a[_i][_j] <= -INF / 2)               \\
          cerr << '-';                                                         \\
        if (abs(a[_i][_j]) >= INF / 2)                                         \\
          cerr << "∞" << sp;                                                   \\
        else                                                                   \\
          cerr << a[_i][_j] << sp;                                             \\
      }                                                                        \\
      cerr << rt;                                                              \\
    }                                                                          \\
    cerr << "]" << rt;                                                         \\
  }

#define vdump(a, n)                                                            \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #a << " = [";                                  \\
    rep(_i, n) {                                                               \\
      if (_i)                                                                  \\
        cerr << sp;                                                            \\
      if (abs(a[_i]) >= INF / 2 and a[_i] <= -INF / 2)                         \\
        cerr << '-';                                                           \\
      if (abs(a[_i]) >= INF / 2)                                               \\
        cerr << "∞" << sp;                                                     \\
      else                                                                     \\
        cerr << a[_i];                                                         \\
    }                                                                          \\
    cerr << "]" << rt;                                                         \\
  }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
  io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
  return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
  ll k = n % m;
  return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
  n %= m;
  return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
  ll r = 1;
  rep(i, 64) {
    if (n & (1LL << i))
      r *= a;
    chmod(r, m);
    a *= a;
    chmod(a, m);
  }
  return r;
}
inline ll inv(const ll n, const ll m = MOD) {
  ll a = n, b = m, x = 1, y = 0;
  while (b) {
    ll t = a / b;
    a -= t * b;
    swap(a, b);
    x -= t * y;
    swap(x, y);
  }
  return modulo(x, m);
}

signed main() {
  ll N;
  cin >> N;
  string S;
  cin >> S;
  ll cnt = count(all(S), '1');
  if (cnt == 1 or cnt == 0) {
    rep(i, N) cout << cnt + (S[i] == '1') << rt;
  }

  ll sum1 = 0, sum2 = 0;
  rep(i, N) {
    sum1 *= 2;
    sum2 *= 2;
    if (S[i] == '1') {
      sum1++;
      sum2++;
    }
    sum1 %= cnt + 1;
    sum2 %= cnt - 1;
  }

  rep(i, N) {
    ll ct = 1;
    if (S[i] == '1') {
      ll num = (sum2 - mpow(2, N - i - 1, cnt - 1) + cnt - 1) % (cnt - 1);
      while (num) {
        ll n = num, c = 0;
        while (n)
          c += n & 1, n >>= 1;
        num = num % c;
        ct++;
      }
    } else {
      ll num = (sum1 + mpow(2, N - i - 1, cnt + 1) + cnt + 1) % (cnt + 1);
      while (num) {
        ll n = num, c = 0;
        while (n)
          c += n & 1, n >>= 1;
        num = num % c;
        ct++;
      }
    }
    cout << ct << rt;
  }
}