ZOJ1383 Binary Numbers

Binary Numbers

题目传送门~

Time Limit: 2000 msMemory Limit: 65536 KB

Given a positive integer n, print out 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.

Input

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 <= 10^6.

Output

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.

Sample Input

1
13

Sample Output

0 2 3

---

题后两句话：

①这题一定要注意输入输出的组织，卡了我两次：第一次是最后一行不用换行符，加了个if切掉；第二个是每个数字的positions的最后一位后面没有空格，第一个看出来后Presentation Error还卡我懵了一下嘤嘤嘤，哈哈哈哈哈哈可能刷多了的大佬根本不会犯这种错误吧，向你们学习！

②这题切那个二进制位我用了换行运算符，有的小伙伴不知道咋用，简单说一下就是:">>1"右移一位嘛，相当于除2的一次方（对，没错，右移几位就是除2的几次方，那么左移就是乘...），好der~就说这么多。

---

#include<iostream>
using namespace std;
int main()
{
	int num,n,t;
	cin>>num;
	while(num--){
		cin>>n;
		while(n){
			if(n%2){
				cout<<t;
				if(n/2!=0) cout<<" ";
			}
			t++;
			n=n>>1; 
		}
		t=0;
		if(num) cout<<endl;
	}
	return 0;	
}