結果

問題 No.1659 Product of Divisors
ユーザー fuppy_kyoprofuppy_kyopro
提出日時 2021-08-27 22:03:08
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 15 ms / 2,000 ms
コード長 5,178 bytes
コンパイル時間 2,136 ms
コンパイル使用メモリ 206,160 KB
実行使用メモリ 11,836 KB
最終ジャッジ日時 2023-08-13 09:00:47
合計ジャッジ時間 3,301 ms
ジャッジサーバーID
(参考情報)
judge11 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
11,560 KB
testcase_01 AC 6 ms
11,708 KB
testcase_02 AC 5 ms
11,584 KB
testcase_03 AC 5 ms
11,836 KB
testcase_04 AC 6 ms
11,452 KB
testcase_05 AC 8 ms
11,688 KB
testcase_06 AC 6 ms
11,744 KB
testcase_07 AC 5 ms
11,696 KB
testcase_08 AC 7 ms
11,632 KB
testcase_09 AC 5 ms
11,700 KB
testcase_10 AC 12 ms
11,692 KB
testcase_11 AC 5 ms
11,784 KB
testcase_12 AC 15 ms
11,632 KB
testcase_13 AC 6 ms
11,560 KB
testcase_14 AC 15 ms
11,500 KB
testcase_15 AC 6 ms
11,580 KB
testcase_16 AC 5 ms
11,696 KB
testcase_17 AC 6 ms
11,636 KB
testcase_18 AC 6 ms
11,712 KB
testcase_19 AC 6 ms
11,580 KB
testcase_20 AC 6 ms
11,556 KB
testcase_21 AC 5 ms
11,788 KB
testcase_22 AC 13 ms
11,692 KB
testcase_23 AC 6 ms
11,632 KB
testcase_24 AC 7 ms
11,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

#include <bits/stdc++.h>

// #include <atcoder/all>
// #include <atcoder/math>

using namespace std;
// using namespace atcoder;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                            \
    cerr << #v << endl;                         \
    for (int i = 0; i < v.size(); i++) {        \
        for (int j = 0; j < v[i].size(); j++) { \
            cerr << v[i][j] << " ";             \
        }                                       \
        cerr << endl;                           \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
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 (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

const int MAXN = 555555;

vl fact(MAXN);
vl rfact(MAXN);

ll mod_pow(ll x, ll p, ll M = MOD) {
    if (p < 0) {
        x = mod_pow(x, M - 2, M);
        p = -p;
    }
    x %= M;
    ll a = 1;
    while (p) {
        if (p % 2)
            a = a * x % M;
        x = x * x % M;
        p /= 2;
    }
    return a;
}

ll mod_inverse(ll a, ll M = MOD) {
    return mod_pow(a, M - 2, M);
}

void set_fact(ll n, ll M = MOD) {
    fact[0] = 1;
    for (ll i = 1; i <= n; i++) {
        fact[i] = i * fact[i - 1] % M;
    }
    rfact[n] = mod_inverse(fact[n], M);
    for (ll i = n - 1; i >= 0; i--) {
        rfact[i] = (i + 1) * rfact[i + 1] % M;
    }
}

//http://drken1215.hatenablog.com/entry/2018/06/08/210000
//n���傫��fact���v�Z�ł��Ȃ��Ƃ��̂ق��̌v�Z���@�ɂ‚��ď����Ă���
ll nCr(ll n, ll r, ll M = MOD) {
    ll res = 1;
    for (int i = 0; i < r; i++)
        (res *= (n - i) % MOD) %= MOD;
    for (int i = 1; i <= r; i++)
        (res *= mod_inverse(i)) %= MOD;
    return res;
}

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

ll ans = 0;
ll n, k;

void dfs(const vi &p, vi &a) {
    if (a.size() == p.size()) {
        ll res = 1;
        for (int c : a) {
            (res *= nHr(c + 1, k - 1)) %= MOD;
        }
        (ans += res) %= MOD;
        return;
    }

    for (int i = 0; i <= p[a.size()]; i++) {
        a.push_back(i);
        dfs(p, a);
        a.pop_back();
    }
}

signed main() {
    cin >> n >> k;
    vi p;

    for (ll x = 2; x * x <= n; x++) {
        int cnt = 0;
        while (n % x == 0) {
            n /= x;
            cnt++;
        }
        if (cnt >= 1) p.push_back(cnt);
    }
    if (n > 1) p.push_back(1);

    vi a;
    dfs(p, a);
    cout << ans << endl;
}
0