# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 159 |
5 | atcoder_official | 156 |
6 | djm03178 | 153 |
6 | adamant | 153 |
8 | luogu_official | 149 |
9 | awoo | 148 |
10 | TheScrasse | 146 |
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.