chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md

@@ -1,23 +1,35 @@
 ---
 id: 5900f3c31000cf542c50fed5
-title: 问题86：长方体路线
+title: 'Problem 86: Cuboid route'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302200
 dashedName: problem-86-cuboid-route
 ---
 
 # --description--
 
-一只蜘蛛S坐在一个长方形房间的一个角落里，尺寸为6乘5乘3，一只苍蝇F坐在对面的角落里。通过在房间的表面上行进，从S到F的最短“直线”距离是10并且路径在图上示出。
+A spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3, and a fly, F, sits in the opposite corner. By travelling on the surfaces of the room the shortest "straight line" distance from S to F is 10 and the path is shown on the diagram.
 
-但是，对于任何给定的长方体，最多有三个“最短”路径候选，并且最短路径并不总是具有整数长度。可以证明，正好有2060个不同的长方体，忽略旋转，具有整数尺寸，最大尺寸为M×M×M，当M = 100时，最短路径具有整数长度。这是最小值M的解决方案数首先超过两千;当M = 99时的解的数量是1975.找到M的最小值，使得解的数量首先超过一百万。
+<img class="img-responsive center-block" alt="a diagram of a spider and fly's path from one corner of a cuboid room to the opposite corner" src="https://cdn-media-1.freecodecamp.org/project-euler/cuboid-route.png" style="background-color: white; padding: 10px;" />
+
+However, there are up to three "shortest" path candidates for any given cuboid and the shortest route doesn't always have integer length.
+
+It can be shown that there are exactly 2060 distinct cuboids, ignoring rotations, with integer dimensions, up to a maximum size of M by M by M, for which the shortest route has integer length when M = 100. This is the least value of M for which the number of solutions first exceeds two thousand; the number of solutions when M = 99 is 1975.
+
+Find the least value of M such that the number of solutions first exceeds one million.
 
 # --hints--
 
-`euler86()`应该返回1818年。
+`cuboidRoute()` should return a number.
 
 ```js
-assert.strictEqual(euler86(), 1818);
+assert(typeof cuboidRoute() === 'number');
+```
+
+`cuboidRoute()` should return 1818.
+
+```js
+assert.strictEqual(cuboidRoute(), 1818);
 ```
 
 # --seed--