56 lines
795 B
Markdown
56 lines
795 B
Markdown
---
|
||
id: 5900f46e1000cf542c50ff81
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
localeTitle: 问题258：滞后的斐波那契序列
|
||
---
|
||
|
||
## Description
|
||
<section id="description">序列定义为： <p> gk = 1，对于0≤k≤1999gk = gk-2000 + gk-1999，对于k≥2000。对于k = 1018，找到gk mod 20092010。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler258()</code>应该返回12747994。
|
||
testString: assert.strictEqual(euler258(), 12747994);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler258() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler258();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|