ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
47 lines
1.0 KiB
Markdown
47 lines
1.0 KiB
Markdown
---
|
|
id: 5900f3dd1000cf542c50fef0
|
|
title: 'Problem 113: Non-bouncy numbers'
|
|
challengeType: 5
|
|
forumTopicId: 301739
|
|
dashedName: 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?
|
|
|
|
# --hints--
|
|
|
|
`euler113()` should return 51161058134250.
|
|
|
|
```js
|
|
assert.strictEqual(euler113(), 51161058134250);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler113() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler113();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|