chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md

@@ -1,24 +1,24 @@
 ---
 id: 5900f4f11000cf542c510002
-title: 问题388：不同的线条
+title: 'Problem 388: Distinct Lines'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302052
 dashedName: problem-388-distinct-lines
 ---
 
 # --description--
 
-考虑所有格点（a，b，c），其中0≤a，b，c≤N。
+Consider all lattice points (a,b,c) with 0 ≤ a,b,c ≤ N.
 
-从原点O（0,0,0）开始，所有线都被绘制到其他格点。设D（N）是不同的这种线的数量。
+From the origin O(0,0,0) all lines are drawn to the other lattice points. Let D(N) be the number of distinct such lines.
 
-您被给予D（1 000 000）= 831909254469114121。
+You are given that D(1 000 000) = 831909254469114121.
 
-找到D（1010）。将前9位数字后跟最后9位数字作为答案。
+Find D(1010). Give as your answer the first nine digits followed by the last nine digits.
 
 # --hints--
 
-`euler388()`应该返回831907372805130000。
+`euler388()` should return 831907372805130000.
 
 ```js
 assert.strictEqual(euler388(), 831907372805130000);