∑ni=1∑mj=1gcd(i,j)
∑
i
=
1
n
∑
j
=
1
m
g
c
d
(
i
,
j
)
=∑nd=1d∗f(d)
=
∑
d
=
1
n
d
∗
f
(
d
)
=∑nd=1d∗∑d|jμ(j/d)∗F(d)
=
∑
d
=
1
n
d
∗
∑
d
|
j
μ
(
j
/
d
)
∗
F
(
d
)
=∑i×j<=ni∗μ(j)∗F(i∗j)
=
∑
i
×
j
<=
n
i
∗
μ
(
j
)
∗
F
(
i
∗
j
)
=∑nT=1F(T)∗ϕ(T)
=
∑
T
=
1
n
F
(
T
)
∗
ϕ
(
T
)
=∑nT=1[nT][mT]ϕ(T)
=
∑
T
=
1
n
[
n
T
]
[
m
T
]
ϕ
(
T
)
———-杜教筛:
已知问题:
取一个积性函数g使得f*g方便计算前缀和并做如下变换
就可以得到
后面就是递归计算了,注意要记忆化S