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