Problem 1226. Non-zero bits in 10^n.

Created by SK in Community

Solve Later

Given an integer that is a power of 10, find the number of non-zero bits, k, in its binary representation.

For example:

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.

Solve

Solution Stats

Last solution submitted on Jan 02, 2019

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Peter Wittenberg on 28 Jan 2013

I can't get the last three cases to work out. I've checked the answers a couple of different ways. I still get 26 1s in the binary for 10^100. Is there a defect in the solutions offered?

SK on 30 Jan 2013

The test cases are correct. In case you are using dec2bin, it is subject to loss of significance.

Problem 1226. Non-zero bits in 10^n.

Solution Stats

Last 200 Solutions

Problem Comments

Recent Solvers27

Suggested Problems

Tags

Problem 1226. Non-zero bits in 10^n.

Solution Stats

Last 200 Solutions

Problem Comments

Recent Solvers27

Suggested Problems

Tags

Players