56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f3dd1000cf542c50fef0
|
||
challengeType: 5
|
||
title: 'Problem 113: Non-bouncy numbers'
|
||
videoUrl: ''
|
||
localeTitle: 问题113：非弹性数字
|
||
---
|
||
|
||
## Description
|
||
<section id="description">如果左边的数字没有超过数字，则从左到右工作，称为递增数字;例如，134468。同样，如果右边的数字没有超过数字，则称为递减数字;例如，66420。我们将调用一个既不增加也不减少“有弹性”数的正整数;例如，随着n的增加，低于n的弹性数的比例增加，使得只有12951个数字低于一百万个而不是有弹性而只有277032个非有弹性的数字低于1010.一个数量低于一个googol（10100） ）是不是有弹性？ </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler113()</code>应该返回51161058134250。
|
||
testString: 'assert.strictEqual(euler113(), 51161058134250, "<code>euler113()</code> should return 51161058134250.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler113() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler113();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|