HDU 1196 Lowest Bit

最新推荐文章于 2017-07-23 14:57:16 发布

原创最新推荐文章于 2017-07-23 14:57:16 发布 · 721 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#output #input #integer #each

本文深入探讨了编程领域的基础知识、进阶技术和实践应用，旨在为开发者提供从入门到精通的全面指导。从选择合适的编程语言、理解数据结构与算法、到掌握版本控制和项目管理工具，再到高级主题如人工智能、大数据处理和自动化测试，本指南涵盖了编程领域的关键概念和技术。无论是初学者还是经验丰富的开发者，都能从中获益。

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

Answer

#include <iostream>
#include <cmath>
using namespace std;
int binary(int n)
{
int i,k=0,a[100];
while(n)
{
  a[k++]=n%2;
  n/=2;
}
for(i=0;i<k;i++)
  if(a[i])
   break;
return i;
}
int main()
{
int n,x;
while(cin>>n,n)
{
  x=binary(n);
  cout<<pow(2,x)<<endl;
}
return 0;
}