結果

問題 No.1973 Divisor Sequence
ユーザー ktr216
提出日時 2022-06-10 22:17:25
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 294 ms / 2,000 ms
コード長 2,940 bytes
コンパイル時間 1,790 ms
コンパイル使用メモリ 179,836 KB
実行使用メモリ 180,604 KB
最終ジャッジ日時 2024-09-21 07:30:30
合計ジャッジ時間 4,579 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define double long double
using ll = long long;
using VB = vector<bool>;
using VVB = vector<VB>;
using VC = vector<char>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
using VVVVL = vector<VVVL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using P = pair<int, int>;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()
constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};
template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }
const ll MOD = 1000000007;
const int MAX_N = 200010;
int par[MAX_N];
int rnk[MAX_N];
int siz[MAX_N];
void init(int n) {
    REP(i,n) {
        par[i] = i;
        rnk[i] = 0;
        siz[i] = 1;
    }
}
int find(int x) {
    if (par[x] == x) {
        return x;
    } else {
        return par[x] = find(par[x]);
    }
}
void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return;
    int s = siz[x] + siz[y];
    if (rnk[x] < rnk[y]) {
        par[x] = y;
    } else {
        par[y] = x;
        if (rnk[x] == rnk[y]) rnk[x]++;
    }
    siz[find(x)] = s;
}
bool same(int x, int y) {
    return find(x) == find(y);
}
int size(int x) {
    return siz[find(x)];
}
ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}
VL f(MAX_N + 1, 1);
ll C(ll n, ll k) {
    if (n < k) return 0;
    return f[n] * mod_pow(f[k], MOD - 2, MOD) % MOD * mod_pow(f[n - k], MOD - 2, MOD) % MOD;
}
int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N;
    ll M;
    cin >> N >> M;
    map<ll, int> mp;
    for (ll i = 2; i * i <= M; i++) {
        while (M % i == 0) {
            mp[i]++;
            M /= i;
        }
    }
    if (M > 1) mp[M]++;
    /*
    for (auto i : mp) {
        //cout << i.first << " " << i.second << endl;
    }
    */
    ll ans = 1;
    for (auto e : mp) {
        int A = e.second;
        VVL dp(N + 1, VL(A + 1, 0));
        dp[0][0] = 1;
        REP(i, N) {
            ll S = 0;
            REP(j, A + 1) {
                S = (S + dp[i][j]) % MOD;
                dp[i + 1][A - j] = S;
            }
        }
        /*
        REP(i, N + 1) {
            REP(j, A + 1) cout << dp[i][j] << " ";
            cout << endl;
        }
        cout << endl;
        */
        ll X = 0;
        REP(i, A + 1) X = (X + dp[N][i]) % MOD;
        ans = ans * X % MOD;
    }
    cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0