61 lines
860 B
Markdown
61 lines
860 B
Markdown
|
---
|
||
|
id: 5
|
||
|
localeTitle: 5900f46e1000cf542c50ff81
|
||
|
challengeType: 5
|
||
|
title: 'Problem 258: A lagged Fibonacci sequence'
|
||
|
---
|
||
|
|
||
|
## Description
|
||
|
<section id='description'>
|
||
|
Una secuencia se define como:
|
||
|
|
||
|
gk = 1, para 0 ≤ k ≤ 1999
|
||
|
gk = gk-2000 + gk-1999, para k ≥ 2000.
|
||
|
Encontrar gk mod 20092010 para k = 1018.
|
||
|
</section>
|
||
|
|
||
|
## Instructions
|
||
|
<section id='instructions'>
|
||
|
|
||
|
</section>
|
||
|
|
||
|
## Tests
|
||
|
<section id='tests'>
|
||
|
|
||
|
```yml
|
||
|
tests:
|
||
|
- text: <code>euler258()</code> debe devolver 12747994.
|
||
|
testString: 'assert.strictEqual(euler258(), 12747994, "<code>euler258()</code> should return 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>
|