英语翻译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.ExampleThe positions of 1's in the binary representation of 13 are 0,2,3.TaskWrite a program which for ea

来源:学生作业帮助网 编辑:作业帮 时间:2024/05/15 03:34:59

英语翻译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.ExampleThe positions of 1's in the binary representation of 13 are 0,2,3.TaskWrite a program which for ea
英语翻译
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.
TaskWrite 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.InputThe 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.
OutputThe 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.
Sample Input1
13
Sample Output
0 2 3

英语翻译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.ExampleThe positions of 1's in the binary representation of 13 are 0,2,3.TaskWrite a program which for ea
一个整数用二进制表示,找出二进制表示法中1的位置
比如 13 二进制表示:1101
所以1的位置就是0 2 3