[杂题 数论] BZOJ2705: [SDOI2012]Longge的问题

就是求 $(\phi *id)(n)$ 的值。直接暴力。

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N=100000;
LL n,ans;
int p[N+5];
bool vis[N+5];
void get_P(){
    for(int i=2;i<=N;i++){
        if(!vis[i]) p[++p[0]]=i;
        for(int j=1;j<=p[0]&&(LL)i*p[j]<=N;j++){
            vis[i*p[j]]=true;
            if(i%p[j]==0) break;
        }
    }
}
LL phi(LL x){
    LL res=x,t=x,sqrt_x=sqrt(x);
    for(int i=1;i<=p[0]&&(LL)p[i]<=sqrt_x&&t>1;i++) if(t%p[i]==0){
        while(t%p[i]==0) t/=p[i];
        res=res/p[i]*(p[i]-1);
    }
    if(t>1) res=res/t*(t-1);
    return res;
}
int main(){
    freopen("bzoj2705.in","r",stdin);
    freopen("bzoj2705.out","w",stdout);
    get_P();
    scanf("%lld",&n);
    for(LL i=1;i*i<=n;i++) if(n%i==0){
        ans+=i*phi(n/i);
        if(i*i!=n) ans+=(n/i)*phi(i);
    }
    printf("%lld\n",ans);
    return 0;
}