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

Anomy_1547's blog

Need Help with this problem!
By Anomy_1547, history, 5 years ago, In English

can any one give me hints for these problem Link

I found an editorial in Chinese so I am here for the help!!

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

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

The last 7 pages of the official editorial include an English translation of the problem editorial.

→ Reply
»
5 years ago, hide # |
← Rev. 2  
Vote: I like it -15 Vote: I do not like it

bruh nevermind

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

    You do realise that the value $$$2^{n-1}$$$ will require $$$O(n)$$$ space and that if statement (or even addition) will no longer be a constant operation. It'll take $$$O(n)$$$ time to do these operations (assuming you store them in a proper Big Integer datatype and not what you have written here)

    → Reply