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 Solvers13
Suggested Problems
-
Remove all the words that end with "ain"
2634 Solvers
-
Find common elements in matrix rows
2713 Solvers
-
Back to basics 19 - character types
271 Solvers
-
Return a list sorted by number of consecutive occurrences
427 Solvers
-
Determine the number of odd integers in a vector
820 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 :-)