gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix(curriculum): clean-up Project Euler 381-400 (#43024)

Browse Source 
* fix: clean-up Project Euler 381-400

* fix: missing image extension

* fix: missing subscripts

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
This commit is contained in:
gikf
2021-07-30 16:59:29 +02:00
committed by GitHub
parent 594adf02c1
commit d269909faa
20 changed files with 279 additions and 180 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
View File

@ -8,20 +8,22 @@ dashedName: problem-393-migrating-ants
# --description--
An n×n grid of squares contains n2 ants, one ant per square.
An $n × n$ grid of squares contains $n^2$ ants, one ant per square.
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.
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).
You are given that $f(4) = 88$.
Find $f(10)$.
# --hints--
`euler393()` should return 112398351350823100.
`migratingAnts()` should return `112398351350823100`.
```js
assert.strictEqual(euler393(), 112398351350823100);
assert.strictEqual(migratingAnts(), 112398351350823100);
```
# --seed--
@ -29,12 +31,12 @@ assert.strictEqual(euler393(), 112398351350823100);
## --seed-contents--
```js
function euler393() {
function migratingAnts() {
return true;
}
euler393();
migratingAnts();
```
# --solutions--