I'm stuck on MLE at a 3 month old problem, I feel I should complete that, Please take a look and help me out 1981C - Turtle and an Incomplete Sequence My code : 264590950 PS: My code is a bit complex, but my idea is very similar to the one given in the editorial of this contest, by traversing, x/2 2x and 2x+1, until I reach my required value, also adhering to constraints
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | nor | 157 |
| 4 | atcoder_official | 156 |
| 4 | cry | 156 |
| 6 | -is-this-fft- | 155 |
| 7 | maroonrk | 154 |
| 7 | adamant | 154 |
| 9 | Um_nik | 152 |
| 10 | djm03178 | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/01/2024 09:13:35 (l2).
Desktop version, switch to mobile version.
Supported by
can step number be equal to n? i mean n==step