社会福利公社

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

https://zhuanlan.zhihu.com/p/19763231?refer=wille http://blog.jobbole.com/58246/ http://blog.youkuaiyun.com/yeeman/article/details/6325693 https://www.zhihu.com/question/22298352 /* algor