10038

Lowest BitTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KBTotal submit users: 1424, Accepted users: 1318Problem 10038 : No special judgementProblem descriptionGiven an positive integer A (1 <= A <= 10⁹), 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.InputEach line of input contains only an integer A (1 <= A <= 10⁹). 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

2680

Sample Output

28

Problem Source

HNU 1'st Contest

#include <stdio.h>#include <math.h>int main(){    int num,k,bit;scanf("%d",&num);while(num != 0){k=fun(num);bit=pow(2,--k);printf("%d\n",bit);scanf("%d",&num);}  return 0;}int fun(int num){int i,j,k=0;do{i=num/2;j=num%2;k++;if(j == 0)num=i;else break;}while(1);return k;}