Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

v-O_O-v's blog

An easy approach for the question 1152B. Neko Performs Cat Furrier Transform
By v-O_O-v, history, 8 years ago, In English

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

  • Vote: I like it
  • -16
  • Vote: I do not like it

Comments Comments (7)
| Write comment?
»
8 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

if u can understand python the refer to my solution https://codeforces.me/contest/1152/submission/53235674 starting from MSB following a greedy type appraoch

→ Reply
  • »
    »
    8 years ago, hide # ^ |
     
    Vote: I like it +2 Vote: I do not like it

    Can you explain your logic I have difficulty in reading python. Thanks!

    → Reply
    • »
      »
      »
      8 years ago, hide # ^ |
       
      Vote: I like it +1 Vote: I do not like it

      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

      → Reply
    • »
      »
      »
      8 years ago, hide # ^ |
       
      Vote: I like it +1 Vote: I do not like it

      sorry for the down vote by mistake:)

      → Reply