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

Feat: add new Markdown parser (#39800)

Browse Source 
and change all the challenges to new `md` format.
This commit is contained in:
Oliver Eyton-Williams
2020-11-27 19:02:05 +01:00
committed by GitHub
parent a07f84c8ec
commit 0bd52f8bd1
2580 changed files with 113436 additions and 111979 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1,42 +1,31 @@
---
id: 5900f4f61000cf542c510008
challengeType: 5
title: 'Problem 393: Migrating ants'
challengeType: 5
forumTopicId: 302058
---
## Description
<section id='description'>
An n×n grid of squares contains n2 ants, one ant per square.
# --description--
An n×n grid of squares contains n2 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.
You are given that f(4) = 88. Find f(10).
You are given that f(4) = 88.
Find f(10).
</section>
# --hints--
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler393()</code> should return 112398351350823100.
testString: assert.strictEqual(euler393(), 112398351350823100);
`euler393()` should return 112398351350823100.
```js
assert.strictEqual(euler393(), 112398351350823100);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler393() {
@ -47,17 +36,8 @@ function euler393() {
euler393();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>