Hohol's blog

OpenCup гран-при Украины
By Hohol, 13 years ago, In Russian

Контест закончился, давайте пообсуждаем. Как решать C?

  • Vote: I like it
  • +25
  • Vote: I do not like it

»
13 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

I wonder how checker works on problem E.

→ Reply
  • »
    »
    13 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    Heard of Nim?

    → Reply
  • »
    »
    13 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    The problem won't change much if you replace K with 18 — K. According to the constraints (K <= 18, output length <= 2^9+36) a simple brute force checker should suffice: binom(18,9)*2^9 ≈ 25 millions, a factor of 18 being avoided by bit hacks

    → Reply
»
13 years ago, # |
  Vote: I like it -29 Vote: I do not like it

to slowww

→ Reply