题意:
给定l和r,计算莫比乌斯函数第l到第r项的和
数据范围:l,r<=10e10
解法:
∑ i = 1 n μ ( i ) \sum_{i=1}^nμ(i) ∑i=1nμ(i)
令 f = μ ( i ) , g = I = 1 令f=μ(i),g=I=1 令f=μ(i),g=I=1
( f ∗ g ) ( n ) (f*g)(n) (f∗g)(n)
= ∑ d ∣ n μ ( d ) I ( n d ) \sum_{d|n}μ(d)I(\frac nd) ∑d∣nμ(d)I(dn)
= ∑ d ∣ n μ ( d ) \sum_{d|n}μ(d) ∑d∣nμ(d)
=ϵ(n)(这一步是莫比乌斯函数的性质)
=[n==1]
杜教筛选递推式: g ( 1 ) S ( n ) = ∑ i = 1 n ( f ∗ g ) ( i ) − ∑ i = 2 n g ( i ) S ( ⌊ n i ⌋ ) g(1)S(n)=\sum_{i=1}^n(f*g)(i)-\sum_{i=2}^ng(i)S(\lfloor \frac ni \rfloor) g(1)S(n)=∑i=1n(f∗g)(i)−∑i=2ng(i)S(⌊in⌋)
代入得: S ( n ) = 1 − ∑ i = 2 n S ( ⌊ n i ⌋ ) S(n)=1-\sum_{i=2}^nS(\lfloor \frac ni \rfloor) S(n)=1−∑i=2nS(⌊in⌋)
ps:
如果预处理的线性筛范围太小(例如2e5),有的数据点会tle(改成2e6就过了)
code:
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxm=2e6+5;
ll mu[maxm];
ll notprime[maxm];
ll prime[maxm],cnt;
ll sum_mu[maxm];
void init(){
mu[1]=1;
for(int i=2;i<maxm;i++){
if(!notprime[i]){
prime[cnt++]=i;
mu[i]=-1;
}
for(int j=0;j<cnt;j++){
if(prime[j]*i>=maxm)break;
notprime[prime[j]*i]=1;
mu[prime[j]*i]=(i%prime[j]?-mu[i]:0);
if(i%prime[j]==0)break;
}
}
for(int i=1;i<maxm;i++){
sum_mu[i]=sum_mu[i-1]+mu[i];
}
}
map<ll,ll>mp_mu;
ll S_mu(ll x){
if(x<maxm)return sum_mu[x];
if(mp_mu[x])return mp_mu[x];
ll ans=1;
for(ll i=2,j;i<=x;i=j+1){
j=x/(x/i);
ans-=(j-i+1)*S_mu(x/i);
}
return mp_mu[x]=ans;
}
signed main(){
init();
ll l,r;scanf("%lld%lld",&l,&r);
printf("%lld\n",S_mu(r)-S_mu(l-1));
return 0;
}