FFT
取竹
Hai capito?
展开
-
[bzoj]2179: FFT快速傅立叶
FFT做高精乘。。#include #include #include #include #define node complex#define pi acos(-1)using namespace std;const int N=140005;node a[N],b[N];char s1[N],s2[N];int le1,le2,n,m,L,r[N],c[N];void原创 2017-06-04 18:09:29 · 284 阅读 · 0 评论 -
FFT 学习记录
https://zhuanlan.zhihu.com/p/19763231?refer=willehttp://blog.jobbole.com/58246/http://blog.csdn.net/yeeman/article/details/6325693https://www.zhihu.com/question/22298352/* algor转载 2017-03-09 19:54:48 · 365 阅读 · 0 评论