For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students of his university.
Edward knows the skill level of each student. He has found that if two students with skill level A and B form a team, the skill level of the team will be A ⊕ B, where ⊕ means bitwise exclusive or. A team will play well if and only if the skill level of the team is greater than the skill level of each team member (i.e. A ⊕ B > max{A, B}).
Edward wants to form a team that will play well in the contest. Please tell him the possible number of such teams. Two teams are considered different if there is at least one different team member.
Input
There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:
The first line contains an integer N (2 <= N <= 100000), which indicates the number of student. The next line contains N positive integers separated by spaces. The ith integer denotes the skill level of ith student. Every integer will not exceed 109.
Output
For each case, print the answer in one line.
Sample Input
2 3 1 2 3 5 1 2 3 4 5
Sample Output
1 6
Author: LIN, Xi
Source: The 12th Zhejiang Provincial Collegiate Programming Contest
/*
题目:B Team Formation
链接:http://acm.zju.edu.cn/onlinejudge/showContestProblem.do?problemId=5494
题意:看周老板
思路: 满足的A⊕B > max{A, B}的条件是A,B中较小数转化成二进制后的最高位为1,且较大数转化成二进制后对应的数位为0。
先按升序排序,然后从前往后扫。
对所有数按二进制数来看,令当前元素a之前的元素的最高位为i的元素个数为cnt[i];
设对当前某一位元素,它二进制形式的是0的位数有j1、j2、j3...,则ans+=Sigema(cnt[j]);
然后把a统计进cnt[]。
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1000005;
typedef long long LL;
const int INF = 0xfffffff;
int a[maxn];
int cnt[55];
int c[55];
int IN()
{
int tmp;
scanf("%d", &tmp);
return tmp;
}
int main()
{
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
#endif
int T = IN();
while (T--)
{
int N = IN();
for (int i = 0; i < N; i++)
a[i] = IN();
sort(a, a + N);//排序
memset(cnt, 0, sizeof(cnt));
int ans = 0;
for (int i = 0; i < N; i++)
{
int len = 0, t = a[i];
while (t>0)//a[i]转二进制形式存入c[]
{
c[len++] = t & 1;
t = t >> 1;
}
for (int j = 0; j < len; j++)
{
if (c[j] == 0)
ans += cnt[j];//统计a[i]贡献的匹配数
}
cnt[len - 1]++;//把a统计进cnt[]
}
printf("%d\n", ans);
}
return 0;
}