Statistics

Problem Statement for "DecreasingNumber"

Problem Statement

There are three types of operations you can perform on an integer:
  • 1. If it's divisible by 3, divide it by 3.
  • 2. If it's divisible by 2, divide it by 2.
  • 3. Subtract 1.
Given an int n, return the minimal number of operations needed to produce the number 1.

Definition

Class:
DecreasingNumber
Method:
numberOfOperations
Parameters:
int
Returns:
int
Method signature:
int numberOfOperations(int n)
(be sure your method is public)

Constraints

  • n will be between 1 and 106, inclusive.

Examples

  1. 1

    Returns: 0

    We are already at number 1.

  2. 2

    Returns: 1

    Only divide it by 2.

  3. 3

    Returns: 1

  4. 5

    Returns: 3

    First, substract 1. Then, divide by 2 twice. (Or substract 1 twice, and then divide by 3).

  5. 10

    Returns: 3

    First, substract 1. Then, divide by 3 twice.

  6. 13

    Returns: 4

  7. 20

    Returns: 4

  8. 133

    Returns: 8

  9. 139

    Returns: 8

  10. 8728

    Returns: 14

  11. 14862

    Returns: 14

  12. 27436

    Returns: 14

  13. 33387

    Returns: 16

  14. 48097

    Returns: 15

  15. 57771

    Returns: 17

  16. 66286

    Returns: 16

  17. 175481

    Returns: 19

  18. 176946

    Returns: 16

  19. 293191

    Returns: 19

  20. 381359

    Returns: 19

  21. 422223

    Returns: 18

  22. 475447

    Returns: 18

  23. 481215

    Returns: 17

  24. 486739

    Returns: 19

  25. 538346

    Returns: 19

  26. 545152

    Returns: 21

  27. 597003

    Returns: 21

  28. 601367

    Returns: 21

  29. 602496

    Returns: 18

  30. 645039

    Returns: 20

  31. 652241

    Returns: 20

  32. 672994

    Returns: 21

  33. 768456

    Returns: 17

  34. 770775

    Returns: 20

  35. 817224

    Returns: 20

  36. 883877

    Returns: 20

  37. 939298

    Returns: 21

  38. 950437

    Returns: 19

  39. 962340

    Returns: 17

  40. 1000000

    Returns: 19

  41. 999999

    Returns: 19

  42. 999998

    Returns: 21

  43. 999997

    Returns: 21

  44. 999996

    Returns: 20

  45. 999995

    Returns: 22

  46. 4

    Returns: 2

  47. 6

    Returns: 2

  48. 7

    Returns: 3

  49. 8

    Returns: 3

  50. 9

    Returns: 2

  51. 531441

    Returns: 12

  52. 524288

    Returns: 19

  53. 933119

    Returns: 30

  54. 933118

    Returns: 29

  55. 466559

    Returns: 28

  56. 995327

    Returns: 28

  57. 311039

    Returns: 27

  58. 995326

    Returns: 27

  59. 155519

    Returns: 26

  60. 995325

    Returns: 26

  61. 155518

    Returns: 25

  62. 999863

    Returns: 25

  63. 77759

    Returns: 24

  64. 999862

    Returns: 24

  65. 51839

    Returns: 23

  66. 999935

    Returns: 23

  67. 839808

    Returns: 15

  68. 28

    Returns: 4

  69. 745

    Returns: 10

  70. 16

    Returns: 4

  71. 2931

    Returns: 10

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: