Submission #3422021

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define rep(i, n)             for (int (i) = 0; (i) < (int)(n); (i)++)

static const int MOD = 1000000007;
#define int long long

long long inv(long long x) {
        long long  y = 1;
        while (y % x) y += MOD;
        return y / x;
}

long long nCr(long long n, long long r) {
        if (n < r) return 0;
        if (n - r < r) r = n - r;
        long long ret = 1;
        rep(i, r) {
                ret = ret * n % MOD;
                n --;
                ret = ret * inv(i + 1) % MOD;
        }
        return ret;
}

long long nHr(long long n, long long r) {
        return nCr(n + r - 1, r);
}

signed main() { 
        int n, m;
        cin >> n >> m;
        n = n < 0 ? -n : n; //nが負ならば正にする
        int ans = 1;
        for (int i = 2; i * i <= n; i ++) if (n % i == 0) {
                int cnt = 0;
                while (n % i == 0) {
                        n /= i;
                        cnt ++;
                }
                ans = ans * nHr(m, cnt) % MOD;//m個の箱にcnt個のある素因数を分配する方法の数をかける
        }
        if (n > 1) ans = ans * nHr(m, 1) % MOD;
        rep(i, m - 1) ans = ans * 2 % MOD; //2のm - 1乗をかける
        cout << ans << endl;
        return 0;
}               

Submission Info

Judge Result