摘要:
或卷积 FWT_OR for (int k = 1; k < N; k <<= 1) for (int i = 0; i < N; i += k << 1) for (int j = 0; j < k; ++j) add(f[i | j | k], f[i | j]); IFWT_OR for (i 阅读全文
posted @ 2024-10-10 15:59
SkyMaths
阅读(26)
评论(0)
推荐(0)
摘要:
快点去练计数 DP/fn 阅读全文
posted @ 2024-10-10 15:56
SkyMaths
阅读(37)
评论(0)
推荐(0)

浙公网安备 33010602011771号