![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM_FFT / NTT
LzyRapX
Just For Fun .
展开
-
快速傅里叶变换(FFT)(上)
FFT这东西觉得很玄学啊,绝大部分人看了也是一知半解,似懂非懂,或者根本不懂.....我今天想尝试一下解释这FFT的很玄学的理解(因为不一定正确).....傅里叶级数:在讲FFT之前,我们要说清楚一下各种傅里叶变换。傅里叶变换最早要追朔到傅里叶级数,傅里叶级数其实和幂级数其实是同一个玩意。幂级数是说,我们使用x^0,x^1,x^2,x^3....加上不同的系数,原创 2016-10-07 15:48:31 · 6529 阅读 · 0 评论 -
HDU 5730 多校1 Shell Necklace (CDQ分治+FFT)
Shell NecklaceTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 694 Accepted Submission(s): 310Problem DescriptionPerhaps the sea‘s原创 2016-10-08 00:58:14 · 1447 阅读 · 0 评论 -
2016 acm香港网络赛 A题 A+B Problem (FFT)
题意:给你一堆数,然后求ai+aj=ak的组成的(i,j,k)对有多少个,并且保证i,j,k下标互不相同。题解:num[k]表示(ai,aj)=k的个数。然后将a[i]+a[i]的那种重复的去掉。然后计算当a[i]==k时的(i,j,k)有多少种,很明显就是 num[ a[i] ]种,注意有一种情况是有0的时候,因为有可能会自己加了0也等于a[i]。所以要统计一下0有多少个,减了0就可以了,注意(...原创 2016-10-07 20:47:39 · 2934 阅读 · 0 评论 -
HDU 4609 3-idiots (FFT)
http://acm.hdu.edu.cn/showproblem.php?pid=46093-idiotsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4122 Accepted Submission(s): 1457Probl...原创 2016-10-07 17:51:58 · 692 阅读 · 0 评论 -
HDU 1402 A * B Problem Plus (FFT模板题)
A * B Problem PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18229 Accepted Submission(s): 4080Problem DescriptionCalculate A原创 2016-10-07 12:45:55 · 924 阅读 · 0 评论 -
POJ 2389 Bull Math (FFT)
Bull MathTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 14629Accepted: 7514DescriptionBulls are so much better at math than the cows. They can multipl原创 2016-10-13 13:01:11 · 648 阅读 · 0 评论 -
HDU 5829 16多校08 Rikka with Subset (NTT)
Rikka with SubsetTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 871 Accepted Submission(s): 276Problem DescriptionAs we know, Rikk原创 2016-10-12 00:00:10 · 1179 阅读 · 0 评论 -
hihocoder 1388 2016北京网络赛1006 Periodic Signal(卡精度的FFT)
#1388 : Periodic Signal时间限制:5000ms单点时限:5000ms内存限制:256MB描述Profess X is an expert in signal processing. He has a device which can send a particular 1 second signal repeated原创 2016-10-11 19:59:54 · 760 阅读 · 0 评论 -
HDU 5751 BestCoder Round #84 Eades(线段树+FFT)
EadesTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 140 Accepted Submission(s): 71Problem DescriptionPeter has a number sequenc原创 2016-10-08 23:13:20 · 735 阅读 · 0 评论 -
HDU 4093 2011上海区域赛 Xavier is Learning to Count (FFT+容斥原理)
Xavier is Learning to CountTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 399 Accepted Submission(s): 60Problem Description Xav原创 2016-10-10 22:45:10 · 1304 阅读 · 0 评论 -
快速傅里叶变换(FFT)(下)
关于学习FFT算法的资料个人最推荐的还是算法导论上的第30章(第三版), 多项式与快速傅里叶变换, 基础知识都讲得很全面。FFT算法基本概念:FFT(Fast Fourier Transformation)即快速傅里叶变换, 是离散傅里叶变换的加速算法, 可以在O(nlogn)O(nlogn)的时间里完成DFT, 利用相似性也可以在同样复杂度的时间里完成逆DFT。DFT(Dis原创 2016-10-09 19:57:47 · 3289 阅读 · 2 评论 -
2017 Multi-University Training Contest - 第一场 04 Division Game (NTT+数学)
题目链接: HDU 6036题解: (官方:题解)显然每个石子堆最多做 ∑ m i=1 e i \sum_{i = 1}^{m}{e_i} (记为 w w )次操作。此外,如果定义一个堆做 x x 次操作恰好变为 1 1 的方案数为 f(x) f(x) ,显然每个数字做少于 x x 次操作不变为 1 1 的方案数也是 f(x) f(x) 。为了统计结束于石子堆i i的情况数,我们可以枚举这是它原创 2017-07-26 10:33:41 · 875 阅读 · 0 评论