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?
InputThe only line containing one integer x (1 ≤ x ≤ 109).
The only line containing one integer: the answer.
5
2
8
1
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.
此题看似不是很简单,但是可以想到,已知细菌时2的指数增长,就像位运算,2的n次方也就像是二进制的形式,就像8就是1转化为二进制为1000,5就是101与题目的描述一个意思差不多
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
int main()
{
int n,cou;
while(~scanf("%d",&n))
{
cou=0;
while(n)
{
if(n%2==1)
{
cou++;
}
n/=2;
}
printf("%d\n",cou);
}
return 0;
}