Does anyone have a simpler approach of solving this problem? Please share with me.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Does anyone have a simpler approach of solving this problem? Please share with me.
Name |
---|
if u can understand python the refer to my solution https://codeforces.com/contest/1152/submission/53235674 starting from MSB following a greedy type appraoch
Can you explain your logic I have difficulty in reading python. Thanks!
first of all i converted the number into its binary and then checked if all bits are set if not then i start traversing from the most significant bit if a bit is set then continue else i calculated the length of all the bits starting from that '0' bit and then xored it with the number(all bits set with the lenght i calculated) AND then checked if the number becomes 2^n-1 (break if yes) else continue till the number becomes 2^n-1 (till we reach the last bit). take an example and u will understand refering to my code
Thanks! Understood
sorry for the down vote by mistake:)
No problem. I don't care about those a question is a question l.
I finally solved it using almost the same idea of yours. AC in 7 goes. my solution Thanks!.