/*
*************************************************************************************************
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;
}
Problem - 1196 : Lowest Bit
最新推荐文章于 2023-04-13 15:25:33 发布