Problem Statement
Definition
- Class:
- DivisorDigits
- Method:
- howMany
- Parameters:
- int
- Returns:
- int
- Method signature:
- int howMany(int number)
- (be sure your method is public)
Notes
- No number is divisible by 0.
Constraints
- number will be between 10000 and 999999999.
Examples
12345
Returns: 3
12345 is divisible by 1, 3, and 5.
33333
Returns: 5
661232
Returns: 3
661232 is divisible by 1 and 2.
52527
Returns: 0
52527 is not divisible by 5, 2, or 7.
98765
Returns: 1
730000000
Returns: 0
Nothing is divisible by 0. In this case, the number is also not divisible by 7 or 3.
273472734
Returns: 4
999999999
Returns: 9
918273645
Returns: 4
203948576
Returns: 3
102938475
Returns: 3
512667324
Returns: 7
227345383
Returns: 0
1622361
Returns: 3
32252
Returns: 3
100000
Returns: 1
124175603
Returns: 2
11111111
Returns: 8
1234567
Returns: 1
7000000
Returns: 1
12121212
Returns: 8
17000
Returns: 1
10000
Returns: 1
200001
Returns: 1
60000
Returns: 1
44444
Returns: 5
666666
Returns: 6
220000
Returns: 2
1111111
Returns: 7
730000000
Returns: 0
9999999
Returns: 7
73000111
Returns: 3
100000
Returns: 1
11111
Returns: 5
661232
Returns: 3
10000
Returns: 1
99999
Returns: 5