70 lines
1.4 KiB
Markdown
70 lines
1.4 KiB
Markdown
---
|
||
id: 5900f38a1000cf542c50fe9d
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题30：数字n次方
|
||
---
|
||
|
||
## Description
|
||
<section id="description">
|
||
令人惊讶的是，只有三个数字可以写为它们的数字的四次幂之和：
|
||
1634 = 1 <sup> 4 </sup> + 6 <sup> 4 </sup> + 3 <sup> 4 </sup> + 4 <sup> 4 </sup>
|
||
8208 = 8 <sup> 4 </sup> + 2 <sup> 4 </sup> + 0 <sup> 4 </sup> + 8 <sup> 4 </sup>
|
||
9474 = 9 <sup> 4 </sup> + 4 <sup> 4 </sup> + 7 <sup> 4 </sup> + 4 <sup> 4 </sup>
|
||
由于1 = 1 <sup> 4 </sup>不是总和，因此不包括在内。
|
||
这些数字的总和为1634 + 8208 + 9474 = 19316。
|
||
找出所有可以写为数字n次幂的数字之和。
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>digitnPowers(2)</code>应该返回0。
|
||
testString: assert(digitnPowers(2) == 0);
|
||
- text: <code>digitnPowers(3)</code>应该返回1301。
|
||
testString: assert(digitnPowers(3) == 1301);
|
||
- text: <code>digitnPowers(4)</code>应该返回19316。
|
||
testString: assert(digitnPowers(4) == 19316);
|
||
- text: <code>digitnPowers(5)</code>应该返回443839。
|
||
testString: assert(digitnPowers(5) == 443839);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function digitnPowers(n) {
|
||
// Good luck!
|
||
return n;
|
||
}
|
||
|
||
digitnPowers(5);
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|