hdu1196 Lowest Bit
来源:互联网 发布:淘宝编辑宝贝流程 编辑:程序博客网 时间:2024/06/05 17:07
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
题目大意:
十进制数转换成二进制,输出最低位
源代码:
#include <stdlib.h>
#include<string.h>
#include <stdio.h>
int main()
{
int n,i,k,l,a[15]={0};
char s[15];
while(scanf("%d",&n)&&n)
{
itoa(n,s,2); //进制转换的函数,特简单
//printf("%s\n",s);
for(i=strlen(s)-1;i>=0;i--)
if(s[i]=='1')
{
#include<string.h>
#include <stdio.h>
int main()
{
int n,i,k,l,a[15]={0};
char s[15];
while(scanf("%d",&n)&&n)
{
itoa(n,s,2); //进制转换的函数,特简单
//printf("%s\n",s);
for(i=strlen(s)-1;i>=0;i--)
if(s[i]=='1')
{
l=strlen(s)-i;
break;
break;
}
k=1;
for(i=0;i<l-1;i++)
k=k*2;
printf("%d\n",k);
}
return 0;
}
k=1;
for(i=0;i<l-1;i++)
k=k*2;
printf("%d\n",k);
}
return 0;
}
0 0
- HDU1196:Lowest Bit
- hdu1196(Lowest Bit)
- HDU1196 Lowest Bit
- hdu1196 Lowest Bit
- hdu1196 Lowest Bit
- hdu1196 Lowest Bit
- HDU1196 ZOJ2417 Lowest Bit
- ZOJ2417&&HDU1196-Lowest Bit
- HDU1196 Lowest Bit
- hdu1196 Lowest Bit
- Lowest Bit(hdu1196,位运算)
- Lowest Bit
- Lowest Bit
- 【Lowest Bit】
- Lowest Bit
- Lowest Bit
- Lowest Bit
- Lowest Bit
- 关于谓词NSPredicate的使用
- 2、定义路障僵尸类: 实例变量:僵尸种类、僵尸总血量、僵尸每次失血量,道具,弱点。方法:初始化方法(设置僵尸种类,总血量)、被打击失血、失去装备、死亡。
- 环境变量的配置
- 如何在Mac下简历wifi热点
- myeclipse 无法查看svn状态,但能提交和更新
- hdu1196 Lowest Bit
- Android中列出手机的所有应用和剩余内存使用情况
- Windows下搭建PHP开发环境
- 【ZOJ】2532 Internship 最小割——关键割边
- [Web 性能] repaint and reflow (重绘和回流)
- TCP保活(TCP keepalive)
- 递归求解几类排列组合问题(一、类循环组合排列)
- 在圣地争夺战开启时,攻击方的成员会进入圣地准备区,
- voj1264 LCS