题单
字典
DFT：离散傅里叶变换
IDFT：离散傅里叶逆变换
FFT：A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT).
NTT：快速数论变换
MTT：快速毛爷爷变换，毛爷爷对 FFT 的改进以解决任意模数
FWT：快速沃尔什变换
FMT：快速莫比乌斯变换
背包问题
- Luogu P4389 付公主的背包
- https://www.luogu.com.cn/problem/P5339
- Luogu P3784 [SDOI2017] 遗忘的集合 根据方案数结果反推集合中的元素。
- https://atcoder.jp/contests/arc145/editorial/4528
骨牌问题
https://www.luogu.com.cn/problem/P5320
球盒问题
https://www.luogu.com.cn/problem/solution/P5162
https://www.luogu.com.cn/problem/P5824
https://www.luogu.com.cn/problem/P2791
自然数幂和、伯努利数
差分、前缀和
拆分数
- http://acm.hdu.edu.cn/showproblem.php?pid=4651
- https://acm.hdu.edu.cn/showproblem.php?pid=4658
- https://www.luogu.com.cn/problem/solution/P6189
- https://www.luogu.com.cn/problem/P4451
抽卡
Wikipedia, Coupon collector’s problem
Luogu P6633 [ZJOI2020] 抽卡
图论计数
https://www.shuizilong.com/house/archives/graphical-enumeration/
