Asymmetric Cookies

CodeChefRating 2141Open on judge ↗

Alice and Bob have $N$ jars of cookies with them. The $i$-th jar has $A_i$ ($1 \leq A_i \leq 3$) cookies. They'll take turns eating the cookies, with Alice going first. However, they eat cookies in different ways. - On her turn, Alice will choose any jar that contains at least one cookie, and eat one cookie from it. - On his turn, Bob will choose any jar that contains at least one cookie, and:

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