| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 151 |
why does recursive code fail for some test cases ?
Hi!
I was trying the at coder DP contest and I wrote a recursive DP solution for problem A . It works fine for 7 test cases but fails for last 4.
The point that is disturbing me is that, similar logic but iterative code of DP is getting accepted for other people.
Can someone please help me with this or point out my mistake if I am doing a foolish one. Thanks in advance.
This is my code
This is the iterative code that works
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en7 |
|
anipnwr | 2021-04-29 12:24:45 | 0 | (published) | |
| en6 |
|
anipnwr | 2021-04-29 12:23:26 | 2 | Tiny change: 'sh one. \nThis is ' -> 'sh one. \n\nThis is ' | |
| en5 |
|
anipnwr | 2021-04-29 12:23:10 | 44 | ||
| en4 |
|
anipnwr | 2021-04-29 12:22:25 | 5 | ||
| en3 |
|
anipnwr | 2021-04-29 12:18:29 | 351 | ||
| en2 |
|
anipnwr | 2021-04-29 12:12:27 | 45 | ||
| en1 |
|
anipnwr | 2021-04-29 12:10:12 | 659 | Initial revision (saved to drafts) |
