APT DivToZero

Class

public class DivToZero { public int lastTwo(int num, int factor) { // fill in code here } }

Problem Statement

You are given an integer num from which you should replace the last two digits such that the resulting number is divisible by factor and is also the smallest such number. Return the value of the last two replacement digits as an integer. (Thus ignoring leading zeros.)

For instance:

if num = 275, and factor = 5, you would return 0 because 200 is divisible by 5 and is the smallest number divisible by 5 that results from replacing the last two digits of 275. The last two replacement digits are 00, return 0.
if num = 1021, and factor = 11, you would return 1 because 1001 is divisible by 11. The last two replacement digits are 01, return 1;
if num = 428392, and factor = 17, you would return 15 because 428315 is divisible by 17.

Constraints

factor must be between 1 and 100, inclusive.
num must be between 100 and 2,000,000,000, inclusive.

Examples


num = 2000000000

factor = 100

Returns: 0

```
num = 1000

factor = 3

Returns: 2
```
```
num = 23442

factor = 75

Returns: 0
```


num = 428392

factor = 17

Returns: 15

```
num = 32442

factor = 99

Returns: 72
```

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