zoukankan      html  css  js  c++  java
  • Hdu1196 Lowest Bit

    Lowest Bit

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

    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

    26

    88

    0

    Sample Output

    2

    8

    #include<stdio.h> 
    int main()  
    {  
        int num,sum,i,j,temp;  
        while(scanf("%d",&num)&&num!=0)  
        {  
            sum=1;temp=0;  
            for(i=1;temp==0;i++)  
            {  
                temp=num%2;  
                num=num/2;  
            }  
            for(j=1;j<i-1;j++)  
            	sum=sum*2;  
            printf("%d
    ",sum);
        }  
        return 0;  
    }  
    

      

  • 相关阅读:
    day5模块
    day5时间复杂度
    day5冒泡排序
    day4正则表达式
    C语言 经典编程100题
    C语言 第八章 函数、指针与宏
    C语言 第七章 数组与字符串
    C语言 第六章 多重循环
    C语言 第五章 循环结构
    C语言 第四章 分支结构练习
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7057924.html
Copyright © 2011-2022 走看看