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

45
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
View File

@ -1,45 +1,31 @@
---
id: 5900f4f11000cf542c510002
challengeType: 5
title: 'Problem 388: Distinct Lines'
challengeType: 5
forumTopicId: 302052
---
## Description
<section id='description'>
# --description--
Consider all lattice points (a,b,c) with 0 ≤ a,b,c ≤ N.
From the origin O(0,0,0) all lines are drawn to the other lattice points.
Let D(N) be the number of distinct such lines.
From the origin O(0,0,0) all lines are drawn to the other lattice points. Let D(N) be the number of distinct such lines.
You are given that D(1 000 000) = 831909254469114121.
Find D(1010). Give as your answer the first nine digits followed by the last nine digits.
</section>
## Instructions
<section id='instructions'>
# --hints--
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler388()</code> should return 831907372805130000.
testString: assert.strictEqual(euler388(), 831907372805130000);
`euler388()` should return 831907372805130000.
```js
assert.strictEqual(euler388(), 831907372805130000);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler388() {
@ -50,17 +36,8 @@ function euler388() {
euler388();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>