| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
Dare2Compete coding challenge question. HELP???
You start with 0 and you have to Find the minimum number of operations to reach 'n'. In one operation you can add or subtract any 2^k to your current number. Where k can be any positive integer. Constraints: test cases <200,000; 1 <= | n | <= 1,000,000,000 .
Example: INPUT: 5 1 2 0 6 10 OUTPUT: 1 1 0 2 2 Can anybody help??
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
basantCoder | 2021-09-20 10:51:40 | 170 | Tiny change: '\nExample:\n\nINPUT: \n\nFirst li' -> '\nExample:<br>\nINPUT: <br>\nFirst li' | |
| en1 |
|
basantCoder | 2021-09-20 10:42:09 | 396 | Initial revision (published) |
