chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-459-flipping-game.md

@@ -1,28 +1,32 @@
 ---
 id: 5900f5371000cf542c51004a
-title: 问题459：翻转游戏
+title: 'Problem 459: Flipping game'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302133
 dashedName: problem-459-flipping-game
 ---
 
 # --description--
 
-翻转游戏是在N×N方板上玩的双人游戏。每个方块包含一面白色和一面黑色的圆盘。游戏开始时所有磁盘都显示白色。
+The flipping game is a two player game played on a N by N square board.
 
-转弯包括翻转具有以下属性的矩形中的所有磁盘：矩形的右上角包含一个白色圆盘，矩形宽度是一个完美的正方形（1,4,9,16，...），矩形高度为三角形数字（1,3,6,10 ......）
+Each square contains a disk with one side white and one side black.
 
-球员轮流转换。玩家通过将网格全黑变为胜利。
+The game starts with all disks showing their white side.
 
-假设完美游戏，让W（N）为N×N板上第一个玩家的获胜动作数，所有盘都是白色的。 W（1）= 1，W（2）= 0，W（5）= 8，W（102）= 31395。
+A turn consists of flipping all disks in a rectangle with the following properties: the upper right corner of the rectangle contains a white disk the rectangle width is a perfect square (1, 4, 9, 16, ...) the rectangle height is a triangular number (1, 3, 6, 10, ...)
 
-对于N = 5，第一个玩家的八个获胜第一步是：
+Players alternate turns. A player wins by turning the grid all black.
 
-找到W（106）。
+Let W(N) be the number of winning moves for the first player on a N by N board with all disks white, assuming perfect play. W(1) = 1, W(2) = 0, W(5) = 8 and W(102) = 31395.
+
+For N=5, the first player's eight winning first moves are:
+
+Find W(106).
 
 # --hints--
 
-`euler459()`应该返回3996390106631。
+`euler459()` should return 3996390106631.
 
 ```js
 assert.strictEqual(euler459(), 3996390106631);