# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 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.