当前位置:网站首页>杭州电 3711 Binary Number
杭州电 3711 Binary Number
2022-07-06 21:26:00 【全栈程序员站长】
大家好,又见面了,我是全栈君
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代码例如以下:
#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;
}
发布者:全栈程序员栈长,转载请注明出处:https://javaforall.cn/116703.html原文链接:https://javaforall.cn
边栏推荐
- 【开发软件】 tilipa开发者软件
- Adaptive non European advertising retrieval system amcad
- Hongmi K40S root gameplay notes
- 史上最全学习率调整策略lr_scheduler
- 机器学习笔记 - 使用机器学习进行鸟类物种分类
- 10 ways of interface data security assurance
- 海思万能平台搭建:颜色空间转换YUV2RGB
- ABAP Dynamic Inner table Group cycle
- 机械臂速成小指南(十):可达工作空间
- It's too convenient. You can complete the code release and approval by nailing it!
猜你喜欢
Mobile measurement and depth link platform - Branch
Some thoughts on cross end development of kbone and applet
1.19.11.SQL客户端、启动SQL客户端、执行SQL查询、环境配置文件、重启策略、自定义函数(User-defined Functions)、构造函数参数
Restcloud ETL Community Edition June featured Q & A
Hisilicon 3559 universal platform construction: RTSP real-time playback support
Top 50 hit industry in the first half of 2022
Adaptive non European advertising retrieval system amcad
机器学习笔记 - 使用机器学习进行鸟类物种分类
机械臂速成小指南(十):可达工作空间
海思万能平台搭建:颜色空间转换YUV2RGB
随机推荐
2022夏每日一题(一)
如何检测mysql代码运行是否出现死锁+binlog查看
大白话高并发(二)
Kbone与小程序跨端开发的一些思考
使用Thread类和Runnable接口实现多线程的区别
再AD 的 界面顶部(菜单栏)创建常用的快捷图标
海思3559万能平台搭建:RTSP实时播放的支持
Adaptive non European advertising retrieval system amcad
GPT-3当一作自己研究自己,已投稿,在线蹲一个同行评议
When QT uses qtooltip mouse to display text, the picture of the button will also be displayed and the prompt text style will be modified
Enter the rough outline of the URL question (continuously updated)
QT 打开文件 使用 QFileDialog 获取文件名称、内容等
R data analysis: how to predict Cox model and reproduce high score articles
Do you choose pandas or SQL for the top 1 of data analysis in your mind?
A 股指数成分数据 API 数据接口
19. (ArcGIS API for JS) ArcGIS API for JS line acquisition (sketchviewmodel)
Probability formula
Create commonly used shortcut icons at the top of the ad interface (menu bar)
PIP download only, not install
Introduction to opensea platform developed by NFT trading platform (I)