… : "…アッカリ~ン . .. . " .. .
September 22, 2021
Table of Contents
P3706 [SDOI2017]硬币游戏 概率生成函数
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/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 差分与前缀和
Wikipedia, Coupon collector’s problem Luogu P6633 [ZJOI2020] 抽卡
https://www.shuizilong.com/house/archives/graphical-enumeration/
Posted by xiaodao Category: 日常
Your name - Required
Your email - Required (will not be published)
« 树形背包 | temp »
open all | close all
Tweets by MinakoOikawa
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。