Statistics

Problem Statement for "YahtzeeScore"

Problem Statement

This task is about the scoring in the first phase of the die-game Yahtzee, where five dice are used. The score is determined by the values on the upward die faces after a roll. The player gets to choose a value, and all dice that show the chosen value are considered active. The score is simply the sum of values on active dice.

Say, for instance, that a player ends up with the die faces showing 2, 2, 3, 5 and 4. Choosing the value two makes the dice showing 2 active and yields a score of 2 + 2 = 4, while choosing 5 makes the one die showing 5 active, yielding a score of 5.

Your method will take as input a int[] toss, where each element represents the upward face of a die, and return the maximum possible score with these values.

Definition

Class:
YahtzeeScore
Method:
maxPoints
Parameters:
int[]
Returns:
int
Method signature:
int maxPoints(int[] toss)
(be sure your method is public)

Constraints

  • toss will contain exactly 5 elements.
  • Each element of toss will be between 1 and 6, inclusive.

Examples

  1. { 2, 2, 3, 5, 4 }

    Returns: 5

    The example from the text.

  2. { 6, 4, 1, 1, 3 }

    Returns: 6

    Selecting 1 as active yields 1 + 1 = 2, selecting 3 yields 3, selecting 4 yields 4 and selecting 6 yields 6, which is the maximum number of points.

  3. { 5, 3, 5, 3, 3 }

    Returns: 10

  4. { 2, 3, 2, 2, 3 }

    Returns: 6

  5. { 1, 1, 1, 1, 1 }

    Returns: 5

  6. { 3, 4, 4, 3, 6 }

    Returns: 8

  7. { 6, 4, 3, 6, 1 }

    Returns: 12

  8. { 1, 5, 1, 3, 2 }

    Returns: 5

  9. { 4, 6, 4, 6, 1 }

    Returns: 12

  10. { 6, 1, 1, 6, 3 }

    Returns: 12

  11. { 2, 6, 3, 3, 5 }

    Returns: 6

  12. { 2, 4, 1, 1, 2 }

    Returns: 4

  13. { 4, 6, 5, 1, 4 }

    Returns: 8

  14. { 3, 3, 3, 5, 3 }

    Returns: 12

  15. { 4, 4, 1, 1, 5 }

    Returns: 8

  16. { 4, 4, 2, 2, 4 }

    Returns: 12

  17. { 3, 1, 1, 2, 4 }

    Returns: 4

  18. { 1, 4, 3, 4, 5 }

    Returns: 8

  19. { 1, 5, 6, 3, 5 }

    Returns: 10

  20. { 3, 5, 6, 5, 6 }

    Returns: 12

  21. { 6, 4, 4, 6, 4 }

    Returns: 12

  22. { 2, 6, 3, 1, 4 }

    Returns: 6

  23. { 3, 3, 4, 4, 2 }

    Returns: 8

  24. { 3, 6, 3, 5, 6 }

    Returns: 12

  25. { 6, 1, 2, 5, 1 }

    Returns: 6

  26. { 2, 2, 5, 6, 6 }

    Returns: 12

  27. { 5, 5, 5, 5, 6 }

    Returns: 20

  28. { 2, 2, 2, 2, 2 }

    Returns: 10

  29. { 6, 6, 6, 6, 6 }

    Returns: 30

  30. { 5, 2, 2, 2, 2 }

    Returns: 8

  31. { 6, 2, 2, 2, 6 }

    Returns: 12

  32. { 2, 2, 2, 3, 3 }

    Returns: 6

  33. { 5, 3, 5, 3, 6 }

    Returns: 10

  34. { 1, 3, 3, 3, 5 }

    Returns: 9

  35. { 5, 5, 5, 4, 5 }

    Returns: 20

  36. { 5, 3, 2, 4, 3 }

    Returns: 6

  37. { 1, 1, 1, 1, 1 }

    Returns: 5

  38. { 5, 5, 5, 5, 6 }

    Returns: 20

  39. { 2, 2, 2, 2, 2 }

    Returns: 10

  40. { 6, 6, 6, 6, 6 }

    Returns: 30

  41. { 5, 2, 2, 2, 2 }

    Returns: 8

  42. { 6, 2, 2, 2, 6 }

    Returns: 12

  43. { 2, 2, 2, 3, 3 }

    Returns: 6

  44. { 5, 3, 5, 3, 6 }

    Returns: 10

  45. { 1, 3, 3, 3, 5 }

    Returns: 9

  46. { 5, 5, 5, 4, 5 }

    Returns: 20

  47. { 5, 3, 2, 4, 3 }

    Returns: 6

  48. { 1, 1, 1, 1, 1 }

    Returns: 5

  49. { 5, 5, 5, 5, 6 }

    Returns: 20

  50. { 2, 2, 2, 2, 2 }

    Returns: 10

  51. { 6, 6, 6, 6, 6 }

    Returns: 30

  52. { 5, 2, 2, 2, 2 }

    Returns: 8

  53. { 6, 2, 2, 2, 6 }

    Returns: 12

  54. { 2, 2, 2, 3, 3 }

    Returns: 6

  55. { 5, 3, 5, 3, 6 }

    Returns: 10

  56. { 1, 3, 3, 3, 5 }

    Returns: 9

  57. { 5, 5, 5, 4, 5 }

    Returns: 20

  58. { 5, 3, 2, 4, 3 }

    Returns: 6

  59. { 1, 1, 1, 1, 1 }

    Returns: 5

  60. { 5, 5, 5, 2, 3 }

    Returns: 15

  61. { 2, 2, 2, 2, 6 }

    Returns: 8

  62. { 2, 3, 2, 2, 5 }

    Returns: 6

  63. { 5, 3, 5, 3, 3 }

    Returns: 10

  64. { 2, 2, 3, 5, 4 }

    Returns: 5

  65. { 1, 2, 3, 5, 5 }

    Returns: 10

  66. { 1, 2, 3, 4, 6 }

    Returns: 6


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: