Two natural numbers n and d (with 0 <= d <= 9) are read. Print how many times the digit d appears in the decimal representation of n, using a recursive function.
Define a recursive function count(n, d) that returns the number of occurrences of digit d in n:
count(0, d) = 0
count(n, d) = (n % 10 == d ? 1 : 0) + count(n / 10, d), for n > 0Special case n == 0: if d == 0, the answer is 1 (the number 0 has one digit, which is 0); otherwise the answer is 0.
The program reads from standard input two natural numbers `n` and `d`, separated by a space, with `0 <= d <= 9`. - `0 <= n <= 1.000.000.000` - `0 <= d <= 9` - The solution must use recursion.
The program prints a single natural number: how many times digit `d` appears in `n`, followed by a newline.
112233 2
2
Use the Get Hint button in the action bar to reveal a guided hint.
No comments yet. Be the first to start the discussion!
112233 2
2
Community solutions unlock after you submit a passing solution. Don't peek.
Create a free account to write code, submit solutions, and track your progress.