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)
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | cry | 161 |
2 | maomao90 | 160 |
3 | awoo | 159 |
4 | atcoder_official | 157 |
5 | -is-this-fft- | 155 |
5 | nor | 155 |
5 | adamant | 155 |
8 | Um_nik | 152 |
8 | maroonrk | 152 |
10 | djm03178 | 146 |
http://acm.timus.ru/problem.aspx?space=1&num=1353
»
![]() ![]() flashmt
|
13 years ago,
#
|
![]() ![]() 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
|
Name |
---|