Problem p02660 (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 << 62;
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;
}
//-----------------------ここから-----------
int main(void) {
  ll n;
  cin >> n;
  vector<bool> prime(1001001, false);

  for (ll i = 0; i <= 1001000; i++) {
    prime[i] = true;
  }

  vector<ll> p;

  for (ll i = 2; i <= 1001000; i++) {
    if (prime[i]) {
      for (ll j = 2 * i; j <= 1001000; j += i) {
        prime[j] = false;
      }
      p.push_back(i);
    }
  }
  vector<ll> li;
  for (ll i = 0; i < p.size(); i++) {
    ll now = p[i];
    while (now <= (ll)1e13) {
      li.push_back(now);
      now *= p[i];
    }
  }

  bool np = true;

  for (ll i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      np = false;
    }
  }
  ll plus = 0;
  if (n > 1001000) {
    if (np) {
      cout << 1 << endl;
      return 0;
    }
  }
  sort(all(li));
  ll ans = 0;
  ll num = n;
  for (ll i = 0; i < li.size(); i++) {
    if (num % li[i] == 0) {
      num /= li[i];
      ans++;
    }
  }

  if (num > 1001000) {
    ans++;
  }

  cout << ans << 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 << 62;
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;
}
//-----------------------ここから-----------
int main(void) {
  ll n;
  cin >> n;
  vector<bool> prime(1001001, false);

  for (ll i = 0; i <= 1001000; i++) {
    prime[i] = true;
  }

  vector<ll> p;

  for (ll i = 2; i <= 1001000; i++) {
    if (prime[i]) {
      for (ll j = 2 * i; j <= 1001000; j += i) {
        prime[j] = false;
      }
      p.push_back(i);
    }
  }
  vector<ll> li;
  for (ll i = 0; i < p.size(); i++) {
    ll now = p[i];
    while (now <= (ll)1e13) {
      li.push_back(now);
      now *= p[i];
    }
  }

  bool np = true;

  for (ll i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      np = false;
    }
  }
  ll plus = 0;
  if (n > 1001000) {
    assert(false);
    if (np) {
      cout << 1 << endl;
      return 0;
    }
  }
  sort(all(li));
  ll ans = 0;
  ll num = n;
  for (ll i = 0; i < li.size(); i++) {
    if (num % li[i] == 0) {
      num /= li[i];
      ans++;
    }
  }

  cout << ans << endl;
}