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
-
256 Solvers
-
Matrix which contains the values of an other matrix A at the given locations.
240 Solvers
-
95 Solvers
-
Test if two numbers have the same digits
267 Solvers
-
334 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 :-)