前述:
积性函数最基本的用法:求出每一个f(i) 1<=i<=n,这个只要利用积性函数的性质配合线性筛即可O(n)完成。
积性函数求和常见套路:用线性筛预处理n^(2/3)的前缀和,然后用某些狄里克莱卷积前缀的变形公式,可以推出一些可以在O(N^(1/2))完成的递推,配合记忆化即可搞定大范围的前缀和求值。
例题:
题意:求莫比乌斯函数的区间和,即前缀和(1e10)
利用μ*1=e,对这个式子的前缀和进行变形,可以得到O(N^(1/2))的递推式。注意一些变量要开LL,否则会爆掉
Code:
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = pow(1e10,2.0/3);
int mu[N+1],sum[N+1];
int mini[N+1],tim[N+1];
int prime[N+1],cnt;
map<LL,LL> mem;
LL a,b;
LL power(LL x,LL y){
LL res=1;
while (y){
if (y&1){
res = res*x;
}
x = x*x;
y>>=1;
}
return res;
}
void init(){
mu[1]=1;
sum[1]=1;
for (int i=2;i<N;i++){
if (!mini[i]){
mini[i]=i;
prime[cnt++] =i;
}
for (int j=0;prime[j]<=mini[i]&&1LL*prime[j]*i<N&&j<cnt;j++){
mini[i*prime[j]] = prime[j];
}
if (mini[i]==i){
tim[i]=1;
mu[i] =-1;
}else if (mini[i]!=mini[i/mini[i]]){
tim[i]=1;
mu[i] = mu[mini[i]]*mu[i/mini[i]];
}else{
tim[i] = tim[i/mini[i]]+1;
int t = power(mini[i],tim[i]);
if (i!=t){
mu[i] = mu[i/t]*mu[t];
}else{
mu[i] =0;
}
}
sum[i] = sum[i-1]+mu[i];
}
}
LL mobius(LL x){
if (x<N){
return sum[x];
}
if (mem.count(x)){
return mem[x];
}
LL ans =1;
for (LL i=2,j;j<x;i=j+1){
j = x/(x/i);
ans -= 1LL*mobius(x/i)*(j-i+1);
}
mem[x] =ans;
return ans;
}
void solve(){
cout<<mobius(b)-mobius(a-1)<<endl;
}
int main(){
cin>>a>>b;
init();
solve();
return 0;
}
题意:求欧拉函数前缀和(1e10)
利用φ*1=n,以及此式的前缀和变形可得递推式。由于1e10>MOD=1e9+7,因此需要处处防爆……心塞
Code:
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL N = pow(1e10,2.0/3);
const LL MOD = 1e9+7;
int phi[N],sum[N],prime[N],cnt,mini[N],tim[N];
LL n;
map<LL,LL> mem;
LL power(LL x,LL y){
LL res =1;
while (y){
if (y&1){
res = res*x%MOD;
}
x=x*x%MOD;
y>>=1;
}
return res;
}
void init(){
phi[1]=1;
sum[1]=1;
for (LL i=2;i<N;i++){
if (!mini[i]){
mini[i] =i;
prime[cnt++] =i;
}
for (int j=0;j<cnt&&prime[j]<=mini[i]&&1LL*prime[j]*i<N;j++){
mini[prime[j]*i]=prime[j];
}
if (mini[i]==i){
tim[i] =1;
phi[i] = i-1;
}else if (mini[i]!=mini[i/mini[i]]){
tim[i]=1;
phi[i] = 1LL*phi[mini[i]]*phi[i/mini[i]]%MOD;
}else{
tim[i] = tim[i/mini[i]]+1;
LL t = power(mini[i],tim[i]);
if (i!=t){
phi[i] = 1LL*phi[t]*phi[i/t]%MOD;
}else{
phi[i] = i/mini[i]*(mini[i]-1)%MOD;
}
}
sum[i] = (sum[i-1]+phi[i])%MOD;
}
}
LL calc(LL x){
if (x<N){
return sum[x];
}
if (mem.count(x)){
return mem[x];
}
LL ans = x%MOD*((x+1)%MOD)%MOD*power(2,MOD-2)%MOD;
for (LL i=2,j;i<=x;i=j+1){
j = x/(x/i);
ans = (ans- calc(x/i)*((j-i+1)%MOD)%MOD+MOD)%MOD;
}
return mem[x] =ans;
}
int main(){
init();
cin>>n;
cout<<calc(n)<<endl;
return 0;
}