luogu P3327 [SDOI2015]约数个数和(rng58-clj等式)
题目大意
设
d
(
x
)
d(x)
d(x)为x的因子的个数,给出N和M求
∑
i
=
1
n
∑
j
=
1
m
d
(
i
,
j
)
\sum_{i=1}^n\sum_{j=1}^md(i,j)
i=1∑nj=1∑md(i,j)
解题思路
根据rng58-clj等式,有
∑
i
=
1
n
∑
j
=
1
m
d
(
i
,
j
)
=
∑
i
=
1
n
∑
j
=
1
m
[
g
c
d
(
i
,
j
)
=
1
]
⌊
n
i
⌋
⌊
m
j
⌋
\sum_{i=1}^n\sum_{j=1}^md(i,j)=\sum_{i=1}^n\sum_{j=1}^m[gcd(i,j)=1]\left\lfloor\frac{n}{i}\right\rfloor\left\lfloor\frac{m}{j}\right\rfloor
i=1∑nj=1∑md(i,j)=i=1∑nj=1∑m[gcd(i,j)=1]⌊in⌋⌊jm⌋
显然对
[
g
c
d
(
i
,
j
)
=
1
]
[gcd(i,j)=1]
[gcd(i,j)=1]可以做反演,再通过改变枚举顺序,可以得到
∑
i
=
1
n
∑
j
=
1
m
d
(
i
,
j
)
=
∑
d
=
1
μ
(
d
)
∑
i
=
1
⌊
n
d
⌋
∑
j
=
1
⌊
m
d
⌋
⌊
n
i
d
⌋
⌊
m
i
d
⌋
\sum_{i=1}^n\sum_{j=1}^md(i,j)=\sum_{d=1}\mu(d)\sum_{i=1}^{\left\lfloor\frac{n}{d}\right\rfloor}\sum_{j=1}^{\left\lfloor\frac{m}{d}\right\rfloor}\left\lfloor\frac{n}{id}\right\rfloor\left\lfloor\frac{m}{id}\right\rfloor
i=1∑nj=1∑md(i,j)=d=1∑μ(d)i=1∑⌊dn⌋j=1∑⌊dm⌋⌊idn⌋⌊idm⌋
预处理出
∑
i
=
1
n
⌊
n
i
⌋
\sum_{i=1}^n\left\lfloor\frac{n}{i}\right\rfloor
∑i=1n⌊in⌋再做整除分块即可
AC代码
// luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;
const int size=5e4+5;
int p[size];bool prime[size];
int mu[size];
int summu[size];
int tot;
typedef long long LL;
LL sum[size];
void init()
{
mu[1]=1;
for(int i=1;i<size;i++) prime[i]=true;
for(int i=2;i<size;i++)
{
if(prime[i])
{
p[++tot]=i;
mu[i]=-1;
}
for(int j=1;j<=tot&&p[j]*i<size;j++)
{
prime[i*p[j]]=false;
if(i%p[j]==0)
{
mu[i*p[j]]=0;
break;
}
else mu[i*p[j]]=-mu[i];
}
}
summu[0]=0;
for(int i=1;i<size;i++) summu[i]=summu[i-1]+mu[i];
memset(sum,0,sizeof(sum));
for(int i=1;i<size;i++)
{
for(int l=1,r;l<=i;l=r+1)
{
r=i/(i/l);
sum[i]+=(r-l+1)*(i/l);
}
}
}
int main()
{
int t;
init();
scanf("%d",&t);
while(t--)
{
int n,m;
scanf("%d%d",&n,&m);
LL ans=0;
if(n<m) swap(n,m);
for(int l=1,r;l<=m;l=r+1)
{
r=n/(n/l);
r=min(r,m/(m/l));
ans+=(summu[r]-summu[l-1])*sum[n/l]*sum[m/l];
}
printf("%lld\n",ans);
}
}