Statistics

Problem Statement for "RepeatNumberCompare"

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

  1. 1234

    3

    70

    4

    Returns: "Greater"

    v1 = 123412341234 and v2 = 70707070, so we have v1 > v2.

  2. 1010

    3

    101010

    2

    Returns: "Equal"

    This time we have v1 = v2 = 101010101010.

  3. 1234

    10

    456

    20

    Returns: "Less"

    v1 has 40 digits and v2 has 60 digits, so v1 < v2.

  4. 5

    9

    555555555

    1

    Returns: "Equal"

  5. 5

    9

    555555554

    1

    Returns: "Greater"

  6. 5

    9

    555555556

    1

    Returns: "Less"

  7. 1000000000

    50

    1000000000

    50

    Returns: "Equal"

  8. 111111111

    5

    1

    45

    Returns: "Equal"

  9. 30021813

    13

    2

    17

    Returns: "Greater"

  10. 311173

    43

    60280

    25

    Returns: "Greater"

  11. 75802

    46

    56332

    46

    Returns: "Greater"

  12. 38

    5

    33

    17

    Returns: "Less"

  13. 896042

    44

    36686

    36

    Returns: "Greater"

  14. 10

    6

    91

    26

    Returns: "Less"

  15. 84434

    49

    26086

    9

    Returns: "Greater"

  16. 80675570

    31

    558459

    21

    Returns: "Greater"

  17. 39

    38

    137789628

    42

    Returns: "Less"

  18. 1

    3

    338

    2

    Returns: "Less"

  19. 319085

    26

    758

    1

    Returns: "Greater"

  20. 16820

    21

    308570

    34

    Returns: "Less"

  21. 97950

    12

    8106

    4

    Returns: "Greater"

  22. 784

    37

    15837364

    40

    Returns: "Less"

  23. 3003009

    45

    798

    16

    Returns: "Greater"

  24. 289188

    18

    781663

    11

    Returns: "Greater"

  25. 4537

    38

    5864

    31

    Returns: "Greater"

  26. 48254224

    11

    745940

    3

    Returns: "Greater"

  27. 78

    48

    13255

    19

    Returns: "Greater"

  28. 8783252

    22

    952203598

    37

    Returns: "Less"

  29. 9288863

    8

    391

    11

    Returns: "Greater"

  30. 5053002

    16

    9

    42

    Returns: "Greater"

  31. 21415

    31

    2903899

    44

    Returns: "Less"

  32. 7963571

    38

    6104

    4

    Returns: "Greater"

  33. 8392

    40

    613034204

    26

    Returns: "Less"

  34. 38

    3

    966140

    2

    Returns: "Less"

  35. 9323041

    18

    74388996

    35

    Returns: "Less"

  36. 342844

    11

    4993744

    19

    Returns: "Less"

  37. 617220748

    28

    57446

    41

    Returns: "Greater"

  38. 8449434

    28

    13163664

    22

    Returns: "Greater"

  39. 581088

    40

    8291

    37

    Returns: "Greater"

  40. 18034950

    41

    159

    40

    Returns: "Greater"

  41. 27

    14

    101674328

    28

    Returns: "Less"

  42. 4137

    29

    8996

    48

    Returns: "Less"

  43. 912

    14

    5

    10

    Returns: "Greater"

  44. 53415596

    21

    50196

    40

    Returns: "Less"

  45. 840

    43

    5971312

    6

    Returns: "Greater"

  46. 2545

    22

    1625

    11

    Returns: "Greater"

  47. 5832

    20

    9205

    30

    Returns: "Less"

  48. 338277559

    20

    8773

    13

    Returns: "Greater"

  49. 883137

    38

    849410537

    37

    Returns: "Less"

  50. 966662888

    12

    71119989

    44

    Returns: "Less"

  51. 99

    13

    995979604

    47

    Returns: "Less"

  52. 96528539

    3

    470247

    35

    Returns: "Less"

  53. 17

    21

    20145

    15

    Returns: "Less"

  54. 824042991

    44

    459732

    19

    Returns: "Greater"

  55. 78617

    41

    799144224

    1

    Returns: "Greater"

  56. 640

    4

    35796

    44

    Returns: "Less"

  57. 271

    19

    467262153

    34

    Returns: "Less"

  58. 46361337

    36

    361

    22

    Returns: "Greater"

  59. 1000000000

    50

    1000000000

    49

    Returns: "Greater"

  60. 2111

    1

    11111

    1

    Returns: "Less"

  61. 9

    10

    80

    5

    Returns: "Greater"

  62. 100000000

    50

    999999999

    50

    Returns: "Less"

  63. 99999999

    49

    99998999

    49

    Returns: "Greater"

  64. 22

    1

    11

    1

    Returns: "Greater"

  65. 11111111

    33

    11

    6

    Returns: "Greater"

  66. 999999999

    48

    888888888

    48

    Returns: "Greater"

  67. 22

    1

    111

    1

    Returns: "Less"

  68. 1234

    1

    1235

    1

    Returns: "Less"

  69. 1230

    3

    70

    4

    Returns: "Greater"

  70. 10

    1

    20

    4

    Returns: "Less"

  71. 12

    1

    21

    1

    Returns: "Less"

  72. 1000000000

    49

    1000000000

    1

    Returns: "Greater"

  73. 23

    1

    14

    1

    Returns: "Greater"

  74. 11

    1

    2

    1

    Returns: "Greater"

  75. 12

    10

    21

    10

    Returns: "Less"

  76. 224

    2

    31

    3

    Returns: "Less"

  77. 1234

    3

    2111

    3

    Returns: "Less"

  78. 5001

    1

    6000

    1

    Returns: "Less"

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.
This problem was used for: