#include "stdio.h"
#include "stdlib.h"
 
int count1(int n);
int count2(int n);
 
int main(void)
{
  int x;
 
  printf("輸入一個數(shù)：");
  scanf("%d",&x);
  printf("\n從0到%d一共遇到%d（%d）個1\n",x,count1(x),count2(x));
   
  return 0;
}
 
//解法一
int count1(int n)
{
  int count = 0;
  int i,t;
   
  //遍歷1到n
  for(i=1;i<=n;i++)
  {
    t=i;
    //依次處理當(dāng)前遍歷到的數(shù)字的各個位
    while(t != 0)
    {
        //若為1則統(tǒng)計(jì)加一
      count += (t%10 == 1)?1:0;
      t/=10;
    }
  }
   
  return count;
}
 
//解法二：
int count2(int n)
{
  int count = 0;//統(tǒng)計(jì)變量
  int factor = 1;//分解因子
  int lower = 0;//當(dāng)前處理位的所有低位
  int higher = 0;//當(dāng)前處理位的所有高位
  int curr =0;//當(dāng)前處理位
   
  while(n/factor != 0)
  {
    lower = n - n/factor*factor;//求得低位
    curr = (n/factor)%10;//求當(dāng)前位
    higher = n/(factor*10);//求高位
     
    switch(curr)
    {
      case 0:
        count += higher * factor;
        break;
      case 1:
        count += higher * factor + lower + 1;
        break;
      default:
        count += (higher+1)*factor;
    }
     
    factor *= 10;
  }
   
  return count;
}

#include "stdio.h"
#include "stdlib.h"
 
int count1(int x);
int count2(int x);
int count3(int x);
 
int main(void)
{
  int x;
  printf("輸入一個數(shù):\n");
  setbuf(stdin,NULL);
  scanf("%d",&x);
  printf("%d轉(zhuǎn)二進(jìn)制中1的個數(shù)是:",x);
  printf("\n解法一：%d",count1(x));
  printf("\n解法二：%d",count2(x));
  printf("\n解法三：%d",count3(x));
   
  printf("\n");
  return 0;
}
 
//除二、余二依次統(tǒng)計(jì)每位
int count1(int x)
{
  int c=0;
  while(x)
  {
    if(x%2==1)
      c++;
    x/=2;
  }
  return c;
}
 
//向右移位，與1按位與統(tǒng)計(jì)每位
int count2(int x)
{
  int c=0;
  while(x)
  {
    c+=x & 0x1;
    x>>=1;
  }
  return c;
}
 
//每次將最后一個1處理成0，統(tǒng)計(jì)處理次數(shù)
int count3(int x)
{
  int c=0;
  while(x)
  {
    x&=(x-1);
    c++;
  }
  return c;
}