chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-31-coin-sums.md

@@ -1,44 +1,50 @@
 ---
 id: 5900f38b1000cf542c50fe9e
-title: 问题31：硬币总和
+title: 'Problem 31: Coin sums'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301965
 dashedName: problem-31-coin-sums
 ---
 
 # --description--
 
-在英格兰，货币由英镑，英镑和便士p组成，并且有八种普通硬币流通：
+In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
 
-1p，2p，5p，10p，20p，50p，£1（100p）和£2（200p）。
+<div style='margin-left: 4em;'>1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).</div>
 
-可以通过以下方式赚取£2：
+It is possible to make £2 in the following way:
 
-1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
+<div style='margin-left: 4em;'>1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p</div>
 
-使用任意数量的硬币可以制成多少种便士？
+How many different ways can `n` pence be made using any number of coins?
 
 # --hints--
 
-`digitnPowers(50)`应该返回451。
+`coinSums(50)` should return a number.
+
+```js
+assert(typeof coinSums(50) === 'number');
+```
+
+`coinSums(50)` should return 451.
 
 ```js
 assert(coinSums(50) == 451);
 ```
 
-`digitnPowers(100)`应该返回4563。
+`coinSums(100)` should return 4563.
 
 ```js
 assert(coinSums(100) == 4563);
 ```
 
-`digitnPowers(150)`应该返回21873。
+`coinSums(150)` should return 21873.
 
 ```js
 assert(coinSums(150) == 21873);
 ```
 
-`digitnPowers(200)`应该返回73682。
+`coinSums(200)` should return 73682.
 
 ```js
 assert(coinSums(200) == 73682);