56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
|
---
|
|||
|
id: 5900f3d51000cf542c50fee6
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 104: Pandigital Fibonacci ends'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题104:Pandigital Fibonacci结束
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description"> Fibonacci序列由递归关系定义:Fn = Fn-1 + Fn-2,其中F1 = 1且F2 = 1.事实证明,包含113位数字的F541是第一个斐波那契数字,其中最后九个数字是1-9 pandigital(包含所有数字1到9,但不一定按顺序)。 F2749包含575个数字,是第一个斐波那契数字,前九个数字是1-9 pandigital。鉴于Fk是第一个斐波纳契数,前九个数字和后九个数字是1-9 pandigital,找到k。 </section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler104()</code>应返回329468。
|
|||
|
testString: 'assert.strictEqual(euler104(), 329468, "<code>euler104()</code> should return 329468.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler104() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler104();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|