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,39 +1,31 @@
---
id: 5900f3e41000cf542c50fef6
challengeType: 5
title: 'Problem 119: Digit power sum'
challengeType: 5
forumTopicId: 301745
---
## Description
<section id='description'>
# --description--
The number 512 is interesting because it is equal to the sum of its digits raised to some power: 5 + 1 + 2 = 8, and 83 = 512. Another example of a number with this property is 614656 = 284.
We shall define an to be the nth term of this sequence and insist that a number must contain at least two digits to have a sum.
You are given that a2 = 512 and a10 = 614656.
Find a30.
</section>
## Instructions
<section id='instructions'>
# --hints--
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler119()</code> should return 248155780267521.
testString: assert.strictEqual(euler119(), 248155780267521);
`euler119()` should return 248155780267521.
```js
assert.strictEqual(euler119(), 248155780267521);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler119() {
@ -44,17 +36,8 @@ function euler119() {
euler119();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>