chore(i8n,learn): processed translations
This commit is contained in:
committed by
Mrugesh Mohapatra
parent
15047f2d90
commit
e5c44a3ae5
@ -0,0 +1,42 @@
|
||||
---
|
||||
id: 5900f4411000cf542c50ff54
|
||||
title: 'Problem 213: Flea Circus'
|
||||
challengeType: 5
|
||||
forumTopicId: 301855
|
||||
dashedName: problem-213-flea-circus
|
||||
---
|
||||
|
||||
# --description--
|
||||
|
||||
A 30×30 grid of squares contains 900 fleas, initially one flea per square.
|
||||
|
||||
When a bell is rung, each flea jumps to an adjacent square at random (usually 4 possibilities, except for fleas on the edge of the grid or at the corners).
|
||||
|
||||
What is the expected number of unoccupied squares after 50 rings of the bell? Give your answer rounded to six decimal places.
|
||||
|
||||
# --hints--
|
||||
|
||||
`euler213()` should return 330.721154.
|
||||
|
||||
```js
|
||||
assert.strictEqual(euler213(), 330.721154);
|
||||
```
|
||||
|
||||
# --seed--
|
||||
|
||||
## --seed-contents--
|
||||
|
||||
```js
|
||||
function euler213() {
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
euler213();
|
||||
```
|
||||
|
||||
# --solutions--
|
||||
|
||||
```js
|
||||
// solution required
|
||||
```
|
Reference in New Issue
Block a user