freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f46e1000cf542c50ff81	5	Problem 258: A lagged Fibonacci sequence		问题258：滞后的斐波那契序列

Description

序列定义为：

gk = 1，对于0≤k≤1999gk = gk-2000 + gk-1999，对于k≥2000。对于k = 1018，找到gk mod 20092010。

Instructions

Tests

tests:
  - text: <code>euler258()</code>应该返回12747994。
    testString: 'assert.strictEqual(euler258(), 12747994, "<code>euler258()</code> should return 12747994.");'

Challenge Seed

function euler258() {
  // Good luck!
  return true;
}

euler258();

Solution

// solution required