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

// RAKSHIT KADAM

//  -- Declare array globally...
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree< int ,  null_type ,  less<int> ,  rb_tree_tag ,
// tree_order_statistics_node_update> find_by_order returns iterator to  element
// present at that index... order_of_key returns no. of elements having value
// stricktly less than that given in the order_of_key();
#warning !!!check the size of arrayss!!!

// NUMERIC DEFINITIONS :
#define INF 1000000000000000005
#define inf 1000000003
#define MOD 1000000007
#define newMOD 998244353
#define MAX 200006
#define pi 3.1415926535897932384626433832795
#define ld long double
#define ll long long
#define int long long

#define P(gg)                                                                  \\
  for (auto rax : gg) {                                                        \\
    cout << rax << " ";                                                        \\
  }                                                                            \\
  cout << endl;
#define Need_for_speed(activated)                                              \\
  ios_base ::sync_with_stdio(0);                                               \\
  cin.tie(NULL);                                                               \\
  cout.tie(NULL)
#define satisfy                                                                \\
  ll t;                                                                        \\
  cin >> t;                                                                    \\
  while (t--)
#define inp(n)                                                                 \\
  int n;                                                                       \\
  cin >> n
#define mp make_pair
#define pb push_back
#define endl "\\n"
#define x first
#define y second
#define fore(i, a, b) for (ll i = a; i < b; i++)
#define forci(i, n) for (ll i = 0; i < n; i++)
#define vi vector<ll>
#define Endl endl
#define lb lower_bound
#define ub upper_bound
#define pii pair<ll, ll>

#define input                                                                  \\
  freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define time                                                                   \\
  cerr << "\\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\\n";
using namespace std;
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
int power(int x, unsigned int y, unsigned int m) {
  if (y == 0)
    return 1;
  int p = power(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
ll modInverse(int a, int m) {
  { return power(a, m - 2, m); }
}
const int maxn = 500066;
int mod(string num, int a) {
  // Initialize result
  int res = 0;

  for (int i = 0; i < num.length(); i++)
    res = (res * 2 + (int)num[i] - '0') % a;

  return res;
}
ll get(ll num) {
  ll x = __builtin_popcount(num);
  if (!x)
    return 0;
  ll ret = 0;
  while (num % x) {
    ret++;
    num %= x;
    x = __builtin_popcount(num);
  }
  return ret + 1;
}
void solve() {
  ll n;
  cin >> n;
  ll one = 0;
  string s;
  cin >> s;
  for (char c : s) {
    if (c == '1')
      one++;
  }
  ll ansn, ansp;
  ansp = mod(s, one + 1);
  ll ans = 0;
  if (one - 1)
    ansn = mod(s, one - 1);
  for (ll i = 0; i < n; i++) {

    if (s[i] == '0') {
      ll p = power(2, n - i - 1, one + 1);

      ll x = (ansp + p) % (one + 1);
      cout << get(x) + 1 << endl;

    } else {
      if (one == 1) {
        cout << 0 << endl;
        continue;
      }
      ll p = power(2, n - i - 1, one - 1);
      ll x = (ansn - p + (one - 1)) % (one - 1);
      cout << get(x) + 1 << endl;
    }
  }
}

signed main() {
  Need_for_speed(activated);

  // satisfy
  //     {
  //   solve();
  //    }

  solve();
  return 0;
}


Error: 0

Fixed submission:

// RAKSHIT KADAM

//  -- Declare array globally...
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree< int ,  null_type ,  less<int> ,  rb_tree_tag ,
// tree_order_statistics_node_update> find_by_order returns iterator to  element
// present at that index... order_of_key returns no. of elements having value
// stricktly less than that given in the order_of_key();
#warning !!!check the size of arrayss!!!

// NUMERIC DEFINITIONS :
#define INF 1000000000000000005
#define inf 1000000003
#define MOD 1000000007
#define newMOD 998244353
#define MAX 200006
#define pi 3.1415926535897932384626433832795
#define ld long double
#define ll long long
#define int long long

#define P(gg)                                                                  \\
  for (auto rax : gg) {                                                        \\
    cout << rax << " ";                                                        \\
  }                                                                            \\
  cout << endl;
#define Need_for_speed(activated)                                              \\
  ios_base ::sync_with_stdio(0);                                               \\
  cin.tie(NULL);                                                               \\
  cout.tie(NULL)
#define satisfy                                                                \\
  ll t;                                                                        \\
  cin >> t;                                                                    \\
  while (t--)
#define inp(n)                                                                 \\
  int n;                                                                       \\
  cin >> n
#define mp make_pair
#define pb push_back
#define endl "\\n"
#define x first
#define y second
#define fore(i, a, b) for (ll i = a; i < b; i++)
#define forci(i, n) for (ll i = 0; i < n; i++)
#define vi vector<ll>
#define Endl endl
#define lb lower_bound
#define ub upper_bound
#define pii pair<ll, ll>

#define input                                                                  \\
  freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define time                                                                   \\
  cerr << "\\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\\n";
using namespace std;
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
int power(int x, unsigned int y, unsigned int m) {
  if (y == 0)
    return 1;
  int p = power(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
ll modInverse(int a, int m) {
  { return power(a, m - 2, m); }
}
const int maxn = 500066;
int mod(string num, int a) {
  // Initialize result
  int res = 0;

  for (int i = 0; i < num.length(); i++)
    res = (res * 2 + (int)num[i] - '0') % a;

  return res;
}
ll get(ll num) {
  ll x = __builtin_popcount(num);
  if (!x)
    return 0;
  ll ret = 0;
  while (num % x) {
    ret++;
    num %= x;
    x = __builtin_popcount(num);
  }
  return ret + 1;
}
void solve() {
  ll n;
  cin >> n;
  ll one = 0;
  string s;
  cin >> s;
  for (char c : s) {
    if (c == '1')
      one++;
  }
  ll ansp = mod(s, one + 1);
  ll ans = 0;
  ll ansn = mod(s, one - 1);
  for (ll i = 0; i < n; i++) {

    if (s[i] == '0') {
      ll p = power(2, n - i - 1, one + 1);

      ll x = (ansp + p) % (one + 1);
      cout << get(x) + 1 << endl;

    } else {
      ll p = power(2, n - i - 1, one - 1);
      ll x = (ansn - p + (one - 1)) % (one - 1);
      cout << get(x) + 1 << endl;
    }
  }
}

signed main() {
  Need_for_speed(activated);

  // satisfy
  //     {
  //   solve();
  //    }

  solve();
  return 0;
}