Cricket Match

CodeChefRating 505Open on judge ↗

There is a cricket match in Chefland. Chef's team requires $N$ runs to win in $M$ overs. Given that $1$ over consists of $6$ balls and a player can score a maximum of $6$ runs in a ball, find whether Chef's team can win. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of two space-separated integers $N$ and $M$

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