Chef and special numbers

CodeChefRating 2536Open on judge ↗

Chef's team is going to participate in the legendary math battles. This time the main task of the competition is to calculate number of K-special numbers in the range [L, R] (i.e. L, L + 1, L + 2, ..., R). A number X is said to be K-special if there exist K or more different digits, such that X is divisible by those digits and those digits are present in the decimal representation of the number

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