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,27 @@
---
id: 5900f47e1000cf542c50ff90
challengeType: 5
title: 'Problem 273: Sum of Squares'
challengeType: 5
forumTopicId: 301923
---
## Description
<section id='description'>
# --description--
Consider equations of the form: a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer.
For N=65 there are two solutions:
a=1, b=8 and a=4, b=7.
We call S(N) the sum of the values of a of all solutions of a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer.
Thus S(65) = 1 + 4 = 5.
Find ∑S(N), for all squarefree N only divisible by primes of the form 4k+1 with 4k+1 < 150.
</section>
For N=65 there are two solutions: a=1, b=8 and a=4, b=7. We call S(N) the sum of the values of a of all solutions of a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer. Thus S(65) = 1 + 4 = 5. Find ∑S(N), for all squarefree N only divisible by primes of the form 4k+1 with 4k+1 &lt; 150.
## Instructions
<section id='instructions'>
# --hints--
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler273()</code> should return 2032447591196869000.
testString: assert.strictEqual(euler273(), 2032447591196869000);
`euler273()` should return 2032447591196869000.
```js
assert.strictEqual(euler273(), 2032447591196869000);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler273() {
@ -47,17 +32,8 @@ function euler273() {
euler273();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>