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

#include "bits/stdc++.h"
using namespace std;
#define PIGRECO 3.141592653589793

#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \\
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \\
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
  ~debug() { cerr << endl; }
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

#define int long long

int power(int x, unsigned int y, int mod) // binary exponentiation with modulo
{
  int res = 1;

  x = x % mod;

  if (y == 0 && mod > 1) {
    return 1;
  }

  if (x == 0)
    return 0;

  while (y > 0) {

    if (y & 1)
      res = (res * x) % mod;

    y = y >> 1;
    x = (x * x) % mod;
  }
  return res;
}

signed main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  int n;
  cin >> n;

  string s;
  cin >> s;

  int cnt = 0;

  for (int i = n - 1; i >= 0; i--) {
    if (s[i] == '1')
      cnt++;
  }

  if (n == 1) {

    if (s[0] == '1') {
      cout << 0 << endl;
    } else
      cout << 1 << endl;

    return 0;
  }

  long long val_piu = 0;
  long long val_meno = 0;

  reverse(s.begin(), s.end());

  for (int i = 0; i < n; i++) {
    if (s[i] == '1') {

      val_piu = val_piu + power(2, i, cnt + 1);

      if (cnt > 1)
        val_meno = val_meno + power(2, i, cnt - 1);
    }
  }

  long long temp;

  for (int i = n - 1; i >= 0; i--) {
    int ans = 1;
    temp = 0;

    if (s[i] == '1') {

      if (cnt > 1) {
        temp = (val_meno - (power(2, i, cnt - 1))) % (cnt - 1);
      }

      else {
        cout << 0 << endl;
        continue;
      }

    }

    else {

      temp = (val_piu + (power(2, i, cnt + 1))) % (cnt + 1);
    }

    while (temp) {
      temp = temp % (__builtin_popcountll(temp));
      ans++;
    }

    cout << ans << endl;
  }
}


Error: 0

Fixed submission:

#include "bits/stdc++.h"
using namespace std;
#define PIGRECO 3.141592653589793

#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \\
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \\
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
  ~debug() { cerr << endl; }
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

#define int long long

int power(int x, unsigned int y, int mod) // binary exponentiation with modulo
{
  int res = 1;

  x = x % mod;

  if (x == 0)
    return 0;

  while (y > 0) {

    if (y & 1)
      res = (res * x) % mod;

    y = y >> 1;
    x = (x * x) % mod;
  }
  return res;
}

signed main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  int n;
  cin >> n;

  string s;
  cin >> s;

  int cnt = 0;

  for (int i = n - 1; i >= 0; i--) {
    if (s[i] == '1')
      cnt++;
  }

  long long val_piu = 0;
  long long val_meno = 0;

  reverse(s.begin(), s.end());

  for (int i = 0; i < n; i++) {
    if (s[i] == '1') {

      val_piu = val_piu + power(2, i, cnt + 1);

      val_meno = val_meno + power(2, i, cnt - 1);
    }
  }

  long long temp;

  for (int i = n - 1; i >= 0; i--) {
    int ans = 1;

    if (s[i] == '1') {

      temp = (val_meno - (power(2, i, cnt - 1))) % (cnt - 1);

    }

    else {

      temp = (val_piu + (power(2, i, cnt + 1))) % (cnt + 1);
    }

    while (temp) {
      temp = temp % (__builtin_popcountll(temp));
      ans++;
    }

    cout << ans << endl;
  }
}