56 lines
924 B
Markdown
56 lines
924 B
Markdown
---
|
||
id: 5900f3aa1000cf542c50febd
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题62：立方排列
|
||
---
|
||
|
||
## Description
|
||
<section id="description">可以置换立方体41063625（3453）以产生另外两个立方体：56623104（3843）和66430125（4053）。实际上，41063625是最小的立方体，其正好具有三个排列的数字也是立方体。找到最小的立方体，其数字的五个排列正好是立方体。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler62()</code>应该返回127035954683。
|
||
testString: assert.strictEqual(euler62(), 127035954683);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler62() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler62();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|