freeCodeCamp/problem-62-cubic-permutations.chinese.md at b99d78858be1d1ab1aae3417e00c38a458a72ae3

Files

Oliver Eyton-Williams 61460c8601 fix: insert blank line after ```

search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags

2020-08-16 04:45:20 +05:30

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3aa1000cf542c50febd	5	Problem 62: Cubic permutations		问题62：立方排列

Description

可以置换立方体41063625（3453）以产生另外两个立方体：56623104（3843）和66430125（4053）。实际上，41063625是最小的立方体，其正好具有三个排列的数字也是立方体。找到最小的立方体，其数字的五个排列正好是立方体。

tests:
  - text: <code>euler62()</code>应该返回127035954683。
    testString: assert.strictEqual(euler62(), 127035954683);

function euler62() {
  // Good luck!
  return true;
}

euler62();

// solution required

/section>