Tom and Jerry

CodeChefOpen on judge ↗

Tom and Jerry are given $N$ numbers. Tom likes the numbers which are divisible by integer $X$ and Jerry likes the numbers which are not divisible by integer $Y$. Help them to select such numbers which are liked by both of them. For each given query print the count of such numbers. ###Input: - The first line contains a single integer $N$. * The next line contains $N$ space separated inte

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