chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-310-nim-square.md

@@ -1,26 +1,26 @@
 ---
 id: 5900f4a21000cf542c50ffb5
-title: 问题310：尼姆广场
+title: 'Problem 310: Nim Square'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301966
 dashedName: problem-310-nim-square
 ---
 
 # --description--
 
-爱丽丝和鲍勃玩游戏Nim Square。
+Alice and Bob play the game Nim Square.
 
-Nim Square就像普通的三堆普通游戏Nim一样，但是玩家只能从堆中取出一平方的石头。
+Nim Square is just like ordinary three-heap normal play Nim, but the players may only remove a square number of stones from a heap.
 
-三个堆中的石头数量由有序三元组（a，b，c）表示。
+The number of stones in the three heaps is represented by the ordered triple (a,b,c).
 
-如果0≤a≤b≤c≤29，则下一个玩家的失落位数为1160。
+If 0≤a≤b≤c≤29 then the number of losing positions for the next player is 1160.
 
-如果0≤a≤b≤c≤100000，则查找下一个玩家的失落位置数。
+Find the number of losing positions for the next player if 0≤a≤b≤c≤100 000.
 
 # --hints--
 
-`euler310()`应该返回2586528661783。
+`euler310()` should return 2586528661783.
 
 ```js
 assert.strictEqual(euler310(), 2586528661783);