#692982 (C++17) No.1659 Product of Divisors

• 問題: No.1659 Product of Divisors
• ユーザー: sapphire__15
• 提出日時: 2021-08-27 21:51:10
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 13 ms / 2,000 ms
• コード長: 5,531 bytes
• コンパイル時間: 1,433 ms
• コンパイル使用メモリ: 135,500 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-21 01:51:26
• 合計ジャッジ時間: 2,929 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	13 ms; 5,248 KB
testcase_01	AC	13 ms; 5,248 KB
testcase_02	AC	12 ms; 5,248 KB
testcase_03	AC	12 ms; 5,248 KB
testcase_04	AC	13 ms; 5,248 KB
testcase_05	AC	13 ms; 5,248 KB
testcase_06	AC	13 ms; 5,248 KB
testcase_07	AC	13 ms; 5,248 KB
testcase_08	AC	13 ms; 5,248 KB
testcase_09	AC	13 ms; 5,248 KB
testcase_10	AC	13 ms; 5,248 KB
testcase_11	AC	13 ms; 5,248 KB
testcase_12	AC	13 ms; 5,248 KB
testcase_13	AC	13 ms; 5,248 KB
testcase_14	AC	13 ms; 5,248 KB
testcase_15	AC	13 ms; 5,248 KB
testcase_16	AC	13 ms; 5,248 KB
testcase_17	AC	13 ms; 5,248 KB
testcase_18	AC	13 ms; 5,248 KB
testcase_19	AC	13 ms; 5,248 KB
testcase_20	AC	12 ms; 5,248 KB
testcase_21	AC	12 ms; 5,248 KB
testcase_22	AC	13 ms; 5,248 KB
testcase_23	AC	13 ms; 5,248 KB
testcase_24	AC	12 ms; 5,248 KB

ソースコード

#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <chrono>
#include <cstring>

typedef long long ll;
typedef std::pair<int, int> Pii;
typedef std::pair<ll, ll> Pll;
typedef std::pair<double, double> Pdd;

#define rip(_i, _n, _s) for (int _i = (_s); _i < (int)(_n); _i++)
#define all(_l) _l.begin(), _l.end()
#define rall(_l) _l.rbegin(), _l.rend()
#define MM << " " <<

template<typename _T>
using MaxHeap = std::priority_queue<_T>;
template<typename _T>
using MinHeap = std::priority_queue<_T, std::vector<_T>, std::greater<_T>>;

template<typename _T>
inline bool chmax(_T &_l, const _T _b) {
    if (_b > _l) {
        _l = _b;
        return true;
    }
    return false;
}
template<typename _T>
inline bool chmin(_T &_l, const _T _b) {
    if (_l > _b) {
        _l = _b;
        return true;
    }
    return false;
}

template<typename _T>
void vdeb(const std::vector<_T> &bb) {
    for (unsigned int i = 0;i < bb.size();i++) {
        if (i == bb.size() - 1) std::cout << bb[i];
        else std::cout << bb[i] << ' ';
    }
    std::cout << '\n';
}
template<typename _T>
void vdeb(const std::vector<std::vector<_T>> &bb) {
    for (unsigned int i = 0;i < bb.size();i++) {
        std::cout << i << ": ";
        vdeb(bb[i]);
    }
    std::cout << '\n';
}

struct modint {
    long long num;
    const static long long p = 1000000007;
    static long long pow(long long n, long long k) {//n^k(mod p)
        long long ret = 1;
        while(k) {
            if(k&1) ret = ret * n % p;
            n = n * n % p;
            k >>= 1;
        }
        return ret;
    }
    // a*A + b*B = 1
    static void euclid(long long &a, long long &b) { // a>=b A*b+B*(a-a/b*b)=1
        if (a == 1) {
            a = 1;
        }
        else {
            long long A = b, B = a % b;
            euclid(A, B);
            b = (A - (p + a / b) % p * B % p + p) % p;
            a = B;
        }
    }
    static long long rev(const long long n) {// n*x-p*y=1
        //long long q = p;
        //euclid(p, n, p);
        //return n % q;
        return pow(n,p-2);
    }
    modint() {
        num = 0;
    }
    modint(long long x) {
        num = x % p;
    }
    modint inv() const{return rev(num);}
    modint operator-() const{return modint(p-num);}
    modint& operator+=(const modint &other){
        num = (num + other.num) % p;
        return *this;
    }
    modint& operator-=(const modint &other){
        num = (num - other.num + p) % p;
        return *this;
    }
    modint& operator*=(const modint &other){
        num = (num * other.num) % p;
        return *this;
    }
    modint& operator/=(const modint &other){
        (*this) *= other.inv();
        return *this;
    }
    modint& operator+=(const long long &other){
        num = (num + other) % p;
        return *this;
    }
    modint& operator-=(const long long &other){
        num = (num - other + p) % p;
        return *this;
    }
    modint& operator*=(const long long &other){
        num = (num * other) % p;
        return *this;
    }
    modint& operator/=(const long long &other){
        (*this) *= rev(other);
        return *this;
    }
    modint& operator++(){return *this += 1;}
    modint& operator--(){return *this -= 1;}
    modint& operator=(const long long &other){return (*this) = modint(other);}
    modint operator+(const modint &other) const{return modint(*this) += other;}
    modint operator-(const modint &other) const{return modint(*this) -= other;}
    modint operator*(const modint &other) const{return modint(*this) *= other;}
    modint operator/(const modint &other) const{return modint(*this) /= other;}
    modint operator+(const long long &other) const{return modint(*this) += other;}
    modint operator-(const long long &other) const{return modint(*this) -= other;}
    modint operator*(const long long &other) const{return modint(*this) *= other;}
    modint operator/(const long long &other) const{return modint(*this) /= other;}
    bool operator==(const modint &other) const{return num == other.num;}
};
std::istream& operator>>(std::istream &is, modint x) {
    is >> x.num;
    return is;
}
std::ostream& operator<<(std::ostream &os, const modint &x){
    os << x.num;
    return os;
}

struct combination{
    std::vector<modint> li;
    std::vector<modint> rev;
    combination(int size){
        li = std::vector<modint>(size);
        rev = std::vector<modint>(size);
        li[0] = 1;
        for(int i= 1; i< size;i++) li[i] = li[i-1]*i;
        rev.back() = modint(1)/li.back();
        for(int i = size-1; i > 0; i--) rev[i-1] = rev[i]*i;
    }
    modint nCk(int n, int k){
        if(k < 0 || n < k) return 1;
        return li[n]*rev[k]*rev[n-k];
    }
} comb(100);

using namespace std;

int main() {
    ll n, k; cin >> n >> k;
    modint ans(1);
    modint kk(k);
    rip(i,1001000,2) {
        if(n%i == 0) {
            int cnt = 0;
            while(n%i == 0) {
                n /= i;
                cnt++;
            }
            modint now(1), su(1);
            rip(i,cnt, 0) {
                now *= kk + i + 1;
                now /= i + 1;
                su += now;
            }
            ans *= now;
        }
    }
    if(n > 1) ans *= kk + 1;
    cout << ans << endl;
}