摘要：\(Code\) #include<cstdio> #include<cstring> #include<algorithm> #define LL long long using namespace std; const int N = 2e7 + 5; LL z[N],p[N]; char a[ 阅读全文

摘要：\(Code\) #include<cstdio> #include<cstring> #include<algorithm> #define LL long long using namespace std; const int N = 2e7 + 5; LL z[N],p[N]; char a[ 阅读全文

摘要：\(Solution\) 一道比较模板的线性基，设$a$为线性基中元素的个数，那么答为 \(\sum_{i = 0}^a \binom{a}{i} = \sum_{i = 0}^a \binom{a}{i}*1^i*1^{a - i} = (1 + 1)^a = 2^a\) 因为从线性基中取任意个数 阅读全文