acm--Lowest Bit

题目

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

分析

因为输入A的范围小于100，所以定义一个有效长度为8的整型数字存放二进制数据，遍历数组，遇到第一个1后跳出循环，用pow()函数即可得到正确结果

代码

#include<stdio.h>
#include<math.h>
int main(){
	int a,j,k,i,result;
	int s[8];
	while(scanf("%d",&a)!=EOF&&a){
		i=0;
		while(a){
			s[i] = a % 2;
			a = a / 2;
			i++;
		}
		for(j=0;j<i;j++)
			if(s[j]==1)  break;
		result =  pow(2,j);
		printf("%d\n",result);
	}
	return 0;
}