chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-250-250250.md

@@ -1,18 +1,18 @@
 ---
 id: 5900f4661000cf542c50ff78
-title: 问题250：250250
+title: 'Problem 250: 250250'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301898
 dashedName: problem-250-250250
 ---
 
 # --description--
 
-找到{11,22,33，...，250250250250}的非空子集的数量，其元素的总和可被250整除。输入最右边的16位作为答案。
+Find the number of non-empty subsets of {11, 22, 33,..., 250250250250}, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.
 
 # --hints--
 
-`euler250()`应该返回1425480602091519。
+`euler250()` should return 1425480602091519.
 
 ```js
 assert.strictEqual(euler250(), 1425480602091519);