Lowest Bit

最新推荐文章于 2018-08-10 09:16:58 发布

lalalallalalalala

最新推荐文章于 2018-08-10 09:16:58 发布

阅读量274

点赞数

分类专栏： hdu oj 文章标签：程序 acm

本文链接：https://blog.csdn.net/windywo/article/details/47108851

版权

hdu oj 专栏收录该内容

33 篇文章 0 订阅

订阅专栏

Problem Description

Given an positive integer A (1 <= A <= 100), output the lowest bit of A.

For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2.

Another example goes like this: given A = 88, we can write A in binary form as 1011000, so the lowest bit of A is 1000, so the output should be 8.

Input

Each line of input contains only an integer A (1 <= A <= 100). A line containing "0" indicates the end of input, and this line is not a part of the input data.

Output

For each A in the input, output a line containing only its lowest bit.

Sample Input

26
88
0

Sample Output

2
8

================================================================================

#include<stdio.h>
#include<string.h>
#include<math.h>
#define max_len 1000//不定义max_len而把它在数据中当作数输入时若在第一个for中没有if...break时会陷入无止尽的循环中，不能得到结果,无输出
int main()
{
int a,i,b[max_len],c[max_len],min;
while(scanf("%d",&a)!=EOF)
{
  if(a==0)
  break;
  else
  {
   memset(b,0,sizeof(b));
   memset(c,0,sizeof(c));
   b[0]=a%2;
   c[0]=a/2;
   for(i=1;i<max_len;i++)
   {
    c[i]=c[i-1]/2;
    b[i]=c[i-1]%2;//注意算法，二进制的转换
    if(c[i]==0)
    break;
   }
   for(i=0;i<max_len;i++)
   {
    if(b[i]==1)
       {
       min=pow(2,i);
       break;
       }
       else
       continue;
   }
   printf("%d\n",min);
  }
}
return 0;
}