寒假训练八:A题
传送门:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=107320#problem/A
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个数,求这n个数两两异或的值大于这两个数本身的对数
数学题,若要A异或B大于A和B,设A>B则B二进制位数最大位必在A处为0
下面代码
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<functional>
#include<queue>
#include<vector>
#include<set>
#include<map>
using namespace std;
int a[100005];
int mark[100005];//mark为第i位数位1且最大数位为i的个数
int dp[205][5];
int main()
{
int nn,n,i,j,k;
int dmax,dmin,imax,imin;
long long ans;
scanf("%d",&nn);
while(nn--)
{
memset(mark,0,sizeof(mark));
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
j=a[i];
k=0;
while(j>0)
{
j=j/2;
k++;
}
mark[k]++;
}
ans=0;
for(i=1;i<=n;i++)
{
k=1;
while(a[i]>0)//若第i位是0且不是最大位即可
{
if((a[i]&1)==0) ans+=mark[k];
k++;
a[i]=a[i]/2;
}
}
printf("%lld\n",ans);
}
return 0;
}