摘要: NTT int R[MAXN], W[MAXN]; void Init(int len) { for (int i = 1; i < len; ++i) { R[i] = (R[i >> 1] >> 1) | (i & 1 ? (len >> 1) : 0); } int wn = Ksm(G, ( 阅读全文
posted @ 2021-12-26 17:54 siriehn_nx 阅读(50) 评论(1) 推荐(0) 编辑