chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md

@@ -1,40 +1,44 @@
 ---
 id: 5900f37f1000cf542c50fe92
-title: 问题19：计算星期日
+title: 'Problem 19: Counting Sundays'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301827
 dashedName: problem-19-counting-sundays
 ---
 
 # --description--
 
-您将获得以下信息，但您可能更愿意为自己做一些研究。
+You are given the following information, but you may prefer to do some research for yourself.
 
--   1900年1月1日是星期一。
--   九月是三十天  
-    四月，六月和十一月。  
-    其余的都有三十一个，  
-    仅拯救二月，  
-    其中有二十八，风雨无阻。  
-    在闰年，二十九岁。
--   闰年发生在任何一年，可被4整除，但除非可被400整除，否则不会在一个世纪上。
--   在二十世纪的第一个月（1901年1月1日至2000年12月31日），有多少个星期日下降？
+<ul>
+  <li>1 Jan 1900 was a Monday.</li>
+  <li>Thirty days has September,<br>April, June and November.<br>All the rest have thirty-one,<br>Saving February alone,<br>Which has twenty-eight, rain or shine.<br>And on leap years, twenty-nine.</li>
+  <li>A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.</li>
+</ul>
+
+How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?
 
 # --hints--
 
-`countingSundays(1943, 1946)`应该返回6。
+`countingSundays(1943, 1946)` should return a number.
+
+```js
+assert(typeof countingSundays(1943, 1946) === 'number');
+```
+
+`countingSundays(1943, 1946)` should return 6.
 
 ```js
 assert.strictEqual(countingSundays(1943, 1946), 6);
 ```
 
-`countingSundays(1995, 2000)`应该返回9。
+`countingSundays(1995, 2000)` should return 10.
 
 ```js
 assert.strictEqual(countingSundays(1995, 2000), 10);
 ```
 
-`countingSundays(1901, 2000)`应该返回171。
+`countingSundays(1901, 2000)` should return 171.
 
 ```js
 assert.strictEqual(countingSundays(1901, 2000), 171);