NOJ [1328] TT Had a Cow

• 问题描述
• Smart TT across the maze safety, she met the big boss! Boss used his power again, then many pillars Drilled out from ground, that hurt TT's army seriously. TT was very angry, luckily, TT also owns some ability. the pillar's height was different, every time TT could choose one or some pillars to destroy, she can cut the same height, but she can't cut more than a pillar's height, that means, if the pillar is 1 2 3 4 5 6, TT could choose 4 5 6, each cut 2(become 2 3 4)or 4(become 0 1 2), but she can't cut 5, because 4 can't cut 5, 0 means this pillar was destroyed. Because her limited power, please calculate the minimun times to destroy all the pillars.
  
• 输入
• There are many cases. Each case with a integer N(1 <= N <= 2^32), means 1 to N pillars, the ith pillar's height is i.
• 输出
• for each case, output the minimun times to destroy all the pillars.
  
  
  
  
  规律题
  1——1     =1
  2——3     =2
  4——7     =3
  8——15   =4
  ............
  2^n——2^(n+1)-1 =n+1

  #include<stdio.h>
  #include<math.h>
  
  int main()
  {
    int n;
    while(~scanf("%d",&n))
    {
      int left=1,right=1;
      if(n==1)
        printf("1\n");
      else
      {
      while(1)
      {
        if(n<=right && n>=left)
        {
        	printf("%0.f\n",log(left)/log(2)+1);
          break;
        }
        else if(n>right)
        {
          left*=2;
          right=right*2+1;
        }
      }
      }
    }
    return 0;
  }