bzoj 4805 欧拉函数求和

最新推荐文章于 2023-09-21 23:55:55 发布

elijahqi

最新推荐文章于 2023-09-21 23:55:55 发布

阅读量171

点赞数

分类专栏：杜教筛

本文链接：https://blog.csdn.net/elijahqi/article/details/80215118

版权

杜教筛专栏收录该内容

4 篇文章 0 订阅

订阅专栏

http://www.elijahqi.win/archives/3309
Description
给出一个数字N，求sigma(phi(i)),1<=i<=N

Input
正整数N。N<=2*10^9

Output
输出答案。

Sample Input
10
Sample Output
32
HINT

Source

By FancyCoder
公式
$\sum\limits_{i=1}^{n}i=\sum\limits_{i=1}^{n}\sum\limits_{d|n} 1(d)\times\varphi(\frac{n}{d})$
$\frac{n*(n-1)}{2}=\sum\limits_{d=1}^{n}\sum\limits_{i=1}^{\frac{n}{d}}\varphi(i)$
然后就是很套路的了把后半段设成要求的把n=1提取出来算即可

#include<cstdio>
#include<cctype>
#include<algorithm>
#define ll long long
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(!isdigit(ch)) {if (ch=='-') f=-1;ch=gc();}
    while(isdigit(ch)) x=x*10+ch-'0',ch=gc();
    return x*f;
}
const int N=2e6+20;
ll phi[N],s[N];int n,prime[N],tot;bool not_prime[N];
inline ll calc(int x){
    if (x<=2e6) return phi[x];if (s[n/x]) return s[n/x];
    ll tmp=(ll)x*x+x>>1;int last;
    for (int i=2;i<=x;i=last+1){
        last=x/(x/i);
        tmp-=(last-i+1)*calc(x/i);
    }return s[n/x]=tmp;
}
int main(){
    freopen("bzoj4805.in","r",stdin);
    for (int i=2;i<=2e6;++i){
        if (!not_prime[i]) prime[++tot]=i,phi[i]=i-1;
        for (int j=1;prime[j]*i<=2e6;++j){
            not_prime[prime[j]*i]=1;
            if (i%prime[j]==0){
                phi[prime[j]*i]=phi[i]*prime[j];break;
            }else phi[prime[j]*i]=phi[i]*phi[prime[j]];
        }
    }phi[1]=1;
    for (int i=2;i<=2e6;++i) phi[i]+=phi[i-1];
    n=read();
    printf("%lld\n",calc(n));
    return 0;
}