HDUOJ_1196(二进制-十进制)

最新推荐文章于 2020-10-13 20:58:19 发布

hpulw

最新推荐文章于 2020-10-13 20:58:19 发布

阅读量507

点赞数

分类专栏： HDUOJ 快速幂进制转换

本文链接：https://blog.csdn.net/hpulw/article/details/48015483

版权

HDUOJ 同时被 3 个专栏收录

92 篇文章 0 订阅

订阅专栏

进制转换

4 篇文章 0 订阅

订阅专栏

快速幂

3 篇文章 0 订阅

订阅专栏

HDUOJ_1196(二进制-十进制)

Lowest Bit

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9713 Accepted Submission(s): 7134

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

Sample Output

2
8

题意：把十进制数转换为二进制数时，记录第一个1出现的位置，输出这个1和前面的0组成的二进制数相对应的十进制数。

My solution:

/*2015.8.26* /

#include<stdio.h>
int mi(int j)/*快速幂*/
{
	int ans=1,v=2;
	while(j>0)
	{
		if(j%2)
		ans*=v;
		v*=v;
		j/=2;
	}
	return ans;
}
int  main()
{
	int i,j,n,q;
	while(scanf("%d",&n)==1&&n)
	{
		q=0,i=0;
		while(n>0)
		{
			q++;
			if(n%2)/* 这里求1最先出现的位置（从左往右）*/
			{
				i=q;
				break;
			}
			n/=2;
		}
		j=i-1;/*j求的是1后面的0的个数*/ 
		printf("%d\n",mi(j));/*求2的j次方*/ 
	}
	return 0;
}