freeCodeCamp/problem-113-non-bouncy-numbers.english.md at 9341aadb5b2421c3c0526ab93c657590218ce20c

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.3 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3dd1000cf542c50fef0	5	Problem 113: Non-bouncy numbers

Description

Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468. Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420. We shall call a positive integer that is neither increasing nor decreasing a "bouncy" number; for example, 155349. As n increases, the proportion of bouncy numbers below n increases such that there are only 12951 numbers below one-million that are not bouncy and only 277032 non-bouncy numbers below 1010. How many numbers below a googol (10100) are not bouncy?

Instructions

Tests

tests:
  - text: <code>euler113()</code> should return 51161058134250.
    testString: assert.strictEqual(euler113(), 51161058134250, '<code>euler113()</code> should return 51161058134250.');

Challenge Seed

function euler113() {
  // Good luck!
  return true;
}

euler113();

Solution

// solution required

1.3 KiB Raw Blame History