RepeatNumberCompare | Topcoder Archive

Problem Statement

For any two positive integers x and k we can make a new number denoted repeat(x, k) by concatenating k copies of x written in decimal. For example, repeat(1234,3) = 123412341234 and repeat(70,4) = 70707070.

You are given the ints x1, k1, x2, and k2. Let v1 = repeat(x1, k1) and v2 = repeat(x2, k2). Please compare the numbers v1 and v2 and return a String that describes the result of the comparison. In particular:

Return "Less" if v1 is less than v2.
Return "Greater" if v1 is greater than v2.
Return "Equal" if v1 and v2 are equal.

Definition

Class:: RepeatNumberCompare
Method:: compare
Parameters:: int, int, int, int
Returns:: String
Method signature:: String compare(int x1, int k1, int x2, int k2)
(be sure your method is public)

Notes

The return value is case-sensitive.

Constraints

x1 will be between 1 and 1,000,000,000, inclusive.
k1 will be between 1 and 50, inclusive.
x2 will be between 1 and 1,000,000,000, inclusive.
k2 will be between 1 and 50, inclusive.

Examples

```
1234
```
```
3
```
```
70
```
```
4
```
```
Returns: "Greater"
```
v1 = 123412341234 and v2 = 70707070, so we have v1 > v2.
```
1010
```
```
3
```
```
101010
```
```
2
```
```
Returns: "Equal"
```
This time we have v1 = v2 = 101010101010.
```
1234
```
```
10
```
```
456
```
```
20
```
```
Returns: "Less"
```
v1 has 40 digits and v2 has 60 digits, so v1 < v2.
```
5
```
```
9
```
```
555555555
```
```
1
```
```
Returns: "Equal"
```
```
5
```
```
9
```
```
555555554
```
```
1
```
```
Returns: "Greater"
```
```
5
```
```
9
```
```
555555556
```
```
1
```
```
Returns: "Less"
```

1000000000

1000000000

Returns: "Equal"

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.