统计一个二进制数据中1的个数和大于等于当前数的最小的一个二的N次幂

#include <conio.h>

int OneCount( int n )
{
 int nCount = 0;
 
 while( n )
 {
  nCount++;
  n &= n-1;
 }

 return nCount;
}

int High( int n)
{
 while ( n & (n-1) )
 {
  n |= n-1;
  n++;
 }

 return n;
}

int main(int argc, char* argv[])
{
 int n = 0;

 do
 {
  printf("Input a num please:");
  scanf("%d", &n);
  
  printf("Bit count is:%d/n", OneCount(n));
  printf("High numer is:%d/n", High(n));
 } while ( getch() != 32 );
 
 return 0;
}