Problem 1226. Non-zero bits in 10^n.
Given an integer that is a power of 10, find the number of non-zero bits, k, in its binary representation.
- n = 1, 10^n = 1010, so k = 2.
- n = 5, 10^n = 11000011010100000, so k = 6.
The solution should work for arbitrarily large powers n, say at least till n = 100.