An integer is a divisor of an integer if the remainder of .
Given an integer, for each digit that makes up the integer determine whether it is a divisor. Count the number of divisors occurring within the integer.
Check whether , and are divisors of . All 3 numbers divide evenly into so return .
Check whether , , and are divisors of . All 3 numbers divide evenly into so return .
Check whether and are divisors of . is, but is not. Return .
Complete the findDigits function in the editor below.
findDigits has the following parameter(s):
- int n: the value to analyze
- int: the number of digits in that are divisors of
The first line is an integer, , the number of test cases.
The subsequent lines each contain an integer, .
2 12 1012
The number is broken into two digits, and . When is divided by either of those two digits, the remainder is so they are both divisors.
The number is broken into four digits, , , , and . is evenly divisible by its digits , , and , but it is not divisible by as division by zero is undefined.