Oliver Eyton-Williams ee1e8abd87
feat(curriculum): restore seed + solution to Chinese (#40683)
* 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>
2021-01-12 19:31:00 -07:00

873 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f3d51000cf542c50fee6 问题104Pandigital Fibonacci结束 5 problem-104-pandigital-fibonacci-ends

--description--

Fibonacci序列由递归关系定义Fn = Fn-1 + Fn-2其中F1 = 1且F2 = 1.事实证明包含113位数字的F541是第一个斐波那契数字其中最后九个数字是1-9 pandigital包含所有数字1到9但不一定按顺序。 F2749包含575个数字是第一个斐波那契数字前九个数字是1-9 pandigital。鉴于Fk是第一个斐波纳契数前九个数字和后九个数字是1-9 pandigital找到k。

--hints--

euler104()应返回329468。

assert.strictEqual(euler104(), 329468);

--seed--

--seed-contents--

function euler104() {

  return true;
}

euler104();

--solutions--

// solution required