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,33 @@
---
id: 5900f3a81000cf542c50febb
challengeType: 5
title: 'Problem 60: Prime pair sets'
challengeType: 5
forumTopicId: 302172
---
## Description
<section id='description'>
# --description--
The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property.
Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime.
</section>
# --hints--
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>primePairSets()</code> should return a number.
testString: assert(typeof primePairSets() === 'number');
- text: <code>primePairSets()</code> should return 26033.
testString: assert.strictEqual(primePairSets(), 26033);
`primePairSets()` should return a number.
```js
assert(typeof primePairSets() === 'number');
```
</section>
`primePairSets()` should return 26033.
## Challenge Seed
<section id='challengeSeed'>
```js
assert.strictEqual(primePairSets(), 26033);
```
<div id='js-seed'>
# --seed--
## --seed-contents--
```js
function primePairSets() {
@ -47,17 +38,8 @@ function primePairSets() {
primePairSets();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>