28.整数的二进制表示中1的个数（运算）

#include <iostream>

int sumone(int n);

int main()
{
int a=sumone(15);
return 0;
}

int sumone(int n)
{
int temp = n ;
int sum = 0;
while (temp != 0)
{
if (temp%2 == 1)
sum = sum +1 ;
temp = temp/2;
}
return sum;
}