【BZOJ 3944】sum 杜教筛

最新推荐文章于 2020-09-19 00:25:36 发布

pbihao

最新推荐文章于 2020-09-19 00:25:36 发布

阅读量258

点赞数

分类专栏： ac之路 bzoj 数学

本文链接：https://blog.csdn.net/pbihao/article/details/55506322

版权

ac之路同时被 3 个专栏收录

303 篇文章 0 订阅

订阅专栏

bzoj

236 篇文章 0 订阅

订阅专栏

数学

30 篇文章 0 订阅

订阅专栏

求 $\sum\limits_{k = 1}^n {fk}$ 令 $gn = \sum\limits_{d|n}^{} {fd}$
设

F n = \sum i = 1 n f i G n = \sum i = 1 n g n

$\begin{array}{l} Fn = \sum\limits_{i = 1}^n {fi} \\ Gn = \sum\limits_{i = 1}^n {gn} \end{array}$

G n = \sum k = 1 n \sum d | k f d = \sum d = 1 n \sum d | k f d = \sum d = 1 n ⌊ n d ⌋ f d = \sum d = 1 n F ⌊ n d ⌋ = F n + \sum d = 2 n F ⌊ n d ⌋

$\begin{array}{l} {\rm{Gn = }}\sum\limits_{{\rm{k = 1}}}^{\rm{n}} {\sum\limits_{{\rm{d|k}}}^{} {{\rm{fd}}} } \\ {\rm{ = }}\sum\limits_{{\rm{d = 1}}}^{\rm{n}} {\sum\limits_{{\rm{d|k}}}^{} {{\rm{fd}}} } \\ {\rm{ = }}\sum\limits_{{\rm{d = 1}}}^{\rm{n}} {\left\lfloor {\frac{{\rm{n}}}{{\rm{d}}}} \right\rfloor {\rm{fd}}} \\ {\rm{ = }}\sum\limits_{{\rm{d = 1}}}^{\rm{n}} {{\rm{F}}\left\lfloor {\frac{{\rm{n}}}{{\rm{d}}}} \right\rfloor } \\ {\rm{ = Fn + }}\sum\limits_{{\rm{d = 2}}}^{\rm{n}} {{\rm{F}}\left\lfloor {\frac{{\rm{n}}}{{\rm{d}}}} \right\rfloor } \end{array}$
如果能快速求出Gn就能过记忆化搜索得到fn
莫比乌斯函数中
e(n)=n==1?1:0所以G(n)=1
欧拉函数中

id(n)=∑i|nφ(i) $id(n) = \sum\limits_{i|n}^{} {\varphi (i)}$ 所以

G(n)=∑i=1n∑d|iφ(d)=∑i=1nid(i)=n∗(n+1)2 $G(n) = \sum\limits_{i = 1}^n {\sum\limits_{d|i}^{} {\varphi (d) = } } \sum\limits_{i = 1}^n {id(i) = \frac{{n*(n + 1)}}{2}}$

#include<cstdio>
#include<cstring>
#include<iostream>
#define LL long long
#define maxn 6500010
using namespace std;
int pri[maxn],cnt,T,vu[100011],vp[100011],tim;
LL mu[maxn],phi[maxn],su[100011],sp[100011],n;
void pre(){
    mu[1]=phi[1]=1;
    for(int i=2;i<maxn;i++){
        if(!phi[i])phi[i]=i-1,mu[i]=-1,pri[++cnt]=i;
        for(int j=1;j<=cnt&&pri[j]*i<maxn;j++){
            mu[i*pri[j]]=-mu[i];
            phi[i*pri[j]]=phi[i]*phi[pri[j]];
            if(i%pri[j]==0){
                mu[i*pri[j]]=0;phi[i*pri[j]]=phi[i]*pri[j];
                break;
            }
        }
    }
    for(int i=2;i<maxn;i++)phi[i]+=phi[i-1],mu[i]+=mu[i-1];
}
LL solve1(LL x){
    if(x<maxn)return phi[x];
    if(vp[n/x]==tim)return sp[n/x];
        LL ans=x*(x+1)/2ll;
    for(LL j,i=2;i<=x;i=j+1){
        j=x/(x/i);ans-=(j-i+1)*solve1(x/i);
    }vp[n/x]=tim;
    return sp[n/x]=ans;
}
LL solve2(LL x){
    if(x<maxn)return mu[x];
    if(vu[n/x]==tim)return su[n/x];
    LL ans=1ll;
    for(LL j,i=2;i<=x;i=j+1){
        j=x/(x/i);ans-=(j-i+1)*solve2(x/i);
    }vu[n/x]=tim;
    return su[n/x]=ans;
}
int main(){
    pre();
    scanf("%d",&T);
    while(T--){
        scanf("%lld",&n);
        tim++;
        printf("%lld %lld\n",solve1(n),solve2(n));
    }
    return 0;
}