某島

… : "…アッカリ~ン . .. . " .. .
September 22, 2021

Note on 多項式

題單

字典

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:快速莫比烏斯變換

背包問題

https://www.luogu.com.cn/problem/P4389
https://www.luogu.com.cn/problem/P5339

骨牌問題

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

自然數冪和、伯努利數

Luogu P7102 [W1] 算

差分、前綴和

Luogu P5488 差分與前綴和

拆分數

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

抽卡

Wikipedia, Coupon collector’s problem
Luogu P6633 [ZJOI2020] 抽卡

圖論計數

http://www.shuizilong.com/house/archives/graphical-enumeration/