Блог пользователя madhur4127

Автор madhur4127, история, 7 лет назад, По-английски

I found no blog on ABC 90 or ARC 091 discussion, so let's discuss problem here:

ARC 091 — Link

ABC 090 — Link

If similar blog exists, notify me and I will delete this.

  • Проголосовать: нравится
  • +12
  • Проголосовать: не нравится

»
7 лет назад, # |
  Проголосовать: нравится +3 Проголосовать: не нравится

Problem E (LISDL) was already appeared on Topcoder SRM 332 Div1 Hard . (Although I didn't know this problem during the contest)

»
7 лет назад, # |
  Проголосовать: нравится +34 Проголосовать: не нравится

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.

  • »
    »
    7 лет назад, # ^ |
      Проголосовать: нравится -9 Проголосовать: не нравится

    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.