chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md

@@ -1,26 +1,34 @@
 ---
 id: 5900f4f11000cf542c510003
-title: 问题387：Harshad数字
+title: 'Problem 387: Harshad Numbers'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302051
 dashedName: problem-387-harshad-numbers
 ---
 
 # --description--
 
-Harshad或Niven数字是可以被其数字之和整除的数字。 201是一个Harshad数，因为它可以被3整数（它的数字之和）。当我们截断201的最后一个数字时，我们得到20，这是一个Harshad数。当我们截断20的最后一位数时，我们得到2，这也是一个Harshad数。让我们调用一个Harshad数字，在递归截断最后一个数字的同时，总是会产生一个Harshad数字，一个正可截断的Harshad数字。
+A Harshad or Niven number is a number that is divisible by the sum of its digits.
 
-另外：201/3 = 67这是素数。让我们称一个Harshad数，当它除以它的数字之和时，得到一个强Harshad数的素数。
+201 is a Harshad number because it is divisible by 3 (the sum of its digits.)
 
-现在取2011年的数字。当我们截断它的最后一位数时，我们得到201，一个强大的Harshad数也是可以截断的。让我们称这样的素数强大，正确的可截断的哈尔沙德素数。
+When we truncate the last digit from 201, we get 20, which is a Harshad number.
 
-你得到的是，强度小，可截断的Harshad素数小于10000的总和是90619。
+When we truncate the last digit from 20, we get 2, which is also a Harshad number.
 
-找到小于1014的强可，可截断的Harshad素数的总和。
+Let's call a Harshad number that, while recursively truncating the last digit, always results in a Harshad number a right truncatable Harshad number.
+
+Also: 201/3=67 which is prime. Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.
+
+Now take the number 2011 which is prime. When we truncate the last digit from it we get 201, a strong Harshad number that is also right truncatable. Let's call such primes strong, right truncatable Harshad primes.
+
+You are given that the sum of the strong, right truncatable Harshad primes less than 10000 is 90619.
+
+Find the sum of the strong, right truncatable Harshad primes less than 1014.
 
 # --hints--
 
-`euler387()`应该返回696067597313468。
+`euler387()` should return 696067597313468.
 
 ```js
 assert.strictEqual(euler387(), 696067597313468);