divided by two

CodeChefOpen on judge ↗

The chef is in a dilemma. He is unable to solve a problem and he requires your help. You are given an input n. You need to count the number of numbers from 0 to n inclusive, which have all the digits divisible by 2 Input format: The first line of Input contains T, the number of test cases. Each test case contains an integer a Output Format: For each test case, output the required number. Constr

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