Lowest Bit

最新推荐文章于 2022-09-21 14:32:43 发布

ljf_study

最新推荐文章于 2022-09-21 14:32:43 发布

阅读量333

点赞数

CC 4.0 BY-SA版权

文章标签：水题编程计算机杭电OJ

本文链接：https://blog.youkuaiyun.com/ljf_study/article/details/62036380

Lowest Bit

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 3381 Accepted Submission(s): 2271

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 <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
using namespace std;

int main()
{
    int n,t;
    while(scanf("%d",&n) && n){
        t = 1;
        while(n){
            if(n%2==1)break;
            else {
                t *= 2;
                n = n/2;
            }
        }
        cout<<t<<endl;
    }


    return 0;
}