2015 浙江省赛 Team Formation (思维题)
来源:互联网 发布:网络墨迹是什么意思 编辑:程序博客网 时间:2024/05/17 07:09
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
231 2 351 2 3 4 5
Sample Output
16
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;typedef long long ll;const int N = 100000 + 100;int dp[N][33],a[N],b[N];int main(){int k,t,i,j,n,m;cin>>t;while(t--) {m=0;memset(dp,0,sizeof(dp));cin>>n;for(i=1;i<=n;i++) cin>>a[i];sort(a+1,a+1+n);for(i=1;i<=n;i++) {int temp=a[i];k=0;while(temp) {dp[i][++k]=temp%2;temp/=2;}b[i]=k;m=max(m,k);}for(i=1;i<=n;i++) {for(j=1;j<=m;j++)dp[i][j]+=dp[i-1][j];}ll ans=0;for(i=1;i<=n;i++) {ans+=n-i-(dp[n][b[i]]-dp[i][b[i]]);}cout<<ans<<endl;}return 0;}
- 2015 浙江省赛 Team Formation (思维题)
- (思维分析)12th浙江省赛,B.Team Formation
- ZOJ 3870:Team Formation (浙江省赛2015)(二进制操作)
- 数学题ZOJ3870 Team Formation(2015浙江省赛)
- ZOJ3870:Team Formation(浙江省赛2015)
- Team Formation 浙江省赛 (异或)
- ZOJ 3870 Team Formation 第12届浙江省省赛B题 [位运算+思维]【数学】
- ZOJ3870 Team Formation(2015浙江省赛) 位运算异或
- ZOJ 3870 Team Formation(浙江省第12届ACM省赛第二题)
- 12th浙江省省赛 Team Formation
- 浙江省 2015 省赛 B Team Formation
- Team Formation 浙江省省赛原题
- ZOJ-3870-Team Formation【位运算】【12th浙江省赛】
- 2015 浙江省赛 Beauty of Array (思维题)
- 第十二届浙江省大学生程序设计大赛-Team Formation
- zoj--3870--Team Formation(位运算好题)
- Team Formation
- 2015年省赛 B Team Formation【位运算】
- Nginx+uwsgi+flask部署
- pat1002:写出这个数
- java静态方法与非静态方法有什么区别?
- 第一天 加入
- eclipse运行web project经验
- 2015 浙江省赛 Team Formation (思维题)
- java中文件和流处理
- SecureCRT连接编码错误
- 欢迎使用CSDN-markdown编辑器
- 海盗分金币
- xml基础
- 栈回溯技术arm_v5t_le版
- HDU 3294 Girls' research
- LeetCode : Longest Palindromic Substring [java]