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,40 +1,29 @@
---
id: 5900f4de1000cf542c50fff0
challengeType: 5
title: 'Problem 369: Badugi'
challengeType: 5
forumTopicId: 302030
---
## Description
<section id='description'>
# --description--
In a standard 52 card deck of playing cards, a set of 4 cards is a Badugi if it contains 4 cards with no pairs and no two cards of the same suit.
Let f(n) be the number of ways to choose n cards with a 4 card subset that is a Badugi. For example, there are 2598960 ways to choose five cards from a standard 52 card deck, of which 514800 contain a 4 card subset that is a Badugi, so f(5) = 514800.
Let f(n) be the number of ways to choose n cards with a 4 card subset that is a Badugi. For example, there are 2598960 ways to choose five cards from a standard 52 card deck, of which 514800 contain a 4 card subset that is a Badugi, so f(5) = 514800.
Find ∑f(n) for 4 ≤ n ≤ 13.
</section>
Find ∑f(n) for 4 ≤ n ≤ 13.
## Instructions
<section id='instructions'>
# --hints--
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler369()</code> should return 862400558448.
testString: assert.strictEqual(euler369(), 862400558448);
`euler369()` should return 862400558448.
```js
assert.strictEqual(euler369(), 862400558448);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler369() {
@ -45,17 +34,8 @@ function euler369() {
euler369();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>