摘要：
线性基 +博弈论 先手必胜当且仅当先手取完之后留下的序列无论如何组合，异或和都不为 0 也就是剩下的整数线性无关,所以我们对所有整数排序,由高往低的贪心的插入线性基, 无法插入的就有先手取出,容易发现,先手必胜 cpp include include include include include 阅读全文
摘要：
矩阵快速幂 按列递推 cpp include include include include include include define ll long long using namespace std; const int MOD = 10000007; int n, m; struct Mat 阅读全文
摘要：
矩阵分治 注意不要用 ( this) 会改变原值 cpp include include include include include include using namespace std; int n, p, k; struct Matrix{ int num[35][35]; void cl 阅读全文