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
873 B
Markdown
39 lines
873 B
Markdown
---
|
||
id: 5900f3d51000cf542c50fee6
|
||
title: 问题104：Pandigital Fibonacci结束
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-104-pandigital-fibonacci-ends
|
||
---
|
||
|
||
# --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。
|
||
|
||
# --hints--
|
||
|
||
`euler104()`应返回329468。
|
||
|
||
```js
|
||
assert.strictEqual(euler104(), 329468);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler104() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler104();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|