Statistics

Problem Statement

Definition

Class:

EggCartons

Method:

minCartons

Parameters:

int

Returns:

int

Method signature:

int minCartons(int n)

(be sure your method is public)

Constraints

• n will be between 1 and 100, inclusive.

Examples

1. 20

   Returns: 3

   He should buy 2 cartons containing 6 eggs and 1 carton containing 8 eggs. In total, he buys 3 egg cartons.

2. 24

   Returns: 3

   There are two ways to buy 24 eggs: buy 4 cartons containing 6 eggs or buy 3 cartons containing 8 eggs. Minimize the number of cartons.

3. 15

   Returns: -1

   He can't buy an odd number of eggs.

4. 4

   Returns: -1

5. 1

   Returns: -1

6. 2

   Returns: -1

7. 3

   Returns: -1

8. 4

   Returns: -1

9. 5

   Returns: -1

10. 6

    Returns: 1

11. 7

    Returns: -1

12. 8

    Returns: 1

13. 9

    Returns: -1

14. 10

    Returns: -1

15. 11

    Returns: -1

16. 12

    Returns: 2

17. 13

    Returns: -1

18. 14

    Returns: 2

19. 15

    Returns: -1

20. 16

    Returns: 2

21. 17

    Returns: -1

22. 18

    Returns: 3

23. 19

    Returns: -1

24. 20

    Returns: 3

25. 90

    Returns: 12

26. 91

    Returns: -1

27. 92

    Returns: 12

28. 93

    Returns: -1

29. 94

    Returns: 12

30. 95

    Returns: -1

31. 96

    Returns: 12

32. 97

    Returns: -1

33. 98

    Returns: 13

34. 99

    Returns: -1

35. 100

    Returns: 13

36. 1

    Returns: -1

37. 34

    Returns: 5

38. 44

    Returns: 6

39. 63

    Returns: -1

40. 30

    Returns: 4

41. 1

    Returns: -1

42. 9

    Returns: -1

43. 53

    Returns: -1

44. 57

    Returns: -1

45. 57

    Returns: -1

46. 32

    Returns: 4

47. 50

    Returns: 7

48. 26

    Returns: 4

49. 28

    Returns: 4

50. 38

    Returns: 5

51. 72

    Returns: 9

52. 60

    Returns: 8

53. 88

    Returns: 11

54. 58

    Returns: 8

55. 36

    Returns: 5

56. 48

    Returns: 6

57. 22

    Returns: 3

58. 80

    Returns: 10