Problem 52417. Get to a number faster.
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
J.R.! Menzinger
on 3 Aug 2021
The test suite is very weak... :-/
Apurbo Roy Chowdhury
on 4 Aug 2021
And I am a beginner :-)
Solution Comments
Show commentsProblem Recent Solvers12
Suggested Problems
-
Smallest distance between a point and a rectangle
178 Solvers
-
Similar Triangles - find the height of the tree
293 Solvers
-
Number of 1s in a binary string
8653 Solvers
-
Create a matrix X, where each column is a shifted copy of the vector v
201 Solvers
-
389 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!