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
1.0 KiB
Markdown
39 lines
1.0 KiB
Markdown
---
|
||
id: 5900f3dd1000cf542c50feef
|
||
title: 问题112：有弹性的数字
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-112-bouncy-numbers
|
||
---
|
||
|
||
# --description--
|
||
|
||
如果左边的数字没有超过数字，则从左到右工作，称为递增数字;例如，134468。同样，如果右边的数字没有超过数字，则称为递减数字;例如，66420。我们将调用一个既不增加也不减少“有弹性”数的正整数;例如，155349。显然，不会有任何低于一百的弹性数字，但只有超过一千（525）的数字超过一半是有弹性的。事实上，有弹性数字首次达到50％的最小数量是538.令人惊讶的是，有弹性的数字变得越来越普遍，当我们达到21780时，有弹性数字的比例等于90％。找出有弹性数字的比例正好为99％的最小数字。
|
||
|
||
# --hints--
|
||
|
||
`euler112()`应返回1587000。
|
||
|
||
```js
|
||
assert.strictEqual(euler112(), 1587000);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler112() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler112();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|