
FFT
文章平均质量分 93
nike0good
这个作者很懒,什么都没留下…
展开
-
Japan Registry Services (JPRS) Programming Contest 2025#1 (AtCoder Beginner Contest 392) 题解
B - Who is Missing?C - BibD - DoublesE - Cables and ServersF - InsertG - Fine Triplets给NNN个两两不同的数SiS_iSi,问能凑出多少三元组,正好可以组成等差序列。1≤N,Si≤1061\le N,S_i \le 10^61≤N,Si≤106枚举中间那个数,另外两个数的和是确定的,上FFT。原创 2025-02-09 07:45:30 · 817 阅读 · 0 评论 -
HDU 4609(3-idiots-FFT+dp)
3-idiotsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3109 Accepted Submission(s): 1072Problem DescriptionKing OMeGa catched t原创 2015-09-03 11:22:40 · 835 阅读 · 0 评论 -
BZOJ 2179(FFT快速傅立叶-FFT)
2179: FFT快速傅立叶Time Limit: 10 Sec Memory Limit: 259 MBSubmit: 1899 Solved: 944[Submit][Status][Discuss]Description给出两个n位10进制整数x和y,你需要计算x*y。Input第一行一个正整数n。 第二行描述一个位数为n的正整数x。 第三行描述一个位原创 2015-09-02 16:46:44 · 825 阅读 · 0 评论 -
BZOJ 2194(快速傅立叶之二-FFT)
2194: 快速傅立叶之二Time Limit: 10 Sec Memory Limit: 259 MB Description请计算C[k]=sigma(a[i]*b[i-k]) 其中 k < = i < n ,并且有 n < = 10 ^ 5。 a,b中的元素均为小于等于100的非负整数。Input 第一行一个整数N,接下来N行,第i+2..i+N-1行,每行两个数,依次表示a[i],b原创 2015-09-02 20:02:08 · 850 阅读 · 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): 15111 Accepted Submission(s): 2942Problem DescriptionCalculate原创 2015-09-04 11:25:29 · 616 阅读 · 0 评论 -
HDU 5519(Kykneion asma-NNT+CRT)
Kykneion asmaProblem Description On the last day before the famous mathematician Swan’s death, he left a problem to the world: Given integers n and ai for 0≤i≤4, calculate the number of n-digit intege原创 2016-08-19 19:17:12 · 1120 阅读 · 0 评论