| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | SecondThread | 145 |
| 9 | pajenegod | 145 |
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