(Hdu simple question 128) Lowest Bit (evaluate the decimal number corresponding to the last non-zero Bit of a binary number), hdulowest
Question:
Lowest BitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission (s): 8722 Accepted Submission (s): 6428
Problem DescriptionGiven an positive integer A (1 <= A <= 100), output the lowest bit of.
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 shocould 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 shocould be 8.
InputEach 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.
OutputFor each A in the input, output a line containing only its lowest bit.
Sample Input
26880
Sample Output
28
AuthorSHI, Xiaohan
SourceZhejiang University Local Contest 2005
RecommendIgnatius. L | We have carefully selected several similar problems for you: 1200 1201 1008 1004 1106
Question Analysis:
Simple question. In the process of converting a decimal number to a binary number, you can constantly determine whether the current BIT is a non-zero bit.
Corresponding knowledge points:
At this time, you may need to review the process of 10-to-2 conversion:
The Code is as follows:
/** D. cpp ** Created on: March 11, 2015 * Author: Administrator */# include <iostream> # include <cstdio> # include <cmath> using namespace std; int main () {int n; while (scanf ("% d", & n )! = EOF, n) {int t = 0; while (n % 2 = 0) {t ++; n/= 2;} printf ("% d \ n ", (int) pow (2 + 0.0, t);} return 0 ;}