题目描述:
求
∑
i
=
1
N
∑
j
=
1
N
max
(
i
,
j
)
⋅
σ
(
i
⋅
j
)
m
o
d
1
0
9
+
7
\sum_{i=1}^N\sum_{j=1}^N\max(i,j)\cdot\sigma(i\cdot j)~\mod 10^9+7
i=1∑Nj=1∑Nmax(i,j)⋅σ(i⋅j) mod109+7
其中
σ
(
i
⋅
j
)
\sigma(i\cdot j)
σ(i⋅j)表示
i
⋅
j
i\cdot j
i⋅j的约数之和,多组数据,
N
≤
1000000
,
T
≤
50000
N\le1000000,T\le50000
N≤1000000,T≤50000
题目分析:
∑
i
=
1
N
∑
j
=
1
N
max
(
i
,
j
)
⋅
σ
(
i
⋅
j
)
=
2
(
∑
i
=
1
N
i
∑
j
=
1
i
σ
(
i
⋅
j
)
)
−
∑
i
=
1
N
i
⋅
σ
(
i
2
)
\begin{aligned}&\sum_{i=1}^N\sum_{j=1}^N\max(i,j)\cdot\sigma(i\cdot j)\\ =&2\left(\sum_{i=1}^Ni\sum_{j=1}^i\sigma(i\cdot j)\right)-\sum_{i=1}^Ni\cdot\sigma(i^2) \end{aligned}
=i=1∑Nj=1∑Nmax(i,j)⋅σ(i⋅j)2(i=1∑Nij=1∑iσ(i⋅j))−i=1∑Ni⋅σ(i2)
记上式大括号里的式子为
F
(
N
)
F(N)
F(N),减号后面的式子为
G
(
N
)
G(N)
G(N)
F
(
N
)
=
∑
i
=
1
N
i
∑
j
=
1
i
σ
(
i
⋅
j
)
=
∑
i
=
1
N
i
∑
j
=
1
i
∑
x
∣
i
∑
y
∣
j
[
(
x
,
y
)
=
=
1
]
x
∗
j
/
y
=
∑
k
=
1
N
μ
(
k
)
∑
i
=
1
⌊
N
k
⌋
i
k
∑
j
=
1
i
∑
x
∣
i
∑
y
∣
j
x
k
∗
j
k
/
(
y
k
)
=
∑
k
=
1
N
μ
(
k
)
k
2
∑
i
=
1
⌊
N
k
⌋
i
∑
j
=
1
i
∑
x
∣
i
x
∑
j
∣
y
j
y
=
∑
k
=
1
N
μ
(
k
)
k
2
∑
i
=
1
⌊
N
k
⌋
i
⋅
σ
(
i
)
∑
j
=
1
i
σ
(
j
)
\begin{aligned}F(N)&=\sum_{i=1}^Ni\sum_{j=1}^i\sigma(i\cdot j)\\ &=\sum_{i=1}^Ni\sum_{j=1}^i\sum_{x|i}\sum_{y|j}[(x,y)==1]x*j/y\\ &=\sum_{k=1}^N\mu(k)\sum_{i=1}^{\lfloor\frac Nk\rfloor}ik\sum_{j=1}^i\sum_{x|i}\sum_{y|j}xk*jk/(yk)\\ &=\sum_{k=1}^N\mu(k)k^2\sum_{i=1}^{\lfloor\frac Nk\rfloor}i\sum_{j=1}^i\sum_{x|i}x\sum_{j|y}\frac jy\\ &=\sum_{k=1}^N\mu(k)k^2\sum_{i=1}^{\lfloor\frac Nk\rfloor}i\cdot\sigma(i)\sum_{j=1}^i\sigma(j) \end{aligned}
F(N)=i=1∑Nij=1∑iσ(i⋅j)=i=1∑Nij=1∑ix∣i∑y∣j∑[(x,y)==1]x∗j/y=k=1∑Nμ(k)i=1∑⌊kN⌋ikj=1∑ix∣i∑y∣j∑xk∗jk/(yk)=k=1∑Nμ(k)k2i=1∑⌊kN⌋ij=1∑ix∣i∑xj∣y∑yj=k=1∑Nμ(k)k2i=1∑⌊kN⌋i⋅σ(i)j=1∑iσ(j)
看起来可以上杜教筛了,然而多组数据会T,N<=1000000,直接
O
(
n
ln
n
)
O(n\ln n)
O(nlnn)预处理然后
O
(
1
)
O(1)
O(1)回答询问反而是更好的方式:
F
(
N
)
=
∑
k
=
1
N
∑
i
∣
k
μ
(
k
i
)
⋅
(
k
i
)
2
⋅
i
⋅
σ
(
i
)
∑
j
=
1
i
σ
(
j
)
F(N)=\sum_{k=1}^N\sum_{i|k}\mu(\frac ki)\cdot(\frac ki)^2\cdot i\cdot\sigma(i)\sum_{j=1}^i\sigma(j)
F(N)=k=1∑Ni∣k∑μ(ik)⋅(ik)2⋅i⋅σ(i)j=1∑iσ(j)
枚举
i
i
i对
k
k
k做贡献然后前缀和一下就可以了。
G
(
N
)
G(N)
G(N)是类似的处理方式,将
σ
(
i
2
)
\sigma(i^2)
σ(i2)展开为
∑
x
∣
i
∑
y
∣
i
[
(
x
,
y
)
=
=
1
]
x
∗
i
/
y
\sum_{x|i}\sum_{y|i}[(x,y)==1]x*i/y
∑x∣i∑y∣i[(x,y)==1]x∗i/y,最终可以得到:
G
(
N
)
=
∑
k
=
1
N
∑
i
∣
k
μ
(
k
i
)
⋅
(
k
i
)
2
⋅
i
⋅
σ
2
(
i
)
G(N)=\sum_{k=1}^N\sum_{i|k}\mu(\frac ki)\cdot(\frac ki)^2\cdot i\cdot\sigma^2(i)
G(N)=k=1∑Ni∣k∑μ(ik)⋅(ik)2⋅i⋅σ2(i)
Code:
#include<bits/stdc++.h>
#define maxn 1000005
using namespace std;
const int mod = 1e9+7;
int T,n,p[maxn/8],mu[maxn],sig[maxn],mps[maxn],ss[maxn],F[maxn],G[maxn];
bool v[maxn];
void Prime(const int N){
mu[1]=sig[1]=1;int m=0;
for(int i=2;i<=N;i++){
if(!v[i]) p[++m]=i,mu[i]=-1,sig[i]=mps[i]=i+1;
for(int j=1,k;j<=m&&((k=i*p[j])<=N);j++){
v[k]=1;
if(i%p[j]==0) {sig[k]=sig[i]/mps[i]*(mps[k]=mps[i]*p[j]+1);break;}
sig[k]=sig[i]*(mps[k]=p[j]+1),mu[k]=-mu[i];
}
}
for(int i=1;i<=N;i++) ss[i]=(ss[i-1]+sig[i])%mod;
for(int i=1;i<=N;i++)
for(int j=1,k=i;k<=N;k+=i,j++) if(mu[j]){
int tmp=1ll*mu[j]*j*j%mod*i%mod*sig[i]%mod;
F[k]=(F[k]+1ll*tmp*ss[i])%mod,
G[k]=(G[k]+1ll*tmp*sig[i])%mod;
}
for(int i=1;i<=N;i++) F[i]=(F[i]+F[i-1])%mod,G[i]=(G[i]+G[i-1])%mod;
}
int main()
{
Prime(maxn-5);
scanf("%d",&T);
for(int t=1;t<=T;t++) scanf("%d",&n),printf("Case #%d: %d\n",t,(2ll*F[n]-G[n]+3ll*mod)%mod);
}