Loj 6053. 简单的函数（Min_25筛）

最新推荐文章于 2023-11-21 12:28:31 发布

Flyppy_White

最新推荐文章于 2023-11-21 12:28:31 发布

阅读量244

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/baiyifeifei/article/details/90615412

版权

数论专栏收录该内容

49 篇文章 0 订阅

订阅专栏

Loj 6053. 简单的函数（Min_25筛）

题目大意

有一积性函数，当p为质数时有
$f(p^c)=p\ XOR\ c$
求 $\sum_{i=1}^nf(i)\ mod\ (10^9+7)$

解题思路

对于 $f (p)$ 只有当p为2时其值为3，其余情况，为p-1。不妨令其为素数时即有 $f (p) = p - 1$ 则满足自变量为素数时，函数值为多项式，则可以min25筛求之

AC代码

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int mod = 1e9 + 7;
const int size = 1e6 + 5;
LL n, s;
LL p[size];
bool prime[size];
unordered_map<LL, int> ID;
LL pre[size];
LL num[size];
LL h1[size], h0[size];
int tol, tot;
LL get_g(LL x, int k) {
    if (x <= 1 || p[k] > x)
        return 0;
    LL ans = (h1[ID[x]] - h0[ID[x]] + mod - (pre[k - 1] - (k - 1)) + mod) % mod;
    if (k == 1)
        ans += 2;
    while (1LL * p[k] * p[k] <= x && k <= tol) {
        LL pk = p[k], t = p[k];
        for (int e = 1; t * pk <= x; e++, t = t * pk) {
            ans = (ans + (pk ^ e) % mod * get_g(x / t, k + 1) % mod + (pk ^ (e + 1)) % mod) % mod;
        }
        k++;
    }
    return ans % mod;
}
void get_h() {
    s = sqrt(n);
    while (s * s <= n) s++;
    while (s * s > n) s--;
    for (int i = 1; i <= s; i++) prime[i] = true;
    for (int i = 2; i <= s; i++) {
        if (prime[i]) {
            p[++tol] = i;
            pre[tol] = (pre[tol - 1] + i) % mod;
        }
        for (int j = 1; j <= tol && p[j] * i <= s; j++) {
            prime[p[j] * i] = false;
            if (i % p[j] == 0)
                break;
        }
    }
    for (int i = 1; i <= s; i++) {
        num[++tot] = i;
        ID[i] = tot;
    }
    for (int i = s; i >= 1; i--)
        if (n / i > s) {
            num[++tot] = n / i;
            ID[n / i] = tot;
        }
    for (int i = 1; i <= tot; i++) h0[i] = h1[i] = num[i] % mod;
    for (int i = 1; i <= tot; i++) {
        h1[i] = h1[i] * (h1[i] + 1) / 2 % mod;
        h1[i] = (h1[i] - 1 + mod) % mod;
        h0[i] = (h0[i] - 1 + mod) % mod;
    }
    int x = 1;
    for (int j = 1; j <= tol; j++) {
        while (num[x] < p[j] * p[j]) x++;
        for (int i = tot; i >= x; i--) {
            h1[i] = (h1[i] - 1LL * p[j] * (h1[ID[num[i] / p[j]]] - pre[j - 1]) % mod + mod) % mod;
            h0[i] = (h0[i] - (h0[ID[num[i] / p[j]]] - (j - 1)) % mod + mod) % mod;
        }
    }
}
int main() {
    scanf("%lld", &n);
    get_h();
    printf("%lld\n", (get_g(n, 1) + 1) % mod);
}