Minimal steps down to 1: Difference between revisions
Content added Content deleted
(→Python: Tabulated: Allied problem.) |
|||
| Line 546: | Line 546: | ||
===Python: Tabulated=== |
===Python: Tabulated=== |
||
The tabulated algorithm solves the allied problem of "Find the minimum steps in going from 1 to N, where at each step a member of D can be a multiplier or a member of S can be added". <br> |
|||
The stretch goal is attempted.<br> |
The stretch goal is attempted.<br> |
||
The table to solve for N contains all the results from 1 up to N. This is used in the solution. |
The table to solve for N contains all the results from 1 up to N. This is used in the solution. |
||