/********************
* Author:fisty
* Data:fisty
* 枚举,二进制
* cf267B
********************/
#include <cstdio>
#include <algorithm>
#define MAX_N 1010
int main(){
int n,m,k;
int a[MAX_N];
scanf("%d%d%d", &n, &m, &k);
for(int i = 0;i <= m; i++)
scanf("%d", &a[i]);
int ans = 0;
int cnt = 0;
for(int i = 0;i < m; i++){
cnt = 0;
for(int j = 0;j < n; j++){
if(((1<<j)&a[i]) != ((1<<j)&a[m])){
cnt++;
}
}
if(cnt <= k)
ans++;
}
printf("%d\n", ans);
return 0;
}
cf 467BFedor and New Game
最新推荐文章于 2019-07-13 14:32:29 发布