| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3846 |
| 2 | tourist | 3799 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3590 |
| 6 | Ormlis | 3533 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 9 | Um_nik | 3451 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | -is-this-fft- | 160 |
| 2 | Qingyu | 160 |
| 4 | atcoder_official | 157 |
| 5 | Dominater069 | 155 |
| 6 | adamant | 154 |
| 7 | djm03178 | 151 |
| 8 | luogu_official | 149 |
| 9 | awoo | 147 |
| 10 | Um_nik | 146 |
My submission (https://codeforces.net/contest/1948/submission/307669384) is giving the correct output (at least for the first 10 elements on test 2) on my laptop, but not on Codeforces. I don't understand why.
I have attached the image of my output too so you all can see!
I don’t get it, man. I can only solve very very basic recursion problems, but when I encounter problems like Tower of Hanoi or Josephus, my brain melts. I kind of understand what I need to do, but I have trouble translating that into recursive code.
