PDS Number

CodeChefRating 2323Open on judge ↗

A positive integer is called a "PDS Number" if the product of its digits is divisible by the sum of its digits. Let PDS(N) be the N-th PDS Number (indexed from 1), you are requested to calculate it. Input There are several test cases (at most 10000), each formed as follows: - The first and only line contains a positive integer N (N ≤ 109). The input is ended by N = 0. Output For each te

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