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
-
Omit columns averages from a matrix
579 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3015 Solvers
-
How long is the longest prime diagonal?
391 Solvers
-
100 Solvers
-
557 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!