chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md

@@ -1,20 +1,24 @@
 ---
 id: 5900f4f61000cf542c510008
-title: 问题393：迁移蚂蚁
+title: 'Problem 393: Migrating ants'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302058
 dashedName: problem-393-migrating-ants
 ---
 
 # --description--
 
-n×n正方形网格包含n2个蚂蚁，每平方一个蚂蚁。所有蚂蚁决定同时移动到相邻的广场（通常有4种可能，除了网格边缘或角落处的蚂蚁）。我们将f（n）定义为在没有任何蚂蚁在同一个正方形上结束并且没有任何两个蚂蚁穿过两个正方形之间的相同边缘时可以发生的方式的数量。
+An n×n grid of squares contains n2 ants, one ant per square.
 
-给出f（4）= 88.求f（10）。
+All ants decide to move simultaneously to an adjacent square (usually 4 possibilities, except for ants on the edge of the grid or at the corners).
+
+We define f(n) to be the number of ways this can happen without any ants ending on the same square and without any two ants crossing the same edge between two squares.
+
+You are given that f(4) = 88. Find f(10).
 
 # --hints--
 
-`euler393()`应该返回112398351350823100。
+`euler393()` should return 112398351350823100.
 
 ```js
 assert.strictEqual(euler393(), 112398351350823100);