[51nod][数论][积性函数]欧拉函数之和

http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1239

sol:

简单杜教筛

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
using namespace std;
typedef long long ll;

ll n;
inline int read()
{
    char c;
    bool pd=0;
    while((c=getchar())>'9'||c<'0')
    if(c=='-') pd=1;
    int res=c-'0';
    while((c=getchar())>='0'&&c<='9')
    res=(res<<3)+(res<<1)+c-'0';
    return pd?-res:res;
}
const int pyz=1e9+7;
const int N=4e6;
int s[N+7],phi[N+7];
inline int ksm(int s,int t)
{
    int res=1;
    while(t)
    {
        if(t&1) res=(ll)res*s%pyz;
        s=(ll)s*s%pyz;
        t>>=1;
    }
    return res;
}
int inv=ksm(2,pyz-2);
inline int get(ll x)
{
    if(x<=N) return phi[x];
    if(s[n/x]) return s[n/x];
    ll a,b;
    int ans;
    ans=(ll)x%pyz*(x%pyz+1)%pyz*inv%pyz;
    for(ll i=2;i<=x;++i)
    {
        a=x/i;
        b=x/a;
        ans=(ans-(ll)get(a)*(b-i+1)%pyz+pyz)%pyz;
        i=b;
    }
    s[n/x]=ans;
    return ans;
}
bool is[N+7];
int prime[N+7];
int main()
{
//  freopen("1239.in","r",stdin);
//  freopen(".out","w",stdout);
    phi[1]=1;
    for(int i=2;i<=N;++i)
    {
        if(!is[i]) prime[++prime[0]]=i,phi[i]=i-1;
        for(int j=1;j<=prime[0]&&i*prime[j]<=N;++j)
        {
            is[i*prime[j]]=1;
            if(!(i%prime[j]))
            {
                phi[i*prime[j]]=phi[i]*prime[j];
                break;
            }
            phi[i*prime[j]]=phi[i]*(prime[j]-1);
        }
        phi[i]=(phi[i]+phi[i-1])%pyz;
    }
    cin>>n;
    cout<<get(n);
}