chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md

@@ -1,18 +1,24 @@
 ---
 id: 5900f3e41000cf542c50fef6
-title: 问题119：数字功率总和
+title: 'Problem 119: Digit power sum'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301745
 dashedName: problem-119-digit-power-sum
 ---
 
 # --description--
 
-数字512很有意思，因为它等于它的数字加到某个幂的总和：5 + 1 + 2 = 8，而83 = 512.具有这个属性的数字的另一个例子是614656 = 284.我们将定义一个成为这个序列的第n个术语，并坚持一个数字必须包含至少两个数字才能得到一个总和。给出a2 = 512和a10 = 614656。找到a30。
+The number 512 is interesting because it is equal to the sum of its digits raised to some power: 5 + 1 + 2 = 8, and 83 = 512. Another example of a number with this property is 614656 = 284.
+
+We shall define an to be the nth term of this sequence and insist that a number must contain at least two digits to have a sum.
+
+You are given that a2 = 512 and a10 = 614656.
+
+Find a30.
 
 # --hints--
 
-`euler119()`应该返回248155780267521。
+`euler119()` should return 248155780267521.
 
 ```js
 assert.strictEqual(euler119(), 248155780267521);