ZOJ - 3870 Team Formation
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
先排序,然后从小到大看,每一个都算一下它的二进制,一位一位的算,如果是0的话就和最前边为1的对应位数长的数^肯定会变大,就++。
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstring>
#include <cctype>
#include <stack>
#include <queue>
#define N 1000100
#define mod 1000000007
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
int a[100010];
int main(){
int t,ans,n,i,j,k;
int b[55],cnt[55];
scanf("%d",&t);
while(t--){
ans=0;
memset(a,0,sizeof(a));
memset(cnt,0,sizeof(cnt));
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
sort(a,a+n);
for(i=0;i<n;i++){
j=0;
while(a[i]){
b[j++]=a[i]%2;
a[i]/=2;
}
for(k=0;k<j;k++){
if(b[k]==0){
ans+=cnt[k];
}
}
cnt[j-1]++;
}
printf("%d\n",ans);
}
return 0;
}