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>
47 lines
794 B
Markdown
47 lines
794 B
Markdown
---
|
|
id: 5900f3ab1000cf542c50febe
|
|
title: 'Problem 63: Powerful digit counts'
|
|
challengeType: 5
|
|
forumTopicId: 302175
|
|
dashedName: problem-63-powerful-digit-counts
|
|
---
|
|
|
|
# --description--
|
|
|
|
The 5-digit number, 16807 = 7<sup>5</sup>, is also a fifth power. Similarly, the 9-digit number, 134217728 = 8<sup>9</sup>, is a ninth power.
|
|
|
|
How many `n`-digit positive integers exist which are also an `n`th power?
|
|
|
|
# --hints--
|
|
|
|
`powerfulDigitCounts()` should return a number.
|
|
|
|
```js
|
|
assert(typeof powerfulDigitCounts() === 'number');
|
|
```
|
|
|
|
`powerfulDigitCounts()` should return 49.
|
|
|
|
```js
|
|
assert.strictEqual(powerfulDigitCounts(), 49);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function powerfulDigitCounts() {
|
|
|
|
return true;
|
|
}
|
|
|
|
powerfulDigitCounts();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|