The Unbounded Dimension

**Scenario.** dp over 'number of operations used' blows up because operations can be 10^18. What is the standard repair? **Which approach is the best fit? The program only needs to print the letter.** **A)** Use long long and hope **B)** Flip the table: dp over 'value achieved' storing min operations — the value dimension is bounded **C)** Binary search the answer instead **D)** Drop the dimension; greedily apply operations