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>
41 lines
567 B
Markdown
41 lines
567 B
Markdown
---
|
||
id: 5900f46e1000cf542c50ff81
|
||
title: 问题258：滞后的斐波那契序列
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-258-a-lagged-fibonacci-sequence
|
||
---
|
||
|
||
# --description--
|
||
|
||
序列定义为：
|
||
|
||
gk = 1，对于0≤k≤1999gk = gk-2000 + gk-1999，对于k≥2000。对于k = 1018，找到gk mod 20092010。
|
||
|
||
# --hints--
|
||
|
||
`euler258()`应该返回12747994。
|
||
|
||
```js
|
||
assert.strictEqual(euler258(), 12747994);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler258() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler258();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|