AtCoder Beginner Contest 110 D - Factorization

D - Factorization

思路：把相同的质因子看成相同的小球，求把这些小球放进n个盒子里的方案数。

代码：

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(4)
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pi acos(-1.0)
#define LL unsigned long long
//#define mp make_pair
#define pb push_back
#define ls rt<<1, l, m
#define rs rt<<1|1, m+1, r
#define ULL unsigned LL
#define pll pair<LL, LL>
#define pii pair<int, int>
#define piii pair<pii, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define fio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fopen freopen("in.txt", "r", stdin);freopen("out.txt", "w", stout);
//head

const int N = 2e5 + ;
const int MOD = 1e9 + ;
int fac[N], inv[N];
int cnt[N];
LL q_pow(LL n, LL k) {
    LL ans = ;
    while(k) {
        if(k&) ans = (ans * n) % MOD;
        n = (n * n) % MOD;
        k >>= ;
    }
    return ans;
}
void init() {
    fac[] = ;
    for (int i = ; i < N; i++) {
        fac[i] = (1LL * fac[i-] * i) % MOD;
    }
    inv[N-] = q_pow(fac[N-], MOD-) % MOD;
    for (int i = N-; i >= ; i--) inv[i] = (1LL * inv[i+] * (i+)) % MOD;
}
LL C(int n, int m) {
    return ((1LL * fac[n] * inv[m]) % MOD * inv[n-m]) % MOD;
}
int main() {
    int n, m, up = ;
    init();
    scanf("%d %d", &n, &m);
    for (int i = ; i*i <= m; i++) {
        if(m % i == ) {
            int tmp = ;
            while(m % i == ) m /= i, tmp++;
            cnt[++up] = tmp;
        }
    }
    if(m > ) cnt[++up] = ;
    LL ans = ;
    for (int i = ; i <= up; i++) ans = (ans * C(cnt[i]+n-, n-)) % MOD;
    printf("%lld\n", ans);
    return ;
}