ZOJ 题目3870 Team Formation(数学,位运算)
来源:互联网 发布:2018域名 编辑:程序博客网 时间:2024/05/25 21:34
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
Author: LIN, Xi
Source: The 12th Zhejiang Provincial Collegiate Programming Contest
题目大意:从n个数中取2个数,问有多少种方法取的两个数的异或大于两个数的最大数
思路:如果x的最高位i位是1,y的位是0,且y比x大,i不是y的最高位,异或后这一位变成1,且yi位以前的1也可以保存,则异或后肯定比两个数的最大值还大
ac代码
#include<stdio.h>#include<string.h>int a[100010],b[100010];int main(){int t;scanf("%d",&t);while(t--){int n;scanf("%d",&n);int i;memset(b,0,sizeof(b));for(i=1;i<=n;i++){scanf("%d",&a[i]);int pos=31;while(pos>=0){if(a[i]&(1<<pos)){b[pos]++;break;}pos--;}}int ans=0;//printf("%d %d\n",b[1],b[0]);for(i=1;i<=n;i++){int pos=31;while(pos>=0){if(a[i]&(1<<pos))break;pos--;}//pos=31;while(pos>=0){if(!(a[i]&(1<<pos))){ans+=b[pos];//printf("%d %d %d\n",ans,i,pos);}pos--;}}printf("%d\n",ans);}}
- ZOJ 题目3870 Team Formation(数学,位运算)
- ZOJ 3870 Team Formation(位运算)
- ZOJ 3870Team Formation(位运算)
- ZOJ - 3870 Team Formation (位运算)
- ZOJ-3870 Team Formation(位运算)
- ZOJ 3870 Team Formation 位运算
- zoj 3870 Team Formation 位运算
- ZOJ Team Formation 3870【位运算】
- zoj 3870 Team Formation(位运算,超时)
- zoj--3870--Team Formation(位运算好题)
- ZOJ 3870 Team Formation(数学)
- ZOJ 3870 - Team Formation(数学)
- ZOJ 3870 Team Formation 第12届浙江省省赛B题 [位运算+思维]【数学】
- ZOJ-3870-Team Formation【位运算】【12th浙江省赛】
- ZOJ3870 Team Formation【位运算+数学】
- [水+数学] zoj 3870 Team Formation
- Zoj 3870 Team Formation(异或运算)
- ZOJ 3870 Team Formation(异或运算)
- swift-01-简述swift与OC区别
- 标注工具-马克鳗的使用
- HDU 1082 Matrix Chain Multiplication
- linux 在bash 中的 second SECOND SECONDS
- javascript笔记(一):javascript中的对象和"类"
- ZOJ 题目3870 Team Formation(数学,位运算)
- Java基础语法(2)----语句、函数和数组
- Nginx启动错误:error while loading shared libraries: libpcre.so.1
- 数据库Statement对象
- ObjectARX获取实体个数
- 字符串的排列
- hdu-1233 还是畅通工程
- android:layout_gravity="bottom"不起作用问题
- 【poj 2234】Matches Game