Factor Count in a Number
CodeChefOpen on judge ↗
Given an integer, $N$, determine how many digits in it evenly divide the number (i.e.: count the number of times $N$ is divided by each digit $D$ in it, which has a remainder of 0). Print the number of evenly divisible digits. Note: Each digit is considered to be unique, so each occurrence of the same evenly divisible digit should be counted (i.e.: for $N$ =126, the answer is 3, because 1, 2,6
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.
Sign in to chat with the tutor and save your progress.
Sign in to start