随笔分类 -  数论-FFT

摘要:```cpp include include define Maxn 1000500 const double Pi=acos( 1); using namespace std; int n,m,r[Maxn 1] 1)|((i&1)?n 1:0); fft(b,1); fft(c,1);//DFT 阅读全文
posted @ 2019-07-16 13:32 prestige 阅读(1233) 评论(0) 推荐(0)
摘要:```cpp include include define Maxn 5000 define Pi 3.1415926535898 using namespace std; int n,m; struct complex {complex (double xx=0,double yy=0){x=xx 阅读全文
posted @ 2019-07-16 13:31 prestige 阅读(502) 评论(0) 推荐(0)