摘要：
二进制处理多重背包,,, 其实无非就是将物品拆成几组, 每一组的数量都是 $2^n$ 个, 然后因为二进制可以组成所有情况所以就不会漏解啦 比余数分组的做法不知道简单到哪里去了 cpp include include include include include using namespace s 阅读全文
摘要：
用取反的方法来处理两个环相交的情况,,, 妙啊, 妙啊 cpp include include include include include include using namespace std; const int MAXN = 1e5 + 10; inline int read(){ cha 阅读全文