HDOJ_Binary Numbers

Problem Description
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.

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

思路：由于n是正整数所以可以右移，若含负数则不行。
坑：最后一个结果后面不能有空格

#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int d;
    cin >> d;
    while (d--)
    {
        int n;
        cin >> n;
        vector<int> result;
        for (int i = 0; i < 32; ++i)
        {
            if (n&1 == 1)
            {
                result.push_back(i);
            }
            n >>= 1;
        }
        cout << result[0];
        for (int i = 1; i < result.size(); ++i)
        {
            cout << " " << result[i];
        }
        cout << endl;
    }
    return 0;
}