Set bits and their positions
For N, print three values joined by #: the number of 1 bits, the position of the lowest 1 bit and the position of the highest 1 bit (positions count from 0 at the right). 10 is 1010, so the answer is 2#1#3.
Reported in: Tech Mahindra (2024) (memory-based)
Input
One line: N.
Output
count#lowest#highest
Constraints
1 ≤ N ≤ 10^18.
Example 1
Input:
10
Output:
2#1#3Example 2
Input:
15
Output:
4#0#3Hint: Count ones with a loop; the lowest position is where the first 1 appears from the right, the highest is bit_length − 1.