HDU Lowest Bit（Java版解题）

最新推荐文章于 2018-08-07 13:17:34 发布

晨_暮

最新推荐文章于 2018-08-07 13:17:34 发布

阅读量278

点赞数 1

CC 4.0 BY-SA版权

分类专栏： java初学文章标签： acm java

本文链接：https://blog.youkuaiyun.com/u012999325/article/details/81194706

java初学专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一道关于求解整数最低位的编程题。题目要求对于给定的正整数A(1<=A<=100)，输出A的最低位。通过示例解释了如何将十进制数转换为二进制，并确定最低位。提供了Java实现代码，使用Integer.lowestOneBit方法直接求解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Lowest Bit

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

Total Submission(s): 3770 Accepted Submission(s): 2519

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

import java.util.ArrayList;
import java.util.Scanner;

public class Main {

	public static void main(String args[])
    {
        Scanner cin = new Scanner(System.in);
        while(cin.hasNext()){
            int m = cin.nextInt();
            if(m==0) break;
            System.out.println(Integer.lowestOneBit(m));
        }
        
    }


}

解题的时候需要注意，这里有个坑，输入输出事例那里题目描述不太准确，应该是输入一个数字然后再输出个数字

输入0结束程序运行，大家注意下吧