Feat: add new Markdown parser (#39800)

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

View File

@ -1,42 +1,35 @@
---
id: 5900f5061000cf542c510017
challengeType: 5
title: 'Problem 409: Nim Extreme'
challengeType: 5
forumTopicId: 302077
---
## Description
<section id='description'>
# --description--
Let n be a positive integer. Consider nim positions where:There are n non-empty piles.
Each pile has size less than 2n.
No two piles have the same size.
Let W(n) be the number of winning nim positions satisfying the above
conditions (a position is winning if the first player has a winning strategy). For example, W(1) = 1, W(2) = 6, W(3) = 168, W(5) = 19764360 and W(100) mod 1 000 000 007 = 384777056.
Find W(10 000 000) mod 1 000 000 007.
</section>
conditions (a position is winning if the first player has a winning strategy). For example, W(1) = 1, W(2) = 6, W(3) = 168, W(5) = 19764360 and W(100) mod 1 000 000 007 = 384777056.
## Instructions
<section id='instructions'>
Find W(10 000 000) mod 1 000 000 007.
</section>
# --hints--
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler409()</code> should return 253223948.
testString: assert.strictEqual(euler409(), 253223948);
`euler409()` should return 253223948.
```js
assert.strictEqual(euler409(), 253223948);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler409() {
@ -47,17 +40,8 @@ function euler409() {
euler409();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>