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
777 B
Markdown
39 lines
777 B
Markdown
---
|
||
id: 5900f3e41000cf542c50fef6
|
||
title: 问题119：数字功率总和
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-119-digit-power-sum
|
||
---
|
||
|
||
# --description--
|
||
|
||
数字512很有意思，因为它等于它的数字加到某个幂的总和：5 + 1 + 2 = 8，而83 = 512.具有这个属性的数字的另一个例子是614656 = 284.我们将定义一个成为这个序列的第n个术语，并坚持一个数字必须包含至少两个数字才能得到一个总和。给出a2 = 512和a10 = 614656。找到a30。
|
||
|
||
# --hints--
|
||
|
||
`euler119()`应该返回248155780267521。
|
||
|
||
```js
|
||
assert.strictEqual(euler119(), 248155780267521);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler119() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler119();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|