chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md

@@ -1,25 +1,43 @@
 ---
 id: 5900f3ba1000cf542c50fecd
-title: 问题78：硬币分区
+title: 'Problem 78: Coin partitions'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302191
 dashedName: problem-78-coin-partitions
 ---
 
 # --description--
 
-设p（n）表示n个硬币可以分成桩的不同方式的数量。例如，五个硬币可以用七种不同的方式分成几堆，所以p（5）= 7。
+Let p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so p(5)=7.
 
-OOOOO OOOO O OOO OO OOO O O OO OO O O O O O O O O O O O O O O O O O O O O O O O O O
+<div style='text-align: center;'>
 
-找到n的最小值，p（n）可以被一百万整除。
+| Coin piles        |
+| ----------------- |
+| OOOOO             |
+| OOOO   O          |
+| OOO   OO          |
+| OOO   O   O       |
+| OO   OO   O       |
+| OO   O   O   O    |
+| O   O   O   O   O |
+
+</div>
+
+Find the least value of `n` for which p(`n`) is divisible by one million.
 
 # --hints--
 
-`euler78()`应返回55374。
+`coinPartitions()` should return a number.
 
 ```js
-assert.strictEqual(euler78(), 55374);
+assert(typeof coinPartitions() === 'number');
+```
+
+`coinPartitions()` should return 55374.
+
+```js
+assert.strictEqual(coinPartitions(), 55374);
 ```
 
 # --seed--