Hi4ko's blog

Timus, Problem #1353
By Hi4ko, 15 years ago, translation, In English

http://acm.timus.ru/problem.aspx?space=1&num=1353

my code has WA #11 

How to solve it correctly with DP?

Or give me a little hint, please)
  • Vote: I like it
  • -3
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
15 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
Let F[i][s] is the amount of number with i digits whose sum is s. F[i][s] = sum(F[i-1][s-k]) with k=0...9.
→ Reply