DivisorDigits | Topcoder Archive

Problem Statement

Create a class DivisorDigits containing a method howMany which takes an int number and returns how many digits in number divide evenly into number itself.

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.
```
661232
```
```
Returns: 3
```
661232 is divisible by 1 and 2.
```
52527
```
```
Returns: 0
```
52527 is not divisible by 5, 2, or 7.
```
730000000
```
```
Returns: 0
```
Nothing is divisible by 0. In this case, the number is also not divisible by 7 or 3.

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.