bzoj2190【线性筛】

好久以前做的题

答案为

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
typedef long long LL;
inline int read()
{
    int f=0,x=0;char c=getchar();
    for (;c<'0'||c>'9';c=getchar()) f=c=='-'?1:0;
    for (;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';
    return f?-x:x;
}
const int N=40010;
int n,pr[N],cnt,phi[N],ans;bool nq[N];
 
int main()
{
    n=read();phi[1]=nq[1]=ans=1;
    if (n<=1) return puts("0"),0;
    for (int i=2;i<n;i++)
    {
        if (!nq[i]) pr[++cnt]=i,phi[i]=i-1;
        for (int j=1,k=i<<1;j<=cnt&&k<n;k=i*pr[++j])
        {
            nq[k]=1;
            if (i%pr[j]) phi[k]=phi[i]*(pr[j]-1);
            else
            {
                phi[k]=phi[i]*pr[j];
                continue;
            }
        }
    }
    for (int i=1;i<n;i++) ans+=phi[i]<<1;
    printf("%d\n",ans);
    return 0;
}