题目大意:给定n,m,k,n种士兵,m个部队,兵种不同数量小于等于k的为友军。然后给出m+1行,前m行表示需要判定的部队,第m+1行Fedor的部队。(按照二进制形式给定)
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
bool compare(int a, int b)
{
return a>b;
}
int cmp(const void *a, const void *b)
{
return *(char *)a - *(char *)b;
}
bool composite(int i)
{
if (i == 1) return false;
else if (i == 2 || i == 3) return true;
else for (int j = 2;j<sqrt((float)i) + 1;j++)
{
if (i%j == 0)
return true;
}
return false;
}
int max(int a1, int a2)
{
return a1 = a1>a2 ? a1 : a2;
}
int father[1001];
void initial(int n)
{
for (int i = 1;i <= n;i++)
father[i] = i;
}
int find(int a)
{
while (father[a] != a)
a = father[a];
return a;
}
void combine(int a, int b)
{
int temp1 = find(a);
int temp2 = find(b);
if (temp1 != temp2)
father[temp1] = temp2;
}
int a[1001];
inline int bitcount(int x) {
return x == 0 ? 0 : bitcount(x >> 1) + (x & 1);
}
int main()
{
ios::sync_with_stdio(false);
int n, m, k;
while (cin >> n >> m >> k)//soldier player soldier type
{
for (int i = 0;i <=m;i++)
{
cin >> a[i];
}
int sum = 0;
for (int i = 0;i <m;i++)
{
if (bitcount(a[i] ^ a[m]) <= k)
sum++;
}
cout << sum << endl;
}
}
解题思路:直接取亦或(^),然后判断1的个数是否小于等于k。