CF#267 (Div. 2) B

最新推荐文章于 2016-03-24 01:20:04 发布

编码之夜

最新推荐文章于 2016-03-24 01:20:04 发布

阅读量750

点赞数

分类专栏： codeforces 文章标签：异或运算

本文链接：https://blog.csdn.net/u013447865/article/details/39434363

版权

codeforces 专栏收录该内容

79 篇文章 0 订阅

订阅专栏

B. Fedor and New Game

time limit per test1 second

memory limit per test256 megabytes

inputstandard input

outputstandard output

题目链接： http://codeforces.com/contest/467/problem/B

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 1
8
5
111
17
output
0
input
3 3 3
1
2
3
4
output

解题思路：

题意就是给你n,m,k，然后输入m+1个数，以最后一个数为标准，以二进制形式跟前面的数进行比较，最多允许k位不同·····

先对两个数进行异或运算，那么不同的位异或得1，最后算下1的位数和k做下比较就行。

完整代码：

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;

#pragma comment(linker, "/STACK:102400000,102400000")

typedef long long LL;
typedef double DB;
typedef unsigned uint;
typedef unsigned long long uLL;

/** Constant List .. **/ //{

const int MOD = int(1e9)+7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const DB EPS = 1e-9;
const DB OO = 1e20;
const DB PI = acos(-1.0); //M_PI;

int a[10000001];

int main()
{
    #ifdef DoubleQ
    freopen("in.txt","r",stdin);
    #endif
    int n , m , L;
    while(~scanf("%d%d%d",&n , &m , &L))
    {
        for(int i = 0 ; i <= m ; i ++)
        {
            scanf("%d",&a[i]);
        }
        int k = a[m];
        int res = 0;
        for(int i = 0 ; i < m ; i ++)
        {
            int t = k ^ a[i];
            int cnt = 0;
            while(t > 0)
            {
                int s = t % 2;
                if(s == 1)
                    cnt ++;
                t /= 2;
            }
            if(cnt <= L)
                res++;
        }
        printf("%d\n",res);
    }
}