* 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>
815 B
815 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f3fd1000cf542c50ff10 | 问题145:有多少可逆数字低于十亿? | 5 | problem-145-how-many-reversible-numbers-are-there-below-one-billion |
--description--
一些正整数n具有sum [n + reverse(n)]完全由奇数(十进制)数字组成的属性。例如,36 + 63 = 99和409 + 904 = 1313.我们将这些数字称为可逆的;所以36,63,409和904是可逆的。 n或反向(n)中不允许前导零。
有一千个可逆数字低于一千。
有多少可逆数字低于十亿(109)?
--hints--
euler145()
应该返回608720。
assert.strictEqual(euler145(), 608720);
--seed--
--seed-contents--
function euler145() {
return true;
}
euler145();
--solutions--
// solution required