Binary Numbers

2020年1月17日 1021点热度 0人点赞 0条评论

Binary Numbers

时间: 1ms        内存:64M

描述:

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

提示:

参考答案:

解锁文章

没有看到答案?微信扫描二维码可免费解锁文章

微信扫描二维码解锁

使用微信扫描二维码打开广告页面后可以立即关闭,再刷新此页面即可正常浏览此文章

所跳转广告均由第三方提供,并不代表本站观点!

已经扫描此二维码?点此立即跳转

code

这个人很懒,什么都没留下

文章评论