chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md

@@ -1,28 +1,28 @@
 ---
 id: 5900f5241000cf542c510037
-title: 问题440：GCD和平铺
+title: 'Problem 440: GCD and Tiling'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302112
 dashedName: problem-440-gcd-and-tiling
 ---
 
 # --description--
 
-我们要完全平铺一块长度为n且高度为1的板，上面有1×2块或1×1块，上面有一个十进制数字：
+We want to tile a board of length n and height 1 completely, with either 1 × 2 blocks or 1 × 1 blocks with a single decimal digit on top:
 
-例如，以下是铺砌长度为n = 8的板的一些方法：
+For example, here are some of the ways to tile a board of length n = 8:
 
-令T（n）是如上所述的平铺长度为n的板的方式的数量。
+Let T(n) be the number of ways to tile a board of length n as described above.
 
-例如，T（1）= 10且T（2）= 101。
+For example, T(1) = 10 and T(2) = 101.
 
-令S（L）为1≤a，b，c≤L的三次和∑a，b，c gcd（T（ca），T（cb））。 例如： S（2）= 10444 S（3）= 1292115238446807016106539989 S（4）模数987898789 = 670616280。
+Let S(L) be the triple sum ∑a,b,c gcd(T(ca), T(cb)) for 1 ≤ a, b, c ≤ L. For example: S(2) = 10444 S(3) = 1292115238446807016106539989 S(4) mod 987 898 789 = 670616280.
 
-找出S（2000）mod 987898898。
+Find S(2000) mod 987 898 789.
 
 # --hints--
 
-`euler440()`应该返回970746056。
+`euler440()` should return 970746056.
 
 ```js
 assert.strictEqual(euler440(), 970746056);