原文链接:http://blog.csdn.net/qq_33184171/article/details/51183322
B - Team Formation
Time Limit:3000MS Memory Limit:131072KB 64bit IO Format:%lld & %llu
Submit
Status
Practice
ZOJ 3870
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 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
好了,题目大意就是给你n 个数,求出 其中任意两个 a^b >a a^b>b 的情况的个数。
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <iostream
#define maxs 100005
#define ll long long
using namespace std;
int zero[50],one[50];
int main()
{
int t,n;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
int x,temp=0,wei_num=0;
memset(zero,0,sizeof(zero));
memset(one,0,sizeof(one));
for(int i=0;i<n;i++)
{
wei_num=0;
scanf("%d",&x);
while(x)
{
if(x&1) //从第一位开始
temp=wei_num;
else
zero[wei_num]++;
wei_num++;
x>>=1;
}
one[temp]++;
}
ll sum=0;
for(int i=0;i<=32;i++)
{
sum+=zero[i]*one[i];
}
printf("%lld\n",sum);
}
return 0;
}