摘要：trie树的异或和问题 本题是一道经典题，使用trie树维护所给出的集合，我们知道等比数列前n项的和比第n+1项小，所以本题可以使用贪心策略，对于每一个询问，我们从高位向低位匹配，寻找最大异或值，向下递归求解。 cpp include include include include include 阅读全文

摘要：```cpp include include include include include include using namespace std; const int MAXN=5e6+5; int nume,n,m; char s[55],fff[4][20]={" ","OK","WRONG 阅读全文