Problem - 1196 : Lowest Bit

最新推荐文章于 2022-06-29 14:27:34 发布

咕噜咕噜斯基

最新推荐文章于 2022-06-29 14:27:34 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM C/C++ 文章标签： output input integer each

本文链接：https://blog.youkuaiyun.com/KISSMonX/article/details/7603403

C/C++ 同时被 2 个专栏收录

89 篇文章

订阅专栏

ACM

6 篇文章

订阅专栏

本文介绍了一个简单的C语言程序，该程序能够接收一个正整数输入，并输出该整数二进制表示中最低位的1所对应的数值。通过对输入值进行逐位检查，程序能准确找到并打印出最低位的1。例如，输入26时输出2，输入88时输出8。

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

/*
*************************************************************************************************
                                                Lowest Bit

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>

int main (void)
{
    int a;
    int i;

    while (scanf("%d", &a) != EOF)
    {
        if (0 == a || a > 100 || a < 1) {           // 违规处理
            break;
        }

        for (i = 0; i < 8; i++) {                   // 最多 8 位 即 1000 0000 = 128
            if (a & (0x01 << i)) {
                printf("%d\n", (a & (0x01 << i)));
                break;
            }
        }
    }

    return 0;
}