一本通1633：【例 3】Sumdiv

最新推荐文章于 2024-10-02 23:40:03 发布

我是小蒟蒻

最新推荐文章于 2024-10-02 23:40:03 发布

阅读量82

点赞数 1

文章标签：算法 c++

本文链接：https://blog.csdn.net/liu12345635/article/details/137734621

版权

#include <cstdio>
#define LL long long

const int mod = 9901;

LL qmi(LL a, LL b) {
    LL res = 1, mul = a;

    while (b) {
        if (b & 1)
            res = res * mul % mod;

        mul = mul * mul % mod;
        b >>= 1;
    }

    return res;
}

int main() {
    LL a, b, ans = 1;
    scanf("%lld %lld", &a, &b);

    for (int i = 2, j; i <= a / i; i ++)
        if (a % i == 0) {
            j = 0;

            while (a % i == 0)
                a /= i, j ++;

            j *= b;
            ans *= (1 - qmi(i, j + 1)) * qmi(1 - i, mod - 2) % mod;
            ans %= mod;
        }

    if (a > 1)
        ans *= (1 - qmi(a, b + 1)) * qmi(1 - a, mod - 2) % mod;

    ans %= mod;
    printf("%lld", ans);
    return 0;
}