chutzpah

补两个题A 谍报分析 我写了字典树，虽然对于这个数据范围完全没必要#include<cstdio> #include<cstring> using namespace std;struct node{ int cnt; node *ch[26]; node (){cnt=0;for(int i=0;i<26;i++) ch[i]=NULL;} }root; char str

URL : http://acm.hdu.edu.cn/showproblem.php?pid=6059题意Give you an array A[1..n]，you need to calculate how many tuples (i,j,k) satisfy that (i< j< k) and ((A[i] xor A[j])<(A[j] xor A[k]))题解看了别人题解大半天，才终于

URL ：https://vjudge.net/contest/188110