BJ 集训测试6 求和

n<=1e9 给定一个模数
现场有13人AC..我..好菜啊
对原式化简
$\sum\limits_{d=1}^{n}d\sum\limits_{i=1}^{n}\sum\limits_{j=1}^{i}\sum\limits_{k=1}^{i} [gcd(i,j,k)==d]$
$\sum\limits_{d=1}^{n}d\sum\limits_{i=1}^{\lfloor\frac{n}{d}\rfloor}\sum\limits_{j=1}^{i}\sum\limits_{k=1}^{i} [gcd(i,j,k)==1]$
$\sum\limits_{d=1}^{n}d\sum\limits_{i=1}^{\lfloor\frac{n}{d}\rfloor}\sum\limits_{j=1}^{i}\sum\limits_{k=1}^{i}\varepsilon(gcd(i,j,k))$
$\sum\limits_{d=1}^{n}d\sum\limits_{i=1}^{\lfloor\frac{n}{d}\rfloor}\sum\limits_{j=1}^{i}\sum\limits_{k=1}^{i}\sum\limits_{d'|gcd(i,j,k)}^{}\mu(d')$
$\sum\limits_{d=1}^{n}d\sum\limits_{d'=1}^{\lfloor\frac{n}{d}\rfloor}\mu(d')\sum\limits_{i=1}^{\lfloor\frac{n}{dd'}\rfloor}\sum\limits_{j=1}^{i}\sum\limits_{k=1}^{i}1$
设D为$d*d'$观察到后面为$\sum\limits_{i=1}^{\lfloor\frac{n}{dd'}\rfloor}i^{2}$
将前半部分替换卷积 后半部分替换公式
$\sum\limits_{D=1}^{n}\sum\limits_{d'|D}^{}\frac{D}{d'}\mu(d')\frac{\lfloor\frac{n}{dd'}\rfloor*(\lfloor\frac{n}{dd'}\rfloor+1)*(2*\lfloor\frac{n}{dd'}\rfloor)}{6}$
$\sum\limits_{D=1}^{n}\varphi(D)\frac{\lfloor\frac{n}{dd'}\rfloor*(\lfloor\frac{n}{dd'}\rfloor+1)*(2*\lfloor\frac{n}{dd'}\rfloor)}{6}$
因为后半部分可以考虑到分块计算所以只需要前半部分前缀和即可 那么杜教筛 预处理欧拉函数的前 2/3使得复杂度降为$n^{\frac{2}{3}}$
顺带学习了发杜教筛 下面乘号部分代表卷积符号
考虑两个积性函数的卷积$(f*g)(n)=h$如何求积性函数前缀和
考虑$\varphi*1=id$
顾前缀和可以表示为$\sum\limits_{i=1}^{n}i=\sum\limits_{i=1}^{n}\sum\limits_{d|i}^{}1(d)*\varphi(\frac{n}{d})$常见套路
$\sum\limits_{i=1}^{n}i=\sum\limits_{d=1}^{n}\sum\limits_{i=1}^{\lfloor\frac{n}{d}\rfloor}\varphi(i)$
设$H[i]$表示$\varphi$的前缀和
那么显然$\frac{n*(n+1)}{2}=\sum\limits_{d=1}^{n}H(\frac{n}{d})$
$\frac{n*(n+1)}{2}-\sum\limits_{d=2}^{n}H(\frac{n}{d})=H(n)$好了剩下部分可以递归搞了

#include<cstdio>
#include<algorithm>
#define ll long long
#define N 1100000
using namespace std;
int prime[N/10],tot,mod,inv6,n;
bool not_prime[N];ll s[N],ans,phi[N];
inline int ksm(int x,int t){
    int tmp=1;for (;t;x=(ll)x*x%mod,t>>=1) if (t&1) tmp=(ll)tmp*x%mod;return tmp;
}
inline ll calc_phi(ll x){
    if (x<=1e6) return phi[x];if (s[n/x]) return s[n/x];
    ll tmp=x*x+x>>1;int last=1;
    for (int i=2;i<=x;i=last+1){
        last=x/(x/i);tmp-=calc_phi(x/i)*(last-i+1);
    }return s[n/x]=tmp;
}
inline int calc(int x){
    return (ll)x*(x+1)%mod*(x<<1|1)%mod*inv6%mod;
}
int main(){
    freopen("sum.in","r",stdin);
    for (int i=2;i<=1e6;++i){
        if (!not_prime[i]) prime[++tot]=i,phi[i]=i-1;   
        for (int j=1;prime[j]*i<=1e6;++j){
            not_prime[i*prime[j]]=1;
            if (i%prime[j]==0){
                phi[i*prime[j]]=prime[j]*phi[i];break;
            }else  phi[i*prime[j]]=phi[i]*phi[prime[j]];
        }
    }scanf("%d%d",&n,&mod);int last=1;inv6=ksm(6,mod-2);
    //for (int i=1;i<=10;++i) printf("%d ",phi[i]);puts("");
    phi[1]=1;for (int i=2;i<=1e6;++i) phi[i]+=phi[i-1];
    for (int i=1;i<=n;i=last+1){
        last=n/(n/i);ll ans1=(calc_phi(last)-calc_phi(i-1))%mod,ans2=calc(n/i);
        ans+=ans1*ans2%mod;ans%=mod;
    //  printf("%lld %lld %lld %d\n",ans,ans1,ans2,i);
    }printf("%lld\n",ans);
    return 0;
}