Problem Simple2

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)2002, TopCoder, Inc. All rights reserved.

Problem Statement

Create a class DivDigits and a method divcount which takes as an argument an integer number and returns how many digits in number evenly divide number. Count all occurences of such digits in the number, not just the first. See examples for more information.

Definition

Class: DivDigits
Method: divcount
Parameters: int
Returns: int
Method signature (see below)

Prototype

public class DivDigits { public int divcount(int num) { // fill in code here } }

Notes

No number is divisible by 0.

Constraints

num will be an int between 10000 and 999999999, inclusive (between 5 and 9 digits, inclusive).

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.

Owen L. Astrachan

Last modified: Wed Mar 10 15:21:41 EST 2004