bzoj3994 [SDOI2015]约数个数和

Description

---

设d(x)为x的约数个数，给定N、M，求 $\sum_{i=1}^{n}\sum_{j=1}^{m}d(ij)$

1<=N, M<=50000
1<=T<=50000

Solution

---

首先要知道一个结论：

$$d(nm)=\sum_{i|n}\sum_{j|m}[gcd(i,j)==1]$$
证明可以考虑nm质因数分解得到 $nm={p_1}^{k_1}{p_2}^{k_2}...{p_n}^{k_n}$，约数个数就是 $\prod({k_i}+1)$。这里可以感性地看成是枚举其中某两段互质的

那么有

$$ans=\sum_{i=1}^n\sum_{j=1}^m d(ij)=\sum_{i=1}^n\sum_{j=1}^m \sum_{p|i}\sum_{q|j}[gcd(p,q)==1]$$

回忆一下μ的性质有

$$ans=\sum_{i=1}^n\sum_{j=1}^m \sum_{p|i}\sum_{q|j}\sum_{x|gcd(p,q)}\mu(x)$$
套路一波把x拉出来
$$ans=\sum_{i=1}^n\sum_{j=1}^m \sum_{x|gcd(i,j)}d(\frac{i}{x})d(\frac{j}{x})\mu(x)$$
这里为什么是 $d(\frac{i}{x})$可以考虑转化之前p满足 $x|p$且 $p|i$，那么就是求满足 $xk|i$的k的数量，也即 $k|\frac{i}{x}$的数量
再套路一波继续把x拉出来
$$ans=\sum_{x=1}^{min(n,m)}\mu(x)\sum_{i=1}^{\lfloor \frac{n}{x}\rfloor}d(i)\sum_{j=1}^{\lfloor \frac{m}{x} \rfloor}d(j)$$
可以发现d(x)是积性函数，预处理一波前缀和套分块就ok

Code

---

#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)

typedef long long LL;
const int N=50005;

int e[N+5],prime[N+5],d[N+5],mu[N+5];
bool not_prime[N+5];

void pre_work() {
    mu[1]=1; d[1]=1;
    rep(i,2,N-5) {
        if (!not_prime[i]) {
            prime[++prime[0]]=i;
            mu[i]=-1;
            d[i]=2;
            e[i]=1;
        }
        for (int j=1;j<=prime[0]&&i*prime[j]<=N;j++) {
            not_prime[i*prime[j]]=1;
            if (i%prime[j]==0) {
                mu[i*prime[j]]=0;
                d[i*prime[j]]=d[i]/(e[i]+1)*(e[i]+2);
                e[i*prime[j]]=e[i]+1;
                break;
            }
            mu[i*prime[j]]=-mu[i];
            d[i*prime[j]]=d[i]*d[prime[j]];
            e[i*prime[j]]=1;
        }
    }
    rep(i,1,N) d[i]+=d[i-1];
    rep(i,1,N) mu[i]+=mu[i-1];
}

void solve(int n,int m) {
    if (n>m) std:: swap(n,m);
    LL ans=0;
    for (int i=1,j;i<=n;i=j+1) {
        j=std:: min(n/(n/i),m/(m/i));
        ans+=(LL)((LL)mu[j]-(LL)mu[i-1])*(LL)((LL)d[n/i]*(LL)d[m/i]);
    }
    printf("%lld\n", ans);
}

int main(void) {
    pre_work();
    int T; scanf("%d",&T);
    while (T--) {
        int n,m; scanf("%d%d",&n,&m);
        solve(n,m);
    }
    return 0;
}