chore(i8n,learn): processed translations
This commit is contained in:
committed by
Mrugesh Mohapatra
parent
15047f2d90
commit
e5c44a3ae5
@ -1,22 +1,22 @@
|
||||
---
|
||||
id: 5900f4841000cf542c50ff97
|
||||
title: 问题280:蚂蚁和种子
|
||||
title: 'Problem 280: Ant and seeds'
|
||||
challengeType: 5
|
||||
videoUrl: ''
|
||||
forumTopicId: 301931
|
||||
dashedName: problem-280-ant-and-seeds
|
||||
---
|
||||
|
||||
# --description--
|
||||
|
||||
费力的蚂蚁在5x5的网格上随机行走。 步行从中央广场开始。 在每个步骤中,蚂蚁都会随机移动到相邻的正方形,而不会离开网格。 因此,根据蚂蚁的位置,每一步有2、3或4种可能的移动。
|
||||
A laborious ant walks randomly on a 5x5 grid. The walk starts from the central square. At each step, the ant moves to an adjacent square at random, without leaving the grid; thus there are 2, 3 or 4 possible moves at each step depending on the ant's position.
|
||||
|
||||
步行开始时,将种子放在下排的每个正方形上。 当蚂蚁不携带种子并到达包含种子的下排的正方形时,它将开始携带种子。 蚂蚁会将种子放在最终到达的上一行的第一个空方格上。
|
||||
At the start of the walk, a seed is placed on each square of the lower row. When the ant isn't carrying a seed and reaches a square of the lower row containing a seed, it will start to carry the seed. The ant will drop the seed on the first empty square of the upper row it eventually reaches.
|
||||
|
||||
在将所有种子都放到第一行之前,预期的步骤数是多少? 将答案四舍五入到小数点后六位。
|
||||
What's the expected number of steps until all seeds have been dropped in the top row? Give your answer rounded to 6 decimal places.
|
||||
|
||||
# --hints--
|
||||
|
||||
`euler280()`应该返回430.088247。
|
||||
`euler280()` should return 430.088247.
|
||||
|
||||
```js
|
||||
assert.strictEqual(euler280(), 430.088247);
|
||||
|
Reference in New Issue
Block a user