[51nod][积性函数]莫比乌斯函数之和

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

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 N=4e6;
int s[N+7],mu[N+7];
inline int get(ll x)
{
    if(x<=N) return mu[x];
    if(s[n/x]) return s[n/x];
    ll a,b,ans;
    ans=1;
    for(ll i=2;i<=x;++i)
    {
        a=x/i;
        b=x/a;
        ans-=get(a)*(b-i+1);
        i=b;
    }
    s[n/x]=ans;
    return ans;
}
int fans;
inline void solve(int o)
{
    cin>>n;
    memset(s,0,sizeof(s));
    if(o==-1) --n;
    if(!n) return;
    fans+=get(n)*o;
}
bool is[N+7];
int prime[N+7];
int main()
{
//  freopen("1244.in","r",stdin);
//  freopen(".out","w",stdout);
    mu[1]=1;
    for(int i=2;i<=N;++i)
    {
        if(!is[i]) prime[++prime[0]]=i,mu[i]=-1;
        for(int j=1;j<=prime[0]&&i*prime[j]<=N;++j)
        {
            is[i*prime[j]]=1;
            if(!(i%prime[j])) break;
            mu[i*prime[j]]=-mu[i];
        }
        mu[i]+=mu[i-1];
    }
    solve(-1);
    solve(1);
    cout<<fans;
}