Submission #3260162


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
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; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); }}; // nHk = (n+k-1)Ck : n is separator
typedef ModInt<1000000007> mint;
map<int, int> enumpr(int n) {
    map<int, int> V;
    for (int i = 2; 1LL * i*i <= n; i++) while (n%i == 0) V[i]++, n /= i;
    if (n>1) V[n]++;
    return V;
}
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \    | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/



int N, M;
Comb<mint, 201010> com;
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N >> M;
    auto ep = enumpr(M);

    mint ans = 1;
    fore(p, ep) ans *= com.nHk(N, p.second);
    cout << ans << endl;
}

Submission Info

Submission Time
Task D - Factorization
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 400
Code Size 3990 Byte
Status AC
Exec Time 4 ms
Memory 1792 KB

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 36
AC × 3
Set Name Test Cases
All 0_small_1, 0_small_2, 0_small_3, 1_large_1, 1_large_2, 1_large_3, 2_large_1, 2_large_2, 3_prime_1, 3_prime_10, 3_prime_11, 3_prime_12, 3_prime_13, 3_prime_14, 3_prime_15, 3_prime_16, 3_prime_17, 3_prime_18, 3_prime_19, 3_prime_2, 3_prime_20, 3_prime_21, 3_prime_22, 3_prime_3, 3_prime_4, 3_prime_5, 3_prime_6, 3_prime_7, 3_prime_8, 3_prime_9, 4_hand_1, 4_hand_2, 4_hand_3, sample_01, sample_02, sample_03
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
0_small_1 AC 4 ms 1792 KB
0_small_2 AC 4 ms 1792 KB
0_small_3 AC 3 ms 1792 KB
1_large_1 AC 3 ms 1792 KB
1_large_2 AC 3 ms 1792 KB
1_large_3 AC 4 ms 1792 KB
2_large_1 AC 3 ms 1792 KB
2_large_2 AC 3 ms 1792 KB
3_prime_1 AC 3 ms 1792 KB
3_prime_10 AC 3 ms 1792 KB
3_prime_11 AC 3 ms 1792 KB
3_prime_12 AC 4 ms 1792 KB
3_prime_13 AC 3 ms 1792 KB
3_prime_14 AC 4 ms 1792 KB
3_prime_15 AC 4 ms 1792 KB
3_prime_16 AC 4 ms 1792 KB
3_prime_17 AC 3 ms 1792 KB
3_prime_18 AC 3 ms 1792 KB
3_prime_19 AC 3 ms 1792 KB
3_prime_2 AC 3 ms 1792 KB
3_prime_20 AC 3 ms 1792 KB
3_prime_21 AC 3 ms 1792 KB
3_prime_22 AC 3 ms 1792 KB
3_prime_3 AC 3 ms 1792 KB
3_prime_4 AC 4 ms 1792 KB
3_prime_5 AC 3 ms 1792 KB
3_prime_6 AC 4 ms 1792 KB
3_prime_7 AC 3 ms 1792 KB
3_prime_8 AC 3 ms 1792 KB
3_prime_9 AC 3 ms 1792 KB
4_hand_1 AC 3 ms 1792 KB
4_hand_2 AC 3 ms 1792 KB
4_hand_3 AC 3 ms 1792 KB
sample_01 AC 4 ms 1792 KB
sample_02 AC 4 ms 1792 KB
sample_03 AC 4 ms 1792 KB