56 lines
882 B
Markdown
56 lines
882 B
Markdown
---
|
||
id: 5900f3ab1000cf542c50febe
|
||
challengeType: 5
|
||
title: 'Problem 63: Powerful digit counts'
|
||
videoUrl: ''
|
||
localeTitle: 问题63：强大的数字计数
|
||
---
|
||
|
||
## Description
|
||
<section id="description"> 5位数字，16807 = 75，也是第五种力量。类似地，9位数字134217728 = 89是第九次幂。存在多少个n位正整数，它们也是n次幂？ </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler63()</code>应该返回49。
|
||
testString: 'assert.strictEqual(euler63(), 49, "<code>euler63()</code> should return 49.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler63() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler63();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|