The Tom and Jerry Game!

CodeChefRating 1337Open on judge ↗

As usual, Tom and Jerry are fighting. Tom has strength $TS$ and Jerry has strength $JS$. You are given $TS$ and your task is to find the number of possible values of $JS$ such that Jerry wins the following game. The game consists of one or more turns. In each turn: - If both $TS$ and $JS$ are even, their values get divided by $2$ and the game proceeds with the next turn. - If both $TS$ and $J

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