* 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>
695 B
695 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f44e1000cf542c50ff60 | 问题225:Tribonacci非除数 | 5 | problem-225-tribonacci-non-divisors |
--description--
序列1,1,1,3,5,9,17,31,57,105,193,355,653,1201 ......由T1 = T2 = T3 = 1和Tn = Tn-1 + Tn定义-2 + Tn-3。
可以证明27不会划分该序列的任何项。实际上,27是具有该属性的第一个奇数。
找到不分割上述序列的任何项的第124个奇数。
--hints--
euler225()
应该返回2009年。
assert.strictEqual(euler225(), 2009);
--seed--
--seed-contents--
function euler225() {
return true;
}
euler225();
--solutions--
// solution required