Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md

22 lines
530 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
---
id: 5900f3aa1000cf542c50febd
title: 问题62立方排列
challengeType: 5
videoUrl: ''
---
# --description--
可以置换立方体410636253453以产生另外两个立方体566231043843和664301254053。实际上41063625是最小的立方体其正好具有三个排列的数字也是立方体。找到最小的立方体其数字的五个排列正好是立方体。
# --hints--
`euler62()`应该返回127035954683。
```js
assert.strictEqual(euler62(), 127035954683);
```
# --solutions--