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)
http://acm.timus.ru/problem.aspx?space=1&num=1353
»
flashmt
|
12 years ago,
#
|
0
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
|