杭电 1196
来源:互联网 发布:局域网网络限速软件 编辑:程序博客网 时间:2024/06/07 09:51
Lowest Bit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7776 Accepted Submission(s): 5715
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.
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
26880
Sample Output
28
Author
SHI, Xiaohan
Source
Zhejiang University Local Contest 2005
题意:
给定一个十进制数字,求转化为二进制后的最后一位
思路:
根据位运算能极大地优化程序,求二进制的最低位可根据a&(-a)就能直接求出二进制的最后一位
代码如下:
<span style="font-size:14px;">#include<stdio.h>int main(){int n;while(~scanf("%d",&n),n){printf("%d\n",n&(-n));}return 0;}</span>
1 0
- 杭电 1196
- 杭电1196
- 杭电1196
- Lowest Bit,杭电1196
- 杭电
- 杭电
- 杭电
- 杭电acm水题 1196 Lowest Bit
- 杭电 HDU 1196 Lowest Bit
- 杭电oj 题目1196 Lowest Bit
- 杭电 1234 和 杭电 2115
- 杭电2056之Rectangles 杭电
- 杭电ACM1061Rightmost Digit
- 杭电2099 7.11
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电ACM1466
- 杭电ACM1003
- HDU 4907 Task schedule
- POJ2752 C代码
- 从搜索引擎优化的角度看域名包含关键词的重要性
- web.xml中listner标签的作用
- Android学习——content provider
- 杭电 1196
- crm使用soap删除关系
- Excel_VBA:根据条件设定背景色
- Java远程访问Domino数据库—DIIOP(2)
- 哈希表
- 测试流程积累
- OC学习(二)实例变量的可见度和几种常用方法
- hdu 1106排序
- 使用jq工具在Shell命令行处理JSON数据