# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
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.