Statistics

Problem Statement for "ApocalypseSomeday"

Problem Statement

The number 666 is considered to be the occult "number of the beast" and is a well used number in all major apocalypse themed blockbuster movies. However the number 666 can't always be used in the script so numbers such as 1666 are used instead. Let us call the numbers containing at least three contiguous sixes beastly numbers. The first few beastly numbers are 666, 1666, 2666, 3666, 4666, 5666...

Given a 1-based index n, your program should return the n-th beastly number.

Definition

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

Constraints

  • n will be between 1 and 10000, inclusive

Examples

  1. 1

    Returns: 666

  2. 2

    Returns: 1666

  3. 3

    Returns: 2666

  4. 4

    Returns: 3666

  5. 5

    Returns: 4666

  6. 6

    Returns: 5666

  7. 187

    Returns: 66666

  8. 100

    Returns: 54666

  9. 123

    Returns: 66602

  10. 999

    Returns: 366638

  11. 987

    Returns: 366626

  12. 356

    Returns: 139666

  13. 235

    Returns: 76665

  14. 124

    Returns: 66603

  15. 20

    Returns: 10666

  16. 21

    Returns: 11666

  17. 22

    Returns: 12666

  18. 23

    Returns: 13666

  19. 24

    Returns: 14666

  20. 25

    Returns: 15666

  21. 26

    Returns: 16660

  22. 27

    Returns: 16661

  23. 28

    Returns: 16662

  24. 29

    Returns: 16663

  25. 30

    Returns: 16664

  26. 510

    Returns: 176660

  27. 520

    Returns: 177666

  28. 530

    Returns: 186661

  29. 540

    Returns: 188666

  30. 550

    Returns: 196662

  31. 560

    Returns: 199666

  32. 570

    Returns: 206663

  33. 580

    Returns: 210666

  34. 590

    Returns: 216664

  35. 600

    Returns: 221666

  36. 666

    Returns: 256664

  37. 19

    Returns: 9666

  38. 606

    Returns: 226661

  39. 41

    Returns: 22666

  40. 42

    Returns: 23666

  41. 1000

    Returns: 366639

  42. 742

    Returns: 266661

  43. 756

    Returns: 266675

  44. 763

    Returns: 266682

  45. 776

    Returns: 266695

  46. 789

    Returns: 275666

  47. 843

    Returns: 302666

  48. 222

    Returns: 68666

  49. 333

    Returns: 126668

  50. 799

    Returns: 276669

  51. 500

    Returns: 166699

  52. 10000

    Returns: 2666799

  53. 9999

    Returns: 2666798

  54. 9998

    Returns: 2666797

  55. 6661

    Returns: 1755666

  56. 6660

    Returns: 1754666

  57. 5700

    Returns: 1666199

  58. 5800

    Returns: 1666299

  59. 5912

    Returns: 1666411

  60. 6606

    Returns: 1726661

  61. 6012

    Returns: 1666511

  62. 6013

    Returns: 1666512

  63. 6326

    Returns: 1666825

  64. 6446

    Returns: 1666945

  65. 6565

    Returns: 1704666

  66. 6999

    Returns: 1866638

  67. 6666

    Returns: 1756664

  68. 1

    Returns: 666

  69. 10000

    Returns: 2666799

  70. 999

    Returns: 366638

  71. 9785

    Returns: 2666584

  72. 588

    Returns: 216662

  73. 9

    Returns: 6662

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: