当前位置:网站首页>Hangzhou Electric 3711 binary number
Hangzhou Electric 3711 binary number
2022-07-07 04:06:00 【Full stack programmer webmaster】
Hello everyone , I meet you again , I'm the king of the whole stack
Binary Number
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1287 Accepted Submission(s): 807
Problem Description
For 2 non-negative integers x and y, f(x, y) is defined as the number of different bits in the binary format of x and y. For example, f(2, 3)=1,f(0, 3)=2, f(5, 10)=4. Now given 2 sets of non-negative integers A and B, for each integer b in B, you should find an integer a in A such that f(a, b) is minimized. If there are more than one such integer in set A, choose the smallest one.
Input
The first line of the input is an integer T (0 < T ≤ 100), indicating the number of test cases. The first line of each test case contains 2 positive integers m and n (0 < m, n ≤ 100), indicating the numbers of integers of the 2 sets A and B, respectively. Then follow (m + n) lines, each of which contains a non-negative integers no larger than 1000000. The first m lines are the integers in set A and the other n lines are the integers in set B.
Output
For each test case you should output n lines, each of which contains the result for each query in a single line.
Sample Input
2
2 5
1
2
1
2
3
4
5
5 2
1000000
9999
1423
3421
0
13245
353
Sample Output
1
2
1
1
1
9999
0
AC The code is as follows :
#include <stdio.h>
int a[105];
int count(int x)
{
int c = 0;
for(;x;x>>=1) if(x&1) c++;
return c;
}
int main()
{
int b, i, j, n, m, k, min, t,cases;
scanf("%d",&cases);
while(cases--)
{
scanf("%d%d",&n,&m);
for(i=0; i<n; i++) scanf("%d",&a[i]);
for(i=0; i<m; i++)
{
scanf("%d",&b);
min = count(b^a[0]);
k = 0;
for(j=1; j<n; j++)
{
t = count(b^a[j]);
if(t<min||t==min&&a[j]<a[k])
{ min = t;k = j;}
}
printf("%d\n",a[k]);
}
}
return 0;
}
Publisher : Full stack programmer stack length , Reprint please indicate the source :https://javaforall.cn/116703.html Link to the original text :https://javaforall.cn
边栏推荐
- Kalman filter-1
- Probability formula
- One of oscp tools: dirsearch usage Encyclopedia
- Use dumping to back up tidb cluster data to GCS
- API data interface of A-share index component data
- QT opens a file and uses QFileDialog to obtain the file name, content, etc
- SQL injection -day15
- 使用Thread类和Runnable接口实现多线程的区别
- HW notes (II)
- PHP 实现根据概率抽奖
猜你喜欢
超越Postman,新一代国产调试工具Apifox,用起来够优雅
ABAP Dynamic Inner table Group cycle
AVL树插入操作与验证操作的简单实现
web服务性能监控方案
Food Chem|深度学习根据成分声明准确预测食品类别和营养成分
API data interface of A-share index component data
ggplot 分面的细节调整汇总
leetcode:面试题 17.24. 子矩阵最大累加和(待研究)
Adaptive non European advertising retrieval system amcad
Antd Comment 递归循环评论
随机推荐
【编码字体系列】OpenDyslexic字体
Redis configuration and optimization of NoSQL
ERROR: Could not build wheels for pycocotools which use PEP 517 and cannot be installed directly
ERROR: Could not build wheels for pycocotools which use PEP 517 and cannot be installed directly
自适应非欧表征广告检索系统AMCAD
List interview common questions
Opencv third party Library
SQL injection -day15
termux设置电脑连接手机。(敲打命令贼快),手机termux端口8022
Enter the rough outline of the URL question (continuously updated)
C task expansion method
Native MySQL
ABAP 动态内表分组循环
Restore backup data on GCS with br
Redis source code learning (31), dictionary learning, dict.c (1)
2022 middle school Youth Cup mathematical modeling question B fertility policy research ideas under the background of open three children
ABAP dynamic inner table grouping cycle
使用 Dumpling 备份 TiDB 集群数据到 GCS
使用 TiDB Lightning 恢复 GCS 上的备份数据
QT item table new column name setting requirement exercise (find the number and maximum value of the array disappear)