I've tried all test cases from uDebug and some random test case but could not find out wrong answer.
Is there any corner cases, which i've been not taking?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I've tried all test cases from uDebug and some random test case but could not find out wrong answer.
Is there any corner cases, which i've been not taking?
Name |
---|
Not sure what your solution is or why are you taking max but i guess the solution should look something like this :
$$$dp[val][cnt] = \displaystyle\sum_{x=1}^{val} dp[val-x][cnt-1]$$$ with base case $$$dp[0][0] = 1$$$
Where $$$dp[i][j]$$$ means the number of ways to get sum $$$i$$$ with exactly $$$j$$$ coins. You can answer all the other types using these dp values.