Statistics

Problem Statement for "ABC"

Problem Statement

You are given two ints: N and K. Lun the dog is interested in strings that satisfy the following conditions:

  • The string has exactly N characters, each of which is either 'A', 'B' or 'C'.
  • The string s has exactly K pairs (i, j) (0 <= i < j <= N-1) such that s[i] < s[j].

If there exists a string that satisfies the conditions, find and return any such string. Otherwise, return an empty string.

Definition

Class:
ABC
Method:
createString
Parameters:
int, int
Returns:
String
Method signature:
String createString(int N, int K)
(be sure your method is public)

Constraints

  • N will be between 3 and 30, inclusive.
  • K will be between 0 and N(N-1)/2, inclusive.

Examples

  1. 3

    3

    Returns: "ABC"

    This string has exactly three pairs (i, j) mentioned in the statement: (0, 1), (0, 2) and (1, 2).

  2. 3

    0

    Returns: "CBA"

    Please note that there are valid test cases with K = 0.

  3. 5

    10

    Returns: ""

    Five characters is too short for this value of K.

  4. 15

    36

    Returns: "CABBACCBAABCBBB"

    Please note that this is an example of a solution; other valid solutions will also be accepted.

  5. 3

    1

    Returns: "BCA"

  6. 3

    2

    Returns: "BAC"

  7. 4

    0

    Returns: "CCBA"

  8. 4

    2

    Returns: "BCCA"

  9. 4

    5

    Returns: "ABCC"

  10. 5

    4

    Returns: "BBCCA"

  11. 5

    5

    Returns: "BBCAC"

  12. 5

    7

    Returns: "BABCC"

  13. 6

    5

    Returns: "BBCACA"

  14. 6

    8

    Returns: "ABBCCA"

  15. 6

    9

    Returns: "ABBCAC"

  16. 7

    5

    Returns: "BCBCCAA"

  17. 7

    17

    Returns: ""

  18. 7

    21

    Returns: ""

  19. 8

    7

    Returns: "BBCCBCAA"

  20. 8

    12

    Returns: "BBBACCCA"

  21. 8

    19

    Returns: "ABBABCCC"

  22. 9

    5

    Returns: "BCBCCBAAA"

  23. 9

    26

    Returns: "AABABBCCC"

  24. 9

    27

    Returns: "AAABBBCCC"

  25. 10

    22

    Returns: "ABBBCACCCA"

  26. 10

    31

    Returns: "AABBABCCCC"

  27. 10

    35

    Returns: ""

  28. 11

    21

    Returns: "BBBABCCCCAA"

  29. 11

    23

    Returns: "BABBBCCCCAA"

  30. 11

    38

    Returns: "AABBABBCCCC"

  31. 12

    4

    Returns: "BCCCCBBBAAAA"

  32. 12

    23

    Returns: "BABBBCCCCAAA"

  33. 12

    66

    Returns: ""

  34. 13

    41

    Returns: "AABBBBCCACCCA"

  35. 13

    62

    Returns: ""

  36. 13

    65

    Returns: ""

  37. 14

    30

    Returns: "BBBBBACCCCCAAA"

  38. 14

    54

    Returns: "AABABBBBCCCCCA"

  39. 14

    83

    Returns: ""

  40. 15

    10

    Returns: "BBCCCCCBBBAAAAA"

  41. 15

    15

    Returns: "BBBCCCCCBBAAAAA"

  42. 15

    37

    Returns: "ABBBBBCCCACCAAA"

  43. 16

    23

    Returns: "BBBCBCCCCCBAAAAA"

  44. 16

    75

    Returns: "AAAABBBBBCCCCCAC"

  45. 16

    84

    Returns: "AAAABABBBBCCCCCC"

  46. 17

    29

    Returns: "BBBBCBCCCCCBAAAAA"

  47. 17

    93

    Returns: "AAAABBBABBBCCCCCC"

  48. 17

    136

    Returns: ""

  49. 18

    10

    Returns: "BCCBCCCCBBBBAAAAAA"

  50. 18

    17

    Returns: "BBCBCCCCCBBBAAAAAA"

  51. 18

    107

    Returns: "AAAAABABBBBBCCCCCC"

  52. 19

    2

    Returns: "CCCCCBCCBBBBBAAAAAA"

  53. 19

    91

    Returns: "AAABBBABBBCCCCCCCAA"

  54. 19

    93

    Returns: "AAABABBBBBCCCCCCCAA"

  55. 20

    24

    Returns: "BBBCCCCBCCCBBBAAAAAA"

  56. 20

    42

    Returns: "BBBBBBCCCCCCCBAAAAAA"

  57. 20

    116

    Returns: "AAAABBBABBBBCCCCCCCA"

  58. 21

    45

    Returns: "BBBBBBCCCCBCCCAAAAAAA"

  59. 21

    48

    Returns: "BBBBBBCBCCCCCCAAAAAAA"

  60. 21

    81

    Returns: "AABBBBBBBCCCACCCCAAAA"

  61. 22

    156

    Returns: "AAAAAABBBBBABBCCCCCCCC"

  62. 22

    160

    Returns: "AAAAAABABBBBBBCCCCCCCC"

  63. 22

    222

    Returns: ""

  64. 23

    97

    Returns: "AABBBBBBBBCCCCCCCACAAAA"

  65. 23

    213

    Returns: ""

  66. 23

    232

    Returns: ""

  67. 24

    75

    Returns: "BBBBBABBBCCCCCCCCAAAAAAA"

  68. 24

    234

    Returns: ""

  69. 24

    243

    Returns: ""

  70. 25

    12

    Returns: "BCCCCCCBCCCBBBBBBAAAAAAAA"

  71. 25

    46

    Returns: "BBBBBCCCCCCCCBCBBAAAAAAAA"

  72. 25

    288

    Returns: ""

  73. 26

    32

    Returns: "BBBCCCCBCCCCCBBBBBAAAAAAAA"

  74. 26

    99

    Returns: "ABBBBBBBBBCCCCCCCCCAAAAAAA"

  75. 26

    151

    Returns: "AAABBABBBBBBBCCCCCCCCCAAAA"

  76. 27

    39

    Returns: "BBBBCCCCCCBCCCBBBBAAAAAAAAA"

  77. 27

    123

    Returns: "AABBBBBBBBBCCCACCCCCCAAAAAA"

  78. 27

    209

    Returns: "AAAAAAABBBBBBBBBCCCCCCCACCA"

  79. 28

    157

    Returns: "AAABBBBBBBBBACCCCCCCCCCAAAAA"

  80. 28

    162

    Returns: "AAABBBBABBBBBCCCCCCCCCCAAAAA"

  81. 28

    242

    Returns: "AAAAAAAABBBBBBBBBCCCCCCCCCCA"

  82. 29

    147

    Returns: "AABBBBBBBBBBCCCACCCCCCCAAAAAA"

  83. 29

    269

    Returns: "AAAAAAAABBBBBBBBBBCACCCCCCCCC"

  84. 29

    356

    Returns: ""

  85. 30

    72

    Returns: "BBBBBBBCCCCCCCCBCCBBAAAAAAAAAA"

  86. 30

    266

    Returns: "AAAAAAAABBBBBBBBBBCCCCACCCCCCA"

  87. 30

    351

    Returns: ""

  88. 28

    81

    Returns: "BBBBBBBBCCCCCCCCCBCAAAAAAAAA"

  89. 28

    90

    Returns: "BBBBBBBBBCCCCCCCCCCAAAAAAAAA"

  90. 28

    261

    Returns: "AAAAAAAAABBBBBBBBBCCCCCCCCCC"

  91. 28

    262

    Returns: ""

  92. 29

    90

    Returns: "BBBBBBBBBCCCCCCCCCCBAAAAAAAAA"

  93. 29

    100

    Returns: "BBBBBBBBBBCCCCCCCCCCAAAAAAAAA"

  94. 29

    280

    Returns: "AAAAAAAAABBBBBBBBBBCCCCCCCCCC"

  95. 29

    281

    Returns: ""

  96. 30

    100

    Returns: "BBBBBBBBBBCCCCCCCCCCAAAAAAAAAA"

  97. 30

    300

    Returns: "AAAAAAAAAABBBBBBBBBBCCCCCCCCCC"

  98. 30

    301

    Returns: ""

  99. 30

    435

    Returns: ""

  100. 30

    200

    Returns: "AAAAABBBBBBBBBBCCCCCCCCCCAAAAA"

  101. 24

    276

    Returns: ""

  102. 30

    39

    Returns: "BBBCBCCCCCCCCCBBBBBBAAAAAAAAAA"

  103. 5

    3

    Returns: "BCBCA"

  104. 9

    28

    Returns: ""

  105. 30

    4

    Returns: "CCCCCCBCCCCBBBBBBBBBAAAAAAAAAA"

  106. 30

    372

    Returns: ""

  107. 30

    20

    Returns: "BBCCCCCCCCCCBBBBBBBBAAAAAAAAAA"

  108. 30

    193

    Returns: "AAAABBBBBBBABBBCCCCCCCCCCAAAAA"

  109. 6

    12

    Returns: "AABBCC"

  110. 30

    58

    Returns: "BBBBBCCBCCCCCCCCBBBBAAAAAAAAAA"

  111. 30

    163

    Returns: "AAABBBBBBBBBBCCCCCCCACCCAAAAAA"

  112. 6

    10

    Returns: "ABBACC"

  113. 10

    4

    Returns: "BCCCCBBAAA"


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: