--- id: 5900f46e1000cf542c50ff81 challengeType: 5 title: 'Problem 258: A lagged Fibonacci sequence' videoUrl: '' localeTitle: 问题258:滞后的斐波那契序列 --- ## Description 序列定义为: gk = 1,对于0≤k≤1999gk = gk-2000 + gk-1999,对于k≥2000。对于k = 1018,找到gk mod 20092010。 ## Instructions ## Tests ```yml tests: - text: euler258()应该返回12747994。 testString: 'assert.strictEqual(euler258(), 12747994, "euler258() should return 12747994.");' ``` ## Challenge Seed ```js function euler258() { // Good luck! return true; } euler258(); ``` ## Solution ```js // solution required ```
gk = 1,对于0≤k≤1999gk = gk-2000 + gk-1999,对于k≥2000。对于k = 1018,找到gk mod 20092010。
euler258()