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

#define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (lint)(n); i++)
#define REP(i, n) for (int i = 1; i <= (lint)(n); i++)
#define all(V) V.begin(), V.end()
#define stackReplaceBegin(size)                                                \\
  void *p = malloc(size);                                                      \\
  esp_new = (lint)p + size - 1;                                                \\
  void *stack_extend_memory_ = malloc(size);                                   \\
  void *stack_extend_origin_memory_;                                           \\
  char *stack_extend_dummy_memory_ = (char *)alloca(                           \\
      (1 + (int)(((long long)stack_extend_memory_) & 127)) * 16);              \\
  *stack_extend_dummy_memory_ = 0;                                             \\
  asm volatile("mov %%rsp, %%rbx\\nmov %%rax, %%rsp"                            \\
               : "=b"(stack_extend_origin_memory_)                             \\
               : "a"((char *)stack_extend_memory_ + (size)-1024));
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
lint esp_new;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
inline lint gcd(lint a, lint b) {
  while (b) {
    lint c = a;
    a = b;
    b = c % b;
  }
  return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
  if (n == 1)
    return false;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0)
      return false;
  }
  return true;
}
template <typename T> T mypow(T a, unsigned int b) {
  T res(1), now(a);
  while (b) {
    if (b & 1)
      res *= now;
    b >>= 1;
    now *= a;
  }
  return res;
}
lint modpow(lint a, unsigned int b, unsigned int mod) {
  lint res(1), now(a % mod);
  while (b) {
    if (b & 1) {
      res *= now;
      res %= mod;
    }
    b >>= 1;
    now *= now;
    now %= mod;
  }
  return res;
}
template <typename T> void printArray(std::vector<T> &vec) {
  rep(i, (int)vec.size() - 1) std::cout << vec[i] << " ";
  if (!vec.empty())
    std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
  T rprev = r;
  rprev--;
  for (T i = l; i != rprev; i++) {
    std::cout << *i << " ";
  }
  std::cout << *rprev << std::endl;
}
lint n;
std::string x;
int main() {
  std::cin >> n >> x;
  std::reverse(all(x));
  lint cnt = 0;
  rep(i, n) if (x[i] == '1') cnt++;
  if (cnt == 0) {
    rep(i, n) std::cout << 1 << std::endl;
    return 0;
  }
  if (cnt == 1) {
    for (int i = n - 1; i >= 0; i--) {
      if (x[i] == '1')
        std::cout << 0 << std::endl;
      else {
        if (i == 0 || x[0] == '1')
          std::cout << 2 << std::endl;
        else
          std::cout << 1 << std::endl;
      }
    }
    return 0;
  }
  lint a = 0, b = 0;
  rep(i, n) {
    if (x[i] == '1') {
      a += modpow(2, i, cnt - 1);
      a %= cnt - 1;
      if (cnt != n) {
        b += modpow(2, i, cnt + 1);
        b %= cnt + 1;
      }
    }
  }
  std::vector<lint> res;
  rep(i, n) {
    lint nx;
    lint ans = 1;
    if (x[i] == '1')
      nx = (a - modpow(2, i, cnt - 1) + cnt - 1) % (cnt - 1);
    else
      nx = (b + modpow(2, i, cnt + 1)) % (cnt + 1);
    while (nx) {
      lint m = nx, p = 0;
      while (m) {
        p += m & 1;
        m >>= 1;
      }
      nx %= p;
      ans++;
    }
    res.emplace_back(ans);
  }
  std::reverse(all(res));
  for (lint i : res)
    std::cout << i << std::endl;
  return 0;
}

Error: 0

Fixed submission:

#define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (lint)(n); i++)
#define REP(i, n) for (int i = 1; i <= (lint)(n); i++)
#define all(V) V.begin(), V.end()
#define stackReplaceBegin(size)                                                \\
  void *p = malloc(size);                                                      \\
  esp_new = (lint)p + size - 1;                                                \\
  void *stack_extend_memory_ = malloc(size);                                   \\
  void *stack_extend_origin_memory_;                                           \\
  char *stack_extend_dummy_memory_ = (char *)alloca(                           \\
      (1 + (int)(((long long)stack_extend_memory_) & 127)) * 16);              \\
  *stack_extend_dummy_memory_ = 0;                                             \\
  asm volatile("mov %%rsp, %%rbx\\nmov %%rax, %%rsp"                            \\
               : "=b"(stack_extend_origin_memory_)                             \\
               : "a"((char *)stack_extend_memory_ + (size)-1024));
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
lint esp_new;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
inline lint gcd(lint a, lint b) {
  while (b) {
    lint c = a;
    a = b;
    b = c % b;
  }
  return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
  if (n == 1)
    return false;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0)
      return false;
  }
  return true;
}
template <typename T> T mypow(T a, unsigned int b) {
  T res(1), now(a);
  while (b) {
    if (b & 1)
      res *= now;
    b >>= 1;
    now *= now;
  }
  return res;
}
lint modpow(lint a, unsigned int b, unsigned int mod) {
  lint res(1), now(a);
  while (b) {
    if (b & 1) {
      res *= now;
      res %= mod;
    }
    b >>= 1;
    now *= now;
    now %= mod;
  }
  return res;
}
template <typename T> void printArray(std::vector<T> &vec) {
  rep(i, (int)vec.size() - 1) std::cout << vec[i] << " ";
  if (!vec.empty())
    std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
  T rprev = r;
  rprev--;
  for (T i = l; i != rprev; i++) {
    std::cout << *i << " ";
  }
  std::cout << *rprev << std::endl;
}
lint n;
std::string x;
int main() {
  std::cin >> n >> x;
  std::reverse(all(x));
  lint cnt = 0;
  rep(i, n) if (x[i] == '1') cnt++;
  lint a = 0, b = 0;
  rep(i, n) {
    if (x[i] == '1') {
      if (cnt) {
        a += modpow(2, i, cnt - 1);
        a %= cnt - 1;
      }
      if (cnt != n) {
        b += modpow(2, i, cnt + 1);
        b %= cnt + 1;
      }
    }
  }
  std::vector<lint> res;
  rep(i, n) {
    lint nx;
    lint ans = 1;
    if (x[i] == '1')
      nx = (a - modpow(2, i, cnt - 1) + cnt - 1) % (cnt - 1);
    else
      nx = (b + modpow(2, i, cnt + 1)) % (cnt + 1);
    while (nx) {
      lint m = nx, p = 0;
      while (m) {
        p += m & 1;
        m >>= 1;
      }
      nx %= p;
      ans++;
    }
    res.emplace_back(ans);
  }
  std::reverse(all(res));
  for (lint i : res)
    std::cout << i << std::endl;
  return 0;
}