Problem D. Kanade's trio
时间限制 2000 ms
内存限制 512 MB
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]))$
There are T test cases.
$1\leq T\leq 20$
$1\leq \sum n\leq 5*10^5$
$0\leq A[i] <2^{30}$
输入数据
输出数据
For each test case , output an integer , which means the answer.
样例输入
样例输出
$ Mathjax font initiator $