When submitting a solution in C++, please select either C++14 (GCC 6-32) or C++17 (GCC 7-32) as your compiler. ×

Anomy_1547's blog

By Anomy_1547, history, 3 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

| Write comment?
»
3 years ago, # |
  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.

»
3 years ago, # |
Rev. 2   Vote: I like it -15 Vote: I do not like it

bruh nevermind

  • »
    »
    3 years ago, # ^ |
      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)

    • »
      »
      »
      3 years ago, # ^ |
        Vote: I like it -11 Vote: I do not like it

      how stupid of me... (1<<n) with n = 2000, sorry)