| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Here is problem:http://acm.timus.ru/problem.aspx?space=1&num=1658
for which test case my solution is wrong:https://ideone.com/AKSZX6??
i did dp[0][0]=1 which is different from AC solution
No one in this world to help.
If no one gonna help i will loose My faith in humanity :( onwards
The dp calculates number of digits in the answer and when you reach (0,0) state you use all the digits so it must return 0 because after this computation stops. Also remove equal sign from check condition to get minimum number.
Solution = https://pastebin.com/36qf9Sfh