二进制新知识(Codeforces Round #267 (Div. 2) B. Fedor and New Game)
来源:互联网 发布:js手机端上传图片 编辑:程序博客网 时间:2024/06/01 23:27
J - Fedor and New Game
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit
Status
Description
After you had helped George and Alex to move in the dorm, they went to help their friend Fedor play a new computer game «Call of Soldiers 3».
The game has (m + 1) players and n types of soldiers in total. Players «Call of Soldiers 3» are numbered form 1 to (m + 1). Types of soldiers are numbered from 0 to n - 1. Each player has an army. Army of the i-th player can be described by non-negative integer xi. Consider binary representation of xi: if the j-th bit of number xi equal to one, then the army of the i-th player has soldiers of the j-th type.
Fedor is the (m + 1)-th player of the game. He assume that two players can become friends if their armies differ in at most k types of soldiers (in other words, binary representations of the corresponding numbers differ in at most k bits). Help Fedor and count how many players can become his friends.
Input
The first line contains three integers n, m, k (1 ≤ k ≤ n ≤ 20; 1 ≤ m ≤ 1000).
The i-th of the next (m + 1) lines contains a single integer xi (1 ≤ xi ≤ 2n - 1), that describes the i-th player’s army. We remind you that Fedor is the (m + 1)-th player.
Output
Print a single integer — the number of Fedor’s potential friends.
Sample Input
Input
7 3 1
8
5
111
17
Output
0
Input
3 3 3
1
2
3
4
Output
3
**题意:给你m+1个数让你判断所给的数的二进制形式与第m+1个数不想同的位数是否小于等于k,累计答案。
这里用到了一个二进制的知识: a & (1 << j ) 表示数a二进制的第j 位是什么。**
#include <bits/stdc++.h>#include <algorithm>using namespace std;int a[1010];int main(){ int n,m,k,x,ans=0; scanf("%d%d%d",&n,&m,&k); for(int i = 1; i <= m; i++) { scanf("%d",&a[i]); } scanf("%d",&x); for(int i = 1; i <= m; i++) { int res=0; for(int j = 0; j < n; j++) { if((a[i]&(1<<j)) != (x&(1<<j))) res++; } if(res<=k) ans++; } printf("%d\n",ans); return 0;}
- 二进制新知识(Codeforces Round #267 (Div. 2) B. Fedor and New Game)
- Codeforces Round #267 (Div. 2) B. Fedor and New Game
- Codeforces Round #267 (Div. 2) B. Fedor and New Game
- Codeforces Round #267 (Div. 2) B. Fedor and New Game(位运算)
- Codeforces 467B Fedor and New Game
- 【CODEFORCES】 B. Fedor and New Game
- Codeforces 467B Fedor and New Game
- CF 267B Fedor and New Game
- #267B. Fedor and New Game-----每日两道水(1)
- B. Fedor and New Game
- Codeforces Round #267 (Div. 2) D. Fedor and Essay
- Codeforces Round #267 (Div. 2) D. Fedor and Essay
- Codeforces 467B Fedor and New Game(暴力)
- cf-467B. Fedor and New Game
- Codeforces Round #390 (Div. 2) D. Fedor and coupons
- Codeforces Round #390 (Div. 2) D. Fedor and coupons
- Codeforces Round #390 (Div. 2//754D. Fedor and coupons
- Codeforces Round #390 (Div. 2) D - Fedor and coupons (贪心)
- VisualSVN Server搭建SVN服务器
- Java获得硬盘和主板的序列号
- jQuery实现当select下拉框内容变化时,input输入框内容随之变化
- PAT甲级习题(1001)
- 程序员怎么在业余时间赚钱
- 二进制新知识(Codeforces Round #267 (Div. 2) B. Fedor and New Game)
- textview的多种字体和一个textview中的多个点击事件
- iOS UIView的方法及执行顺序
- 下拉列表+选择+实现网页链接
- Quartz集成Spring的2个方法
- jar、ear、war包
- linux登录MySQL,报错ERROR 1045 (28000)解决办法
- Collection接口、List接口及迭代器
- SVN服务器搭建和使用教程