| Lowest Bit |
|Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB |
| Total submit users: 115, Accepted users: 112 |
| Problem 10021 :
No special judgement
| Given an positive integer A (1 <= A <= 10^9), 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.
| Each line of input contains only an integer A (1 <= A <= 109). A line containing "0" indicates the end of input, and this line is not a part of the input data.|
| For each A in the input, output a line containing only its lowest bit.|
| HNU 1'st Contest|