Codeforces 769D k-Interesting Pairs Of Integers【思维+预处理+暴力枚举】

最新推荐文章于 2022-02-06 13:55:37 发布

mengxiang000000

最新推荐文章于 2022-02-06 13:55:37 发布

阅读量771

点赞数

分类专栏：暴力枚举思维文章标签： Codeforces 769D

本文链接：https://blog.csdn.net/mengxiang000000/article/details/64907283

版权

思维同时被 2 个专栏收录

692 篇文章 0 订阅

订阅专栏

暴力枚举

111 篇文章 0 订阅

订阅专栏

Vasya has the sequence consisting of n integers. Vasya consider the pair of integers x and y k-interesting, if their binary representation differs from each other exactly in k bits. For example, if k = 2, the pair of integers x = 5 and y = 3 is k-interesting, because their binary representation x=101 and y=011 differs exactly in two bits.

Vasya wants to know how many pairs of indexes (i, j) are in his sequence so that i < j and the pair of integers a_i and a_j is k-interesting. Your task is to help Vasya and determine this number.

Input

The first line contains two integers n and k (2 ≤ n ≤ 10⁵, 0 ≤ k ≤ 14) — the number of integers in Vasya's sequence and the number of bits in which integers in k-interesting pair should differ.

The second line contains the sequence a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁴), which Vasya has.

Output

Print the number of pairs (i, j) so that i < j and the pair of integers a_i and a_j is k-interesting.

Examples

Input

4 1
0 3 2 1

Output

Input

6 0
200 100 100 100 200 200

Output

Note

In the first test there are 4 k-interesting pairs:

(1, 3),
(1, 4),
(2, 3),
(2, 4).

In the second test k = 0. Consequently, integers in any k-interesting pair should be equal to themselves. Thus, for the second test there are 6 k-interesting pairs:

(1, 5),
(1, 6),
(2, 3),
(2, 4),
(3, 4),
(5, 6).

题目大意：

给你N个数的一个序列，如果有两个数二进制中有K个位子不同，那么对应就算作一对可行解，问一共有多少对可行解。

思路：

问有K个位子不同，其实就是两个数亦或之后的结果有几个1.

观察到ai<=1e4，那么我们可以预处理出一个数组num【i】，表示数字i的二进制有几个1.

所以接下来我们O（1e4*1e4）去枚举两个数的异或值，看其num【i^j】是否==k.如果是，统计答案。

这里注意一点，只预处理1e4大小的num【i】是不够的，2e4才够。

因为两个数亦或的结果可能是要大于1e4的。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
#define ll __int64
int num[20050];
ll vis[20050];
void init()
{
    memset(num,0,sizeof(num));
    for(int i=0;i<20400;i++)
    {
        int tmp=i;
        while(tmp)
        {
            num[i]+=tmp%2;
            tmp/=2;
        }
    }
}
int main()
{
    init();
    int n,k;
    while(~scanf("%d%d",&n,&k))
    {
        memset(vis,0,sizeof(vis));
        for(int i=0;i<n;i++)
        {
            int x;
            scanf("%d",&x);
            vis[x]++;
        }
        ll output=0;
        for(int i=0;i<10400;i++)
        {
            if(vis[i]==0)continue;
            for(int j=i;j<10400;j++)
            {
                if(vis[j]>0)
                {
                    if(num[(i^j)]==k)
                    {
                        if(i==j)output+=(vis[i])*(vis[i]-1)/2;
                        else
                        output+=vis[i]*vis[j];
                    }
                }
            }
        }
        printf("%I64d\n",output);
    }
}