gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Feat: add new Markdown parser (#39800)

Browse Source 
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
Download Patch File Download Diff File Expand all files Collapse all files

46
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
View File

@ -1,42 +1,27 @@
---
id: 5900f4e11000cf542c50fff3
challengeType: 5
title: 'Problem 372: Pencils of rays'
challengeType: 5
forumTopicId: 302034
---
## Description
<section id='description'>
Let R(M, N) be the number of lattice points (x, y) which satisfy M<x≤N, M<y≤N and is odd.
We can verify that R(0, 100) = 3019 and R(100, 10000) = 29750422.
Find R(2·106, 109).
# --description--
Let R(M, N) be the number of lattice points (x, y) which satisfy M
Note: represents the floor function.
Note: represents the floor function.
</section>
# --hints--
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler372()</code> should return 301450082318807040.
testString: assert.strictEqual(euler372(), 301450082318807040);
`euler372()` should return 301450082318807040.
```js
assert.strictEqual(euler372(), 301450082318807040);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler372() {
@ -47,17 +32,8 @@ function euler372() {
euler372();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>