three_trees的blog

牛客-数论之神（引子） bzoj 1257 1968 2956

洛谷-P2257 分析 本题需要前置知识：数论分块，莫比乌斯反演 数论分块，可看https://blog.csdn.net/qq_43101466/article/details/100999784 先介绍一下莫比乌斯函数 μ(n)={1n为1(−1)kk为n的质因子个数0n存在非平方因子 {\displaystyle \mu (n)= {\begin{cases} 1 \quad n为1\\ (...

题意 求 ans=∑i=1A∑j=1B[gcd⁡(i,j)==d]ans = \sum_{i = 1}^{A}\sum_{j = 1}^{B}[\gcd(i, j) == d]ans=∑i=1A​∑j=1B​[gcd(i,j)==d] 分析 我们发现酷似洛谷P2257，题题解链接： https://blog.csdn.net/qq_43101466/article/details/101...

开始推式子 ans=∑x=ab∑y=cd[gcd⁡(x,y)=k] \begin{aligned} ans = \sum_{x=a}^{b}\sum_{y=c}^{d}[\gcd(x,y)=k] \end{aligned} ans=x=a∑b​y=c∑d​[gcd(x,y)=k]​ 还是老套路，我们令 f(k)=∑x=ab∑y=cd[gcd⁡(x,y)=k]f(k)=\sum_{x=a}^{b}...

推式子 ans=∑i=1N∑j=1Mlcm(i,j)=∑i=1N∑j=1Mi∗jgcd⁡(i,j) \begin{aligned} ans = \sum_{i=1}^{N}\sum_{j=1}^{M}lcm(i,j) = \sum_{i=1}^{N}\sum_{j=1}^{M}\frac{i*j}{\gcd(i,j)} \end{aligned} ans=i=1∑N​j=1∑M​lcm(i,j)...

推式子 ans=∑i=ab∑j=cd[gcd⁡(i,j)==1] \begin{aligned} ans= \sum_{i=a}^{b}\sum_{j=c}^{d}[\gcd(i,j)==1] \end{aligned} ans=i=a∑b​j=c∑d​[gcd(i,j)==1]​ 我们给(a,b)(a,b)(a,b)拆成(1,b)−(1,a−1)(1,b)-(1,a-1)(1,b)−(1,a−1...