2417_Lowest Bit
2014-08-25 11:45
274 查看
Lowest Bit
Time Limit: 2 Seconds
Memory Limit: 65536 KB
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
给一个10进制数, 求它二进制后, 从最低位1开始构成的数。88的二进制为1011000,1000 结果是 8 26 的二进制为 11010 10 结果是 2 循环取余,找到第一个 1 为止
Time Limit: 2 Seconds
Memory Limit: 65536 KB
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
给一个10进制数, 求它二进制后, 从最低位1开始构成的数。88的二进制为1011000,1000 结果是 8 26 的二进制为 11010 10 结果是 2 循环取余,找到第一个 1 为止
#include<iostream> #include<cmath> using namespace std; int main() { int num; int a; int count; while(cin>>num&&num) { count=0; while(num!=0)//二进制依次从低位到高位求 { a=num%2; if(a==0) count++; else//遇到第一个1即停止 break; num=num/2; //cout<<a<<endl; } cout<<pow(2,count)<<endl; } return 0; }
相关文章推荐
- zoj 2417 Lowest Bit(简单的模拟)
- zoj 2417.Lowest Bit
- ZOJ 2417-Lowest Bit
- zoj 2417 Lowest Bit
- ZOJ 2417 Lowest Bit
- ZOJ Problem Set–2417 Lowest Bit
- zoj 2417 Lowest Bit
- zoj 2417 Lowest Bit
- zoj 2417 Lowest Bit
- zoj 2417 Lowest Bit
- zoj 2417 Lowest Bit
- ZOJ 2417 Lowest Bit
- 杭电 1196 Lowest Bit
- 杭电水题--1196 Lowest Bit (bitset:to_string有关问题)
- POJ 2417 Discrete Logging(离散对数-小步大步算法)
- POJ 2417 Discrete Logging 离散对数
- HDU 1196 Lowest Bit (数位)
- hdu 1196 Lowest Bit
- ZOJ 2417解题报告(炫酷)
- poj 2417 Discrete Logging(baby-step算法)