计算二进制数的0的个数

#include <iostream>using namespace std;int calZeroNum(int num){    if (0 == num)    {        return 0;    }    int count = 0;    while (0 != num)    {        if (0 == (num & 1))        {            count ++;        }                num = num >>1;    }    return count;}int main(){    int num =0;    cin>>num;    cout<<calZeroNum(num)<<endl;    return 0;}