|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|0.25 초||512 MB||18||16||16||88.889%|
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.
Write a program that:
The first and only line of the input contains exactly one integer n, 1 ≤ n ≤ 106.
The output should contain increasing sequence of integers separated by single spaces — the positions of 1’s in the binary representation of the input number.
0 2 3