若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。


  • 运维

  • 前端

  • 编程

  • 随笔

  • hust-oj

1663: Lowest Bit

发表于 2017-10-06   |   分类于 HUSTOJ   |   阅读次数 1,375

题目描述

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.

输入

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.

输出

For each A in the input, output a line containing only its lowest bit.

样例输入

26
88
0

样例输出

2
8

参考代码

#include<stdio.h>
int main() 
{
    int a;
    while(scanf("%d",&a)==1&&a!=0) 
    {
        int b[7];
        int i=0;
        do 
        {
            if(a/2==0)break;
            b[i++]=a%2;
            a=a/2;
        }
        while(a/2);
        b[i]=a%2;
        int j=0;
        for (j;j<=i;j++) 
        {
            if(b[j]!=0)break;
        }
        int sum=1;
        for (i=0;i<j;i++) 
        {
            sum*=2;
        }
        printf("%dn",sum);
    }
return 0;
}

解析

暂无

hustoj

发表评论 取消回复

邮箱地址不会被公开。 必填项已用*标注

*
*


hoxis wechat
著作权归作者所有
站点更新说明
  • 文章目录
  • 站点概览
若是凉夜已成梦

若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。

1904 日志
6 分类
12 标签
RSS
weibo github twitter facebook

友情链接

原站点 Dreams孤独患者 Skip
© 2017 若是凉夜已成梦
Powered by WordPress | 已运行
Theme By NexT.Mist