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>
39 lines
940 B
Markdown
39 lines
940 B
Markdown
---
|
||
id: 5900f3dd1000cf542c50fef0
|
||
title: 问题113：非弹性数字
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-113-non-bouncy-numbers
|
||
---
|
||
|
||
# --description--
|
||
|
||
如果左边的数字没有超过数字，则从左到右工作，称为递增数字;例如，134468。同样，如果右边的数字没有超过数字，则称为递减数字;例如，66420。我们将调用一个既不增加也不减少“有弹性”数的正整数;例如，随着n的增加，低于n的弹性数的比例增加，使得只有12951个数字低于一百万个而不是有弹性而只有277032个非有弹性的数字低于1010.一个数量低于一个googol（10100） ）是不是有弹性？
|
||
|
||
# --hints--
|
||
|
||
`euler113()`应该返回51161058134250。
|
||
|
||
```js
|
||
assert.strictEqual(euler113(), 51161058134250);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler113() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler113();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|