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
注意:
做题时思路有,就是敲不出来,还是基础太差啊,主要思路是异或时,若设小的那个数的最高位在i位,大的数的i位若为0则一定可以,若为1一定不可以。
重点来了,学位运算&时说过,其主要用于保留某些位,这里就是用其查看l位是否为1。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int a[100005],dis[33];
void solve(int x){
int l=31;
while(l>=0){
if(x&(1<<l)){
dis[l]++;
return;
}
l--;
}
}
int main()
{
int T,n;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
memset(a,0,sizeof(a));
memset(dis,0,sizeof(dis));
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
solve(a[i]);
}
int ans=0;
for(int i=0;i<n;i++){
int l=31;
while(l>=0){
if(a[i]&(1<<l))break;
l--;
}
while(l>=0){
if(!(a[i]&(1<<l))){
ans+=dis[l];
}
l--;
}
}
printf("%d\n",ans);
}
return 0;
}
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.
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.
For each case, print the answer in one line.
2 3 1 2 3 5 1 2 3 4 5
1 6
注意:
做题时思路有,就是敲不出来,还是基础太差啊,主要思路是异或时,若设小的那个数的最高位在i位,大的数的i位若为0则一定可以,若为1一定不可以。
重点来了,学位运算&时说过,其主要用于保留某些位,这里就是用其查看l位是否为1。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int a[100005],dis[33];
void solve(int x){
int l=31;
while(l>=0){
if(x&(1<<l)){
dis[l]++;
return;
}
l--;
}
}
int main()
{
int T,n;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
memset(a,0,sizeof(a));
memset(dis,0,sizeof(dis));
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
solve(a[i]);
}
int ans=0;
for(int i=0;i<n;i++){
int l=31;
while(l>=0){
if(a[i]&(1<<l))break;
l--;
}
while(l>=0){
if(!(a[i]&(1<<l))){
ans+=dis[l];
}
l--;
}
}
printf("%d\n",ans);
}
return 0;
}