文章目录
Description
求 ∑ i = 1 n ∑ j = 1 n ( i + j ) t μ 2 ( gcd ( i , j ) ) gcd ( i , j ) \sum_{i=1}^n \sum_{j=1}^n (i+j)^t \mu^2(\gcd(i,j)) \gcd(i,j) i=1∑nj=1∑n(i+j)tμ2(gcd(i,j))gcd(i,j)
q q q组询问， t t t为常量， n n n为变量。每个答案都要对 2 32 2^{32} 232取模。 n ≤ 1 0 7 , q ≤ 1 0 4 n≤10^7,q≤10^4 n≤107,q≤104。
时间限制 0.5 s − 1.5 s 0.5s-1.5s 0.5s−1.5s，空间限制256MB
Solution
Part 1: 莫反推式子
一道比较套路的推式子题，中间用到了许多推式子的trick。
∑ i = 1 n ∑ j = 1 n ( i + j ) t μ 2 ( gcd ( i , j ) ) gcd ( i , j ) \sum_{i=1}^n \sum_{j=1}^n (i+j)^t \mu^2(\gcd(i,j)) \gcd(i,j) i=1∑nj=1∑n(i+j)tμ2(gcd(i,j))gcd(i,j)
= ∑ k = 1 n μ 2 ( k ) k ∑ i = 1 n ∑ j = 1 n [ gcd ( i , j ) = k ] ( i + j ) t =\sum_{k=1}^n \mu^2(k)\ k\ \sum_{i=1}^n \sum_{j=1}^n [\gcd(i,j)=k] (i+j)^t =k=1∑nμ2(k) k i=1∑nj=1∑n[gcd(i,j)=k](i+j)t
= ∑ k = 1 n μ 2 ( k ) k t + 1 ∑ i = 1 ⌊ n k ⌋ ∑ j = 1 ⌊ n k ⌋ [ gcd ( i , j ) = 1 ] ( i + j ) t =\sum_{k=1}^n \mu^2(k)\ k^{t+1}\ \sum_{i=1}^{\lfloor \frac n k \rfloor} \sum_{j=1}^{\lfloor \frac n k \rfloor} [\gcd(i,j)=1] (i+j)^t =k=1∑nμ2(k) kt+1 i=1∑⌊kn⌋j=1∑⌊kn⌋[gcd(i,j)=1](i+j)t
= ∑ k = 1 n μ 2 ( k ) k t + 1 ∑ i = 1 ⌊ n k ⌋ ∑ j = 1 ⌊ n k ⌋ ( ∑ d ∣ g c d ( i , j ) μ ( d ) ) ( i + j ) t =\sum_{k=1}^n \mu^2(k)\ k^{t+1}\ \sum_{i=1}^{\lfloor \frac n k \rfloor} \sum_{j=1}^{\lfloor \frac n k \rfloor} (\sum_{d|gcd(i,j)} \mu(d))\ (i+j)^t =k=1∑nμ2(k) kt+1 i=1∑⌊kn⌋j=1∑⌊kn⌋(d∣gcd(i,j)∑μ(d)) (i+j)t
= ∑ k = 1 n μ 2 ( k ) k t + 1 ∑ d = 1 ⌊ n k ⌋ μ ( d ) d t ( ∑ i = 1 ⌊ n k d ⌋ ∑ j = 1 ⌊ n k d ⌋ ( i + j ) t ) ) =\sum_{k=1}^n \mu^2(k)\ k^{t+1}\ \sum_{d=1}^{\lfloor \frac n k \rfloor} \mu(d)\ d^{t}\ (\sum_{i=1}^{\lfloor \frac n {kd} \rfloor} \sum_{j=1}^{\lfloor \frac n {kd} \rfloor} (i+j)^t)) =k=1∑nμ2(k) kt+1 d=1∑
扫一扫
437
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
