BZOJ2818 Gcd

莫比乌斯反演

题目传送门

双倍经验

代码：

#include<cctype>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 10000005
#define F inline
using namespace std;
typedef long long LL;
int n,m,t,mu[N],p[N],a[N];
bool f[N]; LL ans;
F char readc(){
    static char buf[100000],*l=buf,*r=buf;
    if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
    return l==r?EOF:*l++;
}
F int _read(){
    int x=0; char ch=readc();
    while (!isdigit(ch)) ch=readc();
    while (isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=readc();
    return x;
}
F void Make(){
    mu[1]=1;
    for (int i=2;i<=n;i++){
        if (!f[i]) p[++p[0]]=i,mu[i]=-1;
        for (int j=1,v;j<=p[0]&&(v=i*p[j])<=n;j++){
            f[v]=true,mu[v]=-mu[i];
            if (!(i%p[j])){ mu[v]=0; break; }
        }
    }
    for (int i=1;i<=n;i++)
        for (int j=1;p[j]*i<=n&&j<=p[0];j++)
            a[i*p[j]]+=mu[i];
    for (int i=1;i<=n;i++) a[i]+=a[i-1];
}
#define sqr(x) ((x)*(x))
int main(){
    n=_read(),Make();
    for (int l=1,r=0;l<=n;l=r+1)
        r=n/(n/l),ans+=sqr((1ll*n/l))*1ll*(a[r]-a[l-1]);
    return printf("%lld\n",ans),0;
}