FFT
兔蠢蠢
这个作者很懒,什么都没留下…
展开
-
FFT求解卷积
卷积 已知两个多项式 A(x)=a0+a1x1+a2x2+a3x3+⋯+anxn" role="presentation" style="position: relative;">A(x)=a0+a1x1+a2x2+a3x3+⋯+anxnA(x)=a0+a1x1+a2x2+a3x3+⋯+anxnA(x)=a_{0}+a_{1}x^1+a_{2}x^2+a_{3}x^3+\cdot原创 2018-01-26 15:21:07 · 1473 阅读 · 0 评论 -
HDU 4609 3-idiots (FFT)
3-idiots Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6517 Accepted Submission(s): 2269 Problem Description King OMeGa catched three原创 2018-01-27 16:45:53 · 201 阅读 · 0 评论 -
Kattis aplusb A+B Problem(FFT)
A+B Problem Given NN integers in the range [−50000,50000], how many ways are there to pick three integers aiai, ajaj, akak, such that ii, jj, kk are pairwise distinct and ai+aj=akai+aj=ak? Two ways a原创 2018-01-27 20:58:27 · 1343 阅读 · 0 评论 -
HihoCoder 1388 Periodic Signal(FFT)
HihoCoder 1388 题意 给你两个序列,序列A和序列B求上述的和的最小值 思路 首先把平方打开 ∑i=0n−1(ai−b(i+k)modn)2=∑i=0n−1ai2−2aib(i+k)modn+b(i+k)modn2" role="presentation">∑i=0n−1(ai−b原创 2018-01-28 23:58:13 · 192 阅读 · 0 评论