Problem p03253 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;

using ull = unsigned long long;
using ll = long long;

#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x) x % 2 == 0
#define odd(x) x % 2 != 0
#define all(x) x.begin(), x.end()
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define IN1(x)                                                                 \
  ll x;                                                                        \
  cin >> x;

// these functions return the position of result of Binary Search.
#define LB(s, t, x) (int)(lower_bound(s, t, x) - s)
#define UB(s, t, x) (int)(upper_bound(s, t, x) - s)

ll qp(ll a, ll b, int mo) {
  ll ans = 1;
  do {
    if (b & 1)
      ans = 1ll * ans * a % mo;
    a = 1ll * a * a % mo;
  } while (b >>= 1);
  return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
  ll temp = gcd(a, b);
  return temp ? (a / temp * b) : 0;
}
int mDays[] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[] = {1, -1, 0, 0, 1, 1, -1, -1}, dy8[] = {0, 0, -1, 1, -1, 1, -1, 1};

template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, size_t b, Ts... ts) {
  return vector<decltype(make_v<T>(b, ts...))>(a, make_v<T>(b, ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t)
    fill_v(e, v);
}
// auto dp = make_v<int>(4, h, w);
// fill_v(dp, 0);

const ll INF_LL = (1ll << 60);
const int INF_INT = (int)1e9;
const ll MOD_CONST = (ll)(1e9 + 7);

template <typename T> vector<T> pows(int b, int n) {
  vector<T> ret;
  T x = 1;
  while (ret.size() < n) {
    ret.push_back(x);
    x *= b;
  }
  return ret;
}
// find string "from" in "str", and replace them to "to"
void strReplace(std::string &str, const std::string &from,
                const std::string &to) {
  std::string::size_type pos = 0;
  while (pos = str.find(from, pos), pos != std::string::npos) {
    str.replace(pos, from.length(), to);
    pos += to.length();
  }
}
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

inline tuple<ll, ll> rotate45(tuple<ll, ll> point) {
  ll x = get<0>(point), y = get<1>(point);
  return tuple<ll, ll>(x + y, x - y);
}
inline bool rangeCheck2D(int nx, int ny, int Width, int Height) {
  return nx >= 0 and nx < Width and ny >= 0 and ny < Height;
}

template <typename T> vector<T> INPA(ll n) {
  vector<T> x;
  REP(i, n) {
    T tmp;
    cin >> tmp;
    x.push_back(tmp);
  }
  return move(x);
}
template <typename T> void out(T o) { cout << o << endl; }
template <typename T> void out(vector<T> &out) {
  REP(i, (int)out.size()) {
    cout << out[i];
    if (i == (int)out.size() - 1)
      cout << endl;
    else
      cout << " ";
  }
}
template <typename T> void out(vector<vector<T>> o) {
  REP(i, o.size()) out(o[i]);
}
void YesNo(bool f) { cout << (f ? "Yes" : "No") << endl; }
void YESNO(bool f) { cout << (f ? "YES" : "NO") << endl; }

namespace PrimeLib {
//* 素数判定 is_prime<unsigned>(N)
template <typename T, std::enable_if_t<std::is_unsigned<T>::value,
                                       std::nullptr_t> = nullptr>
bool is_prime(const T n) {
  if (n < 4)
    return n == 2 || n == 3;
  if (n % 2 == 0 || n % 3 == 0 || (n % 6 != 1 && n % 6 != 5))
    return false;
  for (T i = 5; i * i <= n; i += 6)
    if (n % i == 0 || n % (i + 2) == 0)
      return false;
  return true;
}
//* 素数テーブル生成　エラトステネスの篩
vector<ll> primeTable(ll n) {
  vector<bool> table(n - 1);
  vector<ll> ret;
  for (ll i = 0; i < n - 1; ++i) {
    if (table[i] == false) {
      ll num = i + 2;
      ret.push_back(i + 2);
      for (int j = i + num; j < n - 1; j += num)
        table[j] = true;
    }
  }
  return ret;
}
vector<ll> factorize(ll n, vector<ll> &pt) {
  vector<ll> ret;
  int pos = 0;
  ll c = n;
  while (c != 1) {
    ll p = pt[pos];
    ret.push_back(0);
    while (c % p == 0) {
      ret[pos]++;
      c /= p;
    }
    pos++;
    if (pos >= pt.size())
      break;
  }
  assert(c == 1);
  return ret;
}
} // namespace PrimeLib

// 1≤k≤n≤10^7
class CombLib {
private:
  int mMax, mMod;
  vector<ll> fac, finv, inv;

public:
  CombLib(int modNum = 1000000007, int maxSize = 510000) {
    mMax = maxSize, mMod = modNum;
    fac = vector<ll>(maxSize);
    finv = vector<ll>(maxSize);
    inv = vector<ll>(maxSize);
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < mMax; i++) {
      fac[i] = fac[i - 1] * i % mMod;
      inv[i] = mMod - inv[mMod % i] * (mMod / i) % mMod;
      finv[i] = finv[i - 1] * inv[i] % mMod;
    }
  }

  ll nCr(int n, int k) {
    if (n < k)
      return 0;
    if (n < 0 || k < 0)
      return 0;
    return fac[n] * (finv[k] * finv[n - k] % mMod) % mMod;
  }

  ll nHr(int n, int k) {
    if (n == 0 and k == 0)
      return 1;
    return nCr(n + k - 1, n);
  }
};

int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);

  IN1(N);
  IN1(M);
  ll sm = ll(sqrt(1e14));
  CombLib cl;
  auto pt = PrimeLib::primeTable(sm);
  auto pn = PrimeLib::factorize(M, pt);
  ll ans = 1;
  for (auto b : pn) {
    if (b == 0)
      continue;
    ans = (ans * cl.nHr(b, N)) % MOD_CONST;
  }
  out(ans % MOD_CONST);

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

using ull = unsigned long long;
using ll = long long;

#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x) x % 2 == 0
#define odd(x) x % 2 != 0
#define all(x) x.begin(), x.end()
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define IN1(x)                                                                 \
  ll x;                                                                        \
  cin >> x;

// these functions return the position of result of Binary Search.
#define LB(s, t, x) (int)(lower_bound(s, t, x) - s)
#define UB(s, t, x) (int)(upper_bound(s, t, x) - s)

ll qp(ll a, ll b, int mo) {
  ll ans = 1;
  do {
    if (b & 1)
      ans = 1ll * ans * a % mo;
    a = 1ll * a * a % mo;
  } while (b >>= 1);
  return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
  ll temp = gcd(a, b);
  return temp ? (a / temp * b) : 0;
}
int mDays[] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[] = {1, -1, 0, 0, 1, 1, -1, -1}, dy8[] = {0, 0, -1, 1, -1, 1, -1, 1};

template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, size_t b, Ts... ts) {
  return vector<decltype(make_v<T>(b, ts...))>(a, make_v<T>(b, ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t)
    fill_v(e, v);
}
// auto dp = make_v<int>(4, h, w);
// fill_v(dp, 0);

const ll INF_LL = (1ll << 60);
const int INF_INT = (int)1e9;
const ll MOD_CONST = (ll)(1e9 + 7);

template <typename T> vector<T> pows(int b, int n) {
  vector<T> ret;
  T x = 1;
  while (ret.size() < n) {
    ret.push_back(x);
    x *= b;
  }
  return ret;
}
// find string "from" in "str", and replace them to "to"
void strReplace(std::string &str, const std::string &from,
                const std::string &to) {
  std::string::size_type pos = 0;
  while (pos = str.find(from, pos), pos != std::string::npos) {
    str.replace(pos, from.length(), to);
    pos += to.length();
  }
}
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

inline tuple<ll, ll> rotate45(tuple<ll, ll> point) {
  ll x = get<0>(point), y = get<1>(point);
  return tuple<ll, ll>(x + y, x - y);
}
inline bool rangeCheck2D(int nx, int ny, int Width, int Height) {
  return nx >= 0 and nx < Width and ny >= 0 and ny < Height;
}

template <typename T> vector<T> INPA(ll n) {
  vector<T> x;
  REP(i, n) {
    T tmp;
    cin >> tmp;
    x.push_back(tmp);
  }
  return move(x);
}
template <typename T> void out(T o) { cout << o << endl; }
template <typename T> void out(vector<T> &out) {
  REP(i, (int)out.size()) {
    cout << out[i];
    if (i == (int)out.size() - 1)
      cout << endl;
    else
      cout << " ";
  }
}
template <typename T> void out(vector<vector<T>> o) {
  REP(i, o.size()) out(o[i]);
}
void YesNo(bool f) { cout << (f ? "Yes" : "No") << endl; }
void YESNO(bool f) { cout << (f ? "YES" : "NO") << endl; }

namespace PrimeLib {
//* 素数判定 is_prime<unsigned>(N)
template <typename T, std::enable_if_t<std::is_unsigned<T>::value,
                                       std::nullptr_t> = nullptr>
bool is_prime(const T n) {
  if (n < 4)
    return n == 2 || n == 3;
  if (n % 2 == 0 || n % 3 == 0 || (n % 6 != 1 && n % 6 != 5))
    return false;
  for (T i = 5; i * i <= n; i += 6)
    if (n % i == 0 || n % (i + 2) == 0)
      return false;
  return true;
}
//* 素数テーブル生成　エラトステネスの篩
vector<ll> primeTable(ll n) {
  vector<bool> table(n - 1);
  vector<ll> ret;
  for (ll i = 0; i < n - 1; ++i) {
    if (table[i] == false) {
      ll num = i + 2;
      ret.push_back(i + 2);
      for (int j = i + num; j < n - 1; j += num)
        table[j] = true;
    }
  }
  return ret;
}
vector<ll> factorize(ll n, vector<ll> &pt) {
  vector<ll> ret;
  int pos = 0;
  ll c = n;
  while (c != 1) {
    ll p = pt[pos];
    ret.push_back(0);
    while (c % p == 0) {
      ret[pos]++;
      c /= p;
    }
    pos++;
    if (pos >= pt.size())
      break;
  }
  // assert(c == 1);
  if (c != 1)
    ret.push_back(1);
  return ret;
}
} // namespace PrimeLib

// 1≤k≤n≤10^7
class CombLib {
private:
  int mMax, mMod;
  vector<ll> fac, finv, inv;

public:
  CombLib(int modNum = 1000000007, int maxSize = 510000) {
    mMax = maxSize, mMod = modNum;
    fac = vector<ll>(maxSize);
    finv = vector<ll>(maxSize);
    inv = vector<ll>(maxSize);
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < mMax; i++) {
      fac[i] = fac[i - 1] * i % mMod;
      inv[i] = mMod - inv[mMod % i] * (mMod / i) % mMod;
      finv[i] = finv[i - 1] * inv[i] % mMod;
    }
  }

  ll nCr(int n, int k) {
    if (n < k)
      return 0;
    if (n < 0 || k < 0)
      return 0;
    return fac[n] * (finv[k] * finv[n - k] % mMod) % mMod;
  }

  ll nHr(int n, int k) {
    if (n == 0 and k == 0)
      return 1;
    return nCr(n + k - 1, n);
  }
};

int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);

  IN1(N);
  IN1(M);
  ll sm = ll(sqrt(1e14));
  CombLib cl;
  auto pt = PrimeLib::primeTable(sm);
  auto pn = PrimeLib::factorize(M, pt);
  ll ans = 1;
  for (auto b : pn) {
    if (b == 0)
      continue;
    ans = (ans * cl.nHr(b, N)) % MOD_CONST;
  }
  out(ans % MOD_CONST);

  return 0;
}