HDU 5608 function(杜教筛)

function
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1700 Accepted Submission(s): 607

Problem Description
There is a function f(x),which is defined on the natural numbers set N,satisfies the following eqaution

$N^2-3N+2={\sum }_{d|N}f(d)$

calulate ${\sum }_{i=1}^{N}f(i)$ mod 109+7.

Input
the first line contains a positive integer T,means the number of the test cases.

next T lines there is a number N

T≤500,N≤109

only 5 test cases has N>106.

Output
Tlines,each line contains a number,means the answer to the i-th test case.

Sample Input
1
3

Sample Output
2

$1^2-3\ast 1+2=f(1)=0$
$2^2-3\ast 2+2=f(2)+f(1)=0->f(2)=0$
$3^2-3\ast 3+2=f(3)+f(1)=2->f(3)=2$
$f(1)+f(2)+f(3)=2$

题意

有这么一个函数$f(x)$满足
$$N^2-3N+2=\sum _{d|N}f(d)$$
然后求
$$\sum _{i=1}^{n}f(i)mod10^9+7$$

思路

令$g(n)=n^2-3n+2$
那么有$$g(n)=(I\ast f)(n)$$
左边是恒等函数$I$和$f$的狄利克雷卷积，那么根据$I\ast \mu =e$，两边再乘上一个$\mu$，有
$$(\mu \ast g)=(\mu \ast I)\ast f$$
$$(\mu \ast g)=f$$
所以有
$$f(n)=\sum _{d|n}\mu (d)g(\frac{n}{d})$$
那么
$$\sum _{i=1}^{n}f(n)=\sum _{i=1}^n\sum _{d|i}\mu (d)g(\frac{i}{d})$$
当前的含义是枚举$1-n$中每一个i的因子，这个和枚举$1-n$中每一个数的倍数是等价的，那么就有
$$\sum _{i=1}^{n}f(n)=\sum _{d=1}^n\mu (d)\sum _{d|i}g(\frac{i}{d})$$
$$\sum _{i=1}^{n}f(n)=\sum _{d=1}^n\mu (d)\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }g(i)$$
令$S(n)={\sum }_{i=1}^{n}g(i)$则有
$$S(n)=\sum _{i=1}^n{i}^2-3\sum _{i=1}^{n}i+\sum _{i=1}^{n}2$$
$$S(n)=\frac{n(n+1)(2n+1)}{6}-3\frac{n(n+1)}{2}+2n$$
那么原式就有
$$\sum _{i=1}^{n}f(n)=\sum _{d=1}^n\mu (d)S(\lfloor \frac{n}{d}\rfloor )$$

$$\sum _{i=1}^{n}f(n)=\sum _{d=1}^n\mu (d)(\frac{\lfloor \frac{n}{d}\rfloor (\lfloor \frac{n}{d}\rfloor +1)(2\lfloor \frac{n}{d}\rfloor +1)}{6}-3\frac{\lfloor \frac{n}{d}\rfloor (\lfloor \frac{n}{d}\rfloor +1)}{2}+2\lfloor \frac{n}{d}\rfloor )$$
莫比乌斯函数的前缀和就可以用杜教筛求了，和函数就可以用分块来做，提前处理一下6的逆元和2的逆元就可以了

#include<bits/stdc++.h>
using namespace std;
const int N=5e6+5;
const int mod=1e9+7;
const int inv6=166666668;
const int inv2=500000004;
bool vis[N];
int mu[N];
int prime[N];
int cnt;
void init()
{
    cnt=0;
    mu[1]=1;
    for(int i=2;i<N;i++)
    {
        if(!vis[i])
        {
            prime[cnt++]=i;
            mu[i]=-1;
        }
        for(int j=0;j<cnt&&i*prime[j]<=N;j++)
        {
            vis[i*prime[j]]=1;
            if(i%prime[j]==0)
            {
                mu[i*prime[j]]=0;
                break;
            }
            else
                mu[i*prime[j]]=-mu[i];
        }
    }
    for(int i=2;i<N;i++)
        mu[i]=mu[i-1]+mu[i];
}
unordered_map<int,int>S;
int Sum(int n)
{
    if(n<N) return mu[n];
    else if(S.find(n)!=S.end())return S[n];
    int ans=1;
    for(int i=2,last;i<=n;i=last+1)
    {
        last=n/(n/i);
        ans=ans-(last-i+1)*Sum(n/i);
    }
    S[n]=ans;
    return ans;
}

int main()
{
    init();
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        long long ans=0;
        for(int i=1,last;i<=n;i=last+1)
        {
            last=n/(n/i);
            long long m=n/i;
            ans=(ans+(Sum(last)-Sum(i-1)+mod)%mod*(m*(m+1)%mod*(2*m%mod+1)%mod*inv6%mod-3*m%mod*(m+1)%mod*inv2%mod+2*m%mod+mod)%mod)%mod;
        }
        printf("%lld\n",ans);
    }
    return 0;
}