简单题，中间只是用到了进制转换，然后中间加一个条件就搞定啦！
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.
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
View Code
1 #include<stdio.h> 2 3 int fun( int n ) 4 { 5 int bit = 1; 6 while( n ) 7 { 8 if( n % 2 == 0 ) 9 bit *= 2; 10 else 11 break; 12 n = n / 2; 13 } 14 return bit; 15 } 16 int main() 17 { 18 int n; 19 while( (scanf( "%d",&n )==1)&&( n != 0 ) ) 20 printf( "%d\n", fun(n) ); 21 return 0; 22 }