ZOJ 3870 Team Formation（位运算）

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>

using namespace std;
typedef long long ll;
#define PB push_back
#define UB upper_bound
#define LB lower_bound
#define MP make_pair
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<vi>
#define mst(x,y) memset(x,y,sizeof(x))
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iin(x) scanf("%d",&x)
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define sp system("pause")
#define INF 1e9
#define MAXN 100005
#define PI acos(-1.0)
#define eps 1e-10
const int MOD = 1e9 + 7;

/*string s;

struct node
{
	int l,r;
	ll s1,s2;
}M[MAXN << 2];

void build(int ind,int l,int r)
{
	M[ind].l = l,M[ind].r = r;
	if(l == r)
	{
		M[ind].s1 = (ll)(s[l - 1] - '0');
		M[ind].s2 = -M[ind].s1;
		return;
	}
	build(ind << 1,l,(l + r) >> 1);
	build(ind << 1 | 1,((l + r) >> 1) + 1,r);
	M[ind].s1 = 
}

int main()
{
	int t;
	cin >> t;
	while(t--)
	{
		cin >> s;
		build(1,1,s.size());
	}
}*/

int bit[35];
int a[100050];

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n;
		scanf("%d",&n);
		memset(bit,0,sizeof(bit));
		for(int i = 0; i <n; ++i)
		{
			scanf("%d",&a[i]);
			for(int j = 31;j >=0;--j)
			{
				if((1<<j) & a[i])
				{
					bit[j] ++;
					break;
				}
			}
		}
		int j;
		ll sum = 0;
		for(int i=0;i<n;++i)
		{
			for(j=31;j>=0;--j)
			{
				if((1<<j) & a[i])
					break;
			}
			while(j >= 0)
			{
				if(!((1<<j) & a[i]))
					sum += bit[j];
				j--;
			}
		}
		printf("%d\n",sum);
	}
	return 0;
}