G - Raising Bacteria 二进制拆分

G - Raising Bacteria

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

You are a lover of bacteria. You want to raise some bacteria in a box. 

Initially, the box is empty. Each morning, you can put any number of bacteria into the box. And each night, every bacterium in the box will split into two bacteria. You hope to see exactly x bacteria in the box at some moment. 

What is the minimum number of bacteria you need to put into the box across those days?

Input

The only line containing one integer x (1 ≤ x ≤ 10⁹).

Output

The only line containing one integer: the answer.

Sample Input

Input

5

Output

2

Input

8

Output

1

Hint

For the first sample, we can add one bacterium in the box in the first day morning and at the third morning there will be 4 bacteria in the box. Now we put one more resulting 5 in the box. We added 2 bacteria in the process so the answer is 2.

For the second sample, we can put one in the first morning and in the 4-th morning there will be 8 in the box. So the answer is 1.

【类型】 
二进制拆分

【分析】 
看样例就瞬间想到，这题是求二进制中有多少个1 
然而倒着思考也很容易解释— 
比如当前x二进制表示为—— 
101011 
我们可以在 
倒数第1天加入 
倒数第2天加入 
倒数第4天加入 
倒数第6天加入 
二进制中的1的个数，在数量上是恰好对应答案的。 
而且也不能更优。

【时间复杂度&&优化】 
O(log(1e9))

判断一个二进制数有多少个0多少个1可以：

while(n)

    {

        ans+=n&1;

        n>>=1;

    }

AC代码

#include <iostream>

#include <cstdio>

using namespace std;

int main()

{

    int n,ans=0;

    cin>>n;

    while(n)

    {

        ans+=n&1;

        n>>=1;

    }

    cout<<ans<<endl;

    return 0;

}