If you start with $1 and, with each move, you can either double your money or add another $1, what is the smallest number of moves you have to make to get to exactly n(number).
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers16
Suggested Problems
-
424 Solvers
-
Sum all integers from 1 to 2^n
18132 Solvers
-
359 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
462 Solvers
-
Test if two numbers have the same digits
267 Solvers
More from this Author1
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
The test suite is very weak... :-/
And I am a beginner :-)