Problem 44719. Penny Distribution Machine
A machine consists of a row of boxes. To start, one places N pennies in the leftmost box. The machine then redistributes the pennies as follows:
On each iteration, it replaces a pair of pennies in one box with a single penny in the next box to the right. The iterations stop when there is no box with more than one coin. For example, the figure below shows the working of the machine in distributing nine pennies by always selecting a pair of pennies in the leftmost box with at least two coins.
Itr 0: 9 0 0 0 Itr 1: 7 1 0 0 Itr 2: 5 2 0 0 Itr 3: 3 3 0 0 Itr 4: 1 4 0 0 Itr 5: 1 2 1 0 Itr 6: 1 0 2 0 Itr 7: 1 0 0 1
Determine the number of boxes and iterations needed by the machine to distribute N pennies. From the example above, the machine requires four boxes and seven iterations to distribute nine pennies.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers22
Suggested Problems
-
3672 Solvers
-
Replace NaNs with the number that appears to its left in the row.
2984 Solvers
-
98 Solvers
-
Find the index of n in magic(n)
245 Solvers
-
105 Solvers
More from this Author18
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!