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
-
440 Solvers
-
557 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1035 Solvers
-
28 Solvers
-
Return fibonacci sequence do not use loop and condition
519 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!