3944: Sum

题目链接

题目大意：求$\sum \varphi$和$\sum \mu$

题解：杜教筛模板

我的收获：2333

#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
using namespace std;

int cas,n,m,cnt,c[1000005]; ll phi[2000005],mu[2000005],p[100005],q[100005]; bool vis[100005];
ll get_p(int x){
    return (x<=m)?phi[x]:p[n/x];
}
ll get_q(int x){
    return (x<=m)?mu[x]:q[n/x];
}
void solve(int x){
    if (x<=m) return; int i,j=1,t=n/x;
    if (vis[t]) return; vis[t]=1;
    p[t]=((ll)x+1)*x>>1; q[t]=1;
    while (j<x){
        i=j+1; j=x/(x/i); solve(x/i);
        p[t]-=get_p(x/i)*(j-i+1); q[t]-=get_q(x/i)*(j-i+1);
    }
}
int main(){
    scanf("%d",&cas); m=2000000;
    int i,j; phi[1]=mu[1]=1;
    for (i=2; i<=m; i++){
        if (!phi[i]){
            phi[i]=i-1; mu[i]=-1; c[++cnt]=i;
        }
        for (j=1; j<=cnt && i*c[j]<=m; j++)
            if (i%c[j]){
                phi[i*c[j]]=phi[i]*(c[j]-1); mu[i*c[j]]=-mu[i];
            } else{
                phi[i*c[j]]=phi[i]*c[j]; mu[i*c[j]]=0; break;
            }
    }
    for (i=2; i<=m; i++){ phi[i]+=phi[i-1]; mu[i]+=mu[i-1]; }
    while (cas--){
        scanf("%d",&n); memset(vis,0,sizeof(vis));
        if (n<=m) printf("%lld %lld\n",phi[n],mu[n]); else{
            solve((ll)n); printf("%lld %lld\n",p[1],q[1]);
        }
    }
}