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
588 B
Markdown
39 lines
588 B
Markdown
---
|
||
id: 5900f3ab1000cf542c50febe
|
||
title: 问题63：强大的数字计数
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-63-powerful-digit-counts
|
||
---
|
||
|
||
# --description--
|
||
|
||
5位数字，16807 = 75，也是第五种力量。类似地，9位数字134217728 = 89是第九次幂。存在多少个n位正整数，它们也是n次幂？
|
||
|
||
# --hints--
|
||
|
||
`euler63()`应该返回49。
|
||
|
||
```js
|
||
assert.strictEqual(euler63(), 49);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function powerfulDigitCounts() {
|
||
|
||
return true;
|
||
}
|
||
|
||
powerfulDigitCounts();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|