chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-313-sliding-game.md

@@ -1,24 +1,24 @@
 ---
 id: 5900f4a61000cf542c50ffb8
-title: 问题313：滑行游戏
+title: 'Problem 313: Sliding game'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301969
 dashedName: problem-313-sliding-game
 ---
 
 # --description--
 
-在滑动游戏中，柜台可以水平或垂直滑入一个空白区域。 游戏的目的是将红色计数器从网格的左上角移至右下角。 该空间始终始于右下角。 例如，以下图片序列显示了如何在2 x 2网格上进行5次移动才能完成游戏。
+In a sliding game a counter may slide horizontally or vertically into an empty space. The objective of the game is to move the red counter from the top left corner of a grid to the bottom right corner; the space always starts in the bottom right corner. For example, the following sequence of pictures show how the game can be completed in five moves on a 2 by 2 grid.
 
-令S（m，n）代表完成游戏的最小移动次数。 例如，可以验证S（5.4）= 25。
+Let S(m,n) represent the minimum number of moves to complete the game on an m by n grid. For example, it can be verified that S(5,4) = 25.
 
-正好有5482个网格，其中S（m，n）= p2，其中p <100是质数。
+There are exactly 5482 grids for which S(m,n) = p2, where p < 100 is prime.
 
-S（m，n）= p2有多少个网格，其中p <106是素数？
+How many grids does S(m,n) = p2, where p < 106 is prime?
 
 # --hints--
 
-`euler313()`应该返回2057774861813004。
+`euler313()` should return 2057774861813004.
 
 ```js
 assert.strictEqual(euler313(), 2057774861813004);