Question

Hide problem statement «</
Problem statement
Instruct
Niven numbers are positive integers greater than 0
that are divisible by the sum of their digits. For
Your
example, 42 is a Niven number, it is divisible by 4 + 2
welc
= 6. You are given a function,
"Sav
int CheckNivenNumber(int n);
judge
Addit
execu
Now let's
The function accepts an integer 'n' as its argument
Implement the function to check if 'n' is Niven. If 'n'
Niven, then return the number of times it is divisible by
the sum of its digits (i.e. the quotient), else return o.
Assume that 'n 0.
Example:
Input:
36
Output:
Reac
int Chee
int mair
{
4
Explanation: The output is 4 since 3+6 = 9 and 36
9 = 4.
va
Sample Input
Secure Exam Browser 1.3.4
program java​

Answer 1

Answer:

here this your answer

Explanation:

Make a brilliant