chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-394-eating-pie.md

@@ -1,22 +1,32 @@
 ---
 id: 5900f4f71000cf542c510009
-title: 问题394：吃馅饼
+title: 'Problem 394: Eating pie'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302059
 dashedName: problem-394-eating-pie
 ---
 
 # --description--
 
-杰夫以一种不同寻常的方式吃馅饼。馅饼是圆形的。他首先沿着半径切割馅饼中的初始切口。虽然剩下至少给定的馅饼F分数，但他执行以下程序： - 他从饼图中心到馅饼边框剩余的任何一点做两个切片，剩下的馅饼边框上的任何一点都有可能。这将把剩下的馅饼分成三块。 - 从最初的切割逆时针走，他拿出前两个馅饼并吃掉它们。当剩下不到一小部分馅饼时，他不再重复这个过程。相反，他吃剩下的所有馅饼。
+Jeff eats a pie in an unusual way.
 
-对于x≥1，设E（x）是Jeff重复上述过程的预期次数，F = 1 / x。可以证实E（1）= 1，E（2）≈1.2676536759，和E（7.5）≈2.1215732071。
+The pie is circular. He starts with slicing an initial cut in the pie along a radius.
 
-找到E（40）舍入到小数点后面的10位小数。
+While there is at least a given fraction F of pie left, he performs the following procedure:
+
+\- He makes two slices from the pie centre to any point of what is remaining of the pie border, any point on the remaining pie border equally likely. This will divide the remaining pie into three pieces.
+
+\- Going counterclockwise from the initial cut, he takes the first two pie pieces and eats them.
+
+When less than a fraction F of pie remains, he does not repeat this procedure. Instead, he eats all of the remaining pie.
+
+For x ≥ 1, let E(x) be the expected number of times Jeff repeats the procedure above with F = 1/x. It can be verified that E(1) = 1, E(2) ≈ 1.2676536759, and E(7.5) ≈ 2.1215732071.
+
+Find E(40) rounded to 10 decimal places behind the decimal point.
 
 # --hints--
 
-`euler394()`应返回3.2370342194。
+`euler394()` should return 3.2370342194.
 
 ```js
 assert.strictEqual(euler394(), 3.2370342194);