Statistics

Problem Statement for "AimToTen"

Problem Statement

You are given a int[] marks containing the grades you have received so far in a class. Each grade is between 0 and 10, inclusive. Assuming that you will receive a 10 on all future assignments, determine the minimum number of future assignments that are needed for you to receive a final grade of 10. You will receive a final grade of 10 if your average grade is 9.5 or higher.

Definition

Class:
AimToTen
Method:
need
Parameters:
int[]
Returns:
int
Method signature:
int need(int[] marks)
(be sure your method is public)

Constraints

  • marks has between 1 and 50 elements, inclusive.
  • Each element of marks is between 0 and 10, inclusive.

Examples

  1. {9, 10, 10, 9}

    Returns: 0

    Your average is already 9.5, so no future assignments are needed.

  2. {8, 9}

    Returns: 4

    In this case you need 4 more assignments. With each completed assignment, your average could increase to 9, 9.25, 9.4 and 9.5, respectively.

  3. {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}

    Returns: 950

  4. {9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10}

    Returns: 0

  5. {1, 5, 1, 8, 10, 10, 1}

    Returns: 61

  6. {10}

    Returns: 0

  7. {9}

    Returns: 1

  8. {10, 10, 10, 10}

    Returns: 0

  9. {3,3,10,1,6,4,5,8,3,10,7,1,4,8,2,2,4,6,7,10,7,9,6,3,5,0,10,2,10,5,2,3,4,1,3,8,9,2}

    Returns: 336

  10. {3,9,7,3,10,3,5,5,7,0,1,9,5,4,3,1,8,4,3,3,6,4,7,3,1,10,8,7,0,3,6}

    Returns: 293

  11. {10,6,5,9,7,6,10,4,2,3,5,7,0,9,2,9,3,10,0,7,3,9,3,1,3,7,6,6,3,9,8,10,5,4,10,3,6,0,7,10,2,8,5,3,2,10,3,6,9}

    Returns: 381

  12. {5,10,2,6,9,4,10,5,2,5,7,10,0,3,8,9}

    Returns: 114

  13. {6,4,9,3,1,10,9,7,10,0,2,4,6,10,8,0,3,6,6,1,8,7,9,0,4,0,4,7,5,3,0,2,0,9,0,6,3,7,1,1,0,9,3,3,9}

    Returns: 445

  14. {9,8,3,0,8,8,7,2,9,8,3,1,6,2,0,6,1,4,1,2,5,4,7,4,10,5,2}

    Returns: 263

  15. {9,0,4,1,7,4,3,3,0,8,3,10,7,0,6,10,4,0,0,9,3,7,6}

    Returns: 229

  16. {1,7,2,0,7,0,4,7,4,7,6,8,1,3,2,0,5,0,4,1,4,10,6,6,0,9,2,2,9,7,4,7,0,2}

    Returns: 372

  17. {1,8,7,7,2,4}

    Returns: 56

  18. {7,10,10,2,3,4,9,6,5,10,3,1,2,5,4,5,4,7}

    Returns: 148

  19. {7,7,10,10,4,6,4,6,0,6,7,4,6,6,9}

    Returns: 101

  20. {10,4,8,0,8,9,2,4,9,2,9,5,6,10,10}

    Returns: 93

  21. {3,8,7,7,5,8,2,4}

    Returns: 64

  22. {4,2,9,4,0,1,5,3,4,2,10,7,5,1,7,10,9,9,3,0,5,10,4,1,3,8,2,5,3,7}

    Returns: 284

  23. {1,1,3,2,5,4,4,8,0,7,4,3,8,0,10,0}

    Returns: 184

  24. {6,10,7,10,2,9,7,10,0,7,2,0,7,0,0,10,4,7,10,1,10,10,5,5,5,4,10,5,0,4,8,8,9,3,6,4,4,2,1,5,0,10,4,6,0,1}

    Returns: 398

  25. {0}

    Returns: 19

  26. {4,2,2,2,2}

    Returns: 71

  27. {6,7,5,4,2,5,7,5,1,6,1,7,7,3,1,0,10,6,6,6,7,5,9,8,1,8,10,6,3,9,1,10,6,7,4,7,9,2,1,5,4,7}

    Returns: 350

  28. {1,8,8,7,1}

    Returns: 45

  29. {0,1,4,10,9,6,10,0,7,3,2,5,2,7,10,7,0,2,3,9,10,8,2,2,6,0,4,3,3,7,6,10,2,10,5,2,3,0,6,5,5,5,5,3,3,10}

    Returns: 430

  30. {6,7,1,10,2,9,4,10,1,7,5,4,7}

    Returns: 101

  31. {9,9,8,9,4,6,4,2,4,4,6,2}

    Returns: 94

  32. {7,1,7,1,0,3,6,0,1,8,10,8,2,1,7,0,10,4,3,8,1,0,2,8,1,4,3}

    Returns: 301

  33. {7,3,3,6,8,9,10,10,4,0,10,8,5,6,1,4,1,8,4,8,6,3,5,0,9,10,7,6,8,3,3,2,3,0,3,7,0,8,0,8,9,9}

    Returns: 350

  34. {9,6,6,5,9,0,2,0,10,0,9,6,5,1,1,7,2,0,2,3,6,3,7,9,7,9,1,10,6,7,0,10,1,10,2,6,3,0}

    Returns: 362

  35. {10,2,10,2,8,5,4,0,0,10,5,4,6,4,7,9,9,4,1,4,2,6,4,0,1,6,2,7,10,9,5,8,8,9,9,10,0,0,6,4,7,6,6,3,7,4,4,8,7,2}

    Returns: 422

  36. {9,2,5,4,2,10,6,5,3,5,4,4,1,1,0,4,5,0,7,0,9,0,1,6,1,2,8,2}

    Returns: 320

  37. {5,6,4,3,9,0,2,3,7}

    Returns: 93

  38. {5,6,3,8,2,1,1,7}

    Returns: 86

  39. {7,0,1,8,4,3,0,1,5,2,9,2,7,1,4,5,4,9,10,0,8,8,0,4,1,6,6,7,10,0,7,6,8,2,10,0}

    Returns: 354

  40. {3,2,5,1,8,6,0,10,1,1,4,8,8,4,4,5,1,0,9,5,10,4,1,4,2,6,1,2,5,4,8,6,7,9,0,7,2,10,7,7,9,0,9,4}

    Returns: 418

  41. {6,2,1,5,8,9,7,0,3,4,8,4,1,3,3,2,5,1,3,9,1,0,8,2,7,7,0}

    Returns: 295

  42. {2,9,2,7,9,2,8,4,5,10,3,9,7,8,1,3,4,5,6,8,5,9,6,9,0,8}

    Returns: 196

  43. {6,3,1,8,4,10,4,2,0,9,5,4,0,5,3,3,6,5,10,9,2,9,0,7,0,0}

    Returns: 264

  44. {4,4,8,6,0,1,3,4,2,4,10,2,5,4,4,2,2,1,10,2,9,6,6,1,3,3}

    Returns: 282

  45. {3,1,8,10,1,6,1,10,8,1,5,9,5,3,4,10,2,5,7,1,3,2,5,8,9,0,3,6,10,0}

    Returns: 278

  46. {9,8,10,3}

    Returns: 16

  47. {4,1,10,1,2,0}

    Returns: 78

  48. {3,7,6}

    Returns: 25

  49. {6,1,3,6,6,5,1,3,5,3,1,9,1,7,4,8,0,6,8,8,4,9,2,2,8,3,0,9,3,10,2,1,2,10,5,7,10,3,8}

    Returns: 363

  50. {1}

    Returns: 17

  51. {2,0,5,8,5}

    Returns: 55

  52. {9,10,7,1,7,6,1,2,3,1,6,4,10,7,9,9,0,1,5,2,6,4,1,2,10,6,0,2,10,4,6,4,1,3,8,8,4,1,9,6,6,8,0,10,7,7}

    Returns: 408

  53. {4,3,7,10,0,0,2,5,7,2,5,10}

    Returns: 118

  54. {6,0,0,2,6,7,1,1,5,5,1,1,10,3,1,4,0,1,1,9,8,10,7,7,5,3,8,0,0,8,5,7,3,7,3,8,0,2,1,1,8,2,1,0,10,8,2}

    Returns: 517

  55. {3,8,2,6,4,9,3,7,4,2,5,3,6,2,6,6}

    Returns: 152

  56. {0,10,10,9,1,10,6,8,2,8,5,3,2,3,2,8,10,1,8,6,10,8,1,5,3,9,0,5}

    Returns: 226

  57. {7,7,8,8,8,7,2,6,0,8,8,1,3,10,6,4}

    Returns: 118

  58. {3,4,2,6,3,0,8,10,7,0,2,5,9,7,1,10,2,6,5}

    Returns: 181

  59. {6}

    Returns: 7

  60. {10,10,10,1}

    Returns: 14

  61. {10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,2}

    Returns: 0

  62. {10,10,10,10,4}

    Returns: 7

  63. {10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,0,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,5}

    Returns: 0

  64. {10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,6,10,10,10,10,10,10,10,10,10,10,10,10,1}

    Returns: 0

  65. {10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,8}

    Returns: 0

  66. {10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,0}

    Returns: 0

  67. {10,10,10,10,10,3,10,3,10,10,10,10,10,10,10,10,10,10,0,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,9}

    Returns: 5

  68. {10,0}

    Returns: 18

  69. {10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,8,4}

    Returns: 0

  70. {10, 10, 10, 10, 8 }

    Returns: 0

  71. {0, 1, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }

    Returns: 928

  72. {10, 10, 10, 10 }

    Returns: 0

  73. {10, 10, 10, 10, 10, 10, 10, 10, 10, 9 }

    Returns: 0

  74. {10 }

    Returns: 0

  75. {0 }

    Returns: 19

  76. {9, 10, 10 }

    Returns: 0

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: