巧用位运算 ZOJ 3870 Team Formation

Description

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 i^th integer denotes the skill level of i^th student. Every integer will not exceed 10⁹.

Output

For each case, print the answer in one line.

Sample Input

要求求出所有两个数组合的^（异或运算）大于两个数中较大的哪一个数的数量。由异或运算的特点（相异为1）可以得出较小数的最高位与较大数异或如果为1那么一定得出的数比较大数大，若果为0肯定比较大数小

2
3
1 2 3
5
1 2 3 4 5

Sample Output

1
6

AC代码

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
typedef pair<string, int> P;
//#define LOCAL
#define INF 0x3f3f3f3f
#define MAX_N 100005

int W[MAX_N], num[MAX_N];

int main()
{
	#ifdef LOCAL
		freopen("b:\\data.in.txt", "r", stdin);
	#endif
    int T;
    cin >> T;
    while(T--)
    {
        memset(W, 0, sizeof(W));
        memset(num, 0, sizeof(num));
        int N;
        cin >> N;
        for(int i = 0; i < N; i++)
        {
            int x;
            cin >> x;
            int cnt = 0;
            while(x>0)
            {
                if(!(x&1))
                {
                    W[cnt]++;
                }
                x = x>>1;
                cnt++;
            }
            num[i] = cnt - 1;//记录第i个输入进来的数的位数
        }
        int ans = 0;
        for(int i = 0; i < N; i++)
        {
            ans += W[num[i]];
        }
        cout << ans << endl;
    }
    return 0;
}