Stargazer的博客

传送门首先简单莫反后可以得到ans=∑TaTbT∑d∣Tμ(d)f(Td)ans=\sum_{T}\frac a T\frac b T\sum_{d|T}\mu(d)f(\frac{T}{d})ans=T∑​Ta​Tb​d∣T∑​μ(d)f(dT​)=∑TaTbTg(T)=\sum_{T}\frac a T\frac b T g(T)=T∑​Ta​Tb​g(T)考虑怎么求ggg一个显然的...

传送门题意：求∑i=1n∑j=1mlcm(i,j),n,m≤1e7\sum_{i=1}^{n}\sum_{j=1}^{m}lcm(i,j),n,m\le1e7∑i=1n​∑j=1m​lcm(i,j),n,m≤1e7SolutionSolutionSolution考虑到lcmlcmlcm无法处理，我们先变成gcdgcdgcd的形式ans=∑i=1n∑j=1mi∗jgcd(i,j)ans=\...

传送门题意：令F(x)F(x)F(x)表示所有xxx的约数之和求∑i=1n∑j=1m[F(gcd(i,j))≤a]F(gcd(i,j))%231\sum_{i=1}^{n}\sum_{j=1}^{m}[F(gcd(i,j))\le a]F(gcd(i,j))\%2^{31}i=1∑n​j=1∑m​[F(gcd(i,j))≤a]F(gcd(i,j))%231Solution：Soluti...

[$传送门$](https://www.lydsy.com/JudgeOnline/problem.php?id=2820)题意：求∑i=1n∑j=1m[gcd(i,j)=prime]\sum_{i=1}^{n}\sum_{j=1}^{m}[gcd(i,j)=prime]i=1∑n​j=1∑m​[gcd(i,j)=prime]考虑对于每一个质数pppansp=∑d...

传送门题意：求∑i=ab∑j=cd[gcd(i,j)==d]\sum_{i=a}^{b}\sum_{j=c}^{d}[gcd(i,j)==d]∑i=ab​∑j=cd​[gcd(i,j)==d]其实和Zap−QueriesZap-QueriesZap−Queries一样的吧直接看那个的做法就可以了a,ca,ca,c容斥一下就可以了代码#include<bits/stdc++.h&g...