莫比乌斯反演杂题题解

一个小结论

$$\lfloor \frac{a}{xy}\rfloor =\lfloor \frac{\lfloor \frac{a}{x}\rfloor }{y}\rfloor$$

证明：

设
$$\begin{gathered} a=x{t}_1+b_1 \\ {t}_1=y{t}_2+b_2 \\ a=xy{t}_2+x{b}_2+b_1 \\ a=xy{t}_3+b_3 \end{gathered}$$
令$b_1,b_2$最大，即$b_1=x-1,b_2=y-1$，则$x{b}_2+b_1=xy-1<xy$，故得证。

P4450 双亲数

题意：

给出$A,B,D(A,B,D\le 100000)$,求${\sum }_{a=1}^A{\sum }_{b=1}^B(gcd(a,b)==D)$

solution：

$$\begin{array}{rl}& \sum _{i=1}^A\sum _{j=1}^B[gcd(i,j)==D]\\ =& \sum _{i=1}^{\lfloor \frac{A}{D}\rfloor }\sum _{j=1}^{\lfloor \frac{B}{D}\rfloor }[gcd(i,j)==1]\\ =& \sum _{i=1}^{\lfloor \frac{A}{D}\rfloor }\sum _{j=1}^{\lfloor \frac{B}{D}\rfloor }\sum _{d|gcd(i,j)}\mu (d)\\ =& \sum _{d=1}^{min(\lfloor \frac{A}{D}\rfloor ,\lfloor \frac{B}{D}\rfloor )}\sum _{i=1}^{\lfloor \frac{A}{D}\rfloor }\sum _{j=1}^{\lfloor \frac{B}{D}\rfloor }[d|i,d|j]\mu (d)\\ =& \sum _{d=1}^{min(\lfloor \frac{A}{D}\rfloor ,\lfloor \frac{B}{D}\rfloor )}\lfloor \frac{A}{Dd}\rfloor \lfloor \frac{B}{Dd}\rfloor \mu (d)\end{array}$$

直接$O(n)$枚举$d$即可

代码：

#include<bits/stdc++.h>
using namespace std;
#define N 1000000 + 200
int A,B,mxA,mxB,d;
int mu[N],pri[N];
long long pre[N];
bool flg[N];
void getmu()
{
    int mx = 1000000,tot = 0;
    mu[1] = 1;
    for(int i = 2;i <= mx;i ++)
    {
        if(!flg[i])
            pri[++ tot] = i,mu[i] = -1;
        for(int j = 1;i * pri[j] <= mx && j <= tot;j ++)
        {
            flg[i * pri[j]] = 1;
            if(i % pri[j] == 0)
            {
                mu[i * pri[j]] = 0; 
                break;
            }
            mu[i * pri[j]] = -mu[i];
        }
    }
}
int f(int l,int r)
{
    return pre[r] - pre[l - 1];
}
void block(int st, int ed)
{
    int R = 0;
    long long ans = 0;
    for (int i = st; i <= ed; i = R + 1)
    {
        R = min(mxB / (mxB / i),mxA / (mxA / i));
        ans += 1ll * f(i,R) * (mxA / i) * (mxB / i);
    }
    printf("%lld\n",ans);
} 
int main()
{

    scanf("%d %d %d",&A,&B,&d);
    mxA = A / d,mxB = B / d;
    getmu();
    for(int i = 1;i <= min(mxA,mxB);i ++)
        pre[i] = pre[i - 1] + mu[i];
    block(1,min(mxA,mxB));
}

P2522 [HAOI2011]Problem b

题意：

对于给出的$n(n\le 50000)$个询问，每次询问给出$a,b,c,d(a,b,c,d\le 50000)$，每次求有多少个数对 $(x,y)$，满足 $a\le x\le b$，$c\le y\le d$，且$gcd(x,y)=k$

solution：

题目要求的式子是：
$$\sum _{i=a}^b\sum _{j=c}^d[gcd(i,j)==k]$$
可以稍微转化一下，使得原式为
$$\sum _{i=1}^b\sum _{j=1}^d[gcd(i,j)==k]-\sum _{i=1}^{a-1}\sum _{j=1}^d[gcd(i,j)==k]-\sum _{i=1}^b\sum _{j=1}^{c-1}[gcd(i,j)==k]+\sum _{i=1}^{a-1}\sum _{j=1}^{c-1}[gcd(i,j)==k]$$
将下式代入即可。
$$\sum _{i=1}^A\sum _{j=1}^B[gcd(i,j)==D]=\sum _{d=1}^{min(\lfloor \frac{A}{D}\rfloor ,\lfloor \frac{B}{D}\rfloor )}\lfloor \frac{A}{Dd}\rfloor \lfloor \frac{B}{Dd}\rfloor \mu (d)$$
但是暴力枚举$d$是会超时的，可以用整除分块来优化。

具体实现时，每次取$\lfloor \frac{A}{Dd}\rfloor$下一个右边界与$\lfloor \frac{B}{Dd}\rfloor$下一个右边界中较小的作为下一个有边界即可。

代码

#include<bits/stdc++.h>
using namespace std;
#define N 1000000 + 200
int A,B,C,D,k;
int mu[N],pri[N];
long long pre[N];
bool flg[N];
void getmu()
{
    int mx = 1000000,tot = 0;
    mu[1] = 1;
    for(int i = 2;i <= mx;i ++)
    {
        if(!flg[i])
            pri[++ tot] = i,mu[i] = -1;
        for(int j = 1;i * pri[j] <= mx && j <= tot;j ++)
        {
            flg[i * pri[j]] = 1;
            if(i % pri[j] == 0)
            {
                mu[i * pri[j]] = 0; 
                break;
            }
            mu[i * pri[j]] = -mu[i];
        }
    }
}
int f(int l,int r)
{
    return pre[r] - pre[l - 1];
}
long long block(int st, int ed, int num1,int num2) {
    int R = 0;//块的右边界
    long long ans = 0;
    for (int i = st; i <= ed; i = R + 1)
    {
        R = min(num1 / (num1 / i),num2 / (num2 / i));
        ans += 1ll * f(i,R) * (num1 / i) * (num2 / i);
    }
    return ans;
} 
void solve()
{
    scanf("%d %d %d %d %d",&A,&B,&C,&D,&k);
    int mxA = B / k,mnA = (A - 1) / k,mxB = D / k,mnB = (C - 1) / k;
    long long ans = 0;
    ans = block(1,min(mxA,mxB),mxA,mxB) - block(1,min(mxA,mnB),mxA,mnB) - block(1,min(mnA,mxB),mnA,mxB) + block(1,min(mnA,mnB),mnA,mnB);
    printf("%lld\n",ans); 
}
int main()
{

    getmu();
    for(int i = 1;i <= 100000;i ++)
        pre[i] = pre[i - 1] + mu[i];
    int T;
    scanf("%d",&T);
    while(T --)
        solve();
}

P3327 [SDOI2015]约数个数和

题意：

设$d(x)$为$x$的约数个数，$T$组数据，每组数据给定$n,m(n,m\le 50000)$，求:
$$\sum _{i=1}^n\sum _{j=1}^{m}d(ij)$$

solution:

有一个小结论：$d(ij)={\sum }_{x|i}{\sum }_{y|j}[gcd(x,y)=1]$

原式可化为下式
$$\sum _{i=1}^n\sum _{j==1}^m\sum _{x|i}\sum _{y|j}[gcd(x,y)==1]$$
改变求和顺序可得
$$\sum _{x=1}^n\sum _{y=1}^m\lfloor \frac{n}{x}\rfloor \lfloor \frac{m}{y}\rfloor [gcd(x,y)==1]=\sum _{i=1}^n\sum _{j=1}^m\lfloor \frac{n}{i}\rfloor \lfloor \frac{m}{j}\rfloor [gcd(i,j)==1]$$
已知
$$[gcd(i,j)=1]=\epsilon (gcd(i,j))=\sum _{d|gcd(i,j)}\mu (d)$$
代入可得
$$\sum _{i=1}^n\sum _{j=1}^m\lfloor \frac{n}{i}\rfloor \lfloor \frac{m}{j}\rfloor \sum _{d|gcd(i,j)}\mu (d)$$
转化一下可得
$$\sum _{d=1}^{min(n,m)}\sum _{i=1}^n\sum _{j=1}^m\lfloor \frac{n}{i}\rfloor \lfloor \frac{m}{j}\rfloor \left[d|i,d|j\right]\mu (d)$$
令$i,j$枚举$d$的倍数，可以将$[d|i,d|j]$这个条件给去掉
$$\sum _{d=1}^{min(n,m)}\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }\lfloor \frac{n}{di}\rfloor \lfloor \frac{m}{dj}\rfloor \mu (d)$$
故原式等于
$$\sum _{d=1}^{min(n,m)}\mu (d)\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\lfloor \frac{n}{di}\rfloor \sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }\lfloor \frac{m}{dj}\rfloor$$
令
$$f(x)=\sum _{i=1}^x\lfloor \frac{x}{i}\rfloor$$
由于
$$\lfloor \frac{a}{xy}\rfloor =\lfloor \frac{\lfloor \frac{a}{x}\rfloor }{y}\rfloor$$
则原式等于
$$\sum _{d=1}^{min(n,m)}\mu (d)f(\lfloor \frac{n}{d}\rfloor )f(\lfloor \frac{m}{d}\rfloor )$$
$f$可以预处理后$O(1)$求得，整除分块处理，时间复杂度为$O(T\sqrt{n})$

代码

#include<bits/stdc++.h>
using namespace std;
#define N 50000 + 200
long long mu[N];
int flg[N],pri[N];
long long f[N];
void getMu(int mx) 
{
    int tot = 0;
    mu[1] = 1;
    for (int i = 2; i <= mx; ++i)
    {
        if (!flg[i]) 
            pri[++tot] = i, mu[i] = -1;
        for (int j = 1; j <= tot && i * pri[j] <= mx; ++j)
        {
            flg[i * pri[j]] = 1;
            if (i % pri[j] == 0) {
                mu[i * pri[j]] = 0;
                break;
            }
            mu[i * pri[j]] = -mu[i];
        }
    }
    for(int i = 1;i <= mx;i ++)
        mu[i] += mu[i - 1];
}
void block(int st, int ed, int num) {
    int R = 0;
    int ans = 0;
    ed = min(ed, num);
    for (int i = st; i <= ed; i = R + 1) {
        R = min(ed,num / (num / i));
        ans += (R - i + 1) * (num / i);
    }
    f[num] = ans;
}
void Block(int st, int ed, int num1,int num2)
{
    int R = 0;
    long long ans = 0;
    for (int i = st; i <= ed; i = R + 1) {
        R = min(num1 / (num1 / i),num2 / (num2 / i));
        ans += (mu[R] - mu[i - 1]) * f[num1 / i] * f[num2 / i];
    }
   printf("%lld\n",ans);
} 
void solve()
{
    int n,m;
    scanf("%d %d",&n,&m);
    Block(1,min(n,m),n,m);
}
int main()
{

    int T;
    scanf("%d",&T);
    getMu(50000);
    for(int i = 1;i <= 50000;i ++)
        block(1,i,i);
    while(T --)
        solve();

}

P3911 最小公倍数之和

题意：

给出$N$个数$A_1,A_2...,A_N$，求${\sum }_{i=1}^N{\sum }_{j=1}^{N}lcm(A_i,A_j),(A_i\le 5e4,N\le 5e4)$

solution：

令$c_i$表示$i$出现的次数，$n$为出现过的最大的数字
$$\sum _{i=1}^n\sum _{j=1}^n{c}_i\times c_j\times \mathrm{lcm}(i,j)$$

$$\sum _{i=1}^n\sum _{j=1}^n{c}_i\times c_j\times \frac{ij}{\gcd (i,j)}$$

$$\sum _{k=1}^n\sum _{i=1}^n\sum _{j=1}^n[gcd(i,j)==k]\times c_i\times c_j\times \frac{i\times j}{k}$$

$$\sum _{k=1}^n\sum _{i=1}^{\lfloor \frac{n}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{k}\rfloor }[gcd(i,j)==1]\times c_{ik}\times c_{jk}\times i\times j\times k$$

$$\sum _{k=1}^n\sum _{i=1}^{\lfloor \frac{n}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{k}\rfloor }\sum _{d|gcd(i,j)}\mu (d)\times c_{ik}\times c_{jk}\times i\times j\times k$$

$$\sum _{k=1}^n\sum _{d=1}^{\lfloor \frac{n}{k}\rfloor }\sum _{i=1}^{\lfloor \frac{n}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{k}\rfloor }[d|i,d|j]\times \mu (d)\times c_{ik}\times c_{jk}\times i\times j\times k$$

$$\sum _{k=1}^n\sum _{d=1}^{\lfloor \frac{n}{k}\rfloor }\mu (d)\times k\times d^2\sum _{i=1}^{\lfloor \frac{n}{kd}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{kd}\rfloor }{c}_{ikd}\times c_{jkd}\times i\times j$$

$$\sum _{k=1}^n\sum _{d=1}^{\lfloor \frac{n}{k}\rfloor }\mu (d)\times k\times d^2(\sum _{i=1}^{\lfloor \frac{n}{kd}\rfloor }{c}_{ikd}\times i{)}^2$$

令$T=kd$
$$\sum _{k=1}^n\sum _{kd=1}^n\mu (d)\times k\times d^2(\sum _{i=1}^{\lfloor \frac{n}{T}\rfloor }{c}_{iT}\times i{)}^2$$

$$\sum _{T=1}^{n}T(\sum _{d|T}\mu (d)\times d)(\sum _{i=1}^{\lfloor \frac{n}{T}\rfloor }{c}_{iT}\times i{)}^2$$

预处理第一个括号，第二个括号可以暴力算，时间复杂度是$O({\sum }_{i=1}^n\frac{n}{i})$，即$O(n\ln n)$

代码：

#include<bits/stdc++.h>
using namespace std;
#define N 50000 + 200
int mu[N];
int flg[N],pri[N],cnt[N];
long long f[N];
long long ans;
void getMu(int mx) 
{
    int tot = 0;
    mu[1] = 1;
    for (int i = 2; i <= mx; ++i)
    {
        if (!flg[i]) 
            pri[++tot] = i, mu[i] = -1;
        for (int j = 1; j <= tot && i * pri[j] <= mx; ++j)
        {
            flg[i * pri[j]] = 1;
            if (i % pri[j] == 0) {
                mu[i * pri[j]] = 0;
                break;
            }
            mu[i * pri[j]] = -mu[i];
        }
    }
    for(int i = 1;i <= mx;i ++)
        for(int j = i;j <= mx;j += i)
            f[j] += mu[i] * i;
}
int main()
{

    getMu(50000);
    int n,mx = 0;
    scanf("%d",&n);
    for(int i = 1;i <= n;i ++)
    {
        int x;
        scanf("%d",&x);
        cnt[x] ++;
        mx = max(mx,x);
    }
    n = mx;
    for(int i = 1;i <= n;i ++)
    {
        long long tmp = 0;
        for(int j = 1;j <= n / i;j ++)
            tmp += cnt[i * j] * j;
        ans += i * f[i] * tmp * tmp;
    }
    printf("%lld\n",ans);
}