Prime Digits

CodeChefOpen on judge ↗

Problem Statement: Dipen loves the questions which are short, challenging and on point, so he makes one for Crackathon. Given a number N, you have to find the number of numbers less than or equal to N such that each number has atleast one prime digit in it . Input: First line will consist of value of T i.e testcases. Next T lines will have a number N. Output: Output the required value as ans

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