chore(i8n,learn): processed translations
This commit is contained in:
committed by
Mrugesh Mohapatra
parent
15047f2d90
commit
e5c44a3ae5
@ -1,18 +1,28 @@
|
||||
---
|
||||
id: 5900f3dd1000cf542c50feef
|
||||
title: 问题112:有弹性的数字
|
||||
title: 'Problem 112: Bouncy numbers'
|
||||
challengeType: 5
|
||||
videoUrl: ''
|
||||
forumTopicId: 301738
|
||||
dashedName: problem-112-bouncy-numbers
|
||||
---
|
||||
|
||||
# --description--
|
||||
|
||||
如果左边的数字没有超过数字,则从左到右工作,称为递增数字;例如,134468。同样,如果右边的数字没有超过数字,则称为递减数字;例如,66420。我们将调用一个既不增加也不减少“有弹性”数的正整数;例如,155349。显然,不会有任何低于一百的弹性数字,但只有超过一千(525)的数字超过一半是有弹性的。事实上,有弹性数字首次达到50%的最小数量是538.令人惊讶的是,有弹性的数字变得越来越普遍,当我们达到21780时,有弹性数字的比例等于90%。找出有弹性数字的比例正好为99%的最小数字。
|
||||
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.
|
||||
|
||||
Clearly there cannot be any bouncy numbers below one-hundred, but just over half of the numbers below one-thousand (525) are bouncy. In fact, the least number for which the proportion of bouncy numbers first reaches 50% is 538.
|
||||
|
||||
Surprisingly, bouncy numbers become more and more common and by the time we reach 21780 the proportion of bouncy numbers is equal to 90%.
|
||||
|
||||
Find the least number for which the proportion of bouncy numbers is exactly 99%.
|
||||
|
||||
# --hints--
|
||||
|
||||
`euler112()`应返回1587000。
|
||||
`euler112()` should return 1587000.
|
||||
|
||||
```js
|
||||
assert.strictEqual(euler112(), 1587000);
|
||||
|
Reference in New Issue
Block a user