newhonor

https://www.luogu.org/problemnew/show/P2257学习资料：https://wenku.baidu.com/view/fbec9c63ba1aa8114431d9ac.htmlhttps://wenku.baidu.com/view/fbe263d384254b35eefd34eb.html反思：推公式的做得少，而且莫比乌斯貌似有套路的，主要是会构造...

https://ac.nowcoder.com/acm/contest/874/L题解：https://www.zybuluo.com/yang12138/note/1458963分k==0,奇，偶讨论！~总结：(1)k==0就是n个1相加了；(2)k为奇数就杜教筛例题了；(3) 就是求mu的绝对值和；容斥；因为对与p^2的mu数值是0(定义)所以剔除掉0...

https://www.lydsy.com/JudgeOnline/problem.php?id=2301题意：对于给出的n个询问，每次求有多少个数对(x,y)，满足a≤x≤b，c≤y≤d，且gcd(x,y) = k，gcd(x,y)函数为x和y的最大公约数。反思：除k可以化简 a/k<=x<=b/k, c/k<=y<=d/k, gcd(x,y)==1...

https://www.luogu.org/problemnew/show/P3455莫比乌斯模板题了#include<algorithm>#include<set>#include<vector>#include<queue>#include<cmath>#include<cstring>#incl...

https://www.luogu.org/problemnew/show/P3704继续熟悉莫比乌斯~~#include<algorithm>#include<set>#include<vector>#include<queue>#include<cmath>#include<cstring>...

https://cn.vjudge.net/problem/HDU-1695总结：倍数反演：约数反演：#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include &...

#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#include <set>#include <map>#incl...

https://cn.vjudge.net/problem/Gym-101982B#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...