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 test(s)
Input
7 3 18511117
登录后复制
Output
Input
3 3 31234
登录后复制
Output
3题意：给你m+1个数让你判断所给的数的二进制形式与第m+1个数不想同的位数是否小于等于k，累计答案思路：题意题#include #include #include #include using namespace std;const int maxn = 1010;int num[maxn], cnt;int main() {int n, m, k;scanf("%d%d%d", &n, &m, &k);for (int i = 0; i < m; i++)scanf("%d", &num[i]);scanf("%d", &cnt);int ans = 0;for (int i = 0; i < m; i++) {int cur = 0;for (int j = 0; j < n; j++)if (((1<<j)&num[i]) != ((1<<j)&cnt))cur++;if (cur <= k)ans++;}printf("%d", ans);return 0;}登录后复制
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容， 请发送邮件至253000106@qq.com举报，一经查实，本站将立刻删除。
发布者：PHP中文网，转转请注明出处：https://www.chuangxiangniao.com/p/2839597.html
