* 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>
811 B
811 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f3e91000cf542c50fefc | 问题125:回文总和 | 5 | problem-125-palindromic-sums |
--description--
回文数595很有意思,因为它可以写成连续正方形的总和:62 + 72 + 82 + 92 + 102 + 112 + 122.正好有11个以下的回文可以写成连续的平方和,并且这些回文的总和是4164.注意,没有包括1 = 02 + 12,因为该问题涉及正整数的平方。找到小于108的所有数字的总和,这些数字都是回文并且可以写为连续正方形的总和。
--hints--
euler125()
应该返回2906969179。
assert.strictEqual(euler125(), 2906969179);
--seed--
--seed-contents--
function euler125() {
return true;
}
euler125();
--solutions--
// solution required