[这里的题解志愿者随便at几个就行了](https://www.luogu.com.cn/discuss/600159)
@[WrongAnswer_90](/user/134510)
by mc_xiexie @ 2024-04-13 19:18:23
不是同一种做法，分治 fft 确实是 $O(n\log^2 n)$
by zhouyuhang @ 2024-04-13 19:20:52
@[zhouyuhang](/user/314991) 后两篇确实有问题
by zhouyuhang @ 2024-04-13 19:21:30
@[zhouyuhang](/user/314991) 不好意思，看错了，第一篇确实是 $\mathcal O(n\log^2 n)$ 的/ll/wul/wul
@[swiftc](/user/183154) @[bykem](/user/376161)
by WrongAnswer_90 @ 2024-04-13 20:10:53
@[WrongAnswer_90](/user/134510) 后两篇已撤下。
by swiftc @ 2024-04-13 20:22:35