| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 163 |
| 3 | awoo | 161 |
| 4 | nor | 152 |
| 5 | maroonrk | 151 |
| 5 | -is-this-fft- | 151 |
| 7 | TheScrasse | 148 |
| 8 | atcoder_official | 146 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
TOPCODER SRM 665 Div1 Easy
Hey I can't seem to formulate the DP for [this] ? (http://community.topcoder.com/stat?c=problem_statement&pm=13964&rd=16514&rm=326779&cr=10574855)
I understand that the solution space is reduced to 3^n as compared to 4^n, and that we have to work on individual digits of the sum, but I'm unable to grasp how to take care of the carry and how that would fit in the DP formulation ?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en1 |
|
baldvaritesh | 2015-09-11 06:53:15 | 410 | Initial revision (published) |
