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>
39 lines
825 B
Markdown
39 lines
825 B
Markdown
---
|
||
id: 5900f4461000cf542c50ff58
|
||
title: 问题217：平衡数字
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-217-balanced-numbers
|
||
---
|
||
|
||
# --description--
|
||
|
||
具有k（十进制）数字的正整数称为平衡，如果其第一个⌈k/2⌉数字总和为与其最后的⌈k/2⌉数字相同的值，其中⌈x⌉，x的发音上限，是最小整数≥x，因此⌈π⌉= 4且⌈5⌉= 5.因此，例如，所有回文都是平衡的，如13722.设T（n）是所有平衡数小于10n的总和。因此：T（1）= 45，T（2）= 540，T（5）= 334795890.求T（47）mod 315
|
||
|
||
# --hints--
|
||
|
||
`euler217()`应该返回6273134。
|
||
|
||
```js
|
||
assert.strictEqual(euler217(), 6273134);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler217() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler217();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|