Codeforces - 272B Dima and Sequence（位运算思维）

题目链接————
Dima got into number sequences. Now he’s got sequence a1, a2, …, an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:

f(0) = 0;
f(2·x) = f(x);
f(2·x + 1) = f(x) + 1.
Dima wonders, how many pairs of indexes (i, j) (1 ≤ i < j ≤ n) are there, such that f(ai) = f(aj). Help him, count the number of such pairs.

Input
The first line contains integer n (1 ≤ n ≤ 105). The second line contains n positive integers a1, a2, …, an (1 ≤ ai ≤ 109).

The numbers in the lines are separated by single spaces.

Output
In a single line print the answer to the problem.

Please, don’t use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.

Examples
inputCopy
3
1 2 4
outputCopy
3
inputCopy
3
5 3 1
outputCopy
1
Note
In the first sample any pair (i, j) will do, so the answer is 3.

In the second sample only pair (1, 2) will do.

多写几组可以发现f(x)表示的是x二进制中1的个数，然后就是统计二进制中个数相等的数，然后在n中对2进行组合

#include<iostream>
using namespace std;
#define  ll long long

ll lowbit(ll x)
{
    return x&(-x);
}

ll res[50];

int main()
{
   ll n;
   cin>>n;
   ll a,b,c;
   for(ll i = 1;i<=n;++i)
   {
       cin>>a;
       ll sum = 0;
       while(a)
       {
           a -= lowbit(a);
           sum++;
       }
       res[sum]++;
   }
   ll sum = 0;
   for(ll i =1;i<=33;++i)
   {
       if(res[i]>=2)
        {
        sum += res[i]*(res[i]-1)/2;
       }
   }
   cout<<sum<<endl;
}