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 thei-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.
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.
Print a single integer — the number of Fedor's potential friends.
7 3 1 8 5 111 17
0
3 3 3 1 2 3 4
3
题解
看懂题目把二进制位拿出来搞搞就行了。
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
int n,m,k,a[1005][1005];
void insert(int x,int c)
{
int i,j;
for(i=0;i<=25;i++)
{j=1<<i;
if((j&x)!=0) a[c][i]=1;
}
}
void init()
{
scanf("%d%d%d",&n,&m,&k);
int i,j,x;
for(i=1;i<=m+1;i++)
{scanf("%d",&x); insert(x,i);}
/*for(i=1;i<=m+1;i++)
{for(j=25;j>=0;j--)
printf("%d",a[i][j]);
printf("\n");}*/
}
void work()
{
int i,j,ct,ans=0;
for(i=1;i<=m;i++)
{ct=0;
for(j=0;j<=25;j++)
{if(a[i][j]!=a[m+1][j]) ct++;
if(ct>k) break;
}
if(ct<=k) ans++;
}
printf("%d\n",ans);
}
int main()
{
init(); work();
return 0;
}