ee1e8abd87
* 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>
686 B
686 B
id, title, challengeType, videoUrl, dashedName
| id | title | challengeType | videoUrl | dashedName |
|---|---|---|---|---|
| 5900f4311000cf542c50ff44 | 问题197：研究递归定义的序列的行为 | 5 | problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence |
--description--
给定函数f（x）=⌊230.403243784-x2⌋×10-9（⌊⌊是floor函数），序列un由u0 = -1和un + 1 = f（un）定义。
找到n + 1012的un + un + 1.在小数点后面给出9位数的答案。
--hints--
euler197()应该返回1.710637717。
assert.strictEqual(euler197(), 1.710637717);
--seed--
--seed-contents--
function euler197() {
return true;
}
euler197();
--solutions--
// solution required