FirstToLast | Topcoder Archive

Problem Statement

We can rotate a positive integer by removing its leftmost digit and attaching it on the right end. Return the smallest positive value with no leading zeros such that rotating it is the same as multiplying it by p/q. If no such value exists less than 2000000000 (2 billion), return -1.

Definition

Class:: FirstToLast
Method:: getSmallest
Parameters:: int, int
Returns:: int
Method signature:: int getSmallest(int p, int q)
(be sure your method is public)

Notes

After rotating, the number may have leading zeros.
Rotating a value less than 10 does not change it.

Constraints

p and q will each be between 1 and 100 inclusive.

Examples

```
1
```
```
1
```
```
Returns: 1
```
```
1
```
```
4
```
```
Returns: 102564
```
```
1
```
```
6
```
```
Returns: -1
```
```
1
```
```
100
```
```
Returns: 100
```
```
92
```
```
10
```
```
Returns: -1
```

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.