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 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 160 |
4 | atcoder_official | 159 |
4 | Um_nik | 159 |
6 | djm03178 | 156 |
7 | adamant | 153 |
8 | luogu_official | 149 |
8 | awoo | 149 |
10 | TheScrasse | 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 |
---|