56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
id: 5900f3b61000cf542c50fec9
|
|||
|
challengeType: 5
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题74:数字因子链
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">数字145是众所周知的,其数字的阶乘之和等于145:1! + 4! + 5! = 1 + 24 + 120 = 145也许知名度较低的是169,因为它产生了最长的数字链,可以链接到169;事实证明,只存在三个这样的循环:169→363601→1454→169 871→45361→871 872→45362→872不难证明每个起始编号最终都会陷入循环。例如,69→363600→1454→169→363601(→1454)78→45360→871→45361(→871)540→145(→145)从69开始产生五个非重复项链,但最长起始数低于一百万的非重复链是60个项。起始数低于一百万的链中有多少个包含正好六十个非重复项? </section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler74()</code>应返回402。
|
|||
|
testString: assert.strictEqual(euler74(), 402);
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler74() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler74();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
|
|||
|
/section>
|