Microsoft face question resolution: the number of 1 in the binary representation of integers

Title: Enter an integer that asks how many 1 in the binary expression of the integer.

For example, enter 10, because the binary representation is 1010, there are two 1, so output 2.

Analysis:

Using the shift operation to implement.

Specifically implemented as follows:

#include <iostream>  
      
using namespace std;  
      
int binary1num (int d)  
{  
        int cnt = 0;  
        while (D/2!= 0)  
        {  
                if (d%2 = = 1) cnt + +;  
                d = D/2;  
        }  
        if (d%2 = = 1) cnt + +;  
        return cnt;  
}  
      
int main ()  
{  
        cout << "has binary bit num:" << binary1num (a) << Endl;  
        return 0;  
}

The output is as follows:

Ten has binary bit num:2

Author: csdn Blog hhh3h

More Wonderful content: http://www.bianceng.cnhttp://www.bianceng.cn/Programming/sjjg/