# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Name |
---|
Problem E (LISDL) was already appeared on Topcoder SRM 332 Div1 Hard . (Although I didn't know this problem during the contest)
and SnackDown Online Pre- elimination Round B 2016 as well
I think I have a better analysis for nim problem which gives .Though it is not a big improvement.I want help to find what is the fault in my method if there is any. So idea is when that ceil(n/k)> , do a single step. And when ceil(n/k)<= .try to reduce ceil value by 1.Remember that N is original number and n is intermediate number.
Each of the two steps cannot take place more than times.Complexity is .
Please find fault in it.
Seems obvious to me. The number of steps where we subtract is and the number of steps where we subtract is also . Approximating the Euler limit is overkill.