| # | User | Rating |
|---|---|---|
| 1 | tourist | 3856 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3462 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 162 |
| 3 | Dominater069 | 160 |
| 4 | Um_nik | 158 |
| 5 | atcoder_official | 157 |
| 6 | Qingyu | 155 |
| 7 | djm03178 | 151 |
| 7 | adamant | 151 |
| 9 | luogu_official | 150 |
| 10 | awoo | 147 |
Hey thanks for helping me , I am not getting why this code not getting accepted like there are just three cases and it is failing at 2071 test case {compiler message -> wrong answer 2071st numbers differ — expected: '45', found: '46'}
Please help me this are my submission and below is question link, 307205360,307211125
problem -> 2005B1 - The Strict Teacher (Easy Version)
Hey Codeforces community,
I'm currently trying to solve problem 2069C from a recent Codeforces round and am exploring a dynamic programming approach for it. However, I'm struggling to implement it efficiently.
Here's what I have understood so far: Problem link -> 2069C - Beautiful Sequence A brute force solution seems infeasible due to [mention constraints]. I believe DP can be applied by but i am new to dp , so i am not getting how to think help
