I am trying to solve this problem: https://www.urionlinejudge.com.br/judge/pt/problems/view/1138
At first, my references was these posts:
But i am getting problems when i try to save the results into a dp table. Can someone tell what are the states of my memoization?
My code (the parts with memoization are commented): https://ideone.com/AOwBpQ
My strategy is: for each digit, compute the number of its occurrences in F(B) and in F(A — 1). The answer (for that digit) is computed by
F(B) - F(A - 1). Without dynamic programming techniques, it solves the problem, despiste the slowness. Some problems that i solved earlier got accepted with the following states:
dp[current_digit][number_formed][leftmost_lo][leftmost_hi], but in this particular problem, the number formed might be to high.