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

/*
これを入れて実行
g++ code.cpp
./a.out
 */

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>

#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;
typedef long long ll;
typedef long double ld;

int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;

bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
  return f.second > s.second;
}

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; }

ll conbinationMemo[100][100];

void cmemoInit() {
  rep(i, 100) {
    rep(j, 100) { conbinationMemo[i][j] = -1; }
  }
}

ll nCr(ll n, ll r) {
  if (conbinationMemo[n][r] != -1)
    return conbinationMemo[n][r];
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}

ll nPr(ll n, ll r) {
  r = n - r;
  ll ret = 1;
  for (ll i = n; i >= r + 1; i--)
    ret *= i;
  return ret;
}
//-----------------------ここから-----------
ll m;
ll modpow(ll a, ll b) {
  ll res = 1;
  while (b > 0) {
    if (b & 1) {
      res *= a;
      res %= m;
    }
    a *= a;
    a %= m;
    b >>= 1;
  }
  return res;
}
int main(void) {
  ll n;
  cin >> n;
  string s;
  cin >> s;

  reverse(all(s));

  ll originalPop = 0;
  rep(i, n) {
    if (s[i] == '1') {
      originalPop++;
    }
  }
  m = originalPop;

  ll totalp = 0;
  ll totalm = 0;
  m = originalPop + 1;
  for (ll i = 0; i < n; i++) {
    if (s[i] == '1') {
      totalp += modpow(2LL, i);
      totalp %= m;
    }
  }
  m = originalPop - 1;
  bool f = false;
  if (m == 0) {
    f = true;
  } else {
    for (ll i = 0; i < n; i++) {
      if (s[i] == '1') {
        totalm += modpow(2LL, i);
        totalm %= m;
      }
    }
  }

  vector<ll> ans;
  for (ll i = 0; i < n; i++) {
    ll now;
    if (s[i] == '1') {
      m = originalPop - 1;
      if (f) {
        ans.push_back(0);
        continue;
      }
      now = totalm - modpow(2LL, i);
      while (now < 0)
        now += m;
    } else {
      m = originalPop + 1;
      now = totalp + modpow(2LL, i);
      now %= m;
    }
    ll cnt = 1;
    while (now != 0) {
      now %= __builtin_popcountll(now);
      cnt++;
    }

    ans.push_back(cnt);
  }

  reverse(all(ans));
  rep(i, n) cout << ans[i] << endl;
}


Error: 0

Fixed submission:

/*
これを入れて実行
g++ code.cpp
./a.out
 */

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>

#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;
typedef long long ll;
typedef long double ld;

int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;

bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
  return f.second > s.second;
}

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; }

ll conbinationMemo[100][100];

void cmemoInit() {
  rep(i, 100) {
    rep(j, 100) { conbinationMemo[i][j] = -1; }
  }
}

ll nCr(ll n, ll r) {
  if (conbinationMemo[n][r] != -1)
    return conbinationMemo[n][r];
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}

ll nPr(ll n, ll r) {
  r = n - r;
  ll ret = 1;
  for (ll i = n; i >= r + 1; i--)
    ret *= i;
  return ret;
}
//-----------------------ここから-----------
ll m;
ll modpow(ll a, ll b) {
  ll res = 1;
  while (b > 0) {
    if (b & 1) {
      res *= a;
      res %= m;
    }
    a *= a;
    a %= m;
    b >>= 1;
  }
  return res;
}
int main(void) {
  ll n;
  cin >> n;
  string s;
  cin >> s;

  reverse(all(s));

  ll originalPop = 0;
  rep(i, n) {
    if (s[i] == '1') {
      originalPop++;
    }
  }
  m = originalPop;

  ll total = 0;
  ll totalp = 0;
  ll totalm = 0;
  for (ll i = 0; i < n; i++) {
    if (s[i] == '1') {
      total += modpow(2LL, i);
      total %= m;
    }
  }
  m = originalPop + 1;
  for (ll i = 0; i < n; i++) {
    if (s[i] == '1') {
      totalp += modpow(2LL, i);
      totalp %= m;
    }
  }
  m = originalPop - 1;
  for (ll i = 0; i < n; i++) {
    if (s[i] == '1') {
      totalm += modpow(2LL, i);
      totalm %= m;
    }
  }
  vector<ll> ans;
  for (ll i = 0; i < n; i++) {
    ll now;
    if (s[i] == '1') {
      m = originalPop - 1;
      if (m == 0) {
        ans.push_back(1);
        continue;
      }
      now = totalm - modpow(2LL, i);
      while (now < 0)
        now += m;
    } else {
      m = originalPop + 1;
      now = totalp + modpow(2LL, i);
      now %= m;
    }
    ll cnt = 1;
    while (now != 0) {
      now %= __builtin_popcountll(now);
      cnt++;
    }

    ans.push_back(cnt);
  }

  reverse(all(ans));
  rep(i, n) cout << ans[i] << endl;
}