can any one give me hints for these problem Link
I found an editorial in Chinese so I am here for the help!!
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
can any one give me hints for these problem Link
I found an editorial in Chinese so I am here for the help!!
Name |
---|
The last 7 pages of the official editorial include an English translation of the problem editorial.
bruh nevermind
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)
how stupid of me... (1<<n) with n = 2000, sorry)