Does anyone have a simpler approach of solving this problem? Please share with me.

Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years.
×

# | User | Rating |
---|---|---|

1 | MiFaFaOvO | 3681 |

2 | tourist | 3496 |

3 | apiadu | 3438 |

4 | TLE | 3356 |

5 | LHiC | 3339 |

6 | mnbvmar | 3281 |

7 | 300iq | 3267 |

8 | Radewoosh | 3242 |

9 | yosupo | 3233 |

10 | 1919810 | 3203 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 190 |

2 | antontrygubO_o | 186 |

3 | tourist | 182 |

4 | Radewoosh | 168 |

5 | vovuh | 167 |

6 | pikmike | 166 |

7 | ko_osaga | 161 |

7 | Um_nik | 161 |

9 | rng_58 | 155 |

10 | Petr | 154 |

Does anyone have a simpler approach of solving this problem? Please share with me.

↑

↓

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/27/2020 02:53:44 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

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

your approach is intuitive, Thanks

can you find the mistake in my code? I am new to coding. Here is my solution,I got testcase 4 wrong!! solution

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!.

Thanks for asking the doubt , my doubt is also cleared.