chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-202-laserbeam.md

@@ -1,24 +1,24 @@
 ---
 id: 5900f4371000cf542c50ff49
-title: 问题202：Laserbeam
+title: 'Problem 202: Laserbeam'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301843
 dashedName: problem-202-laserbeam
 ---
 
 # --description--
 
-三个镜子以等边三角形的形状排列，其反射表面指向内侧。在三角形的每个顶点处存在无穷小的间隙，激光束可以通过该间隙。
+Three mirrors are arranged in the shape of an equilateral triangle, with their reflective surfaces pointing inwards. There is an infinitesimal gap at each vertex of the triangle through which a laser beam may pass.
 
-标记顶点A，B和C.有两种方式可以使激光束进入顶点C，从11个表面反弹，然后通过相同的顶点退出：下面显示了一种方式;另一方面与此相反。
+Label the vertices A, B and C. There are 2 ways in which a laser beam may enter vertex C, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.
 
-有80840种方式，激光束可以进入顶点C，从1000001表面反弹，然后通过相同的顶点退出。
+There are 80840 ways in which a laser beam may enter vertex C, bounce off 1000001 surfaces, then exit through the same vertex.
 
-激光束在顶点C进入的方式有多少，从12017639147表面反弹，然后通过相同的顶点退出？
+In how many ways can a laser beam enter at vertex C, bounce off 12017639147 surfaces, then exit through the same vertex?
 
 # --hints--
 
-`euler202()`应返回1209002624。
+`euler202()` should return 1209002624.
 
 ```js
 assert.strictEqual(euler202(), 1209002624);