Lowest Bit

Lowest Bit

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 34   Accepted Submission(s) : 17

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

 

 

Author

SHI, Xiaohan

 

 

Source

Zhejiang University Local Contest 2005

 

 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 #include <string.h>
 4 
 5 int main()
 6 {
 7     int num,sign,i,j,k,K,sum;
 8     char num_2[8],NUM_2[8];
 9     while(1)
10     {
11         scanf("%d",&num);
12         if(num==0)break;
13         itoa(num,num_2,2);
14         sign=strlen(num_2);
15         for(i=sign-1,j=1;i>=0;i--)
16         {
17             if(num_2[i]!='1')
18             {
19                 NUM_2[j]='0';
20                 j++;
21             }
22             else
23             {
24                 NUM_2[0]='1';
25                 NUM_2[j]='\0';
26                 break;
27 
28             }
29         }
30         k=strlen(NUM_2);
31         for(i=1,sum=1;i<k;i++)
32         {
33             sum*=2;
34         }
35         printf("%d\n",sum);
36 
37     }
38     return 0;
39 }

View Code

 

转载于:https://www.cnblogs.com/Wurq/p/3750283.html