chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md

@@ -1,24 +1,28 @@
 ---
 id: 5900f4e01000cf542c50fff2
-title: 问题371：车牌
+title: 'Problem 371: Licence plates'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302033
 dashedName: problem-371-licence-plates
 ---
 
 # --description--
 
-俄勒冈车牌由三个字母后跟一个三位数组成（每个数字可以是\[0..9]）。开车上班时，赛斯玩下面的游戏：每当他旅行中看到的两个牌照的数量增加到1000就是胜利。
+Oregon licence plates consist of three letters followed by a three digit number (each digit can be from \[0..9]).
 
-例如，MIC-012和HAN-988也是胜利，RYU-500和SET-500也是如此。 （只要他在同一次旅行中看到他们）。
+While driving to work Seth plays the following game:
 
-找到他想要获胜的预期牌照数量。将您的答案四舍五入到小数点后面的小数点后8位。
+Whenever the numbers of two licence plates seen on his trip add to 1000 that's a win.
 
-注意：我们假设所看到的每个牌照同样可能有三位数字。
+E.g. MIC-012 and HAN-988 is a win and RYU-500 and SET-500 too. (as long as he sees them in the same trip).
+
+Find the expected number of plates he needs to see for a win. Give your answer rounded to 8 decimal places behind the decimal point.
+
+Note: We assume that each licence plate seen is equally likely to have any three digit number on it.
 
 # --hints--
 
-`euler371()`应返回40.66368097。
+`euler371()` should return 40.66368097.
 
 ```js
 assert.strictEqual(euler371(), 40.66368097);