zoukankan      html  css  js  c++  java
  • hdu 2051

    Bitset

    Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 8457    Accepted Submission(s): 6552

    Problem Description
    Give you a number on base ten,you should output it on base two.(0 < n < 1000)
    Input
    For each case there is a postive number n on base ten, end of file.
    Output
    For each case output a number on base two.
    Sample Input
    1 2 3
    Sample Output
    1 10 11
    Author
    8600 && xhd
    Source
    Recommend
    linle
    解题:输出二进制数
        #include <stdio.h>
        int main()
        {
            int b[11], n, i;
            while (~scanf("%d", &n))
            {
                i = 0;
                while(n)
                {
                    b[i++] = n % 2;
                    n /= 2;
                }
                i--;
                while(i >= 0)
                    printf("%d", b[i--]);
                printf("
    ");
            }
            return 0;
        }
  • 相关阅读:
    网页抓取
    基本数据结构
    小节
    顺序统计量
    线性时间排序
    快速排序
    堆排序 Heapsort
    大数运算
    趣味题,文本中洞的数量
    nginx config配置
  • 原文地址:https://www.cnblogs.com/biong-blog/p/4421619.html
Copyright © 2011-2022 走看看