若是凉夜已成梦

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


  • 运维

  • 前端

  • 编程

  • 随笔

  • hust-oj

1619: Binary Numbers

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

题目描述

Given a positive integer n, find the positions of all 1's in its binary representation. The position of the least significant bit is 0. Example The positions of 1's in the binary representation of 13 are 0, 2, 3. Task Write a program which for each data set: * reads a positive integer n, * computes the positions of 1's in the binary representation of n, * writes the result.

输入

The first line of the input contains exactly one positive integer d equal to the number of data sets, 1 ≤ d ≤ 10. The data sets follow. Each data set consists of exactly one line containing exactly one integer n, 1 ≤ n ≤ 106.

输出

The output should consists of exactly d lines, one line for each data set. Line i, 1 ≤ i ≤ d, should contain increasing sequence of integers separated by single spaces – the positions of 1's in the binary representation of the i-th input number. Do not output any spaces in the end of a line.

样例输入

1
13

样例输出

0 2 3

参考代码

#include<stdio.h>
int d=0,n=0;
int main() 
{
    while(scanf("%d",&d)!=EOF) 
    {
        while(d--) 
        {
            scanf("%d",&n);
            int ind=0;
            while(n>0) 
            {
                if(n&1) 
                {
                    printf("%d",ind);
                    ind++;
                    n/=2;
                    break;
                }
                ind++;
                n/=2;
            }
            while(n>0) 
            {
                if(n%2==1) printf(" %d",ind);
                ind++;
                n/=2;
            }
            printf("n");
        }
    }
    return 0;
}

解析

暂无

hustoj

发表评论 取消回复

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

*
*


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

若是凉夜已成梦

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

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

友情链接

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