Query Game

CodeChefOpen on judge ↗

You are given a sequence of positive integers $A_1, A_2, \ldots, A_N$ and a fraction $p = x/y$. Chef and Chefina play a game on this sequence. They alternate turns; Chef plays first. In each turn, the current player must choose either the first element (with probability $p$) or the last element (with probability $1-p$) of the current sequence and delete that element. The game continues for $K$

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI