chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md

@@ -1,37 +1,48 @@
 ---
 id: 5900f3c61000cf542c50fed9
-title: 问题90：立方体数字对
+title: 'Problem 90: Cube digit pairs'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302207
 dashedName: problem-90-cube-digit-pairs
 ---
 
 # --description--
 
-立方体上的六个面中的每一个都有一个写在其上的不同数字（0到9）;第二个立方体也是如此。通过将两个立方体并排放置在不同的位置，我们可以形成各种2位数字。
+Each of the six faces on a cube has a different digit (0 to 9) written on it; the same is done to a second cube. By placing the two cubes side-by-side in different positions we can form a variety of 2-digit numbers.
 
-例如，可以形成平方数64：
+For example, the square number 64 could be formed:
 
-实际上，通过仔细选择两个立方体上的数字，可以显示低于100的所有正方形数字：01,04,09,16,25,36,49,64和81。
+<img class="img-responsive center-block" alt="two cubes, one with the number 6 and the other with number 4" src="https://cdn-media-1.freecodecamp.org/project-euler/cube-digit-pairs.png" style="background-color: white; padding: 10px;" />
 
-例如，可以实现的一种方法是将{0,5,6,7,8,9}放在一个立方体上，将{1,2,3,4,8,9}放在另一个立方体上。
+In fact, by carefully choosing the digits on both cubes it is possible to display all of the square numbers below one-hundred: 01, 04, 09, 16, 25, 36, 49, 64, and 81.
 
-但是，对于这个问题，我们应该允许将6或9颠倒，以便安排像{0,5,6,7,8,9}和{1,2,3,4,6,7}允许显示所有九个方形数字;否则就不可能获得09。
+For example, one way this can be achieved is by placing {0, 5, 6, 7, 8, 9} on one cube and {1, 2, 3, 4, 8, 9} on the other cube.
 
-在确定不同的排列时，我们对每个立方体上的数字感兴趣，而不是订单。
+However, for this problem we shall allow the 6 or 9 to be turned upside-down so that an arrangement like {0, 5, 6, 7, 8, 9} and {1, 2, 3, 4, 6, 7} allows for all nine square numbers to be displayed; otherwise it would be impossible to obtain 09.
 
-{1,2,3,4,5,6}相当于{3,6,4,1,2,5} {1,2,3,4,5,6}不同于{1,2， 3,4,5,9}
+In determining a distinct arrangement we are interested in the digits on each cube, not the order.
 
-但是因为我们允许反转6和9，所以最后一个例子中的两个不同的集合都代表扩展集{1,2,3,4,5,6,9}以形成2位数字。
+<div style="margin-left: 4em;">
+  {1, 2, 3, 4, 5, 6} is equivalent to {3, 6, 4, 1, 2, 5}<br>
+  {1, 2, 3, 4, 5, 6} is distinct from {1, 2, 3, 4, 5, 9}
+</div>
 
-两个立方体有多少不同的排列可以显示所有的方形数字？
+But because we are allowing 6 and 9 to be reversed, the two distinct sets in the last example both represent the extended set {1, 2, 3, 4, 5, 6, 9} for the purpose of forming 2-digit numbers.
+
+How many distinct arrangements of the two cubes allow for all of the square numbers to be displayed?
 
 # --hints--
 
-`euler90()`应该返回1217。
+`cubeDigitPairs()` should return a number.
 
 ```js
-assert.strictEqual(euler90(), 1217);
+assert(typeof cubeDigitPairs() === 'number');
+```
+
+`cubeDigitPairs()` should return 1217.
+
+```js
+assert.strictEqual(cubeDigitPairs(), 1217);
 ```
 
 # --seed--