+ 2
Can anyone explain this output.actually I'm enable to understand this question.
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 test case, output on a line the respective PDS(N) calculated. Example Input: 1 20 0 Output: 1 66
7 Answers
+ 2
What input returns 66
+ 2
Maninder $ingh explain how 1 turn 66
+ 2
Maninder $ingh ok then the source
+ 1
Qudusayo output is 1 and 66.
+ 1
Qudusayo am also confuse in this question.đ€Łđ€Łđ€Łđ
+ 1
wet water ))) i think you are right.