zoj 5518 异或
来源:互联网 发布:sql update 效率 编辑:程序博客网 时间:2024/05/22 15:05
For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team fromN students of his university.
Edward knows the skill level of each student. He has found that if two students with skill levelA 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 containsN positive integers separated by spaces. The ith integer denotes the skill level ofith 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思路:两个数异或,较小的数的最高位(i位)的1,对应在较大数的相同位置(i位), 若大数的i位为0,则两个数的异或值大于较大的数。故 对所有数进行排序,计算出每个位置上 最高位为1的数的个数,
code:
#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>using namespace std;int bit[50],a[100100];int sol(int m){ int pos=0,ans=0; while(m>1) { if(m%2==0) ans+=bit[pos];//<span style="font-size:18px;">计算出每个位置上 最高位为1的数的个数,</span> pos++; m/=2; } bit[pos]++; return ans;}int main(){ int cas,n,i,j,ans; scanf("%d",&cas); while(cas--) { memset(bit,0,sizeof(bit)); ans=0; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); for(i=0;i<n;i++) ans+=sol(a[i]); printf("%d\n",ans); } return 0;}
- zoj 5518 异或
- zoj 3432 异或
- zoj 3870 异或运算
- zoj 3870 异或运算
- zoj 3432(异或的使用)
- ZOJ 3870 Team Formation(异或)
- ZOJ 3870 Team Formation (异或运算)
- ZOJ 3591 Nim (连续子序列异或和)
- Zoj 3870 Team Formation(异或运算)
- ZOJ 3870 Team Formation(异或运算)
- zoj 3870 Team Formation(异或运算)
- Zoj 3870 Team Formation(异或运算)
- ZOJ.3418 Binary Number【异或】 2015/09/22
- Zoj 3870 Team Formation(异或运算)
- ♥ZOJ 3870-Team Formation【异或,数学】
- Zoj 3870 Team Formation(异或运算),zoj3870
- zoj 2029【二分查找】或【STL】
- ZOJ 1827 SG函数 或 dp
- iOS开发--本地通知
- 励精图治---Concurrency---为什么要有线程
- chmod: changing permissions of '/etc/passwd': Read-only file system
- 申请苹果加急审核
- Hadoop 自定义数据类型和自定义排序
- zoj 5518 异或
- 使用innobackupex备份遇到的问题和解决方法
- poj 2763 Housewife Wind 树链剖分
- 使用PopupWindow实现右上角弹出菜单
- 非常详细的测试unity与android之间的通讯操作
- 条款47:请使用traits classes 表现类型信息
- vim每日一插(二)——vim-monokai
- 面试札记(一)
- kernel中如何读取内存的大小和地址